Struct NodeSet 

pub struct NodeSet<const PAGE_SIZE: usize, const TAG_BITS: u32> { /* private fields */ }

Node set implementation using bit sets

Since nodes are stored on large pages, we can use one bit vector per page. This reduces space consumption dramatically and increases the performance.

Trait Implementations

impl<const PAGE_SIZE: usize, const TAG_BITS: u32> Clone for NodeSet<PAGE_SIZE, TAG_BITS>

fn clone(&self) -> NodeSet<PAGE_SIZE, TAG_BITS>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<const PAGE_SIZE: usize, const TAG_BITS: u32> Default for NodeSet<PAGE_SIZE, TAG_BITS>

fn default() -> NodeSet<PAGE_SIZE, TAG_BITS>

Returns the “default value” for a type.

impl<'id, InnerNode, ET, const PAGE_SIZE: usize, const TAG_BITS: u32> NodeSet<Edge<'id, InnerNode, ET, TAG_BITS>> for NodeSet<PAGE_SIZE, TAG_BITS>

fn len(&self) -> usize

Get the number of nodes in the set

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

Add a node (the node to which edge points) to the set

fn contains(&self, edge: &Edge<'id, InnerNode, ET, TAG_BITS>) -> bool

Return true if the set contains the given node

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

Remove a node from the set

fn is_empty(&self) -> bool

Returns true iff there are no nodes in the set

impl<const PAGE_SIZE: usize, const TAG_BITS: u32> PartialEq for NodeSet<PAGE_SIZE, TAG_BITS>

fn eq(&self, other: &NodeSet<PAGE_SIZE, TAG_BITS>) -> 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<const PAGE_SIZE: usize, const TAG_BITS: u32> Eq for NodeSet<PAGE_SIZE, TAG_BITS>

impl<const PAGE_SIZE: usize, const TAG_BITS: u32> StructuralPartialEq for NodeSet<PAGE_SIZE, TAG_BITS>