Module polars::chunked_array::ops [−][src]
Expand description
Traits for miscellaneous operations on ChunkedArray
Structs
Enums
One of the three arguments allowed in unchecked_take
Traits
Argmin/ Argmax
Aggregation operations
Fastest way to do elementwise operations on a ChunkedArray
Apply kernels on the arrow array chunks in a ChunkedArray.
Cast ChunkedArray<T> to ChunkedArray<N>
Compare Series
and ChunkedArray’s and get a boolean mask that
can be used to filter rows.
Create a new ChunkedArray filled with values at that index.
Explode/ flatten a
Replace None values with various strategies
Replace None values with a value
Filter values by a boolean mask.
Fill a ChunkedArray with one value.
Find local minima/ maxima
Reverse a ChunkedArray
This differs from ChunkWindowCustom and ChunkWindow
by not using a fold aggregator, but reusing a Series wrapper and calling Series aggregators.
This likely is a bit slower than ChunkWindow
Create a ChunkedArray with new values by index or by boolean mask.
Note that these operations clone data. This is however the only way we can modify at mask or
index level as the underlying Arrow arrays are immutable.
Shift the values of a ChunkedArray by a number of periods.
Sort operations on ChunkedArray.
Fast access by index.
Traverse and collect every nth element
Get unique values in a ChunkedArray
Variance and standard deviation aggregation.
Rolling window functions
Custom rolling window functions
Combine 2 ChunkedArrays based on some predicate.
Create a type that implements a faster TakeRandom.
Check if element is member of list array
Repeat the values n times.
Random access
Type Definitions
Dummy type, we need to instantiate all generic types, so we fill one with a dummy.