Struct GenericGraph 

pub struct GenericGraph<Root, NodeType>
where
    Root: RootCollection<'static, NodeType>,
    NodeType: GraphNode,
{ /* private fields */ }

Implementations

impl<Root, NodeType> GenericGraph<Root, NodeType>

where Root: RootCollection<'static, NodeType>, NodeType: GraphNode,

pub fn new() -> Self

impl<Root, NodeType> GenericGraph<Root, NodeType>

where Root: RootCollection<'static, NodeType>, NodeType: GraphNode,

pub unsafe fn anchor_mut<'id>( &mut self, guard: Id<'id>, strategy: CleanupStrategy, ) -> AnchorMut<'_, 'id, GenericGraph<Root, NodeType>>

Creates an AnchorMut from a generativity brand using selected cleanup strategy. Prefer anchor_mut! macro in application code.

Safety

Caller must use a unique guard from generativity::Guard.

pub unsafe fn anchor<'id>( &self, guard: Id<'id>, ) -> Anchor<'_, 'id, GenericGraph<Root, NodeType>>

Creates an Anchor from a generativity brand. Prefer anchor! macro in application code.

Safety

Caller must use a unique guard from generativity::Guard.

Trait Implementations

impl<Root, NodeType> Default for GenericGraph<Root, NodeType>

where Root: RootCollection<'static, NodeType>, NodeType: GraphNode,

fn default() -> Self

Returns the “default value” for a type.

impl<Root, NodeType> GraphImpl for GenericGraph<Root, NodeType>

where Root: RootCollection<'static, NodeType>, NodeType: GraphNode,

fn cleanup_precise(&mut self)

Traverses the graph and drops any inaccessible node. Disregards any heuristic designed to improve cleanup performance.

fn cleanup(&mut self)

Traverses the graph and drops inaccessible nodes. This method will miss some of the leaked items which might result in spikes in memory usage. !! Currently, none of the possible heuristics are implemented.