struct DictionaryCache {
values: Weak<dyn Array>,
interned: Vec<u64>,
}Expand description
The interned index of each value of an arrow dictionary, so each value is hashed once rather than once per row that references it
Fields§
§values: Weak<dyn Array>The dictionary’s values, to identify the dictionary in later batches. A weak reference, so the values aren’t kept alive, while their allocation can’t be reused by another dictionary
interned: Vec<u64>The interned index of each value, or DictionaryCache::NOT_INTERNED
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl !RefUnwindSafe for DictionaryCache
impl !UnwindSafe for DictionaryCache
impl Forget for DictionaryCache
impl Freeze for DictionaryCache
impl Move for DictionaryCache
impl Send for DictionaryCache
impl Sync for DictionaryCache
impl Unpin for DictionaryCache
impl UnsafeUnpin for DictionaryCache
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more