Moduleunordered-containers-0.2.21

Data.HashMap.Strict

Synopsis

value !
value !?
value compose
value delete
value difference
value disjoint
value elems
value empty
value filter
value filterWithKey
value findWithDefault
value foldMapWithKey
value foldl
value foldl'
value foldlWithKey
value foldlWithKey'
value foldr
value foldr'
value foldrWithKey
value foldrWithKey'
value intersection
value isSubmapOf
value isSubmapOfBy
value keys
value lookup
value lookupDefault
value lookupKey
value mapKeys
value member
value null
value size
value toList
value union
value unions
value adjust
value alter
value alterF
value differenceWith
value differenceWithKey
value fromList
value fromListWith
value fromListWithKey
value insert
value insertWith
value intersectionWith
value intersectionWithKey
value map
value mapMaybe
value mapMaybeWithKey
value mapWithKey
value singleton
value traverseWithKey
value unionWith
value unionWithKey
value update
value keysSet
data HashMap

Packageunordered-containers-0.2.21
Exports57
LicenceBSD-3-Clause

value(!) :: (Hashable k, HasCallStack) => HashMap k v -> k -> v

value(!?) :: Hashable k => HashMap k v -> k -> Maybe v

valuecompose :: Hashable b => HashMap b c -> HashMap a b -> HashMap a c

valuedelete :: Hashable k => k -> HashMap k v -> HashMap k v

valuedifference :: Hashable k => HashMap k v -> HashMap k w -> HashMap k v

valuedisjoint :: Eq k => HashMap k a -> HashMap k b -> Bool

valueelems :: HashMap k v -> [v]

valueempty :: HashMap k v

valuefilter :: (v -> Bool) -> HashMap k v -> HashMap k v

valuefilterWithKey :: (k -> v -> Bool) -> HashMap k v -> HashMap k v

valuefindWithDefault :: Hashable k => v -> k -> HashMap k v -> v

valuefoldMapWithKey :: Monoid m => (k -> v -> m) -> HashMap k v -> m

valuefoldl :: (a -> v -> a) -> a -> HashMap k v -> a

valuefoldl' :: (a -> v -> a) -> a -> HashMap k v -> a

valuefoldlWithKey :: (a -> k -> v -> a) -> a -> HashMap k v -> a

valuefoldlWithKey' :: (a -> k -> v -> a) -> a -> HashMap k v -> a

valuefoldr :: (v -> a -> a) -> a -> HashMap k v -> a

valuefoldr' :: (v -> a -> a) -> a -> HashMap k v -> a

valuefoldrWithKey :: (k -> v -> a -> a) -> a -> HashMap k v -> a

valuefoldrWithKey' :: (k -> v -> a -> a) -> a -> HashMap k v -> a

valueintersection :: Eq k => HashMap k v -> HashMap k w -> HashMap k v

valueisSubmapOf :: (Hashable k, Eq v) => HashMap k v -> HashMap k v -> Bool

valueisSubmapOfBy

:: Hashable k
=> v1 -> v2 -> Bool
-> HashMap k v1
-> HashMap k v2
-> Bool

valuekeys :: HashMap k v -> [k]

valuelookup :: Hashable k => k -> HashMap k v -> Maybe v

valuelookupDefault :: Hashable k => v -> k -> HashMap k v -> v

valuelookupKey :: Hashable k => k -> HashMap k v -> Maybe k

valuemapKeys :: Hashable k2 => (k1 -> k2) -> HashMap k1 v -> HashMap k2 v

valuemember :: Hashable k => k -> HashMap k a -> Bool

valuenull :: HashMap k v -> Bool

valuesize :: HashMap k v -> Int

valuetoList :: HashMap k v -> [(k, v)]

valueunion :: Eq k => HashMap k v -> HashMap k v -> HashMap k v

valueunions :: Eq k => [HashMap k v] -> HashMap k v

valueadjust :: Hashable k => (v -> v) -> k -> HashMap k v -> HashMap k v

valuealter

:: Hashable k
=> Maybe v -> Maybe v
-> k
-> HashMap k v
-> HashMap k v

