traverse package:reflex

traverse :: forall a m . MonadIO m => FastWeakBag a -> (a -> m ()) -> m ()

Deprecated: Use traverse_ instead

traverse :: MonadIO m => WeakBag a -> (a -> m ()) -> m ()

Deprecated: Use traverse_ instead

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

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

traverse_ :: forall a m . MonadIO m => FastWeakBag a -> (a -> m ()) -> m ()

reflex Data.FastWeakBag

Visit every node in the given list. If new nodes are appended during the traversal, they will not be visited. Every live node that was in the list when the traversal began will be visited exactly once; however, no guarantee is made about the order of the traversal.

traverse_ :: MonadIO m => WeakBag a -> (a -> m ()) -> m ()

reflex Data.WeakBag

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

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

traverseIntMapWithKeyWithAdjust :: Adjustable t m => (Key -> v -> m v') -> IntMap v -> Event t (PatchIntMap v) -> m (IntMap v', Event t (PatchIntMap v'))

reflex Reflex.Adjustable.Class

traverseDMapWithKeyWithAdjustRequesterTWith :: forall k t (request :: Type -> Type) (response :: Type -> Type) m v v' p p' . (GCompare k, Reflex t, MonadHold t m, PatchTarget (p' (Some k) (Event t (IntMap (RequesterData request)))) ~ Map (Some k) (Event t (IntMap (RequesterData request))), Patch (p' (Some k) (Event t (IntMap (RequesterData request)))), MonadFix m) => (forall (k' :: Type -> Type) (v1 :: Type -> Type) (v2 :: Type -> Type) . GCompare k' => (forall a . () => k' a -> v1 a -> m (v2 a)) -> DMap k' v1 -> Event t (p k' v1) -> RequesterT t request response m (DMap k' v2, Event t (p k' v2))) -> (forall (v1 :: Type -> Type) (v2 :: Type -> Type) . () => (forall a . () => v1 a -> v2 a) -> p k v1 -> p k v2) -> (forall (v1 :: Type -> Type) v2 . () => (forall a . () => v1 a -> v2) -> p k v1 -> p' (Some k) v2) -> (forall v2 . () => p' (Some k) v2 -> Map (Some k) v2) -> (forall a . () => Incremental t (p' (Some k) (Event t a)) -> Event t (Map (Some k) a)) -> (forall a . () => k a -> v a -> RequesterT t request response m (v' a)) -> DMap k v -> Event t (p k v) -> RequesterT t request response m (DMap k v', Event t (p k v'))

reflex Reflex.Requester.Base Reflex.Requester.Base.Internal

reflex Reflex.Requester.Base Reflex.Requester.Base.Internal

traverseRequesterData :: Applicative m => (forall a . () => request a -> m (response a)) -> RequesterData request -> m (RequesterData response)

reflex Reflex.Requester.Base Reflex.Requester.Base.Internal

Runs in reverse to accommodate for the fact that we accumulate it in reverse

traverseTagMapWithKey :: Applicative t => (forall a . () => MyTag a -> f a -> t (g a)) -> TagMap f -> t (TagMap g)

reflex Reflex.Requester.Base.Internal