Struct VecBackedSet

pub struct VecBackedSet<T: Eq> { /* private fields */ }

Structure that exists only to have an “exists” method but backed by a vec. Backing it by a vec offers two distinct benefits:

• We can access elements by index. Really useful for passing around cheap handles.
• We are guaranteed an order AND a memory layout. Useful for passing to shaders.

Implementations

impl<T: Eq> VecBackedSet<T>

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

pub fn insert(&mut self, elem: T) -> usize

Insert an element, return the index. Returns the index of the stored element.

pub fn get(&self, index: usize) -> Option<&T>

pub fn contains(&self, elem: &T) -> bool

pub fn clear(&mut self)

pub fn len(&self) -> usize

Trait Implementations

impl<T: Debug + Eq> Debug for VecBackedSet<T>

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

Formats the value using the given formatter.

impl<'a, T: Eq> Into<&'a Vec<T>> for &'a VecBackedSet<T>

fn into(self) -> &'a Vec<T>

Converts this type into the (usually inferred) input type.

impl<'a, T: Eq> Into<&'a mut Vec<T>> for &'a mut VecBackedSet<T>

fn into(self) -> &'a mut Vec<T>

Converts this type into the (usually inferred) input type.

impl<T: PartialEq + Eq> PartialEq for VecBackedSet<T>

fn eq(&self, other: &VecBackedSet<T>) -> 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<T: Eq + Eq> Eq for VecBackedSet<T>

impl<T: Eq> StructuralPartialEq for VecBackedSet<T>