Modulenonempty-containers-0.4.0.0Haskell2010

Data.IntMap.NonEmpty.Strict.Internal

Strict internal-use functions used in the implementation of Data.IntMap.NonEmpty.Strict. These share the same NEIntMap type as the lazy modules; only construction is strict in the value.

2 types
25 values

Packagenonempty-containers-0.4.0.0
Exports28
LanguageHaskell2010
LicenceBSD-3-Clause
SourceInternal.hs

Non-Empty IntMap type

16 declarations

typetype NEIntMap = NEIntMap

patternpattern NEIntMap :: Key -> a -> IntMap a -> NEIntMap a

valueneimIntMap :: NEIntMap a -> IntMap a

typetype Key = Int

valuesingleton :: Key -> a -> NEIntMap a

valuenonEmptyMap :: IntMap a -> Maybe (NEIntMap a)

valuewithNonEmpty :: b -> (NEIntMap a -> b) -> IntMap a -> b

valuefromList :: NonEmpty (Key, a) -> NEIntMap a

valuetoList :: NEIntMap a -> NonEmpty (Key, a)

valuemap :: (a -> b) -> NEIntMap a -> NEIntMap b

valueinsertWith :: (a -> a -> a) -> Key -> a -> NEIntMap a -> NEIntMap a

valueunion :: NEIntMap a -> NEIntMap a -> NEIntMap a

valueunions :: Foldable1 f => f (NEIntMap a) -> NEIntMap a

valueelems :: NEIntMap a -> NonEmpty a

valuesize :: NEIntMap a -> Int

valuetoMap :: NEIntMap a -> IntMap a

Folds

6 declarations

valuefoldr :: (a -> b -> b) -> b -> NEIntMap a -> b

valuefoldr' :: (a -> b -> b) -> b -> NEIntMap a -> b

valuefoldr1 :: (a -> a -> a) -> NEIntMap a -> a

valuefoldl :: (b -> a -> b) -> b -> NEIntMap a -> b

valuefoldl' :: (b -> a -> b) -> b -> NEIntMap a -> b

valuefoldl1 :: (a -> a -> a) -> NEIntMap a -> a

Traversals

3 declarations

valuetraverseWithKey

:: Applicative f
=> Key -> a -> f b
-> NEIntMap a
-> f (NEIntMap b)

valuetraverseWithKey1

:: Apply f
=> Key -> a -> f b
-> NEIntMap a
-> f (NEIntMap b)

valuefoldMapWithKey :: Monoid m => (Key -> a -> m) -> NEIntMap a -> m

Unsafe IntMap Functions

2 declarations

valueinsertMinMap :: Key -> a -> IntMap a -> IntMap a

valueinsertMaxMap :: Key -> a -> IntMap a -> IntMap a

Debug

1 declaration

valuevalid :: NEIntMap a -> Bool