Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

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

  1. 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.

  2. 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
    

  3. allNodes :: Nodes n -> Set n

    Agda Agda.Utils.Graph.AdjacencyMap.Unidirectional

    All nodes, with or without edges.

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

    Agda Agda.Utils.List

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

  5. 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.

  6. allEqual :: Eq a => [a] -> Bool

    Agda 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).

  7. allEqual :: Eq a => List1 a -> Bool

    Agda 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).

  8. 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

  9. 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.

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

    Agda Agda.Utils.Monad

    No documentation available.

Page 126 of many | Previous | Next