mooncakes.io

README

wqbcs/moon_collections/sortedmap does not have a README file

#
SortedMap

pub struct SortedMap[K, V] {
  entries : Array[(K, V)]
  fp_cache : UInt64
  fp_dirty : Bool
}

impl Eq for SortedMap[K, V]

impl Debug for SortedMap[K, V]

impl Collection for SortedMap[K, V]

impl Deterministic for SortedMap[K, V]

#
SortedMap::ceil

source

fn[K : Compare + Eq, V] SortedMap::ceil(self : SortedMap[K, V], key : K) -> (K, V)?

#
SortedMap::clear

source

fn[K, V] SortedMap::clear(self : SortedMap[K, V]) -> Unit

#
SortedMap::clone

source

fn[K : Compare + Eq, V] SortedMap::clone(self : SortedMap[K, V]) -> SortedMap[K, V]

#
SortedMap::contains

source

fn[K : Compare + Eq, V] SortedMap::contains(self : SortedMap[K, V], key : K) -> Bool

#
SortedMap::each

source

fn[K, V] SortedMap::each(self : SortedMap[K, V], f : (K, V) -> Unit) -> Unit

#
SortedMap::filter

source

fn[K, V] SortedMap::filter(self : SortedMap[K, V], pred : (K, V) -> Bool) -> SortedMap[K, V]

#
SortedMap::floor

source

fn[K : Compare + Eq, V] SortedMap::floor(self : SortedMap[K, V], key : K) -> (K, V)?

#
SortedMap::from_array

source

fn[K : Compare + Eq, V] SortedMap::from_array(pairs : Array[(K, V)]) -> SortedMap[K, V]

#
SortedMap::from_sorted_entries

source

fn[K, V] SortedMap::from_sorted_entries(entries : Array[(K, V)]) -> SortedMap[K, V]

#
SortedMap::get

source

fn[K : Compare + Eq, V] SortedMap::get(self : SortedMap[K, V], key : K) -> V?

#
SortedMap::get_or_insert

source

fn[K : Compare + Eq, V] SortedMap::get_or_insert(self : SortedMap[K, V], key : K, default : V) -> V

#
SortedMap::get_or_insert_with

source

fn[K : Compare + Eq, V] SortedMap::get_or_insert_with(self : SortedMap[K, V], key : K, default_fn : () -> V) -> V

#
SortedMap::insert

source

fn[K : Compare + Eq, V] SortedMap::insert(self : SortedMap[K, V], key : K, value : V) -> V?

#
SortedMap::is_empty

source

fn[K, V] SortedMap::is_empty(self : SortedMap[K, V]) -> Bool

#
SortedMap::iter

source

fn[K, V] SortedMap::iter(self : SortedMap[K, V]) -> Iter[(K, V)]

#
SortedMap::keys

source

fn[K, V] SortedMap::keys(self : SortedMap[K, V]) -> Iter[K]

#
SortedMap::keys_array

source

fn[K, V] SortedMap::keys_array(self : SortedMap[K, V]) -> Array[K]

#
SortedMap::len

source

fn[K, V] SortedMap::len(self : SortedMap[K, V]) -> Int

#
SortedMap::lower_bound

source

fn[K : Compare + Eq, V] SortedMap::lower_bound(self : SortedMap[K, V], key : K) -> (K, V)?

#
SortedMap::map_values

source

fn[K, V, R] SortedMap::map_values(self : SortedMap[K, V], f : (V) -> R) -> SortedMap[K, R]

#
SortedMap::max_key

source

fn[K, V] SortedMap::max_key(self : SortedMap[K, V]) -> K?

#
SortedMap::merge

source

fn[K : Compare + Eq, V] SortedMap::merge(self : SortedMap[K, V], other : SortedMap[K, V], resolve : (V, V) -> V) -> SortedMap[K, V]

#
SortedMap::min_key

source

fn[K, V] SortedMap::min_key(self : SortedMap[K, V]) -> K?

