Module move_stackless_bytecode::access_path_trie
source · [−]Expand description
The obvious approach to abstracting a set of concrete paths is using a set of abstract paths.
An access path trie represents a set of paths in a way that avoids redundant representations of
the same memory. Root nodes are access path roots and each internal node is an access path offset.
Each node is (optionally) associated with abstract value of a generic type T.
Structs
Set of (root node, child) associations
A node in the access Trie: data associated with the parent node + children mapping offsets to child nodes