Skip to main content

reifydb_value/value/container/
number.rs

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