Safe Haskell	None
Language	Haskell2010

Agda.Utils.Map1

Description

Non-empty maps.

Provides type Map1 of non-empty maps.

Import: @

import Agda.Utils.Map1 (Map1) import qualified Agda.Utils.Map1 as Map1

@

Synopsis

ifNull :: Map k a -> b -> (Map1 k a -> b) -> b
unlessNull :: Applicative m => Map k a -> (Map1 k a -> m ()) -> m ()
unlessNullM :: Monad m => m (Map k a) -> (Map1 k a -> m ()) -> m ()
type Map1 = NEMap
(!) :: Ord k => NEMap k a -> k -> a
(!?) :: Ord k => NEMap k a -> k -> Maybe a
pattern IsEmpty :: Map k a
pattern IsNonEmpty :: NEMap k a -> Map k a
(\\) :: Ord k => NEMap k a -> NEMap k b -> Map k a
absurdNEMap :: NEMap Void a -> b
adjust :: Ord k => (a -> a) -> k -> NEMap k a -> NEMap k a
adjustAt :: (k -> a -> a) -> Int -> NEMap k a -> NEMap k a
adjustMax :: (a -> a) -> NEMap k a -> NEMap k a
adjustMaxWithKey :: (k -> a -> a) -> NEMap k a -> NEMap k a
adjustMin :: (a -> a) -> NEMap k a -> NEMap k a
adjustMinWithKey :: (k -> a -> a) -> NEMap k a -> NEMap k a
adjustWithKey :: Ord k => (k -> a -> a) -> k -> NEMap k a -> NEMap k a
alter :: Ord k => (Maybe a -> Maybe a) -> k -> NEMap k a -> Map k a
alter' :: Ord k => (Maybe a -> a) -> k -> NEMap k a -> NEMap k a
alterF :: (Ord k, Functor f) => (Maybe a -> f (Maybe a)) -> k -> NEMap k a -> f (Map k a)
alterF' :: (Ord k, Functor f) => (Maybe a -> f a) -> k -> NEMap k a -> f (NEMap k a)
assocs :: NEMap k a -> NonEmpty (k, a)
delete :: Ord k => k -> NEMap k a -> Map k a
deleteAt :: Int -> NEMap k a -> Map k a
deleteFindMax :: NEMap k a -> ((k, a), Map k a)
deleteFindMin :: NEMap k a -> ((k, a), Map k a)
deleteMax :: NEMap k a -> Map k a
deleteMin :: NEMap k a -> Map k a
difference :: Ord k => NEMap k a -> NEMap k b -> Map k a
differenceWith :: Ord k => (a -> b -> Maybe a) -> NEMap k a -> NEMap k b -> Map k a
differenceWithKey :: Ord k => (k -> a -> b -> Maybe a) -> NEMap k a -> NEMap k b -> Map k a
drop :: Int -> NEMap k a -> Map k a
dropWhileAntitone :: (k -> Bool) -> NEMap k a -> Map k a
elemAt :: Int -> NEMap k a -> (k, a)
filter :: (a -> Bool) -> NEMap k a -> Map k a
filterWithKey :: (k -> a -> Bool) -> NEMap k a -> Map k a
findIndex :: Ord k => k -> NEMap k a -> Int
findMax :: NEMap k a -> (k, a)
findMin :: NEMap k a -> (k, a)
findWithDefault :: Ord k => a -> k -> NEMap k a -> a
foldl1' :: (a -> a -> a) -> NEMap k a -> a
foldlWithKey :: (a -> k -> b -> a) -> a -> NEMap k b -> a
foldlWithKey' :: (a -> k -> b -> a) -> a -> NEMap k b -> a
foldr1' :: (a -> a -> a) -> NEMap k a -> a
foldrWithKey :: (k -> a -> b -> b) -> b -> NEMap k a -> b
foldrWithKey' :: (k -> a -> b -> b) -> b -> NEMap k a -> b
fromAscList :: Eq k => NonEmpty (k, a) -> NEMap k a
fromAscListWith :: Eq k => (a -> a -> a) -> NonEmpty (k, a) -> NEMap k a
fromAscListWithKey :: Eq k => (k -> a -> a -> a) -> NonEmpty (k, a) -> NEMap k a
fromDescList :: Eq k => NonEmpty (k, a) -> NEMap k a
fromDescListWith :: Eq k => (a -> a -> a) -> NonEmpty (k, a) -> NEMap k a
fromDescListWithKey :: Eq k => (k -> a -> a -> a) -> NonEmpty (k, a) -> NEMap k a
fromDistinctAscList :: NonEmpty (k, a) -> NEMap k a
fromDistinctDescList :: NonEmpty (k, a) -> NEMap k a
fromListWith :: Ord k => (a -> a -> a) -> NonEmpty (k, a) -> NEMap k a
fromListWithKey :: Ord k => (k -> a -> a -> a) -> NonEmpty (k, a) -> NEMap k a
fromSet :: (k -> a) -> NESet k -> NEMap k a
insert :: Ord k => k -> a -> NEMap k a -> NEMap k a
insertLookupWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> NEMap k a -> (Maybe a, NEMap k a)
insertMap :: Ord k => k -> a -> Map k a -> NEMap k a
insertMapMax :: k -> a -> Map k a -> NEMap k a
insertMapMin :: k -> a -> Map k a -> NEMap k a
insertMapWith :: Ord k => (a -> a -> a) -> k -> a -> Map k a -> NEMap k a
insertMapWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> NEMap k a
insertWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> NEMap k a -> NEMap k a
intersection :: Ord k => NEMap k a -> NEMap k b -> Map k a
intersectionWith :: Ord k => (a -> b -> c) -> NEMap k a -> NEMap k b -> Map k c
intersectionWithKey :: Ord k => (k -> a -> b -> c) -> NEMap k a -> NEMap k b -> Map k c
isProperSubmapOf :: (Ord k, Eq a) => NEMap k a -> NEMap k a -> Bool
isProperSubmapOfBy :: Ord k => (a -> b -> Bool) -> NEMap k a -> NEMap k b -> Bool
isSubmapOf :: (Ord k, Eq a) => NEMap k a -> NEMap k a -> Bool
isSubmapOfBy :: Ord k => (a -> b -> Bool) -> NEMap k a -> NEMap k b -> Bool
keys :: NEMap k a -> NonEmpty k
keysSet :: NEMap k a -> NESet k
lookup :: Ord k => k -> NEMap k a -> Maybe a
lookupGE :: Ord k => k -> NEMap k a -> Maybe (k, a)
lookupGT :: Ord k => k -> NEMap k a -> Maybe (k, a)
lookupIndex :: Ord k => k -> NEMap k a -> Maybe Int
lookupLE :: Ord k => k -> NEMap k a -> Maybe (k, a)
lookupLT :: Ord k => k -> NEMap k a -> Maybe (k, a)
mapAccum :: (a -> b -> (a, c)) -> a -> NEMap k b -> (a, NEMap k c)
mapAccumRWithKey :: (a -> k -> b -> (a, c)) -> a -> NEMap k b -> (a, NEMap k c)
mapAccumWithKey :: (a -> k -> b -> (a, c)) -> a -> NEMap k b -> (a, NEMap k c)
mapEither :: (a -> Either b c) -> NEMap k a -> These (NEMap k b) (NEMap k c)
mapEitherWithKey :: (k -> a -> Either b c) -> NEMap k a -> These (NEMap k b) (NEMap k c)
mapKeys :: Ord k2 => (k1 -> k2) -> NEMap k1 a -> NEMap k2 a
mapKeysMonotonic :: (k1 -> k2) -> NEMap k1 a -> NEMap k2 a
mapKeysWith :: Ord k2 => (a -> a -> a) -> (k1 -> k2) -> NEMap k1 a -> NEMap k2 a
mapMaybe :: (a -> Maybe b) -> NEMap k a -> Map k b
mapMaybeWithKey :: (k -> a -> Maybe b) -> NEMap k a -> Map k b
mapWithKey :: (k -> a -> b) -> NEMap k a -> NEMap k b
maxView :: NEMap k a -> (a, Map k a)
member :: Ord k => k -> NEMap k a -> Bool
minView :: NEMap k a -> (a, Map k a)
notMember :: Ord k => k -> NEMap k a -> Bool
partition :: (a -> Bool) -> NEMap k a -> These (NEMap k a) (NEMap k a)
partitionWithKey :: (k -> a -> Bool) -> NEMap k a -> These (NEMap k a) (NEMap k a)
restrictKeys :: Ord k => NEMap k a -> Set k -> Map k a
spanAntitone :: (k -> Bool) -> NEMap k a -> These (NEMap k a) (NEMap k a)
split :: Ord k => k -> NEMap k a -> Maybe (These (NEMap k a) (NEMap k a))
splitAt :: Int -> NEMap k a -> These (NEMap k a) (NEMap k a)
splitLookup :: Ord k => k -> NEMap k a -> These a (These (NEMap k a) (NEMap k a))
splitRoot :: NEMap k a -> NonEmpty (NEMap k a)
take :: Int -> NEMap k a -> Map k a
takeWhileAntitone :: (k -> Bool) -> NEMap k a -> Map k a
toAscList :: NEMap k a -> NonEmpty (k, a)
toDescList :: NEMap k a -> NonEmpty (k, a)
traverseMaybeWithKey :: Applicative t => (k -> a -> t (Maybe b)) -> NEMap k a -> t (Map k b)
traverseMaybeWithKey1 :: Apply t => (k -> a -> t (Maybe b)) -> NEMap k a -> t (Map k b)
unionWith :: Ord k => (a -> a -> a) -> NEMap k a -> NEMap k a -> NEMap k a
unionWithKey :: Ord k => (k -> a -> a -> a) -> NEMap k a -> NEMap k a -> NEMap k a
unionsWith :: (Foldable1 f, Ord k) => (a -> a -> a) -> f (NEMap k a) -> NEMap k a
unsafeFromMap :: Map k a -> NEMap k a
update :: Ord k => (a -> Maybe a) -> k -> NEMap k a -> Map k a
updateAt :: (k -> a -> Maybe a) -> Int -> NEMap k a -> Map k a
updateLookupWithKey :: Ord k => (k -> a -> Maybe a) -> k -> NEMap k a -> (Maybe a, Map k a)
updateMax :: (a -> Maybe a) -> NEMap k a -> Map k a
updateMaxWithKey :: (k -> a -> Maybe a) -> NEMap k a -> Map k a
updateMin :: (a -> Maybe a) -> NEMap k a -> Map k a
updateMinWithKey :: (k -> a -> Maybe a) -> NEMap k a -> Map k a
updateWithKey :: Ord k => (k -> a -> Maybe a) -> k -> NEMap k a -> Map k a
withoutKeys :: Ord k => NEMap k a -> Set k -> Map k a
elems :: NEMap k a -> NonEmpty a
foldMapWithKey :: Semigroup m => (k -> a -> m) -> NEMap k a -> m
foldl :: (a -> b -> a) -> a -> NEMap k b -> a
foldl' :: (a -> b -> a) -> a -> NEMap k b -> a
foldl1 :: (a -> a -> a) -> NEMap k a -> a
foldr :: (a -> b -> b) -> b -> NEMap k a -> b
foldr' :: (a -> b -> b) -> b -> NEMap k a -> b
foldr1 :: (a -> a -> a) -> NEMap k a -> a
fromList :: Ord k => NonEmpty (k, a) -> NEMap k a
insertWith :: Ord k => (a -> a -> a) -> k -> a -> NEMap k a -> NEMap k a
map :: (a -> b) -> NEMap k a -> NEMap k b
nonEmptyMap :: Map k a -> Maybe (NEMap k a)
singleton :: k -> a -> NEMap k a
size :: NEMap k a -> Int
toList :: NEMap k a -> NonEmpty (k, a)
toMap :: NEMap k a -> Map k a
traverseWithKey :: Applicative t => (k -> a -> t b) -> NEMap k a -> t (NEMap k b)
traverseWithKey1 :: Apply t => (k -> a -> t b) -> NEMap k a -> t (NEMap k b)
union :: Ord k => NEMap k a -> NEMap k a -> NEMap k a
unions :: (Foldable1 f, Ord k) => f (NEMap k a) -> NEMap k a
valid :: Ord k => NEMap k a -> Bool
withNonEmpty :: r -> (NEMap k a -> r) -> Map k a -> r
data NEMap k a

