Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. unsafeMapMonotonic :: forall k p q v w . (k -> p -> v -> (q, w)) -> OrdPSQ k p v -> OrdPSQ k q w

   psqueues	Data.OrdPSQ

   O(n) Maps a function over the values and priorities of the queue. The function f must be monotonic with respect to the priorities. I.e. if x < y, then fst (f k x v) < fst (f k y v). The precondition is not checked. If f is not monotonic, then the result will be invalid.

2. module Data.AppendMap

   No documentation available.

3. type AppendMap = MonoidalMap

   reflex	Data.AppendMap

   Deprecated: Use MonoidalMap instead

4. pattern AppendMap :: Map k v -> MonoidalMap k v

   reflex	Data.AppendMap

   Deprecated: Use MonoidalMap instead

5. _unAppendMap :: MonoidalMap k v -> Map k v

   reflex	Data.AppendMap

   Deprecated: Use getMonoidalMap instead

6. module Data.FastMutableIntMap

   No documentation available.

7. data FastMutableIntMap a

   reflex	Data.FastMutableIntMap

   A FastMutableIntMap holds a map of values of type a and allows low-overhead modifications via IO. Operations on FastMutableIntMap run in IO.

8. newtype PatchIntMap a

   reflex	Data.FastMutableIntMap

   Patch for IntMap which represents insertion or deletion of keys in the mapping. Internally represented by 'IntMap (Maybe a)', where Just means insert/update and Nothing means delete.

9. PatchIntMap :: IntMap (Maybe a) -> PatchIntMap a

   reflex	Data.FastMutableIntMap

   No documentation available.

10. patchIntMapNewElements :: PatchIntMap a -> [a]

    reflex	Data.FastMutableIntMap

    Extract all as inserted/updated by the given PatchIntMap a.

Page 584 of many | Previous | Next