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§

The archived representation of this type. Read more
The resolver for this type. It must contain all the additional information from serializing needed to make the archived type from the normal type.
Creates the archived version of this value at the given position and writes it to the given output. Read more
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
Deserializes using the given deserializer

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 ==.
This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Writes the dependencies for the object and returns a resolver that can create the archived type.

Auto Trait Implementations§

Blanket Implementations§

Gets the TypeId of self. Read more
The archived version of the pointer metadata for this type.
Converts some archived metadata to the pointer metadata for itself.
The archived counterpart of this type. Unlike Archive, it may be unsized. Read more
The resolver for the metadata of this type. Read more
Creates the archived version of the metadata for this value at the given position and writes it to the given output. Read more
Resolves a relative pointer to this value with the given from and to and writes it to the given output. Read more
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more
Deserializes using the given deserializer
Compare self to key and return true if they are equal.

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 type for metadata in pointers and references to Self.
Writes the object and returns the position of the archived type.
Serializes the metadata for the given type.
The resulting type after obtaining ownership.
Creates owned data from borrowed data, usually by cloning. Read more
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.