non-empty-0.2.1: List-like structures with static restrictions on the number of elements

Safe HaskellSafe-Inferred
LanguageHaskell98

Data.NonEmpty.Map

Documentation

data T k a Source

Instances

Ord k => Functor (T k) 
Ord k => Foldable (T k) 
Ord k => Traversable (T k) 
(Eq k, Eq a) => Eq (T k a) 
(Ord k, Ord a) => Ord (T k a) 
(Show k, Show a) => Show (T k a) 

insert :: Ord k => k -> a -> Map k a -> T k a Source

singleton :: k -> a -> T k a Source

member :: Ord k => k -> T k a -> Bool Source

size :: T k a -> Int Source

elems :: T k a -> T [] a Source

keys :: T k a -> T [] k Source

keysSet :: Ord k => T k a -> T k Source

lookup :: Ord k => k -> T k a -> Maybe a Source

minViewWithKey :: T k a -> ((k, a), Map k a) Source

maxViewWithKey :: Ord k => T k a -> ((k, a), Map k a) Source

fromList :: Ord k => T [] (k, a) -> T k a Source

toAscList :: T k a -> T [] (k, a) Source

fetch :: Ord k => Map k a -> Maybe (T k a) Source

flatten :: Ord k => T k a -> Map k a Source

union :: Ord k => T k a -> T k a -> T k a Source

unionLeft :: Ord k => Map k a -> T k a -> T k a Source

unionRight :: Ord k => T k a -> Map k a -> T k a Source