mooncakes.io

README

wqbcs/moon_collections/indexmap does not have a README file

#
Entry

pub struct Entry[K, V] {
  key : K
  value : V
} derive(Eq, @moonbitlang/core/debug.Debug
Debug)

#
IndexMap

source

pub struct IndexMap[K, V] {
  entries : Array[Entry[K, V]]
  indices : @moonbitlang/core/hashmap.HashMap
HashMap[K, Int]
  fp_cache : UInt64
  fp_dirty : Bool
}

impl Eq for IndexMap[K, V]

impl Debug for IndexMap[K, V]

impl Collection for IndexMap[K, V]

impl Deterministic for IndexMap[K, V]

#
IndexMap::at

source

fn[K : Hash + Eq, V] IndexMap::at(self : IndexMap[K, V], key : K) -> V?

#
IndexMap::clear

source

fn[K : Hash + Eq, V] IndexMap::clear(self : IndexMap[K, V]) -> Unit

#
IndexMap::clone

source

fn[K : Hash + Eq, V] IndexMap::clone(self : IndexMap[K, V]) -> IndexMap[K, V]

#
IndexMap::contains

source

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

#
IndexMap::drain

source

fn[K : Hash + Eq, V] IndexMap::drain(self : IndexMap[K, V], pred : (K, V) -> Bool) -> IndexMap[K, V]

#
IndexMap::each

source

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

#
IndexMap::entries

source

fn[K, V] IndexMap::entries(self : IndexMap[K, V]) -> Array[Entry[K, V]]

#
IndexMap::filter

source

fn[K : Hash + Eq, V] IndexMap::filter(self : IndexMap[K, V], pred : (K, V) -> Bool) -> IndexMap[K, V]

#
IndexMap::first

source

fn[K, V] IndexMap::first(self : IndexMap[K, V]) -> (K, V)?

#
IndexMap::from_array

source

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

#
IndexMap::get

source

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

#
IndexMap::get_index

source

fn[K, V] IndexMap::get_index(self : IndexMap[K, V], index : Int) -> (K, V)?

#
IndexMap::get_index_of

source

fn[K : Hash + Eq, V] IndexMap::get_index_of(self : IndexMap[K, V], key : K) -> Int?

#
IndexMap::get_key_at

source

fn[K, V] IndexMap::get_key_at(self : IndexMap[K, V], index : Int) -> K?

#
IndexMap::get_or_insert

source

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

#
IndexMap::get_or_insert_with

source

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

#
IndexMap::get_value_at

source

fn[K, V] IndexMap::get_value_at(self : IndexMap[K, V], index : Int) -> V?

#
IndexMap::has_all

source

fn[K : Hash + Eq, V] IndexMap::has_all(self : IndexMap[K, V], keys : Array[K]) -> Bool

#
IndexMap::has_any

source

fn[K : Hash + Eq, V] IndexMap::has_any(self : IndexMap[K, V], keys : Array[K]) -> Bool

#
IndexMap::insert

source

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

#
IndexMap::insert_after

source

fn[K : Hash + Eq, V] IndexMap::insert_after(self : IndexMap[K, V], target : K, key : K, value : V) -> Bool

#
IndexMap::insert_before

source

fn[K : Hash + Eq, V] IndexMap::insert_before(self : IndexMap[K, V], target : K, key : K, value : V) -> Bool

#
IndexMap::is_empty

source

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

#
IndexMap::iter

source

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

#
IndexMap::keys

source

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

#
IndexMap::keys_array

source

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

#
IndexMap::last

source

fn[K, V] IndexMap::last(self : IndexMap[K, V]) -> (K, V)?

#
IndexMap::len

source

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

#
IndexMap::map_values

source

fn[K : Hash + Eq, V, R] IndexMap::map_values(self : IndexMap[K, V], f : (V) -> R) -> IndexMap[K, R]

#
IndexMap::merge

source

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

#
IndexMap::move_to_back

source

fn[K : Hash + Eq, V] IndexMap::move_to_back(self : IndexMap[K, V], key : K) -> Bool

#
IndexMap::move_to_front

source

