polars-arrow 0.54.0

Minimal implementation of the Arrow specification forked from arrow2
Documentation 
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

#![allow(unsafe_op_in_unsafe_fn)]
use super::*;

/// Take kernel for single chunk and an iterator as index.
/// Returns the position of the minimum value within the iterator.
/// # Safety
/// caller must ensure iterators indexes are in bounds
#[inline]
pub unsafe fn take_arg_min_bool_iter_unchecked_nulls<I: IntoIterator<Item = usize>>(
    arr: &BooleanArray,
    indices: I,
) -> Option<usize> {
    let validity = arr.validity().unwrap();
    let mut first_non_null_pos = None;

    for (pos, idx) in indices.into_iter().enumerate() {
        if validity.get_bit_unchecked(idx) {
            if !arr.value_unchecked(idx) {
                return Some(pos);
            }
            first_non_null_pos.get_or_insert(pos);
        }
    }
    first_non_null_pos
}

/// Take kernel for single chunk and an iterator as index.
/// Returns the position of the minimum value within the iterator.
/// # Safety
/// caller must ensure iterators indexes are in bounds
#[inline]
pub unsafe fn take_arg_min_bool_iter_unchecked_no_nulls<I: IntoIterator<Item = usize>>(
    arr: &BooleanArray,
    indices: I,
) -> Option<usize> {
    if arr.is_empty() {
        return None;
    }

    indices
        .into_iter()
        .position(|idx| !arr.value_unchecked(idx))
        .or(Some(0))
}

/// Take kernel for single chunk and an iterator as index.
/// Returns the position of the maximum value within the iterator.
/// # Safety
/// caller must ensure iterators indexes are in bounds
#[inline]
pub unsafe fn take_arg_max_bool_iter_unchecked_nulls<I: IntoIterator<Item = usize>>(
    arr: &BooleanArray,
    indices: I,
) -> Option<usize> {
    let validity = arr.validity().unwrap();
    let mut first_non_null_pos = None;

    for (pos, idx) in indices.into_iter().enumerate() {
        if validity.get_bit_unchecked(idx) {
            if arr.value_unchecked(idx) {
                return Some(pos);
            }
            first_non_null_pos.get_or_insert(pos);
        }
    }
    first_non_null_pos
}

/// Take kernel for single chunk and an iterator as index.
/// Returns the position of the maximum value within the iterator.
/// # Safety
/// caller must ensure iterators indexes are in bounds
#[inline]
pub unsafe fn take_arg_max_bool_iter_unchecked_no_nulls<I: IntoIterator<Item = usize>>(
    arr: &BooleanArray,
    indices: I,
) -> Option<usize> {
    if arr.is_empty() {
        return None;
    }

    indices
        .into_iter()
        .position(|idx| arr.value_unchecked(idx))
        .or(Some(0))
}