rotta_rs 0.0.5

a Deep Learning library with rust language
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
69
70
71
72
73
74
75

use crate::rotta_rs_module::arrayy::*;

pub fn permute_arr(order: &Vec<usize>, arr: &Arrayy) -> Arrayy {
    let shape = arr.shape.clone();

    let mut permute_shape = vec![];
    if order.len() != shape.len() {
        panic!(
            "permute list out of array shape, permute list is {:?}, but array shape is {:?}",
            order,
            shape
        );
    }
    for i in order {
        if i >= &shape.len() {
            panic!(
                "permute list out of array shape, permute list is {:?}, but array shape is {:?}",
                order,
                shape
            );
        }
        permute_shape.push(shape[*i]);
    }

    let mut output = Arrayy::from_vector(permute_shape, vec![0.0; arr.value.len()]);
    let mut index = vec![];
    let mut current_d = 0;
    loop {
        if current_d >= shape.len() - 1 {
            // kolom
            if let None = index.get(current_d) {
                index.push(0);
            } else {
                // operation do here
                let mut permute_index = vec![];
                for i in order {
                    permute_index.push(index[*i] as i32);
                }
                output.index_mut(permute_index, arr.index(index.clone()));

                if index[current_d] < ((*shape.last().unwrap() - 1) as i32) {
                    index[current_d] += 1;
                } else {
                    index.pop();

                    if current_d == 0 {
                        break;
                    } else {
                        current_d -= 1;
                    }
                }
            }
        } else {
            if let None = index.get(current_d) {
                index.push(0);
                current_d += 1;
            } else {
                if index[current_d] < ((shape[current_d] - 1) as i32) {
                    index[current_d] += 1;
                    current_d += 1;
                } else {
                    index.pop();

                    if current_d == 0 {
                        break;
                    } else {
                        current_d -= 1;
                    }
                }
            }
        }
    }

    output
}