Data.EnumMap.Lazy · enummapset-0.7.3.0

newtypenewtype EnumMap k a

#

Wrapper for IntMap with Enum keys.

Instances14Functor, Foldable, Traversable, IsList, Eq, Ord, …

Functor (EnumMap k)Defined in enummapset-0.7.3.0 · Data.EnumMap.Base
Foldable (EnumMap k)Defined in enummapset-0.7.3.0 · Data.EnumMap.Base
Traversable (EnumMap k)Defined in enummapset-0.7.3.0 · Data.EnumMap.Base
Enum k => IsList (EnumMap k a)Defined in enummapset-0.7.3.0 · Data.EnumMap.Base
Eq a => Eq (EnumMap k a)Defined in enummapset-0.7.3.0 · Data.EnumMap.Base
Ord a => Ord (EnumMap k a)Defined in enummapset-0.7.3.0 · Data.EnumMap.Base
(Enum k, Read k, Read a) => Read (EnumMap k a)Defined in enummapset-0.7.3.0 · Data.EnumMap.Base
(Enum k, Show k, Show a) => Show (EnumMap k a)Defined in enummapset-0.7.3.0 · Data.EnumMap.Base
Semigroup (EnumMap k a)Defined in enummapset-0.7.3.0 · Data.EnumMap.Base
Monoid (EnumMap k a)Defined in enummapset-0.7.3.0 · Data.EnumMap.Base
NFData a => NFData (EnumMap k a)Defined in enummapset-0.7.3.0 · Data.EnumMap.Base
FromJSON a => FromJSON (EnumMap k a)Defined in enummapset-0.7.3.0 · Data.EnumMap.Base
ToJSON a => ToJSON (EnumMap k a)Defined in enummapset-0.7.3.0 · Data.EnumMap.Base
type Item (EnumMap k a) = (k, a)Defined in enummapset-0.7.3.0 · Data.EnumMap.Base

Wrapping/unwrapping

2 declarations

valueintMapToEnumMap :: IntMap a -> EnumMap k a

#

Wrap IntMap.

valueenumMapToIntMap :: EnumMap k a -> IntMap a

#

Unwrap IntMap.

Operators

2 declarations

value(!) :: Enum k => EnumMap k a -> k -> a

#

value(\\) :: EnumMap k a -> EnumMap k b -> EnumMap k a

#

Query

10 declarations

valuenull :: EnumMap k a -> Bool

#

valuesize :: EnumMap k a -> Int

#

valuemember :: Enum k => k -> EnumMap k a -> Bool

#

valuenotMember :: Enum k => k -> EnumMap k a -> Bool

#

valuelookup :: Enum k => k -> EnumMap k a -> Maybe a

#

valuefindWithDefault :: Enum k => a -> k -> EnumMap k a -> a

#

valuelookupLT :: Enum k => k -> EnumMap k a -> Maybe (k, a)

#

valuelookupGT :: Enum k => k -> EnumMap k a -> Maybe (k, a)

#

valuelookupLE :: Enum k => k -> EnumMap k a -> Maybe (k, a)

#

valuelookupGE :: Enum k => k -> EnumMap k a -> Maybe (k, a)

#

Construction

2 declarations

valueempty :: EnumMap k a

#

valuesingleton :: Enum k => k -> a -> EnumMap k a

#

Insertion

valueinsert :: Enum k => k -> a -> EnumMap k a -> EnumMap k a

#

valueinsertWith

:: Enum k
=> a -> a -> a
-> k
-> a
-> EnumMap k a
-> EnumMap k a

#

valueinsertWithKey

:: Enum k
=> k -> a -> a -> a
-> k
-> a
-> EnumMap k a
-> EnumMap k a

#

valueinsertLookupWithKey

:: Enum k
=> k -> a -> a -> a
-> k
-> a
-> EnumMap k a
-> (Maybe a, EnumMap k a)

#

Delete/Update

valuedelete :: Enum k => k -> EnumMap k a -> EnumMap k a

#

valueadjust :: Enum k => (a -> a) -> k -> EnumMap k a -> EnumMap k a

#

valueadjustWithKey :: Enum k => (k -> a -> a) -> k -> EnumMap k a -> EnumMap k a

#

