Hoogle Search

Within LTS Haskell 24.18 (ghc-9.10.3)

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

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

    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')))))))"

  2. 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

  3. fromList :: [Int] -> RIntSet

    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.

  4. fromList :: (Ord a, Enum a) => [a] -> RSet a

    range-set-list Data.RangeSet.List

    O(n*log n). Create a set from a list of elements.

  5. fromList :: (Ord a, Enum a) => [a] -> RSet a

    range-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.

  6. fromList :: [a] -> List a

    rattletrap Rattletrap.Type.List

    No documentation available.

  7. fromList :: List (Dictionary a) -> Array a

    rattletrap Rattletrap.Type.Property.Array

    No documentation available.

  8. fromList :: [a] -> Vector a

    rrb-vector Data.RRBVector

    Create a new vector from a list.

  9. fromList :: (Eq k, Hashable k) => [(k, v)] -> HashMap k v

    simple Web.Simple.Templates

    Construct a map with the supplied mappings. If the list contains duplicate mappings, the later mappings take precedence.

  10. fromList :: forall (f :: Type -> Type) (n :: Nat) a . (CFreeMonoid f, Dom f a) => SNat n -> [a] -> Maybe (Sized f n a)

    sized Data.Sized

    If the given list is shorter than n, then returns Nothing Otherwise returns Sized f n a consisting of initial n element of given list. Since 0.7.0.0 (type changed)

Page 33 of many | Previous | Next