Struct ArrayMap 

pub struct ArrayMap<T> { /* private fields */ }

Implementations

impl<T> ArrayMap<T>

pub fn get_mut(&mut self, key: u8) -> Option<&mut T>

pub fn get(&self, key: u8) -> Option<&T>

pub fn insert(&mut self, key: u8, value: T) -> Option<T>

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

pub fn contains(&self, key: u8) -> bool

pub fn remove(&mut self, key: u8) -> Option<T>

pub fn range<R: RangeBounds<u8>>(&self, range: R) -> Range<'_, T>

pub fn pop_first(&mut self) -> Option<(u8, T)>

pub const fn new() -> Self

pub fn iter(&self) -> Entries<'_, T>

pub fn iter_mut(&mut self) -> EntriesMut<'_, T>

Trait Implementations

impl<T: Clone> Clone for ArrayMap<T>

fn clone(&self) -> ArrayMap<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Default for ArrayMap<T>

fn default() -> Self

Returns the “default value” for a type.

impl Equivalent<ArrayMap<()>> for ArraySet

fn into_equivalent(self) -> ArrayMap<()>

Inverse of Equivalent::from_equivalent.

fn from_equivalent(_: ArrayMap<()>) -> Self

Inverse of Equivalent::into_equivalent.

impl<T> Extend<(u8, T)> for ArrayMap<T>

fn extend<I: IntoIterator<Item = (u8, T)>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

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

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

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

Reserves capacity in a collection for the given number of additional elements.

impl<T, const N: usize> From<[(u8, T); N]> for ArrayMap<T>

fn from(value: [(u8, T); N]) -> Self

Converts to this type from the input type.

impl<T> FromIterator<(u8, T)> for ArrayMap<T>

fn from_iter<I: IntoIterator<Item = (u8, T)>>(iter: I) -> Self

Creates a value from an iterator.

impl<T: InlineOutput> InlineOutput for ArrayMap<T>

fn slice_to_output(slice: &[Self], output: &mut dyn Output)

where Self: Sized,

impl<'a, T> IntoIterator for &'a ArrayMap<T>

type Item = (u8, &'a T)

The type of the elements being iterated over.

type IntoIter = Entries<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T> IntoIterator for &'a mut ArrayMap<T>

type Item = (u8, &'a mut T)

The type of the elements being iterated over.

type IntoIter = EntriesMut<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> ListHashes for ArrayMap<T>

where BTreeMap<u8, T>: ListHashes,

fn list_hashes(&self, visitor: &mut impl FnMut(Hash))

fn topology_hash(&self) -> Hash

fn point_count(&self) -> usize

impl<T, __I: ParseInput> Parse<__I> for ArrayMap<T>

where Self: ParseInline<__I>,

fn parse(input: __I) -> Result<Self>

Parse consuming the whole stream.

impl<T: ParseInline<I>, I: ParseInput> ParseInline<I> for ArrayMap<T>

fn parse_inline(input: &mut I) -> Result<Self>

Parse without consuming the whole stream. Errors on unexpected EOF.

fn parse_as_inline(input: I) -> Result<Self, Error>

For implementing Parse::parse.

fn parse_vec(input: I) -> Result<Vec<Self>, Error>

Parse a Vec of Self. Customisable for optimisations.

fn parse_vec_n(input: &mut I, n: usize) -> Result<Vec<Self>, Error>

Parse a Vec of Self of length n. Customisable for optimisations.

fn parse_array<const N: usize>(input: &mut I) -> Result<[Self; N], Error>

Parse an array of Self. Customisable for optimisations.

fn parse_generic_array<N>(input: &mut I) -> Result<GenericArray<Self, N>, Error>

where N: ArrayLength,

Parse a GenericArray of Self. Customisable for optimisations.

impl<T> Tagged for ArrayMap<T>

where BTreeMap<u8, T>: Tagged,

const TAGS: Tags

const HASH: Hash = _

impl<T: InlineOutput> ToOutput for ArrayMap<T>

fn to_output(&self, output: &mut dyn Output)

fn data_hash(&self) -> Hash

fn output<T>(&self) -> T

where T: Output + Default,

fn vec(&self) -> Vec<u8>

impl<T> Topological for ArrayMap<T>

where BTreeMap<u8, T>: Topological,

fn traverse(&self, visitor: &mut impl PointVisitor)

fn topology(&self) -> Vec<Arc<dyn Singular>>