oat_rust 0.2.0

User-friendly tools for applied topology
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
111
112
113
114
115
116
117
118
119
120
121
122

//! Iterators representing sequences of rows or columns
//! 
//! This module provides some objects that are essentially wrappers for more complex objects that represent
//! sequences of rows and columns; their function is to help
//! keep code short and concise.


use crate::algebra::matrices::query::MatrixOracle;
use derive_new::new;




/// Contains a matrix and an iterable; returns one row of the matrix for each index returned by the iterable.
#[derive(Clone,Copy,Debug,new,PartialEq,Eq,Hash)]
pub struct SequenceOfRows
                < T, I > 
{
    matrix:                 T,
    row_index_iterator:     I,
}        

impl < T, I >

    Iterator for 
    
    SequenceOfRows
        < T, I > 

    where
        T:      MatrixOracle,
        I:      Iterator< Item = T::RowIndex >  
{
    type Item = T::Row;
    fn next(&mut self) -> Option<Self::Item> {
        self.row_index_iterator.next().map(|x| self.matrix.row(&x) )
    }
}   



/// Contains a matrix and an iterable; returns one row of the matrix (with order of entries reversed) for each index returned by the iterable.
#[derive(Clone,Copy,Debug,new,PartialEq,Eq,Hash)]
pub struct SequenceOfReverseRows
                < T, I >      
{
    matrix:     T,
    indices:    I,
}        

impl < T, I >

    Iterator for 
    
    SequenceOfReverseRows
        < T, I > 

    where
        T:      MatrixOracle,
        I:      Iterator< Item = T::RowIndex >  
{
    type Item = T::RowReverse;
    fn next(&mut self) -> Option<Self::Item> {
        self.indices.next().map(|x| self.matrix.row_reverse(&x) )
    }
}   


/// Contains a matrix and an iterable; returns one column of the matrix for each index returned by the iterable.
#[derive(Clone,Copy,Debug,new,PartialEq,Eq,Hash)]
pub struct SequenceOfColumns
                < T, I > 
{
    matrix:     T,
    indices:    I,
}        

impl < T, I >

    Iterator for 
    
    SequenceOfColumns
        < T, I > 

    where
        T:      MatrixOracle,
        I:      Iterator< Item = T::ColumnIndex >  
{
    type Item = T::Column;
    fn next(&mut self) -> Option<Self::Item> {
        self.indices.next().map(|x| self.matrix.column(&x) )
    }
}   


/// Contains a matrix and an iterable; returns one column of the matrix (with order of entries reversed) for each index returned by the iterable.
#[derive(Clone,Copy,Debug,new,PartialEq,Eq,Hash)]
pub struct SequenceOfReverseColumns
                < T, I >      
{
    matrix:     T,
    indices:    I,
}        

impl < T, I >

    Iterator for 
    
    SequenceOfReverseColumns
        < T, I > 

    where
        T:      MatrixOracle,
        I:      Iterator< Item = T::ColumnIndex >  
{
    type Item = T::ColumnReverse;
    fn next(&mut self) -> Option<Self::Item> {
        self.indices.next().map(|x| self.matrix.column_reverse(&x) )
    }
}