Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

1. traverseIntMapPatchWithKey :: Applicative f => (Int -> a -> f b) -> PatchIntMap a -> f (PatchIntMap b)

   reflex	Data.FastMutableIntMap

   Map an effectful function Int -> a -> f b over all as in the given PatchIntMap a (that is, all inserts/updates), producing a f (PatchIntMap b).

2. unPatchIntMap :: PatchIntMap a -> IntMap (Maybe a)

   reflex	Data.FastMutableIntMap

   No documentation available.

3. applyMap :: Ord k => Map k (Maybe v) -> Map k v -> Map k v

   reflex	Data.Map.Misc

   Given a Map k (Maybe v) representing keys to insert/update (Just) or delete (Nothing), produce a new map from the given input Map k v. See also Map and MapWithMove.

4. applyMapKeysSet :: Ord k => Map k (Maybe v) -> Set k -> Set k

   reflex	Data.Map.Misc

   Given a Map k (Maybe v) representing keys to insert/update (Just) or delete (Nothing), produce a new Set k from the given input set. Equivalent to:

   applyMapKeysSet patch (keysSet m) == keysSet (applyMap patch m)
   

   but avoids the intervening Map and needs no values.

5. diffMap :: (Ord k, Eq v) => Map k v -> Map k v -> Map k (Maybe v)

   reflex	Data.Map.Misc

   Produce a Map k (Maybe v) by comparing two Map k vs, old and new respectively. Just represents an association present in new and either not present in old or where the value has changed. Nothing represents an association only present in old but no longer present in new@. See also diffMapNoEq for a similar but weaker version which does not require Eq on the values but thus can't indicated a value not changing between old and new with Nothing.

6. diffMapNoEq :: Ord k => Map k v -> Map k v -> Map k (Maybe v)

   reflex	Data.Map.Misc

   Produce a Map k (Maybe v) by comparing two Map k vs, old and new respectively. Just represents an association present in new and Nothing represents an association only present in old but no longer present in new. Similar to diffMap but doesn't require Eq on the values, thus can't tell if a value has changed or not.

7. sequenceDMapWithAdjust :: forall (k :: Type -> Type) t m . (GCompare k, Adjustable t m) => DMap k m -> Event t (PatchDMap k m) -> m (DMap k Identity, Event t (PatchDMap k Identity))

   reflex	Reflex.Adjustable.Class

   Traverse a DMap of Adjustable actions, running each of them. The provided Event of patches to the DMap can add, remove, or update values.

8. sequenceDMapWithAdjustWithMove :: forall (k :: Type -> Type) t m . (GCompare k, Adjustable t m) => DMap k m -> Event t (PatchDMapWithMove k m) -> m (DMap k Identity, Event t (PatchDMapWithMove k Identity))

   reflex	Reflex.Adjustable.Class

   Traverses a DMap of Adjustable actions, running each of them. The provided Event of patches to the DMap can add, remove, update, move, or swap values.

9. traverseDMapWithKeyWithAdjust :: (Adjustable t m, GCompare k) => (forall a . () => k a -> v a -> m (v' a)) -> DMap k v -> Event t (PatchDMap k v) -> m (DMap k v', Event t (PatchDMap k v'))

   reflex	Reflex.Adjustable.Class

   No documentation available.

10. traverseDMapWithKeyWithAdjustWithMove :: (Adjustable t m, GCompare k) => (forall a . () => k a -> v a -> m (v' a)) -> DMap k v -> Event t (PatchDMapWithMove k v) -> m (DMap k v', Event t (PatchDMapWithMove k v'))

    reflex	Reflex.Adjustable.Class

    No documentation available.

Page 584 of many | Previous | Next