valueupdate :: Enum k => (a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a

#

valueupdateWithKey

:: Enum k
=> k -> a -> Maybe a
-> k
-> EnumMap k a
-> EnumMap k a

#

valueupdateLookupWithKey

:: Enum k
=> k -> a -> Maybe a
-> k
-> EnumMap k a
-> (Maybe a, EnumMap k a)

#

valuealter :: Enum k => (Maybe a -> Maybe a) -> k -> EnumMap k a -> EnumMap k a

#

valuealterF

:: (Enum k, Functor f)
=> Maybe a -> f (Maybe a)
-> k
-> EnumMap k a
-> f (EnumMap k a)

#

Combine

0 declarations

Union

valueunion :: EnumMap k a -> EnumMap k a -> EnumMap k a

#

valueunionWith :: (a -> a -> a) -> EnumMap k a -> EnumMap k a -> EnumMap k a

#

valueunionWithKey

:: Enum k
=> k -> a -> a -> a
-> EnumMap k a
-> EnumMap k a
-> EnumMap k a

#

valueunions :: [EnumMap k a] -> EnumMap k a

#

valueunionsWith :: (a -> a -> a) -> [EnumMap k a] -> EnumMap k a

#

Difference

valuedifference :: EnumMap k a -> EnumMap k b -> EnumMap k a

#

valuedifferenceWith

:: a -> b -> Maybe a
-> EnumMap k a
-> EnumMap k b
-> EnumMap k a

#

valuedifferenceWithKey

:: Enum k
=> k -> a -> b -> Maybe a
-> EnumMap k a
-> EnumMap k b
-> EnumMap k a

#

Intersection

valueintersection :: EnumMap k a -> EnumMap k b -> EnumMap k a

#

valueintersectionWith

:: a -> b -> c
-> EnumMap k a
-> EnumMap k b
-> EnumMap k c

#

valueintersectionWithKey

:: Enum k
=> k -> a -> b -> c
-> EnumMap k a
-> EnumMap k b
-> EnumMap k c

#

Universal combining function

valuemergeWithKey

:: Enum k
=> k -> a -> b -> Maybe c
-> EnumMap k a -> EnumMap k c
-> EnumMap k b -> EnumMap k c
-> EnumMap k a
-> EnumMap k b
-> EnumMap k c

#

Traversal

0 declarations

Map

valuemap :: (a -> b) -> EnumMap k a -> EnumMap k b

#

valuemapWithKey :: Enum k => (k -> a -> b) -> EnumMap k a -> EnumMap k b

#

valuetraverseWithKey

:: (Applicative t, Enum k)
=> k -> a -> t b
-> EnumMap k a
-> t (EnumMap k b)

#

valuemapAccum :: (a -> b -> (a, c)) -> a -> EnumMap k b -> (a, EnumMap k c)

#

valuemapAccumWithKey

:: Enum k
=> a -> k -> b -> (a, c)
-> a
-> EnumMap k b
-> (a, EnumMap k c)

#

valuemapAccumRWithKey

:: Enum k
=> a -> k -> b -> (a, c)
-> a
-> EnumMap k b
-> (a, EnumMap k c)

#

valuemapKeys :: Enum k => (k -> k) -> EnumMap k a -> EnumMap k a

#

valuemapKeysWith

:: Enum k
=> a -> a -> a
-> k -> k
-> EnumMap k a
-> EnumMap k a

#

valuemapKeysMonotonic :: Enum k => (k -> k) -> EnumMap k a -> EnumMap k a

#

Folds

4 declarations

valuefoldr :: (a -> b -> b) -> b -> EnumMap k a -> b

#

valuefoldl :: (a -> b -> a) -> a -> EnumMap k b -> a

#

valuefoldrWithKey :: Enum k => (k -> a -> b -> b) -> b -> EnumMap k a -> b

#

valuefoldlWithKey :: Enum k => (a -> k -> b -> a) -> a -> EnumMap k b -> a

#

Strict folds

valuefoldr' :: (a -> b -> b) -> b -> EnumMap k a -> b

#

valuefoldl' :: (a -> b -> a) -> a -> EnumMap k b -> a

#

valuefoldrWithKey' :: Enum k => (k -> a -> b -> b) -> b -> EnumMap k a -> b

#

valuefoldlWithKey' :: Enum k => (a -> k -> b -> a) -> a -> EnumMap k b -> a

#

Conversion

5 declarations

valueelems :: EnumMap k a -> [a]

#

valuekeys :: Enum k => EnumMap k a -> [k]

#

valueassocs :: Enum k => EnumMap k a -> [(k, a)]

#

valuekeysSet :: Enum k => EnumMap k a -> EnumSet k

#

valuefromSet :: Enum k => (k -> a) -> EnumSet k -> EnumMap k a

#

Lists

valuetoList :: Enum k => EnumMap k a -> [(k, a)]

#

valuefromList :: Enum k => [(k, a)] -> EnumMap k a

#

valuefromListWith :: Enum k => (a -> a -> a) -> [(k, a)] -> EnumMap k a

#

valuefromListWithKey :: Enum k => (k -> a -> a -> a) -> [(k, a)] -> EnumMap k a

#

Ordered lists

valuetoAscList :: Enum k => EnumMap k a -> [(k, a)]

#

valuetoDescList :: Enum k => EnumMap k a -> [(k, a)]

#

valuefromAscList :: Enum k => [(k, a)] -> EnumMap k a

#

valuefromAscListWith :: Enum k => (a -> a -> a) -> [(k, a)] -> EnumMap k a

#

valuefromAscListWithKey

:: Enum k
=> k -> a -> a -> a
-> [(k, a)]
-> EnumMap k a

#

valuefromDistinctAscList :: Enum k => [(k, a)] -> EnumMap k a

#

Filter

12 declarations

valuefilter :: (a -> Bool) -> EnumMap k a -> EnumMap k a

#

valuefilterWithKey :: Enum k => (k -> a -> Bool) -> EnumMap k a -> EnumMap k a

#

valuerestrictKeys :: Enum k => EnumMap k a -> EnumSet k -> EnumMap k a

#

valuewithoutKeys :: Enum k => EnumMap k a -> EnumSet k -> EnumMap k a

#

valuepartition :: (a -> Bool) -> EnumMap k a -> (EnumMap k a, EnumMap k a)

#

valuepartitionWithKey

:: Enum k
=> k -> a -> Bool
-> EnumMap k a
-> (EnumMap k a, EnumMap k a)

#

valuemapMaybe :: (a -> Maybe b) -> EnumMap k a -> EnumMap k b

#

valuemapMaybeWithKey

:: Enum k
=> k -> a -> Maybe b
-> EnumMap k a
-> EnumMap k b

#

valuemapEither :: (a -> Either b c) -> EnumMap k a -> (EnumMap k b, EnumMap k c)

#

valuemapEitherWithKey

:: Enum k
=> k -> a -> Either b c
-> EnumMap k a
-> (EnumMap k b, EnumMap k c)

#

valuesplit :: Enum k => k -> EnumMap k a -> (EnumMap k a, EnumMap k a)

#

valuesplitLookup

:: Enum k
=> k
-> EnumMap k a
-> (EnumMap k a, Maybe a, EnumMap k a)

#

Submap

4 declarations

valueisSubmapOf :: Eq a => EnumMap k a -> EnumMap k a -> Bool

#

valueisSubmapOfBy :: (a -> b -> Bool) -> EnumMap k a -> EnumMap k b -> Bool

#

valueisProperSubmapOf :: Eq a => EnumMap k a -> EnumMap k a -> Bool

#

valueisProperSubmapOfBy :: (a -> b -> Bool) -> EnumMap k a -> EnumMap k b -> Bool

#

Min/Max

16 declarations

valuelookupMin :: Enum k => EnumMap k a -> Maybe (k, a)

#

valuelookupMax :: Enum k => EnumMap k a -> Maybe (k, a)

#

valuefindMin :: Enum k => EnumMap k a -> (k, a)

#

valuefindMax :: Enum k => EnumMap k a -> (k, a)

#

valuedeleteMin :: EnumMap k a -> EnumMap k a

#

valuedeleteMax :: EnumMap k a -> EnumMap k a

#

valuedeleteFindMin :: Enum k => EnumMap k a -> ((k, a), EnumMap k a)

#

valuedeleteFindMax :: Enum k => EnumMap k a -> ((k, a), EnumMap k a)

#

valueupdateMin :: (a -> Maybe a) -> EnumMap k a -> EnumMap k a

#

valueupdateMax :: (a -> Maybe a) -> EnumMap k a -> EnumMap k a

#

valueupdateMinWithKey

:: Enum k
=> k -> a -> Maybe a
-> EnumMap k a
-> EnumMap k a

#

valueupdateMaxWithKey

:: Enum k
=> k -> a -> Maybe a
-> EnumMap k a
-> EnumMap k a

#

valueminView :: EnumMap k a -> Maybe (a, EnumMap k a)

#

valuemaxView :: EnumMap k a -> Maybe (a, EnumMap k a)

#

valueminViewWithKey :: Enum k => EnumMap k a -> Maybe ((k, a), EnumMap k a)

#

valuemaxViewWithKey :: Enum k => EnumMap k a -> Maybe ((k, a), EnumMap k a)

#