reifydb_type/value/container/
number.rs1use std::{
5 fmt::{self, Debug},
6 ops::Deref,
7 result::Result as StdResult,
8};
9
10use serde::{Deserialize, Deserializer, Serialize, Serializer};
11
12use crate::{
13 Result,
14 storage::{Cow, DataBitVec, DataVec, Storage},
15 util::cowvec::CowVec,
16 value::{Value, is::IsNumber},
17};
18
19pub struct NumberContainer<T, S: Storage = Cow>
20where
21 T: IsNumber,
22{
23 data: S::Vec<T>,
24}
25
26impl<T: IsNumber, S: Storage> Clone for NumberContainer<T, S> {
27 fn clone(&self) -> Self {
28 Self {
29 data: self.data.clone(),
30 }
31 }
32}
33
34impl<T: IsNumber + Debug, S: Storage> Debug for NumberContainer<T, S>
35where
36 S::Vec<T>: Debug,
37{
38 fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
39 f.debug_struct("NumberContainer").field("data", &self.data).finish()
40 }
41}
42
43impl<T: IsNumber, S: Storage> PartialEq for NumberContainer<T, S>
44where
45 S::Vec<T>: PartialEq,
46{
47 fn eq(&self, other: &Self) -> bool {
48 self.data == other.data
49 }
50}
51
52impl<T: IsNumber + Serialize> Serialize for NumberContainer<T, Cow> {
53 fn serialize<Ser: Serializer>(&self, serializer: Ser) -> StdResult<Ser::Ok, Ser::Error> {
54 #[derive(Serialize)]
55 struct Helper<'a, T: Clone + PartialEq + Serialize> {
56 data: &'a CowVec<T>,
57 }
58 Helper {
59 data: &self.data,
60 }
61 .serialize(serializer)
62 }
63}
64
65impl<'de, T: IsNumber + Deserialize<'de>> Deserialize<'de> for NumberContainer<T, Cow> {
66 fn deserialize<D: Deserializer<'de>>(deserializer: D) -> StdResult<Self, D::Error> {
67 #[derive(Deserialize)]
68 struct Helper<T: Clone + PartialEq> {
69 data: CowVec<T>,
70 }
71 let h = Helper::deserialize(deserializer)?;
72 Ok(NumberContainer {
73 data: h.data,
74 })
75 }
76}
77
78impl<T: IsNumber, S: Storage> Deref for NumberContainer<T, S> {
79 type Target = [T];
80
81 fn deref(&self) -> &Self::Target {
82 self.data.as_slice()
83 }
84}
85
86impl<T> NumberContainer<T, Cow>
87where
88 T: IsNumber + Clone + Debug + Default,
89{
90 pub fn new(data: Vec<T>) -> Self {
91 Self {
92 data: CowVec::new(data),
93 }
94 }
95
96 pub fn with_capacity(capacity: usize) -> Self {
97 Self {
98 data: CowVec::with_capacity(capacity),
99 }
100 }
101
102 pub fn from_vec(data: Vec<T>) -> Self {
103 Self {
104 data: CowVec::new(data),
105 }
106 }
107}
108
109impl<T, S: Storage> NumberContainer<T, S>
110where
111 T: IsNumber + Clone + Debug + Default,
112{
113 pub fn from_parts(data: S::Vec<T>) -> Self {
114 Self {
115 data,
116 }
117 }
118
119 pub fn len(&self) -> usize {
120 DataVec::len(&self.data)
121 }
122
123 pub fn capacity(&self) -> usize {
124 DataVec::capacity(&self.data)
125 }
126
127 pub fn is_empty(&self) -> bool {
128 DataVec::is_empty(&self.data)
129 }
130
131 pub fn clear(&mut self) {
132 DataVec::clear(&mut self.data);
133 }
134
135 pub fn push(&mut self, value: T) {
136 DataVec::push(&mut self.data, value);
137 }
138
139 pub fn push_default(&mut self) {
140 DataVec::push(&mut self.data, T::default());
141 }
142
143 pub fn get(&self, index: usize) -> Option<&T> {
144 if index < self.len() {
145 DataVec::get(&self.data, index)
146 } else {
147 None
148 }
149 }
150
151 pub fn is_defined(&self, idx: usize) -> bool {
152 idx < self.len()
153 }
154
155 pub fn is_fully_defined(&self) -> bool {
156 true
157 }
158
159 pub fn data(&self) -> &S::Vec<T> {
160 &self.data
161 }
162
163 pub fn data_mut(&mut self) -> &mut S::Vec<T> {
164 &mut self.data
165 }
166
167 pub fn as_string(&self, index: usize) -> String {
168 if index < self.len() {
169 self.data[index].to_string()
170 } else {
171 "none".to_string()
172 }
173 }
174
175 pub fn get_value(&self, index: usize) -> Value {
176 if index < self.len() {
177 self.data[index].to_value()
178 } else {
179 Value::none()
180 }
181 }
182
183 pub fn extend(&mut self, other: &Self) -> Result<()> {
184 DataVec::extend_iter(&mut self.data, other.data.iter().cloned());
185 Ok(())
186 }
187
188 pub fn iter(&self) -> impl Iterator<Item = Option<T>> + '_
189 where
190 T: Copy,
191 {
192 self.data.iter().map(|&v| Some(v))
193 }
194
195 pub fn slice(&self, start: usize, end: usize) -> Self {
196 let count = (end - start).min(self.len().saturating_sub(start));
197 let mut new_data = DataVec::spawn(&self.data, count);
198 for i in start..(start + count) {
199 DataVec::push(&mut new_data, self.data[i].clone());
200 }
201 Self {
202 data: new_data,
203 }
204 }
205
206 pub fn filter(&mut self, mask: &S::BitVec) {
207 let mut new_data = DataVec::spawn(&self.data, DataBitVec::count_ones(mask));
208
209 for (i, keep) in DataBitVec::iter(mask).enumerate() {
210 if keep && i < self.len() {
211 DataVec::push(&mut new_data, self.data[i].clone());
212 }
213 }
214
215 self.data = new_data;
216 }
217
218 pub fn reorder(&mut self, indices: &[usize]) {
219 let mut new_data = DataVec::spawn(&self.data, indices.len());
220
221 for &idx in indices {
222 if idx < self.len() {
223 DataVec::push(&mut new_data, self.data[idx].clone());
224 } else {
225 DataVec::push(&mut new_data, T::default());
226 }
227 }
228
229 self.data = new_data;
230 }
231
232 pub fn push_with_convert<U>(&mut self, value: U, converter: impl FnOnce(U) -> Option<T>) {
233 match converter(value) {
234 Some(v) => {
235 DataVec::push(&mut self.data, v);
236 }
237 None => {
238 DataVec::push(&mut self.data, T::default());
239 }
240 }
241 }
242
243 pub fn take(&self, num: usize) -> Self {
244 Self {
245 data: DataVec::take(&self.data, num),
246 }
247 }
248}
249
250#[cfg(test)]
251pub mod tests {
252 use super::*;
253 use crate::util::bitvec::BitVec;
254
255 #[test]
256 fn test_new_i32() {
257 let data = vec![1, 2, 3];
258 let container = NumberContainer::new(data.clone());
259
260 assert_eq!(container.len(), 3);
261 assert_eq!(container.get(0), Some(&1));
262 assert_eq!(container.get(1), Some(&2));
263 assert_eq!(container.get(2), Some(&3));
264 }
265
266 #[test]
267 fn test_from_vec_f64() {
268 let data = vec![1.1, 2.2, 3.3];
269 let container = NumberContainer::from_vec(data);
270
271 assert_eq!(container.len(), 3);
272 assert_eq!(container.get(0), Some(&1.1));
273 assert_eq!(container.get(1), Some(&2.2));
274 assert_eq!(container.get(2), Some(&3.3));
275
276 for i in 0..3 {
278 assert!(container.is_defined(i));
279 }
280 }
281
282 #[test]
283 fn test_with_capacity() {
284 let container: NumberContainer<i32> = NumberContainer::with_capacity(10);
285 assert_eq!(container.len(), 0);
286 assert!(container.is_empty());
287 assert!(container.capacity() >= 10);
288 }
289
290 #[test]
291 fn test_push_i64() {
292 let mut container: NumberContainer<i64> = NumberContainer::with_capacity(3);
293
294 container.push(100);
295 container.push(-200);
296 container.push_default();
297
298 assert_eq!(container.len(), 3);
299 assert_eq!(container.get(0), Some(&100));
300 assert_eq!(container.get(1), Some(&-200));
301 assert_eq!(container.get(2), Some(&0)); assert!(container.is_defined(0));
304 assert!(container.is_defined(1));
305 assert!(container.is_defined(2));
306 }
307
308 #[test]
309 fn test_extend() {
310 let mut container1 = NumberContainer::from_vec(vec![1i32, 2]);
311 let container2 = NumberContainer::from_vec(vec![3i32, 4]);
312
313 container1.extend(&container2).unwrap();
314
315 assert_eq!(container1.len(), 4);
316 assert_eq!(container1.get(0), Some(&1));
317 assert_eq!(container1.get(1), Some(&2));
318 assert_eq!(container1.get(2), Some(&3));
319 assert_eq!(container1.get(3), Some(&4));
320 }
321
322 #[test]
323 fn test_iter_u8() {
324 let data = vec![1u8, 2, 3];
325 let container = NumberContainer::new(data);
326
327 let collected: Vec<Option<u8>> = container.iter().collect();
328 assert_eq!(collected, vec![Some(1), Some(2), Some(3)]);
329 }
330
331 #[test]
332 fn test_slice() {
333 let container = NumberContainer::from_vec(vec![10i16, 20, 30, 40]);
334 let sliced = container.slice(1, 3);
335
336 assert_eq!(sliced.len(), 2);
337 assert_eq!(sliced.get(0), Some(&20));
338 assert_eq!(sliced.get(1), Some(&30));
339 }
340
341 #[test]
342 fn test_filter() {
343 let mut container = NumberContainer::from_vec(vec![1f32, 2.0, 3.0, 4.0]);
344 let mask = BitVec::from_slice(&[true, false, true, false]);
345
346 container.filter(&mask);
347
348 assert_eq!(container.len(), 2);
349 assert_eq!(container.get(0), Some(&1.0));
350 assert_eq!(container.get(1), Some(&3.0));
351 }
352
353 #[test]
354 fn test_reorder() {
355 let mut container = NumberContainer::from_vec(vec![10i32, 20, 30]);
356 let indices = [2, 0, 1];
357
358 container.reorder(&indices);
359
360 assert_eq!(container.len(), 3);
361 assert_eq!(container.get(0), Some(&30)); assert_eq!(container.get(1), Some(&10)); assert_eq!(container.get(2), Some(&20)); }
365
366 #[test]
367 fn test_push_with_convert() {
368 let mut container: NumberContainer<i32> = NumberContainer::with_capacity(3);
369
370 container.push_with_convert(42u32, |x| {
372 if x <= i32::MAX as u32 {
373 Some(x as i32)
374 } else {
375 None
376 }
377 });
378
379 container.push_with_convert(u32::MAX, |x| {
381 if x <= i32::MAX as u32 {
382 Some(x as i32)
383 } else {
384 None
385 }
386 });
387
388 assert_eq!(container.len(), 2);
389 assert_eq!(container.get(0), Some(&42));
390 assert_eq!(container.get(1), Some(&0)); assert!(container.is_defined(0));
393 assert!(container.is_defined(1));
394 }
395
396 #[test]
397 fn test_data_access() {
398 let mut container = NumberContainer::from_vec(vec![1i32, 2, 3]);
399
400 assert_eq!(container.data().len(), 3);
402
403 container.data_mut().push(4);
405
406 assert_eq!(container.len(), 4);
407 assert_eq!(container.get(3), Some(&4));
408 }
409}