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
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
use alloc::rc::Rc;
use crate::union_iter_map::UnionIterMap;
use crate::{Integer, RangeMapBlaze};
use core::ops::RangeInclusive;
// We create a RangeMapBlaze from an iterator of integers or integer ranges by
// 1. turning them into a UnionIterMap (internally, it collects into intervals and sorts by start).
// 2. Turning the SortedDisjointMap into a BTreeMap.
impl<'a, T, V> FromIterator<(T, &'a V)> for RangeMapBlaze<T, V>
where
T: Integer,
V: Eq + Clone + 'a,
{
/// Create a [`RangeMapBlaze`] from an iterator of integers. Duplicates and out-of-order elements are fine.
///
/// In case of overlapping keys, the last (right-most) value overrides the previous ones.
///
/// *For more about constructors and performance, see [`RangeMapBlaze` Constructors](struct.RangeMapBlaze.html#rangemapblaze-constructors).*
///
/// # Examples
///
/// ```
/// use range_set_blaze::RangeMapBlaze;
///
/// let a0 = RangeMapBlaze::from_iter([(1, &"c"), (3, &"a"), (2, &"a"), (1, &"a"), (100, &"b")]);
/// let a1: RangeMapBlaze<i32, &str> = [ (1, &"c"), (3, &"a"), (2, &"a"), (1, &"a"), (100, &"b")].into_iter().collect();
/// assert!(a0 == a1 && a0.to_string() == r#"(1..=3, "a"), (100..=100, "b")"#);
/// ```
fn from_iter<I>(iter: I) -> Self
where
I: IntoIterator<Item = (T, &'a V)>,
{
iter.into_iter().map(|(x, r)| (x..=x, r)).collect()
}
}
impl<'a, T, V> FromIterator<(RangeInclusive<T>, &'a V)> for RangeMapBlaze<T, V>
where
T: Integer,
V: Eq + Clone,
{
/// Create a [`RangeMapBlaze`] from an iterator of inclusive ranges, `start..=end`.
/// Overlapping, out-of-order, and empty ranges are fine.
///
/// In case of overlapping keys, the last (right-most) value overrides the previous ones.
///
/// *For more about constructors and performance, see [`RangeMapBlaze` Constructors](struct.RangeMapBlaze.html#rangemapblaze-constructors).*
///
/// # Examples
///
/// ```
/// use range_set_blaze::prelude::*;
///
/// #[allow(clippy::reversed_empty_ranges)]
/// let a0 = RangeMapBlaze::from_iter([(1..=0, &"d"), (-10..=-5, &"c"), (2..=2, &"b"), (1..=2, &"a")]);
/// #[allow(clippy::reversed_empty_ranges)]
/// let a1: RangeMapBlaze<i32, &str> = [(1..=0, &"d"), (-10..=-5, &"c"), (2..=2, &"b"), (1..=2, &"a")].into_iter().collect();
/// assert!(a0 == a1 && a0.to_string() == r#"(-10..=-5, "c"), (1..=2, "a")"#);
/// ```
fn from_iter<I>(iter: I) -> Self
where
I: IntoIterator<Item = (RangeInclusive<T>, &'a V)>,
{
let iter = iter.into_iter();
let union_iter_map: UnionIterMap<T, &V, _> = iter.collect();
Self::from_sorted_disjoint_map(union_iter_map)
}
}
impl<T: Integer, V: Eq + Clone> FromIterator<(RangeInclusive<T>, V)> for RangeMapBlaze<T, V> {
/// Create a [`RangeMapBlaze`] from an iterator of inclusive ranges, `start..=end`.
/// Overlapping, out-of-order, and empty ranges are fine.
///
/// In case of overlapping ranges, the last (right-most) value overrides the previous ones.
///
/// *For more about constructors and performance, see [`RangeMapBlaze` Constructors](struct.RangeMapBlaze.html#rangemapblaze-constructors).*
///
/// # Examples
///
/// ```
/// use range_set_blaze::RangeMapBlaze;
///
/// #[allow(clippy::reversed_empty_ranges)]
/// let a0 = RangeMapBlaze::from_iter([(2..=2, "b"), (1..=2, "a"), (-10..=-5, "c"), (1..=0, "d")]);
/// #[allow(clippy::reversed_empty_ranges)]
/// let a1: RangeMapBlaze<i32, &str> = [(2..=2, "b"), (1..=2, "a"), (-10..=-5, "c"), (1..=0, "d")].into_iter().collect();
/// assert!(a0 == a1 && a0.to_string() == r#"(-10..=-5, "c"), (1..=2, "a")"#);
/// ```
fn from_iter<I>(iter: I) -> Self
where
I: IntoIterator<Item = (RangeInclusive<T>, V)>,
{
let union_iter_map = iter
.into_iter()
.map(|(r, v)| (r, Rc::new(v)))
.collect::<UnionIterMap<T, Rc<V>, _>>();
Self::from_sorted_disjoint_map(union_iter_map)
}
}
impl<T: Integer, V: Eq + Clone> FromIterator<(T, V)> for RangeMapBlaze<T, V> {
/// Create a [`RangeMapBlaze`] from an iterator of pairs (integer, value).
/// Overlapping, out-of-order, and empty ranges are fine.
///
/// In case of overlapping keys, the last (right-most) value overrides the previous ones.
///
/// *For more about constructors and performance, see [`RangeMapBlaze` Constructors](struct.RangeMapBlaze.html#rangemapblaze-constructors).*
///
/// # Examples
///
/// ```
/// use range_set_blaze::prelude::*;
///
/// #[allow(clippy::reversed_empty_ranges)]
/// let a0 = RangeMapBlaze::from_iter([(1, "c"), (3, "a"), (2, "a"), (1, "a"), (100, "b")]);
/// let a1: RangeMapBlaze<i32, &str> = [(1, "c"), (3, "a"), (2, "a"), (1, "a"), (100, "b")].into_iter().collect();
/// assert!(a0 == a1 && a0.to_string() == r#"(1..=3, "a"), (100..=100, "b")"#);
/// ```
fn from_iter<I>(iter: I) -> Self
where
I: IntoIterator<Item = (T, V)>,
{
iter.into_iter().map(|(k, v)| (k..=k, v)).collect()
}
}
impl<'a, T, V> FromIterator<&'a (T, &'a V)> for RangeMapBlaze<T, V>
where
T: Integer,
V: Eq + Clone + 'a,
{
/// Create a [`RangeMapBlaze`] from an iterator of integers. Duplicates and out-of-order elements are fine.
///
/// In case of overlapping keys, the last (right-most) value overrides the previous ones.
///
/// *For more about constructors and performance, see [`RangeMapBlaze` Constructors](struct.RangeMapBlaze.html#rangemapblaze-constructors).*
///
/// # Examples
///
/// ```
/// use range_set_blaze::RangeMapBlaze;
///
/// let v = vec![(1, &"c"), (100, &"b"), (1, &"a"), (2, &"a"), (3, &"a")];
/// let a0 = RangeMapBlaze::from_iter(&v);
/// let a1: RangeMapBlaze<i32, &str> = (&v).into_iter().collect();
/// assert!(a0 == a1 && a0.to_string() == r#"(1..=3, "a"), (100..=100, "b")"#);
/// ```
fn from_iter<I>(iter: I) -> Self
where
I: IntoIterator<Item = &'a (T, &'a V)>,
{
iter.into_iter().map(|&(x, r)| (x..=x, r)).collect()
}
}
impl<'a, T, V> FromIterator<&'a (RangeInclusive<T>, &'a V)> for RangeMapBlaze<T, V>
where
T: Integer,
V: Eq + Clone,
{
/// Create a [`RangeMapBlaze`] from an iterator of inclusive ranges, `start..=end`.
/// Overlapping, out-of-order, and empty ranges are fine.
///
/// In case of overlapping ranges, the last (right-most) value overrides the previous ones.
///
/// /// *For more about constructors and performance, see [`RangeMapBlaze` Constructors](struct.RangeMapBlaze.html#rangemapblaze-constructors).*
///
/// # Examples
///
/// ```
/// use range_set_blaze::prelude::*;
///
/// let v = vec![(1..=0, &"d"), (-10..=-5, &"c"), (2..=2, &"b"), (1..=2, &"a")];
/// let a0: RangeMapBlaze<i32, &str> = RangeMapBlaze::from_iter(&v);
/// let a1: RangeMapBlaze<i32, &str> = (&v).into_iter().collect();
/// assert!(a0 == a1 && a0.to_string() == r#"(-10..=-5, "c"), (1..=2, "a")"#);
/// ```
fn from_iter<I>(iter: I) -> Self
where
I: IntoIterator<Item = &'a (RangeInclusive<T>, &'a V)>,
{
iter.into_iter().map(|(r, v)| (r.clone(), *v)).collect()
}
}
impl<'a, T: Integer, V: Eq + Clone> FromIterator<&'a (RangeInclusive<T>, V)>
for RangeMapBlaze<T, V>
{
/// Create a [`RangeMapBlaze`] from an iterator of inclusive ranges, `start..=end`.
/// Overlapping, out-of-order, and empty ranges are fine.
///
/// In case of overlapping ranges, the last (right-most) value overrides the previous ones.
///
/// /// *For more about constructors and performance, see [`RangeMapBlaze` Constructors](struct.RangeMapBlaze.html#rangemapblaze-constructors).*
///
/// # Examples
///
/// ```
/// use range_set_blaze::prelude::*;
///
/// #[allow(clippy::reversed_empty_ranges)]
/// let vec_range = vec![(1..=0, "d"), (-10..=-5, "c"), (2..=2, "b"), (1..=2, "a") ];
/// let a0 = RangeMapBlaze::from_iter(&vec_range);
/// let a1: RangeMapBlaze<i32, &str> = vec_range.iter().collect();
/// assert!(a0 == a1 && a0.to_string() == r#"(-10..=-5, "c"), (1..=2, "a")"#);
/// ```
fn from_iter<I>(iter: I) -> Self
where
I: IntoIterator<Item = &'a (RangeInclusive<T>, V)>,
{
iter.into_iter().map(|(r, v)| (r.clone(), v)).collect()
}
}
impl<'a, T: Integer, V: Eq + Clone> FromIterator<&'a (T, V)> for RangeMapBlaze<T, V> {
/// Create a [`RangeMapBlaze`] from an iterator of inclusive ranges, `start..=end`.
/// Overlapping, out-of-order, and empty ranges are fine.
///
/// In case of overlapping keys, the last (right-most) value overrides the previous ones.
///
/// *For more about constructors and performance, see [`RangeMapBlaze` Constructors](struct.RangeMapBlaze.html#rangemapblaze-constructors).*
///
/// # Examples
///
/// ```
/// use range_set_blaze::prelude::*;
///
/// let v = vec![(2, "b"), (2, "a"), (1, "a")];
/// let a0 = RangeMapBlaze::from_iter(&v);
/// let a1: RangeMapBlaze<i32, &str> = v.iter().collect();
/// assert!(a0 == a1 && a0.to_string() == r#"(1..=2, "a")"#);
/// ```
fn from_iter<I>(iter: I) -> Self
where
I: IntoIterator<Item = &'a (T, V)>,
{
iter.into_iter()
.map(|(k, v)| {
let k = *k;
(k..=k, v)
})
.collect()
}
}