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.

  1. unList :: List ix e -> [Elt ix e]

    massiv Data.Massiv.Core.List

    No documentation available.

  2. fromList :: Manifest r e => Comp -> [e] -> Vector r e

    massiv Data.Massiv.Vector

    Convert a flat list into a vector

  3. sfromList :: [e] -> Vector DS e

    massiv Data.Massiv.Vector

    Convert a list to a delayed stream vector Related: fromList, fromListN, sfromListN

    Examples

    >>> sfromList ([] :: [Int])
Array DS Seq (Sz1 0)
[  ]

>>> sfromList ([1,2,3] :: [Int])
Array DS Seq (Sz1 3)
[ 1, 2, 3 ]

  4. sfromListN :: Sz1 -> [e] -> Vector DS e

    massiv Data.Massiv.Vector

    Convert a list to a delayed stream vector. Length of the resulting vector will be at most n. This version isn't really more efficient then sfromList, but there is unsafeFromListN Related: fromList, fromListN, sfromList

    Examples

    >>> sfromListN 10 [1 :: Int ..]
Array DS Seq (Sz1 10)
[ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ]

>>> sfromListN 10 [1 :: Int .. 5]
Array DS Seq (Sz1 5)
[ 1, 2, 3, 4, 5 ]

  5. stoList :: Stream r ix e => Array r ix e -> [e]

    massiv Data.Massiv.Vector

    Convert an array to a list by the means of a delayed stream vector. Related: toList

    Examples

  6. toAltList :: (Semigroup m, Semigroup n) => (m :+: n) -> [Either m n]

    monoid-extras Data.Monoid.Coproduct

    Extract a monoid coproduct to a list of Either values. The resulting list is guaranteed to be normalized, in the sense that it will strictly alternate between Left and Right.

  7. toReducedAltList :: (Eq m, Eq n, Monoid m, Monoid n) => (m :+: n) -> [Either m n]

    monoid-extras Data.Monoid.Coproduct

    Extract a monoid coproduct to a list of Either values. The resulting list is guaranteed to be normalized, in the sense that it will strictly alternate between Left and Right and no identity element from m or n will occur in the list.

  8. module Data.Monoid.MList

    Heterogeneous lists of monoids.

  9. class MList l

    monoid-extras Data.Monoid.MList

    Type class for heterogeneous monoidal lists, with a single method allowing construction of an empty list.

  10. toAltList :: (Semigroup m, Semigroup n) => (m :+. n) -> NonEmpty (Either m n)

    monoid-extras Data.Semigroup.Coproduct

    Extract a semigroup coproduct to a non-empty list of Either values. The resulting list is guaranteed to be normalized, in the sense that it will strictly alternate between Left and Right.

Page 96 of many | Previous | Next