Struct ArchivedIndexSet 

pub struct ArchivedIndexSet<K, H = FxHasher64> { /* private fields */ }

An archived IndexSet.

Implementations

impl<K, H> ArchivedIndexSet<K, H>

pub fn is_empty(&self) -> bool

Returns whether the index set contains no values.

pub fn iter(&self) -> Keys<'_, K, ()>

Returns an iterator over the keys of the index set in order.

pub fn len(&self) -> usize

Returns the number of elements in the index set.

impl<K, H: Default + Hasher> ArchivedIndexSet<K, H>

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

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Returns whether a key is present in the hash set.

pub fn get<Q>(&self, k: &Q) -> Option<&K>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Returns the value stored in the set, if any.

pub fn get_full<Q>(&self, k: &Q) -> Option<(usize, &K)>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Returns the item index and value stored in the set, if any.

pub fn get_index(&self, index: usize) -> Option<&K>

Gets a key by index.

pub fn get_index_of<Q>(&self, key: &Q) -> Option<usize>

where K: Borrow<Q>, Q: Hash + Eq + ?Sized,

Returns the index of a key if it exists in the set.

pub fn resolve_from_len( len: usize, load_factor: (usize, usize), resolver: IndexSetResolver, out: Place<Self>, )

Resolves an archived index map from a given length and parameters.

pub fn serialize_from_iter<I, UK, S>( iter: I, load_factor: (usize, usize), serializer: &mut S, ) -> Result<IndexSetResolver, S::Error>

where I: Clone + ExactSizeIterator, I::Item: Borrow<UK>, UK: Serialize<S, Archived = K> + Hash + Eq, S: Fallible + Writer + Allocator + ?Sized, S::Error: Source,

Serializes an iterator of keys as an index set.

Trait Implementations

impl<K, H, __C: Fallible + ?Sized> CheckBytes<__C> for ArchivedIndexSet<K, H>

where <__C as Fallible>::Error: Trace, ArchivedIndexMap<K, (), H>: CheckBytes<__C>,

unsafe fn check_bytes( value: *const Self, context: &mut __C, ) -> Result<(), <__C as Fallible>::Error>

Checks whether the given pointer points to a valid value within the given context.

impl<K: Debug, H> Debug for ArchivedIndexSet<K, H>

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

Formats the value using the given formatter.

impl<K: PartialEq, H> PartialEq for ArchivedIndexSet<K, H>

fn eq(&self, other: &Self) -> 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<K: Eq, H> Eq for ArchivedIndexSet<K, H>

impl<K, H> Portable for ArchivedIndexSet<K, H>

where ArchivedIndexMap<K, (), H>: Portable,