ghc-8.0.2: The GHC API

Safe HaskellNone
LanguageHaskell2010

Bag

Documentation

data Bag a #

Instances

Foldable Bag # 

Methods

fold :: Monoid m => Bag m -> 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 #

Data a => Data (Bag a) # 

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

Outputable a => Outputable (Bag a) # 

Methods

ppr :: Bag a -> SDoc #

pprPrec :: Rational -> Bag a -> SDoc #

emptyBag :: Bag a #

unitBag :: a -> Bag a #

unionBags :: Bag a -> Bag a -> Bag a #

unionManyBags :: [Bag a] -> Bag a #

mapBag :: (a -> b) -> Bag a -> Bag b #

elemBag :: Eq a => a -> Bag a -> Bool #

lengthBag :: Bag a -> Int #

filterBag :: (a -> Bool) -> Bag a -> Bag a #

partitionBag :: (a -> Bool) -> Bag a -> (Bag a, Bag a) #

partitionBagWith :: (a -> Either b c) -> Bag a -> (Bag b, Bag c) #

concatBag :: Bag (Bag a) -> Bag a #

catBagMaybes :: Bag (Maybe a) -> Bag a #

foldBag :: (r -> r -> r) -> (a -> r) -> r -> Bag a -> r #

foldrBag :: (a -> r -> r) -> r -> Bag a -> r #

foldlBag :: (r -> a -> r) -> r -> Bag a -> r #

isEmptyBag :: Bag a -> Bool #

isSingletonBag :: Bag a -> Bool #

consBag :: a -> Bag a -> Bag a infixr 3 #

snocBag :: Bag a -> a -> Bag a infixl 3 #

anyBag :: (a -> Bool) -> Bag a -> Bool #

listToBag :: [a] -> Bag a #

bagToList :: Bag a -> [a] #

mapAccumBagL #

Arguments

:: (acc -> x -> (acc, y))

combining funcction

-> acc

initial state

-> Bag x

inputs

-> (acc, Bag y)

final state, outputs

foldrBagM :: Monad m => (a -> b -> m b) -> b -> Bag a -> m b #

foldlBagM :: Monad m => (b -> a -> m b) -> b -> Bag a -> m b #

mapBagM :: Monad m => (a -> m b) -> Bag a -> m (Bag b) #

mapBagM_ :: Monad m => (a -> m b) -> Bag a -> m () #

flatMapBagM :: Monad m => (a -> m (Bag b)) -> Bag a -> m (Bag b) #

flatMapBagPairM :: Monad m => (a -> m (Bag b, Bag c)) -> Bag a -> m (Bag b, Bag c) #

mapAndUnzipBagM :: Monad m => (a -> m (b, c)) -> Bag a -> m (Bag b, Bag c) #

mapAccumBagLM #

Arguments

:: Monad m 
=> (acc -> x -> m (acc, y))

combining funcction

-> acc

initial state

-> Bag x

inputs

-> m (acc, Bag y)

final state, outputs

anyBagM :: Monad m => (a -> m Bool) -> Bag a -> m Bool #

filterBagM :: Monad m => (a -> m Bool) -> Bag a -> m (Bag a) #