Documentation

ifNull :: Map k a -> b -> (Map1 k a -> b) -> b Source #

unlessNull :: Applicative m => Map k a -> (Map1 k a -> m ()) -> m () Source #

A more general type would be Null m => Map k a -> (Map1 k a -> m) -> m but this type is problematic as we do not have a general instance Applicative m => Null (m ()).

unlessNullM :: Monad m => m (Map k a) -> (Map1 k a -> m ()) -> m () Source #

type Map1 = NEMap Source #

(!) :: Ord k => NEMap k a -> k -> a #

(!?) :: Ord k => NEMap k a -> k -> Maybe a #

pattern IsEmpty :: Map k a #

pattern IsNonEmpty :: NEMap k a -> Map k a #

(\\) :: Ord k => NEMap k a -> NEMap k b -> Map k a #

absurdNEMap :: NEMap Void a -> b #

adjust :: Ord k => (a -> a) -> k -> NEMap k a -> NEMap k a #

adjustAt :: (k -> a -> a) -> Int -> NEMap k a -> NEMap k a #

adjustMax :: (a -> a) -> NEMap k a -> NEMap k a #

adjustMaxWithKey :: (k -> a -> a) -> NEMap k a -> NEMap k a #

adjustMin :: (a -> a) -> NEMap k a -> NEMap k a #

