Struct NodeSet 

pub struct NodeSet { /* private fields */ }

Node set implementation using a bit set

Since nodes are stored in an array, we can use a single bit vector. This reduces space consumption dramatically and increases the performance.

Trait Implementations

impl Clone for NodeSet

fn clone(&self) -> NodeSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for NodeSet

fn default() -> NodeSet

Returns the “default value” for a type.

impl Eq for NodeSet

impl<'id, N: NodeBase, ET: Tag> NodeSet<Edge<'id, N, ET>> for NodeSet

fn len(&self) -> usize

Get the number of nodes in the set

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

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

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

Return true if the set contains the given node

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

Remove a node from the set

fn is_empty(&self) -> bool

Returns true iff there are no nodes in the set

impl PartialEq for NodeSet

fn eq(&self, other: &NodeSet) -> 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 StructuralPartialEq for NodeSet