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.
allowNonTerminatingReductions :: MonadTCEnv m => m a -> m aAgda Agda.TypeChecking.Monad.Env Allow all reductions including non-terminating functions.
-
Agda Agda.TypeChecking.Monad.MetaVars All possible metavariable classes.
allFlexVars :: [IsForced] -> Telescope -> FlexibleVarsAgda Agda.TypeChecking.Rules.LHS.Problem No documentation available.
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.
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
-
Agda Agda.Utils.Graph.AdjacencyMap.Unidirectional All nodes, with or without edges.
allConsecutive :: (a -> a -> Bool) -> [a] -> BoolAgda Agda.Utils.List Check whether all consecutive elements of a list satisfy the given relation. O(n).
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.
allEqual :: Eq a => [a] -> BoolAgda Agda.Utils.List Checks if all the elements in the list are equal. Assumes that the Eq instance stands for an equivalence relation. O(n).
allEqual :: Eq a => List1 a -> BoolAgda Agda.Utils.List1 Checks if all the elements in the list are equal. Assumes that the Eq instance stands for an equivalence relation. O(n).