Hoogle Search

Within LTS Haskell 24.8 (ghc-9.10.2)

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

Exact lookup

1. module Data.Functor.Reverse

   No documentation available.

2. type family Reverse (xs :: [k]) (acc :: [k]) :: [k]

   optics-core	Optics.Internal.Optic.TypeLevel

   Reverse a type-level list.

3. class Reverse (f :: Type -> Type)

   non-empty	Data.NonEmpty.Class

   No documentation available.

4. data Reverse (b :: [a]) (c :: [a])

   first-class-families	Fcf.Data.List

   Reverse a list.

   Example

   >>> :kind! Eval (Reverse [1,2,3,4,5])
   Eval (Reverse [1,2,3,4,5]) :: [Natural]
   = [5, 4, 3, 2, 1]
   

5. type family Reverse (a1 :: NonEmpty a) :: NonEmpty a

   singletons-base	Data.List.NonEmpty.Singletons

   No documentation available.

6. type family Reverse (a1 :: [a]) :: [a]

   singletons-base	Data.List.Singletons

   No documentation available.

7. type family Reverse (a1 :: [a]) :: [a]

   singletons-base	Prelude.Singletons

   No documentation available.

8. module Numeric.AD.Internal.Reverse

   Reverse-Mode Automatic Differentiation using a single Wengert list (or "tape"). This version uses Data.Reflection to find and update the tape. This is asymptotically faster than using Kahn, which is forced to reify and topologically sort the graph, but it requires a fairly expensive rendezvous during construction when updated using multiple threads.

9. data Reverse s a

   ad	Numeric.AD.Internal.Reverse

   No documentation available.

10. Reverse :: forall a s . {-# UNPACK #-} !Int -> a -> Reverse s a

    ad	Numeric.AD.Internal.Reverse

    No documentation available.

Page 20 of many | Previous | Next