Struct LocationTree 

pub struct LocationTree {
    pub perms: UniValMap<LocationState>,
    pub wildcard_accesses: UniValMap<WildcardState>,
}

The state of the full tree for a particular location: for all nodes, the local permissions of that node, and the tracking for wildcard accesses.

Fields

perms: UniValMap<LocationState>

Maps a tag to a perm, with possible lazy initialization.

NOTE: not all tags registered in Tree::nodes are necessarily in all ranges of perms, because perms is in part lazily initialized. Just because nodes.get(key) is Some(_) does not mean you can safely unwrap any perm.get(key).

We do uphold the fact that keys(perms) is a subset of keys(nodes)

wildcard_accesses: UniValMap<WildcardState>

Maps a tag and a location to its wildcard access tracking information, with possible lazy initialization.

If this allocation doesn’t have any exposed nodes, then this map doesn’t get initialized. This way we only need to allocate the map if we need it.

NOTE: same guarantees on entry initialization as for perms.

Trait Implementations

impl Clone for LocationTree

fn clone(&self) -> LocationTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for LocationTree

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

Formats the value using the given formatter.

impl PartialEq for LocationTree

fn eq(&self, other: &LocationTree) -> 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 Eq for LocationTree

impl StructuralPartialEq for LocationTree

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 48 bytes