Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

Exact lookup

1. allReductions :: AllowedReductions

   Agda	Agda.TypeChecking.Monad.Base

   Not quite all reductions (skip non-terminating reductions)

2. allowAllReductions :: MonadTCEnv m => m a -> m a

   Agda	Agda.TypeChecking.Monad.Env

   Allow all reductions except for non-terminating functions (default).

3. allowNonTerminatingReductions :: MonadTCEnv m => m a -> m a

   Agda	Agda.TypeChecking.Monad.Env

   Allow all reductions including non-terminating functions.

4. allMetaClasses :: [MetaClass]

   Agda	Agda.TypeChecking.Monad.MetaVars

   All possible metavariable classes.

5. allFlexVars :: [IsForced] -> Telescope -> FlexibleVars

   Agda	Agda.TypeChecking.Rules.LHS.Problem

   No documentation available.

6. allLeft :: [Either a b] -> Maybe [a]

   Agda	Agda.Utils.Either

   Returns Just input_with_tags_stripped if all elements are to the Left, and otherwise Nothing.

7. allRight :: [Either a b] -> Maybe [b]

   Agda	Agda.Utils.Either

   Returns Just input_with_tags_stripped if all elements are to the right, and otherwise Nothing.

   allRight xs ==
   if all isRight xs then
   Just (map ((Right x) -> x) xs)
   else
   Nothing
   

8. allNodes :: Nodes n -> Set n

   Agda	Agda.Utils.Graph.AdjacencyMap.Unidirectional

   All nodes, with or without edges.

9. allConsecutive :: (a -> a -> Bool) -> [a] -> Bool

   Agda	Agda.Utils.List

   Check whether all consecutive elements of a list satisfy the given relation. O(n).

10. allDuplicates :: Ord a => [a] -> [a]

    Agda	Agda.Utils.List

    Remove the first representative for each list element. Thus, returns all duplicate copies. O(n log n). allDuplicates xs == sort $ xs \ nub xs.

Page 126 of many | Previous | Next