adjustMinWithKey :: (k -> a -> a) -> NEMap k a -> NEMap k a #

adjustWithKey :: Ord k => (k -> a -> a) -> k -> NEMap k a -> NEMap k a #

alter :: Ord k => (Maybe a -> Maybe a) -> k -> NEMap k a -> Map k a #

alter' :: Ord k => (Maybe a -> a) -> k -> NEMap k a -> NEMap k a #

alterF :: (Ord k, Functor f) => (Maybe a -> f (Maybe a)) -> k -> NEMap k a -> f (Map k a) #

alterF' :: (Ord k, Functor f) => (Maybe a -> f a) -> k -> NEMap k a -> f (NEMap k a) #

assocs :: NEMap k a -> NonEmpty (k, a) #

delete :: Ord k => k -> NEMap k a -> Map k a #

deleteAt :: Int -> NEMap k a -> Map k a #

deleteFindMax :: NEMap k a -> ((k, a), Map k a) #

deleteFindMin :: NEMap k a -> ((k, a), Map k a) #

deleteMax :: NEMap k a -> Map k a #

deleteMin :: NEMap k a -> Map k a #

difference :: Ord k => NEMap k a -> NEMap k b -> Map k a #

differenceWith :: Ord k => (a -> b -> Maybe a) -> NEMap k a -> NEMap k b -> Map k a #

