Struct SparseKey 

pub struct SparseKey { /* private fields */ }

A key that can be used to access elements in a SparseSet, the key is unique for each element, and it is only valid for the SparseSet it was created in.

The key should be stored only runtime, it doesn’t make sense to serialize it since the SparseSet data is not persistent

Every key generated by the same SparseSet is unique, they will not repeat even if the element is removed and new ones are added.

Trait Implementations

impl Clone for SparseKey

fn clone(&self) -> SparseKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SparseKey

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

Formats the value using the given formatter.

impl Hash for SparseKey

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for SparseKey

fn eq(&self, other: &SparseKey) -> 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 Copy for SparseKey

impl Eq for SparseKey

impl StructuralPartialEq for SparseKey