Hoogle Search

Within LTS Haskell 24.61 (ghc-9.10.3)

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

Exact lookup

1. CList :: [a] -> a -> [a] -> CList a

   data-clist	Data.CircularList.Internal

   No documentation available.

2. fromList :: [a] -> CList a

   data-clist	Data.CircularList.Internal

   Make a (balanced) CList from a list.

3. toInfList :: CList a -> [a]

   data-clist	Data.CircularList.Internal

   Make a CList into an infinite list.

4. toList :: CList a -> [a]

   data-clist	Data.CircularList.Internal

   Make a list from a CList.

5. ErrList :: Seq ErrorAcc -> ErrorAcc

   error-or	Data.ErrorOr

   No documentation available.

6. primMapListBounded :: BoundedPrim a -> [a] -> Builder

   fast-builder	Data.ByteString.FastBuilder.Internal

   Turn a list of values of type a into a Builder, using the given BoundedPrim.

7. primMapListFixed :: FixedPrim a -> [a] -> Builder

   fast-builder	Data.ByteString.FastBuilder.Internal

   Turn a list of values of type a into a Builder, using the given FixedPrim.

8. runListF :: ListF (f :: k -> Type) (a :: k) -> [f a]

   functor-combinators	Data.Functor.Combinator

   No documentation available.

9. toListBy :: forall (f :: Type -> Type) . Tensor t i => t f f ~> ListBy t f

   functor-combinators	Data.Functor.Combinator

   Embed a direct application of f to itself into a ListBy t f.

10. divListF :: forall (f :: Type -> Type) . Contravariant f => Div f ~> ListF f

    functor-combinators	Data.Functor.Contravariant.Divisible.Free

    Div is isomorphic to ListF for contravariant f. This witnesses one way of that isomorphism.

Page 162 of many | Previous | Next