Type HashMappub

Implements: Default · Foldable · Keyed

:type(pub) HashMap

Trait Implementations

impl Default for HashMap(`?540301` `?540302`)

HashMap's .default MUST draw a seeded HashState via (HashState .new), carrying +Random. The HashState is produced and dropped here because hashmap-new-intrinsic does not yet accept a state argument (the runtime HashMap does not thread the seed through its bucket hasher). The declared +Random effect is still load-bearing: it documents that HashMap construction is non-deterministic per the HashDoS-resistance contract and forces callers to either sit inside a +Random handler or use an explicit zero-seed path through hash-state-new + hashmap-new-intrinsic.

.default ( → (HashMap key val) )

impl Foldable for HashMap(`?540484` `?540485`)

.all ( (HashMap key val) [elem → Bool ] → Bool )

.any ( (HashMap key val) [elem → Bool ] → Bool )

.chunks-n ( (HashMap key val) (Int ..) → (Vec (Vec elem)) )

.count ( (HashMap key val) → (Int ..) )

.count-where ( (HashMap key val) [elem → Bool ] → (Int ..) )

.enumerate ( (HashMap key val) → (Pair (Int ..) (Vec (Pair (Int ..) elem))) )

.filter-map ( (HashMap key val) [elem → (Option b) ] → (Vec b) )

.find ( (HashMap key val) [elem → Bool ] → (Option elem) )

.find-map ( (HashMap key val) [elem → (Option b) ] → (Option b) )

.first ( (HashMap key val) → (Option elem) )

.flat-map ( (HashMap key val) [elem → (Vec b n) ] → (Vec b) )

.flatten ( (HashMap key val) → (Vec elem) )

.fold ( (HashMap key val) acc [acc (Pair key val) → acc ] → acc )

.for-each ( (HashMap key val) [(Pair key val) → ] → )

.intersperse ( (HashMap key val) elem → (Vec elem) )

.is-partitioned ( (HashMap key val) [elem → Bool ] → Bool )

.last ( (HashMap key val) → (Option elem) )

.map-while ( (HashMap key val) [elem → (Option b) ] → (Vec b) )

.max-by ( (HashMap key val) [elem elem → Ordering ] → (Option elem) )

.max-by-key ( (HashMap key val) [elem → key ] → (Option elem) )

.min-by ( (HashMap key val) [elem elem → Ordering ] → (Option elem) )

.min-by-key ( (HashMap key val) [elem → key ] → (Option elem) )

.partition ( (HashMap key val) [elem → Bool ] → (Vec elem la) (Vec elem lb) )

.position ( (HashMap key val) [elem → Bool ] → (Option (Int ..)) )

.reduce ( (HashMap key val) [elem elem → elem ] → (Option elem) )

.rposition ( (HashMap key val) [elem → Bool ] → (Option (Int ..)) )

.scan ( (HashMap key val) state [state elem → state (Option result) ] → (Vec result) )

.skip ( (HashMap key val) (Int ..) → (Vec elem) )

.skip-while ( (HashMap key val) [elem → Bool ] → (Vec elem) )

.step-by ( (HashMap key val) (Int ..) → (Vec elem) )

.take ( (HashMap key val) (Int ..) → (Vec elem) )

.take-while ( (HashMap key val) [elem → Bool ] → (Vec elem) )

.try-fold ( (HashMap key val) acc [acc elem → (Result acc err) ] → (Result acc err) )

.try-for-each ( (HashMap key val) [elem → (Result Unit err) ] → (Result Unit err) )

.try-reduce ( (HashMap key val) [elem elem → (Result elem err) ] → (Result (Option elem) err) )

.unzip ( (HashMap key val) → (Pair (Vec a) (Vec b)) )

impl Keyed for HashMap(`?540803` `?540804`)

.contains-key ( key (HashMap key val) → Bool )

.lookup ( key (HashMap key val) → (Option val) )