fn[K : Hash + Eq, V] IndexMap::move_to_front(self : IndexMap[K, V], key : K) -> Bool

#
IndexMap::new

source

fn[K : Hash + Eq, V] IndexMap::new() -> IndexMap[K, V]

#
IndexMap::op_index

source

#alias("_[_]")
fn[K : Hash + Eq, V] IndexMap::op_index(self : IndexMap[K, V], key : K) -> V?

#
IndexMap::op_set

source

fn[K : Hash + Eq, V] IndexMap::op_set(self : IndexMap[K, V], key : K, value : V) -> Unit

#
IndexMap::pop_back

source

fn[K : Hash + Eq, V] IndexMap::pop_back(self : IndexMap[K, V]) -> (K, V)?

#
IndexMap::pop_front

source

fn[K : Hash + Eq, V] IndexMap::pop_front(self : IndexMap[K, V]) -> (K, V)?

#
IndexMap::remove

source

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

#
IndexMap::remove_entry

source

fn[K : Hash + Eq, V] IndexMap::remove_entry(self : IndexMap[K, V], key : K) -> (K, V)?

#
IndexMap::retain

source

fn[K : Hash + Eq, V] IndexMap::retain(self : IndexMap[K, V], pred : (K, V) -> Bool) -> Unit

#
IndexMap::retain_keys

source

fn[K : Hash + Eq, V] IndexMap::retain_keys(self : IndexMap[K, V], pred : (K) -> Bool) -> Unit

#
IndexMap::rev_iter

source

fn[K, V] IndexMap::rev_iter(self : IndexMap[K, V]) -> Iter[(K, V)]

#
IndexMap::reverse

source

fn[K : Hash + Eq, V] IndexMap::reverse(self : IndexMap[K, V]) -> Unit

#
IndexMap::shift_remove

source

fn[K : Hash + Eq, V] IndexMap::shift_remove(self : IndexMap[K, V], key : K) -> V?

#
IndexMap::shift_remove_index

source

fn[K : Hash + Eq, V] IndexMap::shift_remove_index(self : IndexMap[K, V], index : Int) -> (K, V)?

#
IndexMap::sort_keys

source

fn[K : Hash + Eq + Compare, V] IndexMap::sort_keys(self : IndexMap[K, V]) -> Unit

#
IndexMap::swap_indices

source

fn[K : Hash + Eq, V] IndexMap::swap_indices(self : IndexMap[K, V], a : Int, b : Int) -> Bool

#
IndexMap::swap_remove

source

fn[K : Hash + Eq, V] IndexMap::swap_remove(self : IndexMap[K, V], key : K) -> V?

#
IndexMap::swap_remove_index

source

fn[K : Hash + Eq, V] IndexMap::swap_remove_index(self : IndexMap[K, V], index : Int) -> (K, V)?

#
IndexMap::to_array

source

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

#
IndexMap::update

source

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

#
IndexMap::update_or_insert

source

fn[K : Hash + Eq, V] IndexMap::update_or_insert(self : IndexMap[K, V], key : K, f : (V) -> V, default : V) -> V

#
IndexMap::values

source

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

#
IndexMap::values_array

source

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

#
IndexSet

source

pub struct IndexSet[K] {
  map : IndexMap[K, Unit]
} derive(@moonbitlang/core/debug.Debug
Debug)

impl Eq for IndexSet[K]

impl Collection for IndexSet[K]

impl Deterministic for IndexSet[K]

#
IndexSet::clear

source

fn[K : Hash + Eq] IndexSet::clear(self : IndexSet[K]) -> Unit

#
IndexSet::clone

source

fn[K : Hash + Eq] IndexSet::clone(self : IndexSet[K]) -> IndexSet[K]

#
IndexSet::contains

source

fn[K : Hash + Eq] IndexSet::contains(self : IndexSet[K], key : K) -> Bool

#
IndexSet::difference

source

fn[K : Hash + Eq] IndexSet::difference(self : IndexSet[K], other : IndexSet[K]) -> IndexSet[K]

#
IndexSet::each

source

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

#
IndexSet::extend_

source

fn[K : Hash + Eq] IndexSet::extend_(self : IndexSet[K], items : Array[K]) -> Unit

