Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

Exact lookup

1. fromDistinctAscOccurList :: [(a, Occur)] -> MultiSet a

   multiset	Data.MultiSet

   O(n). Build a multiset from an ascending list of elements/occurrence pairs where each elements appears only once. Occurrences must be positive. The precondition (input list is strictly ascending, all occurrences > 0) is not checked.

2. fromList :: Ord a => [a] -> MultiSet a

   multiset	Data.MultiSet

   O(t*log t). Create a multiset from a list of elements.

3. fromOccurList :: Ord a => [(a, Occur)] -> MultiSet a

   multiset	Data.MultiSet

   O(n*log n). Create a multiset from a list of element/occurrence pairs. Occurrences must be positive. The precondition (all occurrences > 0) is not checked.

4. toAscList :: MultiSet a -> [a]

   multiset	Data.MultiSet

   O(t). Convert the multiset to an ascending list of elements.

5. toAscOccurList :: MultiSet a -> [(a, Occur)]

   multiset	Data.MultiSet

   O(n). Convert the multiset to an ascending list of element/occurrence pairs.

6. toList :: MultiSet a -> [a]

   multiset	Data.MultiSet

   O(t). Convert the multiset to a list of elements.

7. toOccurList :: MultiSet a -> [(a, Occur)]

   multiset	Data.MultiSet

   O(n). Convert the multiset to a list of element/occurrence pairs.

8. getHListElem :: ContainsType a c => HList c -> a

   multistate	Data.HList.ContainsType

   No documentation available.

9. setHListElem :: ContainsType a c => a -> HList c -> HList c

   multistate	Data.HList.ContainsType

   No documentation available.

10. module Data.HList.HList

    A GADT HList implementation There exist other implementations of HList on hackage, but none seem to be reliably maintained.

Page 169 of many | Previous | Next