#
SortedMap::new

source

fn[K, V] SortedMap::new() -> SortedMap[K, V]

#
SortedMap::range

source

fn[K : Compare + Eq, V] SortedMap::range(self : SortedMap[K, V], from : K, to : K) -> Array[(K, V)]

#
SortedMap::remove

source

fn[K : Compare + Eq, V] SortedMap::remove(self : SortedMap[K, V], key : K) -> V?

#
SortedMap::retain

source

fn[K, V] SortedMap::retain(self : SortedMap[K, V], pred : (K, V) -> Bool) -> Unit

#
SortedMap::to_array

source

fn[K, V] SortedMap::to_array(self : SortedMap[K, V]) -> Array[(K, V)]

#
SortedMap::update

source

fn[K : Compare + Eq, V] SortedMap::update(self : SortedMap[K, V], key : K, f : (V) -> V) -> Bool

#
SortedMap::upper_bound

source

fn[K : Compare + Eq, V] SortedMap::upper_bound(self : SortedMap[K, V], key : K) -> (K, V)?

#
SortedMap::values

source

fn[K, V] SortedMap::values(self : SortedMap[K, V]) -> Iter[V]

#
SortedMap::values_array

source

fn[K, V] SortedMap::values_array(self : SortedMap[K, V]) -> Array[V]

Source Files

sortedmap.mbt

Install

moon add wqbcs/moon_collections@0.2.4

Download zip

DETERMINISTIC × VERIFIABLE × COMPOSABLE collections for MoonBit/WASM — 12 ordered structures, FNV-1a fingerprints with lazy caching (all 11 Deterministic structs), 311 tests. Same input → same output → same fingerprint, always.

collectionsindexmapbitsetbitflagscounterdefault-mapdeterministicdata-structuremoonbitwasmwasm-gcfingerprintringbuffersparse-setsorted-mapdisjoint-setordered-mapverifiablecomposableecs

wqbcs

0.2.4

Apache-2.0

github.com/wqbcs/moon_collections

Updated last month

15 downloads

Site source Report issue Packages Build queue Skills Statistics

#SortedMap

#SortedMap::ceil

#SortedMap::clear

#SortedMap::clone

#SortedMap::contains

#SortedMap::each

#SortedMap::filter

#SortedMap::floor

#SortedMap::from_array

#SortedMap::from_sorted_entries

#SortedMap::get

#SortedMap::get_or_insert

#SortedMap::get_or_insert_with

#SortedMap::insert

#SortedMap::is_empty

#SortedMap::iter

#SortedMap::keys

#SortedMap::keys_array

#SortedMap::len

#SortedMap::lower_bound

#SortedMap::map_values

#SortedMap::max_key

#SortedMap::merge

#SortedMap::min_key

#SortedMap::new

#SortedMap::range

#SortedMap::remove

#SortedMap::retain

#SortedMap::to_array

#SortedMap::update

#SortedMap::upper_bound

#SortedMap::values

#SortedMap::values_array

Source Files

#
SortedMap

#
SortedMap::ceil

#
SortedMap::clear

#
SortedMap::clone

#
SortedMap::contains

#
SortedMap::each

#
SortedMap::filter

#
SortedMap::floor

#
SortedMap::from_array

#
SortedMap::from_sorted_entries

#
SortedMap::get

#
SortedMap::get_or_insert

#
SortedMap::get_or_insert_with

#
SortedMap::insert

#
SortedMap::is_empty

#
SortedMap::iter

#
SortedMap::keys

#
SortedMap::keys_array

#
SortedMap::len

#
SortedMap::lower_bound

#
SortedMap::map_values

#
SortedMap::max_key

#
SortedMap::merge

#
SortedMap::min_key

#
SortedMap::new

#
SortedMap::range

#
SortedMap::remove

#
SortedMap::retain

#
SortedMap::to_array

#
SortedMap::update

#
SortedMap::upper_bound

#
SortedMap::values

#
SortedMap::values_array