Struct CppTreeIdentity 

pub struct CppTreeIdentity { /* private fields */ }

Which tree a CppNamespaceForwardScan was folded out of.

A region reparse is its own tree and is dropped while the walk that made it continues, so a later parse can be allocated at the same address and hand out the same node ids. The root’s span and shape pin the identity its address alone does not: two roots agreeing on all of this are the same parse of the same bytes, and a scan of one is a scan of the other.

Trait Implementations

impl Eq for CppTreeIdentity

impl Hash for CppTreeIdentity

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for CppTreeIdentity

fn eq(&self, other: &CppTreeIdentity) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for CppTreeIdentity