Hoogle Search

Within Stackage Nightly 2025-10-04 (ghc-9.12.2)

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

Exact lookup

1. fromSet :: (Int -> a) -> IntSet -> MonoidalIntMap a

   monoidal-containers	Data.IntMap.Monoidal.Strict

   No documentation available.

2. keysSet :: MonoidalIntMap a -> IntSet

   monoidal-containers	Data.IntMap.Monoidal.Strict

   No documentation available.

3. fromSet :: (k -> a) -> Set k -> MonoidalMap k a

   monoidal-containers	Data.Map.Monoidal

   No documentation available.

4. keysSet :: MonoidalMap k a -> Set k

   monoidal-containers	Data.Map.Monoidal

   No documentation available.

5. fromSet :: (k -> a) -> Set k -> MonoidalMap k a

   monoidal-containers	Data.Map.Monoidal.Strict

   No documentation available.

6. keysSet :: MonoidalMap k a -> Set k

   monoidal-containers	Data.Map.Monoidal.Strict

   No documentation available.

7. keysSet :: MultiMap k a -> Set k

   multimap	Data.MultiMap

   O(n). The set of all keys of the multimap.

8. toMapOfSets :: Ord a => MultiMap k a -> Map k (Set a)

   multimap	Data.MultiMap

   /O(k*m*log m) where k is the number of keys and m the maximum number of elements associated with a single key/

9. fromSet :: (Key -> a) -> NEIntSet -> NEIntMap a

   nonempty-containers	Data.IntMap.NonEmpty

   O(n). Build a non-empty map from a non-empty set of keys and a function which for each key computes its value.

   fromSet (\k -> replicate k 'a') (Data.Set.NonEmpty.fromList (3 :| [5])) == fromList ((5,"aaaaa") :| [(3,"aaa")])
   

10. keysSet :: NEIntMap a -> NEIntSet

    nonempty-containers	Data.IntMap.NonEmpty

    O(n). The non-empty set of all keys of the map.

    keysSet (fromList ((5,"a") :| [(3,"b")])) == Data.Set.NonEmpty.fromList (3 :| [5])
    

Page 123 of many | Previous | Next