Moduleinsert-ordered-containers-0.3.0Haskell2010

Data.HashMap.Strict.InsOrd

InsOrdHashMap is like HashMap, but it folds and traverses in insertion order.

This module interface mimics Data.HashMap.Strict, with some additions.

1 type
49 values

Packageinsert-ordered-containers-0.3.0
Exports50
LanguageHaskell2010
LicenceBSD-3-Clause
SourceInsOrd.hs

datadata InsOrdHashMap k v

HashMap which tries its best to remember insertion order of elements.

Instances34NFData2, ToJSON2, FoldableWithIndex, FunctorWithIndex, TraversableWithIndex, Functor, …

NFData2 InsOrdHashMapDefined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
ToJSON2 InsOrdHashMapDefined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Eq k, Hashable k) => FoldableWithIndex k (InsOrdHashMap k)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Eq k, Hashable k) => FunctorWithIndex k (InsOrdHashMap k)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Eq k, Hashable k) => TraversableWithIndex k (InsOrdHashMap k)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
Functor (InsOrdHashMap k)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
Foldable (InsOrdHashMap k)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
Traversable (InsOrdHashMap k)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
NFData k => NFData1 (InsOrdHashMap k)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Eq k, Hashable k) => Apply (InsOrdHashMap k)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Eq k, Hashable k) => Bind (InsOrdHashMap k)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Eq k, Hashable k, FromJSON k) => FromJSON1 (InsOrdHashMap k)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
ToJSON k => ToJSON1 (InsOrdHashMap k)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Eq k, Hashable k) => IsList (InsOrdHashMap k v)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Eq k, Eq v) => Eq (InsOrdHashMap k v)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Data v, Data k, Hashable k) => Data (InsOrdHashMap k v)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Eq k, Hashable k, Read k, Read v) => Read (InsOrdHashMap k v)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Show k, Show v) => Show (InsOrdHashMap k v)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Eq k, Hashable k) => Semigroup (InsOrdHashMap k v)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Eq k, Hashable k) => Monoid (InsOrdHashMap k v)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(NFData k, NFData v) => NFData (InsOrdHashMap k v)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Hashable k, Hashable v) => Hashable (InsOrdHashMap k v)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
hashWithSalt salt . toHashMap = hashWithSalt salt.
(Eq k, Hashable k, FromJSON k, FromJSON v) => FromJSON (InsOrdHashMap k v)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(ToJSON k, ToJSON v) => ToJSON (InsOrdHashMap k v)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Eq k, Hashable k) => At (InsOrdHashMap k a)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Eq k, Hashable k) => Ixed (InsOrdHashMap k v)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Eq k, Hashable k) => At (InsOrdHashMap k a)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
(Eq k, Hashable k) => Ixed (InsOrdHashMap k v)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
type Item (InsOrdHashMap k v) = (k, v)Defined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
type Index (InsOrdHashMap k v) = kDefined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
type IxValue (InsOrdHashMap k v) = vDefined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
type Index (InsOrdHashMap k v) = kDefined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
type IxValue (InsOrdHashMap k v) = vDefined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd
type IxKind (InsOrdHashMap k v) = An_AffineTraversalDefined in insert-ordered-containers-0.3.0 · Data.HashMap.Strict.InsOrd

Construction

2 declarations

valueempty :: InsOrdHashMap k v

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

Basic interface

11 declarations

valuenull :: InsOrdHashMap k v -> Bool

valuesize :: InsOrdHashMap k v -> Int

valuemember :: (Eq k, Hashable k) => k -> InsOrdHashMap k a -> Bool

valuelookup :: (Eq k, Hashable k) => k -> InsOrdHashMap k v -> Maybe v

valuelookupDefault

:: (Eq k, Hashable k)
=> v
Default value to return.
-> k
-> InsOrdHashMap k v
-> v

valueinsert

:: (Eq k, Hashable k)
=> k
-> v
-> InsOrdHashMap k v
-> InsOrdHashMap k v

valueinsertWith

:: (Eq k, Hashable k)
=> v -> v -> v
-> k
-> v
-> InsOrdHashMap k v
-> InsOrdHashMap k v

valuedelete :: (Eq k, Hashable k) => k -> InsOrdHashMap k v -> InsOrdHashMap k v

valueadjust

:: (Eq k, Hashable k)
=> v -> v
-> k
-> InsOrdHashMap k v
-> InsOrdHashMap k v

valueupdate

:: (Eq k, Hashable k)
=> a -> Maybe a
-> k
-> InsOrdHashMap k a
-> InsOrdHashMap k a

