Struct differential_dataflow::trace::layers::ordered::OrderedLayer

pub struct OrderedLayer<K: Ord, L> {
    pub keys: Vec<K>,
    pub offs: Vec<usize>,
    pub vals: L,
}

A level of the trie, with keys and offsets into a lower layer.

In this representation, the values for keys[i] are found at vals[offs[i] .. offs[i+1]].

Fields

keys: Vec<K>

The keys of the layer.

offs: Vec<usize>

The offsets associate with each key.

The bounds for keys[i] are (offs[i], offs[i+1]). The offset array is guaranteed to be one element longer than the keys array, ensuring that these accesses do not panic.

vals: L

The ranges of values associated with the keys.

Trait Implementations

impl<K: Ord, L> Abomonation for OrderedLayer<K, L>where
    Vec<K>: Abomonation,
    K: Abomonation,
    L: Abomonation,

unsafe fn entomb<W: Write>(&self, _write: &mut W) -> Result<()>

Write any additional information about &self beyond its binary representation.

fn extent(&self) -> usize

Reports the number of further bytes required to entomb self.

unsafe fn exhume<'a, 'b>(
    &'a mut self,
    bytes: &'b mut [u8]
) -> Option<&'b mut [u8]>

Recover any information for &mut self not evident from its binary representation.

impl<K: Clone + Ord, L: Clone> Clone for OrderedLayer<K, L>

fn clone(&self) -> OrderedLayer<K, L>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K: Ord, L: Trie> Cursor<OrderedLayer<K, L>> for OrderedCursor<L>

type Key = K

The type revealed by the cursor.

fn key<'a>(&self, storage: &'a OrderedLayer<K, L>) -> &'a Self::Key

Reveals the current key.

fn step(&mut self, storage: &OrderedLayer<K, L>)

Advances the cursor by one element.

fn seek(&mut self, storage: &OrderedLayer<K, L>, key: &Self::Key)

Advances the cursor until the location where key would be expected.

fn valid(&self, _storage: &OrderedLayer<K, L>) -> bool

Returns true if the cursor points at valid data. Returns false if the cursor is exhausted.

fn rewind(&mut self, storage: &OrderedLayer<K, L>)

Rewinds the cursor to its initial state.

fn reposition(&mut self, storage: &OrderedLayer<K, L>, lower: usize, upper: usize)

Repositions the cursor to a different range of values.

impl<K: Debug + Ord, L: Debug> Debug for OrderedLayer<K, L>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<K: PartialEq + Ord, L: PartialEq> PartialEq<OrderedLayer<K, L>> for OrderedLayer<K, L>

fn eq(&self, other: &OrderedLayer<K, L>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K: Ord + Clone, L: Trie> Trie for OrderedLayer<K, L>

type Item = (K, <L as Trie>::Item)

The type of item from which the type is constructed.

type Cursor = OrderedCursor<L>

The type of cursor used to navigate the type.

type MergeBuilder = OrderedBuilder<K, <L as Trie>::MergeBuilder>

The type used to merge instances of the type together.

type TupleBuilder = OrderedBuilder<K, <L as Trie>::TupleBuilder>

The type used to assemble instances of the type from its Items.

fn keys(&self) -> usize

The number of distinct keys, as distinct from the total number of tuples.

fn tuples(&self) -> usize

The total number of tuples in the collection.

fn cursor_from(&self, lower: usize, upper: usize) -> Self::Cursor

Returns a cursor over a range of data, commonly used by others to restrict navigation to sub-collections.

fn cursor(&self) -> Self::Cursor

Returns a cursor capable of navigating the collection.

fn merge(&self, other: &Self) -> Self

Merges two collections into a third.

impl<K: Eq + Ord, L: Eq> Eq for OrderedLayer<K, L>

impl<K: Ord, L> StructuralEq for OrderedLayer<K, L>

impl<K: Ord, L> StructuralPartialEq for OrderedLayer<K, L>