differenceWithKey :: Ord k => (k -> a -> b -> Maybe a) -> NEMap k a -> NEMap k b -> Map k a #

drop :: Int -> NEMap k a -> Map k a #

dropWhileAntitone :: (k -> Bool) -> NEMap k a -> Map k a #

elemAt :: Int -> NEMap k a -> (k, a) #

filter :: (a -> Bool) -> NEMap k a -> Map k a #

filterWithKey :: (k -> a -> Bool) -> NEMap k a -> Map k a #

findIndex :: Ord k => k -> NEMap k a -> Int #

findMax :: NEMap k a -> (k, a) #

findMin :: NEMap k a -> (k, a) #

findWithDefault :: Ord k => a -> k -> NEMap k a -> a #

foldl1' :: (a -> a -> a) -> NEMap k a -> a #

foldlWithKey :: (a -> k -> b -> a) -> a -> NEMap k b -> a #

foldlWithKey' :: (a -> k -> b -> a) -> a -> NEMap k b -> a #

foldr1' :: (a -> a -> a) -> NEMap k a -> a #

foldrWithKey :: (k -> a -> b -> b) -> b -> NEMap k a -> b #

foldrWithKey' :: (k -> a -> b -> b) -> b -> NEMap k a -> b #

fromAscList :: Eq k => NonEmpty (k, a) -> NEMap k a #

