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. onList :: ([a] -> [a]) -> MQuery a -> MQuery a

   hw-mquery	HaskellWorks.Data.MQuery

   No documentation available.

2. unzipFromListN2 :: (Storable a, Storable b) => Int -> [(a, b)] -> (Vector a, Vector b)

   hw-prim	HaskellWorks.Data.Vector.Storable

   No documentation available.

3. fromList :: [(Param, ParamValue)] -> QueryData

   hyperbole	Web.Hyperbole.Data.QueryData

   No documentation available.

4. toList :: QueryData -> [(Param, ParamValue)]

   hyperbole	Web.Hyperbole.Data.QueryData

   No documentation available.

5. fromList :: [Cookie] -> Cookies

   hyperbole	Web.Hyperbole.Data.Session

   No documentation available.

6. toList :: Cookies -> [Cookie]

   hyperbole	Web.Hyperbole.Data.Session

   No documentation available.

7. module Data.NList

   Lists whose types are indexed by their lengths. The implementation is a simple wrapper around a regular list. All functions in this module are total. The time complexity of each function is the same as that of the corresponding function on regular lists.

8. data NList (n :: Nat) a

   indexed-containers	Data.NList

   A list whose length is statically known. Type parameter n, of kind Nat, is the length of the list.

9. toList :: forall (n :: Nat) a . NList n a -> [a]

   indexed-containers	Data.NList

   Convert an NList into a regular list.

   toList (mk3 'a' 'b' 'c') === "abc"
   

10. maybeToList :: Maybe a <-> [a]

    invertible	Data.Invertible.Maybe

    Convert between Maybe and a (singleton) list (see maybeToList). (invert listToMaybe)

Page 202 of many | Previous | Next