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.

Contents

Non-Empty IntMap type
Folds
Traversals
Unsafe IntMap Functions
Debug

Synopsis

type NEIntMap
pattern NEIntMap
value neimIntMap
type Key
value singleton
value nonEmptyMap
value withNonEmpty
value fromList
value toList
value map
value insertWith
value union
value unions
value elems
value size
value toMap
value foldr
value foldr'
value foldr1
value foldl
value foldl'
value foldl1
value traverseWithKey
value traverseWithKey1
value foldMapWithKey
value insertMinMap
value insertMaxMap
value valid

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

Non-Empty IntMap type

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

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

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

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

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

Debug

valuevalid :: NEIntMap a -> Bool