empty : HashMap k vThe empty hash map.
importPour l'utiliser :
import Data.HashMapData.HashMap — a hash map keyed by Hashable + Eq
Synopsis
empty : HashMap k vsingleton : Hashable k => Eq k => k -> v -> HashMap k vfromList : Hashable k => Eq k => List (k, v) -> HashMap k visEmpty : HashMap k v -> Boollookup : Hashable k => Eq k => k -> HashMap k v -> Maybe vmember : Hashable k => Eq k => k -> HashMap k v -> BoolfindWithDefault : Hashable k => Eq k => v -> k -> HashMap k v -> vinsert : Hashable k => Eq k => k -> v -> HashMap k v -> HashMap k vinsertWith : Hashable k => Eq k => (v -> v -> v) -> k -> v -> HashMap k v -> HashMap k vdelete : Hashable k => Eq k => k -> HashMap k v -> HashMap k vtoList : HashMap k v -> List (k, v)keys : HashMap k v -> List kvalues : HashMap k v -> List vsize : HashMap k v -> Natunion : Hashable k => Eq k => HashMap k v -> HashMap k v -> HashMap k vmapValues : (v -> w) -> HashMap k v -> HashMap k w
singleton : Hashable k => Eq k => k -> v -> HashMap k vA hash map with a single entry.
fromList : Hashable k => Eq k => List (k, v) -> HashMap k vBuild from a list of pairs; later entries win on duplicate keys.
isEmpty : HashMap k v -> BoolIs the map empty?
lookup : Hashable k => Eq k => k -> HashMap k v -> Maybe vThe value at k, or Nothing.
member : Hashable k => Eq k => k -> HashMap k v -> BoolIs k present?
findWithDefault : Hashable k => Eq k => v -> k -> HashMap k v -> vThe value at k, or a default.
insert : Hashable k => Eq k => k -> v -> HashMap k v -> HashMap k vInsert (or replace) the value at k. O(log n).
insertWith : Hashable k => Eq k => (v -> v -> v) -> k -> v -> HashMap k v -> HashMap k vInsert with a combining function f new old when k already maps.
delete : Hashable k => Eq k => k -> HashMap k v -> HashMap k vRemove k (a no-op if absent).
toList : HashMap k v -> List (k, v)All entries, in an unspecified but DETERMINISTIC order (by hash, then by bucket insertion order — identical on both backends).
keys : HashMap k v -> List kAll keys (see toList for the order).
values : HashMap k v -> List vAll values.
size : HashMap k v -> NatThe number of entries.
union : Hashable k => Eq k => HashMap k v -> HashMap k v -> HashMap k vLeft-biased union: entries of a win over b on shared keys.
mapValues : (v -> w) -> HashMap k v -> HashMap k wMap a function over the values.