Struct polars_core::datatypes::BinaryType

pub struct BinaryType {}

Available on crate feature dtype-binary only.

Trait Implementations

impl ChunkExpandAtIndex<BinaryType> for BinaryChunked

fn new_from_index(&self, index: usize, length: usize) -> BinaryChunked

Create a new ChunkedArray filled with values at that index.

impl ChunkFilter<BinaryType> for BinaryChunked

fn filter(
    &self,
    filter: &BooleanChunked
) -> PolarsResult<ChunkedArray<BinaryType>>

Filter values in the ChunkedArray with a boolean mask.

impl ChunkReverse<BinaryType> for BinaryChunked

fn reverse(&self) -> Self

Return a reversed version of this array.

impl ChunkShift<BinaryType> for BinaryChunked

fn shift(&self, periods: i64) -> Self

impl ChunkShiftFill<BinaryType, Option<&[u8]>> for BinaryChunked

fn shift_and_fill(&self, periods: i64, fill_value: Option<&[u8]>) -> BinaryChunked

Shift the values by a given period and fill the parts that will be empty due to this operation with fill_value.

impl ChunkSort<BinaryType> for BinaryChunked

fn argsort_multiple(
    &self,
    other: &[Series],
    reverse: &[bool]
) -> PolarsResult<IdxCa>

Panics

This function is very opinionated. On the implementation of ChunkedArray<T> for numeric types, we assume that all numeric Series are of the same type.

In this case we assume that all numeric Series are f64 types. The caller needs to uphold this contract. If not, it will panic.

fn sort_with(&self, options: SortOptions) -> ChunkedArray<BinaryType>

fn sort(&self, reverse: bool) -> BinaryChunked

Returned a sorted ChunkedArray.

fn argsort(&self, options: SortOptions) -> IdxCa

Retrieve the indexes needed to sort this array.

impl ChunkTakeEvery<BinaryType> for BinaryChunked

fn take_every(&self, n: usize) -> BinaryChunked

Traverse and collect every nth element in a new array.

impl ChunkUnique<BinaryType> for BinaryChunked

fn unique(&self) -> PolarsResult<Self>

Get unique values of a ChunkedArray

fn arg_unique(&self) -> PolarsResult<IdxCa>

Get first index of the unique values in a ChunkedArray. This Vec is sorted.

fn is_unique(&self) -> PolarsResult<BooleanChunked>

Get a mask of all the unique values.

fn is_duplicated(&self) -> PolarsResult<BooleanChunked>

Get a mask of all the duplicated values.

fn n_unique(&self) -> PolarsResult<usize>

Number of unique values in the ChunkedArray

fn mode(&self) -> PolarsResult<Self>

Available on crate feature mode only.

The most occurring value(s). Can return multiple Values

impl ChunkZip<BinaryType> for BinaryChunked

Available on crate feature zip_with only.

fn zip_with(
    &self,
    mask: &BooleanChunked,
    other: &BinaryChunked
) -> PolarsResult<BinaryChunked>

Create a new ChunkedArray with values from self where the mask evaluates true and values from other where the mask evaluates false

impl ChunkedBuilder<Cow<'_, [u8]>, BinaryType> for BinaryChunkedBuilderCow

fn append_value(&mut self, val: Cow<'_, [u8]>)

fn append_null(&mut self)

fn finish(self) -> ChunkedArray<BinaryType>

fn shrink_to_fit(&mut self)

fn append_option(&mut self, opt_val: Option<N>)

impl IsFirst<BinaryType> for BinaryChunked

Available on crate feature is_first only.

fn is_first(&self) -> PolarsResult<BooleanChunked>

impl<B> NewChunkedArray<BinaryType, B> for BinaryChunkedwhere
    B: AsRef<[u8]>,

fn from_iter_values(name: &str, it: impl Iterator<Item = B>) -> Self

Create a new ChunkedArray from an iterator.

fn from_slice(name: &str, v: &[B]) -> Self

fn from_slice_options(name: &str, opt_v: &[Option<B>]) -> Self

fn from_iter_options(name: &str, it: impl Iterator<Item = Option<B>>) -> Self

Create a new ChunkedArray from an iterator.

impl PolarsDataType for BinaryType

fn get_dtype() -> DataType

impl PolarsSingleType for BinaryType