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.

  1. toList :: Ord key => LRU key val -> [(key, val)]

    lrucache Data.Cache.LRU.Internal

    Retrieve a list view of an LRU. The items are returned in order from most recently accessed to least recently accessed.

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

    monoidmap-internal Data.MonoidMap.Internal

    Constructs a MonoidMap from a list of key-value pairs. If the list contains more than one value for the same key, values are combined together in the order that they appear with the (<>) operator. Satisfies the following property for all possible keys k: 

    get k (fromList kvs) ==
foldMap snd (filter ((== k) . fst) kvs)
    Satisfies the following round-trip property: 
    fromList (toList m) == m

    Examples

    With String values: 
    >>> fromList [(1,"a"), (2,"x"), (1,"b"), (2,"y"), (1,"c"), (2,"z")]
fromList [(1,"abc"), (2,"xyz")]

  3. fromListWith :: (Ord k, MonoidNull v) => (v -> v -> v) -> [(k, v)] -> MonoidMap k v

    monoidmap-internal Data.MonoidMap.Internal

    Constructs a MonoidMap from a list of key-value pairs, with a combining function for values. If the list contains more than one value for the same key, values are combined together in the order that they appear with the given combining function. Satisfies the following property for all possible keys k: 

    get k (fromListWith f kvs) ==
maybe mempty (foldl1 f)
(nonEmpty (snd <$> filter ((== k) . fst) kvs))

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

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

    monoidmap-internal Data.MonoidMap.Internal.RecoveredMap

    No documentation available.

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

    monoidmap-internal Data.MonoidMap.Internal.RecoveredMap

    No documentation available.

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

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

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

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

Page 167 of many | Previous | Next