Struct NodeWithLevel

pub struct NodeWithLevel<'id, ET, const TAG_BITS: u32, const ARITY: usize> { /* private fields */ }

Trait Implementations

impl<ET, const TAG_BITS: u32, const ARITY: usize> AtomicRefCounted for NodeWithLevel<'_, ET, TAG_BITS, ARITY>

fn retain(&self)

Atomically increment the reference counter (with Relaxed order)

unsafe fn release(&self) -> usize

Atomically decrement the reference counter (with Release order)

fn current(&self) -> usize

Read the current reference count (with Relaxed order)

impl<'id, ET: Tag, const TAG_BITS: u32, const ARITY: usize> DropWith<Edge<'id, NodeWithLevel<'id, ET, TAG_BITS, ARITY>, ET, TAG_BITS>> for NodeWithLevel<'id, ET, TAG_BITS, ARITY>

fn drop_with(self, drop_edge: impl Fn(Edge<'id, Self, ET, TAG_BITS>))

Drop self

fn drop_with_manager<M>(self, manager: &M)

where M: Manager<Edge = E>,

Drop self

impl<ET, const TAG_BITS: u32, const ARITY: usize> HasLevel for NodeWithLevel<'_, ET, TAG_BITS, ARITY>

fn level(&self) -> LevelNo

Get the node’s level

unsafe fn set_level(&self, level: LevelNo)

Set the node’s level

impl<ET: Tag, const TAG_BITS: u32, const ARITY: usize> Hash for NodeWithLevel<'_, ET, TAG_BITS, ARITY>

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<'id, ET: Tag, const TAG_BITS: u32, const ARITY: usize> InnerNode<Edge<'id, NodeWithLevel<'id, ET, TAG_BITS, ARITY>, ET, TAG_BITS>> for NodeWithLevel<'id, ET, TAG_BITS, ARITY>

const ARITY: usize = 2usize

The node’s arity (upper bound)

type ChildrenIter<'a> = BorrowedEdgeIter<'a, Edge<'id, NodeWithLevel<'id, ET, TAG_BITS, ARITY>, ET, TAG_BITS>, Iter<'a, Edge<'id, NodeWithLevel<'id, ET, TAG_BITS, ARITY>, ET, TAG_BITS>>> where Self: 'a

Iterator over children of an inner node

fn new( level: LevelNo, children: impl IntoIterator<Item = Edge<'id, Self, ET, TAG_BITS>>, ) -> Self

Create a new node

fn check_level(&self, check: impl FnOnce(LevelNo) -> bool) -> bool

Returns the result of check applied to the node’s level in case this node type stores levels, otherwise returns true.

fn assert_level_matches(&self, level: LevelNo)

Panics if the node types stores a level and the node’s level is not level

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

Get the children of this node as an iterator

fn child(&self, n: usize) -> Borrowed<'_, Edge<'id, Self, ET, TAG_BITS>>

Get the n-th child of this node

unsafe fn set_child( &self, n: usize, child: Edge<'id, Self, ET, TAG_BITS>, ) -> Edge<'id, Self, ET, TAG_BITS>

Set the n-th child of this node

fn ref_count(&self) -> usize

Get the node’s reference count

impl<ET: Tag, const TAG_BITS: u32, const ARITY: usize> NodeBase for NodeWithLevel<'_, ET, TAG_BITS, ARITY>

fn needs_drop() -> bool

Whether this node type contains additional data that needs to be dropped to avoid memory leaks.

impl<ET: Tag, const TAG_BITS: u32, const ARITY: usize> PartialEq for NodeWithLevel<'_, ET, TAG_BITS, ARITY>

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<ET: Tag, const TAG_BITS: u32, const ARITY: usize> Eq for NodeWithLevel<'_, ET, TAG_BITS, ARITY>

impl<ET: Send + Sync, const TAG_BITS: u32, const ARITY: usize> Send for NodeWithLevel<'_, ET, TAG_BITS, ARITY>

impl<ET: Send + Sync, const TAG_BITS: u32, const ARITY: usize> Sync for NodeWithLevel<'_, ET, TAG_BITS, ARITY>