Struct move_stackless_bytecode::access_path_trie::TrieNode

pub struct TrieNode<T: FootprintDomain> { /* private fields */ }

A node in the access Trie: data associated with the parent node + children mapping offsets to child nodes

Implementations

impl<T: FootprintDomain> TrieNode<T>

pub fn new(data: T) -> Self

pub fn new_opt(data: Option<T>) -> Self

pub fn join_data_opt_(data: &mut Option<T>, other: &Option<T>) -> JoinResult

Like join, but gracefully handles Non data fields by treating None as Bottom

pub fn join_data_opt(&mut self, other: &Option<T>) -> JoinResult

Like join, but gracefully handles None data fields by treating None as Bottom

pub fn join_child_data(&self, acc: Option<T>) -> Option<T>

pub fn get_child_data(&self) -> Option<T>

pub fn data(&self) -> &Option<T>

pub fn children(&self) -> &MapDomain<Offset, TrieNode<T>>

pub fn entry(&mut self, o: Offset) -> Entry<'_, Offset, TrieNode<T>>

pub fn get_offset(&self, o: &Offset) -> Option<&Self>

Return the node mapped to o from self (if any)

pub fn get_offset_mut(&mut self, o: &Offset) -> Option<&mut Self>

Return a mutable reference to the node mapped to o from self (if any)

pub fn remove_offset(&mut self, o: &Offset) -> Option<Self>

Removes the node mapped to o from self (if it exists)

pub fn keys_statically_known(&self) -> bool

Return true if self’s keys can be converted into a compact set of concrete access paths Note: this says nothing about the data part of self

pub fn substitute_footprint<F>(
    self,
    actuals: &[TempIndex],
    type_actuals: &[Type],
    func_env: &FunctionEnv<'_>,
    sub_map: &dyn AccessPathMap<AbsAddr>,
    sub_data: F
) -> Self where
    F: FnMut(&mut T, &[TempIndex], &[Type], &FunctionEnv<'_>, &dyn AccessPathMap<AbsAddr>) + Copy, 

Bind caller data in actuals, type_actuals, and sub_map to self. (1) Bind all free type variables in self to type_actuals (2) Apply sub_data to self.data and (recursively) to the data fields of self.children

pub fn iter_values<F>(&mut self, f: F) where
    F: FnMut(&mut TrieNode<T>) + Copy, 

Apply f to each node in self

pub fn iter_offsets<F>(&self, f: F) -> F where
    F: FnMut(&Offset), 

Apply f to each offset in self

Trait Implementations

impl<T: FootprintDomain> AbstractDomain for TrieNode<T>

fn join(&mut self, other: &Self) -> JoinResult

impl<T: Clone + FootprintDomain> Clone for TrieNode<T>

fn clone(&self) -> TrieNode<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + FootprintDomain> Debug for TrieNode<T>

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

Formats the value using the given formatter.

impl<T: FootprintDomain> Default for TrieNode<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: PartialEq + FootprintDomain> PartialEq<TrieNode<T>> for TrieNode<T>

fn eq(&self, other: &TrieNode<T>) -> 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<T: PartialOrd + FootprintDomain> PartialOrd<TrieNode<T>> for TrieNode<T>

fn partial_cmp(&self, other: &TrieNode<T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: Eq + FootprintDomain> Eq for TrieNode<T>

impl<T: FootprintDomain> StructuralEq for TrieNode<T>

impl<T: FootprintDomain> StructuralPartialEq for TrieNode<T>