Struct hyper_ast::store::nodes::legion::HashedNodeRef

#[repr(transparent)]
pub struct HashedNodeRef<'a, T = NodeIdentifier>(_, _);

Implementations

impl<'a, Id: TypedNodeId<IdN = NodeIdentifier>> HashedNodeRef<'a, Id>

pub fn get_bytes_len(&self, _p_indent_len: u32) -> u32where Id::Ty: 'static + TypeTrait + Send + Sync + Debug,

impl<'a, Id: 'static + TypedNodeId<IdN = NodeIdentifier>> HashedNodeRef<'a, Id>

pub fn try_get_bytes_len(&self, _p_indent_len: u32) -> Option<u32>where Id::Ty: HyperType + Copy + Send + Sync,

pub fn is_directory(&self) -> boolwhere Id: HyperType + Copy + Send + Sync,

impl<'a, T> HashedNodeRef<'a, T>

pub fn archetype(&self) -> &Archetype

Returns the entity’s archetype.

pub fn location(&self) -> EntityLocation

Returns the entity’s location.

pub fn into_component<C: Component>(self) -> Result<&'a C, ComponentError>

Returns a reference to one of the entity’s components.

pub unsafe fn into_component_unchecked<C: Component>( self ) -> Result<&'a mut C, ComponentError>

Returns a mutable reference to one of the entity’s components.

Safety

This function bypasses static borrow checking. The caller must ensure that the component reference will not be mutably aliased.

pub fn get_component<C: Component>(&self) -> Result<&C, ComponentError>

Returns a reference to one of the entity’s components.

pub unsafe fn get_component_unchecked<C: Component>( &self ) -> Result<&mut C, ComponentError>

Returns a mutable reference to one of the entity’s components.

Safety

This function bypasses static borrow checking. The caller must ensure that the component reference will not be mutably aliased.

pub fn get_child_by_name( &self, name: &<HashedNodeRef<'a, T> as Labeled>::Label ) -> Option<<HashedNodeRef<'a, T> as Stored>::TreeId>

pub fn get_child_idx_by_name( &self, name: &<HashedNodeRef<'a, T> as Labeled>::Label ) -> Option<<HashedNodeRef<'a, T> as WithChildren>::ChildIdx>

pub fn try_get_children_name( &self ) -> Option<&[<HashedNodeRef<'a, T> as Labeled>::Label]>

impl<'a, Id: TypedNodeId<IdN = NodeIdentifier>> HashedNodeRef<'a, Id>where Id::Ty: 'static + Sync + Send + TypeTrait,

pub fn into_compressed_node( &self ) -> Result<CompressedNode<Entity, LabelIdentifier, Id::Ty>, ComponentError>

impl<'a, T> HashedNodeRef<'a, T>

pub fn size_no_spaces(&self) -> usize

impl<'a, T> HashedNodeRef<'a, T>

pub fn cs( &self ) -> Result<&<Self as WithChildren>::Children<'_>, ComponentError>

pub fn no_spaces( &self ) -> Result<&<Self as WithChildren>::Children<'_>, ComponentError>

Trait Implementations

impl<'a, T> AsRef<HashedNodeRef<'a, T>> for HashedNodeRef<'a, T>

fn as_ref(&self) -> &HashedNodeRef<'a, T>

Converts this type into a shared reference of the (usually inferred) input type.

impl<'a, Id: TypedNodeId<IdN = NodeIdentifier>> Debug for HashedNodeRef<'a, Id>

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

Formats the value using the given formatter.

impl<'a, Id> Deref for HashedNodeRef<'a, Id>

type Target = EntryRef<'a>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<'a, Id: TypedNodeId<IdN = NodeIdentifier>> Hash for HashedNodeRef<'a, Id>

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<'a, T> Labeled for HashedNodeRef<'a, T>

type Label = SymbolU32

fn get_label_unchecked(&self) -> &LabelIdentifier

fn try_get_label(&self) -> Option<&Self::Label>

impl<'a, Id: TypedNodeId<IdN = NodeIdentifier>> PartialEq<HashedNodeRef<'a, Id>> for HashedNodeRef<'a, Id>

fn eq(&self, other: &Self) -> 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<'a, T> RefContainer for HashedNodeRef<'a, T>

type Result = BloomResult

fn check<U: MySerialize + Keyed<usize>>(&self, rf: U) -> Self::Result

impl<'a, T> Stored for HashedNodeRef<'a, T>

type TreeId = Entity

impl<'a, Id: 'static + TypedNodeId<IdN = NodeIdentifier>> Tree for HashedNodeRef<'a, Id>

fn has_children(&self) -> bool

fn has_label(&self) -> bool

impl<'a, Id: 'static + TypedNodeId<IdN = NodeIdentifier>> Typed for HashedNodeRef<'a, Id>

type Type = <Id as TypedNodeId>::Ty

fn get_type(&self) -> Id::Tywhere Id::Ty: Copy + Send + Sync,

impl<'a, T> WithChildren for HashedNodeRef<'a, T>

type ChildIdx = u16

type Children<'b> = MySlice<<HashedNodeRef<'a, T> as Stored>::TreeId> where Self: 'b

fn child_count(&self) -> u16

fn child(&self, idx: &Self::ChildIdx) -> Option<Self::TreeId>

fn child_rev(&self, idx: &Self::ChildIdx) -> Option<Self::TreeId>

fn children(&self) -> Option<&Self::Children<'_>>

impl<'a, T> WithHashs for HashedNodeRef<'a, T>

type HK = SyntaxNodeHashsKinds

type HP = u32

fn hash(&self, kind: &Self::HK) -> Self::HP

impl<'a, T, C: Component> WithMetaData<C> for HashedNodeRef<'a, T>

fn get_metadata(&self) -> Option<&C>

impl<'a, T> WithSerialization for HashedNodeRef<'a, T>

fn try_bytes_len(&self) -> Option<usize>

impl<'a, T> WithStats for HashedNodeRef<'a, T>

fn size(&self) -> usize

fn height(&self) -> usize

impl<'a, Id: TypedNodeId<IdN = NodeIdentifier>> Eq for HashedNodeRef<'a, Id>

impl<'a, T> Node for HashedNodeRef<'a, T>