Struct wgpu_core::device::bgl::EntryMap

pub struct EntryMap {
    inner: IndexMap<u32, BindGroupLayoutEntry, BuildHasherDefault<FxHasher>>,
    sorted: bool,
}

A HashMap-like structure that stores a BindGroupLayouts wgt::BindGroupLayoutEntrys.

It is hashable, so bind group layouts can be deduplicated.

Fields

inner: IndexMap<u32, BindGroupLayoutEntry, BuildHasherDefault<FxHasher>>

We use a IndexMap here so that we can sort the entries by their binding index, guaranteeing that the hash of equivalent layouts will be the same.

sorted: bool

We keep track of whether the map is sorted or not, so that we can assert that it is sorted, so that PartialEq and Hash will be stable.

We only need sorted if it is used in a Hash or PartialEq, so we never need to actively sort it.

Implementations

impl EntryMap

fn assert_sorted(&self)

pub fn from_entries( device_limits: &Limits, entries: &[BindGroupLayoutEntry], ) -> Result<Self, CreateBindGroupLayoutError>

Create a new EntryMap from a slice of wgt::BindGroupLayoutEntrys.

Errors if there are duplicate bindings or if any binding index is greater than the device’s limits.

pub fn len(&self) -> usize

Get the count of wgt::BindGroupLayoutEntrys in this map.

pub fn get(&self, binding: u32) -> Option<&BindGroupLayoutEntry>

Get the wgt::BindGroupLayoutEntry for the given binding index.

pub fn indices(&self) -> impl ExactSizeIterator<Item = u32> + '_

Iterator over all the binding indices in this map.

pub fn values( &self, ) -> impl ExactSizeIterator<Item = &BindGroupLayoutEntry> + '_

Iterator over all the wgt::BindGroupLayoutEntrys in this map.

pub fn iter( &self, ) -> impl ExactSizeIterator<Item = (&u32, &BindGroupLayoutEntry)> + '_

pub fn is_empty(&self) -> bool

pub fn contains_key(&self, key: u32) -> bool

pub fn entry(&mut self, key: u32) -> Entry<'_, u32, BindGroupLayoutEntry>

pub fn sort(&mut self)

Trait Implementations

impl Clone for EntryMap

fn clone(&self) -> EntryMap

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for EntryMap

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

Formats the value using the given formatter.

impl Default for EntryMap

fn default() -> EntryMap

Returns the “default value” for a type.

impl Hash for EntryMap

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 EntryMap

fn eq(&self, other: &Self) -> 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 Eq for EntryMap