#
IndexSet::from_array

source

fn[K : Hash + Eq] IndexSet::from_array(items : Array[K]) -> IndexSet[K]

#
IndexSet::get_index

source

fn[K] IndexSet::get_index(self : IndexSet[K], index : Int) -> K?

#
IndexSet::get_index_of

source

fn[K : Hash + Eq] IndexSet::get_index_of(self : IndexSet[K], key : K) -> Int?

#
IndexSet::insert

source

fn[K : Hash + Eq] IndexSet::insert(self : IndexSet[K], key : K) -> Unit

#
IndexSet::intersect

source

fn[K : Hash + Eq] IndexSet::intersect(self : IndexSet[K], other : IndexSet[K]) -> IndexSet[K]

#
IndexSet::is_disjoint

source

fn[K : Hash + Eq] IndexSet::is_disjoint(self : IndexSet[K], other : IndexSet[K]) -> Bool

#
IndexSet::is_empty

source

fn[K] IndexSet::is_empty(self : IndexSet[K]) -> Bool

#
IndexSet::is_subset

source

fn[K : Hash + Eq] IndexSet::is_subset(self : IndexSet[K], other : IndexSet[K]) -> Bool

#
IndexSet::is_superset

source

fn[K : Hash + Eq] IndexSet::is_superset(self : IndexSet[K], other : IndexSet[K]) -> Bool

#
IndexSet::iter

source

fn[K] IndexSet::iter(self : IndexSet[K]) -> Iter[K]

#
IndexSet::keys

source

fn[K] IndexSet::keys(self : IndexSet[K]) -> Iter[K]

#
IndexSet::len

source

fn[K] IndexSet::len(self : IndexSet[K]) -> Int

#
IndexSet::move_to_back

source

fn[K : Hash + Eq] IndexSet::move_to_back(self : IndexSet[K], key : K) -> Bool

#
IndexSet::move_to_front

source

fn[K : Hash + Eq] IndexSet::move_to_front(self : IndexSet[K], key : K) -> Bool

#
IndexSet::new

source

fn[K : Hash + Eq] IndexSet::new() -> IndexSet[K]

#
IndexSet::pop_back

source

fn[K : Hash + Eq] IndexSet::pop_back(self : IndexSet[K]) -> K?

#
IndexSet::pop_front

source

fn[K : Hash + Eq] IndexSet::pop_front(self : IndexSet[K]) -> K?

#
IndexSet::remove

source

fn[K : Hash + Eq] IndexSet::remove(self : IndexSet[K], key : K) -> Bool

#
IndexSet::retain

source

fn[K : Hash + Eq] IndexSet::retain(self : IndexSet[K], pred : (K) -> Bool) -> Unit

#
IndexSet::rev_iter

source

fn[K] IndexSet::rev_iter(self : IndexSet[K]) -> Iter[K]

#
IndexSet::reverse

source

fn[K : Hash + Eq] IndexSet::reverse(self : IndexSet[K]) -> Unit

#
IndexSet::shift_remove

source

fn[K : Hash + Eq] IndexSet::shift_remove(self : IndexSet[K], key : K) -> Bool

#
IndexSet::symmetric_difference

source

fn[K : Hash + Eq] IndexSet::symmetric_difference(self : IndexSet[K], other : IndexSet[K]) -> IndexSet[K]

#
IndexSet::to_array

source

fn[K] IndexSet::to_array(self : IndexSet[K]) -> Array[K]

#
IndexSet::union

source

fn[K : Hash + Eq] IndexSet::union(self : IndexSet[K], other : IndexSet[K]) -> IndexSet[K]

Source Files

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

#Entry

#IndexMap

#IndexMap::at

#IndexMap::clear

#IndexMap::clone

#IndexMap::contains

#IndexMap::drain

#IndexMap::each

#IndexMap::entries

#IndexMap::filter

#IndexMap::first

#IndexMap::from_array

#IndexMap::get

#IndexMap::get_index

#IndexMap::get_index_of

#IndexMap::get_key_at

#IndexMap::get_or_insert

#IndexMap::get_or_insert_with

#IndexMap::get_value_at

#IndexMap::has_all

