ptera-core-0.1.0.0: A parser generator
Safe HaskellNone
LanguageHaskell2010

Language.Parser.Ptera.Data.Alignable.Map

Documentation

type T = Map Source #

data Map n a Source #

Instances

Instances details
Functor (Map n) Source # 
Instance details

Defined in Language.Parser.Ptera.Data.Alignable.Map

Methods

fmap :: (a -> b) -> Map n a -> Map n b #

(<$) :: a -> Map n b -> Map n a #

Foldable (Map n) Source # 
Instance details

Defined in Language.Parser.Ptera.Data.Alignable.Map

Methods

fold :: Monoid m => Map n m -> m #

foldMap :: Monoid m => (a -> m) -> Map n a -> m #

foldMap' :: Monoid m => (a -> m) -> Map n a -> m #

foldr :: (a -> b -> b) -> b -> Map n a -> b #

foldr' :: (a -> b -> b) -> b -> Map n a -> b #

foldl :: (b -> a -> b) -> b -> Map n a -> b #

foldl' :: (b -> a -> b) -> b -> Map n a -> b #

foldr1 :: (a -> a -> a) -> Map n a -> a #

foldl1 :: (a -> a -> a) -> Map n a -> a #

toList :: Map n a -> [a] #

null :: Map n a -> Bool #

length :: Map n a -> Int #

elem :: Eq a => a -> Map n a -> Bool #

maximum :: Ord a => Map n a -> a #

minimum :: Ord a => Map n a -> a #

sum :: Num a => Map n a -> a #

product :: Num a => Map n a -> a #

Traversable (Map n) Source # 
Instance details

Defined in Language.Parser.Ptera.Data.Alignable.Map

Methods

traverse :: Applicative f => (a -> f b) -> Map n a -> f (Map n b) #

sequenceA :: Applicative f => Map n (f a) -> f (Map n a) #

mapM :: Monad m => (a -> m b) -> Map n a -> m (Map n b) #

sequence :: Monad m => Map n (m a) -> m (Map n a) #

Eq a => Eq (Map n a) Source # 
Instance details

Defined in Language.Parser.Ptera.Data.Alignable.Map

Methods

(==) :: Map n a -> Map n a -> Bool #

(/=) :: Map n a -> Map n a -> Bool #

Show a => Show (Map n a) Source # 
Instance details

Defined in Language.Parser.Ptera.Data.Alignable.Map

Methods

showsPrec :: Int -> Map n a -> ShowS #

show :: Map n a -> String #

showList :: [Map n a] -> ShowS #

empty :: Map n a Source #

singleton :: forall n a. T n => n -> a -> Map n a Source #

insert :: forall n a. T n => n -> a -> Map n a -> Map n a Source #

lookup :: forall n a. T n => n -> Map n a -> Maybe a Source #

assocs :: forall n a. T n => Map n a -> [(n, a)] Source #

toAscList :: forall n a. T n => Map n a -> [(n, a)] Source #

restrictGreaterOrEqual :: forall n a. T n => n -> Map n a -> Map n a Source #