Struct differential_dataflow::trace::layers::ordered_leaf::OrderedLeaf
source · pub struct OrderedLeaf<K, R, C = Vec<(K, R)>>where
C: BatchContainer<Item = (K, R)> + Deref<Target = [(K, R)]>,{
pub vals: C,
}
Expand description
A layer of unordered values.
Fields§
§vals: C
Unordered values.
Trait Implementations§
source§impl<K, R, C> Abomonation for OrderedLeaf<K, R, C>where
C: BatchContainer<Item = (K, R)> + Deref<Target = [(K, R)]> + Abomonation,
impl<K, R, C> Abomonation for OrderedLeaf<K, R, C>where C: BatchContainer<Item = (K, R)> + Deref<Target = [(K, R)]> + Abomonation,
source§impl<K: Clone, R: Clone, C> Clone for OrderedLeaf<K, R, C>where
C: BatchContainer<Item = (K, R)> + Deref<Target = [(K, R)]> + Clone,
impl<K: Clone, R: Clone, C> Clone for OrderedLeaf<K, R, C>where C: BatchContainer<Item = (K, R)> + Deref<Target = [(K, R)]> + Clone,
source§fn clone(&self) -> OrderedLeaf<K, R, C>
fn clone(&self) -> OrderedLeaf<K, R, C>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<K: Clone, R: Clone, C> Cursor<OrderedLeaf<K, R, C>> for OrderedLeafCursorwhere
C: BatchContainer<Item = (K, R)> + Deref<Target = [(K, R)]>,
impl<K: Clone, R: Clone, C> Cursor<OrderedLeaf<K, R, C>> for OrderedLeafCursorwhere C: BatchContainer<Item = (K, R)> + Deref<Target = [(K, R)]>,
source§fn key<'a>(&self, storage: &'a OrderedLeaf<K, R, C>) -> &'a Self::Key
fn key<'a>(&self, storage: &'a OrderedLeaf<K, R, C>) -> &'a Self::Key
Reveals the current key.
source§fn step(&mut self, storage: &OrderedLeaf<K, R, C>)
fn step(&mut self, storage: &OrderedLeaf<K, R, C>)
Advances the cursor by one element.
source§fn seek(&mut self, _storage: &OrderedLeaf<K, R, C>, _key: &Self::Key)
fn seek(&mut self, _storage: &OrderedLeaf<K, R, C>, _key: &Self::Key)
Advances the cursor until the location where
key
would be expected.source§fn valid(&self, _storage: &OrderedLeaf<K, R, C>) -> bool
fn valid(&self, _storage: &OrderedLeaf<K, R, C>) -> bool
Returns
true
if the cursor points at valid data. Returns false
if the cursor is exhausted.source§fn rewind(&mut self, _storage: &OrderedLeaf<K, R, C>)
fn rewind(&mut self, _storage: &OrderedLeaf<K, R, C>)
Rewinds the cursor to its initial state.
source§fn reposition(
&mut self,
_storage: &OrderedLeaf<K, R, C>,
lower: usize,
upper: usize
)
fn reposition( &mut self, _storage: &OrderedLeaf<K, R, C>, lower: usize, upper: usize )
Repositions the cursor to a different range of values.
source§impl<K: Debug, R: Debug, C> Debug for OrderedLeaf<K, R, C>where
C: BatchContainer<Item = (K, R)> + Deref<Target = [(K, R)]> + Debug,
impl<K: Debug, R: Debug, C> Debug for OrderedLeaf<K, R, C>where C: BatchContainer<Item = (K, R)> + Deref<Target = [(K, R)]> + Debug,
source§impl<K: PartialEq, R: PartialEq, C> PartialEq for OrderedLeaf<K, R, C>where
C: BatchContainer<Item = (K, R)> + Deref<Target = [(K, R)]> + PartialEq,
impl<K: PartialEq, R: PartialEq, C> PartialEq for OrderedLeaf<K, R, C>where C: BatchContainer<Item = (K, R)> + Deref<Target = [(K, R)]> + PartialEq,
source§fn eq(&self, other: &OrderedLeaf<K, R, C>) -> bool
fn eq(&self, other: &OrderedLeaf<K, R, C>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<K: Ord + Clone, R: Semigroup + Clone, C> Trie for OrderedLeaf<K, R, C>where
C: BatchContainer<Item = (K, R)> + Deref<Target = [(K, R)]>,
impl<K: Ord + Clone, R: Semigroup + Clone, C> Trie for OrderedLeaf<K, R, C>where C: BatchContainer<Item = (K, R)> + Deref<Target = [(K, R)]>,
§type Cursor = OrderedLeafCursor
type Cursor = OrderedLeafCursor
The type of cursor used to navigate the type.
§type MergeBuilder = OrderedLeafBuilder<K, R, C>
type MergeBuilder = OrderedLeafBuilder<K, R, C>
The type used to merge instances of the type together.
§type TupleBuilder = OrderedLeafBuilder<K, R, C>
type TupleBuilder = OrderedLeafBuilder<K, R, C>
The type used to assemble instances of the type from its
Item
s.source§fn keys(&self) -> usize
fn keys(&self) -> usize
The number of distinct keys, as distinct from the total number of tuples.
impl<K: Eq, R: Eq, C> Eq for OrderedLeaf<K, R, C>where C: BatchContainer<Item = (K, R)> + Deref<Target = [(K, R)]> + Eq,
impl<K, R, C> StructuralEq for OrderedLeaf<K, R, C>where C: BatchContainer<Item = (K, R)> + Deref<Target = [(K, R)]>,
impl<K, R, C> StructuralPartialEq for OrderedLeaf<K, R, C>where C: BatchContainer<Item = (K, R)> + Deref<Target = [(K, R)]>,
Auto Trait Implementations§
impl<K, R, C> RefUnwindSafe for OrderedLeaf<K, R, C>where C: RefUnwindSafe,
impl<K, R, C> Send for OrderedLeaf<K, R, C>where C: Send,
impl<K, R, C> Sync for OrderedLeaf<K, R, C>where C: Sync,
impl<K, R, C> Unpin for OrderedLeaf<K, R, C>where C: Unpin,
impl<K, R, C> UnwindSafe for OrderedLeaf<K, R, C>where C: UnwindSafe,
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