Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. catMaybesReversed :: List (Maybe a) -> List a

    strict-list StrictList

    Keep only the present values, reversing the order.

  2. explodeReversed :: (a -> List b) -> List a -> List b

    strict-list StrictList

    Use a function to produce a list of lists and then concat them sequentially, producing the results in reversed order.

  3. filterReversed :: (a -> Bool) -> List a -> List a

    strict-list StrictList

    Leave only the elements satisfying the predicate, producing a list in reversed order.

  4. fromListReversed :: [a] -> List a

    strict-list StrictList

    Construct from a lazy list in reversed order.

  5. initReversed :: List a -> List a

    strict-list StrictList

    Get all elements but the last one, producing the results in reverse order.

  6. joinReversed :: List (List a) -> List a

    strict-list StrictList

    Join (concat) producing results in reversed order.

  7. mapMaybeReversed :: (a -> Maybe b) -> List a -> List b

    strict-list StrictList

    Map and filter elements producing results in reversed order.

  8. mapReversed :: (a -> b) -> List a -> List b

    strict-list StrictList

    Map producing a list in reversed order.

  9. prependReversed :: List a -> List a -> List a

    strict-list StrictList

    Add elements of the left list in reverse order in the beginning of the right list.

  10. spanReversed :: (a -> Bool) -> List a -> (List a, List a)

    strict-list StrictList

    Same as span, only with the first list in reverse order.

Page 65 of many | Previous | Next