Struct ArchivedDependentNode 

#[repr(C)]
pub struct ArchivedDependentNode<K, T, S>
where
    K: Hash + Copy + Eq + Ord + Archive,
    S: BuildHasher + Default + Clone,
    Option<K>: Archive,
    IndexSet<K, S>: Archive,
    bool: Archive,
    T: Archive,
{
    pub id: <K as Archive>::Archived,
    pub from: <Option<K> as Archive>::Archived,
    pub to: <IndexSet<K, S> as Archive>::Archived,
    pub active: <bool as Archive>::Archived,
    pub bookmarked: <bool as Archive>::Archived,
    pub contents: <T as Archive>::Archived,
}

An archived DependentNode

Fields

id: <K as Archive>::Archived

The archived counterpart of DependentNode::id

from: <Option<K> as Archive>::Archived

The archived counterpart of DependentNode::from

to: <IndexSet<K, S> as Archive>::Archived

The archived counterpart of DependentNode::to

active: <bool as Archive>::Archived

The archived counterpart of DependentNode::active

bookmarked: <bool as Archive>::Archived

The archived counterpart of DependentNode::bookmarked

contents: <T as Archive>::Archived

The archived counterpart of DependentNode::contents

Trait Implementations

impl<K, T, S, __C: Fallible + ?Sized> CheckBytes<__C> for ArchivedDependentNode<K, T, S>

where K: Hash + Copy + Eq + Ord + Archive, S: BuildHasher + Default + Clone, Option<K>: Archive, IndexSet<K, S>: Archive, bool: Archive, T: Archive, <__C as Fallible>::Error: Trace, <K as Archive>::Archived: CheckBytes<__C>, <Option<K> as Archive>::Archived: CheckBytes<__C>, <IndexSet<K, S> as Archive>::Archived: CheckBytes<__C>, <bool as Archive>::Archived: CheckBytes<__C>, <T as Archive>::Archived: CheckBytes<__C>,

unsafe fn check_bytes( value: *const Self, context: &mut __C, ) -> Result<(), <__C as Fallible>::Error>

Checks whether the given pointer points to a valid value within the given context.

impl<K, T, M, S> ImmutableActiveSingularWeave<<K as Archive>::Archived, ArchivedDependentNode<K, T, S>, <T as Archive>::Archived> for ArchivedDependentWeave<K, T, M, S>

where K: Archive + Hash + Copy + Eq + Ord, <K as Archive>::Archived: Hash + Copy + Eq + Ord + 'static, T: Archive, M: Archive, S: BuildHasher + Default + Clone,

Available on crate feature rkyv only.

fn active(&self) -> Option<K::Archived>

Returns the active node’s identifier, if any.

impl<K, T, M, S> ImmutableBookmarkableWeave<<K as Archive>::Archived, ArchivedDependentNode<K, T, S>, <T as Archive>::Archived> for ArchivedDependentWeave<K, T, M, S>

where K: Archive + Hash + Copy + Eq + Ord, <K as Archive>::Archived: Hash + Copy + Eq + Ord + 'static, T: Archive, M: Archive, S: BuildHasher + Default + Clone,

Available on crate feature rkyv only.

type Bookmarks = ArchivedIndexSet<<K as Archive>::Archived>

Identifiers of bookmarked nodes.

fn bookmarks(&self) -> &Self::Bookmarks

Returns a reference to the identifiers of bookmarked nodes.

fn contains_bookmark(&self, id: &K::Archived) -> bool

Returns true if the Weave contains a bookmarked node with the specified identifier.

impl<K, T, M, S> ImmutableMetadataWeave<<K as Archive>::Archived, ArchivedDependentNode<K, T, S>, <T as Archive>::Archived, <M as Archive>::Archived> for ArchivedDependentWeave<K, T, M, S>

where K: Archive + Hash + Copy + Eq + Ord, <K as Archive>::Archived: Hash + Copy + Eq + Ord + 'static, T: Archive, M: Archive, S: BuildHasher + Default + Clone,

Available on crate feature rkyv only.

fn metadata(&self) -> &M::Archived

Returns a reference to the Weave’s associated metadata.

impl<K, T, M, S> ImmutableSortableWeave<<K as Archive>::Archived, ArchivedDependentNode<K, T, S>, <T as Archive>::Archived> for ArchivedDependentWeave<K, T, M, S>