#IndexMap::has_any

#IndexMap::insert

#IndexMap::insert_after

#IndexMap::insert_before

#IndexMap::is_empty

#IndexMap::iter

#IndexMap::keys

#IndexMap::keys_array

#IndexMap::last

#IndexMap::len

#IndexMap::map_values

#IndexMap::merge

#IndexMap::move_to_back

#IndexMap::move_to_front

#IndexMap::new

#IndexMap::op_index

#IndexMap::op_set

#IndexMap::pop_back

#IndexMap::pop_front

#IndexMap::remove

#IndexMap::remove_entry

#IndexMap::retain

#IndexMap::retain_keys

#IndexMap::rev_iter

#IndexMap::reverse

#IndexMap::shift_remove

#IndexMap::shift_remove_index

#IndexMap::sort_keys

#IndexMap::swap_indices

#IndexMap::swap_remove

#IndexMap::swap_remove_index

#IndexMap::to_array

#IndexMap::update

#IndexMap::update_or_insert

#IndexMap::values

#IndexMap::values_array

#IndexSet

#IndexSet::clear

#IndexSet::clone

#IndexSet::contains

#IndexSet::difference

#IndexSet::each

#IndexSet::extend_

#IndexSet::from_array

#IndexSet::get_index

#IndexSet::get_index_of

#IndexSet::insert

#IndexSet::intersect

#IndexSet::is_disjoint

#IndexSet::is_empty

#IndexSet::is_subset

#IndexSet::is_superset

#IndexSet::iter

#IndexSet::keys

#IndexSet::len

#IndexSet::move_to_back

#IndexSet::move_to_front

#IndexSet::new

#IndexSet::pop_back

#IndexSet::pop_front

#
Entry

#
IndexMap

#
IndexMap::at

#
IndexMap::clear

#
IndexMap::clone

#
IndexMap::contains

#
IndexMap::drain

#
IndexMap::each

#
IndexMap::entries

#
IndexMap::filter

#
IndexMap::first

#
IndexMap::from_array

#
IndexMap::get

#
IndexMap::get_index

#
IndexMap::get_index_of

#
IndexMap::get_key_at

#
IndexMap::get_or_insert

#
IndexMap::get_or_insert_with

#
IndexMap::get_value_at

#
IndexMap::has_all

#
IndexMap::has_any

#
IndexMap::insert

#
IndexMap::insert_after

#
IndexMap::insert_before

#
IndexMap::is_empty

#
IndexMap::iter

#
IndexMap::keys

#
IndexMap::keys_array

#
IndexMap::last

#
IndexMap::len

#
IndexMap::map_values

#
IndexMap::merge

#
IndexMap::move_to_back

#
IndexMap::move_to_front

#
IndexMap::new

#
IndexMap::op_index

#
IndexMap::op_set

#
IndexMap::pop_back

#
IndexMap::pop_front

#
IndexMap::remove

#
IndexMap::remove_entry

#
IndexMap::retain

#
IndexMap::retain_keys

#
IndexMap::rev_iter

#
IndexMap::reverse

#
IndexMap::shift_remove

#
IndexMap::shift_remove_index

#
IndexMap::sort_keys

#
IndexMap::swap_indices

#
IndexMap::swap_remove

#
IndexMap::swap_remove_index

#
IndexMap::to_array

#
IndexMap::update

#
IndexMap::update_or_insert

#
IndexMap::values

#
IndexMap::values_array

#
IndexSet

#
IndexSet::clear

#
IndexSet::clone

#
IndexSet::contains

#
IndexSet::difference

#
IndexSet::each

#
IndexSet::extend_

#
IndexSet::from_array

#
IndexSet::get_index

#
IndexSet::get_index_of

#
IndexSet::insert

#
IndexSet::intersect

#
IndexSet::is_disjoint

#
IndexSet::is_empty

#
IndexSet::is_subset

#
IndexSet::is_superset

#
IndexSet::iter

#
IndexSet::keys

#
IndexSet::len

#
IndexSet::move_to_back

#
IndexSet::move_to_front

#
IndexSet::new

#
IndexSet::pop_back

#
IndexSet::pop_front