Struct SingletonTrieIter 

pub struct SingletonTrieIter { /* private fields */ }

Unary trie iterator holding a single usize value.

Equivalent to the paper’s “nonmaterialized view” of Const_a = {a} (Veldhuizen 2014 §3.4 point 4). Exposes exactly one tuple [value] through the TrieIterator / LinearIterator interface.

Implementations

impl SingletonTrieIter

pub fn new(value: usize) -> Self

Constructs a new singleton positioned at its root (pre-open).

Trait Implementations

impl Clone for SingletonTrieIter

fn clone(&self) -> SingletonTrieIter

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SingletonTrieIter

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

Formats the value using the given formatter.

impl IntoIterator for SingletonTrieIter

type IntoIter = TrieIteratorWrapper<SingletonTrieIter>

Which kind of iterator are we turning this into?

type Item = Vec<usize>

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl JoinIterable for SingletonTrieIter

impl LinearIterator for SingletonTrieIter

fn key(&self) -> Option<usize>

Returns the key at the iterator’s current position, otherwise None if next has not yet been called, or the iterator is positioned at the end.

fn next(&mut self) -> Option<usize>

Moves the iterator forward and returns the key at the new position.

fn seek(&mut self, seek_key: usize) -> bool

Positions the iterator at a least upper bound for the seek_key, i.e., the smallest key ≥ seek_key, or moves it to the end if no such key exists. Returns true iff the key exists.

fn at_end(&self) -> bool

Returns true iff the iterator is positioned at the end, i.e., one after the last key.

impl TrieIterable for SingletonTrieIter

fn trie_iter(&self) -> impl TrieIterator + IntoIterator<Item = Vec<usize>>

Returns a trie iterator over this structure that also implements IntoIterator, allowing it to be wrapped in a TrieIteratorWrapper for tuple-at-a-time consumption.

impl TrieIterator for SingletonTrieIter

fn open(&mut self) -> bool

If there is a child iterator at the iterator’s current position, repositions at said iterator and returns true, otherwise returns false.

fn up(&mut self) -> bool

If there is a parent iterator at the iterator’s current position, repositions at said iterator and returns true, otherwise returns false.