pub struct SparseSet<I, V>where
V: 'static,{ /* private fields */ }
Expand description
A data structure that blends dense and sparse storage
I
is the type of the indices, while V
is the type of data stored in the dense storage.
Implementations§
§impl<I, V> SparseSet<I, V>where
I: SparseSetIndex,
impl<I, V> SparseSet<I, V>where
I: SparseSetIndex,
pub fn get(&self, index: I) -> Option<&V>
pub fn get(&self, index: I) -> Option<&V>
Returns a reference to the value for index
.
Returns None
if index
does not have a value in the sparse set.
pub fn get_mut(&mut self, index: I) -> Option<&mut V>
pub fn get_mut(&mut self, index: I) -> Option<&mut V>
Returns a mutable reference to the value for index
.
Returns None
if index
does not have a value in the sparse set.
pub fn indices(&self) -> impl Iterator<Item = I>
pub fn indices(&self) -> impl Iterator<Item = I>
Returns an iterator visiting all keys (indices) in arbitrary order.
pub fn values(&self) -> impl Iterator<Item = &V>
pub fn values(&self) -> impl Iterator<Item = &V>
Returns an iterator visiting all values in arbitrary order.
pub fn values_mut(&mut self) -> impl Iterator<Item = &mut V>
pub fn values_mut(&mut self) -> impl Iterator<Item = &mut V>
Returns an iterator visiting all values mutably in arbitrary order.
§impl<I, V> SparseSet<I, V>where
I: SparseSetIndex,
impl<I, V> SparseSet<I, V>where
I: SparseSetIndex,
pub fn with_capacity(capacity: usize) -> SparseSet<I, V>
pub fn with_capacity(capacity: usize) -> SparseSet<I, V>
Creates a new SparseSet
with a specified initial capacity.
pub fn capacity(&self) -> usize
pub fn capacity(&self) -> usize
Returns the total number of elements the SparseSet
can hold without needing to reallocate.
pub fn insert(&mut self, index: I, value: V)
pub fn insert(&mut self, index: I, value: V)
Inserts value
at index
.
If a value was already present at index
, it will be overwritten.
pub fn get_or_insert_with(
&mut self,
index: I,
func: impl FnOnce() -> V
) -> &mut V
pub fn get_or_insert_with( &mut self, index: I, func: impl FnOnce() -> V ) -> &mut V
Returns a reference to the value for index
, inserting one computed from func
if not already present.
pub fn remove(&mut self, index: I) -> Option<V>
pub fn remove(&mut self, index: I) -> Option<V>
Removes and returns the value for index
.
Returns None
if index
does not have a value in the sparse set.
pub fn clear(&mut self)
pub fn clear(&mut self)
Clears all of the elements from the sparse set.
Trait Implementations§
Auto Trait Implementations§
impl<I, V> Freeze for SparseSet<I, V>
impl<I, V> RefUnwindSafe for SparseSet<I, V>where
I: RefUnwindSafe,
V: RefUnwindSafe,
impl<I, V> Send for SparseSet<I, V>
impl<I, V> Sync for SparseSet<I, V>
impl<I, V> Unpin for SparseSet<I, V>
impl<I, V> UnwindSafe for SparseSet<I, V>where
I: UnwindSafe,
V: UnwindSafe,
Blanket Implementations§
§impl<T, U> AsBindGroupShaderType<U> for T
impl<T, U> AsBindGroupShaderType<U> for T
§fn as_bind_group_shader_type(&self, _images: &RenderAssets<GpuImage>) -> U
fn as_bind_group_shader_type(&self, _images: &RenderAssets<GpuImage>) -> U
T
ShaderType
for self
. When used in AsBindGroup
derives, it is safe to assume that all images in self
exist.source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
§impl<T> FromWorld for Twhere
T: Default,
impl<T> FromWorld for Twhere
T: Default,
§fn from_world(_world: &mut World) -> T
fn from_world(_world: &mut World) -> T
Self
using data from the given World
.§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> NoneValue for Twhere
T: Default,
impl<T> NoneValue for Twhere
T: Default,
type NoneType = T
§fn null_value() -> T
fn null_value() -> T
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<R, P> ReadPrimitive<R> for P
impl<R, P> ReadPrimitive<R> for P
source§fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
ReadEndian::read_from_little_endian()
.