where K: Archive + Hash + Copy + Eq + Ord, <K as Archive>::Archived: Hash + Copy + Eq + Ord + 'static, T: Archive, M: Archive, S: BuildHasher + Default + Clone,

Available on crate feature rkyv only.

fn get_ordered_node_identifiers_mirrored(&self, output: &mut Vec<K::Archived>)

Builds a list of all node identifiers ordered by their positions in the Weave.

fn get_ordered_node_identifiers_mirrored_from( &self, id: &K::Archived, output: &mut Vec<K::Archived>, )

Recursively builds a list of all children of the specified node ordered by their positions in the Weave.

impl<K, T, M, S> ImmutableWeave<<K as Archive>::Archived, ArchivedDependentNode<K, T, S>, <T as Archive>::Archived> for ArchivedDependentWeave<K, T, M, S>

where K: Archive + Hash + Copy + Eq + Ord, <K as Archive>::Archived: Hash + Copy + Eq + Ord + 'static, T: Archive, M: Archive, S: BuildHasher + Default + Clone,

Available on crate feature rkyv only.

type Nodes = ArchivedHashMap<<K as Archive>::Archived, ArchivedDependentNode<K, T, S>>

Mapping between identifiers and nodes.

type Roots = ArchivedIndexSet<<K as Archive>::Archived>

Identifiers of “root” nodes (nodes which do not have any parents).

fn len(&self) -> usize

Returns the number of nodes stored within the Weave.

fn is_empty(&self) -> bool

Returns true if the Weave does not contain any nodes.

fn nodes(&self) -> &Self::Nodes

Returns a reference to the identifier:node mapping.

fn roots(&self) -> &Self::Roots

Returns a reference to the identifiers of “root” nodes (nodes which do not have any parents).

fn contains(&self, id: &K::Archived) -> bool

Returns true if the Weave contains a node with the specified identifier.

fn contains_active(&self, id: &K::Archived) -> bool

Returns true if the Weave contains an “active” node (node.is_active() == true) with the specified identifier.

fn get_node(&self, id: &K::Archived) -> Option<&ArchivedDependentNode<K, T, S>>

Returns a reference to the node corresponding to the identifier.

fn get_ordered_node_identifiers(&self, output: &mut Vec<K::Archived>)

Builds a list of all node identifiers ordered by their positions in the Weave.

fn get_ordered_node_identifiers_from( &self, id: &K::Archived, output: &mut Vec<K::Archived>, )

Recursively builds a list of all children of the specified node ordered by their positions in the Weave.

fn get_active_path(&self, output: &mut Vec<K::Archived>)

Builds the longest contiguous path of active nodes which ends at a root node.

fn get_path_from(&self, id: &K::Archived, output: &mut Vec<K::Archived>)

Builds a path through the Weave starting at the specified node and ending at a root node.

impl<K, T, S> Node<<K as Archive>::Archived, <T as Archive>::Archived> for ArchivedDependentNode<K, T, S>

where K: Archive + Hash + Copy + Eq + Ord, <K as Archive>::Archived: Hash + Copy + Eq + Ord + 'static, T: Archive, S: BuildHasher + Default + Clone,

Available on crate feature rkyv only.

type From = ArchivedOption<<K as Archive>::Archived>

Identifiers corresponding to the node’s parents.

type To = ArchivedIndexSet<<K as Archive>::Archived>

Identifiers corresponding to the node’s children.

fn id(&self) -> K::Archived

Returns the node’s unique identifier.

fn from(&self) -> &Self::From

Returns a reference to the identifiers corresponding to the node’s parents.

fn to(&self) -> &Self::To

Returns a reference to the identifiers corresponding to the node’s children.

fn is_active(&self) -> bool

Returns true if the node is considered “active”.

fn contents(&self) -> &<T as Archive>::Archived

Returns a reference to the node’s contents.

impl<K, T, S> Portable for ArchivedDependentNode<K, T, S>

where K: Hash + Copy + Eq + Ord + Archive, S: BuildHasher + Default + Clone, Option<K>: Archive, IndexSet<K, S>: Archive, bool: Archive, T: Archive, <K as Archive>::Archived: Portable, <Option<K> as Archive>::Archived: Portable, <IndexSet<K, S> as Archive>::Archived: Portable, <bool as Archive>::Archived: Portable, <T as Archive>::Archived: Portable,