valuealter

:: (Eq k, Hashable k)
=> Maybe v -> Maybe v
-> k
-> InsOrdHashMap k v
-> InsOrdHashMap k v

Combine

4 declarations

valueunion

:: (Eq k, Hashable k)
=> InsOrdHashMap k v
-> InsOrdHashMap k v
-> InsOrdHashMap k v

valueunionWith

:: (Eq k, Hashable k)
=> v -> v -> v
-> InsOrdHashMap k v
-> InsOrdHashMap k v
-> InsOrdHashMap k v

The union of two maps. If a key occurs in both maps, the provided function (first argument) will be used to compute the result.

Ordered traversal will go thru keys in the first map first.

valueunionWithKey

:: (Eq k, Hashable k)
=> k -> v -> v -> v
-> InsOrdHashMap k v
-> InsOrdHashMap k v
-> InsOrdHashMap k v

valueunions

:: (Eq k, Hashable k, Foldable f)
=> f (InsOrdHashMap k v)
-> InsOrdHashMap k v

Transformations

5 declarations

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

valuemapKeys

:: (Eq k', Hashable k')
=> k -> k'
-> InsOrdHashMap k v
-> InsOrdHashMap k' v

Order preserving mapping of keys.

valuetraverseKeys

:: (Eq k', Hashable k', Applicative f)
=> k -> f k'
-> InsOrdHashMap k v
-> f (InsOrdHashMap k' v)

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

valuetraverseWithKey

:: Applicative f
=> k -> a -> f b
-> InsOrdHashMap k a
-> f (InsOrdHashMap k b)

Unordered

valueunorderedTraverse

:: Applicative f
=> a -> f b
-> InsOrdHashMap k a
-> f (InsOrdHashMap k b)

More efficient than traverse, when traversing in insertion order is not important.

valueunorderedTraverseWithKey

:: Applicative f
=> k -> a -> f b
-> InsOrdHashMap k a
-> f (InsOrdHashMap k b)

More efficient than traverseWithKey, when traversing in insertion order is not important.

Difference and intersection

4 declarations

valuedifference

:: (Eq k, Hashable k)
=> InsOrdHashMap k v
-> InsOrdHashMap k w
-> InsOrdHashMap k v

valueintersection

:: (Eq k, Hashable k)
=> InsOrdHashMap k v
-> InsOrdHashMap k w
-> InsOrdHashMap k v

valueintersectionWith

:: (Eq k, Hashable k)
=> v1 -> v2 -> v3
-> InsOrdHashMap k v1
-> InsOrdHashMap k v2
-> InsOrdHashMap k v3

valueintersectionWithKey

:: (Eq k, Hashable k)
=> k -> v1 -> v2 -> v3
-> InsOrdHashMap k v1
-> InsOrdHashMap k v2
-> InsOrdHashMap k v3

Folds

5 declarations

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

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

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

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

valuefoldMapWithKey :: Monoid m => (k -> a -> m) -> InsOrdHashMap k a -> m

Unordered

valueunorderedFoldMap :: Monoid m => (a -> m) -> InsOrdHashMap k a -> m

More efficient than foldMap, when folding in insertion order is not important.

valueunorderedFoldMapWithKey

:: Monoid m
=> k -> a -> m
-> InsOrdHashMap k a
-> m

More efficient than foldMapWithKey, when folding in insertion order is not important.

Filter

4 declarations

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

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

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

valuemapMaybeWithKey

:: k -> v1 -> Maybe v2
-> InsOrdHashMap k v1
-> InsOrdHashMap k v2

Conversions

7 declarations

valuekeys :: InsOrdHashMap k v -> [k]

valueelems :: InsOrdHashMap k v -> [v]

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

valuetoRevList :: InsOrdHashMap k v -> [(k, v)]

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

valuetoHashMap :: InsOrdHashMap k v -> HashMap k v

valuefromHashMap :: HashMap k v -> InsOrdHashMap k v

Lenses

2 declarations

valuehashMap

:: (Profunctor p, Functor f)
=> p (HashMap k a) (f (HashMap k b))
-> p (InsOrdHashMap k a) (f (InsOrdHashMap k b))

This is a slight lie, as roundtrip doesn't preserve ordering.

valueunorderedTraversal

:: Applicative f
=> a -> f b
-> InsOrdHashMap k a
-> f (InsOrdHashMap k b)

Debugging

1 declaration

valuevalid :: InsOrdHashMap k v -> Bool

Test if the internal map structure is valid.