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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
//! The module contains a [`Locator`] trait and implementations for it.
use core::ops::Bound;
use std::{
iter::{self, Once},
ops::{Range, RangeBounds},
};
use crate::{
grid::config::Entity,
grid::records::{ExactRecords, PeekableRecords, Records},
settings::object::{
Column, Columns, FirstColumn, FirstRow, LastColumn, LastRow, Object, Row, Rows,
},
};
/// Locator is an interface which searches for a particular thing in the [`Records`],
/// and returns coordinate of the foundings if any.
pub trait Locator<Records> {
/// A coordinate of the finding.
type Coordinate;
/// An iterator of the coordinates.
/// If it's empty it's considered that nothing is found.
type IntoIter: IntoIterator<Item = Self::Coordinate>;
/// Search for the thing in [`Records`], returning a list of coordinates.
fn locate(&mut self, records: Records) -> Self::IntoIter;
}
impl<B, R> Locator<R> for Columns<B>
where
B: RangeBounds<usize>,
R: Records,
{
type Coordinate = usize;
type IntoIter = Range<usize>;
fn locate(&mut self, records: R) -> Self::IntoIter {
let range = self.get_range();
let max = records.count_columns();
let (from, to) = bounds_to_usize(range.start_bound(), range.end_bound(), max);
from..to
}
}
impl<R> Locator<R> for Column {
type Coordinate = usize;
type IntoIter = Once<usize>;
fn locate(&mut self, _: R) -> Self::IntoIter {
iter::once((*self).into())
}
}
impl<R> Locator<R> for FirstColumn {
type Coordinate = usize;
type IntoIter = Once<usize>;
fn locate(&mut self, _: R) -> Self::IntoIter {
iter::once(0)
}
}
impl<R> Locator<R> for LastColumn
where
R: Records,
{
type Coordinate = usize;
type IntoIter = Once<usize>;
fn locate(&mut self, records: R) -> Self::IntoIter {
if records.count_columns() > 0 {
iter::once(records.count_columns() - 1)
} else {
iter::once(0)
}
}
}
impl<B, R> Locator<R> for Rows<B>
where
R: Records,
B: RangeBounds<usize>,
{
type Coordinate = usize;
type IntoIter = Range<usize>;
fn locate(&mut self, records: R) -> Self::IntoIter {
let (from, to) = bounds_to_usize(
self.get_range().start_bound(),
self.get_range().end_bound(),
records.count_columns(),
);
from..to
}
}
impl<R> Locator<R> for Row {
type Coordinate = usize;
type IntoIter = Once<usize>;
fn locate(&mut self, _: R) -> Self::IntoIter {
iter::once((*self).into())
}
}
impl<R> Locator<R> for FirstRow {
type Coordinate = usize;
type IntoIter = Once<usize>;
fn locate(&mut self, _: R) -> Self::IntoIter {
iter::once(0)
}
}
impl<R> Locator<R> for LastRow
where
R: ExactRecords,
{
type Coordinate = usize;
type IntoIter = Once<usize>;
fn locate(&mut self, records: R) -> Self::IntoIter {
if records.count_rows() > 0 {
iter::once(records.count_rows() - 1)
} else {
iter::once(0)
}
}
}
/// The structure is an implementation of [`Locator`] to search for a column by it's name.
/// A name is considered be a value in a first row.
///
/// So even if in reality there's no header, the first row will be considered to be one.
#[derive(Debug, Clone, Copy)]
pub struct ByColumnName<S>(S);
impl<S> ByColumnName<S> {
/// Constructs a new object of the structure.
pub fn new(text: S) -> Self
where
S: AsRef<str>,
{
Self(text)
}
}
impl<R, S> Locator<R> for ByColumnName<S>
where
S: AsRef<str>,
R: Records + ExactRecords + PeekableRecords,
{
type Coordinate = usize;
type IntoIter = Vec<usize>;
fn locate(&mut self, records: R) -> Self::IntoIter {
// todo: can be optimized by creating Iterator
(0..records.count_columns())
.filter(|col| records.get_text((0, *col)) == self.0.as_ref())
.collect::<Vec<_>>()
}
}
impl<S, R> Object<R> for ByColumnName<S>
where
S: AsRef<str>,
R: Records + PeekableRecords + ExactRecords,
{
type Iter = std::vec::IntoIter<Entity>;
fn cells(&self, records: &R) -> Self::Iter {
// todo: can be optimized by creating Iterator
(0..records.count_columns())
.filter(|col| records.get_text((0, *col)) == self.0.as_ref())
.map(Entity::Column)
.collect::<Vec<_>>()
.into_iter()
}
}
fn bounds_to_usize(
left: Bound<&usize>,
right: Bound<&usize>,
count_elements: usize,
) -> (usize, usize) {
match (left, right) {
(Bound::Included(x), Bound::Included(y)) => (*x, y + 1),
(Bound::Included(x), Bound::Excluded(y)) => (*x, *y),
(Bound::Included(x), Bound::Unbounded) => (*x, count_elements),
(Bound::Unbounded, Bound::Unbounded) => (0, count_elements),
(Bound::Unbounded, Bound::Included(y)) => (0, y + 1),
(Bound::Unbounded, Bound::Excluded(y)) => (0, *y),
(Bound::Excluded(_), Bound::Unbounded)
| (Bound::Excluded(_), Bound::Included(_))
| (Bound::Excluded(_), Bound::Excluded(_)) => {
unreachable!("A start bound can't be excluded")
}
}
}
|
