Safe Haskell	Safe-Inferred
Language	Haskell2010

GHC.Data.Bag

Documentation

data Bag a Source #

Instances

Instances details

Foldable Bag #
Instance details Defined in GHC.Data.Bag Methods fold :: Monoid m => Bag m -> m Source # foldMap :: Monoid m => (a -> m) -> Bag a -> m Source # foldMap' :: Monoid m => (a -> m) -> Bag a -> m Source # foldr :: (a -> b -> b) -> b -> Bag a -> b Source # foldr' :: (a -> b -> b) -> b -> Bag a -> b Source # foldl :: (b -> a -> b) -> b -> Bag a -> b Source # foldl' :: (b -> a -> b) -> b -> Bag a -> b Source # foldr1 :: (a -> a -> a) -> Bag a -> a Source # foldl1 :: (a -> a -> a) -> Bag a -> a Source # toList :: Bag a -> [a] Source # null :: Bag a -> Bool Source # length :: Bag a -> Int Source # elem :: Eq a => a -> Bag a -> Bool Source # maximum :: Ord a => Bag a -> a Source # minimum :: Ord a => Bag a -> a Source # sum :: Num a => Bag a -> a Source # product :: Num a => Bag a -> a Source #
Traversable Bag #
Instance details Defined in GHC.Data.Bag Methods traverse :: Applicative f => (a -> f b) -> Bag a -> f (Bag b) Source # sequenceA :: Applicative f => Bag (f a) -> f (Bag a) Source # mapM :: Monad m => (a -> m b) -> Bag a -> m (Bag b) Source # sequence :: Monad m => Bag (m a) -> m (Bag a) Source #
Functor Bag #
Instance details Defined in GHC.Data.Bag Methods fmap :: (a -> b) -> Bag a -> Bag b Source # (<$) :: a -> Bag b -> Bag a Source #
Data a => Data (Bag a) #
Instance details Defined in GHC.Data.Bag Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Bag a -> c (Bag a) Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Bag a) Source # toConstr :: Bag a -> Constr Source # dataTypeOf :: Bag a -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Bag a)) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Bag a)) Source # gmapT :: (forall b. Data b => b -> b) -> Bag a -> Bag a Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Bag a -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Bag a -> r Source # gmapQ :: (forall d. Data d => d -> u) -> Bag a -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> Bag a -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Bag a -> m (Bag a) Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Bag a -> m (Bag a) Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Bag a -> m (Bag a) Source #
IsList (Bag a) #
Instance details Defined in GHC.Data.Bag Associated Types type Item (Bag a) Source # Methods fromList :: [Item (Bag a)] -> Bag a Source # fromListN :: Int -> [Item (Bag a)] -> Bag a Source # toList :: Bag a -> [Item (Bag a)] Source #
Outputable a => Outputable (Bag a) #
Instance details Defined in GHC.Data.Bag Methods ppr :: Bag a -> SDoc Source #
type Item (Bag a) #
Instance details Defined in GHC.Data.Bag type Item (Bag a) = a