Struct Leaf 

pub struct Leaf<K: DataTrait + ?Sized, R: WeightTrait + ?Sized> { /* private fields */ }

Implementations

impl<K: DataTrait + ?Sized, R: WeightTrait + ?Sized> Leaf<K, R>

pub fn new(factories: &LeafFactories<K, R>) -> Self

pub fn with_capacity(factories: &LeafFactories<K, R>, capacity: usize) -> Self

pub fn from_parts( factories: &LeafFactories<K, R>, keys: Box<DynVec<K>>, diffs: Box<DynVec<R>>, ) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn sample_keys<RG>( &self, rng: &mut RG, sample_size: usize, output: &mut DynVec<K>, )

where RG: Rng,

Compute a random sample of size sample_size of keys in self.keys.

Pushes the random sample of keys to the output vector in ascending order.

Trait Implementations

impl<K: DataTrait + ?Sized, R: WeightTrait + ?Sized> AddAssignByRef for Leaf<K, R>

fn add_assign_by_ref(&mut self, other: &Self)

impl<K: DataTrait + ?Sized, R: WeightTrait + ?Sized> AddByRef for Leaf<K, R>

fn add_by_ref(&self, rhs: &Self) -> Self

impl<K: DataTrait + ?Sized, R: WeightTrait + ?Sized> Clone for Leaf<K, R>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: DataTrait + ?Sized, R: WeightTrait + ?Sized> Debug for Leaf<K, R>

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

Formats the value using the given formatter.

impl<K: DataTrait + ?Sized, R: WeightTrait + ?Sized> Display for Leaf<K, R>

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

Formats the value using the given formatter.

impl<K: DataTrait + ?Sized, R: WeightTrait + ?Sized> Eq for Leaf<K, R>

impl<K: DataTrait + ?Sized, R: WeightTraitTyped + ?Sized> Neg for Leaf<K, R>

where R::Type: DBWeight + ZRingValue,

type Output = Leaf<K, R>

The resulting type after applying the - operator.

fn neg(self) -> Self

Performs the unary - operation.

impl<K: DataTrait + ?Sized, R: WeightTraitTyped + ?Sized> NegByRef for Leaf<K, R>

where R::Type: DBWeight + ZRingValue + Erase<R>,

fn neg_by_ref(&self) -> Self

impl<K: DataTrait + ?Sized, R: WeightTrait + ?Sized> NumEntries for Leaf<K, R>

const CONST_NUM_ENTRIES: Option<usize> = None

Returns Some(n) if Self has constant size or None otherwise.

fn num_entries_shallow(&self) -> usize

Returns the number of entries in self.

fn num_entries_deep(&self) -> usize

Recursively computes the number of entries in a container by calling this method on each entry in self.

impl<K: DataTrait + ?Sized, R: WeightTrait + ?Sized> PartialEq for Leaf<K, R>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<K: DataTrait + ?Sized, R: WeightTrait + ?Sized> SizeOf for Leaf<K, R>

where Box<DynVec<K>>: SizeOf, Box<DynVec<R>>: SizeOf,

fn size_of_children(&self, context: &mut Context)

Gets the size of all “children” owned by this value, not including the size of the value itself.

fn size_of(&self) -> TotalSize

Gets the total size of the current value

fn size_of_with_context(&self, context: &mut Context)

Adds the size of the current value to the given Context, including both the size of the value itself and all of its children

impl<K: DataTrait + ?Sized, R: WeightTrait + ?Sized> Trie for Leaf<K, R>

type Item<'a> = (&'a mut K, &'a mut R)

The type of item from which the type is constructed.

type ItemRef<'a> = (&'a K, &'a R)

type Cursor<'s> = LeafCursor<'s, K, R>

The type of cursor used to navigate the type.

type Factories = LeafFactories<K, R>

type MergeBuilder = LeafBuilder<K, R>

The type used to merge instances of the type together.

type TupleBuilder = LeafBuilder<K, R>

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

type LeafKey = K

The key type of the leaf sub-trie of this trie.

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 approximate_byte_size(&self) -> usize

Compute an approximate byte size of the collection.

fn is_empty(&self) -> bool

True if self.keys() is zero.

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.