fromAscListWith :: Eq k => (a -> a -> a) -> NonEmpty (k, a) -> NEMap k a #

fromAscListWithKey :: Eq k => (k -> a -> a -> a) -> NonEmpty (k, a) -> NEMap k a #

fromDescList :: Eq k => NonEmpty (k, a) -> NEMap k a #

fromDescListWith :: Eq k => (a -> a -> a) -> NonEmpty (k, a) -> NEMap k a #

fromDescListWithKey :: Eq k => (k -> a -> a -> a) -> NonEmpty (k, a) -> NEMap k a #

fromDistinctAscList :: NonEmpty (k, a) -> NEMap k a #

fromDistinctDescList :: NonEmpty (k, a) -> NEMap k a #

fromListWith :: Ord k => (a -> a -> a) -> NonEmpty (k, a) -> NEMap k a #

fromListWithKey :: Ord k => (k -> a -> a -> a) -> NonEmpty (k, a) -> NEMap k a #

fromSet :: (k -> a) -> NESet k -> NEMap k a #

insert :: Ord k => k -> a -> NEMap k a -> NEMap k a #

insertLookupWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> NEMap k a -> (Maybe a, NEMap k a) #

insertMap :: Ord k => k -> a -> Map k a -> NEMap k a #

insertMapMax :: k -> a -> Map k a -> NEMap k a #

insertMapMin :: k -> a -> Map k a -> NEMap k a #

insertMapWith :: Ord k => (a -> a -> a) -> k -> a -> Map k a -> NEMap k a #

insertMapWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> NEMap k a #

insertWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> NEMap k a -> NEMap k a #

intersection :: Ord k => NEMap k a -> NEMap k b -> Map k a #

intersectionWith :: Ord k => (a -> b -> c) -> NEMap k a -> NEMap k b -> Map k c #

intersectionWithKey :: Ord k => (k -> a -> b -> c) -> NEMap k a -> NEMap k b -> Map k c #

isProperSubmapOf :: (Ord k, Eq a) => NEMap k a -> NEMap k a -> Bool #

isProperSubmapOfBy :: Ord k => (a -> b -> Bool) -> NEMap k a -> NEMap k b -> Bool #

isSubmapOf :: (Ord k, Eq a) => NEMap k a -> NEMap k a -> Bool #

isSubmapOfBy :: Ord k => (a -> b -> Bool) -> NEMap k a -> NEMap k b -> Bool #

keys :: NEMap k a -> NonEmpty k #

keysSet :: NEMap k a -> NESet k #

lookup :: Ord k => k -> NEMap k a -> Maybe a #

lookupGE :: Ord k => k -> NEMap k a -> Maybe (k, a) #

lookupGT :: Ord k => k -> NEMap k a -> Maybe (k, a) #

lookupIndex :: Ord k => k -> NEMap k a -> Maybe Int #

lookupLE :: Ord k => k -> NEMap k a -> Maybe (k, a) #

lookupLT :: Ord k => k -> NEMap k a -> Maybe (k, a) #

mapAccum :: (a -> b -> (a, c)) -> a -> NEMap k b -> (a, NEMap k c) #

mapAccumRWithKey :: (a -> k -> b -> (a, c)) -> a -> NEMap k b -> (a, NEMap k c) #

mapAccumWithKey :: (a -> k -> b -> (a, c)) -> a -> NEMap k b -> (a, NEMap k c) #

mapEither :: (a -> Either b c) -> NEMap k a -> These (NEMap k b) (NEMap k c) #

mapEitherWithKey :: (k -> a -> Either b c) -> NEMap k a -> These (NEMap k b) (NEMap k c) #

mapKeys :: Ord k2 => (k1 -> k2) -> NEMap k1 a -> NEMap k2 a #

mapKeysMonotonic :: (k1 -> k2) -> NEMap k1 a -> NEMap k2 a #

