Struct SmallNodeSet 

pub struct SmallNodeSet(/* private fields */);

A NodeSet implementation optimized to store zero or one node

When storing zero or a single node, this structure takes only the size of one node. When storing two nodes or more, it is equivalent to Box<HashSet<NodeId, RapidBuildHasher>>.

Implementations

impl SmallNodeSet

pub fn iter(&self) -> Iter<'_>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

Trait Implementations

impl Clone for SmallNodeSet

fn clone(&self) -> SmallNodeSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SmallNodeSet

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for SmallNodeSet

fn default() -> Self

Returns the “default value” for a type.

impl<'a> IntoIterator for &'a SmallNodeSet

type IntoIter = Iter<'a>

Which kind of iterator are we turning this into?

type Item = usize

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl NodeSet for SmallNodeSet

fn insert(&mut self, node: usize)

impl PartialEq for SmallNodeSet

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 ReadNodeSet for SmallNodeSet

fn contains(&self, node: usize) -> bool

impl Eq for SmallNodeSet