Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

  1. fromList :: forall (v :: Type -> Type) a (n :: Nat) . (Vector v a, KnownNat n) => [a] -> Maybe (Vector v n a)

    vector-sized Data.Vector.Generic.Sized

    O(n) Convert a list to a vector.

  2. fromList :: forall a (n :: Nat) . (Prim a, KnownNat n) => [a] -> Maybe (Vector n a)

    vector-sized Data.Vector.Primitive.Sized

    O(n) Convert a list to a vector.

  3. fromList :: forall (n :: Nat) a . KnownNat n => [a] -> Maybe (Vector n a)

    vector-sized Data.Vector.Sized

    O(n) Convert a list to a vector.

  4. fromList :: forall a (n :: Nat) . (Storable a, KnownNat n) => [a] -> Maybe (Vector n a)

    vector-sized Data.Vector.Storable.Sized

    O(n) Convert a list to a vector.

  5. fromList :: forall a (n :: Nat) . (Unbox a, KnownNat n) => [a] -> Maybe (Vector n a)

    vector-sized Data.Vector.Unboxed.Sized

    O(n) Convert a list to a vector.

  6. fromList :: (Ord a, ListLike a i, Eq i) => [a] -> CompletionTree a

    yi-core Yi.CompletionTree

    This function converts a list of completable elements to a CompletionTree It finds elements that share a common prefix and groups them. 

    fromList . toList = id

  7. fromList :: HasCallStack => [a] -> NonEmpty a

    base-compat-batteries Data.List.NonEmpty.Compat

    Converts a normal list to a NonEmpty stream. Raises an error if given an empty list.

  8. fromList :: (Ord a, Ord b) => [(a, b)] -> Bimap a b

    bimap Data.Bimap

    O(n*log n). Build a map from a list of pairs. If there are any overlapping pairs in the list, the later ones will override the earlier ones. Version: 0.2

  9. fromList :: Enum k => [(k, a)] -> EnumMap k a

    enummapset Data.EnumMap.Lazy

    No documentation available.

  10. fromList :: Enum k => [(k, a)] -> EnumMap k a

    enummapset Data.EnumMap.Strict

    No documentation available.

Page 7 of many | Previous | Next