Struct HashRefSet

pub struct HashRefSet<T: ?Sized>(/* private fields */);

A hash-set of references to an item.

Instead of inserting the item into the set, the set is “marked” with the item. Think of this as inserting a reference into the set with no lifetime.

Any type that can borrow to T can be used to insert, and neither type needs to be Sized. T need only implement Hash.

Hashing algorithm

The hasing algorithm used is Sha512, which is rather large (64 bytes). At present there is no way to change the hasher used, I might implement that functionality in the future.

Implementations

impl<T: ?Sized + Hash> HashRefSet<T>

pub fn new() -> Self

Create a new empty HashRefSet

pub fn into_inner(self) -> HashSet<HashType>

Consume into the inner HashSet.

pub fn with_capacity(cap: usize) -> Self

Create a new HashRefSet with a capacity

pub fn insert<Q>(&mut self, value: &Q) -> bool

where Q: ?Sized + Borrow<T>,

Insert a reference into the set. The reference can be any type that borrows to T.

Returns true if there was no previous item, false if there was.

pub fn remove<Q>(&mut self, value: &Q) -> bool

where Q: ?Sized + Borrow<T>,

Remove a reference from the set.

Returns true if it existed.

pub fn contains<Q>(&mut self, value: &Q) -> bool

where Q: ?Sized + Borrow<T>,

Check if this value has been inserted into the set.

pub fn len(&self) -> usize

The number of items stored in the set

pub fn is_empty(&self) -> bool

Is the set empty

pub fn hashes_iter(&self) -> Iter<'_, HashType>

An iterator over the hashes stored in the set.

Trait Implementations

impl<T: Clone + ?Sized> Clone for HashRefSet<T>

fn clone(&self) -> HashRefSet<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + ?Sized> Debug for HashRefSet<T>

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

Formats the value using the given formatter.

impl<T: Default + ?Sized> Default for HashRefSet<T>

fn default() -> HashRefSet<T>

Returns the “default value” for a type.

impl<T: ?Sized + Hash> IntoIterator for HashRefSet<T>

type Item = Sha512Hash

The type of the elements being iterated over.

type IntoIter = IntoIter<Sha512Hash>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq + ?Sized> PartialEq for HashRefSet<T>

fn eq(&self, other: &HashRefSet<T>) -> 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<T: Eq + ?Sized> Eq for HashRefSet<T>

impl<T: ?Sized + Send> Send for HashRefSet<T>

impl<T: ?Sized> StructuralPartialEq for HashRefSet<T>

impl<T: ?Sized + Send + Sync> Sync for HashRefSet<T>