Safe Haskell	Safe-Inferred
Language	Haskell2010

Language.Parser.Ptera.Data.Alignable.Map

Documentation

type T = Map Source #

data Map n a Source #

Instances

Instances details

Foldable (Map n) Source #
Instance details Defined in Language.Parser.Ptera.Data.Alignable.Map Methods fold :: Monoid m => Map n m -> m Source # foldMap :: Monoid m => (a -> m) -> Map n a -> m Source # foldMap' :: Monoid m => (a -> m) -> Map n a -> m Source # foldr :: (a -> b -> b) -> b -> Map n a -> b Source # foldr' :: (a -> b -> b) -> b -> Map n a -> b Source # foldl :: (b -> a -> b) -> b -> Map n a -> b Source # foldl' :: (b -> a -> b) -> b -> Map n a -> b Source # foldr1 :: (a -> a -> a) -> Map n a -> a Source # foldl1 :: (a -> a -> a) -> Map n a -> a Source # toList :: Map n a -> [a] Source # null :: Map n a -> Bool Source # length :: Map n a -> Int Source # elem :: Eq a => a -> Map n a -> Bool Source # maximum :: Ord a => Map n a -> a Source # minimum :: Ord a => Map n a -> a Source # sum :: Num a => Map n a -> a Source # product :: Num a => Map n a -> a Source #
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) Source # sequenceA :: Applicative f => Map n (f a) -> f (Map n a) Source # mapM :: Monad m => (a -> m b) -> Map n a -> m (Map n b) Source # sequence :: Monad m => Map n (m a) -> m (Map n a) Source #
Functor (Map n) Source #
Instance details Defined in Language.Parser.Ptera.Data.Alignable.Map Methods fmap :: (a -> b) -> Map n a -> Map n b Source # (<$) :: a -> Map n b -> Map n a Source #
Show a => Show (Map n a) Source #
Instance details Defined in Language.Parser.Ptera.Data.Alignable.Map Methods showsPrec :: Int -> Map n a -> ShowS Source # show :: Map n a -> String Source # showList :: [Map n a] -> ShowS Source #
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 Source # (/=) :: Map n a -> Map n a -> Bool Source #

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 #