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.
fromList :: [a] -> EphemeralQueue aqueues Queue.Ephemeral Construct a queue from a list. The head of the list corresponds to the front of the queue.
-
ral Data.RAList >>> fromList ['a' .. 'f'] fromList "abcdef"
>>> explicitShow $ fromList ['a' .. 'f'] "NonEmpty (NE (Cons0 (Cons1 (Nd (Lf 'a') (Lf 'b')) (Last (Nd (Nd (Lf 'c') (Lf 'd')) (Nd (Lf 'e') (Lf 'f')))))))"
fromList :: forall (b :: Bin) a . SBinI b => [a] -> Maybe (RAVec b a)ral Data.RAVec Convert a list [a] to RAVec b a. Returns Nothing if lengths don't match.
>>> fromList "foo" :: Maybe (RAVec B.Bin3 Char) Just (NonEmpty (NE (Cons1 (Leaf 'f') (Last (Node (Leaf 'o') (Leaf 'o'))))))
>>> fromList "quux" :: Maybe (RAVec B.Bin3 Char) Nothing
>>> fromList "xy" :: Maybe (RAVec B.Bin3 Char) Nothing
-
range-set-list Data.RangeSet.IntMap O(n*log n). Create a set from a list of elements. Note that unlike Data.Set and other binary trees, this always requires a full sort and traversal to create distinct, disjoint ranges before constructing the tree.
fromList :: (Ord a, Enum a) => [a] -> RSet arange-set-list Data.RangeSet.List O(n*log n). Create a set from a list of elements.
fromList :: (Ord a, Enum a) => [a] -> RSet arange-set-list Data.RangeSet.Map O(n*log n). Create a set from a list of elements. Note that unlike Data.Set and other binary trees, this always requires a full sort and traversal to create distinct, disjoint ranges before constructing the tree.
-
rattletrap Rattletrap.Type.List No documentation available.
fromList :: List (Dictionary a) -> Array arattletrap Rattletrap.Type.Property.Array No documentation available.
-
rrb-vector Data.RRBVector Create a new vector from a list.
fromList :: (Eq k, Hashable k) => [(k, v)] -> HashMap k vsimple Web.Simple.Templates Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.