mapKeysWith :: Ord k2 => (a -> a -> a) -> (k1 -> k2) -> NEMap k1 a -> NEMap k2 a #

mapMaybe :: (a -> Maybe b) -> NEMap k a -> Map k b #

mapMaybeWithKey :: (k -> a -> Maybe b) -> NEMap k a -> Map k b #

mapWithKey :: (k -> a -> b) -> NEMap k a -> NEMap k b #

maxView :: NEMap k a -> (a, Map k a) #

member :: Ord k => k -> NEMap k a -> Bool #

minView :: NEMap k a -> (a, Map k a) #

notMember :: Ord k => k -> NEMap k a -> Bool #

partition :: (a -> Bool) -> NEMap k a -> These (NEMap k a) (NEMap k a) #

partitionWithKey :: (k -> a -> Bool) -> NEMap k a -> These (NEMap k a) (NEMap k a) #

restrictKeys :: Ord k => NEMap k a -> Set k -> Map k a #

spanAntitone :: (k -> Bool) -> NEMap k a -> These (NEMap k a) (NEMap k a) #

split :: Ord k => k -> NEMap k a -> Maybe (These (NEMap k a) (NEMap k a)) #

splitAt :: Int -> NEMap k a -> These (NEMap k a) (NEMap k a) #

splitLookup :: Ord k => k -> NEMap k a -> These a (These (NEMap k a) (NEMap k a)) #

splitRoot :: NEMap k a -> NonEmpty (NEMap k a) #

take :: Int -> NEMap k a -> Map k a #

takeWhileAntitone :: (k -> Bool) -> NEMap k a -> Map k a #

toAscList :: NEMap k a -> NonEmpty (k, a) #

toDescList :: NEMap k a -> NonEmpty (k, a) #

traverseMaybeWithKey :: Applicative t => (k -> a -> t (Maybe b)) -> NEMap k a -> t (Map k b) #

traverseMaybeWithKey1 :: Apply t => (k -> a -> t (Maybe b)) -> NEMap k a -> t (Map k b) #

unionWith :: Ord k => (a -> a -> a) -> NEMap k a -> NEMap k a -> NEMap k a #

unionWithKey :: Ord k => (k -> a -> a -> a) -> NEMap k a -> NEMap k a -> NEMap k a #

unionsWith :: (Foldable1 f, Ord k) => (a -> a -> a) -> f (NEMap k a) -> NEMap k a #

unsafeFromMap :: Map k a -> NEMap k a #

update :: Ord k => (a -> Maybe a) -> k -> NEMap k a -> Map k a #

updateAt :: (k -> a -> Maybe a) -> Int -> NEMap k a -> Map k a #

updateLookupWithKey :: Ord k => (k -> a -> Maybe a) -> k -> NEMap k a -> (Maybe a, Map k a) #

updateMax :: (a -> Maybe a) -> NEMap k a -> Map k a #

updateMaxWithKey :: (k -> a -> Maybe a) -> NEMap k a -> Map k a #

updateMin :: (a -> Maybe a) -> NEMap k a -> Map k a #

updateMinWithKey :: (k -> a -> Maybe a) -> NEMap k a -> Map k a #

updateWithKey :: Ord k => (k -> a -> Maybe a) -> k -> NEMap k a -> Map k a #

withoutKeys :: Ord k => NEMap k a -> Set k -> Map k a #

elems :: NEMap k a -> NonEmpty a #

foldMapWithKey :: Semigroup m => (k -> a -> m) -> NEMap k a -> m #

foldl :: (a -> b -> a) -> a -> NEMap k b -> a #

foldl' :: (a -> b -> a) -> a -> NEMap k b -> a #

foldl1 :: (a -> a -> a) -> NEMap k a -> a #

foldr :: (a -> b -> b) -> b -> NEMap k a -> b #

foldr' :: (a -> b -> b) -> b -> NEMap k a -> b #

foldr1 :: (a -> a -> a) -> NEMap k a -> a #

fromList :: Ord k => NonEmpty (k, a) -> NEMap k a #

insertWith :: Ord k => (a -> a -> a) -> k -> a -> NEMap k a -> NEMap k a #

