This repository has been archived by the owner on Feb 18, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 221
/
list.rs
256 lines (210 loc) · 7.35 KB
/
list.rs
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
246
247
248
249
250
251
252
253
254
255
256
use std::sync::Arc;
use crate::{
array::{Array, ListArray, Offset},
bitmap::MutableBitmap,
buffer::MutableBuffer,
};
use super::{
make_growable,
utils::{build_extend_null_bits, extend_offsets, ExtendNullBits},
Growable,
};
fn extend_offset_values<O: Offset>(
growable: &mut GrowableList<'_, O>,
index: usize,
start: usize,
len: usize,
) {
let array = growable.arrays[index];
let offsets = array.offsets();
if array.null_count() == 0 {
// offsets
extend_offsets::<O>(
&mut growable.offsets,
&mut growable.last_offset,
&offsets[start..start + len + 1],
);
let end = offsets[start + len].to_usize();
let start = offsets[start].to_usize();
let len = end - start;
growable.values.extend(index, start, len)
} else {
growable.offsets.reserve(len);
let new_offsets = &mut growable.offsets;
let inner_values = &mut growable.values;
let last_offset = &mut growable.last_offset;
(start..start + len).for_each(|i| {
if array.is_valid(i) {
let len = offsets[i + 1] - offsets[i];
// compute the new offset
*last_offset += len;
// append value
inner_values.extend(index, offsets[i].to_usize(), len.to_usize());
}
// append offset
new_offsets.push(*last_offset);
})
}
}
/// Concrete [`Growable`] for the [`ListArray`].
pub struct GrowableList<'a, O: Offset> {
arrays: Vec<&'a ListArray<O>>,
validity: MutableBitmap,
values: Box<dyn Growable<'a> + 'a>,
offsets: MutableBuffer<O>,
last_offset: O, // always equal to the last offset at `offsets`.
// function used to extend nulls from arrays. This function's lifetime is bound to the array
// because it reads nulls from it.
extend_null_bits: Vec<ExtendNullBits<'a>>,
}
impl<'a, O: Offset> GrowableList<'a, O> {
pub fn new(arrays: Vec<&'a ListArray<O>>, mut use_validity: bool, capacity: usize) -> Self {
// if any of the arrays has nulls, insertions from any array requires setting bits
// as there is at least one array with nulls.
if !use_validity & arrays.iter().any(|array| array.null_count() > 0) {
use_validity = true;
};
let extend_null_bits = arrays
.iter()
.map(|array| build_extend_null_bits(*array, use_validity))
.collect();
let inner = arrays
.iter()
.map(|array| array.values().as_ref())
.collect::<Vec<_>>();
let values = make_growable(&inner, use_validity, 0);
let mut offsets = MutableBuffer::with_capacity(capacity + 1);
let length = O::default();
unsafe { offsets.push_unchecked(length) };
Self {
arrays,
offsets,
values,
validity: MutableBitmap::with_capacity(capacity),
last_offset: O::default(),
extend_null_bits,
}
}
fn to(&mut self) -> ListArray<O> {
let validity = std::mem::take(&mut self.validity);
let offsets = std::mem::take(&mut self.offsets);
let values = self.values.as_arc();
ListArray::<O>::from_data(
self.arrays[0].data_type().clone(),
offsets.into(),
values,
validity.into(),
)
}
}
impl<'a, O: Offset> Growable<'a> for GrowableList<'a, O> {
fn extend(&mut self, index: usize, start: usize, len: usize) {
(self.extend_null_bits[index])(&mut self.validity, start, len);
extend_offset_values::<O>(self, index, start, len);
}
fn extend_validity(&mut self, additional: usize) {
self.offsets.extend_constant(additional, self.last_offset);
self.validity.extend_constant(additional, false);
}
fn as_arc(&mut self) -> Arc<dyn Array> {
Arc::new(self.to())
}
fn as_box(&mut self) -> Box<dyn Array> {
Box::new(self.to())
}
}
impl<'a, O: Offset> From<GrowableList<'a, O>> for ListArray<O> {
fn from(val: GrowableList<'a, O>) -> Self {
let mut values = val.values;
let values = values.as_arc();
ListArray::<O>::from_data(
val.arrays[0].data_type().clone(),
val.offsets.into(),
values,
val.validity.into(),
)
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::array::{ListArray, MutableListArray, MutablePrimitiveArray, TryExtend};
fn create_list_array(data: Vec<Option<Vec<Option<i32>>>>) -> ListArray<i32> {
let mut array = MutableListArray::<i32, MutablePrimitiveArray<i32>>::new();
array.try_extend(data).unwrap();
array.into()
}
#[test]
fn basic() {
let data = vec![
Some(vec![Some(1i32), Some(2), Some(3)]),
Some(vec![Some(4), Some(5)]),
Some(vec![Some(6i32), Some(7), Some(8)]),
];
let array = create_list_array(data);
let mut a = GrowableList::new(vec![&array], false, 0);
a.extend(0, 0, 1);
let result: ListArray<i32> = a.into();
let expected = vec![Some(vec![Some(1i32), Some(2), Some(3)])];
let expected = create_list_array(expected);
assert_eq!(result, expected)
}
#[test]
fn null_offset() {
let data = vec![
Some(vec![Some(1i32), Some(2), Some(3)]),
None,
Some(vec![Some(6i32), Some(7), Some(8)]),
];
let array = create_list_array(data);
let array = array.slice(1, 2);
let mut a = GrowableList::new(vec![&array], false, 0);
a.extend(0, 1, 1);
let result: ListArray<i32> = a.into();
let expected = vec![Some(vec![Some(6i32), Some(7), Some(8)])];
let expected = create_list_array(expected);
assert_eq!(result, expected)
}
#[test]
fn null_offsets() {
let data = vec![
Some(vec![Some(1i32), Some(2), Some(3)]),
None,
Some(vec![Some(6i32), None, Some(8)]),
];
let array = create_list_array(data);
let array = array.slice(1, 2);
let mut a = GrowableList::new(vec![&array], false, 0);
a.extend(0, 1, 1);
let result: ListArray<i32> = a.into();
let expected = vec![Some(vec![Some(6i32), None, Some(8)])];
let expected = create_list_array(expected);
assert_eq!(result, expected)
}
#[test]
fn test_from_two_lists() {
let data_1 = vec![
Some(vec![Some(1i32), Some(2), Some(3)]),
None,
Some(vec![Some(6i32), None, Some(8)]),
];
let array_1 = create_list_array(data_1);
let data_2 = vec![
Some(vec![Some(8i32), Some(7), Some(6)]),
Some(vec![Some(5i32), None, Some(4)]),
Some(vec![Some(2i32), Some(1), Some(0)]),
];
let array_2 = create_list_array(data_2);
let mut a = GrowableList::new(vec![&array_1, &array_2], false, 6);
a.extend(0, 0, 2);
a.extend(1, 1, 1);
let result: ListArray<i32> = a.into();
let expected = vec![
Some(vec![Some(1i32), Some(2), Some(3)]),
None,
Some(vec![Some(5i32), None, Some(4)]),
];
let expected = create_list_array(expected);
assert_eq!(result, expected);
}
}