Struct NodeSet 

pub struct NodeSet<N: Node> {
    nodes: Vec<N>,
    is_sorted: bool,
}

Fields

nodes: Vec<N>

is_sorted: bool

Implementations

impl<N: Node> NodeSet<N>

pub(crate) fn len(&self) -> usize

fn is_empty(&self) -> bool

pub(crate) fn push(&mut self, node: N)

pub(crate) fn extend<I>(&mut self, iter: I)

where I: IntoIterator<Item = N>,

pub(crate) fn is_sorted(&self) -> bool

Whether this set is known to be sorted in tree order.

This method is pessimistic and will never look at the elements in the set. As such, it may return false even if the set happens to be sorted.

pub(crate) fn assume_sorted(&mut self)

Assume that this set is sorted, without actually sorting it.

pub(crate) fn sort(&mut self)

pub(crate) fn iter(&self) -> impl Iterator<Item = &N>

pub(crate) fn first(&self) -> Option<N>

Return the first node in tree order that appears within this set.

This method will not sort the set itself.

pub(crate) fn deduplicate(&mut self)

pub(crate) fn retain<F>(&mut self, f: F)

where F: FnMut(&N) -> bool,

Retains only the elements specified by the predicate.

In other words, remove all elements e for which f(&e) returns false. This method operates in place, visiting each element exactly once in the original order, and preserves the order of the retained elements.

pub(crate) fn reverse(&mut self)

Trait Implementations

impl<N: Debug + Node> Debug for NodeSet<N>

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

Formats the value using the given formatter.

impl<N: Node> Default for NodeSet<N>

fn default() -> Self

Returns the “default value” for a type.

impl<N: Node> FromIterator<N> for NodeSet<N>

fn from_iter<T: IntoIterator<Item = N>>(iter: T) -> Self

Creates a value from an iterator.

impl<N: Node> IntoIterator for NodeSet<N>

type IntoIter = <Vec<N> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

type Item = <Vec<N> as IntoIterator>::Item

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.