[−][src]Trait rs_graph::collections::ItemSet
A (finite) set of items (node or edges) of a graph.
Required methods
fn len(&self) -> usize
Return the number of items in this set.
fn clear(&mut self)
Remove all nodes from the set.
fn insert(&mut self, u: I) -> bool
Add one item to the set.
Return true
iff u
had not been contained in this set before.
fn remove(&mut self, u: I) -> bool
Remove one item from the set.
Returns true
if the item had been contained in the set, otherwise
false.
fn contains(&self, u: I) -> bool
Return true
iff item u
is contained in this set.
Provided methods
Loading content...Implementations on Foreign Types
impl<'a, N, S> ItemSet<N> for &'a mut S where
S: ItemSet<N>,
N: Copy,
[src]
S: ItemSet<N>,
N: Copy,
fn is_empty(&self) -> bool
[src]
fn len(&self) -> usize
[src]
fn clear(&mut self)
[src]
fn insert(&mut self, u: N) -> bool
[src]
fn remove(&mut self, u: N) -> bool
[src]
fn contains(&self, u: N) -> bool
[src]
impl<N, B> ItemSet<N> for HashSet<N, B> where
N: Copy + Eq + Hash,
B: BuildHasher,
[src]
N: Copy + Eq + Hash,
B: BuildHasher,