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. toList :: Map k a -> [(k, a)]

    containers Data.Map.Strict.Internal

    Convert the map to a list of key/value pairs. Subject to list fusion. 

    toList (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")]
toList empty == []

  2. fromList :: [a] -> Seq a

    containers Data.Sequence

    Create a sequence from a finite list of elements. There is a function toList in the opposite direction for all instances of the Foldable class, including Seq.

  3. fromList :: [a] -> Seq a

    containers Data.Sequence.Internal

    Create a sequence from a finite list of elements. There is a function toList in the opposite direction for all instances of the Foldable class, including Seq.

  4. data IQList e

    containers Data.Sequence.Internal.Sorting

    No documentation available.

  5. data ITQList e a

    containers Data.Sequence.Internal.Sorting

    No documentation available.

  6. data QList e

    containers Data.Sequence.Internal.Sorting

    No documentation available.

  7. data TQList a b

    containers Data.Sequence.Internal.Sorting

    No documentation available.

  8. fromAscList :: Eq a => [a] -> Set a

    containers Data.Set

    Build a set from an ascending list in linear time. The precondition (input list is ascending) is not checked.

  9. fromDescList :: Eq a => [a] -> Set a

    containers Data.Set

    Build a set from a descending list in linear time. The precondition (input list is descending) is not checked.

  10. fromDistinctAscList :: [a] -> Set a

    containers Data.Set

    Build a set from an ascending list of distinct elements in linear time. The precondition (input list is strictly ascending) is not checked.

Page 45 of many | Previous | Next