Struct SegMap 

pub struct SegMap<T>(/* private fields */);

Implementations

impl<T: Clone> SegMap<T>

pub fn new() -> Self

pub fn keys(&self) -> impl Iterator<Item = &Seg>

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

pub fn get(&self, value: u32) -> Option<T>

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

pub fn clear(&mut self)

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

pub fn len(&self) -> usize

Trait Implementations

impl<T: Clone> Clone for SegMap<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for SegMap<T>

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

Formats the value using the given formatter.

impl<T: Clone, const N: usize> From<[(Seg, T); N]> for SegMap<T>

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

Converts to this type from the input type.

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

type Item = (&'a Seg, &'a T)

The type of the elements being iterated over.

type IntoIter = Iter<'a, Seg, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for SegMap<T>

type Item = (Seg, T)

The type of the elements being iterated over.

type IntoIter = IntoIter<Seg, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq> PartialEq for SegMap<T>

fn eq(&self, other: &SegMap<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> StructuralPartialEq for SegMap<T>