Hoogle Search

Within LTS Haskell 24.42 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. allListT :: Monad m => ListT m a -> (a -> m Bool) -> m Bool

   Agda	Agda.Utils.ListT

   Lazy monadic conjunction of lazy monadic list, effects left-to-right

2. allJustM :: Monad m => [m (Maybe a)] -> m (Maybe [a])

   Agda	Agda.Utils.Maybe

   Lazy version of allJust . sequence. (allJust = mapM for the Maybe monad.) Only executes monadic effect while isJust.

3. allM :: (Foldable f, Monad m) => (a -> m Bool) -> f a -> m Bool

   Agda	Agda.Utils.Monad

   No documentation available.

4. allClasses :: CAbs -> [String]

   BNFC	BNFC.Backend.Common.OOAbstract

   No documentation available.

5. allNonClasses :: CAbs -> [String]

   BNFC	BNFC.Backend.Common.OOAbstract

   No documentation available.

6. allCats :: (InternalRule -> Bool) -> CFG f -> [Cat]

   BNFC	BNFC.CF

   Get all categories of a grammar matching the filter. (No Cat w/o production returned; no duplicates.)

7. allCatsIdNorm :: CF -> [RString]

   BNFC	BNFC.CF

   Gets all normalized identified Categories

8. allCatsNorm :: CF -> [Cat]

   BNFC	BNFC.CF

   Get all normalized Cat

9. allEntryPoints :: CFG f -> List1 Cat

   BNFC	BNFC.CF

   Categories that are entry points to the parser. These are either the declared entrypoints (in the original order), or, if no entrypoints were declared explicitly, all parsable categories (in the order of declaration in the grammar file).

10. allNames :: CF -> [RString]

    BNFC	BNFC.CF

    Constructors and categories.

Page 127 of many | Previous | Next