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.

Exact lookup

1. elimList :: forall a (p :: [a] ~> Type) (s :: [a]) . Sing s -> Apply p ('[] :: [a]) -> (forall (f0 :: a) . () => Sing f0 -> forall (f1 :: [a]) . () => Sing f1 -> Apply p f1 -> Apply p (f0 ': f1)) -> Apply p s

   eliminators	Data.Eliminator

   No documentation available.

2. fromFixedList :: List n a -> T n a

   fixed-length	Data.FixedLength

   No documentation available.

3. toFixedList :: T n a -> List n a

   fixed-length	Data.FixedLength

   No documentation available.

4. toList :: Natural n => T n a -> [a]

   fixed-length	Data.FixedLength

   No documentation available.

5. type family HomList (n :: PeanoNum) (a :: α) :: [α]

   fixed-vector-hetero	Data.Vector.HFixed.Class

   Homogeneous type list with length n and element of type a. It uses type level natural defined in fixed-vector.

6. data VecList (a :: [Type])

   fixed-vector-hetero	Data.Vector.HFixed.Cont

   List like heterogeneous vector.

7. data VecListF (xs :: [α]) (f :: α -> Type)

   fixed-vector-hetero	Data.Vector.HFixed.Cont

   List-like vector

8. type family HomList (n :: PeanoNum) (a :: α) :: [α]

   fixed-vector-hetero	Data.Vector.HFixed.TypeFuns

   Homogeneous type list with length n and element of type a. It uses type level natural defined in fixed-vector.

9. module Data.FMList

   FoldMap lists: lists represented by their foldMap function. Examples:

   -- A right-infinite list
   c = 1 `cons` c
   

   -- A left-infinite list
   d = d `snoc` 2
   

   -- A middle-infinite list ??
   e = c `append` d
   

   *> head e
   1
   *> last e
   2
   

10. newtype FMList a

    fmlist	Data.FMList

    FMList is a foldMap function wrapped up in a newtype.

Page 194 of many | Previous | Next