Struct Elements 

pub struct Elements {
    pub nodes: Nodes,
    pub edges: Edges,
}

A set of elment (node and edge) identifiers.

Fields

nodes: Nodes

edges: Edges

Implementations

impl Elements

pub fn new(nodes: Nodes, edges: Edges) -> Self

pub fn from_nodes(nodes: Nodes) -> Self

pub fn from_edges(edges: Edges) -> Self

pub fn from_elements(elements: &[ElementID]) -> Self

impl Elements

pub fn contains(&self, member: &ElementID) -> bool

Returns true if the set contains an element equal to the value.

pub fn insert(&mut self, new_member: ElementID) -> bool

Inserts a value into the set, returning true if the value was not present in the set.

pub fn insert_all(&mut self, other: &Elements)

Inserts all the elements from other into self.

pub fn remove(&mut self, member: &ElementID) -> bool

Removes a value from the set, returning the value if it was present in the set.

pub fn remove_all(&mut self, other: &Elements)

Removes all the elements in other from self.

pub fn union(&self, other: &Elements) -> Elements

Returns the elements representing the union, i.e., all the elements in self or other.

pub fn intersection(&self, other: &Elements) -> Elements

Returns the elements representing the intersection, i.e., all the elements in both self and other.

pub fn difference(&self, other: &Elements) -> Elements

Returns the elements representing the difference, i.e., all the elements in self but not in other.

pub fn symmetric_difference(&self, other: &Elements) -> Elements

Returns the elements representing the symmetric difference, i.e., all the elements in self or other, but not in both.

pub fn form_union(&mut self, other: &Elements)

Updates self with the union of self and other.

pub fn form_intersection(&mut self, other: &Elements)

Updates self with the intersection of self and other.

pub fn form_difference(&mut self, other: &Elements)

Updates self with the difference of self and other.

pub fn form_symmetric_difference(&mut self, other: &Elements)

Updates self with the symmetric difference of self and other.

pub fn is_disjoint(&self, other: &Elements) -> bool

Returns true if self has no elements in common with other. This is equivalent to checking for an empty intersection.

pub fn is_subset(&self, other: &Elements) -> bool

Returns true if self is a subset of other, i.e., other contains at least all the elements in self.

pub fn is_superset(&self, other: &Elements) -> bool

Returns true if self is a superset of other, i.e., self contains at least all the elements in other.

pub fn len(&self) -> usize

Returns the number of elements in self.

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

pub fn clear(&mut self)

Removes all elements from the set.

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

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

Retains only the elements specified by the predicate.

Trait Implementations

impl Clone for Elements

fn clone(&self) -> Elements

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Elements

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

Formats the value using the given formatter.

impl Default for Elements

fn default() -> Self

Returns the “default value” for a type.

impl From<&Elements> for Elements

fn from(elements: &Elements) -> Self

Converts to this type from the input type.

impl From<(BTreeSet<NodeID>, BTreeSet<EdgeID>)> for Elements

fn from((nodes, edges): (Nodes, Edges)) -> Self

Converts to this type from the input type.

impl From<BTreeSet<EdgeID>> for Elements

fn from(edges: Edges) -> Self

Converts to this type from the input type.

impl From<BTreeSet<NodeID>> for Elements

fn from(nodes: Nodes) -> Self

Converts to this type from the input type.

impl Hash for Elements

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 PartialEq for Elements

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

impl StructuralPartialEq for Elements