Type Alias polars_core::datatypes::BinaryChunked
source · pub type BinaryChunked = ChunkedArray<BinaryType>;
Aliased Type§
struct BinaryChunked { /* private fields */ }
Implementations§
source§impl BinaryChunked
impl BinaryChunked
source§impl BinaryChunked
impl BinaryChunked
sourcepub unsafe fn to_string_unchecked(&self) -> StringChunked
pub unsafe fn to_string_unchecked(&self) -> StringChunked
§Safety
String is not validated
Trait Implementations§
source§impl Add<&[u8]> for &BinaryChunked
impl Add<&[u8]> for &BinaryChunked
§type Output = ChunkedArray<BinaryType>
type Output = ChunkedArray<BinaryType>
The resulting type after applying the
+
operator.source§impl Add for &BinaryChunked
impl Add for &BinaryChunked
§type Output = ChunkedArray<BinaryType>
type Output = ChunkedArray<BinaryType>
The resulting type after applying the
+
operator.source§impl Add for BinaryChunked
impl Add for BinaryChunked
§type Output = ChunkedArray<BinaryType>
type Output = ChunkedArray<BinaryType>
The resulting type after applying the
+
operator.source§impl AggList for BinaryChunked
Available on crate feature algorithm_group_by
only.
impl AggList for BinaryChunked
Available on crate feature
algorithm_group_by
only.source§impl ChunkAggSeries for BinaryChunked
impl ChunkAggSeries for BinaryChunked
source§fn sum_reduce(&self) -> Scalar
fn sum_reduce(&self) -> Scalar
Get the sum of the
ChunkedArray
as a new Series
of length 1.source§fn max_reduce(&self) -> Scalar
fn max_reduce(&self) -> Scalar
Get the max of the
ChunkedArray
as a new Series
of length 1.source§fn min_reduce(&self) -> Scalar
fn min_reduce(&self) -> Scalar
Get the min of the
ChunkedArray
as a new Series
of length 1.source§fn prod_reduce(&self) -> Scalar
fn prod_reduce(&self) -> Scalar
Get the product of the
ChunkedArray
as a new Series
of length 1.source§impl ChunkAnyValue for BinaryChunked
impl ChunkAnyValue for BinaryChunked
source§unsafe fn get_any_value_unchecked(&self, index: usize) -> AnyValue<'_>
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 Read more
source§fn get_any_value(&self, index: usize) -> PolarsResult<AnyValue<'_>>
fn get_any_value(&self, index: usize) -> PolarsResult<AnyValue<'_>>
Get a single value. Beware this is slow.
source§impl<'a> ChunkApply<'a, &'a [u8]> for BinaryChunked
impl<'a> ChunkApply<'a, &'a [u8]> for BinaryChunked
type FuncRet = Cow<'a, [u8]>
source§fn apply_values<F>(&'a self, f: F) -> Self
fn apply_values<F>(&'a self, f: F) -> Self
Apply a closure elementwise. This is fastest when the null check branching is more expensive
than the closure application. Often it is. Read more
source§impl ChunkApplyKernel<BinaryViewArrayGeneric<[u8]>> for BinaryChunked
impl ChunkApplyKernel<BinaryViewArrayGeneric<[u8]>> for BinaryChunked
source§fn apply_kernel(&self, f: &dyn Fn(&BinaryViewArray) -> ArrayRef) -> Self
fn apply_kernel(&self, f: &dyn Fn(&BinaryViewArray) -> ArrayRef) -> Self
Apply kernel and return result as a new ChunkedArray.
source§fn apply_kernel_cast<S>(
&self,
f: &dyn Fn(&BinaryViewArray) -> ArrayRef,
) -> ChunkedArray<S>where
S: PolarsDataType,
fn apply_kernel_cast<S>(
&self,
f: &dyn Fn(&BinaryViewArray) -> ArrayRef,
) -> ChunkedArray<S>where
S: PolarsDataType,
Apply a kernel that outputs an array of different type.
source§impl ChunkCast for BinaryChunked
impl ChunkCast for BinaryChunked
source§fn cast_with_options(
&self,
dtype: &DataType,
options: CastOptions,
) -> PolarsResult<Series>
fn cast_with_options( &self, dtype: &DataType, options: CastOptions, ) -> PolarsResult<Series>
Cast a
ChunkedArray
to DataType
source§unsafe fn cast_unchecked(&self, dtype: &DataType) -> PolarsResult<Series>
unsafe fn cast_unchecked(&self, dtype: &DataType) -> PolarsResult<Series>
Does not check if the cast is a valid one and may over/underflow Read more
source§fn cast(&self, dtype: &DataType) -> PolarsResult<Series>
fn cast(&self, dtype: &DataType) -> PolarsResult<Series>
Cast a
ChunkedArray
to DataType
source§impl ChunkCompare<&[u8]> for BinaryChunked
impl ChunkCompare<&[u8]> for BinaryChunked
type Item = ChunkedArray<BooleanType>
source§fn equal(&self, rhs: &[u8]) -> BooleanChunked
fn equal(&self, rhs: &[u8]) -> BooleanChunked
Check for equality.
source§fn equal_missing(&self, rhs: &[u8]) -> BooleanChunked
fn equal_missing(&self, rhs: &[u8]) -> BooleanChunked
Check for equality where
None == None
.source§fn not_equal(&self, rhs: &[u8]) -> BooleanChunked
fn not_equal(&self, rhs: &[u8]) -> BooleanChunked
Check for inequality.
source§fn not_equal_missing(&self, rhs: &[u8]) -> BooleanChunked
fn not_equal_missing(&self, rhs: &[u8]) -> BooleanChunked
Check for inequality where
None == None
.source§fn gt(&self, rhs: &[u8]) -> BooleanChunked
fn gt(&self, rhs: &[u8]) -> BooleanChunked
Greater than comparison.
source§fn gt_eq(&self, rhs: &[u8]) -> BooleanChunked
fn gt_eq(&self, rhs: &[u8]) -> BooleanChunked
Greater than or equal comparison.
source§fn lt(&self, rhs: &[u8]) -> BooleanChunked
fn lt(&self, rhs: &[u8]) -> BooleanChunked
Less than comparison.
source§fn lt_eq(&self, rhs: &[u8]) -> BooleanChunked
fn lt_eq(&self, rhs: &[u8]) -> BooleanChunked
Less than or equal comparison
source§impl ChunkCompare<&ChunkedArray<BinaryType>> for BinaryChunked
impl ChunkCompare<&ChunkedArray<BinaryType>> for BinaryChunked
type Item = ChunkedArray<BooleanType>
source§fn equal(&self, rhs: &BinaryChunked) -> BooleanChunked
fn equal(&self, rhs: &BinaryChunked) -> BooleanChunked
Check for equality.
source§fn equal_missing(&self, rhs: &BinaryChunked) -> BooleanChunked
fn equal_missing(&self, rhs: &BinaryChunked) -> BooleanChunked
Check for equality where
None == None
.source§fn not_equal(&self, rhs: &BinaryChunked) -> BooleanChunked
fn not_equal(&self, rhs: &BinaryChunked) -> BooleanChunked
Check for inequality.
source§fn not_equal_missing(&self, rhs: &BinaryChunked) -> BooleanChunked
fn not_equal_missing(&self, rhs: &BinaryChunked) -> BooleanChunked
Check for inequality where
None == None
.source§fn lt(&self, rhs: &BinaryChunked) -> BooleanChunked
fn lt(&self, rhs: &BinaryChunked) -> BooleanChunked
Less than comparison.
source§fn lt_eq(&self, rhs: &BinaryChunked) -> BooleanChunked
fn lt_eq(&self, rhs: &BinaryChunked) -> BooleanChunked
Less than or equal comparison
source§fn gt(&self, rhs: &Self) -> BooleanChunked
fn gt(&self, rhs: &Self) -> BooleanChunked
Greater than comparison.
source§fn gt_eq(&self, rhs: &Self) -> BooleanChunked
fn gt_eq(&self, rhs: &Self) -> BooleanChunked
Greater than or equal comparison.
source§impl ChunkExpandAtIndex<BinaryType> for BinaryChunked
impl ChunkExpandAtIndex<BinaryType> for BinaryChunked
source§fn new_from_index(&self, index: usize, length: usize) -> BinaryChunked
fn new_from_index(&self, index: usize, length: usize) -> BinaryChunked
Create a new ChunkedArray filled with values at that index.
source§impl ChunkFillNullValue<&[u8]> for BinaryChunked
impl ChunkFillNullValue<&[u8]> for BinaryChunked
source§fn fill_null_with_values(&self, value: &[u8]) -> PolarsResult<Self>
fn fill_null_with_values(&self, value: &[u8]) -> PolarsResult<Self>
Replace None values with a give value
T
.source§impl ChunkFilter<BinaryType> for BinaryChunked
impl ChunkFilter<BinaryType> for BinaryChunked
source§fn filter(
&self,
filter: &BooleanChunked,
) -> PolarsResult<ChunkedArray<BinaryType>>
fn filter( &self, filter: &BooleanChunked, ) -> PolarsResult<ChunkedArray<BinaryType>>
Filter values in the ChunkedArray with a boolean mask. Read more
source§impl<'a> ChunkFull<&'a [u8]> for BinaryChunked
impl<'a> ChunkFull<&'a [u8]> for BinaryChunked
source§impl ChunkFullNull for BinaryChunked
impl ChunkFullNull for BinaryChunked
fn full_null(name: PlSmallStr, length: usize) -> Self
source§impl ChunkReverse for BinaryChunked
impl ChunkReverse for BinaryChunked
source§impl<'a> ChunkSet<'a, &'a [u8], Vec<u8>> for BinaryChunked
impl<'a> ChunkSet<'a, &'a [u8], Vec<u8>> for BinaryChunked
source§fn scatter_single<I: IntoIterator<Item = IdxSize>>(
&'a self,
idx: I,
opt_value: Option<&'a [u8]>,
) -> PolarsResult<Self>where
Self: Sized,
fn scatter_single<I: IntoIterator<Item = IdxSize>>(
&'a self,
idx: I,
opt_value: Option<&'a [u8]>,
) -> PolarsResult<Self>where
Self: Sized,
source§fn scatter_with<I: IntoIterator<Item = IdxSize>, F>(
&'a self,
idx: I,
f: F,
) -> PolarsResult<Self>
fn scatter_with<I: IntoIterator<Item = IdxSize>, F>( &'a self, idx: I, f: F, ) -> PolarsResult<Self>
Set the values at indexes
idx
by applying a closure to these values. Read moresource§fn set(
&'a self,
mask: &BooleanChunked,
value: Option<&'a [u8]>,
) -> PolarsResult<Self>where
Self: Sized,
fn set(
&'a self,
mask: &BooleanChunked,
value: Option<&'a [u8]>,
) -> PolarsResult<Self>where
Self: Sized,
source§impl ChunkShift<BinaryType> for BinaryChunked
impl ChunkShift<BinaryType> for BinaryChunked
source§impl ChunkShiftFill<BinaryType, Option<&[u8]>> for BinaryChunked
impl ChunkShiftFill<BinaryType, Option<&[u8]>> for BinaryChunked
source§fn shift_and_fill(
&self,
periods: i64,
fill_value: Option<&[u8]>,
) -> 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
.source§impl ChunkSort<BinaryType> for BinaryChunked
impl ChunkSort<BinaryType> for BinaryChunked
fn sort_with(&self, options: SortOptions) -> ChunkedArray<BinaryType>
source§fn sort(&self, descending: bool) -> ChunkedArray<BinaryType>
fn sort(&self, descending: bool) -> ChunkedArray<BinaryType>
Returned a sorted
ChunkedArray
.source§fn arg_sort(&self, options: SortOptions) -> IdxCa
fn arg_sort(&self, options: SortOptions) -> IdxCa
Retrieve the indexes needed to sort this array.
source§fn arg_sort_multiple(
&self,
by: &[Column],
options: &SortMultipleOptions,
) -> PolarsResult<IdxCa>
fn arg_sort_multiple( &self, by: &[Column], options: &SortMultipleOptions, ) -> PolarsResult<IdxCa>
Retrieve the indexes need to sort this and the other arrays.
source§impl ChunkTakeUnchecked<ChunkedArray<UInt32Type>> for BinaryChunked
impl ChunkTakeUnchecked<ChunkedArray<UInt32Type>> for BinaryChunked
source§unsafe fn take_unchecked(&self, indices: &IdxCa) -> Self
unsafe fn take_unchecked(&self, indices: &IdxCa) -> Self
Gather values from ChunkedArray by index.
source§impl<I: AsRef<[IdxSize]> + ?Sized> ChunkTakeUnchecked<I> for BinaryChunked
impl<I: AsRef<[IdxSize]> + ?Sized> ChunkTakeUnchecked<I> for BinaryChunked
source§unsafe fn take_unchecked(&self, indices: &I) -> Self
unsafe fn take_unchecked(&self, indices: &I) -> Self
Gather values from ChunkedArray by index.
source§impl ChunkUnique for BinaryChunked
Available on crate feature algorithm_group_by
only.
impl ChunkUnique for BinaryChunked
Available on crate feature
algorithm_group_by
only.source§fn unique(&self) -> PolarsResult<Self>
fn unique(&self) -> PolarsResult<Self>
Get unique values of a ChunkedArray
source§fn arg_unique(&self) -> PolarsResult<IdxCa>
fn arg_unique(&self) -> PolarsResult<IdxCa>
Get first index of the unique values in a
ChunkedArray
.
This Vec is sorted.source§fn n_unique(&self) -> PolarsResult<usize>
fn n_unique(&self) -> PolarsResult<usize>
Number of unique values in the
ChunkedArray
source§impl Debug for BinaryChunked
impl Debug for BinaryChunked
source§impl<Ptr> FromIterator<Option<Ptr>> for BinaryChunked
impl<Ptr> FromIterator<Option<Ptr>> for BinaryChunked
source§impl<Ptr> FromIterator<Ptr> for BinaryChunkedwhere
Ptr: PolarsAsRef<[u8]>,
impl<Ptr> FromIterator<Ptr> for BinaryChunkedwhere
Ptr: PolarsAsRef<[u8]>,
source§fn from_iter<I: IntoIterator<Item = Ptr>>(iter: I) -> Self
fn from_iter<I: IntoIterator<Item = Ptr>>(iter: I) -> Self
Creates a value from an iterator. Read more
source§impl<Ptr> FromParallelIterator<Option<Ptr>> for BinaryChunked
impl<Ptr> FromParallelIterator<Option<Ptr>> for BinaryChunked
source§fn from_par_iter<I: IntoParallelIterator<Item = Option<Ptr>>>(iter: I) -> Self
fn from_par_iter<I: IntoParallelIterator<Item = Option<Ptr>>>(iter: I) -> Self
Creates an instance of the collection from the parallel iterator
par_iter
. Read moresource§impl<Ptr> FromParallelIterator<Ptr> for BinaryChunked
impl<Ptr> FromParallelIterator<Ptr> for BinaryChunked
source§fn from_par_iter<I: IntoParallelIterator<Item = Ptr>>(iter: I) -> Self
fn from_par_iter<I: IntoParallelIterator<Item = Ptr>>(iter: I) -> Self
Creates an instance of the collection from the parallel iterator
par_iter
. Read moresource§impl<Ptr> FromTrustedLenIterator<Option<Ptr>> for BinaryChunked
impl<Ptr> FromTrustedLenIterator<Option<Ptr>> for BinaryChunked
fn from_iter_trusted_length<I: IntoIterator<Item = Option<Ptr>>>( iter: I, ) -> Self
source§impl<Ptr> FromTrustedLenIterator<Ptr> for BinaryChunkedwhere
Ptr: PolarsAsRef<[u8]>,
impl<Ptr> FromTrustedLenIterator<Ptr> for BinaryChunkedwhere
Ptr: PolarsAsRef<[u8]>,
fn from_iter_trusted_length<I: IntoIterator<Item = Ptr>>(iter: I) -> Self
source§impl IntoGroupsProxy for BinaryChunked
Available on crate feature algorithm_group_by
only.
impl IntoGroupsProxy for BinaryChunked
Available on crate feature
algorithm_group_by
only.source§fn group_tuples<'a>(
&'a self,
multithreaded: bool,
sorted: bool,
) -> PolarsResult<GroupsProxy>
fn group_tuples<'a>( &'a self, multithreaded: bool, sorted: bool, ) -> PolarsResult<GroupsProxy>
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.
source§impl<'a> IntoIterator for &'a BinaryChunked
impl<'a> IntoIterator for &'a BinaryChunked
§type IntoIter = Box<dyn PolarsIterator<Item = <&'a ChunkedArray<BinaryType> as IntoIterator>::Item> + 'a>
type IntoIter = Box<dyn PolarsIterator<Item = <&'a ChunkedArray<BinaryType> as IntoIterator>::Item> + 'a>
Which kind of iterator are we turning this into?
source§impl<'a, T: AsRef<[&'a [u8]]>> NamedFrom<T, [&'a [u8]]> for BinaryChunked
impl<'a, T: AsRef<[&'a [u8]]>> NamedFrom<T, [&'a [u8]]> for BinaryChunked
source§fn new(name: PlSmallStr, v: T) -> Self
fn new(name: PlSmallStr, v: T) -> Self
Initialize by name and values.
source§impl<'a, T: AsRef<[Cow<'a, [u8]>]>> NamedFrom<T, [Cow<'a, [u8]>]> for BinaryChunked
impl<'a, T: AsRef<[Cow<'a, [u8]>]>> NamedFrom<T, [Cow<'a, [u8]>]> for BinaryChunked
source§fn new(name: PlSmallStr, v: T) -> Self
fn new(name: PlSmallStr, v: T) -> Self
Initialize by name and values.
source§impl<'a, T: AsRef<[Option<&'a [u8]>]>> NamedFrom<T, [Option<&'a [u8]>]> for BinaryChunked
impl<'a, T: AsRef<[Option<&'a [u8]>]>> NamedFrom<T, [Option<&'a [u8]>]> for BinaryChunked
source§fn new(name: PlSmallStr, v: T) -> Self
fn new(name: PlSmallStr, v: T) -> Self
Initialize by name and values.
source§impl<'a, T: AsRef<[Option<Cow<'a, [u8]>>]>> NamedFrom<T, [Option<Cow<'a, [u8]>>]> for BinaryChunked
impl<'a, T: AsRef<[Option<Cow<'a, [u8]>>]>> NamedFrom<T, [Option<Cow<'a, [u8]>>]> for BinaryChunked
source§fn new(name: PlSmallStr, v: T) -> Self
fn new(name: PlSmallStr, v: T) -> Self
Initialize by name and values.
source§impl<B> NewChunkedArray<BinaryType, B> for BinaryChunked
impl<B> NewChunkedArray<BinaryType, B> for BinaryChunked
source§fn from_iter_values(name: PlSmallStr, it: impl Iterator<Item = B>) -> Self
fn from_iter_values(name: PlSmallStr, it: impl Iterator<Item = B>) -> Self
Create a new ChunkedArray from an iterator.
fn from_slice(name: PlSmallStr, v: &[B]) -> Self
fn from_slice_options(name: PlSmallStr, opt_v: &[Option<B>]) -> Self
source§fn from_iter_options(
name: PlSmallStr,
it: impl Iterator<Item = Option<B>>,
) -> Self
fn from_iter_options( name: PlSmallStr, it: impl Iterator<Item = Option<B>>, ) -> Self
Create a new ChunkedArray from an iterator.
source§impl VecHash for BinaryChunked
impl VecHash for BinaryChunked
source§fn vec_hash(
&self,
random_state: PlRandomState,
buf: &mut Vec<u64>,
) -> PolarsResult<()>
fn vec_hash( &self, random_state: PlRandomState, buf: &mut Vec<u64>, ) -> PolarsResult<()>
Compute the hash for all values in the array.