Data.Map.NonEmpty

Description

An efficient implementation of non-empty maps from keys to values (dictionaries).

Since many function names (but not the type name) clash with Prelude names, this module is usually imported qualified, e.g.

 import Data.Map.NonEmpty (NonEmptyMap)
 import qualified Data.Map.NonEmpty as NonEmptyMap

Documentation

data NonEmptyMap k a

A NonEmptyMap of keys k to values a

Constructors

NonEmptyMap (k, a) (Map k a)

Instances

Eq2 NonEmptyMap

Methods

liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> NonEmptyMap a c -> NonEmptyMap b d -> Bool

Ord2 NonEmptyMap

Methods

liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> NonEmptyMap a c -> NonEmptyMap b d -> Ordering

Show2 NonEmptyMap

Methods

liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> NonEmptyMap a b -> ShowS

liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [NonEmptyMap a b] -> ShowS

Functor (NonEmptyMap k)

Methods

fmap :: (a -> b) -> NonEmptyMap k a -> NonEmptyMap k b

(<$) :: a -> NonEmptyMap k b -> NonEmptyMap k a

Eq k => Eq1 (NonEmptyMap k)

Methods

liftEq :: (a -> b -> Bool) -> NonEmptyMap k a -> NonEmptyMap k b -> Bool

Ord k => Ord1 (NonEmptyMap k)

Methods

liftCompare :: (a -> b -> Ordering) -> NonEmptyMap k a -> NonEmptyMap k b -> Ordering

Show k => Show1 (NonEmptyMap k)

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> NonEmptyMap k a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [NonEmptyMap k a] -> ShowS

(Show k, Show a) => Show (NonEmptyMap k a)

Methods

showsPrec :: Int -> NonEmptyMap k a -> ShowS

show :: NonEmptyMap k a -> String

showList :: [NonEmptyMap k a] -> ShowS

Construction

singleton :: (k, a) -> NonEmptyMap k a

fromList :: Ord k => [(k, a)] -> Maybe (NonEmptyMap k a)

Insertion

insert :: Ord k => k -> a -> NonEmptyMap k a -> NonEmptyMap k a

insertWith :: Ord k => (a -> a -> a) -> k -> a -> NonEmptyMap k a -> NonEmptyMap k a

insertWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> NonEmptyMap k a -> NonEmptyMap k a

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

Deletion/Update

delete :: Ord k => k -> NonEmptyMap k a -> Map k a

adjust :: Ord k => (a -> a) -> k -> NonEmptyMap k a -> NonEmptyMap k a

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

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

alterF :: forall f k a. (Functor f, Ord k) => (Maybe a -> f (Maybe a)) -> k -> NonEmptyMap k a -> f (Map k a)

Query

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

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

findWithDefault :: Ord k => a -> k -> NonEmptyMap k a -> a

member :: Ord k => k -> NonEmptyMap k a -> Bool

notMember :: Ord k => k -> NonEmptyMap k a -> Bool

Size

size :: NonEmptyMap k a -> Int

Conversions

Lists

toList :: NonEmptyMap k a -> [(k, a)]