Moduleunordered-containers-0.2.21

Data.HashMap.Internal

6 types
89 values

Packageunordered-containers-0.2.21
Exports95
LicenceBSD-3-Clause

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

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

valueadjust :: Hashable k => (v -> v) -> 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)

valuebitmapIndexedOrFull :: Bitmap -> Array (HashMap k v) -> HashMap k v

valuebitsPerSubkey :: Int

valuecollision :: Hash -> Leaf k v -> Leaf k v -> HashMap k v

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

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

valuedelete' :: Eq k => Hash -> k -> HashMap k v -> HashMap k v

valuedeleteKeyExists :: Int -> Hash -> k -> HashMap k v -> HashMap k v

valuedifference :: Hashable k => HashMap k v -> HashMap k w -> 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

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

valueelems :: HashMap k v -> [v]

valueempty :: HashMap k v

valueequalKeys :: Eq k => HashMap k v -> HashMap k v' -> Bool

valueequalKeys1 :: (k -> k' -> Bool) -> HashMap k v -> HashMap k' v' -> Bool

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

valuefilterMapAux

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

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

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

valuefullBitmap :: Bitmap

valuehash :: Hashable a => a -> Hash

valueindex :: Hash -> Shift -> Int

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

valueinsert' :: Eq k => Hash -> k -> v -> HashMap k v -> HashMap k v

valueinsertKeyExists :: Int -> Hash -> k -> v -> HashMap k v -> HashMap k v

valueinsertModifying

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

valueinsertNewKey :: Hash -> k -> v -> HashMap k v -> HashMap k v

valueinsertWith

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

valueintersection :: Eq k => HashMap k v -> HashMap k w -> 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

valueintersectionWithKey#

:: Eq k
=> k -> v1 -> v2 -> (# v3 #)
-> HashMap k v1
-> HashMap k v2
-> HashMap k v3

valueisLeafOrCollision :: HashMap k v -> Bool

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

valuelookup' :: Eq k => Hash -> k -> HashMap k v -> Maybe v

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

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

valuelookupRecordCollision :: Eq k => Hash -> k -> HashMap k v -> LookupRes v

valuelookupResToMaybe :: LookupRes a -> Maybe a

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

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

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

valuemask :: Hash -> Shift -> Bitmap

valuemaxChildren :: Int

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

valuenextShift :: Shift -> Shift

valuenull :: HashMap k v -> Bool

valueptrEq :: a -> a -> Bool

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

valuesize :: HashMap k v -> Int

valuesparseIndex :: Bitmap -> Bitmap -> Int

valuesubkeyMask :: Word

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

valuetraverseWithKey

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

valuetwo :: Shift -> Hash -> k -> v -> Hash -> HashMap k v -> ST s (HashMap k v)

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

valueunionArrayBy

:: a -> a -> a
-> Bitmap
-> Bitmap
-> Array a
-> Array a
-> Array a

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

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

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

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

valueupdateFullArray :: Array e -> Int -> e -> Array e

valueupdateFullArrayM :: Array e -> Int -> e -> ST s (Array e)

valueupdateFullArrayWith' :: Array e -> Int -> (e -> e) -> Array e

valueupdateOrConcatWithKey

:: Eq k
=> k -> v -> v -> (# v #)
-> Array (Leaf k v)
-> Array (Leaf k v)
-> Array (Leaf k v)

typetype Bitmap = Word

typetype Hash = Word

datadata HashMap k v

Constructors

Empty
BitmapIndexed !Bitmap !(Array (HashMap k v))
Leaf !Hash !(Leaf k v)
Full !(Array (HashMap k v))
Collision !Hash !(Array (Leaf 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

datadata Leaf k v

Constructors

L !k v

Instances5NFData2, Lift, NFData1, Eq, NFData

NFData2 LeafDefined in unordered-containers-0.2.21 · Data.HashMap.Internal
(Lift k, Lift v) => Lift (Leaf k v)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
NFData k => NFData1 (Leaf k)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
(Eq k, Eq v) => Eq (Leaf k v)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal
(NFData k, NFData v) => NFData (Leaf k v)Defined in unordered-containers-0.2.21 · Data.HashMap.Internal

datadata LookupRes a

Constructors

Absent
Present a !Int

typetype Shift = Int