map :: (a -> b) -> NEMap k a -> NEMap k b #

nonEmptyMap :: Map k a -> Maybe (NEMap k a) #

singleton :: k -> a -> NEMap k a #

size :: NEMap k a -> Int #

toList :: NEMap k a -> NonEmpty (k, a) #

toMap :: NEMap k a -> Map k a #

traverseWithKey :: Applicative t => (k -> a -> t b) -> NEMap k a -> t (NEMap k b) #

traverseWithKey1 :: Apply t => (k -> a -> t b) -> NEMap k a -> t (NEMap k b) #

union :: Ord k => NEMap k a -> NEMap k a -> NEMap k a #

unions :: (Foldable1 f, Ord k) => f (NEMap k a) -> NEMap k a #

valid :: Ord k => NEMap k a -> Bool #

withNonEmpty :: r -> (NEMap k a -> r) -> Map k a -> r #

data NEMap k a #

Instances

Instances details

Eq2 NEMap #
Instance details Defined in Data.Map.NonEmpty.Internal Methods liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> NEMap a c -> NEMap b d -> Bool #
Ord2 NEMap #
Instance details Defined in Data.Map.NonEmpty.Internal Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> NEMap a c -> NEMap b d -> Ordering #
Show2 NEMap #
Instance details Defined in Data.Map.NonEmpty.Internal Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> NEMap a b -> ShowS # liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [NEMap a b] -> ShowS #
Foldable1 (NEMap k) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods fold1 :: Semigroup m => NEMap k m -> m # foldMap1 :: Semigroup m => (a -> m) -> NEMap k a -> m # foldMap1' :: Semigroup m => (a -> m) -> NEMap k a -> m # toNonEmpty :: NEMap k a -> NonEmpty a # maximum :: Ord a => NEMap k a -> a # minimum :: Ord a => NEMap k a -> a # head :: NEMap k a -> a # last :: NEMap k a -> a # foldrMap1 :: (a -> b) -> (a -> b -> b) -> NEMap k a -> b # foldlMap1' :: (a -> b) -> (b -> a -> b) -> NEMap k a -> b # foldlMap1 :: (a -> b) -> (b -> a -> b) -> NEMap k a -> b # foldrMap1' :: (a -> b) -> (a -> b -> b) -> NEMap k a -> b #
Eq k => Eq1 (NEMap k) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods liftEq :: (a -> b -> Bool) -> NEMap k a -> NEMap k b -> Bool #
Ord k => Ord1 (NEMap k) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods liftCompare :: (a -> b -> Ordering) -> NEMap k a -> NEMap k b -> Ordering #
(Ord k, Read k) => Read1 (NEMap k) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (NEMap k a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [NEMap k a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (NEMap k a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [NEMap k a] #
Show k => Show1 (NEMap k) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> NEMap k a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [NEMap k a] -> ShowS #
Comonad (NEMap k) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods extract :: NEMap k a -> a duplicate :: NEMap k a -> NEMap k (NEMap k a) extend :: (NEMap k a -> b) -> NEMap k a -> NEMap k b
Functor (NEMap k) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods fmap :: (a -> b) -> NEMap k a -> NEMap k b # (<$) :: a -> NEMap k b -> NEMap k a #
Foldable (NEMap k) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods fold :: Monoid m => NEMap k m -> m # foldMap :: Monoid m => (a -> m) -> NEMap k a -> m # foldMap' :: Monoid m => (a -> m) -> NEMap k a -> m # foldr :: (a -> b -> b) -> b -> NEMap k a -> b # foldr' :: (a -> b -> b) -> b -> NEMap k a -> b # foldl :: (b -> a -> b) -> b -> NEMap k a -> b # foldl' :: (b -> a -> b) -> b -> NEMap k a -> b # foldr1 :: (a -> a -> a) -> NEMap k a -> a # foldl1 :: (a -> a -> a) -> NEMap k a -> a # toList :: NEMap k a -> [a] # null :: NEMap k a -> Bool # length :: NEMap k a -> Int # elem :: Eq a => a -> NEMap k a -> Bool # maximum :: Ord a => NEMap k a -> a # minimum :: Ord a => NEMap k a -> a # sum :: Num a => NEMap k a -> a # product :: Num a => NEMap k a -> a #
Traversable (NEMap k) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods traverse :: Applicative f => (a -> f b) -> NEMap k a -> f (NEMap k b) # sequenceA :: Applicative f => NEMap k (f a) -> f (NEMap k a) # mapM :: Monad m => (a -> m b) -> NEMap k a -> m (NEMap k b) # sequence :: Monad m => NEMap k (m a) -> m (NEMap k a) #
Invariant (NEMap k) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods invmap :: (a -> b) -> (b -> a) -> NEMap k a -> NEMap k b
Ord k => Alt (NEMap k) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods (<!>) :: NEMap k a -> NEMap k a -> NEMap k a some :: Applicative (NEMap k) => NEMap k a -> NEMap k [a] many :: Applicative (NEMap k) => NEMap k a -> NEMap k [a]
Traversable1 (NEMap k) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods traverse1 :: Apply f => (a -> f b) -> NEMap k a -> f (NEMap k b) sequence1 :: Apply f => NEMap k (f b) -> f (NEMap k b)
(NFData k, NFData a) => NFData (NEMap k a) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods rnf :: NEMap k a -> () #
Ord k => Semigroup (NEMap k a) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods (<>) :: NEMap k a -> NEMap k a -> NEMap k a # sconcat :: NonEmpty (NEMap k a) -> NEMap k a # stimes :: Integral b => b -> NEMap k a -> NEMap k a #
(Data k, Data a, Ord k) => Data (NEMap k a) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NEMap k a -> c (NEMap k a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (NEMap k a) # toConstr :: NEMap k a -> Constr # dataTypeOf :: NEMap k a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (NEMap k a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (NEMap k a)) # gmapT :: (forall b. Data b => b -> b) -> NEMap k a -> NEMap k a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NEMap k a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NEMap k a -> r # gmapQ :: (forall d. Data d => d -> u) -> NEMap k a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> NEMap k a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> NEMap k a -> m (NEMap k a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NEMap k a -> m (NEMap k a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NEMap k a -> m (NEMap k a) #
(Ord k, Read k, Read e) => Read (NEMap k e) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods readsPrec :: Int -> ReadS (NEMap k e) # readList :: ReadS [NEMap k e] # readPrec :: ReadPrec (NEMap k e) # readListPrec :: ReadPrec [NEMap k e] #
(Show k, Show a) => Show (NEMap k a) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods showsPrec :: Int -> NEMap k a -> ShowS # show :: NEMap k a -> String # showList :: [NEMap k a] -> ShowS #
(Eq k, Eq a) => Eq (NEMap k a) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods (==) :: NEMap k a -> NEMap k a -> Bool # (/=) :: NEMap k a -> NEMap k a -> Bool #
(Ord k, Ord a) => Ord (NEMap k a) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods compare :: NEMap k a -> NEMap k a -> Ordering # (<) :: NEMap k a -> NEMap k a -> Bool # (<=) :: NEMap k a -> NEMap k a -> Bool # (>) :: NEMap k a -> NEMap k a -> Bool # (>=) :: NEMap k a -> NEMap k a -> Bool # max :: NEMap k a -> NEMap k a -> NEMap k a # min :: NEMap k a -> NEMap k a -> NEMap k a #
(FromJSONKey k, Ord k, FromJSON a) => FromJSON (NEMap k a) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods parseJSON :: Value -> Parser (NEMap k a) # parseJSONList :: Value -> Parser [NEMap k a] # omittedField :: Maybe (NEMap k a) #
(ToJSONKey k, ToJSON a) => ToJSON (NEMap k a) #
Instance details Defined in Data.Map.NonEmpty.Internal Methods toJSON :: NEMap k a -> Value # toEncoding :: NEMap k a -> Encoding # toJSONList :: [NEMap k a] -> Value # toEncodingList :: [NEMap k a] -> Encoding # omitField :: NEMap k a -> Bool #