Safe Haskell	Safe
Language	Haskell2010

Data.Map.NonEmpty

Synopsis

data NonEmptyMap k v
singleton :: k -> v -> NonEmptyMap k v
lookup :: Ord k => k -> NonEmptyMap k a -> Maybe a
foldl1' :: (v -> v -> v) -> NonEmptyMap k v -> v
foldr1' :: (v -> v -> v) -> NonEmptyMap k v -> v
mapWithKey :: (k -> v -> w) -> NonEmptyMap k v -> NonEmptyMap k w
toNonEmpty :: NonEmptyMap k v -> NonEmpty (k, v)
toMap :: Ord k => NonEmptyMap k v -> Map k v

Documentation

data NonEmptyMap k v Source #

A non-empty map.

Instances

Functor (NonEmptyMap k) Source #
Instance details Defined in Data.Map.NonEmpty Methods fmap :: (a -> b) -> NonEmptyMap k a -> NonEmptyMap k b # (<$) :: a -> NonEmptyMap k b -> NonEmptyMap k a #
Foldable (NonEmptyMap k) Source #
Instance details Defined in Data.Map.NonEmpty Methods fold :: Monoid m => NonEmptyMap k m -> m # foldMap :: Monoid m => (a -> m) -> NonEmptyMap k a -> m # foldr :: (a -> b -> b) -> b -> NonEmptyMap k a -> b # foldr' :: (a -> b -> b) -> b -> NonEmptyMap k a -> b # foldl :: (b -> a -> b) -> b -> NonEmptyMap k a -> b # foldl' :: (b -> a -> b) -> b -> NonEmptyMap k a -> b # foldr1 :: (a -> a -> a) -> NonEmptyMap k a -> a # foldl1 :: (a -> a -> a) -> NonEmptyMap k a -> a # toList :: NonEmptyMap k a -> [a] # null :: NonEmptyMap k a -> Bool # length :: NonEmptyMap k a -> Int # elem :: Eq a => a -> NonEmptyMap k a -> Bool # maximum :: Ord a => NonEmptyMap k a -> a # minimum :: Ord a => NonEmptyMap k a -> a # sum :: Num a => NonEmptyMap k a -> a # product :: Num a => NonEmptyMap k a -> a #
Foldable1 (NonEmptyMap k) Source #
Instance details Defined in Data.Map.NonEmpty Methods fold1 :: Semigroup m => NonEmptyMap k m -> m # foldMap1 :: Semigroup m => (a -> m) -> NonEmptyMap k a -> m # toNonEmpty :: NonEmptyMap k a -> NonEmpty a #
(Eq k, Eq v) => Eq (NonEmptyMap k v) Source #
Instance details Defined in Data.Map.NonEmpty Methods (==) :: NonEmptyMap k v -> NonEmptyMap k v -> Bool # (/=) :: NonEmptyMap k v -> NonEmptyMap k v -> Bool #
(Ord k, Ord v) => Ord (NonEmptyMap k v) Source #
Instance details Defined in Data.Map.NonEmpty Methods compare :: NonEmptyMap k v -> NonEmptyMap k v -> Ordering # (<) :: NonEmptyMap k v -> NonEmptyMap k v -> Bool # (<=) :: NonEmptyMap k v -> NonEmptyMap k v -> Bool # (>) :: NonEmptyMap k v -> NonEmptyMap k v -> Bool # (>=) :: NonEmptyMap k v -> NonEmptyMap k v -> Bool # max :: NonEmptyMap k v -> NonEmptyMap k v -> NonEmptyMap k v # min :: NonEmptyMap k v -> NonEmptyMap k v -> NonEmptyMap k v #
(Ord k, Semigroup v) => Semigroup (NonEmptyMap k v) Source #
Instance details Defined in Data.Map.NonEmpty Methods (<>) :: NonEmptyMap k v -> NonEmptyMap k v -> NonEmptyMap k v # sconcat :: NonEmpty (NonEmptyMap k v) -> NonEmptyMap k v # stimes :: Integral b => b -> NonEmptyMap k v -> NonEmptyMap k v #

singleton :: k -> v -> NonEmptyMap k v Source #

A map with a single element.

lookup :: Ord k => k -> NonEmptyMap k a -> Maybe a Source #

Lookup the value at a key in the map.

foldl1' :: (v -> v -> v) -> NonEmptyMap k v -> v Source #

foldr1' :: (v -> v -> v) -> NonEmptyMap k v -> v Source #

mapWithKey :: (k -> v -> w) -> NonEmptyMap k v -> NonEmptyMap k w Source #

toNonEmpty :: NonEmptyMap k v -> NonEmpty (k, v) Source #

toMap :: Ord k => NonEmptyMap k v -> Map k v Source #