Struct SortedMap 

pub struct SortedMap { /* private fields */ }

An immutable sorted map backed by rpds::RedBlackTreeMapSync.

A map derived by assoc or dissoc from a GC-allocated map reports only its path-copied nodes from gc_size_extra; see collections::share_charge for the full rule.

Implementations

impl SortedMap

pub fn empty() -> Self

pub fn count(&self) -> usize

pub fn is_empty(&self) -> bool

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

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

pub fn assoc(&self, key: Value, value: Value) -> Self

pub fn dissoc(&self, key: &Value) -> Self

pub fn iter(&self) -> impl Iterator<Item = (&Value, &Value)>

Iterate over all (key, value) pairs in sorted key order.

pub fn keys(&self) -> Vec<Value>

pub fn vals(&self) -> Vec<Value>

pub fn from_pairs<I: IntoIterator<Item = (Value, Value)>>(iter: I) -> Self

Trait Implementations

impl Clone for SortedMap

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SortedMap

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

Formats the value using the given formatter.

impl PartialEq for SortedMap

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl Trace for SortedMap

fn trace(&self, visitor: &mut MarkVisitor)

fn gc_size_extra(&self) -> usize