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

Safe HaskellSafe
LanguageHaskell98

Data.NonEmpty.Map

Documentation

data T k a Source #

Instances

Ord k => Functor (T k) Source # 

Methods

fmap :: (a -> b) -> T k a -> T k b #

(<$) :: a -> T k b -> T k a #

Ord k => Foldable (T k) Source # 

Methods

fold :: Monoid m => T k m -> m #

foldMap :: Monoid m => (a -> m) -> T k a -> m #

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

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

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

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

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

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

toList :: T k a -> [a] #

null :: T k a -> Bool #

length :: T k a -> Int #

elem :: Eq a => a -> T k a -> Bool #

maximum :: Ord a => T k a -> a #

minimum :: Ord a => T k a -> a #

sum :: Num a => T k a -> a #

product :: Num a => T k a -> a #

Ord k => Traversable (T k) Source # 

Methods

traverse :: Applicative f => (a -> f b) -> T k a -> f (T k b) #

sequenceA :: Applicative f => T k (f a) -> f (T k a) #

mapM :: Monad m => (a -> m b) -> T k a -> m (T k b) #

sequence :: Monad m => T k (m a) -> m (T k a) #

NFData k => NFData (T k) Source # 

Methods

rnf :: NFData a => T k a -> () Source #

(Eq k, Eq a) => Eq (T k a) Source # 

Methods

(==) :: T k a -> T k a -> Bool #

(/=) :: T k a -> T k a -> Bool #

(Ord k, Ord a) => Ord (T k a) Source # 

Methods

compare :: T k a -> T k a -> Ordering #

(<) :: T k a -> T k a -> Bool #

(<=) :: T k a -> T k a -> Bool #

(>) :: T k a -> T k a -> Bool #

(>=) :: T k a -> T k a -> Bool #

max :: T k a -> T k a -> T k a #

min :: T k a -> T k a -> T k a #

(Show k, Show a) => Show (T k a) Source # 

Methods

showsPrec :: Int -> T k a -> ShowS #

show :: T k a -> String #

showList :: [T k a] -> ShowS #

(NFData k, NFData a) => NFData (T k a) Source # 

Methods

rnf :: 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 #

map :: Ord k => (a -> b) -> T k a -> T k b Source #

mapWithKey :: Ord k => (k -> a -> b) -> T k a -> T k b Source #