-
-
Notifications
You must be signed in to change notification settings - Fork 2.1k
/
Copy pathlist.rs
69 lines (63 loc) · 2.36 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
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied. See the License for the
// specific language governing permissions and limitations
// under the License.
use super::Index;
use crate::array::growable::{Growable, GrowableList};
use crate::array::{Array, ListArray};
use crate::datatypes::IdxArr;
use crate::offset::Offset;
/// `take` implementation for ListArrays
pub(super) unsafe fn take_unchecked<I: Offset>(
values: &ListArray<I>,
indices: &IdxArr,
) -> ListArray<I> {
// fast-path: all values to take are none
if indices.null_count() == indices.len() {
return ListArray::<I>::new_null(values.dtype().clone(), indices.len());
}
let mut capacity = 0;
let arrays = indices
.iter()
.flat_map(|opt_idx| {
opt_idx.map(|index| {
let index = index.to_usize();
let slice = values.clone().sliced(index, 1);
capacity += slice.len();
slice
})
})
.collect::<Vec<ListArray<I>>>();
let arrays = arrays.iter().collect();
if let Some(validity) = indices.validity() {
let mut growable: GrowableList<I> = GrowableList::new(arrays, true, capacity);
let mut not_null_index = 0;
for index in 0..indices.len() {
if validity.get_bit_unchecked(index) {
growable.extend(not_null_index, 0, 1);
not_null_index += 1;
} else {
growable.extend_validity(1)
}
}
growable.into()
} else {
let mut growable: GrowableList<I> = GrowableList::new(arrays, false, capacity);
for index in 0..indices.len() {
growable.extend(index, 0, 1);
}
growable.into()
}
}