Type Alias BinaryOffsetChunked 

pub type BinaryOffsetChunked = ChunkedArray<BinaryOffsetType>;

Aliased Type

pub struct BinaryOffsetChunked { /* private fields */ }

Trait Implementations

impl ChunkAnyValue for BinaryOffsetChunked

unsafe fn get_any_value_unchecked(&self, index: usize) -> AnyValue<'_>

Get a single value. Beware this is slow. If you need to use this slightly performant, cast Categorical to UInt32

fn get_any_value(&self, index: usize) -> PolarsResult<AnyValue<'_>>

Get a single value. Beware this is slow.

impl ChunkAnyValueBypassValidity for BinaryOffsetChunked

unsafe fn get_any_value_bypass_validity(&self, index: usize) -> AnyValue<'_>

Get a single value bypassing the validity map. Beware this is slow.

impl ChunkCast for BinaryOffsetChunked

fn cast_with_options( &self, dtype: &DataType, options: CastOptions, ) -> PolarsResult<Series>

Cast a ChunkedArray to DataType

unsafe fn cast_unchecked(&self, dtype: &DataType) -> PolarsResult<Series>

Does not check if the cast is a valid one and may over/underflow

fn cast(&self, dtype: &DataType) -> PolarsResult<Series>

Cast a ChunkedArray to DataType

impl ChunkCompareEq<&[u8]> for BinaryOffsetChunked

type Item = ChunkedArray<BooleanType>

fn equal(&self, rhs: &[u8]) -> BooleanChunked

Check for equality.

fn equal_missing(&self, rhs: &[u8]) -> BooleanChunked

Check for equality where None == None.

fn not_equal(&self, rhs: &[u8]) -> BooleanChunked

Check for inequality.

fn not_equal_missing(&self, rhs: &[u8]) -> BooleanChunked

Check for inequality where None == None.

impl ChunkCompareEq<&ChunkedArray<BinaryOffsetType>> for BinaryOffsetChunked

type Item = ChunkedArray<BooleanType>

fn equal(&self, rhs: &BinaryOffsetChunked) -> BooleanChunked

Check for equality.

fn equal_missing(&self, rhs: &BinaryOffsetChunked) -> BooleanChunked

Check for equality where None == None.

fn not_equal(&self, rhs: &BinaryOffsetChunked) -> BooleanChunked

Check for inequality.

fn not_equal_missing(&self, rhs: &BinaryOffsetChunked) -> BooleanChunked

Check for inequality where None == None.

impl ChunkCompareIneq<&[u8]> for BinaryOffsetChunked

type Item = ChunkedArray<BooleanType>

fn gt(&self, rhs: &[u8]) -> BooleanChunked

Greater than comparison.

fn gt_eq(&self, rhs: &[u8]) -> BooleanChunked

Greater than or equal comparison.

fn lt(&self, rhs: &[u8]) -> BooleanChunked

Less than comparison.

fn lt_eq(&self, rhs: &[u8]) -> BooleanChunked

Less than or equal comparison

impl ChunkCompareIneq<&ChunkedArray<BinaryOffsetType>> for BinaryOffsetChunked

type Item = ChunkedArray<BooleanType>

fn lt(&self, rhs: &BinaryOffsetChunked) -> BooleanChunked

Less than comparison.

fn lt_eq(&self, rhs: &BinaryOffsetChunked) -> BooleanChunked

Less than or equal comparison

fn gt(&self, rhs: &Self) -> BooleanChunked

Greater than comparison.

fn gt_eq(&self, rhs: &Self) -> BooleanChunked

Greater than or equal comparison.

impl ChunkExpandAtIndex<BinaryOffsetType> for BinaryOffsetChunked

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

Create a new ChunkedArray filled with values at that index.

impl<'a> ChunkFull<&'a [u8]> for BinaryOffsetChunked

fn full(name: PlSmallStr, value: &'a [u8], length: usize) -> Self

Create a ChunkedArray with a single value.

impl ChunkFullNull for BinaryOffsetChunked

fn full_null(name: PlSmallStr, length: usize) -> Self

impl ChunkReverse for BinaryOffsetChunked

fn reverse(&self) -> Self

Return a reversed version of this array.

impl ChunkSort<BinaryOffsetType> for BinaryOffsetChunked

fn arg_sort_multiple( &self, by: &[Column], options: &SortMultipleOptions, ) -> 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) -> BinaryOffsetChunked

fn sort(&self, descending: bool) -> BinaryOffsetChunked

Returned a sorted ChunkedArray.

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

Retrieve the indexes needed to sort this array.

impl ChunkUnique for BinaryOffsetChunked

Available on crate feature algorithm_group_by only.

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 n_unique(&self) -> PolarsResult<usize>

Number of unique values in the ChunkedArray

fn unique_id(&self) -> PolarsResult<(IdxSize, Vec<IdxSize>)>

Get dense ids for each unique value.

impl<Ptr> FromTrustedLenIterator<Option<Ptr>> for BinaryOffsetChunked

where Ptr: AsRef<[u8]>,

fn from_iter_trusted_length<I: IntoIterator<Item = Option<Ptr>>>( iter: I, ) -> Self

impl<Ptr> FromTrustedLenIterator<Ptr> for BinaryOffsetChunked

where Ptr: PolarsAsRef<[u8]>,

fn from_iter_trusted_length<I: IntoIterator<Item = Ptr>>(iter: I) -> Self

impl IntoGroupsType for BinaryOffsetChunked

Available on crate feature algorithm_group_by only.

fn group_tuples<'a>( &'a self, multithreaded: bool, sorted: bool, ) -> PolarsResult<GroupsType>

Create the tuples need for a group_by operation. * The first value in the tuple is the first index of the group. * The second value in the tuple is the indexes of the groups including the first value.

impl<'a> IntoIterator for &'a BinaryOffsetChunked

type Item = Option<&'a [u8]>

The type of the elements being iterated over.

type IntoIter = Box<dyn PolarsIterator<Item = <&'a ChunkedArray<BinaryOffsetType> as IntoIterator>::Item> + 'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl ValueSize for BinaryOffsetChunked

fn get_values_size(&self) -> usize

Get the values size that is still “visible” to the underlying array. E.g. take the offsets into account.

impl VecHash for BinaryOffsetChunked

fn vec_hash( &self, random_state: PlSeedableRandomStateQuality, buf: &mut Vec<u64>, ) -> PolarsResult<()>

Compute the hash for all values in the array.

fn vec_hash_combine( &self, random_state: PlSeedableRandomStateQuality, hashes: &mut [u64], ) -> PolarsResult<()>