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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
use std::ops::{Index, IndexMut};
use num::Num;
#[derive(Debug, Clone, Default)]
pub struct Ndarray<T>
where
T: Num + Clone,
{
pub data: Vec<T>,
pub shape: Vec<usize>,
pub stride: Vec<usize>,
}
impl<T> Ndarray<T>
where
T: Num + Clone,
{
pub fn new(shape: &[usize], default: T) -> Self {
let d = shape.len();
let mut size = 1;
shape.iter().for_each(|x| size *= x);
let data = vec![default; size];
let mut stride = vec![0; d];
let mut s = 1;
for i in (0..d).rev() {
stride[i] = s;
s *= shape[i];
}
Self {
data,
shape: shape.to_vec(),
stride,
}
}
pub fn index(&self, coords: &[usize]) -> usize {
coords
.iter()
.zip(self.stride.iter())
.map(|(a, b)| a * b)
.sum()
}
pub fn contains(&self, coords: &[usize]) -> bool {
!coords.iter().zip(self.shape.iter()).any(|(&a, &b)| a >= b)
}
}
impl<T: Num + Clone> Index<&[usize]> for Ndarray<T> {
type Output = T;
fn index(&self, index: &[usize]) -> &Self::Output {
&self.data.get(self.index(index)).unwrap()
}
}
impl<T: Num + Clone> IndexMut<&[usize]> for Ndarray<T> {
fn index_mut(&mut self, index: &[usize]) -> &mut Self::Output {
let index = self.index(index);
self.data.get_mut(index).unwrap()
}
}
pub fn ndarray<T: Num + Clone>(shape: &[usize], default: T) -> Ndarray<T> {
Ndarray::new(shape, default)
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn ndarray_works() {
let mut data = ndarray(&[3, 5, 3], 0);
assert_eq!(data.shape, vec![3, 5, 3]);
assert_eq!(data.stride, vec![15, 3, 1]);
data[&[1, 2, 3]] = 5;
assert_eq!(data[&[1, 2, 3]], 5);
}
}