Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. toList :: MonoidMap k v -> [(k, v)]

   monoidmap-internal	Data.MonoidMap.Internal

   Converts a MonoidMap to a list of key-value pairs, where the keys are in ascending order. The result only includes entries with values that are not null. Satisfies the following round-trip property:

   fromList (toList m) == m
   

   The resulting list is sorted in ascending key order:

   sortOn fst (toList m) == toList m
   

2. fromList :: Ord k => [(k, v)] -> Map k v

   monoidmap-internal	Data.MonoidMap.Internal.RecoveredMap

   No documentation available.

3. toList :: Map k v -> [(k, v)]

   monoidmap-internal	Data.MonoidMap.Internal.RecoveredMap

   No documentation available.

4. toList :: forall channel content (m :: Type -> Type) . ClientConnectionStore (Event channel content) m -> [(UUID, ClientConnection m)]

   morpheus-graphql-subscriptions	Data.Morpheus.Subscriptions.Internal

   No documentation available.

5. fromAscList :: [Int] -> IntMultiSet

   multiset	Data.IntMultiSet

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

6. fromAscOccurList :: [(Int, Int)] -> IntMultiSet

   multiset	Data.IntMultiSet

   O(n). Build a multiset from an ascending list of element/occurrence pairs in linear time. Occurrences must be positive. The precondition (input list is ascending, all occurrences > 0) is not checked.

7. fromDistinctAscList :: [Int] -> IntMultiSet

   multiset	Data.IntMultiSet

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

8. fromDistinctAscOccurList :: [(Int, Int)] -> IntMultiSet

   multiset	Data.IntMultiSet

   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.

9. fromList :: [Int] -> IntMultiSet

   multiset	Data.IntMultiSet

   O(t*min(n,W)). Create a multiset from a list of elements.

10. fromOccurList :: [(Int, Int)] -> IntMultiSet

    multiset	Data.IntMultiSet

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

Page 167 of many | Previous | Next