numerical 0.1.5

Algorithm for numerical analysis
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
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
105
106
107
108
109
110

use core::marker::PhantomData;
use core::ops::{Deref, DerefMut, Index, IndexMut};

macro_rules! impl_vec_storage_for_array {
    ( $( $n:literal ),* ) => {
        $(
            impl<T> LinearStorageLen for [T; $n] {
                #[inline]
                fn len(&self) -> usize {
                    $n
                }
                #[inline]
                fn is_empty(&self) -> bool {
                    $n == 0
                }
            }

            impl<T> VecStorage<T> for [T; $n] {}
        )*
    };
}

pub trait LinearStorageLen {
    fn len(&self) -> usize;
    fn is_empty(&self) -> bool;
}

pub trait VecStorage<T>: LinearStorageLen + IndexMut<usize> + Index<usize, Output = T> {}

impl_vec_storage_for_array!(
    0, 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
);

impl<T> LinearStorageLen for Vec<T> {
    #[inline]
    fn len(&self) -> usize {
        self.len()
    }
    #[inline]
    fn is_empty(&self) -> bool {
        self.is_empty()
    }
}

impl<T> VecStorage<T> for Vec<T> {}

/// Vector in mathematical sense
///
/// # Generic
/// * T: element type
/// * S: storage type (Array, Vec etc.)
pub struct Vector<T, S: VecStorage<T>> {
    inner: S,
    phantom: PhantomData<T>,
}

impl<T, S: VecStorage<T>> Vector<T, S> {
    pub fn new(inner: S) -> Self {
        Self {
            inner,
            phantom: PhantomData,
        }
    }
}

impl<T, S: VecStorage<T>> LinearStorageLen for Vector<T, S> {
    fn is_empty(&self) -> bool {
        self.inner.is_empty()
    }
    fn len(&self) -> usize {
        self.inner.len()
    }
}

impl<T, S: VecStorage<T>> Index<usize> for Vector<T, S> {
    type Output = T;
    fn index(&self, index: usize) -> &Self::Output {
        &self.inner[index]
    }
}

impl<T, S: VecStorage<T>> IndexMut<usize> for Vector<T, S>
where
    S: IndexMut<usize> + Index<usize, Output = T>,
{
    fn index_mut(&mut self, index: usize) -> &mut Self::Output {
        &mut self.inner[index]
    }
}

impl<T, S: VecStorage<T>> Deref for Vector<T, S> {
    type Target = S;

    fn deref(&self) -> &Self::Target {
        &self.inner
    }
}

impl<T, S: VecStorage<T>> DerefMut for Vector<T, S> {
    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.inner
    }
}

impl<T> From<Vec<T>> for Vector<T, Vec<T>> {
    fn from(value: Vec<T>) -> Self {
        Vector::new(value)
    }
}