@@ -0,0 +1,681 @@
1+{-# LANGUAGE AllowAmbiguousTypes #-}
3+{-# LANGUAGE EmptyDataDecls #-}
4+{-# LANGUAGE ExistentialQuantification #-}
5+{-# LANGUAGE FlexibleInstances #-}
7+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
8+{-# LANGUAGE MultiParamTypeClasses #-}
9+{-# LANGUAGE Rank2Types #-}
10+{-# LANGUAGE RecursiveDo #-}
11+{-# LANGUAGE ScopedTypeVariables #-}
12+{-# LANGUAGE StandaloneDeriving #-}
13+{-# LANGUAGE TypeFamilies #-}
14+{-# LANGUAGE TypeOperators #-}
15+{-# LANGUAGE UndecidableInstances #-}
16+{-# LANGUAGE InstanceSigs #-}
17+#ifdef USE_REFLEX_OPTIMIZER
18+{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
20+module Reflex.Requester.Base.Internal where
23+import Reflex.Adjustable.Class
25+import Reflex.Host.Class
26+import Reflex.PerformEvent.Class
27+import Reflex.PostBuild.Class
28+import Reflex.Requester.Class
29+import Reflex.TriggerEvent.Class
30+import Reflex.EventWriter.Base
31+import Reflex.EventWriter.Class
33+import Control.Applicative (liftA2)
34+import Control.Monad.Exception
35+import Control.Monad.Identity
36+import Control.Monad.Primitive
37+import Control.Monad.Reader
38+import Control.Monad.Ref
39+import Control.Monad.State.Strict
42+import Data.Dependent.Map (DMap, DSum (..))
43+import qualified Data.Dependent.Map as DMap
44+import Data.Functor.Compose
45+import Data.Functor.Misc
46+import Data.IntMap.Strict (IntMap)
47+import qualified Data.IntMap.Strict as IntMap
48+import qualified Data.List.NonEmpty as NonEmpty
49+import Data.List.NonEmpty.Deferred (NonEmptyDeferred)
50+import qualified Data.List.NonEmpty.Deferred as NonEmptyDeferred
52+import qualified Data.Map as Map
53+import Data.Monoid ((<>))
55+import qualified Data.Semigroup as S
56+import Data.Some (Some(Some))
57+import Data.Type.Equality
58+import Data.Sequence (Seq)
59+import qualified Data.Sequence as Seq
60+import Data.TagMap (TagMap)
61+import qualified Data.TagMap as TagMap
63+import Data.Unique.Tag.Local
64+import qualified Data.Unique.Tag as Global
65+import Data.GADT.Compare
66+import Data.Witherable
73+data RequestData ps request = forall s. RequestData !(TagGen ps s) !(NonEmptyDeferred (RequestEnvelope s request))
74+data ResponseData ps response = forall s. ResponseData !(TagGen ps s) !(TagMap s response)
76+traverseRequesterData :: forall m request response. Applicative m => (forall a. request a -> m (response a)) -> RequestData (PrimState m) request -> m (ResponseData (PrimState m) response)
77+traverseRequesterData f (RequestData tg es) = ResponseData tg . TagMap.fromList <$> wither g (NonEmpty.toList $ NonEmptyDeferred.toNonEmpty es)
78+ where g (RequestEnvelope mt req) = case mt of
79+ Just t -> Just . (t :=>) <$> f req
80+ Nothing -> Nothing <$ f req
82+runRequesterT :: forall t request response m a
87+ => RequesterT t request response m a
88+ -> Event t (ResponseData (PrimState m) response)
89+ -> m (a, Event t (RequestData (PrimState m) request))
90+runRequesterT (RequesterT a) wrappedResponses = withRequesterInternalT $ \(requests :: Event t (NonEmptyDeferred (RequestEnvelope s request))) -> do
91+ (_, tg) <- RequesterInternalT ask
92+ result <- (unsafeCoerce :: RequesterInternalT FakeRequesterStatePhantom t request response m a -> RequesterInternalT s t request response m a) a
93+ let responses = fforMaybe wrappedResponses $ \(ResponseData tg' m) -> case tg `geq` tg' of
94+ Nothing -> trace ("runRequesterT: bad TagGen: expected " <> show tg <> " but got " <> show tg') Nothing --TODO: Warn somehow
96+ pure (responses, (result, fmapCheap (RequestData tg) requests))
98+instance MonadTrans (RequesterInternalT s t request response) where
99+ lift = RequesterInternalT . lift . lift
101+instance MonadTrans (RequesterT t request response) where
102+ lift a = RequesterT $ RequesterInternalT $ lift $ lift a
104+-- | Run a 'RequesterT' action. The resulting 'Event' will fire whenever
105+-- requests are made, and responses should be provided in the input 'Event'.
106+-- The 'Tag' keys will be used to return the responses to the same place the
107+-- requests were issued.
108+withRequesterInternalT
113+ => (forall s. Event t (NonEmptyDeferred (RequestEnvelope s request)) -> RequesterInternalT s t request response m (Event t (TagMap s response), a))
115+withRequesterInternalT f = withTagGen $ \tg -> do
116+ rec let RequesterInternalT a = f requests
117+ ((responses, result), requests) <- runEventWriterT $ runReaderT a (fanTag responses, tg)
120+data RequestEnvelope s request = forall a. RequestEnvelope {-# UNPACK #-} !(Maybe (Tag s a)) !(request a)
122+-- This is because using forall ruins inlining
123+data FakeRequesterStatePhantom
125+newtype RequesterT t (request :: * -> *) (response :: * -> *) m a = RequesterT { unRequesterT :: RequesterInternalT FakeRequesterStatePhantom t request response m a }
126+ deriving (Functor, Applicative, Monad, MonadFix, MonadIO, MonadException)
128+newtype RequesterInternalT s t request response m a = RequesterInternalT { unRequesterInternalT :: ReaderT (EventSelectorTag t s response, TagGen (PrimState m) s) (EventWriterT t (NonEmptyDeferred (RequestEnvelope s request)) m) a }
130+ ( Functor, Applicative, Monad, MonadFix, MonadIO, MonadException
131+#if MIN_VERSION_base(4,9,1)
132+ , MonadAsyncException
136+-- I don't think this can actually be supported without an unsafeCoerce
137+-- #if MIN_VERSION_base(4,9,1)
138+-- instance MonadAsyncException m => MonadAsyncException (RequesterT t request response m) where
139+-- mask f = RequesterT $ mask $ \unmask -> unRequesterT $ f $ \x -> RequesterT $ unmask $ unRequesterT x
142+instance MonadSample t m => MonadSample t (RequesterT t request response m)
143+instance MonadHold t m => MonadHold t (RequesterT t request response m)
144+instance PostBuild t m => PostBuild t (RequesterT t request response m)
145+instance TriggerEvent t m => TriggerEvent t (RequesterT t request response m)
147+instance MonadSample t m => MonadSample t (RequesterInternalT s t request response m)
148+instance MonadHold t m => MonadHold t (RequesterInternalT s t request response m)
149+instance PostBuild t m => PostBuild t (RequesterInternalT s t request response m)
150+instance TriggerEvent t m => TriggerEvent t (RequesterInternalT s t request response m)
152+instance PrimMonad m => PrimMonad (RequesterT t request response m) where
153+ type PrimState (RequesterT t request response m) = PrimState m
154+ primitive = lift . primitive
156+-- TODO: Monoid and Semigroup can likely be derived once StateT has them.
157+instance (Monoid a, Monad m) => Monoid (RequesterT t request response m a) where
158+ mempty = pure mempty
159+ mappend = liftA2 mappend
161+instance (S.Semigroup a, Monad m) => S.Semigroup (RequesterT t request response m a) where
162+ (<>) = liftA2 (S.<>)
164+instance PerformEvent t m => PerformEvent t (RequesterT t request response m) where
165+ type Performable (RequesterT t request response m) = Performable m
166+ performEvent_ = lift . performEvent_
167+ performEvent = lift . performEvent
169+instance MonadRef m => MonadRef (RequesterT t request response m) where
170+ type Ref (RequesterT t request response m) = Ref m
171+ newRef = lift . newRef
172+ readRef = lift . readRef
173+ writeRef r = lift . writeRef r
175+instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (RequesterT t request response m) where
176+ newEventWithTrigger = lift . newEventWithTrigger
177+ newFanEventWithTrigger f = lift $ newFanEventWithTrigger f
179+instance MonadReader r m => MonadReader r (RequesterT t request response m) where
181+ local f (RequesterT a) = RequesterT $ RequesterInternalT $ mapReaderT (mapEventWriterT $ local f) $ unRequesterInternalT a
182+ reader = lift . reader
184+instance (Reflex t, PrimMonad m) => Requester t (RequesterT t request response m) where
185+ type Request (RequesterT t request response m) = request
186+ type Response (RequesterT t request response m) = response
187+ requesting e = RequesterT $ requesting e
188+ requesting_ e = RequesterT $ requesting_ e
190+instance (Reflex t, PrimMonad m) => Requester t (RequesterInternalT s t request response m) where
191+ type Request (RequesterInternalT s t request response m) = request
192+ type Response (RequesterInternalT s t request response m) = response
193+ requesting e = RequesterInternalT $ do
195+ t <- lift $ lift $ newTag tg
196+ tellEvent $ fmapCheap (NonEmptyDeferred.singleton . RequestEnvelope (Just t)) e
197+ pure $ selectTag s t
198+ requesting_ e = RequesterInternalT $ do
199+ tellEvent $ fmapCheap (NonEmptyDeferred.singleton . RequestEnvelope Nothing) e
201+instance (Adjustable t m, MonadHold t m) => Adjustable t (RequesterInternalT s t request response m) where
202+ {-# INLINABLE runWithReplace #-}
203+ runWithReplace (RequesterInternalT a0) a' = RequesterInternalT $ runWithReplace a0 (coerceEvent a')
204+ {-# INLINABLE traverseIntMapWithKeyWithAdjust #-}
205+ traverseIntMapWithKeyWithAdjust f dm0 dm' = RequesterInternalT $ traverseIntMapWithKeyWithAdjust (coerce . f) dm0 dm'
206+ {-# INLINABLE traverseDMapWithKeyWithAdjust #-}
207+ traverseDMapWithKeyWithAdjust f dm0 dm' = RequesterInternalT $ traverseDMapWithKeyWithAdjust (coerce . f) dm0 dm'
208+ {-# INLINABLE traverseDMapWithKeyWithAdjustWithMove #-}
209+ traverseDMapWithKeyWithAdjustWithMove f dm0 dm' = RequesterInternalT $ traverseDMapWithKeyWithAdjustWithMove (coerce . f) dm0 dm'
211+instance (Adjustable t m, MonadHold t m) => Adjustable t (RequesterT t request response m) where
212+ {-# INLINABLE runWithReplace #-}
213+ runWithReplace (RequesterT a0) a' = RequesterT $ runWithReplace a0 (fmapCheap unRequesterT a')
214+ {-# INLINABLE traverseIntMapWithKeyWithAdjust #-}
215+ traverseIntMapWithKeyWithAdjust f dm0 dm' = RequesterT $ traverseIntMapWithKeyWithAdjust (\k v -> unRequesterT $ f k v) dm0 dm'
216+ {-# INLINABLE traverseDMapWithKeyWithAdjust #-}
217+ traverseDMapWithKeyWithAdjust f dm0 dm' = RequesterT $ traverseDMapWithKeyWithAdjust (\k v -> unRequesterT $ f k v) dm0 dm'
218+ {-# INLINABLE traverseDMapWithKeyWithAdjustWithMove #-}
219+ traverseDMapWithKeyWithAdjustWithMove f dm0 dm' = RequesterT $ traverseDMapWithKeyWithAdjustWithMove (\k v -> unRequesterT $ f k v) dm0 dm'
221+{-# INLINABLE runWithReplaceRequesterTWith #-}
222+runWithReplaceRequesterTWith :: forall m t request response a b. (Reflex t, MonadHold t m
225+ => (forall a' b'. m a' -> Event t (m b') -> RequesterT t request response m (a', Event t b'))
226+ -> RequesterT t request response m a
227+ -> Event t (RequesterT t request response m b)
228+ -> RequesterT t request response m (a, Event t b)
229+runWithReplaceRequesterTWith f (RequesterT a0) a' = RequesterT $ do
233+import GHC.Exts (Any)
236+--TODO: Make this module type-safe
238+newtype TagMap (f :: * -> *) = TagMap (IntMap Any)
240+newtype RequesterData f = RequesterData (TagMap (Entry f))
242+data RequesterDataKey a where
243+ RequesterDataKey_Single :: {-# UNPACK #-} !(MyTag (Single a)) -> RequesterDataKey a
244+ RequesterDataKey_Multi :: {-# UNPACK #-} !(MyTag Multi) -> {-# UNPACK #-} !Int -> !(RequesterDataKey a) -> RequesterDataKey a --TODO: Don't put a second Int here (or in the other Multis); use a single Int instead
245+ RequesterDataKey_Multi2 :: {-# UNPACK #-} !(MyTag (Multi2 k)) -> !(Some k) -> {-# UNPACK #-} !Int -> !(RequesterDataKey a) -> RequesterDataKey a
246+ RequesterDataKey_Multi3 :: {-# UNPACK #-} !(MyTag Multi3) -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> !(RequesterDataKey a) -> RequesterDataKey a
248+singletonRequesterData :: RequesterDataKey a -> f a -> RequesterData f
249+singletonRequesterData rdk v = case rdk of
250+ RequesterDataKey_Single k -> RequesterData $ singletonTagMap k $ Entry v
251+ RequesterDataKey_Multi k k' k'' -> RequesterData $ singletonTagMap k $ Entry $ IntMap.singleton k' $ singletonRequesterData k'' v
252+ RequesterDataKey_Multi2 k k' k'' k''' -> RequesterData $ singletonTagMap k $ Entry $ Map.singleton k' $ IntMap.singleton k'' $ singletonRequesterData k''' v
253+ RequesterDataKey_Multi3 k k' k'' k''' -> RequesterData $ singletonTagMap k $ Entry $ IntMap.singleton k' $ IntMap.singleton k'' $ singletonRequesterData k''' v
255+requesterDataToList :: RequesterData f -> [DSum RequesterDataKey f]
256+requesterDataToList (RequesterData m) = do
257+ k :=> Entry e <- tagMapToList m
259+ MyTagType_Single -> return $ RequesterDataKey_Single k :=> e
260+ MyTagType_Multi -> do
261+ (k', e') <- IntMap.toList e
262+ k'' :=> e'' <- requesterDataToList e'
263+ return $ RequesterDataKey_Multi k k' k'' :=> e''
264+ MyTagType_Multi2 -> do
265+ (k', e') <- Map.toList e
266+ (k'', e'') <- IntMap.toList e'
267+ k''' :=> e''' <- requesterDataToList e''
268+ return $ RequesterDataKey_Multi2 k k' k'' k''' :=> e'''
269+ MyTagType_Multi3 -> do
270+ (k', e') <- IntMap.toList e
271+ (k'', e'') <- IntMap.toList e'
272+ k''' :=> e''' <- requesterDataToList e''
273+ return $ RequesterDataKey_Multi3 k k' k'' k''' :=> e'''
275+singletonTagMap :: forall f a. MyTag a -> f a -> TagMap f
276+singletonTagMap (MyTag k) v = TagMap $ IntMap.singleton k $ (unsafeCoerce :: f a -> Any) v
278+tagMapToList :: forall f. TagMap f -> [DSum MyTag f]
279+tagMapToList (TagMap m) = f <$> IntMap.toList m
280+ where f :: (Int, Any) -> DSum MyTag f
281+ f (k, v) = MyTag k :=> (unsafeCoerce :: Any -> f a) v
283+traverseTagMapWithKey :: forall t f g. Applicative t => (forall a. MyTag a -> f a -> t (g a)) -> TagMap f -> t (TagMap g)
284+traverseTagMapWithKey f (TagMap m) = TagMap <$> IntMap.traverseWithKey g m
286+ g :: Int -> Any -> t Any
287+ g k v = (unsafeCoerce :: g a -> Any) <$> f (MyTag k) ((unsafeCoerce :: Any -> f a) v)
289+-- | Runs in reverse to accommodate for the fact that we accumulate it in reverse
290+traverseRequesterData :: forall m request response. Applicative m => (forall a. request a -> m (response a)) -> RequesterData request -> m (RequesterData response)
291+traverseRequesterData f (RequesterData m) = RequesterData <$> traverseTagMapWithKey go m --TODO: reverse this, since our tags are in reverse order
292+ where go :: forall x. MyTag x -> Entry request x -> m (Entry response x)
293+ go k (Entry request) = Entry <$> case myKeyType k of
294+ MyTagType_Single -> f request
295+ MyTagType_Multi -> traverse (traverseRequesterData f) request
296+ MyTagType_Multi2 -> traverse (traverse (traverseRequesterData f)) request
297+ MyTagType_Multi3 -> traverse (traverse (traverseRequesterData f)) request
299+-- | 'traverseRequesterData' with its arguments flipped
300+forRequesterData :: forall request response m. Applicative m => RequesterData request -> (forall a. request a -> m (response a)) -> m (RequesterData response)
301+forRequesterData r f = traverseRequesterData f r
303+data MyTagType :: * -> * where
304+ MyTagType_Single :: MyTagType (Single a)
305+ MyTagType_Multi :: MyTagType Multi
306+ MyTagType_Multi2 :: MyTagType (Multi2 k)
307+ MyTagType_Multi3 :: MyTagType Multi3
309+myKeyType :: MyTag x -> MyTagType x
310+myKeyType (MyTag k) = case k .&. 0x3 of
311+ 0x0 -> unsafeCoerce MyTagType_Single
312+ 0x1 -> unsafeCoerce MyTagType_Multi
313+ 0x2 -> unsafeCoerce MyTagType_Multi2
314+ 0x3 -> unsafeCoerce MyTagType_Multi3
315+ t -> error $ "Reflex.Requester.Base.myKeyType: no such key type" <> show t
319+data Multi2 (k :: * -> *)
322+class MyTagTypeOffset x where
323+ myTagTypeOffset :: proxy x -> Int
325+instance MyTagTypeOffset (Single a) where
326+ myTagTypeOffset _ = 0x0
328+instance MyTagTypeOffset Multi where
329+ myTagTypeOffset _ = 0x1
331+instance MyTagTypeOffset (Multi2 k) where
332+ myTagTypeOffset _ = 0x2
334+instance MyTagTypeOffset Multi3 where
335+ myTagTypeOffset _ = 0x3
337+type family EntryContents request a where
338+ EntryContents request (Single a) = request a
339+ EntryContents request Multi = IntMap (RequesterData request)
340+ EntryContents request (Multi2 k) = Map (Some k) (IntMap (RequesterData request))
341+ EntryContents request Multi3 = IntMap (IntMap (RequesterData request))
343+newtype Entry request x = Entry { unEntry :: EntryContents request x }
345+{-# INLINE singleEntry #-}
346+singleEntry :: f a -> Entry f (Single a)
349+{-# INLINE multiEntry #-}
350+multiEntry :: IntMap (RequesterData f) -> Entry f Multi
353+{-# INLINE unMultiEntry #-}
354+unMultiEntry :: Entry f Multi -> IntMap (RequesterData f)
355+unMultiEntry = unEntry
357+-- | We use a hack here to pretend we have x ~ request a; we don't want to use a GADT, because GADTs (even with zero-size existential contexts) can't be newtypes
358+-- WARNING: This type should never be exposed. In particular, this is extremely unsound if a MyTag from one run of runRequesterT is ever compared against a MyTag from another
359+newtype MyTag x = MyTag Int deriving (Show, Eq, Ord, Enum)
361+newtype MyTagWrap (f :: * -> *) x = MyTagWrap Int deriving (Show, Eq, Ord, Enum)
363+{-# INLINE castMyTagWrap #-}
364+castMyTagWrap :: MyTagWrap f (Entry f x) -> MyTagWrap g (Entry g x)
365+castMyTagWrap = coerce
367+instance GEq MyTag where
368+ (MyTag a) `geq` (MyTag b) =
370+ then Just $ unsafeCoerce Refl
373+instance GCompare MyTag where
374+ (MyTag a) `gcompare` (MyTag b) =
375+ case a `compare` b of
377+ EQ -> unsafeCoerce GEQ
380+instance GEq (MyTagWrap f) where
381+ (MyTagWrap a) `geq` (MyTagWrap b) =
383+ then Just $ unsafeCoerce Refl
386+instance GCompare (MyTagWrap f) where
387+ (MyTagWrap a) `gcompare` (MyTagWrap b) =
388+ case a `compare` b of
390+ EQ -> unsafeCoerce GEQ
393+data RequesterState t (request :: * -> *) = RequesterState
394+ { _requesterState_nextMyTag :: {-# UNPACK #-} !Int -- Starts at -4 and goes down by 4 each time, to accommodate two 'type' bits at the bottom
395+ , _requesterState_requests :: ![(Int, Event t Any)]
398+-- | A basic implementation of 'Requester'.
399+newtype RequesterT t request (response :: * -> *) m a = RequesterT { unRequesterT :: StateT (RequesterState t request) (ReaderT (EventSelectorInt t Any) m) a }
400+ deriving (Functor, Applicative, Monad, MonadFix, MonadIO, MonadException
401+-- MonadAsyncException can't be derived on ghc-8.0.1; we use base-4.9.1 as a proxy for ghc-8.0.2
402+#if MIN_VERSION_base(4,9,1)
403+ , MonadAsyncException
408+-- | Run a 'RequesterT' action. The resulting 'Event' will fire whenever
409+-- requests are made, and responses should be provided in the input 'Event'.
410+-- The 'Tag' keys will be used to return the responses to the same place the
411+-- requests were issued.
412+runRequesterT :: (Reflex t, Monad m)
413+ => RequesterT t request response m a
414+ -> Event t (RequesterData response) --TODO: This DMap will be in reverse order, so we need to make sure the caller traverses it in reverse
415+ -> m (a, Event t (RequesterData request)) --TODO: we need to hide these 'MyTag's here, because they're unsafe to mix in the wild
416+runRequesterT (RequesterT a) responses = do
417+ (result, s) <- runReaderT (runStateT a $ RequesterState (-4) []) $ fanInt $
418+ coerceEvent responses
419+ return (result, fmapCheap (RequesterData . TagMap) $ mergeInt $ IntMap.fromDistinctAscList $ _requesterState_requests s)
421+-- | Map a function over the request and response of a 'RequesterT'
423+ :: (Reflex t, MonadFix m)
424+ => (forall x. req x -> req' x) -- ^ The function to map over the request
425+ -> (forall x. rsp' x -> rsp x) -- ^ The function to map over the response
426+ -> RequesterT t req rsp m a -- ^ The internal 'RequesterT' whose input and output will be transformed
427+ -> RequesterT t req' rsp' m a -- ^ The resulting 'RequesterT'
428+withRequesterT freq frsp child = do
429+ rec let rsp = fmap (runIdentity . traverseRequesterData (Identity . frsp)) rsp'
430+ (a, req) <- lift $ runRequesterT child rsp
431+ rsp' <- fmap (flip selectInt 0 . fanInt . fmapCheap unMultiEntry) $ requesting' $
432+ fmapCheap (multiEntry . IntMap.singleton 0) $ fmap (runIdentity . traverseRequesterData (Identity . freq)) req
435+instance (Reflex t, Monad m) => Requester t (RequesterT t request response m) where
436+ type Request (RequesterT t request response m) = request
437+ type Response (RequesterT t request response m) = response
438+ requesting = fmap coerceEvent . responseFromTag . castMyTagWrap <=< tagRequest . (coerceEvent :: Event t (request a) -> Event t (Entry request (Single a)))
439+ requesting_ = void . tagRequest . fmapCheap singleEntry
441+{-# INLINE tagRequest #-}
442+tagRequest :: forall m x t request response. (Monad m, MyTagTypeOffset x) => Event t (Entry request x) -> RequesterT t request response m (MyTagWrap request (Entry request x))
444+ old <- RequesterT get
445+ let n = _requesterState_nextMyTag old .|. myTagTypeOffset (Proxy :: Proxy x)
447+ RequesterT $ put $ RequesterState
448+ { _requesterState_nextMyTag = _requesterState_nextMyTag old - 0x4
449+ , _requesterState_requests = (n, (unsafeCoerce :: Event t (Entry request x) -> Event t Any) req) : _requesterState_requests old
453+{-# INLINE responseFromTag #-}
454+responseFromTag :: Monad m => MyTagWrap response (Entry response x) -> RequesterT t request response m (Event t (Entry response x))
455+responseFromTag (MyTagWrap t) = do
456+ responses :: EventSelectorInt t Any <- RequesterT ask
457+ return $ (unsafeCoerce :: Event t Any -> Event t (Entry response x)) $ selectInt responses t
459+instance MonadTrans (RequesterT t request response) where
460+ lift = RequesterT . lift . lift
462+instance PerformEvent t m => PerformEvent t (RequesterT t request response m) where
463+ type Performable (RequesterT t request response m) = Performable m
464+ performEvent_ = lift . performEvent_
465+ performEvent = lift . performEvent
467+instance MonadRef m => MonadRef (RequesterT t request response m) where
468+ type Ref (RequesterT t request response m) = Ref m
469+ newRef = lift . newRef
470+ readRef = lift . readRef
471+ writeRef r = lift . writeRef r
473+instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (RequesterT t request response m) where
474+ newEventWithTrigger = lift . newEventWithTrigger
475+ newFanEventWithTrigger f = lift $ newFanEventWithTrigger f
477+instance MonadReader r m => MonadReader r (RequesterT t request response m) where
479+ local f (RequesterT a) = RequesterT $ mapStateT (mapReaderT $ local f) a
480+ reader = lift . reader
482+instance (Reflex t, Adjustable t m, MonadHold t m, MonadFix m) => Adjustable t (RequesterT t request response m) where
483+ runWithReplace = runWithReplaceRequesterTWith $ \dm0 dm' -> lift $ runWithReplace dm0 dm'
484+ traverseIntMapWithKeyWithAdjust = traverseIntMapWithKeyWithAdjustRequesterTWith (\f dm0 dm' -> lift $ traverseIntMapWithKeyWithAdjust f dm0 dm') patchIntMapNewElementsMap mergeIntIncremental
485+ {-# INLINABLE traverseDMapWithKeyWithAdjust #-}
486+ traverseDMapWithKeyWithAdjust = traverseDMapWithKeyWithAdjustRequesterTWith (\f dm0 dm' -> lift $ traverseDMapWithKeyWithAdjust f dm0 dm') mapPatchDMap weakenPatchDMapWith patchMapNewElementsMap mergeMapIncremental
487+ traverseDMapWithKeyWithAdjustWithMove = traverseDMapWithKeyWithAdjustRequesterTWith (\f dm0 dm' -> lift $ traverseDMapWithKeyWithAdjustWithMove f dm0 dm') mapPatchDMapWithMove weakenPatchDMapWithMoveWith patchMapWithMoveNewElementsMap mergeMapIncrementalWithMove
489+requesting' :: (MyTagTypeOffset x, Monad m) => Event t (Entry request x) -> RequesterT t request response m (Event t (Entry response x))
490+requesting' = responseFromTag . castMyTagWrap <=< tagRequest
492+{-# INLINABLE runWithReplaceRequesterTWith #-}
493+runWithReplaceRequesterTWith :: forall m t request response a b. (Reflex t, MonadHold t m
496+ => (forall a' b'. m a' -> Event t (m b') -> RequesterT t request response m (a', Event t b'))
497+ -> RequesterT t request response m a
498+ -> Event t (RequesterT t request response m b)
499+ -> RequesterT t request response m (a, Event t b)
500+runWithReplaceRequesterTWith f a0 a' = do
501+ rec na' <- numberOccurrencesFrom 1 a'
502+ responses <- fmap (fmapCheap unMultiEntry) $ requesting' $ fmapCheap multiEntry $ switchPromptlyDyn requests --TODO: Investigate whether we can really get rid of the prompt stuff here
503+ let responses' = fanInt responses
504+ ((result0, requests0), v') <- f (runRequesterT a0 (selectInt responses' 0)) $ fmapCheap (\(n, a) -> fmap ((,) n) $ runRequesterT a $ selectInt responses' n) na'
505+ requests <- holdDyn (fmapCheap (IntMap.singleton 0) requests0) $ fmapCheap (\(n, (_, reqs)) -> fmapCheap (IntMap.singleton n) reqs) v'
506+ return (result0, fmapCheap (fst . snd) v')
508+{-# INLINE traverseIntMapWithKeyWithAdjustRequesterTWith #-}
509+traverseIntMapWithKeyWithAdjustRequesterTWith :: forall t request response m v v' p.
512+ , PatchTarget (p (Event t (IntMap (RequesterData request)))) ~ IntMap (Event t (IntMap (RequesterData request)))
513+ , Patch (p (Event t (IntMap (RequesterData request))))
517+ => ( (IntMap.Key -> (IntMap.Key, v) -> m (Event t (IntMap (RequesterData request)), v'))
518+ -> IntMap (IntMap.Key, v)
519+ -> Event t (p (IntMap.Key, v))
520+ -> RequesterT t request response m (IntMap (Event t (IntMap (RequesterData request)), v'), Event t (p (Event t (IntMap (RequesterData request)), v')))
522+ -> (p (Event t (IntMap (RequesterData request))) -> IntMap (Event t (IntMap (RequesterData request))))
523+ -> (Incremental t (p (Event t (IntMap (RequesterData request)))) -> Event t (IntMap (IntMap (RequesterData request))))
524+ -> (IntMap.Key -> v -> RequesterT t request response m v')
527+ -> RequesterT t request response m (IntMap v', Event t (p v'))
528+traverseIntMapWithKeyWithAdjustRequesterTWith base patchNewElements mergePatchIncremental f dm0 dm' = do
529+ rec response <- requesting' $ fmapCheap pack $ promptRequests `mappend` mergePatchIncremental requests --TODO: Investigate whether we can really get rid of the prompt stuff here
530+ let responses :: EventSelectorInt t (IntMap (RequesterData response))
531+ responses = fanInt $ fmapCheap unpack response
532+ unpack :: Entry response Multi3 -> IntMap (IntMap (RequesterData response))
534+ pack :: IntMap (IntMap (RequesterData request)) -> Entry request Multi3
536+ f' :: IntMap.Key -> (Int, v) -> m (Event t (IntMap (RequesterData request)), v')
538+ (result, myRequests) <- runRequesterT (f k v) $ mapMaybeCheap (IntMap.lookup n) $ selectInt responses k --TODO: Instead of doing mapMaybeCheap, can we share a fanInt across all instances of a given key, or at least the ones that are adjacent in time?
539+ return (fmapCheap (IntMap.singleton n) myRequests, result)
540+ ndm' <- numberOccurrencesFrom 1 dm'
541+ (children0, children') <- base f' (fmap ((,) 0) dm0) $ fmap (\(n, dm) -> fmap ((,) n) dm) ndm' --TODO: Avoid this somehow, probably by adding some sort of per-cohort information passing to Adjustable
542+ let result0 = fmap snd children0
543+ result' = fforCheap children' $ fmap snd
544+ requests0 :: IntMap (Event t (IntMap (RequesterData request)))
545+ requests0 = fmap fst children0
546+ requests' :: Event t (p (Event t (IntMap (RequesterData request))))
547+ requests' = fforCheap children' $ fmap fst
548+ promptRequests :: Event t (IntMap (IntMap (RequesterData request)))
549+ promptRequests = coincidence $ fmapCheap (mergeInt . patchNewElements) requests' --TODO: Create a mergeIncrementalPromptly, and use that to eliminate this 'coincidence'
550+ requests <- holdIncremental requests0 requests'
551+ return (result0, result')
553+{-# INLINE traverseDMapWithKeyWithAdjustRequesterTWith #-}
554+traverseDMapWithKeyWithAdjustRequesterTWith :: forall k t request response m v v' p p'.
558+ , PatchTarget (p' (Some k) (Event t (IntMap (RequesterData request)))) ~ Map (Some k) (Event t (IntMap (RequesterData request)))
559+ , Patch (p' (Some k) (Event t (IntMap (RequesterData request))))
562+ => (forall k' v1 v2. GCompare k'
563+ => (forall a. k' a -> v1 a -> m (v2 a))
565+ -> Event t (p k' v1)
566+ -> RequesterT t request response m (DMap k' v2, Event t (p k' v2))
568+ -> (forall v1 v2. (forall a. v1 a -> v2 a) -> p k v1 -> p k v2)
569+ -> (forall v1 v2. (forall a. v1 a -> v2) -> p k v1 -> p' (Some k) v2)
570+ -> (forall v2. p' (Some k) v2 -> Map (Some k) v2)
571+ -> (forall a. Incremental t (p' (Some k) (Event t a)) -> Event t (Map (Some k) a))
572+ -> (forall a. k a -> v a -> RequesterT t request response m (v' a))
575+ -> RequesterT t request response m (DMap k v', Event t (p k v'))
576+traverseDMapWithKeyWithAdjustRequesterTWith base mapPatch weakenPatchWith patchNewElements mergePatchIncremental f dm0 dm' = do
577+ rec response <- requesting' $ fmapCheap pack $ promptRequests `mappend` mergePatchIncremental requests --TODO: Investigate whether we can really get rid of the prompt stuff here
578+ let responses :: EventSelector t (Const2 (Some k) (IntMap (RequesterData response)))
579+ responses = fanMap $ fmapCheap unpack response
580+ unpack :: Entry response (Multi2 k) -> Map (Some k) (IntMap (RequesterData response))
582+ pack :: Map (Some k) (IntMap (RequesterData request)) -> Entry request (Multi2 k)
584+ f' :: forall a. k a -> Compose ((,) Int) v a -> m (Compose ((,) (Event t (IntMap (RequesterData request)))) v' a)
585+ f' k (Compose (n, v)) = do
586+ (result, myRequests) <- runRequesterT (f k v) $ mapMaybeCheap (IntMap.lookup n) $ select responses (Const2 (Some k))
587+ return $ Compose (fmapCheap (IntMap.singleton n) myRequests, result)
588+ ndm' <- numberOccurrencesFrom 1 dm'
589+ (children0, children') <- base f' (DMap.map (\v -> Compose (0, v)) dm0) $ fmap (\(n, dm) -> mapPatch (\v -> Compose (n, v)) dm) ndm'
590+ let result0 = DMap.map (snd . getCompose) children0
591+ result' = fforCheap children' $ mapPatch $ snd . getCompose
592+ requests0 :: Map (Some k) (Event t (IntMap (RequesterData request)))
593+ requests0 = weakenDMapWith (fst . getCompose) children0
594+ requests' :: Event t (p' (Some k) (Event t (IntMap (RequesterData request))))
595+ requests' = fforCheap children' $ weakenPatchWith $ fst . getCompose
596+ promptRequests :: Event t (Map (Some k) (IntMap (RequesterData request)))
597+ promptRequests = coincidence $ fmapCheap (mergeMap . patchNewElements) requests' --TODO: Create a mergeIncrementalPromptly, and use that to eliminate this 'coincidence'
598+ requests <- holdIncremental requests0 requests'
599+ return (result0, result')
601+data Decoder rawResponse response =
602+ forall a. Decoder (RequesterDataKey a) (rawResponse -> response a)
604+-- | Matches incoming responses with previously-sent requests
605+-- and uses the provided request "decoder" function to process
606+-- incoming responses.
607+matchResponsesWithRequests
608+ :: forall t rawRequest rawResponse request response m.
613+ => (forall a. request a -> (rawRequest, rawResponse -> response a))
614+ -- ^ Given a request (from 'Requester'), produces the wire format of the
615+ -- request and a function used to process the associated response
616+ -> Event t (RequesterData request)
617+ -- ^ The outgoing requests
618+ -> Event t (Int, rawResponse)
619+ -- ^ The incoming responses, tagged by an identifying key
620+ -> m ( Event t (Map Int rawRequest)
621+ , Event t (RequesterData response)
623+ -- ^ A map of outgoing wire-format requests and an event of responses keyed
624+ -- by the 'RequesterData' key of the associated outgoing request
625+matchResponsesWithRequests f send recv = do
626+ rec nextId <- hold 1 $ fmap (\(next, _, _) -> next) outgoing
627+ waitingFor :: Incremental t (PatchMap Int (Decoder rawResponse response)) <-
628+ holdIncremental mempty $ leftmost
629+ [ fmap (\(_, outstanding, _) -> outstanding) outgoing
632+ let outgoing = processOutgoing nextId send
633+ incoming = processIncoming waitingFor recv
634+ return (fmap (\(_, _, rawReqs) -> rawReqs) outgoing, fst <$> incoming)
636+ -- Tags each outgoing request with an identifying integer key
637+ -- and returns the next available key, a map of response decoders
638+ -- for requests for which there are outstanding responses, and the
639+ -- raw requests to be sent out.
642+ -- The next available key
643+ -> Event t (RequesterData request)
644+ -- The outgoing request
646+ , PatchMap Int (Decoder rawResponse response)
647+ , Map Int rawRequest )
648+ -- The new next-available-key, a map of requests expecting responses, and the tagged raw requests
649+ processOutgoing nextId out = flip pushAlways out $ \dm -> do
650+ oldNextId <- sample nextId
651+ let (result, newNextId) = flip runState oldNextId $ forM (requesterDataToList dm) $ \(k :=> v) -> do
654+ let (rawReq, rspF) = f v
655+ return (n, rawReq, Decoder k rspF)
656+ patchWaitingFor = PatchMap $ Map.fromList $
657+ (\(n, _, dec) -> (n, Just dec)) <$> result
658+ toSend = Map.fromList $ (\(n, rawReq, _) -> (n, rawReq)) <$> result
659+ return (newNextId, patchWaitingFor, toSend)
660+ -- Looks up the each incoming raw response in a map of response
661+ -- decoders and returns the decoded response and a patch that can
662+ -- be used to clear the ID of the consumed response out of the queue
663+ -- of expected responses.
665+ :: Incremental t (PatchMap Int (Decoder rawResponse response))
666+ -- A map of outstanding expected responses
667+ -> Event t (Int, rawResponse)
668+ -- A incoming response paired with its identifying key
669+ -> Event t (RequesterData response, PatchMap Int v)
670+ -- The decoded response and a patch that clears the outstanding responses queue
671+ processIncoming waitingFor inc = flip push inc $ \(n, rawRsp) -> do
672+ wf <- sample $ currentIncremental waitingFor
673+ case Map.lookup n wf of
674+ Nothing -> return Nothing -- TODO How should lookup failures be handled here? They shouldn't ever happen..
675+ Just (Decoder k rspF) -> do
676+ let rsp = rspF rawRsp
678+ ( singletonRequesterData k rsp
679+ , PatchMap $ Map.singleton n Nothing