polars-compute 0.53.0

Private compute kernels for the Polars DataFrame library
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
87
88
89
90
91
92
93
94
95
96
97
98
99
100

use arrow::bitmap::Bitmap;
use arrow::types::NativeType;
use polars_utils::IdxSize;
use polars_utils::min_max::MinMaxPolicy;

use super::RollingFnParams;
use super::arg_min_max::ArgMinMaxWindow;
use super::no_nulls::RollingAggWindowNoNulls;
use super::nulls::RollingAggWindowNulls;

/// Min/max window implemented on top of ArgMinMaxWindow (arg-based).
pub struct MinMaxWindow<'a, T, P> {
    inner: ArgMinMaxWindow<'a, T, P>,
}

impl<'a, T: NativeType, P: MinMaxPolicy> RollingAggWindowNulls<T> for MinMaxWindow<'a, T, P> {
    type This<'b> = MinMaxWindow<'b, T, P>;

    fn new<'b>(
        slice: &'b [T],
        validity: &'b Bitmap,
        start: usize,
        end: usize,
        params: Option<RollingFnParams>,
        window_size: Option<usize>,
    ) -> Self::This<'b> {
        assert!(params.is_none());
        assert!(start <= slice.len() && end <= slice.len() && start <= end);

        let inner = <ArgMinMaxWindow<'b, T, P> as RollingAggWindowNulls<T, IdxSize>>::new(
            slice,
            validity,
            start,
            end,
            None,
            window_size,
        );

        MinMaxWindow { inner }
    }

    unsafe fn update(&mut self, new_start: usize, new_end: usize) {
        unsafe { RollingAggWindowNulls::<T, IdxSize>::update(&mut self.inner, new_start, new_end) };
    }

    fn get_agg(&self, idx: usize) -> Option<T> {
        let rel = RollingAggWindowNulls::<T, IdxSize>::get_agg(&self.inner, idx)?;
        let abs = self.inner.start + rel as usize;
        unsafe { Some(*self.inner.values.get_unchecked(abs)) }
    }

    fn is_valid(&self, min_periods: usize) -> bool {
        RollingAggWindowNulls::<T, IdxSize>::is_valid(&self.inner, min_periods)
    }

    fn slice_len(&self) -> usize {
        RollingAggWindowNulls::<T, IdxSize>::slice_len(&self.inner)
    }
}

impl<'a, T: NativeType, P: MinMaxPolicy> RollingAggWindowNoNulls<T> for MinMaxWindow<'a, T, P> {
    type This<'b> = MinMaxWindow<'b, T, P>;

    fn new<'b>(
        slice: &'b [T],
        start: usize,
        end: usize,
        params: Option<RollingFnParams>,
        window_size: Option<usize>,
    ) -> Self::This<'b> {
        assert!(params.is_none());
        assert!(start <= slice.len() && end <= slice.len() && start <= end);

        let inner = <ArgMinMaxWindow<'b, T, P> as RollingAggWindowNoNulls<T, IdxSize>>::new(
            slice,
            start,
            end,
            None,
            window_size,
        );

        MinMaxWindow { inner }
    }

    unsafe fn update(&mut self, new_start: usize, new_end: usize) {
        unsafe {
            RollingAggWindowNoNulls::<T, IdxSize>::update(&mut self.inner, new_start, new_end);
        };
    }

    fn get_agg(&self, idx: usize) -> Option<T> {
        let rel = RollingAggWindowNoNulls::<T, IdxSize>::get_agg(&self.inner, idx)?;
        let abs = self.inner.start + rel as usize;
        unsafe { Some(*self.inner.values.get_unchecked(abs)) }
    }

    fn slice_len(&self) -> usize {
        RollingAggWindowNoNulls::<T, IdxSize>::slice_len(&self.inner)
    }
}