Struct LeapfrogJoin 

pub struct LeapfrogJoin<'a> { /* private fields */ }

Leapfrog trie join implementation.

This performs worst-case optimal joins over multiple trie iterators.

Implementations

impl<'a> LeapfrogJoin<'a>

pub fn new(iters: Vec<TrieIterator<'a>>) -> Self

Creates a new leapfrog join over the given iterators.

All iterators must be at the same level (representing the same variable).

pub fn key(&self) -> Option<NodeId>

Returns the current intersection key.

pub fn next(&mut self) -> bool

Advances to the next intersection.

pub fn open(&self) -> Option<Vec<TrieIterator<'a>>>

Opens the current level and returns iterators for the next level.