pub struct SecondaryMap<K, V> where
    K: EntityRef,
    V: Clone
{ /* private fields */ }
Expand description

A mapping K -> V for densely indexed entity references.

The SecondaryMap data structure uses the dense index space to implement a map with a vector. Unlike PrimaryMap, an SecondaryMap can’t be used to allocate entity references. It is used to associate secondary information with entities.

The map does not track if an entry for a key has been inserted or not. Instead it behaves as if all keys have a default entry from the beginning.

Implementations

Shared SecondaryMap implementation for all value types.

Create a new empty map.

Create a new, empty map with the specified capacity.

The map will be able to hold exactly capacity elements without reallocating.

Create a new empty map with a specified default value.

This constructor does not require V to implement Default.

Returns the number of elements the map can hold without reallocating.

Get the element at k if it exists.

Is this map completely empty?

Remove all entries from this map.

Iterate over all the keys and values in this map.

Iterate over all the keys and values in this map, mutable edition.

Iterate over all the keys in this map.

Iterate over all the values in this map.

Iterate over all the values in this map, mutable edition.

Resize the map to have n entries by adding default entries as needed.

Trait Implementations

Returns a copy of the value. Read more

Performs copy-assignment from source. Read more

Formats the value using the given formatter. Read more

Returns the “default value” for a type. Read more

Deserialize this value from the given Serde deserializer. Read more

Feeds this value into the given Hasher. Read more

Feeds a slice of this type into the given Hasher. Read more

Immutable indexing into an SecondaryMap.

All keys are permitted. Untouched entries have the default value.

The returned type after indexing.

Performs the indexing (container[index]) operation. Read more

Mutable indexing into an SecondaryMap.

The map grows as needed to accommodate new keys.

Performs the mutable indexing (container[index]) operation. Read more

This method tests for self and other values to be equal, and is used by ==. Read more

This method tests for !=.

Serialize this value into the given Serde serializer. Read more

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

The resulting type after obtaining ownership.

Creates owned data from borrowed data, usually by cloning. Read more

🔬 This is a nightly-only experimental API. (toowned_clone_into)

Uses borrowed data to replace owned data, usually by cloning. Read more

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.