Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. fromList :: [a] -> Zipper a

   ListZipper	Data.List.Zipper

   fromList xs returns a zipper containing the elements of xs, focused on the first element.

2. fromList :: [Word8] -> ByteSet

   byteset	Data.ByteSet

   O(n). Create a byteset from a list of bytes.

3. fromList :: IsSequence seq => [Element seq] -> seq

   classy-prelude-yesod	ClassyPrelude.Yesod

   Convert a list to a sequence.

   > fromList [a, b, c] :: Text
   "abc"
   

4. fromList :: [a] -> Signal a

   elerea	FRP.Elerea.Simple.Pure

   No documentation available.

5. fromList :: (AllocM m, Key k, Value v) => [(k, v)] -> m (Tree k v)

   haskey-btree	Data.BTree.Impure

   Create a tree from a list.

6. fromList :: (AllocM m, Key k, Value v) => NonEmpty (k, v) -> m (NonEmptyTree k v)

   haskey-btree	Data.BTree.Impure.NonEmpty

   Create a NonEmptyTree from a NonEmpty list.

7. fromList :: Key k => TreeSetup -> [(k, v)] -> Tree k v

   haskey-btree	Data.BTree.Pure

   O(n*log n). Construct a B-tree from a list of key/value pairs. If the list contains duplicate keys, the last pair for a duplicate key is kept.

8. fromList :: forall (u :: Type -> Type) a (v :: Type -> Type) b . (Vector u a, Vector v b) => [(a, b)] -> Vector u v (a, b)

   hybrid-vectors	Data.Vector.Hybrid

   O(n) Convert a list to a vector

9. fromList :: [(Int, a)] -> Path a

   lca	Data.LCA.Online

   Build a Path from a list of (ID, value) pairs.

10. fromList :: Monoid a => [(Int, a)] -> Path a

    lca	Data.LCA.Online.Monoidal

    Build a Path from a list of (ID, value) pairs.

Page 37 of many | Previous | Next