Module polars_core::chunked_array::ops[][src]

Expand description

Traits for miscellaneous operations on ChunkedArray

Modules

zipzip_with

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 when the operation is cheaper than branching due to null checking

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

ChunkRollApplyrolling_window

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.

Combine 2 ChunkedArrays based on some predicate.

Interpolateinterpolate

Create a type that implements a faster TakeRandom.

IsFirstis_first

Mask the first unique values as true

IsInis_in

Check if element is member of list array

IsLastis_first

Mask the last unique values as true

RepeatByrepeat_by

Repeat the values n times.

StrConcatconcat_str

Concat the values into a string array.

Random access

Type Definitions

Dummy type, we need to instantiate all generic types, so we fill one with a dummy.