pub struct DictionaryArray<K> where
K: DictionaryKey, { /* private fields */ }
Expand description
Implementations
sourceimpl<'a, K> DictionaryArray<K> where
K: DictionaryKey,
impl<'a, K> DictionaryArray<K> where
K: DictionaryKey,
sourcepub fn iter(
&'a self
) -> ZipValidity<'a, Box<dyn Scalar + 'static, Global>, DictionaryValuesIter<'a, K>>ⓘNotable traits for ZipValidity<'a, T, I>impl<'a, T, I> Iterator for ZipValidity<'a, T, I> where
I: Iterator<Item = T>, type Item = Option<T>;
pub fn iter(
&'a self
) -> ZipValidity<'a, Box<dyn Scalar + 'static, Global>, DictionaryValuesIter<'a, K>>ⓘNotable traits for ZipValidity<'a, T, I>impl<'a, T, I> Iterator for ZipValidity<'a, T, I> where
I: Iterator<Item = T>, type Item = Option<T>;
I: Iterator<Item = T>, type Item = Option<T>;
Returns an iterator of Option<Box<dyn Array>>
sourcepub fn values_iter(&'a self) -> DictionaryValuesIter<'a, K>
pub fn values_iter(&'a self) -> DictionaryValuesIter<'a, K>
Returns an iterator of Box<dyn Array>
sourceimpl<K> DictionaryArray<K> where
K: DictionaryKey,
impl<K> DictionaryArray<K> where
K: DictionaryKey,
sourcepub fn new_empty(data_type: DataType) -> DictionaryArray<K>
pub fn new_empty(data_type: DataType) -> DictionaryArray<K>
Returns a new empty DictionaryArray
.
sourcepub fn new_null(data_type: DataType, length: usize) -> DictionaryArray<K>
pub fn new_null(data_type: DataType, length: usize) -> DictionaryArray<K>
Returns an DictionaryArray
whose all elements are null
sourcepub fn from_data(
keys: PrimitiveArray<K>,
values: Arc<dyn Array + 'static>
) -> DictionaryArray<K>
pub fn from_data(
keys: PrimitiveArray<K>,
values: Arc<dyn Array + 'static>
) -> DictionaryArray<K>
The canonical method to create a new DictionaryArray
.
sourcepub fn slice(&self, offset: usize, length: usize) -> DictionaryArray<K>
pub fn slice(&self, offset: usize, length: usize) -> DictionaryArray<K>
Creates a new DictionaryArray
by slicing the existing DictionaryArray
.
Panics
iff offset + length > self.len()
.
sourcepub unsafe fn slice_unchecked(
&self,
offset: usize,
length: usize
) -> DictionaryArray<K>
pub unsafe fn slice_unchecked(
&self,
offset: usize,
length: usize
) -> DictionaryArray<K>
Creates a new DictionaryArray
by slicing the existing DictionaryArray
.
Safety
Safe iff offset + length <= self.len()
.
sourcepub fn with_validity(&self, validity: Option<Bitmap>) -> DictionaryArray<K>
pub fn with_validity(&self, validity: Option<Bitmap>) -> DictionaryArray<K>
sourceimpl<K> DictionaryArray<K> where
K: DictionaryKey,
impl<K> DictionaryArray<K> where
K: DictionaryKey,
sourcepub fn validity(&self) -> Option<&Bitmap>
pub fn validity(&self) -> Option<&Bitmap>
The optional validity. Equivalent to self.keys().validity()
.
sourcepub fn keys(&self) -> &PrimitiveArray<K>
pub fn keys(&self) -> &PrimitiveArray<K>
Returns the keys of the DictionaryArray
. These keys can be used to fetch values
from values
.
sourcepub fn values(&self) -> &Arc<dyn Array + 'static>
pub fn values(&self) -> &Arc<dyn Array + 'static>
Returns the values of the DictionaryArray
.
Trait Implementations
sourceimpl<K> Array for DictionaryArray<K> where
K: DictionaryKey,
impl<K> Array for DictionaryArray<K> where
K: DictionaryKey,
sourcefn data_type(&self) -> &DataType
fn data_type(&self) -> &DataType
The DataType
of the Array
. In combination with Array::as_any
, this can be
used to downcast trait objects (dyn Array
) to concrete arrays. Read more
sourceunsafe fn slice_unchecked(
&self,
offset: usize,
length: usize
) -> Box<dyn Array + 'static, Global>
unsafe fn slice_unchecked(
&self,
offset: usize,
length: usize
) -> Box<dyn Array + 'static, Global>
sourcefn null_count(&self) -> usize
fn null_count(&self) -> usize
sourceimpl<K> Clone for DictionaryArray<K> where
K: Clone + DictionaryKey,
impl<K> Clone for DictionaryArray<K> where
K: Clone + DictionaryKey,
sourcefn clone(&self) -> DictionaryArray<K>
fn clone(&self) -> DictionaryArray<K>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
sourceimpl<K> Debug for DictionaryArray<K> where
K: DictionaryKey,
impl<K> Debug for DictionaryArray<K> where
K: DictionaryKey,
sourceimpl<'_> From<&'_ CategoricalChunked> for DictionaryArray<u32>
impl<'_> From<&'_ CategoricalChunked> for DictionaryArray<u32>
sourcefn from(ca: &CategoricalChunked) -> DictionaryArray<u32>
fn from(ca: &CategoricalChunked) -> DictionaryArray<u32>
Performs the conversion.
sourceimpl<'_> From<&'_ CategoricalChunked> for DictionaryArray<i64>
impl<'_> From<&'_ CategoricalChunked> for DictionaryArray<i64>
sourcefn from(ca: &CategoricalChunked) -> DictionaryArray<i64>
fn from(ca: &CategoricalChunked) -> DictionaryArray<i64>
Performs the conversion.
sourceimpl<'a, T> From<GrowableDictionary<'a, T>> for DictionaryArray<T> where
T: DictionaryKey,
impl<'a, T> From<GrowableDictionary<'a, T>> for DictionaryArray<T> where
T: DictionaryKey,
sourcefn from(val: GrowableDictionary<'a, T>) -> DictionaryArray<T>
fn from(val: GrowableDictionary<'a, T>) -> DictionaryArray<T>
Performs the conversion.
sourceimpl<K, M> From<MutableDictionaryArray<K, M>> for DictionaryArray<K> where
K: DictionaryKey,
M: MutableArray,
impl<K, M> From<MutableDictionaryArray<K, M>> for DictionaryArray<K> where
K: DictionaryKey,
M: MutableArray,
sourcefn from(other: MutableDictionaryArray<K, M>) -> DictionaryArray<K>
fn from(other: MutableDictionaryArray<K, M>) -> DictionaryArray<K>
Performs the conversion.
sourceimpl<'a, K> IntoIterator for &'a DictionaryArray<K> where
K: DictionaryKey,
impl<'a, K> IntoIterator for &'a DictionaryArray<K> where
K: DictionaryKey,
type IntoIter = ZipValidity<'a, Box<dyn Scalar + 'static, Global>, DictionaryValuesIter<'a, K>>
type IntoIter = ZipValidity<'a, Box<dyn Scalar + 'static, Global>, DictionaryValuesIter<'a, K>>
Which kind of iterator are we turning this into?
sourcefn into_iter(self) -> <&'a DictionaryArray<K> as IntoIterator>::IntoIter
fn into_iter(self) -> <&'a DictionaryArray<K> as IntoIterator>::IntoIter
Creates an iterator from a value. Read more
sourceimpl<'_, K> PartialEq<&'_ (dyn Array + '_)> for DictionaryArray<K> where
K: DictionaryKey,
impl<'_, K> PartialEq<&'_ (dyn Array + '_)> for DictionaryArray<K> where
K: DictionaryKey,
sourceimpl<K> PartialEq<DictionaryArray<K>> for DictionaryArray<K> where
K: DictionaryKey,
impl<K> PartialEq<DictionaryArray<K>> for DictionaryArray<K> where
K: DictionaryKey,
Auto Trait Implementations
impl<K> !RefUnwindSafe for DictionaryArray<K>
impl<K> Send for DictionaryArray<K>
impl<K> Sync for DictionaryArray<K>
impl<K> Unpin for DictionaryArray<K>
impl<K> !UnwindSafe for DictionaryArray<K>
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T> Pointable for T
impl<T> Pointable for T
sourceimpl<A> PolarsArray for A where
A: Array + ?Sized,
impl<A> PolarsArray for A where
A: Array + ?Sized,
fn has_validity(&self) -> bool
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcefn clone_into(&self, target: &mut T)
fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more