Struct SliceSet 

pub struct SliceSet<T: Copy + Hash + Eq + 'static> { /* private fields */ }

Holds unique slices and provides handles to fetch them later.

Implementations

impl<T: Copy + Hash + Eq + 'static> SliceSet<T>

pub fn try_with_capacity(capacity: usize) -> Result<Self, SetError>

pub unsafe fn insert_unique_uncontended( &mut self, slice: &[T], ) -> Result<ThinSlice<'static, T>, SetError>

Safety

The slice must not already exist within the set.

pub unsafe fn insert_unique_uncontended_with_hash( &mut self, hash: u64, slice: &[T], ) -> Result<ThinSlice<'static, T>, SetError>

Safety

1. The hash must be the same as if the slice was re-hashed with the hasher the slice set would use.
2. The slice must not already exist within the set.

pub fn try_insert( &mut self, slice: &[T], ) -> Result<ThinSlice<'static, T>, SetError>

where T: Hash,

Adds the slice to the slice set if it isn’t present already, and returns a handle to the slice that can be used to retrieve it later.

pub fn iter(&self) -> impl Iterator<Item = ThinSlice<'_, T>> + '_

Returns an iterator over all slices in the set.

pub fn len(&self) -> usize

Returns the number of slices in the set.

pub fn is_empty(&self) -> bool

Returns true if the set is empty.

pub fn capacity(&self) -> usize

Returns the capacity of the hash table.