HashMap39

Constructors

emptyconstCreates a new empty HashMap.fromIterableconstCreates a new HashMap from an iterable collection of key/value pairs.makeconstConstructs a new HashMap from an array of key/value pairs.

Models

HashMapinterfaceA HashMap is an immutable key-value data structure that provides efficient lookup, insertion, and deletion operations.

Getters

entriesconstReturns an IterableIterator of the entries within the HashMap.keysconstReturns an IterableIterator of the keys within the HashMap.sizeconstReturns the number of entries within the HashMap.toEntriesconstReturns an Array<[K, V]> of the entries within the HashMap.toValuesconstReturns an Array of the values within the HashMap.valuesconstReturns an IterableIterator of the values within the HashMap.

Elements

everyconstChecks whether all entries in a hashmap meets a specific condition.findFirstconstReturns the first element that satisfies the specified predicate, or None if no such element exists.getconstLooks up the value for the specified key in the HashMap safely using the internal hashing function.getHashconstLooks up the value for the specified key in the HashMap safely using a custom hash.hasconstChecks whether the specified key has an entry in the HashMap.hasByconstChecks whether an element matching the given predicate exists in the given HashMap.hasHashconstChecks whether the specified key has an entry in the HashMap using a custom hash.isEmptyconstChecks whether the HashMap contains no entries.someconstChecks whether any entry in a hashmap meets a specific condition.

Mapping

mapconstMaps over the entries of the HashMap using the specified function.

Filtering

compactconstFilters out None values from a HashMap of Optionss.filterconstFilters entries out of a HashMap using the specified predicate.filterMapconstMaps over the entries of the HashMap using the specified filter and keeps only successful results.

Sequencing

flatMapconstMaps each entry to a HashMap and flattens the results.

Mutations

beginMutationconstCreates a transient mutable HashMap for efficient batched updates.endMutationconstMarks the HashMap as immutable, completing the mutation cycle.mutateconstRuns a batch of updates against a transient mutable copy of the HashMap and returns the finalized immutable result.

Combining

unionconstCombines two HashMaps into one.

Folding

reduceconstReduces the specified state over the entries of the HashMap.

Transforming

modifyconstUpdates the value of the specified key within the HashMap if it exists.modifyAtconstSets or removes the specified key using an update function.modifyHashconstSets or removes the specified key using a precomputed hash and an update function.removeconstRemoves the entry for the specified key in the HashMap using the internal hashing function.removeManyconstRemoves all entries in the HashMap which have the specified keys.setconstSets the specified key to the specified value using the internal hashing function.setManyconstSets multiple key-value pairs in the HashMap.

Traversing

forEachconstApplies the specified function to the entries of the HashMap.

Unsafe

getUnsafeconstLooks up the value for the specified key in the HashMap unsafely using the internal hashing function.