eta-algorithms 1.20.0

Low overhead data structures focused on performance
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68

use crate::data_structs::array::Array;
use crate::data_structs::fat_ptr::{FatPtr, FatPtrMut};

#[test]
pub fn fat_ptr_test(){
    let mut array = Array::new(10);
    for i in 0..10 {
        array[i] = i;
    }
    let mut fat_ptr = FatPtr::from_slice(array.as_slice());

    for i in 0..10 {
        unsafe{
            assert_eq!(*fat_ptr.ptr, i);
            fat_ptr.ptr = fat_ptr.ptr.offset(1);
        }
    }
}

#[test]
pub fn fat_ptr_mut_test(){
    let mut array = Array::new(10);
    for i in 0..10 {
        array[i] = i;
    }
    let fat_ptr = FatPtrMut::from_mut_slice(array.as_mut_slice());

    for i in 0..10 {
        unsafe{
            *fat_ptr.ptr.add(i) = 100 + i;
        }
    }

    for i in 0..10 {
        unsafe{
            assert_eq!(*fat_ptr.ptr.add(i), 100 + i);
        }
    }
}

#[test]
pub fn fat_ptr_iter_test(){
    let mut array = Array::new(10);
    for i in 0..10 {
        array[i] = i;
    }
    let fat_ptr = FatPtr::from_slice(array.as_slice());

    for (idx, i) in fat_ptr.enumerate() {
        assert_eq!(*i, idx);
    }
}

#[test]
pub fn fat_ptr_mut_iter_test() {
    let mut array = Array::new_default_bytes(10, 0);
    let mut fat_ptr = FatPtrMut::from_mut_slice(array.as_mut_slice());

    for (idx, i) in fat_ptr.enumerate() {
        *i = idx;
    }

    fat_ptr = FatPtrMut::from_mut_slice(array.as_mut_slice());

    for (idx, i) in fat_ptr.enumerate() {
        assert_eq!(*i, idx);
    }
}