Struct DisjointHashSet 

pub struct DisjointHashSet<K> { /* private fields */ }

Implementations

impl<K: Eq + Hash> DisjointHashSet<K>

pub fn new() -> Self

Creates an empty DisjointHashSet.

Example

use disjoint_hash_set ::DisjointHashSet;
let mut djhs: DisjointHashSet<&str> = DisjointHashSet::new();

pub fn contains<T: Borrow<K>>(&self, val: T) -> bool

Check if the value has already been inserted.

Example

use disjoint_hash_set::DisjointHashSet;

let mut djhs = DisjointHashSet::new();
assert!(!djhs.contains(&"a"));
djhs.insert(&"a");
assert!(djhs.contains(&"a"));

pub fn insert(&mut self, val: K) -> bool

Insert the value as a new disjoint set with a single member. Returns true if the value was not already present.

use disjoint_hash_set::DisjointHashSet;

let mut djhs = DisjointHashSet::new();
assert!(djhs.insert(&"a"));
assert!(!djhs.insert(&"a"));

pub fn is_linked<T: Borrow<K>>(&mut self, val1: T, val2: T) -> bool

Checks if the two keys are members of the same set. This will not implicitly add values that were not already present.

use disjoint_hash_set::DisjointHashSet;

let mut djhs = DisjointHashSet::new();
djhs.link("a", "b");
djhs.link("a", "c");
assert!(djhs.is_linked("b", "c"));
assert!(!djhs.is_linked("a", "d"));

pub fn link(&mut self, val1: K, val2: K)

Link the respective sets of the two provided values. This will insert non-existent values in the process.

use disjoint_hash_set::DisjointHashSet;

let mut djhs = DisjointHashSet::new();

djhs.link("a", "b");
assert!(djhs.contains("a"));
assert!(djhs.contains("b"));
assert!(djhs.is_linked("a", "b"));

pub fn sets(self) -> impl Iterator<Item = HashSet<K>>

Consumes the DisjointHashSet and returns an iterator of HashSets for each disjoint set.

use disjoint_hash_set::DisjointHashSet;
use std::{collections::HashSet, iter::FromIterator};

let edges = vec![("a", "a"), ("b", "c"), ("d", "e"), ("e", "f")];
let mut sets = DisjointHashSet::from_iter(edges).sets().collect::<Vec<_>>();
sets.sort_by(|set_a, set_b| set_a.len().cmp(&set_b.len()));

let expected_sets: Vec<HashSet<&str>> = vec![
    HashSet::from_iter(vec!["a"]),
    HashSet::from_iter(vec!["b", "c"]),
    HashSet::from_iter(vec!["d", "e", "f"]),
];

assert_eq!(sets, expected_sets);

Trait Implementations

impl<K: Clone> Clone for DisjointHashSet<K>

fn clone(&self) -> DisjointHashSet<K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug> Debug for DisjointHashSet<K>

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

Formats the value using the given formatter.

impl<V: Eq + Hash> FromIterator<(V, V)> for DisjointHashSet<V>

fn from_iter<I: IntoIterator<Item = (V, V)>>(links: I) -> Self

Creates a value from an iterator.