Struct Trie 

pub struct Trie<V> { /* private fields */ }

Hierarchical prefix tree

Implementations

impl<V> Trie<V>

pub fn new() -> Self

Construct an empty Trie.

pub fn is_empty(&self) -> bool

Return true if a Trie is empty (has no leaf or internal nodes), otherwise false.

pub fn has_leaf_node(&self, addr: &str) -> bool

Return true if a Trie has a leaf node at addr, otherwise false.

pub fn get_leaf_node(&self, addr: &str) -> Option<&V>

Return Some(&value) if self contains a value located at addr, otherwise None.

pub fn insert_leaf_node(&mut self, addr: &str, value: V) -> Option<V>

Insert value as a leaf node located at addr.

If there was a value prev located at addr, return Some(prev), otherwise None.

pub fn remove_leaf_node(&mut self, addr: &str) -> Option<V>

Return Some(value) if self contains a value located at addr and remove value from the leaf nodes, otherwise return None.

pub fn leaf_iter(&self) -> Iter<'_, String, V>

Return an iterator over a Trie’s leaf nodes.

pub fn has_internal_node(&self, addr: &str) -> bool

Return true if a Trie has an internal node at addr, otherwise false.

pub fn get_internal_node(&self, addr: &str) -> Option<&Self>

Return Some(&subtrie) if self contains a subtrie located at addr, otherwise None.

pub fn insert_internal_node( &mut self, addr: &str, new_node: Self, ) -> Option<Trie<V>>

Insert subtrie as an internal node located at addr.

If there was a value prev_subtrie located at addr, return Some(prev_subtrie), otherwise None. Panics if subtrie.is_empty().

pub fn remove_internal_node(&mut self, addr: &str) -> Option<Trie<V>>

Return Some(subtrie) if self contains a subtrie located at addr and remove subtrie from the internal nodes, otherwise return None.

pub fn internal_iter(&self) -> Iter<'_, String, Trie<V>>

Return an iterator over a Trie’s internal nodes.

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

Merge other into self, freeing previous values and subtries at each addr in self if other also has an entry at addr.

Returns the mutated self.

impl<V> Trie<(V, f64)>

pub fn sum(&self) -> f64

Return the sum of all the weights of the leaf nodes and the recursive sum of all internal nodes.

pub fn into_unweighted(self) -> Trie<V>

Convert a weighted Trie into the equivalent unweighted version by discarding all the weights.

pub fn from_unweighted(trie: Trie<V>) -> Self

Convert an unweighted Trie into the equivalent weighted version by adding a weight of 0. to all leaf nodes.

impl Trie<Rc<dyn Any>>

pub fn read<V: 'static + Clone>(&self, addr: &str) -> V

Optimistically casts the reference-counted dyn Any at addr into type V, and returns a cloned value.

impl Trie<(Rc<dyn Any>, f64)>

pub fn read<V: 'static + Clone>(&self, addr: &str) -> V

Optimistically casts the reference-counted dyn Any at addr into type V, and returns a cloned value.

impl Trie<()>

pub fn schema<V>(data: &Trie<V>) -> Self

Return the unique AddrTrie that contains an addr if and only if data contains that addr.

pub fn visit(&mut self, addr: &str)

Add an address to the AddrTrie.

pub fn all_visited<T>(&self, data: &Trie<T>) -> bool

Return true if every addr in data is also present in self.

pub fn get_unvisited<V>(&self, data: &Trie<V>) -> Self

Return the AddrTrie that contains all addresses present in data, but not present in self.

Trait Implementations

impl<V: Clone> Clone for Trie<V>

fn clone(&self) -> Trie<V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: Debug> Debug for Trie<V>

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

Formats the value using the given formatter.

impl<Args: Clone + 'static, Ret: 'static> GenFn<Args, Trie<(Rc<dyn Any>, f64)>, Ret> for TrieFn<Args, Ret>

fn simulate(&self, args: Args) -> Trace<Args, Trie<(Rc<dyn Any>, f64)>, Ret>

Execute the generative function and return a sampled trace.

fn generate( &self, args: Args, constraints: Trie<(Rc<dyn Any>, f64)>, ) -> (Trace<Args, Trie<(Rc<dyn Any>, f64)>, Ret>, f64)

Execute the generative function consistent with constraints. Return the log probability log[p(t; args) / q(t; constraints, args)]

fn update( &self, trace: Trace<Args, Trie<(Rc<dyn Any>, f64)>, Ret>, args: Args, _: GfDiff, constraints: Trie<(Rc<dyn Any>, f64)>, ) -> (Trace<Args, Trie<(Rc<dyn Any>, f64)>, Ret>, Trie<(Rc<dyn Any>, f64)>, f64)

Update a trace

fn call(&self, args: Args) -> Ret

Call a generative function and return the output.

fn propose(&self, args: Args) -> (Data, f64)

Use a generative function to propose some data.

fn assess(&self, args: Args, constraints: Data) -> f64

Assess the conditional probability of some proposed constraints under a generative function.

impl<V> Index<&str> for Trie<V>

type Output = V

The returned type after indexing.

fn index(&self, index: &str) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<V: PartialEq> PartialEq for Trie<V>

fn eq(&self, other: &Trie<V>) -> 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<V> StructuralPartialEq for Trie<V>