Struct LevelView 

pub struct LevelView<'a, 'id, N, ET, TM, R, MD, const PAGE_SIZE: usize, const TAG_BITS: u32>
where
    N: NodeBase + InnerNode<Edge<'id, N, ET, TAG_BITS>>,
    ET: Tag,
    TM: TerminalManager<'id, N, ET, MD, PAGE_SIZE, TAG_BITS>,
    MD: DropWith<Edge<'id, N, ET, TAG_BITS>>,
{ /* private fields */ }

Level view provided by the unique table

Trait Implementations

impl<'a, 'id, N, ET, TM, R, MD, const PAGE_SIZE: usize, const TAG_BITS: u32> LevelView<Edge<'id, N, ET, TAG_BITS>, N> for LevelView<'a, 'id, N, ET, TM, R, MD, PAGE_SIZE, TAG_BITS>

where N: NodeBase + InnerNode<Edge<'id, N, ET, TAG_BITS>>, ET: Tag, TM: TerminalManager<'id, N, ET, MD, PAGE_SIZE, TAG_BITS>, R: DiagramRules<Edge<'id, N, ET, TAG_BITS>, N, TM::TerminalNode>, MD: DropWith<Edge<'id, N, ET, TAG_BITS>> + ManagerEventSubscriber<Manager<'id, N, ET, TM, R, MD, PAGE_SIZE, TAG_BITS>>,

type Iterator<'b> = LevelViewIter<'b, 'id, N, ET, TAG_BITS> where Self: 'b

Iterator over Edges pointing to nodes at this level

type Taken = TakenLevelView<'a, 'id, N, ET, TM, R, MD, PAGE_SIZE, TAG_BITS>

Taken level view, see LevelView::take()

fn len(&self) -> usize

Get the number of nodes on this level

fn level_no(&self) -> LevelNo

Get the level number of this level

fn reserve(&mut self, additional: usize)

Reserve space for additional nodes on this level

fn get(&self, node: &N) -> Option<&Edge<'id, N, ET, TAG_BITS>>

Get the edge corresponding to the given node (if present)

fn insert(&mut self, edge: Edge<'id, N, ET, TAG_BITS>) -> bool

Insert the given edge into the unique table at this level, assuming that the referenced node is already stored in the associated manager.

fn get_or_insert(&mut self, node: N) -> AllocResult<Edge<'id, N, ET, TAG_BITS>>

Get the edge corresponding to level and node if present, or insert it.

fn gc(&mut self)

Perform garbage collection on this level

fn remove(&mut self, node: &N) -> bool

Remove node from (this level of) the manager

unsafe fn swap(&mut self, other: &mut Self)

Move all nodes from this level to the other level and vice versa.

fn iter(&self) -> Self::Iterator<'_>

Iterate over all the edges at this level

fn take(&mut self) -> Self::Taken

Clear this level, returning a level view containing all the previous edges.

fn is_empty(&self) -> bool

Returns true iff this level contains nodes