valuealterF

:: (Functor f, Hashable k)
=> Maybe v -> f (Maybe v)
-> k
-> HashMap k v
-> f (HashMap k v)

valuedifferenceWith

:: Hashable k
=> v -> w -> Maybe v
-> HashMap k v
-> HashMap k w
-> HashMap k v

valuedifferenceWithKey

:: Eq k
=> k -> v -> w -> Maybe v
-> HashMap k v
-> HashMap k w
-> HashMap k v

valuefromList :: Hashable k => [(k, v)] -> HashMap k v

valuefromListWith :: Hashable k => (v -> v -> v) -> [(k, v)] -> HashMap k v

valuefromListWithKey

:: Hashable k
=> k -> v -> v -> v
-> [(k, v)]
-> HashMap k v

valueinsert :: Hashable k => k -> v -> HashMap k v -> HashMap k v

valueinsertWith

:: Hashable k
=> v -> v -> v
-> k
-> v
-> HashMap k v
-> HashMap k v

valueintersectionWith

:: Eq k
=> v1 -> v2 -> v3
-> HashMap k v1
-> HashMap k v2
-> HashMap k v3

valueintersectionWithKey

:: Eq k
=> k -> v1 -> v2 -> v3
-> HashMap k v1
-> HashMap k v2
-> HashMap k v3

valuemap :: (v1 -> v2) -> HashMap k v1 -> HashMap k v2

valuemapMaybe :: (v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

valuemapMaybeWithKey :: (k -> v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

valuemapWithKey :: (k -> v1 -> v2) -> HashMap k v1 -> HashMap k v2

valuesingleton :: Hashable k => k -> v -> HashMap k v

valuetraverseWithKey

:: Applicative f
=> k -> v1 -> f v2
-> HashMap k v1
-> f (HashMap k v2)

valueunionWith

:: Eq k
=> v -> v -> v
-> HashMap k v
-> HashMap k v
-> HashMap k v

valueunionWithKey

:: Eq k
=> k -> v -> v -> v
-> HashMap k v
-> HashMap k v
-> HashMap k v

valueupdate :: Hashable k => (a -> Maybe a) -> k -> HashMap k a -> HashMap k a

valuekeysSet :: HashMap k a -> HashSet k

datadata HashMap k v

Instances27Bifoldable, Eq2, Ord2, Show2, NFData2, Hashable2, …

Bifoldable HashMapDefined in unordered-containers-0.2.21 · Data.HashMap.Internal
Eq2 HashMapDefined in unordered-containers-0.2.21 · Data.HashMap.Internal
Ord2 HashMapDefined in unordered-containers-0.2.21 · Data.HashMap.Internal
Show2 HashMapDefined in unordered-containers-0.2.21 · Data.HashMap.Internal
NFData2 HashMapDefined in unordered-containers-0.2.21 · Data.HashMap.Internal
Hashable2 HashMapDefined in unordered-containers-0.2.21 · Data.HashMap.Internal
(Lift k, Lift v) => Lift (HashMap k v)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
Functor (HashMap k)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
Foldable (HashMap k)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
Traversable (HashMap k)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
Eq k => Eq1 (HashMap k)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
Ord k => Ord1 (HashMap k)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
(Hashable k, Read k) => Read1 (HashMap k)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
Show k => Show1 (HashMap k)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
NFData k => NFData1 (HashMap k)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
Hashable k => Hashable1 (HashMap k)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
Hashable k => IsList (HashMap k v)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
(Eq k, Eq v) => Eq (HashMap k v)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
(Data k, Data v, Hashable k) => Data (HashMap k v)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
(Ord k, Ord v) => Ord (HashMap k v)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
(Hashable k, Read k, Read e) => Read (HashMap k e)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
(Show k, Show v) => Show (HashMap k v)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
Hashable k => Semigroup (HashMap k v)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
Hashable k => Monoid (HashMap k v)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
(NFData k, NFData v) => NFData (HashMap k v)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
(Hashable k, Hashable v) => Hashable (HashMap k v)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
type Item (HashMap k v) = (k, v)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal