@@ -2,77 +2,132 @@
22{-# LANGUAGE CPP #-}
33{-# LANGUAGE ConstraintKinds #-}
44{-# LANGUAGE EmptyDataDecls #-}
5+{-# LANGUAGE ExistentialQuantification #-}
56{-# LANGUAGE FlexibleContexts #-}
67{-# LANGUAGE FlexibleInstances #-}
78{-# LANGUAGE FunctionalDependencies #-}
89{-# LANGUAGE GADTs #-}
910{-# LANGUAGE GeneralizedNewtypeDeriving #-}
1011{-# LANGUAGE LambdaCase #-}
11−{-# LANGUAGE MagicHash #-}
12−{-# LANGUAGE MultiParamTypeClasses #-}
13−{-# LANGUAGE MultiWayIf #-}
1412{-# LANGUAGE RankNTypes #-}
1513{-# LANGUAGE RoleAnnotations #-}
1614{-# LANGUAGE ScopedTypeVariables #-}
1715{-# LANGUAGE TypeFamilies #-}
1816{-# LANGUAGE TypeOperators #-}
1917{-# LANGUAGE UndecidableInstances #-}
18+{-# LANGUAGE PolyKinds #-}
19+{-# LANGUAGE DeriveFunctor #-}
20+{-# LANGUAGE StandaloneDeriving #-}
21+{-# LANGUAGE InstanceSigs #-}
22+{-# LANGUAGE MultiWayIf #-}
23+
24+#ifdef USE_REFLEX_OPTIMIZER
25+{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
26+#endif
27+{-# OPTIONS_GHC -Wunused-binds #-}
2028-- | This module is the implementation of the 'Spider' 'Reflex' engine. It uses
2129-- a graph traversal algorithm to propagate 'Event's and 'Behavior's.
22−module Reflex.Spider.Internal where
30+module Reflex.Spider.Internal (module Reflex.Spider.Internal) where
2331
24−import Control.Applicative
32+#if MIN_VERSION_base(4,10,0)
33+import Control.Applicative (liftA2)
34+#endif
2535import Control.Concurrent
2636import Control.Exception
27−import Control.Monad hiding (forM, forM_, mapM, mapM_, sequence)
37+import Control.Monad hiding (forM, forM_, mapM, mapM_)
2838import Control.Monad.Exception
29−import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_, sequence)
39+import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_)
3040import Control.Monad.Primitive
31−import Control.Monad.Reader hiding (forM, forM_, mapM, mapM_, sequence)
41+import Control.Monad.Reader.Class
42+import Control.Monad.IO.Class
43+import Control.Monad.ReaderIO
3244import Control.Monad.Ref
45+import Control.Monad.Fail (MonadFail)
46+import qualified Control.Monad.Fail as MonadFail
3347import Data.Align
3448import Data.Coerce
35−import Data.Dependent.Map (DMap, DSum (..))
49+import Data.Dependent.Map (DMap)
3650import qualified Data.Dependent.Map as DMap
51+import Data.Dependent.Sum (DSum (..))
52+import Data.FastMutableIntMap (FastMutableIntMap, PatchIntMap (..))
53+import qualified Data.FastMutableIntMap as FastMutableIntMap
3754import Data.Foldable hiding (concat, elem, sequence_)
38−import Data.Function
3955import Data.Functor.Constant
56+import Data.Functor.Misc
4057import Data.Functor.Product
4158import Data.GADT.Compare
4259import Data.IntMap.Strict (IntMap)
4360import qualified Data.IntMap.Strict as IntMap
4461import Data.IORef
45−import Data.List hiding (foldl')
46−import Data.Maybe
47−import Data.Monoid ((<>))
48−import Data.Some (Some)
49−import qualified Data.Some as Some
62+import Data.Kind (Type)
63+import Data.Maybe hiding (mapMaybe)
64+import Data.Monoid (mempty, (<>))
65+import Data.Proxy
5066import Data.These
5167import Data.Traversable
52−import Data.Type.Coercion
53−import Data.Word
54−import GHC.Exts
68+import Data.Type.Equality ((:~:)(Refl))
69+import Data.Witherable (Filterable, mapMaybe)
70+import GHC.Exts hiding (toList)
5571import GHC.IORef (IORef (..))
5672import GHC.Stack
73+import Reflex.FastWeak
5774import System.IO.Unsafe
5875import System.Mem.Weak
5976import Unsafe.Coerce
6077
78+#ifdef MIN_VERSION_semialign
79+#if MIN_VERSION_these(0,8,0)
80+import Data.These.Combinators (justThese)
81+#endif
82+#if MIN_VERSION_semialign(1,1,0)
83+import Data.Zip (Zip (..))
84+#endif
85+#endif
86+
6187#ifdef DEBUG_CYCLES
6288import Control.Monad.State hiding (forM, forM_, mapM, mapM_, sequence)
89+#endif
90+
6391import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
6492import qualified Data.List.NonEmpty as NonEmpty
65−import Data.Monoid (mempty)
6693import Data.Tree (Forest, Tree (..), drawForest)
67−#endif
94+import Data.List (isPrefixOf)
95+
96+import Data.FastWeakBag (FastWeakBag, FastWeakBagTicket)
97+import qualified Data.FastWeakBag as FastWeakBag
6898
69−import Data.WeakBag (WeakBag, WeakBagTicket)
99+import Data.Reflection
100+import Data.Some (Some(Some))
101+import Data.Type.Coercion
102+import Data.Profunctor.Unsafe ((#.), (.#))
103+import Data.WeakBag (WeakBag, WeakBagTicket, _weakBag_children)
70104import qualified Data.WeakBag as WeakBag
105+import qualified Reflex.Class
71106import qualified Reflex.Class as R
72−import qualified Reflex.Host.Class as R
107+import qualified Reflex.Host.Class
108+import Reflex.NotReady.Class
109+import Data.Patch
110+import qualified Data.Patch.DMapWithMove as PatchDMapWithMove
111+import Reflex.PerformEvent.Base (PerformEventT)
112+
113+#ifdef DEBUG_TRACE_EVENTS
114+import qualified Data.ByteString.Char8 as BS8
115+import System.IO (stderr)
116+import Data.List (isPrefixOf)
117+#endif
73118
74−-- Note: must come last to silence warnings due to AMP on GHC < 7.10
75−import Prelude hiding (any, concat, mapM, mapM_, sequence)
119+-- TODO stdout might not be the best channel for debug output
120+debugStrLn :: String -> IO ()
121+debugStrLn = putStrLn
122+
123+#ifdef DEBUG_TRACE_EVENTS
124+withStackOneLine :: (BS8.ByteString -> a) -> a
125+withStackOneLine expr = unsafePerformIO $ do
126+ stack <- currentCallStack
127+ return (expr . BS8.pack . unwords . dropInternal . reverse $ stack)
128+ where dropInternal = filterStack "Reflex.Spider.Internal"
129+
130+#endif
76131
77132debugPropagate :: Bool
78133
@@ -81,28 +136,42 @@ debugInvalidateHeight :: Bool
81136debugInvalidate :: Bool
82137
83138#ifdef DEBUG
84−
85139#define DEBUG_NODEIDS
86140
141+#ifdef DEBUG_TRACE_PROPAGATION
87142debugPropagate = True
143+#else
144+debugPropagate = False
145+#endif
88146
147+#ifdef DEBUG_TRACE_HEIGHT
148+debugInvalidateHeight = True
149+#else
89150debugInvalidateHeight = False
151+#endif
90152
153+#ifdef DEBUG_TRACE_INVALIDATION
91154debugInvalidate = True
155+#else
156+debugInvalidate = False
157+#endif
92158
93159class HasNodeId a where
94160 getNodeId :: a -> Int
95161
96−instance HasNodeId (Hold x p a) where
97− getNodeId = holdNodeId
162+instance HasNodeId (CacheSubscribed x a) where
163+ getNodeId = _cacheSubscribed_nodeId
164+
165+instance HasNodeId (FanInt x a) where
166+ getNodeId = _fanInt_nodeId
98167
99−instance HasNodeId (PushSubscribed x a b) where
100− getNodeId = pushSubscribedNodeId
168+instance HasNodeId (Hold x p) where
169+ getNodeId = holdNodeId
101170
102171instance HasNodeId (SwitchSubscribed x a) where
103172 getNodeId = switchSubscribedNodeId
104173
105−instance HasNodeId (FanSubscribed x a) where
174+instance HasNodeId (FanSubscribed x v a) where
106175 getNodeId = fanSubscribedNodeId
107176
108177instance HasNodeId (CoincidenceSubscribed x a) where
@@ -116,41 +185,16 @@ instance HasNodeId (Pull x a) where
116185
117186{-# INLINE showNodeId #-}
118187showNodeId :: HasNodeId a => a -> String
119−showNodeId = ("#"<>) . show . getNodeId
120−
121−showSubscriberType :: Subscriber x a -> String
122−showSubscriberType = \case
123− SubscriberPush _ _ -> "SubscriberPush"
124− SubscriberMerge _ _ -> "SubscriberMerge"
125− SubscriberFan _ -> "SubscriberFan"
126− SubscriberMergeChange _ -> "SubscriberMergeChange"
127− SubscriberHold _ -> "SubscriberHold"
128− SubscriberHoldIdentity _ -> "SubscriberHoldIdentity"
129− SubscriberSwitch _ -> "SubscriberSwitch"
130− SubscriberCoincidenceOuter _ -> "SubscriberCoincidenceOuter"
131− SubscriberCoincidenceInner _ -> "SubscriberCoincidenceInner"
132− SubscriberHandle -> "SubscriberHandle"
133−
134−showEventType :: Event x a -> String
135−showEventType = \case
136− EventRoot _ _ -> "EventRoot"
137− EventNever -> "EventNever"
138− EventPush _ -> "EventPush"
139− EventMerge _ -> "EventMerge"
140− EventFan _ _ -> "EventFan"
141− EventSwitch _ -> "EventSwitch"
142− EventCoincidence _ -> "EventCoincidence"
143− EventHold _ -> "EventHold"
144− EventDyn _ -> "EventDyn"
145− EventHoldIdentity _ -> "EventHoldIdentity"
146− EventDynIdentity _ -> "EventDynIdentity"
188+showNodeId = showNodeId' . getNodeId
189+
190+showNodeId' :: Int -> String
191+showNodeId' = ("#"<>) . show
192+
147193
148194#else
149195
150196debugPropagate = False
151−
152197debugInvalidateHeight = False
153−
154198debugInvalidate = False
155199
156200-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
@@ -158,6 +202,10 @@ debugInvalidate = False
158202showNodeId :: a -> String
159203showNodeId _ = ""
160204
205+{-# INLINE showNodeId' #-}
206+showNodeId' :: Int -> String
207+showNodeId' _ = ""
208+
161209#endif
162210
163211#ifdef DEBUG_NODEIDS
@@ -167,93 +215,200 @@ nextNodeIdRef = unsafePerformIO $ newIORef 1
167215
168216newNodeId :: IO Int
169217newNodeId = atomicModifyIORef' nextNodeIdRef $ \n -> (succ n, n)
170−
171−{-# NOINLINE unsafeNodeId #-}
172−unsafeNodeId :: a -> Int
173−unsafeNodeId a = unsafePerformIO $ do
174− touch a
175− newNodeId
176218#endif
177219
220+--------------------------------------------------------------------------------
221+-- EventSubscription
222+--------------------------------------------------------------------------------
223+
224+--NB: Once you subscribe to an Event, you must always hold on the the WHOLE EventSubscription you get back
225+-- If you do not retain the subscription, you may be prematurely unsubscribed from the parent event.
226+data EventSubscription x = EventSubscription
227+ { _eventSubscription_unsubscribe :: !(IO ())
228+ , _eventSubscription_subscribed :: {-# UNPACK #-} !(EventSubscribed x)
229+ }
230+
231+unsubscribe :: EventSubscription x -> IO ()
232+unsubscribe (EventSubscription u _) = u
233+
178234--------------------------------------------------------------------------------
179235-- Event
180236--------------------------------------------------------------------------------
181237
182−newtype Event x a = Event { subscribeAndRead :: Subscriber x a -> EventM x (EventSubscription x, Maybe a) }
238+newtype Event x a = Event { unEvent :: Subscriber x a -> EventM x (EventSubscription x, Maybe a) }
239+
240+{-# INLINE subscribeAndRead #-}
241+subscribeAndRead :: Event x a -> Subscriber x a -> EventM x (EventSubscription x, Maybe a)
242+subscribeAndRead = unEvent
243+
244+{-# RULES
245+"cacheEvent/cacheEvent" forall e. cacheEvent (cacheEvent e) = cacheEvent e
246+"cacheEvent/pushCheap" forall f e. pushCheap f (cacheEvent e) = cacheEvent (pushCheap f e)
247+"hold/cacheEvent" forall f e. hold f (cacheEvent e) = hold f e
248+ #-}
183249
184250-- | Construct an 'Event' equivalent to that constructed by 'push', but with no
185251-- caching; if the computation function is very cheap, this is (much) more
186252-- efficient than 'push'
187−{-# INLINABLE pushCheap #-}
188−pushCheap :: (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
189−pushCheap f e = Event $ \sub -> do
190− (subscription, occ) <- subscribeAndRead e $ sub
253+{-# INLINE [1] pushCheap #-}
254+pushCheap :: HasSpiderTimeline x => (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
255+pushCheap !f e = Event $ \sub -> do
256+ (subscription, occ) <- subscribeAndRead e $ debugSubscriber' "push" $ sub
191257 { subscriberPropagate = \a -> do
192− mb <- runComputeM $ f a
258+ mb <- f a
193259 mapM_ (subscriberPropagate sub) mb
194260 }
195− occ' <- join <$> mapM (runComputeM . f) occ
261+ occ' <- join <$> mapM f occ
196262 return (subscription, occ')
197263
264+-- | A subscriber that never triggers other 'Event's
265+{-# INLINE terminalSubscriber #-}
266+terminalSubscriber :: (a -> EventM x ()) -> Subscriber x a
267+terminalSubscriber p = Subscriber
268+ { subscriberPropagate = p
269+ , subscriberInvalidateHeight = \_ -> return ()
270+ , subscriberRecalculateHeight = \_ -> return ()
271+ }
272+
273+-- | Subscribe to an Event only for the duration of one occurrence
274+{-# INLINE subscribeAndReadHead #-}
275+subscribeAndReadHead :: HasSpiderTimeline x => Event x a -> Subscriber x a -> EventM x (EventSubscription x, Maybe a)
276+subscribeAndReadHead e sub = do
277+ subscriptionRef <- liftIO $ newIORef $ error "subscribeAndReadHead: not initialized"
278+ (subscription, occ) <- subscribeAndRead e $ debugSubscriber' "head" $ sub
279+ { subscriberPropagate = \a -> do
280+ liftIO $ unsubscribe =<< readIORef subscriptionRef
281+ subscriberPropagate sub a
282+ }
283+ liftIO $ case occ of
284+ Nothing -> writeIORef subscriptionRef $! subscription
285+ Just _ -> unsubscribe subscription
286+ return (subscription, occ)
287+
288+--TODO: Make this lazy in its input event
289+headE :: (MonadIO m, Defer (SomeMergeInit x) m, HasSpiderTimeline x) => Event x a -> m (Event x a)
290+headE originalE = do
291+ parent <- liftIO $ newIORef $ Just originalE
292+ defer $ SomeMergeInit $ do --TODO: Rename SomeMergeInit appropriately
293+ let clearParent = liftIO $ writeIORef parent Nothing
294+ (_, occ) <- subscribeAndReadHead originalE $ terminalSubscriber $ const clearParent
295+ when (isJust occ) clearParent
296+ return $ Event $ \sub ->
297+ liftIO (readIORef parent) >>= \case
298+ Nothing -> subscribeAndReadNever
299+ Just e -> subscribeAndReadHead e sub
300+
198301data CacheSubscribed x a
199− = CacheSubscribed { _cacheSubscribed_subscribers :: {-# UNPACK #-} !(WeakBag (Subscriber x a))
200− , _cacheSubscribed_weakSelf :: {-# UNPACK #-} !(IORef (Weak (CacheSubscribed x a)))
302+ = CacheSubscribed { _cacheSubscribed_subscribers :: {-# UNPACK #-} !(FastWeakBag (Subscriber x a))
201303 , _cacheSubscribed_parent :: {-# UNPACK #-} !(EventSubscription x)
202− , _cacheSubscribed_cached :: {-# UNPACK #-} !(IORef (Maybe (CacheSubscribed x a)))
203304 , _cacheSubscribed_occurrence :: {-# UNPACK #-} !(IORef (Maybe a))
305+#ifdef DEBUG_NODEIDS
306+ , _cacheSubscribed_nodeId :: {-# UNPACK #-} !Int
307+#endif
204308 }
205309
310+nowSpiderEventM :: (HasSpiderTimeline x) => EventM x (R.Event (SpiderTimeline x) ())
311+nowSpiderEventM =
312+ SpiderEvent <$> now
313+
314+now :: (MonadIO m, Defer (Some Clear) m, HasSpiderTimeline x
315+ ) => m (Event x ())
316+now = do
317+ nowOrNot <- liftIO $ newIORef $ Just ()
318+ scheduleClear nowOrNot
319+ return . Event $ \_ -> do
320+ occ <- liftIO . readIORef $ nowOrNot
321+ return ( EventSubscription (return ()) eventSubscribedNow
322+ , occ
323+ )
324+
206325-- | Construct an 'Event' whose value is guaranteed not to be recomputed
207326-- repeatedly
208327--
209328--TODO: Try a caching strategy where we subscribe directly to the parent when
210−--there's only one subscriber, and then build our own WeakBag only when a second
329+--there's only one subscriber, and then build our own FastWeakBag only when a second
211330--subscriber joins
212−{-# INLINABLE cacheEvent #-}
213−cacheEvent :: Event x a -> Event x a
214−cacheEvent e = Event $ \sub -> do
215− let !mSubscribedRef = unsafeNewIORef e Nothing
216− mSubscribed <- liftIO $ readIORef mSubscribedRef
217− case mSubscribed of
218− Just subscribed -> liftIO $ do
219− ticket <- WeakBag.insert sub (_cacheSubscribed_subscribers subscribed) (_cacheSubscribed_weakSelf subscribed) cleanupCacheSubscribed
220− occ <- readIORef $ _cacheSubscribed_occurrence subscribed
221− let es = EventSubscribed
222− { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ _cacheSubscribed_parent subscribed
223− , eventSubscribedRetained = toAny subscribed
224− }
225− return (EventSubscription (WeakBag.remove ticket >> touch ticket) es, occ)
226− Nothing -> do
227− weakSelf <- liftIO $ newIORef $ error "cacheEvent: weakSelf not yet intialized"
228− (subscribers, ticket) <- liftIO $ WeakBag.singleton sub weakSelf cleanupCacheSubscribed
229− occRef <- liftIO $ newIORef undefined
230− (parentSub, occ) <- subscribeAndRead e $ Subscriber
231− { subscriberPropagate = \a -> do
232− liftIO $ writeIORef occRef $ Just a
233− scheduleClear occRef
234− propagate a subscribers
235− , subscriberInvalidateHeight = \old -> do
236− WeakBag.traverse subscribers $ invalidateSubscriberHeight old
237− , subscriberRecalculateHeight = \new -> do
238− WeakBag.traverse subscribers $ recalculateSubscriberHeight new
331+{-# NOINLINE [0] cacheEvent #-}
332+cacheEvent :: forall x a. HasSpiderTimeline x => Event x a -> Event x a
333+cacheEvent e =
334+#ifdef DEBUG_TRACE_EVENTS
335+ withStackOneLine $ \callSite -> Event $
336+#else
337+ Event $
338+#endif
339+ unsafePerformIO $ do
340+ mSubscribedRef :: IORef (FastWeak (CacheSubscribed x a))
341+ <- newIORef emptyFastWeak
342+ pure $ \sub -> {-# SCC "cacheEvent" #-} do
343+#ifdef DEBUG_TRACE_EVENTS
344+ unless (BS8.null callSite) $ liftIO $ BS8.hPutStrLn stderr callSite
345+#endif
346+ subscribedTicket <- liftIO (readIORef mSubscribedRef >>= getFastWeakTicket) >>= \case
347+ Just subscribedTicket -> return subscribedTicket
348+ Nothing -> do
349+#ifdef DEBUG_NODEIDS
350+ nodeId <- liftIO newNodeId
351+#endif
352+ subscribers <- liftIO FastWeakBag.empty
353+ occRef <- liftIO $ newIORef Nothing -- This should never be read prior to being set below
354+#ifdef DEBUG_NODEIDS
355+ (parentSub, occ) <- subscribeAndRead e $ debugSubscriber' ("cacheEvent" <> showNodeId' nodeId) $ Subscriber
356+#else
357+ (parentSub, occ) <- subscribeAndRead e $ Subscriber
358+#endif
359+ { subscriberPropagate = \a -> do
360+ liftIO $ writeIORef occRef (Just a)
361+ scheduleClear occRef
362+ propagateFast a subscribers
363+ , subscriberInvalidateHeight = FastWeakBag.traverse_ subscribers . invalidateSubscriberHeight
364+ , subscriberRecalculateHeight = FastWeakBag.traverse_ subscribers . recalculateSubscriberHeight
365+ }
366+ when (isJust occ) $ do
367+ liftIO $ writeIORef occRef occ -- Set the initial value of occRef; we don't need to do this if occ is Nothing
368+ scheduleClear occRef
369+ let !subscribed = CacheSubscribed
370+ { _cacheSubscribed_subscribers = subscribers
371+ , _cacheSubscribed_parent = parentSub
372+ , _cacheSubscribed_occurrence = occRef
373+#ifdef DEBUG_NODEIDS
374+ , _cacheSubscribed_nodeId = nodeId
375+#endif
376+ }
377+ subscribedTicket <- liftIO $ mkFastWeakTicket subscribed
378+ liftIO $ writeIORef mSubscribedRef =<< getFastWeakTicketWeak subscribedTicket
379+ return subscribedTicket
380+ liftIO $ cacheSubscription sub mSubscribedRef subscribedTicket
381+
382+cacheSubscription :: Subscriber x a -> IORef (FastWeak (CacheSubscribed x a))
383+ -> FastWeakTicket (CacheSubscribed x a) -> IO (EventSubscription x, Maybe a)
384+cacheSubscription sub mSubscribedRef subscribedTicket = do
385+ subscribed <- getFastWeakTicketValue subscribedTicket
386+ ticket <- FastWeakBag.insert sub $ _cacheSubscribed_subscribers subscribed
387+ occ <- readIORef $ _cacheSubscribed_occurrence subscribed
388+
389+ let parentSub = _cacheSubscribed_parent subscribed
390+ es = EventSubscription
391+ { _eventSubscription_unsubscribe = do
392+ FastWeakBag.remove ticket
393+
394+ isEmpty <- FastWeakBag.isEmpty $ _cacheSubscribed_subscribers subscribed
395+ when isEmpty $ do
396+ writeIORef mSubscribedRef emptyFastWeak
397+ unsubscribe parentSub
398+ touch ticket
399+ touch subscribedTicket
400+ , _eventSubscription_subscribed = EventSubscribed
401+ { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed parentSub
402+ , eventSubscribedRetained = toAny subscribedTicket
403+#ifdef DEBUG_CYCLES
404+ , eventSubscribedGetParents = return [_eventSubscription_subscribed parentSub]
405+ , eventSubscribedHasOwnHeightRef = False
406+ , eventSubscribedWhoCreated = whoCreatedIORef mSubscribedRef
407+#endif
408+ }
239409 }
240− liftIO $ writeIORef occRef occ
241− when (isJust occ) $ scheduleClear occRef
242− let !subscribed = CacheSubscribed
243− { _cacheSubscribed_subscribers = subscribers
244− , _cacheSubscribed_weakSelf = weakSelf
245− , _cacheSubscribed_parent = parentSub
246− , _cacheSubscribed_cached = mSubscribedRef
247− , _cacheSubscribed_occurrence = occRef
248− }
249− liftIO $ writeIORef mSubscribedRef $ Just subscribed
250− liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "PushSubscribed"
251− return (EventSubscription (WeakBag.remove ticket >> touch ticket) (EventSubscribed (eventSubscribedHeightRef $ _eventSubscription_subscribed parentSub) (toAny subscribed)), occ)
410+ return (es, occ)
252411
253−cleanupCacheSubscribed :: CacheSubscribed x a -> IO ()
254−cleanupCacheSubscribed self = do
255− unsubscribe $ _cacheSubscribed_parent self
256− writeIORef (_cacheSubscribed_cached self) Nothing
257412
258413subscribe :: Event x a -> Subscriber x a -> EventM x (EventSubscription x)
259414subscribe e s = fst <$> subscribeAndRead e s
@@ -265,29 +420,32 @@ wrap tag getSpecificSubscribed sub = do
265420 let es = tag subd
266421 return (EventSubscription (WeakBag.remove sln >> touch sln) es, occ)
267422
268−eventRoot :: GCompare k => k a -> Root x k -> Event x a
423+eventRoot :: (GCompare k, HasSpiderTimeline x) => k a -> Root x k -> Event x a
269424eventRoot !k !r = Event $ wrap eventSubscribedRoot $ liftIO . getRootSubscribed k r
270425
426+subscribeAndReadNever :: EventM x (EventSubscription x, Maybe a)
427+subscribeAndReadNever = return (EventSubscription (return ()) eventSubscribedNever, Nothing)
428+
271429eventNever :: Event x a
272−eventNever = Event $ \_ -> return (EventSubscription (return ()) eventSubscribedNever, Nothing)
430+eventNever = Event $ const subscribeAndReadNever
273431
274−eventFan :: GCompare k => k a -> Fan x k -> Event x a
432+eventFan :: (GCompare k, HasSpiderTimeline x) => k a -> Fan x k v -> Event x (v a)
275433eventFan !k !f = Event $ wrap eventSubscribedFan $ getFanSubscribed k f
276434
277−eventSwitch :: Switch x a -> Event x a
435+eventSwitch :: HasSpiderTimeline x => Switch x a -> Event x a
278436eventSwitch !s = Event $ wrap eventSubscribedSwitch $ getSwitchSubscribed s
279437
280−eventCoincidence :: Coincidence x a -> Event x a
438+eventCoincidence :: HasSpiderTimeline x => Coincidence x a -> Event x a
281439eventCoincidence !c = Event $ wrap eventSubscribedCoincidence $ getCoincidenceSubscribed c
282440
283441eventHold :: Hold x p -> Event x p
284442eventHold !h = Event $ subscribeHoldEvent h
285443
286−eventDyn :: R.Patch p => Dyn x p -> Event x p
444+eventDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> Event x p
287445eventDyn !j = Event $ \sub -> getDynHold j >>= \h -> subscribeHoldEvent h sub
288446
289447{-# INLINE subscribeCoincidenceInner #-}
290−subscribeCoincidenceInner :: CanSubscribe x m => Event x a -> Height -> CoincidenceSubscribed x a -> m (Maybe a, Height, EventSubscribed x)
448+subscribeCoincidenceInner :: HasSpiderTimeline x => Event x a -> Height -> CoincidenceSubscribed x a -> EventM x (Maybe a, Height, EventSubscribed x)
291449subscribeCoincidenceInner inner outerHeight subscribedUnsafe = do
292450 subInner <- liftIO $ newSubscriberCoincidenceInner subscribedUnsafe
293451 (subscription@(EventSubscription _ innerSubd), innerOcc) <- subscribeAndRead inner subInner
@@ -306,102 +464,75 @@ data Subscriber x a = Subscriber
306464 , subscriberRecalculateHeight :: !(Height -> IO ())
307465 }
308466
309−--TODO: Move this comment to WeakBag
310−-- These function are constructor functions that are marked NOINLINE so they are
311−-- opaque to GHC. If we do not do this, then GHC will sometimes fuse the constructor away
312−-- so any weak references that are attached to the constructors will have their
313−-- finalizer run. Using the opaque constructor, does not see the
314−-- constructor application, so it behaves like an IORef and cannot be fused away.
315−--
316−-- The result is also evaluated to WHNF, since forcing a thunk invalidates
317−-- the weak pointer to it in some cases.
318−
319−newSubscriberHold :: R.Patch p => Hold x p -> IO (Subscriber x p)
467+newSubscriberHold :: (HasSpiderTimeline x, Patch p) => Hold x p -> IO (Subscriber x p)
320468newSubscriberHold h = return $ Subscriber
321469 { subscriberPropagate = {-# SCC "traverseHold" #-} propagateSubscriberHold h
322470 , subscriberInvalidateHeight = \_ -> return ()
323471 , subscriberRecalculateHeight = \_ -> return ()
324472 }
325473
326−newSubscriberFan :: GCompare k => FanSubscribed x k -> IO (Subscriber x (DMap k Identity))
327−newSubscriberFan subscribed = return $ Subscriber
474+newSubscriberFan :: forall x k v. (HasSpiderTimeline x, GCompare k) => FanSubscribed x k v -> IO (Subscriber x (DMap k v))
475+newSubscriberFan subscribed = debugSubscriber ("SubscriberFan " <> showNodeId subscribed) $ Subscriber
328476 { subscriberPropagate = \a -> {-# SCC "traverseFan" #-} do
329477 subs <- liftIO $ readIORef $ fanSubscribedSubscribers subscribed
330− tracePropagate $ "SubscriberFan" <> showNodeId subscribed <> ": " ++ show (DMap.size subs) ++ " keys subscribed, " ++ show (DMap.size a) ++ " keys firing"
478+ tracePropagate (Proxy :: Proxy x) $ show (DMap.size subs) <> " keys subscribed, " <> show (DMap.size a) <> " keys firing"
331479 liftIO $ writeIORef (fanSubscribedOccurrence subscribed) $ Just a
332480 scheduleClear $ fanSubscribedOccurrence subscribed
333− let f _ (Pair (Identity v) subsubs) = do
481+ let f _ (Pair v subsubs) = do
334482 propagate v $ _fanSubscribedChildren_list subsubs
335483 return $ Constant ()
336484 _ <- DMap.traverseWithKey f $ DMap.intersectionWithKey (\_ -> Pair) a subs --TODO: Would be nice to have DMap.traverse_
337485 return ()
338486 , subscriberInvalidateHeight = \old -> do
339− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
340487 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
341− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
342− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
488+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
343489 , subscriberRecalculateHeight = \new -> do
344− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
345490 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
346− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
347− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
491+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
348492 }
349493
350−newSubscriberSwitch :: SwitchSubscribed x a -> IO (Subscriber x a)
351−newSubscriberSwitch subscribed = return $ Subscriber
494+newSubscriberSwitch :: forall x a. HasSpiderTimeline x => SwitchSubscribed x a -> IO (Subscriber x a)
495+newSubscriberSwitch subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
352496 { subscriberPropagate = \a -> {-# SCC "traverseSwitch" #-} do
353− tracePropagate $ "SubscriberSwitch" <> showNodeId subscribed
354497 liftIO $ writeIORef (switchSubscribedOccurrence subscribed) $ Just a
355498 scheduleClear $ switchSubscribedOccurrence subscribed
356499 propagate a $ switchSubscribedSubscribers subscribed
357500 , subscriberInvalidateHeight = \_ -> do
358− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
359501 oldHeight <- readIORef $ switchSubscribedHeight subscribed
360502 when (oldHeight /= invalidHeight) $ do
361503 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
362− WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
363− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
364− , subscriberRecalculateHeight = \new -> do
365− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
366− updateSwitchHeight new subscribed
367− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
368− }
504+ WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
505+ , subscriberRecalculateHeight = (`updateSwitchHeight` subscribed)
506+ }
369507
370−newSubscriberCoincidenceOuter :: CoincidenceSubscribed x b -> IO (Subscriber x (Event x b))
371−newSubscriberCoincidenceOuter subscribed = return $ Subscriber
508+newSubscriberCoincidenceOuter :: forall x b. HasSpiderTimeline x => CoincidenceSubscribed x b -> IO (Subscriber x (Event x b))
509+newSubscriberCoincidenceOuter subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
372510 { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceOuter" #-} do
373− tracePropagate $ "SubscriberCoincidenceOuter" <> showNodeId subscribed
374511 outerHeight <- liftIO $ readIORef $ coincidenceSubscribedHeight subscribed
375− tracePropagate $ " outerHeight = " <> show outerHeight
512+ tracePropagate (Proxy :: Proxy x) $ " outerHeight = " <> show outerHeight
376513 (occ, innerHeight, innerSubd) <- subscribeCoincidenceInner a outerHeight subscribed
377− tracePropagate $ " isJust occ = " <> show (isJust occ)
378− tracePropagate $ " innerHeight = " <> show innerHeight
514+ tracePropagate (Proxy :: Proxy x) $ " isJust occ = " <> show (isJust occ)
515+ tracePropagate (Proxy :: Proxy x) $ " innerHeight = " <> show innerHeight
516+
379517 liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
380518 scheduleClear $ coincidenceSubscribedInnerParent subscribed
381519 case occ of
382− Nothing -> do
520+ Nothing ->
383521 when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
384522 writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
385− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
386− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
523+ WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
524+ WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
387525 Just o -> do -- Since it's already firing, no need to adjust height
388526 liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
389527 scheduleClear $ coincidenceSubscribedOccurrence subscribed
390528 propagate o $ coincidenceSubscribedSubscribers subscribed
391− , subscriberInvalidateHeight = \_ -> do
392− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
393− invalidateCoincidenceHeight subscribed
394− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
395− , subscriberRecalculateHeight = \_ -> do
396− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
397− recalculateCoincidenceHeight subscribed
398− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
529+ , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
530+ , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
399531 }
400532
401−newSubscriberCoincidenceInner :: CoincidenceSubscribed x a -> IO (Subscriber x a)
402−newSubscriberCoincidenceInner subscribed = return $ Subscriber
533+newSubscriberCoincidenceInner :: forall x a. HasSpiderTimeline x => CoincidenceSubscribed x a -> IO (Subscriber x a)
534+newSubscriberCoincidenceInner subscribed = debugSubscriber ("SubscriberCoincidenceInner" <> showNodeId subscribed) $ Subscriber
403535 { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceInner" #-} do
404− tracePropagate $ "SubscriberCoincidenceInner" <> showNodeId subscribed
405536 occ <- liftIO $ readIORef $ coincidenceSubscribedOccurrence subscribed
406537 case occ of
407538 Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
@@ -409,14 +540,8 @@ newSubscriberCoincidenceInner subscribed = return $ Subscriber
409540 liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $ Just a
410541 scheduleClear $ coincidenceSubscribedOccurrence subscribed
411542 propagate a $ coincidenceSubscribedSubscribers subscribed
412− , subscriberInvalidateHeight = \_ -> do
413− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
414− invalidateCoincidenceHeight subscribed
415− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
416− , subscriberRecalculateHeight = \_ -> do
417− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
418− recalculateCoincidenceHeight subscribed
419− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
543+ , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
544+ , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
420545 }
421546
422547invalidateSubscriberHeight :: Height -> Subscriber x a -> IO ()
@@ -426,11 +551,18 @@ recalculateSubscriberHeight :: Height -> Subscriber x a -> IO ()
426551recalculateSubscriberHeight = flip subscriberRecalculateHeight
427552
428553-- | Propagate everything at the current height
429−propagate :: a -> WeakBag (Subscriber x a) -> EventM x ()
430−propagate a subscribers = withIncreasedDepth $ do
554+propagate :: forall x a. HasSpiderTimeline x => a -> WeakBag (Subscriber x a) -> EventM x ()
555+propagate a subscribers = withIncreasedDepth (Proxy::Proxy x) $
556+ -- Note: in the following traversal, we do not visit nodes that are added to the list during our traversal; they are new events, which will necessarily have full information already, so there is no need to traverse them
557+ --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
558+ WeakBag.traverse_ subscribers $ \s -> subscriberPropagate s a
559+
560+-- | Propagate everything at the current height
561+propagateFast :: forall x a. HasSpiderTimeline x => a -> FastWeakBag (Subscriber x a) -> EventM x ()
562+propagateFast a subscribers = withIncreasedDepth (Proxy::Proxy x) $
431563 -- Note: in the following traversal, we do not visit nodes that are added to the list during our traversal; they are new events, which will necessarily have full information already, so there is no need to traverse them
432564 --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
433− WeakBag.traverse subscribers $ \s -> subscriberPropagate s a
565+ FastWeakBag.traverse_ subscribers $ \s -> subscriberPropagate s a
434566
435567--------------------------------------------------------------------------------
436568-- EventSubscribed
@@ -439,11 +571,16 @@ propagate a subscribers = withIncreasedDepth $ do
439571toAny :: a -> Any
440572toAny = unsafeCoerce
441573
574+-- Why do we use Any here, instead of just giving eventSubscribedRetained an
575+-- existential type? Sadly, GHC does not currently know how to unbox types
576+-- with existentially quantified fields. So instead we just coerce values
577+-- to type Any on the way in. Since we never coerce them back, this is
578+-- perfectly safe.
442579data EventSubscribed x = EventSubscribed
443580 { eventSubscribedHeightRef :: {-# UNPACK #-} !(IORef Height)
444581 , eventSubscribedRetained :: {-# NOUNPACK #-} !Any
445582#ifdef DEBUG_CYCLES
446− , eventSubscribedGetParents :: !(IO [Some (EventSubscribed x)]) -- For debugging loops
583+ , eventSubscribedGetParents :: !(IO [EventSubscribed x]) -- For debugging loops
447584 , eventSubscribedHasOwnHeightRef :: !Bool
448585 , eventSubscribedWhoCreated :: !(IO [String])
449586#endif
@@ -470,13 +607,23 @@ eventSubscribedNever = EventSubscribed
470607 , eventSubscribedWhoCreated = return ["never"]
471608#endif
472609 }
610+eventSubscribedNow :: EventSubscribed x
611+eventSubscribedNow = EventSubscribed
612+ { eventSubscribedHeightRef = zeroRef
613+ , eventSubscribedRetained = toAny ()
614+#ifdef DEBUG_CYCLES
615+ , eventSubscribedGetParents = return []
616+ , eventSubscribedHasOwnHeightRef = False
617+ , eventSubscribedWhoCreated = return ["now"]
618+#endif
619+ }
473620
474−eventSubscribedFan :: FanSubscribed x k -> EventSubscribed x
621+eventSubscribedFan :: FanSubscribed x k v -> EventSubscribed x
475622eventSubscribedFan !subscribed = EventSubscribed
476623 { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
477624 , eventSubscribedRetained = toAny subscribed
478625#ifdef DEBUG_CYCLES
479− , eventSubscribedGetParents = return [Some.This $ _eventSubscription_subscribed $ fanSubscribedParent subscribed]
626+ , eventSubscribedGetParents = return [_eventSubscription_subscribed $ fanSubscribedParent subscribed]
480627 , eventSubscribedHasOwnHeightRef = False
481628 , eventSubscribedWhoCreated = whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
482629#endif
@@ -489,7 +636,7 @@ eventSubscribedSwitch !subscribed = EventSubscribed
489636#ifdef DEBUG_CYCLES
490637 , eventSubscribedGetParents = do
491638 s <- readIORef $ switchSubscribedCurrentParent subscribed
492− return [Some.This $ _eventSubscription_subscribed s]
639+ return [_eventSubscription_subscribed s]
493640 , eventSubscribedHasOwnHeightRef = True
494641 , eventSubscribedWhoCreated = whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
495642#endif
@@ -502,8 +649,8 @@ eventSubscribedCoincidence !subscribed = EventSubscribed
502649#ifdef DEBUG_CYCLES
503650 , eventSubscribedGetParents = do
504651 innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
505− let outerParent = Some.This $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
506− innerParents = maybeToList $ fmap Some.This innerSubscription
652+ let outerParent = _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
653+ innerParents = maybeToList $ innerSubscription
507654 return $ outerParent : innerParents
508655 , eventSubscribedHasOwnHeightRef = True
509656 , eventSubscribedWhoCreated = whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
@@ -517,41 +664,29 @@ getEventSubscribedHeight es = readIORef $ eventSubscribedHeightRef es
517664whoCreatedEventSubscribed :: EventSubscribed x -> IO [String]
518665whoCreatedEventSubscribed = eventSubscribedWhoCreated
519666
520−walkInvalidHeightParents :: EventSubscribed x -> IO [Some (EventSubscribed x)]
667+walkInvalidHeightParents :: EventSubscribed x -> IO [EventSubscribed x]
521668walkInvalidHeightParents s0 = do
522− subscribers <- flip execStateT mempty $ ($ Some.This s0) $ fix $ \loop (Some.This s) -> do
669+ subscribers <- flip execStateT mempty $ ($ s0) $ fix $ \loop s -> do
523670 h <- liftIO $ readIORef $ eventSubscribedHeightRef s
524671 when (h == invalidHeight) $ do
525672 when (eventSubscribedHasOwnHeightRef s) $ liftIO $ writeIORef (eventSubscribedHeightRef s) $! invalidHeightBeingTraversed
526− modify (Some.This s :)
673+ modify (s :)
527674 mapM_ loop =<< liftIO (eventSubscribedGetParents s)
528− forM_ subscribers $ \(Some.This s) -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
675+ forM_ subscribers $ \s -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
529676 return subscribers
530677#endif
531678
532679{-# INLINE subscribeHoldEvent #-}
533−subscribeHoldEvent :: CanSubscribe x m => Hold x p -> Subscriber x p -> m (EventSubscription x, Maybe p)
680+subscribeHoldEvent :: Hold x p -> Subscriber x p -> EventM x (EventSubscription x, Maybe p)
534681subscribeHoldEvent = subscribeAndRead . holdEvent
535682
536−--------------------------------------------------------------------------------
537−-- EventSubscription
538−--------------------------------------------------------------------------------
539−
540−data EventSubscription x = EventSubscription
541− { _eventSubscription_unsubscribe :: !(IO ())
542− , _eventSubscription_subscribed :: {-# UNPACK #-} !(EventSubscribed x)
543− }
544−
545−unsubscribe :: EventSubscription x -> IO ()
546−unsubscribe (EventSubscription u _) = u
547−
548683--------------------------------------------------------------------------------
549684-- Behavior
550685--------------------------------------------------------------------------------
551686
552687newtype Behavior x a = Behavior { readBehaviorTracked :: BehaviorM x a }
553688
554−behaviorHold :: Hold x p -> Behavior x (R.PatchTarget p)
689+behaviorHold :: Hold x p -> Behavior x (PatchTarget p)
555690behaviorHold !h = Behavior $ readHoldTracked h
556691
557692behaviorHoldIdentity :: Hold x (Identity a) -> Behavior x a
@@ -565,7 +700,7 @@ behaviorPull !p = Behavior $ do
565700 val <- liftIO $ readIORef $ pullValue p
566701 case val of
567702 Just subscribed -> do
568− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
703+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedPull subscribed)) :))
569704 askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (pullSubscribedInvalidators subscribed) (wi:))
570705 liftIO $ touch $ pullSubscribedOwnInvalidator subscribed
571706 return $ pullSubscribedValue subscribed
@@ -574,7 +709,7 @@ behaviorPull !p = Behavior $ do
574709 wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorPull"
575710 parentsRef <- liftIO $ newIORef []
576711 holdInits <- askBehaviorHoldInits
577− a <- liftIO $ runReaderT (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
712+ a <- liftIO $ runReaderIO (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
578713 invsRef <- liftIO . newIORef . maybeToList =<< askInvalidator
579714 parents <- liftIO $ readIORef parentsRef
580715 let subscribed = PullSubscribed
@@ -584,22 +719,22 @@ behaviorPull !p = Behavior $ do
584719 , pullSubscribedParents = parents
585720 }
586721 liftIO $ writeIORef (pullValue p) $ Just subscribed
587− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
722+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedPull subscribed)) :))
588723 return a
589724
590−behaviorDyn :: R.Patch p => Dyn x p -> Behavior x (R.PatchTarget p)
725+behaviorDyn :: Patch p => Dyn x p -> Behavior x (PatchTarget p)
591726behaviorDyn !d = Behavior $ readHoldTracked =<< getDynHold d
592727
593728{-# INLINE readHoldTracked #-}
594−readHoldTracked :: Hold x p -> BehaviorM x (R.PatchTarget p)
729+readHoldTracked :: Hold x p -> BehaviorM x (PatchTarget p)
595730readHoldTracked h = do
596731 result <- liftIO $ readIORef $ holdValue h
597732 askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (holdInvalidators h) (wi:))
598− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedHold h) :))
733+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedHold h)) :))
734+ liftIO $ touch h -- Otherwise, if this gets inlined enough, the hold's parent reference may get collected
599735 return result
600736
601−{-# SPECIALIZE readBehaviorUntracked :: Behavior x a -> BehaviorM x a #-}
602−{-# SPECIALIZE readBehaviorUntracked :: Behavior x a -> EventM x a #-}
737+{-# INLINABLE readBehaviorUntracked #-}
603738readBehaviorUntracked :: Defer (SomeHoldInit x) m => Behavior x a -> m a
604739readBehaviorUntracked b = do
605740 holdInits <- getDeferralQueue
@@ -609,45 +744,49 @@ readBehaviorUntracked b = do
609744-- Dynamic
610745--------------------------------------------------------------------------------
611746
612−data Dynamic x p = Dynamic
613− { dynamicCurrent :: !(Behavior x (R.PatchTarget p))
614− , dynamicUpdated :: !(Event x p)
747+type DynamicS x p = Dynamic x (PatchTarget p) p
748+
749+data Dynamic x target p = Dynamic
750+ { dynamicCurrent :: !(Behavior x target)
751+ , dynamicUpdated :: Event x p -- This must be lazy; see the comment on holdEvent --TODO: Would this let us eliminate `Dyn`?
615752 }
616753
617−dynamicHold :: Hold x p -> Dynamic x p
754+deriving instance (HasSpiderTimeline x) => Functor (Dynamic x target)
755+
756+
757+
758+
759+dynamicHold :: Hold x p -> DynamicS x p
618760dynamicHold !h = Dynamic
619761 { dynamicCurrent = behaviorHold h
620762 , dynamicUpdated = eventHold h
621763 }
622764
623−dynamicHoldIdentity :: Hold x (Identity a) -> Dynamic x (Identity a)
765+dynamicHoldIdentity :: Hold x (Identity a) -> DynamicS x (Identity a)
624766dynamicHoldIdentity = dynamicHold
625767
626−dynamicConst :: R.PatchTarget p -> Dynamic x p
768+dynamicConst :: PatchTarget p -> DynamicS x p
627769dynamicConst !a = Dynamic
628770 { dynamicCurrent = behaviorConst a
629771 , dynamicUpdated = eventNever
630772 }
631773
632−dynamicDyn :: R.Patch p => Dyn x p -> Dynamic x p
774+dynamicDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> DynamicS x p
633775dynamicDyn !d = Dynamic
634776 { dynamicCurrent = behaviorDyn d
635777 , dynamicUpdated = eventDyn d
636778 }
637779
638−dynamicDynIdentity :: Dyn x (Identity a) -> Dynamic x (Identity a)
780+dynamicDynIdentity :: HasSpiderTimeline x => Dyn x (Identity a) -> DynamicS x (Identity a)
639781dynamicDynIdentity = dynamicDyn
640782
641783--------------------------------------------------------------------------------
642784-- Combinators
643785--------------------------------------------------------------------------------
644786
645−--TODO: Figure out why certain things are not 'representational', then make them
646−--representational so we can use coerce
647−
648787--type role Hold representational
649788data Hold x p
650− = Hold { holdValue :: !(IORef (R.PatchTarget p))
789+ = Hold { holdValue :: !(IORef (PatchTarget p))
651790 , holdInvalidators :: !(IORef [Weak (Invalidator x)])
652791 , holdEvent :: Event x p -- This must be lazy, or holds cannot be defined before their input Events
653792 , holdParent :: !(IORef (Maybe (EventSubscription x))) -- Keeps its parent alive (will be undefined until the hold is initialized) --TODO: Probably shouldn't be an IORef
@@ -656,22 +795,57 @@ data Hold x p
656795#endif
657796 }
658797
798+-- | A statically allocated 'SpiderTimeline'
799+data Global
800+
801+{-# NOINLINE globalSpiderTimelineEnv #-}
802+globalSpiderTimelineEnv :: SpiderTimelineEnv Global
803+globalSpiderTimelineEnv = unsafePerformIO unsafeNewSpiderTimelineEnv
804+
805+-- | Stores all global data relevant to a particular Spider timeline; only one
806+-- value should exist for each type @x@
807+newtype SpiderTimelineEnv x = STE {unSTE :: SpiderTimelineEnv' x}
808+-- We implement SpiderTimelineEnv with a newtype wrapper so
809+-- we can get the coercions we want safely.
810+type role SpiderTimelineEnv nominal
811+
812+data SpiderTimelineEnv' x = SpiderTimelineEnv
813+ { _spiderTimeline_lock :: {-# UNPACK #-} !(MVar ())
814+ , _spiderTimeline_eventEnv :: {-# UNPACK #-} !(EventEnv x)
815+#ifdef DEBUG
816+ , _spiderTimeline_depth :: {-# UNPACK #-} !(IORef Int)
817+#endif
818+ }
819+type role SpiderTimelineEnv' phantom
820+
821+instance Eq (SpiderTimelineEnv x) where
822+ _ == _ = True -- Since only one exists of each type
823+
824+instance GEq SpiderTimelineEnv where
825+ a `geq` b = if _spiderTimeline_lock (unSTE a) == _spiderTimeline_lock (unSTE b)
826+ then Just $ unsafeCoerce Refl -- This unsafeCoerce is safe because the same SpiderTimelineEnv can't have two different 'x' arguments
827+ else Nothing
828+
659829data EventEnv x
660− = EventEnv { eventEnvSpiderTimeline :: !(SpiderTimeline x)
661− , eventEnvAssignments :: !(IORef [SomeAssignment x]) -- Needed for Subscribe
830+ = EventEnv { eventEnvAssignments :: !(IORef [SomeAssignment x]) -- Needed for Subscribe
662831 , eventEnvHoldInits :: !(IORef [SomeHoldInit x]) -- Needed for Subscribe
832+ , eventEnvDynInits :: !(IORef [SomeDynInit x])
663833 , eventEnvMergeUpdates :: !(IORef [SomeMergeUpdate x])
664834 , eventEnvMergeInits :: !(IORef [SomeMergeInit x]) -- Needed for Subscribe
665− , eventEnvClears :: !(IORef [SomeClear]) -- Needed for Subscribe
666− , eventEnvRootClears :: !(IORef [SomeRootClear])
835+ , eventEnvClears :: !(IORef [Some Clear]) -- Needed for Subscribe
836+ , eventEnvIntClears :: !(IORef [Some IntClear])
837+ , eventEnvRootClears :: !(IORef [Some RootClear])
667838 , eventEnvCurrentHeight :: !(IORef Height) -- Needed for Subscribe
668839 , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence x]) -- Needed for Subscribe
669840 , eventEnvDelayedMerges :: !(IORef (IntMap [EventM x ()]))
670841 }
671842
672843{-# INLINE runEventM #-}
673−runEventM :: EventM x a -> EventEnv x -> IO a
674−runEventM = runReaderT . unEventM
844+runEventM :: EventM x a -> IO a
845+runEventM = unEventM
846+
847+asksEventEnv :: forall x a. HasSpiderTimeline x => (EventEnv x -> a) -> EventM x a
848+asksEventEnv f = return $ f $ _spiderTimeline_eventEnv (unSTE (spiderTimeline :: SpiderTimelineEnv x))
675849
676850class MonadIO m => Defer a m where
677851 getDeferralQueue :: m (IORef [a])
@@ -682,81 +856,87 @@ defer a = do
682856 q <- getDeferralQueue
683857 liftIO $ modifyIORef' q (a:)
684858
685−instance Defer (SomeAssignment x) (EventM x) where
859+instance HasSpiderTimeline x => Defer (SomeAssignment x) (EventM x) where
860+ {-# INLINE getDeferralQueue #-}
861+ getDeferralQueue = asksEventEnv eventEnvAssignments
862+
863+instance HasSpiderTimeline x => Defer (SomeHoldInit x) (EventM x) where
686864 {-# INLINE getDeferralQueue #-}
687− getDeferralQueue = EventM $ asks eventEnvAssignments
865+ getDeferralQueue = asksEventEnv eventEnvHoldInits
688866
689−instance Defer (SomeHoldInit x) (EventM x) where
867+instance HasSpiderTimeline x => Defer (SomeDynInit x) (EventM x) where
690868 {-# INLINE getDeferralQueue #-}
691− getDeferralQueue = EventM $ asks eventEnvHoldInits
869+ getDeferralQueue = asksEventEnv eventEnvDynInits
692870
693871instance Defer (SomeHoldInit x) (BehaviorM x) where
694872 {-# INLINE getDeferralQueue #-}
695873 getDeferralQueue = BehaviorM $ asks snd
696874
697−instance Defer (SomeMergeUpdate x) (EventM x) where
875+instance HasSpiderTimeline x => Defer (SomeMergeUpdate x) (EventM x) where
698876 {-# INLINE getDeferralQueue #-}
699− getDeferralQueue = EventM $ asks eventEnvMergeUpdates
877+ getDeferralQueue = asksEventEnv eventEnvMergeUpdates
700878
701−instance Defer (SomeMergeInit x) (EventM x) where
879+instance HasSpiderTimeline x => Defer (SomeMergeInit x) (EventM x) where
702880 {-# INLINE getDeferralQueue #-}
703− getDeferralQueue = EventM $ asks eventEnvMergeInits
881+ getDeferralQueue = asksEventEnv eventEnvMergeInits
704882
705−class HasCurrentHeight x m | m -> x where
883+class HasSpiderTimeline x => HasCurrentHeight x m | m -> x where
706884 getCurrentHeight :: m Height
707885 scheduleMerge :: Height -> EventM x () -> m ()
708886
709−instance HasCurrentHeight x (EventM x) where
887+instance HasSpiderTimeline x => HasCurrentHeight x (EventM x) where
710888 {-# INLINE getCurrentHeight #-}
711− getCurrentHeight = EventM $ do
712− heightRef <- asks eventEnvCurrentHeight
889+ getCurrentHeight = do
890+ heightRef <- asksEventEnv eventEnvCurrentHeight
713891 liftIO $ readIORef heightRef
714892 {-# INLINE scheduleMerge #-}
715− scheduleMerge height subscribed = EventM $ do
716− delayedRef <- asks eventEnvDelayedMerges
893+ scheduleMerge height subscribed = do
894+ delayedRef <- asksEventEnv eventEnvDelayedMerges
717895 liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [subscribed]
718896
719−class HasSpiderTimeline x m | m -> x where
720− -- | Retrieve the current SpiderTimeline
721− askSpiderTimeline :: m (SpiderTimeline x)
722−
723−instance HasSpiderTimeline x (EventM x) where
724− {-# INLINE askSpiderTimeline #-}
725− askSpiderTimeline = EventM $ asks eventEnvSpiderTimeline
897+class HasSpiderTimeline x where
898+ -- | Retrieve the current SpiderTimelineEnv
899+ spiderTimeline :: SpiderTimelineEnv x
726900
727−instance HasSpiderTimeline x (SpiderHost x) where
728− {-# INLINE askSpiderTimeline #-}
729− askSpiderTimeline = SpiderHost ask
901+instance HasSpiderTimeline Global where
902+ spiderTimeline = globalSpiderTimelineEnv
730903
731−putCurrentHeight :: Height -> EventM x ()
732−putCurrentHeight h = EventM $ do
733− heightRef <- asks eventEnvCurrentHeight
904+putCurrentHeight :: HasSpiderTimeline x => Height -> EventM x ()
905+putCurrentHeight h = do
906+ heightRef <- asksEventEnv eventEnvCurrentHeight
734907 liftIO $ writeIORef heightRef $! h
735908
736−instance Defer SomeClear (EventM x) where
909+instance HasSpiderTimeline x => Defer (Some Clear) (EventM x) where
737910 {-# INLINE getDeferralQueue #-}
738− getDeferralQueue = EventM $ asks eventEnvClears
911+ getDeferralQueue = asksEventEnv eventEnvClears
739912
740913{-# INLINE scheduleClear #-}
741−scheduleClear :: Defer SomeClear m => IORef (Maybe a) -> m ()
742−scheduleClear r = defer $ SomeClear r
914+scheduleClear :: Defer (Some Clear) m => IORef (Maybe a) -> m ()
915+scheduleClear r = defer $ Some $ Clear r
916+
917+instance HasSpiderTimeline x => Defer (Some IntClear) (EventM x) where
918+ {-# INLINE getDeferralQueue #-}
919+ getDeferralQueue = asksEventEnv eventEnvIntClears
743920
744−instance Defer SomeRootClear (EventM x) where
921+{-# INLINE scheduleIntClear #-}
922+scheduleIntClear :: Defer (Some IntClear) m => IORef (IntMap a) -> m ()
923+scheduleIntClear r = defer $ Some $ IntClear r
924+
925+instance HasSpiderTimeline x => Defer (Some RootClear) (EventM x) where
745926 {-# INLINE getDeferralQueue #-}
746− getDeferralQueue = EventM $ asks eventEnvRootClears
927+ getDeferralQueue = asksEventEnv eventEnvRootClears
747928
748929{-# INLINE scheduleRootClear #-}
749−scheduleRootClear :: Defer SomeRootClear m => IORef (DMap k Identity) -> m ()
750−scheduleRootClear r = defer $ SomeRootClear r
930+scheduleRootClear :: Defer (Some RootClear) m => IORef (DMap k Identity) -> m ()
931+scheduleRootClear r = defer $ Some $ RootClear r
751932
752−instance Defer (SomeResetCoincidence x) (EventM x) where
933+instance HasSpiderTimeline x => Defer (SomeResetCoincidence x) (EventM x) where
753934 {-# INLINE getDeferralQueue #-}
754− getDeferralQueue = EventM $ asks eventEnvResetCoincidences
935+ getDeferralQueue = asksEventEnv eventEnvResetCoincidences
755936
756937-- Note: hold cannot examine its event until after the phase is over
757−{-# SPECIALIZE hold :: R.Patch p => R.PatchTarget p -> Event x p -> EventM x (Hold x p) #-}
758−{-# SPECIALIZE hold :: R.Patch p => R.PatchTarget p -> Event x p -> ComputeM x (Hold x p) #-}
759−hold :: (R.Patch p, Defer (SomeHoldInit x) m) => R.PatchTarget p -> Event x p -> m (Hold x p)
938+{-# INLINE [1] hold #-}
939+hold :: (Patch p, Defer (SomeHoldInit x) m) => PatchTarget p -> Event x p -> m (Hold x p)
760940hold v0 e = do
761941 valRef <- liftIO $ newIORef v0
762942 invsRef <- liftIO $ newIORef []
@@ -777,7 +957,7 @@ hold v0 e = do
777957 return h
778958
779959{-# INLINE getHoldEventSubscription #-}
780−getHoldEventSubscription :: forall m p x. (Defer (SomeAssignment x) m, Defer (SomeHoldInit x) m, Defer SomeClear m, R.Patch p, HasCurrentHeight x m, Defer (SomeMergeInit x) m, Defer (SomeResetCoincidence x) m, HasSpiderTimeline x m, m ~ EventM x) => Hold x p -> m (EventSubscription x)
960+getHoldEventSubscription :: forall p x. (HasSpiderTimeline x, Patch p) => Hold x p -> EventM x (EventSubscription x)
781961getHoldEventSubscription h = do
782962 ep <- liftIO $ readIORef $ holdParent h
783963 case ep of
@@ -791,7 +971,7 @@ getHoldEventSubscription h = do
791971 Nothing -> return ()
792972 Just o -> do
793973 old <- liftIO $ readIORef $ holdValue h
794− case R.apply o old of
974+ case apply o old of
795975 Nothing -> return ()
796976 Just new -> do
797977 -- Need to evaluate these so that we don't retain the Hold itself
@@ -803,9 +983,9 @@ getHoldEventSubscription h = do
803983
804984type BehaviorEnv x = (Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]), IORef [SomeHoldInit x])
805985
806−--type role BehaviorM representational
807986-- BehaviorM can sample behaviors
808−newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderT (BehaviorEnv x) IO a } deriving (Functor, Applicative, MonadIO, MonadFix)
987+newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderIO (BehaviorEnv x) a }
988+ deriving (Functor, Applicative, MonadIO, MonadFix, MonadReader (BehaviorEnv x))
809989
810990instance Monad (BehaviorM x) where
811991 {-# INLINE (>>=) #-}
@@ -814,14 +994,16 @@ instance Monad (BehaviorM x) where
814994 BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
815995 {-# INLINE return #-}
816996 return x = BehaviorM $ return x
997+#if !MIN_VERSION_base(4,13,0)
817998 {-# INLINE fail #-}
818999 fail s = BehaviorM $ fail s
1000+#endif
8191001
8201002data BehaviorSubscribed x a
8211003 = forall p. BehaviorSubscribedHold (Hold x p)
8221004 | BehaviorSubscribedPull (PullSubscribed x a)
8231005
824−data SomeBehaviorSubscribed x = forall a. SomeBehaviorSubscribed (BehaviorSubscribed x a)
1006+newtype SomeBehaviorSubscribed x = SomeBehaviorSubscribed (Some (BehaviorSubscribed x))
8251007
8261008--type role PullSubscribed representational
8271009data PullSubscribed x a
@@ -856,13 +1038,15 @@ data RootSubscribed x a = forall k. GCompare k => RootSubscribed
8561038#endif
8571039 }
8581040
859−data Root x (k :: * -> *)
1041+data Root x k
8601042 = Root { rootOccurrence :: !(IORef (DMap k Identity)) -- The currently-firing occurrence of this event
8611043 , rootSubscribed :: !(IORef (DMap k (RootSubscribed x)))
8621044 , rootInit :: !(forall a. k a -> RootTrigger x a -> IO (IO ()))
8631045 }
8641046
865−data SomeHoldInit x = forall p. R.Patch p => SomeHoldInit !(Hold x p)
1047+data SomeHoldInit x = forall p. Patch p => SomeHoldInit !(Hold x p)
1048+
1049+data SomeDynInit x = forall p. Patch p => SomeDynInit !(Dyn x p)
8661050
8671051data SomeMergeUpdate x = SomeMergeUpdate
8681052 { _someMergeUpdate_update :: !(EventM x [EventSubscription x])
@@ -873,21 +1057,14 @@ data SomeMergeUpdate x = SomeMergeUpdate
8731057newtype SomeMergeInit x = SomeMergeInit { unSomeMergeInit :: EventM x () }
8741058
8751059-- EventM can do everything BehaviorM can, plus create holds
876−newtype EventM x (a :: *) = EventM { unEventM :: ReaderT (EventEnv x) IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadException, MonadAsyncException) -- The environment should be Nothing if we are not in a frame, and Just if we are - in which case it is a list of assignments to be done after the frame is over
877−
878−newtype ComputeM x a = ComputeM (ReaderT (IORef [SomeHoldInit x]) IO a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
1060+newtype EventM x a = EventM { unEventM :: IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadException, MonadAsyncException)
8791061
880−instance Defer (SomeHoldInit x) (ComputeM x) where
881− getDeferralQueue = ComputeM ask
1062+newtype MergeSubscribedParent x a = MergeSubscribedParent { unMergeSubscribedParent :: EventSubscription x }
8821063
883−{-# SPECIALIZE runComputeM :: ComputeM x a -> EventM x a #-}
884−runComputeM :: Defer (SomeHoldInit x) m => ComputeM x a -> m a
885−runComputeM (ComputeM a) = liftIO . runReaderT a =<< getDeferralQueue
886−
887−data MergeSubscribedParent (x :: *) (k :: * -> *) a = MergeSubscribedParent !(EventSubscription x) !(Subscriber x a)
888−
889−mergeSubscribedParentSubscription :: MergeSubscribedParent x k a -> EventSubscription x
890−mergeSubscribedParentSubscription (MergeSubscribedParent es _) = es
1064+data MergeSubscribedParentWithMove x k a = MergeSubscribedParentWithMove
1065+ { _mergeSubscribedParentWithMove_subscription :: !(EventSubscription x)
1066+ , _mergeSubscribedParentWithMove_key :: !(IORef (k a))
1067+ }
8911068
8921069data HeightBag = HeightBag
8931070 { _heightBag_size :: {-# UNPACK #-} !Int
@@ -905,7 +1082,8 @@ heightBagFromList :: [Height] -> HeightBag
9051082heightBagFromList heights = heightBagVerify $ foldl' (flip heightBagAdd) heightBagEmpty heights
9061083
9071084heightBagAdd :: Height -> HeightBag -> HeightBag
908−heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
1085+heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $
1086+ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
9091087
9101088heightBagRemove :: Height -> HeightBag -> HeightBag
9111089heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.lookup h c of
@@ -914,6 +1092,13 @@ heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.loo
9141092 0 -> IntMap.delete h c
9151093 _ -> IntMap.insert h (pred old) c
9161094
1095+heightBagRemoveMaybe :: Height -> HeightBag -> Maybe HeightBag
1096+heightBagRemoveMaybe (Height h) b@(HeightBag s c) = heightBagVerify . removed <$> IntMap.lookup h c where
1097+ removed old = HeightBag (pred s) $ case old of
1098+ 0 -> IntMap.delete h c
1099+ _ -> IntMap.insert h (pred old) c
1100+
1101+
9171102heightBagMax :: HeightBag -> Height
9181103heightBagMax (HeightBag _ c) = case IntMap.maxViewWithKey c of
9191104 Just ((h, _), _) -> Height h
@@ -931,25 +1116,25 @@ heightBagVerify b@(HeightBag s c) = if
9311116heightBagVerify = id
9321117#endif
9331118
934−data FanSubscribedChildren (x :: *) k a = FanSubscribedChildren
935− { _fanSubscribedChildren_list :: !(WeakBag (Subscriber x a))
936− , _fanSubscribedChildren_self :: {-# NOUNPACK #-} !(k a, FanSubscribed x k)
937− , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed x k)))
1119+data FanSubscribedChildren x k v a = FanSubscribedChildren
1120+ { _fanSubscribedChildren_list :: !(WeakBag (Subscriber x (v a)))
1121+ , _fanSubscribedChildren_self :: {-# NOUNPACK #-} !(k a, FanSubscribed x k v)
1122+ , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed x k v)))
9381123 }
9391124
940−data FanSubscribed (x :: *) k
941− = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed x k)))
942− , fanSubscribedOccurrence :: !(IORef (Maybe (DMap k Identity)))
943− , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren x k))) -- This DMap should never be empty
1125+data FanSubscribed x k v
1126+ = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed x k v)))
1127+ , fanSubscribedOccurrence :: !(IORef (Maybe (DMap k v)))
1128+ , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren x k v))) -- This DMap should never be empty
9441129 , fanSubscribedParent :: !(EventSubscription x)
9451130#ifdef DEBUG_NODEIDS
9461131 , fanSubscribedNodeId :: Int
9471132#endif
9481133 }
9491134
950−data Fan x k
951− = Fan { fanParent :: !(Event x (DMap k Identity))
952− , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k)))
1135+data Fan x k v
1136+ = Fan { fanParent :: !(Event x (DMap k v))
1137+ , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k v)))
9531138 }
9541139
9551140data SwitchSubscribed x a
@@ -973,7 +1158,9 @@ data Switch x a
9731158 , switchSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
9741159 }
9751160
1161+#ifdef USE_TEMPLATE_HASKELL
9761162{-# ANN CoincidenceSubscribed "HLint: ignore Redundant bracket" #-}
1163+#endif
9771164data CoincidenceSubscribed x a
9781165 = CoincidenceSubscribed { coincidenceSubscribedCachedSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
9791166 , coincidenceSubscribedOccurrence :: !(IORef (Maybe a))
@@ -1001,20 +1188,35 @@ newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
10011188newInvalidatorPull :: Pull x a -> IO (Invalidator x)
10021189newInvalidatorPull p = return $! InvalidatorPull p
10031190
1004−instance R.FunctorMaybe (Event x) where
1005− fmapMaybe f = push $ return . f
1191+instance HasSpiderTimeline x => Filterable (Event x) where
1192+ mapMaybe f = push $ return . f
10061193
1007−instance Align (Event x) where
1194+instance HasSpiderTimeline x => Align (Event x) where
10081195 nil = eventNever
1009− align ea eb = R.fmapMaybe R.dmapToThese $ merge $ dynamicConst $ DMap.fromList [R.LeftTag :=> ea, R.RightTag :=> eb]
1196+#if MIN_VERSION_these(0, 8, 0)
1197+instance HasSpiderTimeline x => Semialign (Event x) where
1198+#endif
1199+ align ea eb = mapMaybe dmapToThese $ mergeG coerce $ dynamicConst $
1200+ DMap.fromDistinctAscList [LeftTag :=> ea, RightTag :=> eb]
1201+
1202+#ifdef MIN_VERSION_semialign
1203+#if MIN_VERSION_semialign(1,1,0)
1204+instance HasSpiderTimeline x => Zip (Event x) where
1205+#endif
1206+ zip x y = mapMaybe justThese $ align x y
1207+#endif
10101208
1011−newtype Dyn x p = Dyn { unDyn :: IORef (Either (BehaviorM x (R.PatchTarget p), Event x p) (Hold x p)) }
1209+data DynType x p = UnsafeDyn !(BehaviorM x (PatchTarget p), Event x p)
1210+ | BuildDyn !(EventM x (PatchTarget p), Event x p)
1211+ | HoldDyn !(Hold x p)
10121212
1013−newMapDyn :: (a -> b) -> Dynamic x (Identity a) -> Dynamic x (Identity b)
1014−newMapDyn f d = dynamicDynIdentity $ unsafeDyn (fmap f $ readBehaviorTracked $ dynamicCurrent d) (Identity . f . runIdentity <$> dynamicUpdated d)
1213+newtype Dyn (x :: Type) p = Dyn { unDyn :: IORef (DynType x p) }
1214+
1215+newMapDyn :: HasSpiderTimeline x => (a -> b) -> DynamicS x (Identity a) -> DynamicS x (Identity b)
1216+newMapDyn f d = dynamicDynIdentity $ unsafeBuildDynamic (fmap f $ readBehaviorTracked $ dynamicCurrent d) (Identity . f . runIdentity <$> dynamicUpdated d)
10151217
10161218--TODO: Avoid the duplication between this and R.zipDynWith
1017−zipDynWith :: (a -> b -> c) -> Dynamic x (Identity a) -> Dynamic x (Identity b) -> Dynamic x (Identity c)
1219+zipDynWith :: HasSpiderTimeline x => (a -> b -> c) -> DynamicS x (Identity a) -> DynamicS x (Identity b) -> DynamicS x (Identity c)
10181220zipDynWith f da db =
10191221 let eab = align (dynamicUpdated da) (dynamicUpdated db)
10201222 ec = flip push eab $ \o -> do
@@ -1027,75 +1229,70 @@ zipDynWith f da db =
10271229 return (a, b)
10281230 These (Identity a) (Identity b) -> return (a, b)
10291231 return $ Just $ Identity $ f a b
1030− in dynamicDynIdentity $ unsafeDyn (f <$> readBehaviorUntracked (dynamicCurrent da) <*> readBehaviorUntracked (dynamicCurrent db)) ec
1232+ in dynamicDynIdentity $ unsafeBuildDynamic (f <$> readBehaviorUntracked (dynamicCurrent da) <*> readBehaviorUntracked (dynamicCurrent db)) ec
10311233
1032−unsafeDyn :: BehaviorM x (R.PatchTarget p) -> Event x p -> Dyn x p
1033−unsafeDyn readV0 v' = Dyn $ unsafeNewIORef x $ Left x
1034− where x = (readV0, v')
1234+buildDynamic :: (Defer (SomeDynInit x) m, Patch p) => EventM x (PatchTarget p) -> Event x p -> m (Dyn x p)
1235+buildDynamic readV0 v' = do
1236+ result <- liftIO $ newIORef $ BuildDyn (readV0, v')
1237+ let !d = Dyn result
1238+ defer $ SomeDynInit d
1239+ return d
10351240
1036−newJoinDyn :: Dynamic x (Identity (Dynamic x (Identity a))) -> Dyn x (Identity a)
1037−newJoinDyn d =
1038− let readV0 = readBehaviorTracked . dynamicCurrent =<< readBehaviorTracked (dynamicCurrent d)
1039− eOuter = push (fmap (Just . Identity) . readBehaviorUntracked . dynamicCurrent . runIdentity) $ dynamicUpdated d
1040− eInner = switch $ dynamicUpdated <$> dynamicCurrent d
1041− eBoth = coincidence $ dynamicUpdated . runIdentity <$> dynamicUpdated d
1042− v' = unSpiderEvent $ R.leftmost $ map SpiderEvent [eBoth, eOuter, eInner]
1043− in unsafeDyn readV0 v'
1241+unsafeBuildDynamic :: BehaviorM x (PatchTarget p) -> Event x p -> Dyn x p
1242+unsafeBuildDynamic readV0 v' =
1243+ Dyn $ unsafePerformIO $ newIORef $ UnsafeDyn (readV0, v')
10441244
10451245-- ResultM can read behaviors and events
10461246type ResultM = EventM
10471247
1048−{-# NOINLINE unsafeNewIORef #-}
1049−unsafeNewIORef :: a -> b -> IORef b
1050−unsafeNewIORef _ b = unsafePerformIO $ newIORef b
1051−
1052−instance Functor (Event x) where
1248+instance HasSpiderTimeline x => Functor (Event x) where
10531249 fmap f = push $ return . Just . f
10541250
10551251instance Functor (Behavior x) where
10561252 fmap f = pull . fmap f . readBehaviorTracked
10571253
1058−{-# INLINABLE push #-} --TODO: If this is helpful, we can get rid of the unsafeNewIORef and use unsafePerformIO directly
1059−push :: (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
1254+{-# INLINE push #-}
1255+push :: HasSpiderTimeline x => (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
10601256push f e = cacheEvent (pushCheap f e)
1061−{-
1062−push f e = eventPush $ Push
1063− { pushCompute = f
1064− , pushParent = e
1065− , pushSubscribed = unsafeNewIORef (f, e) Nothing --TODO: Does the use of the tuple here create unnecessary overhead?
1066− }
1067−-- DISABLED: {- RULES "push/push" forall f g e. push f (push g e) = push (maybe (return Nothing) f <=< g) e #-}
1068−-}
10691257
10701258{-# INLINABLE pull #-}
10711259pull :: BehaviorM x a -> Behavior x a
1072−pull a = behaviorPull $ Pull
1073− { pullCompute = a
1074− , pullValue = unsafeNewIORef a Nothing
1260+pull a = unsafePerformIO $ do
1261+ ref <- newIORef Nothing
10751262#ifdef DEBUG_NODEIDS
1076− , pullNodeId = unsafeNodeId a
1263+ nid <- newNodeId
10771264#endif
1078− }
1265+ pure $ behaviorPull $ Pull
1266+ { pullCompute = a
1267+ , pullValue = ref
1268+#ifdef DEBUG_NODEIDS
1269+ , pullNodeId = nid
1270+#endif
1271+ }
10791272
10801273{-# INLINABLE switch #-}
1081−switch :: Behavior x (Event x a) -> Event x a
1082−switch a = eventSwitch $ Switch
1083− { switchParent = a
1084− , switchSubscribed = unsafeNewIORef a Nothing
1085− }
1274+switch :: HasSpiderTimeline x => Behavior x (Event x a) -> Event x a
1275+switch a = unsafePerformIO $ do
1276+ ref <- newIORef Nothing
1277+ pure $ eventSwitch $ Switch
1278+ { switchParent = a
1279+ , switchSubscribed = ref
1280+ }
10861281
1087−coincidence :: Event x (Event x a) -> Event x a
1088−coincidence a = eventCoincidence $ Coincidence
1089− { coincidenceParent = a
1090− , coincidenceSubscribed = unsafeNewIORef a Nothing
1091− }
1282+coincidence :: HasSpiderTimeline x => Event x (Event x a) -> Event x a
1283+coincidence a = unsafePerformIO $ do
1284+ ref <- newIORef Nothing
1285+ pure $ eventCoincidence $ Coincidence
1286+ { coincidenceParent = a
1287+ , coincidenceSubscribed = ref
1288+ }
10921289
10931290-- Propagate the given event occurrence; before cleaning up, run the given action, which may read the state of events and behaviors
1094−run :: [DSum (RootTrigger x) Identity] -> ResultM x b -> SpiderHost x b
1291+run :: forall x b. HasSpiderTimeline x => [DSum (RootTrigger x) Identity] -> ResultM x b -> SpiderHost x b
10951292run roots after = do
1096− tracePropagate $ "Running an event frame with " <> show (length roots) <> " events"
1097− spiderTimeline <- SpiderHost ask
1098− result <- SpiderHost $ lift $ withMVar (_spiderTimeline_lock spiderTimeline) $ \_ -> flip runReaderT spiderTimeline $ unSpiderHost $ runFrame $ do
1293+ tracePropagate (Proxy :: Proxy x) $ "Running an event frame with " <> show (length roots) <> " events"
1294+ let t = spiderTimeline :: SpiderTimelineEnv x
1295+ result <- SpiderHost $ withMVar (_spiderTimeline_lock (unSTE t)) $ \_ -> unSpiderHost $ runFrame $ do
10991296 rootsToPropagate <- forM roots $ \r@(RootTrigger (_, occRef, k) :=> a) -> do
11001297 occBefore <- liftIO $ do
11011298 occBefore <- readIORef occRef
@@ -1107,13 +1304,13 @@ run roots after = do
11071304 else return Nothing
11081305 forM_ (catMaybes rootsToPropagate) $ \(RootTrigger (subscribersRef, _, _) :=> Identity a) -> do
11091306 propagate a subscribersRef
1110− delayedRef <- EventM $ asks eventEnvDelayedMerges
1307+ delayedRef <- asksEventEnv eventEnvDelayedMerges
11111308 let go = do
11121309 delayed <- liftIO $ readIORef delayedRef
11131310 case IntMap.minViewWithKey delayed of
11141311 Nothing -> return ()
11151312 Just ((currentHeight, cur), future) -> do
1116− tracePropagate $ "Running height " ++ show currentHeight
1313+ tracePropagate (Proxy :: Proxy x) $ "Running height " ++ show currentHeight
11171314 putCurrentHeight $ Height currentHeight
11181315 liftIO $ writeIORef delayedRef $! future
11191316 sequence_ cur
@@ -1121,10 +1318,10 @@ run roots after = do
11211318 go
11221319 putCurrentHeight maxBound
11231320 after
1124− tracePropagate "Done running an event frame"
1321+ tracePropagate (Proxy :: Proxy x) "Done running an event frame"
11251322 return result
11261323
1127−scheduleMerge' :: Height -> IORef Height -> EventM x () -> EventM x ()
1324+scheduleMerge' :: HasSpiderTimeline x => Height -> IORef Height -> EventM x () -> EventM x ()
11281325scheduleMerge' initialHeight heightRef a = scheduleMerge initialHeight $ do
11291326 height <- liftIO $ readIORef heightRef
11301327 currentHeight <- getCurrentHeight
@@ -1133,9 +1330,11 @@ scheduleMerge' initialHeight heightRef a = scheduleMerge initialHeight $ do
11331330 GT -> scheduleMerge' height heightRef a -- The height has been increased (by a coincidence event; TODO: is this the only way?)
11341331 EQ -> a
11351332
1136−data SomeClear = forall a. SomeClear (IORef (Maybe a))
1333+newtype Clear a = Clear (IORef (Maybe a))
1334+
1335+newtype IntClear a = IntClear (IORef (IntMap a))
11371336
1138−data SomeRootClear = forall k. SomeRootClear (IORef (DMap k Identity))
1337+newtype RootClear k = RootClear (IORef (DMap k Identity))
11391338
11401339data SomeAssignment x = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak (Invalidator x)]) a
11411340
@@ -1147,55 +1346,110 @@ mkWeakPtrWithDebug x debugNote = do
11471346 x' <- evaluate x
11481347 mkWeakPtr x' $
11491348 if debugFinalize
1150− then Just $ putStrLn $ "finalizing: " ++ debugNote
1349+ then Just $ debugStrLn $ "finalizing: " ++ debugNote
11511350 else Nothing
11521351
11531352type WeakList a = [Weak a]
11541353
1155−{-# INLINE withIncreasedDepth #-}
1354+type CanTrace x m = (HasSpiderTimeline x, MonadIO m)
1355+
1356+
1357+
1358+
11561359#ifdef DEBUG
1157−withIncreasedDepth :: CanTrace x m => m a -> m a
1158−withIncreasedDepth a = do
1159− spiderTimeline <- askSpiderTimeline
1160− liftIO $ modifyIORef' (_spiderTimeline_depth spiderTimeline) succ
1360+
1361+debugSubscriber :: forall x a. HasSpiderTimeline x => String -> Subscriber x a -> IO (Subscriber x a)
1362+debugSubscriber description = return . debugSubscriber' description
1363+
1364+debugSubscriber' :: forall x a. HasSpiderTimeline x => String -> Subscriber x a -> Subscriber x a
1365+debugSubscriber' description subscribed = Subscriber
1366+ {
1367+ subscriberPropagate = \m -> do
1368+ tracePropagate (Proxy :: Proxy x) ("subscriberPropagate: " <> description)
1369+ subscriberPropagate subscribed m
1370+ , subscriberInvalidateHeight = \old -> do
1371+ traceInvalidateHeight $ "invalidateSubscriberHeight: " <> description <> ", old = " <> show (unHeight old)
1372+ subscriberInvalidateHeight subscribed old
1373+ traceInvalidateHeight $ "invalidateSubscriberHeight: " <> description <> ", done"
1374+ , subscriberRecalculateHeight = \new -> do
1375+ traceInvalidateHeight $ "subscriberRecalculateHeight: " <> description <> ", new = " <> show (unHeight new)
1376+ subscriberRecalculateHeight subscribed new
1377+ traceInvalidateHeight $ "subscriberRecalculateHeight: " <> description <> ", done"
1378+ }
1379+
1380+
1381+{-# INLINE withIncreasedDepth #-}
1382+withIncreasedDepth :: forall proxy x m a. CanTrace x m => proxy x -> m a -> m a
1383+withIncreasedDepth _ a = do
1384+ liftIO $ modifyIORef' (_spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)) succ
11611385 result <- a
1162− liftIO $ modifyIORef' (_spiderTimeline_depth spiderTimeline) pred
1386+ liftIO $ modifyIORef' (_spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)) pred
11631387 return result
1164−#else
1165−withIncreasedDepth :: m a -> m a
1166−withIncreasedDepth = id
1167−#endif
1168−
1169−type CanTrace x m = (HasSpiderTimeline x m, MonadIO m)
11701388
11711389{-# INLINE tracePropagate #-}
1172−tracePropagate :: (CanTrace x m) => String -> m ()
1173−tracePropagate = traceWhen debugPropagate
1390+tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1391+tracePropagate p = when debugPropagate . trace p
11741392
11751393{-# INLINE traceInvalidate #-}
11761394traceInvalidate :: String -> IO ()
1177−traceInvalidate = when debugInvalidate . liftIO . putStrLn
1395+traceInvalidate = when debugInvalidate . liftIO . debugStrLn
11781396
1179−{-# INLINE traceWhen #-}
1180−traceWhen :: (CanTrace x m) => Bool -> String -> m ()
1181−traceWhen b message = traceMWhen b $ return message
1397+{-# INLINE traceInvalidateHeight #-}
1398+traceInvalidateHeight :: String -> IO ()
1399+traceInvalidateHeight = when debugInvalidateHeight . liftIO . debugStrLn
11821400
1183−{-# INLINE traceMWhen #-}
1184−traceMWhen :: (CanTrace x m) => Bool -> m String -> m ()
1185−traceMWhen b getMessage = when b $ do
1401+{-# INLINE trace #-}
1402+trace :: (CanTrace x m) => proxy x -> String -> m ()
1403+trace p message = traceM p $ return message
1404+
1405+{-# INLINE traceM #-}
1406+traceM :: forall x proxy m. (CanTrace x m) => proxy x -> m String -> m ()
1407+traceM _ getMessage = do
11861408 message <- getMessage
1187−#ifdef DEBUG
1188− spiderTimeline <- askSpiderTimeline
1189− d <- liftIO $ readIORef $ _spiderTimeline_depth spiderTimeline
1409+ d <- liftIO $ readIORef $ _spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)
1410+ liftIO $ debugStrLn $ replicate d ' ' <> message
1411+
11901412#else
1191− let d = 0
1413+
1414+{-# INLINE withIncreasedDepth #-}
1415+withIncreasedDepth :: proxy x -> m a -> m a
1416+withIncreasedDepth _ = id
1417+
1418+{-# INLINE tracePropagate #-}
1419+tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1420+tracePropagate _ _ = return ()
1421+
1422+{-# INLINE traceInvalidate #-}
1423+traceInvalidate :: String -> IO ()
1424+traceInvalidate _ = return ()
1425+
1426+{-# INLINE traceInvalidateHeight #-}
1427+traceInvalidateHeight :: String -> IO ()
1428+traceInvalidateHeight _ = return ()
1429+
1430+{-# INLINE debugSubscriber #-}
1431+debugSubscriber :: String -> Subscriber x a -> IO (Subscriber x a)
1432+debugSubscriber _ = return
1433+
1434+{-# INLINE debugSubscriber' #-}
1435+debugSubscriber' :: String -> Subscriber x a -> Subscriber x a
1436+debugSubscriber' _ = id
1437+
1438+
1439+
1440+{-# INLINE trace #-}
1441+trace :: (CanTrace x m) => proxy x -> String -> m ()
1442+trace _ _ = return ()
1443+
1444+{-# INLINE traceM #-}
1445+traceM :: (CanTrace x m) => proxy x -> m String -> m ()
1446+traceM _ _ = return ()
1447+
11921448#endif
1193− liftIO $ putStrLn $ replicate d ' ' <> message
11941449
11951450whoCreatedIORef :: IORef a -> IO [String]
11961451whoCreatedIORef (IORef a) = whoCreated $! a
11971452
1198−#ifdef DEBUG_CYCLES
11991453groupByHead :: Eq a => [NonEmpty a] -> [(a, NonEmpty [a])]
12001454groupByHead = \case
12011455 [] -> []
@@ -1206,20 +1460,54 @@ groupByHead = \case
12061460 | otherwise -> (x, xs :| []) : l
12071461
12081462listsToForest :: Eq a => [[a]] -> Forest a
1209−listsToForest l = fmap (\(a, l') -> Node a $ listsToForest $ toList l') $ groupByHead $ catMaybes $ fmap nonEmpty l
1463+listsToForest lists = buildForest <$> groupByHead (mapMaybe nonEmpty lists)
1464+ where buildForest (a, lists') = Node a $ listsToForest $ toList lists'
1465+
1466+showStacks :: [[String]] -> String
1467+showStacks = drawForest . listsToForest . fmap (filterStack "Reflex.Spider.Internal")
1468+
1469+filterStack :: String -> [String] -> [String]
1470+#ifdef DEBUG_HIDE_INTERNALS
1471+filterStack prefix = filter (not . (prefix `isPrefixOf`))
1472+#else
1473+filterStack prefix = id
12101474#endif
12111475
1476+#ifdef DEBUG_CYCLES
1477+
1478+data EventLoopException = EventLoopException [[String]]
1479+instance Exception EventLoopException
1480+
1481+instance Show EventLoopException where
1482+ show (EventLoopException stacks) = "causality loop detected:\n" <> if null stacks
1483+ then "no location information, compile with profiling enabled for stack tree"
1484+ else showStacks stacks
1485+
1486+#else
1487+
1488+data EventLoopException = EventLoopException
1489+instance Exception EventLoopException
1490+
1491+instance Show EventLoopException where
1492+ show EventLoopException = "causality loop detected: \n" <>
1493+ "compile reflex with flag 'debug-cycles' and compile with profiling enabled for stack tree"
1494+
1495+#endif
1496+
1497+
12121498{-# INLINE propagateSubscriberHold #-}
1213−propagateSubscriberHold :: R.Patch p => Hold x p -> p -> EventM x ()
1499+propagateSubscriberHold :: forall x p. (HasSpiderTimeline x, Patch p) => Hold x p -> p -> EventM x ()
12141500propagateSubscriberHold h a = do
1215− {-# SCC "trace" #-} traceMWhen debugPropagate $ liftIO $ do
1501+ {-# SCC "trace" #-} when debugPropagate $ traceM (Proxy :: Proxy x) $ liftIO $ do
12161502 invalidators <- liftIO $ readIORef $ holdInvalidators h
12171503 return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
1504+
12181505 v <- {-# SCC "read" #-} liftIO $ readIORef $ holdValue h
1219− case {-# SCC "apply" #-} R.apply a v of
1506+ case {-# SCC "apply" #-} apply a v of
12201507 Nothing -> return ()
12211508 Just v' -> do
1222− {-# SCC "trace2" #-} withIncreasedDepth $ tracePropagate $ "propagateSubscriberHold: assigning Hold" <> showNodeId h
1509+ {-# SCC "trace2" #-} withIncreasedDepth (Proxy :: Proxy x) $
1510+ tracePropagate (Proxy :: Proxy x) ("propagateSubscriberHold: assigning Hold" <> showNodeId h)
12231511 vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
12241512 iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
12251513 defer $ {-# SCC "assignment" #-} SomeAssignment vRef iRef v'
@@ -1227,56 +1515,53 @@ propagateSubscriberHold h a = do
12271515data SomeResetCoincidence x = forall a. SomeResetCoincidence !(EventSubscription x) !(Maybe (CoincidenceSubscribed x a)) -- The CoincidenceSubscriber will be present only if heights need to be reset
12281516
12291517runBehaviorM :: BehaviorM x a -> Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]) -> IORef [SomeHoldInit x] -> IO a
1230−runBehaviorM a mwi holdInits = runReaderT (unBehaviorM a) (mwi, holdInits)
1518+runBehaviorM a mwi holdInits = runReaderIO (unBehaviorM a) (mwi, holdInits)
12311519
12321520askInvalidator :: BehaviorM x (Maybe (Weak (Invalidator x)))
12331521askInvalidator = do
1234− (!m, _) <- BehaviorM ask
1522+ (!m, _) <- ask
12351523 case m of
12361524 Nothing -> return Nothing
12371525 Just (!wi, _) -> return $ Just wi
12381526
12391527askParentsRef :: BehaviorM x (Maybe (IORef [SomeBehaviorSubscribed x]))
12401528askParentsRef = do
1241− (!m, _) <- BehaviorM ask
1529+ (!m, _) <- ask
12421530 case m of
12431531 Nothing -> return Nothing
12441532 Just (_, !p) -> return $ Just p
12451533
12461534askBehaviorHoldInits :: BehaviorM x (IORef [SomeHoldInit x])
12471535askBehaviorHoldInits = do
1248− (_, !his) <- BehaviorM ask
1536+ (_, !his) <- ask
12491537 return his
12501538
12511539{-# INLINE getDynHold #-}
1252−getDynHold :: (Defer (SomeHoldInit x) m, R.Patch p) => Dyn x p -> m (Hold x p)
1540+getDynHold :: (Defer (SomeHoldInit x) m, Patch p) => Dyn x p -> m (Hold x p)
12531541getDynHold d = do
12541542 mh <- liftIO $ readIORef $ unDyn d
12551543 case mh of
1256− Right h -> return h
1257− Left (readV0, v') -> do
1544+ HoldDyn h -> return h
1545+ UnsafeDyn (readV0, v') -> do
12581546 holdInits <- getDeferralQueue
12591547 v0 <- liftIO $ runBehaviorM readV0 Nothing holdInits
1548+ hold' v0 v'
1549+ BuildDyn (readV0, v') -> do
1550+ v0 <- liftIO $ runEventM readV0
1551+ hold' v0 v'
1552+ where
1553+ hold' v0 v' = do
12601554 h <- hold v0 v'
1261− liftIO $ writeIORef (unDyn d) $ Right h
1555+ liftIO $ writeIORef (unDyn d) $ HoldDyn h
12621556 return h
12631557
1558+
12641559-- Always refers to 0
12651560{-# NOINLINE zeroRef #-}
12661561zeroRef :: IORef Height
12671562zeroRef = unsafePerformIO $ newIORef zeroHeight
12681563
1269−type CanSubscribe x m =
1270− ( HasSpiderTimeline x m
1271− , HasCurrentHeight x m
1272− , Defer (SomeHoldInit x) m, Defer (SomeMergeInit x) m -- The things we need to lazily initialize state
1273− , Defer SomeClear m -- Wiping out event firings
1274− , Defer (SomeAssignment x) m -- Updating state
1275− , Defer (SomeResetCoincidence x) m
1276− , m ~ EventM x
1277− )
1278−
1279−getRootSubscribed :: GCompare k => k a -> Root x k -> Subscriber x a -> IO (WeakBagTicket, RootSubscribed x a, Maybe a)
1564+getRootSubscribed :: forall k x a. (GCompare k, HasSpiderTimeline x) => k a -> Root x k -> Subscriber x a -> IO (WeakBagTicket, RootSubscribed x a, Maybe a)
12801565getRootSubscribed k r sub = do
12811566 mSubscribed <- readIORef $ rootSubscribed r
12821567 let getOcc = fmap (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
@@ -1290,10 +1575,15 @@ getRootSubscribed k r sub = do
12901575 let !cached = rootSubscribed r
12911576 uninitRef <- newIORef $ error "getRootsubscribed: uninitRef not initialized"
12921577 (subs, sln) <- WeakBag.singleton sub weakSelf cleanupRootSubscribed
1293− when debugPropagate $ putStrLn $ "getRootSubscribed: calling rootInit"
1578+
1579+ tracePropagate (Proxy::Proxy x) $ "getRootSubscribed: calling rootInit"
1580+
12941581 uninit <- rootInit r k $ RootTrigger (subs, rootOccurrence r, k)
12951582 writeIORef uninitRef $! uninit
1296− let subscribed = RootSubscribed
1583+#ifdef DEBUG_NODEIDS
1584+ nid <- newNodeId
1585+#endif
1586+ let !subscribed = RootSubscribed
12971587 { rootSubscribedKey = k
12981588 , rootSubscribedCachedSubscribed = cached
12991589 , rootSubscribedOccurrence = getOcc
@@ -1301,17 +1591,29 @@ getRootSubscribed k r sub = do
13011591 , rootSubscribedUninit = uninit
13021592 , rootSubscribedWeakSelf = weakSelf
13031593#ifdef DEBUG_NODEIDS
1304− , rootSubscribedNodeId = unsafeNodeId (k, r, subs)
1594+ , rootSubscribedNodeId = nid
13051595#endif
13061596 }
1307− writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "RootSubscribed"
1597+ -- If we die at the same moment that all our children die, they will
1598+ -- try to clean us up but will fail because their Weak reference to us
1599+ -- will also be dead. So, if we are dying, check if there are any
1600+ -- children; since children don't bother cleaning themselves up if
1601+ -- their parents are already dead, I don't think there's a race
1602+ -- condition here. However, if there are any children, then we can
1603+ -- infer that we need to clean ourselves up, so we do.
1604+ finalCleanup = do
1605+ cs <- readIORef $ _weakBag_children subs
1606+ when (not $ IntMap.null cs) (cleanupRootSubscribed subscribed)
1607+ writeIORef weakSelf =<< evaluate =<< mkWeakPtr subscribed (Just finalCleanup)
13081608 modifyIORef' (rootSubscribed r) $ DMap.insertWith (error $ "getRootSubscribed: duplicate key inserted into Root") k subscribed --TODO: I think we can just write back mSubscribed rather than re-reading it
13091609 occ <- getOcc
13101610 return (sln, subscribed, occ)
13111611
1612+#ifdef USE_TEMPLATE_HASKELL
13121613{-# ANN cleanupRootSubscribed "HLint: ignore Redundant bracket" #-}
1614+#endif
13131615cleanupRootSubscribed :: RootSubscribed x a -> IO ()
1314−cleanupRootSubscribed self@(RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached }) = do
1616+cleanupRootSubscribed self@RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached } = do
13151617 rootSubscribedUninit self
13161618 modifyIORef' cached $ DMap.delete k
13171619
@@ -1319,8 +1621,90 @@ cleanupRootSubscribed self@(RootSubscribed { rootSubscribedKey = k, rootSubscrib
13191621subscribeRootSubscribed :: RootSubscribed x a -> Subscriber x a -> IO WeakBagTicket
13201622subscribeRootSubscribed subscribed sub = WeakBag.insert sub (rootSubscribedSubscribers subscribed) (rootSubscribedWeakSelf subscribed) cleanupRootSubscribed
13211623
1322−{-# SPECIALIZE getFanSubscribed :: GCompare k => k a -> Fan x k -> Subscriber x a -> EventM x (WeakBagTicket, FanSubscribed x k, Maybe a) #-}
1323−getFanSubscribed :: (Defer (SomeAssignment x) m, Defer (SomeHoldInit x) m, Defer (SomeMergeInit x) m, Defer SomeClear m, HasCurrentHeight x m, Defer (SomeResetCoincidence x) m, HasSpiderTimeline x m, m ~ EventM x, GCompare k) => k a -> Fan x k -> Subscriber x a -> m (WeakBagTicket, FanSubscribed x k, Maybe a)
1624+newtype EventSelectorInt x a = EventSelectorInt { selectInt :: Int -> Event x a }
1625+
1626+data FanInt x a = FanInt
1627+ { _fanInt_subscribers :: {-# UNPACK #-} !(FastMutableIntMap (FastWeakBag (Subscriber x a))) --TODO: Clean up the keys in here when their child weak bags get empty --TODO: Remove our own subscription when the subscribers list is completely empty
1628+ , _fanInt_subscriptionRef :: {-# UNPACK #-} !(IORef (EventSubscription x)) -- This should have a valid subscription iff subscribers is non-empty
1629+ , _fanInt_occRef :: {-# UNPACK #-} !(IORef (IntMap a))
1630+#ifdef DEBUG_NODEIDS
1631+ , _fanInt_nodeId :: {-# UNPACK #-} !Int
1632+#endif
1633+ }
1634+
1635+newFanInt :: IO (FanInt x a)
1636+newFanInt = do
1637+ subscribers <- FastMutableIntMap.newEmpty --TODO: Clean up the keys in here when their child weak bags get empty --TODO: Remove our own subscription when the subscribers list is completely empty
1638+ subscriptionRef <- newIORef $ error "fanInt: no subscription"
1639+ occRef <- newIORef $ error "fanInt: no occurrence"
1640+#ifdef DEBUG_NODEIDS
1641+ nodeId <- newNodeId
1642+#endif
1643+ return $ FanInt
1644+ { _fanInt_subscribers = subscribers
1645+ , _fanInt_subscriptionRef = subscriptionRef
1646+ , _fanInt_occRef = occRef
1647+#ifdef DEBUG_NODEIDS
1648+ , _fanInt_nodeId = nodeId
1649+#endif
1650+ }
1651+
1652+fanInt :: HasSpiderTimeline x => Event x (IntMap a) -> EventSelectorInt x a
1653+fanInt p = unsafePerformIO $ do
1654+ self <- newFanInt
1655+ pure $ EventSelectorInt $ \k -> Event $ \sub -> do
1656+ isEmpty <- liftIO $ FastMutableIntMap.isEmpty (_fanInt_subscribers self)
1657+ when isEmpty $ do -- This is the first subscriber, so we need to subscribe to our input
1658+ let desc = "fanInt" <> showNodeId self <> ", k = " <> show k
1659+ (subscription, parentOcc) <- subscribeAndRead p $ debugSubscriber' desc $ Subscriber
1660+ { subscriberPropagate = \m -> do
1661+ liftIO $ writeIORef (_fanInt_occRef self) m
1662+ scheduleIntClear $ _fanInt_occRef self
1663+ FastMutableIntMap.forIntersectionWithImmutable_ (_fanInt_subscribers self) m $ \b v -> --TODO: Do we need to know that no subscribers are being added as we traverse?
1664+ FastWeakBag.traverse_ b $ \s ->
1665+ subscriberPropagate s v
1666+ , subscriberInvalidateHeight = \old ->
1667+ FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1668+ FastWeakBag.traverse_ b $ \s ->
1669+ subscriberInvalidateHeight s old
1670+ , subscriberRecalculateHeight = \new ->
1671+ FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1672+ FastWeakBag.traverse_ b $ \s ->
1673+ subscriberRecalculateHeight s new
1674+ }
1675+ liftIO $ do
1676+ writeIORef (_fanInt_subscriptionRef self) subscription
1677+ writeIORef (_fanInt_occRef self) $ fromMaybe IntMap.empty parentOcc
1678+ scheduleIntClear $ _fanInt_occRef self
1679+ liftIO $ do
1680+ b <- FastMutableIntMap.lookup (_fanInt_subscribers self) k >>= \case
1681+ Nothing -> do
1682+ b <- FastWeakBag.empty
1683+ FastMutableIntMap.insert (_fanInt_subscribers self) k b
1684+ return b
1685+ Just b -> return b
1686+ ticket <- liftIO $ FastWeakBag.insert sub b
1687+ currentOcc <- readIORef (_fanInt_occRef self)
1688+
1689+ subscribed <- fanIntSubscribed ticket self
1690+ return (EventSubscription (FastWeakBag.remove ticket) subscribed, IntMap.lookup k currentOcc)
1691+
1692+fanIntSubscribed :: FastWeakBagTicket k -> FanInt x a -> IO (EventSubscribed x)
1693+fanIntSubscribed ticket self = do
1694+ subscribedParent <- _eventSubscription_subscribed <$> readIORef (_fanInt_subscriptionRef self)
1695+ return $ EventSubscribed
1696+ { eventSubscribedHeightRef = eventSubscribedHeightRef subscribedParent
1697+ , eventSubscribedRetained = toAny (_fanInt_subscriptionRef self, ticket)
1698+#ifdef DEBUG_CYCLES
1699+ , eventSubscribedGetParents = return [subscribedParent]
1700+ , eventSubscribedHasOwnHeightRef = False
1701+ , eventSubscribedWhoCreated = whoCreatedIORef $ _fanInt_subscriptionRef self
1702+#endif
1703+ }
1704+
1705+
1706+{-# INLINABLE getFanSubscribed #-}
1707+getFanSubscribed :: (HasSpiderTimeline x, GCompare k) => k a -> Fan x k v -> Subscriber x (v a) -> EventM x (WeakBagTicket, FanSubscribed x k v, Maybe (v a))
13241708getFanSubscribed k f sub = do
13251709 mSubscribed <- liftIO $ readIORef $ fanSubscribed f
13261710 case mSubscribed of
@@ -1338,13 +1722,16 @@ getFanSubscribed k f sub = do
13381722 subscribersRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribersRef not yet initialized"
13391723 occRef <- liftIO $ newIORef parentOcc
13401724 when (isJust parentOcc) $ scheduleClear occRef
1725+#ifdef DEBUG_NODEIDS
1726+ nid <- liftIO newNodeId
1727+#endif
13411728 let subscribed = FanSubscribed
13421729 { fanSubscribedCachedSubscribed = fanSubscribed f
13431730 , fanSubscribedOccurrence = occRef
13441731 , fanSubscribedParent = subscription
13451732 , fanSubscribedSubscribers = subscribersRef
13461733#ifdef DEBUG_NODEIDS
1347− , fanSubscribedNodeId = unsafeNodeId f
1734+ , fanSubscribedNodeId = nid
13481735#endif
13491736 }
13501737 let !self = (k, subscribed)
@@ -1354,7 +1741,7 @@ getFanSubscribed k f sub = do
13541741 liftIO $ writeIORef (fanSubscribed f) $ Just subscribed
13551742 return (slnForSub, subscribed, coerce $ DMap.lookup k =<< parentOcc)
13561743
1357−cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k) -> IO ()
1744+cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k v) -> IO ()
13581745cleanupFanSubscribed (k, subscribed) = do
13591746 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
13601747 let reducedSubscribers = DMap.delete k subscribers
@@ -1366,7 +1753,7 @@ cleanupFanSubscribed (k, subscribed) = do
13661753 else writeIORef (fanSubscribedSubscribers subscribed) $! reducedSubscribers
13671754
13681755{-# INLINE subscribeFanSubscribed #-}
1369−subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k -> Subscriber x a -> IO WeakBagTicket
1756+subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k v -> Subscriber x (v a) -> IO WeakBagTicket
13701757subscribeFanSubscribed k subscribed sub = do
13711758 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
13721759 case DMap.lookup k subscribers of
@@ -1378,8 +1765,8 @@ subscribeFanSubscribed k subscribed sub = do
13781765 return sln
13791766 Just (FanSubscribedChildren list _ weakSelf) -> {-# SCC "hitSubscribeFanSubscribed" #-} WeakBag.insert sub list weakSelf cleanupFanSubscribed
13801767
1381−{-# SPECIALIZE getSwitchSubscribed :: Switch x a -> Subscriber x a -> EventM x (WeakBagTicket, SwitchSubscribed x a, Maybe a) #-}
1382−getSwitchSubscribed :: (Defer (SomeHoldInit x) m, Defer (SomeAssignment x) m, Defer (SomeMergeInit x) m, Defer SomeClear m, Defer (SomeResetCoincidence x) m, HasCurrentHeight x m, HasSpiderTimeline x m, m ~ EventM x) => Switch x a -> Subscriber x a -> m (WeakBagTicket, SwitchSubscribed x a, Maybe a)
1768+{-# INLINABLE getSwitchSubscribed #-}
1769+getSwitchSubscribed :: HasSpiderTimeline x => Switch x a -> Subscriber x a -> EventM x (WeakBagTicket, SwitchSubscribed x a, Maybe a)
13831770getSwitchSubscribed s sub = do
13841771 mSubscribed <- liftIO $ readIORef $ switchSubscribed s
13851772 case mSubscribed of
@@ -1404,6 +1791,9 @@ getSwitchSubscribed s sub = do
14041791 when (isJust parentOcc) $ scheduleClear occRef
14051792 weakSelf <- liftIO $ newIORef $ error "getSwitchSubscribed: weakSelf not yet initialized"
14061793 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupSwitchSubscribed
1794+#ifdef DEBUG_NODEIDS
1795+ nid <- liftIO newNodeId
1796+#endif
14071797 let !subscribed = SwitchSubscribed
14081798 { switchSubscribedCachedSubscribed = switchSubscribed s
14091799 , switchSubscribedOccurrence = occRef
@@ -1416,7 +1806,7 @@ getSwitchSubscribed s sub = do
14161806 , switchSubscribedCurrentParent = subscriptionRef
14171807 , switchSubscribedWeakSelf = weakSelf
14181808#ifdef DEBUG_NODEIDS
1419− , switchSubscribedNodeId = unsafeNodeId s
1809+ , switchSubscribedNodeId = nid
14201810#endif
14211811 }
14221812 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "switchSubscribedWeakSelf"
@@ -1434,8 +1824,8 @@ cleanupSwitchSubscribed subscribed = do
14341824subscribeSwitchSubscribed :: SwitchSubscribed x a -> Subscriber x a -> IO WeakBagTicket
14351825subscribeSwitchSubscribed subscribed sub = WeakBag.insert sub (switchSubscribedSubscribers subscribed) (switchSubscribedWeakSelf subscribed) cleanupSwitchSubscribed
14361826
1437−{-# SPECIALIZE getCoincidenceSubscribed :: Coincidence x a -> Subscriber x a -> EventM x (WeakBagTicket, CoincidenceSubscribed x a, Maybe a) #-}
1438−getCoincidenceSubscribed :: forall x a m. (Defer (SomeAssignment x) m, Defer (SomeHoldInit x) m, Defer (SomeMergeInit x) m, Defer SomeClear m, HasCurrentHeight x m, Defer (SomeResetCoincidence x) m, HasSpiderTimeline x m, m ~ EventM x) => Coincidence x a -> Subscriber x a -> m (WeakBagTicket, CoincidenceSubscribed x a, Maybe a)
1827+{-# INLINABLE getCoincidenceSubscribed #-}
1828+getCoincidenceSubscribed :: forall x a. HasSpiderTimeline x => Coincidence x a -> Subscriber x a -> EventM x (WeakBagTicket, CoincidenceSubscribed x a, Maybe a)
14391829getCoincidenceSubscribed c sub = do
14401830 mSubscribed <- liftIO $ readIORef $ coincidenceSubscribed c
14411831 case mSubscribed of
@@ -1461,6 +1851,9 @@ getCoincidenceSubscribed c sub = do
14611851 scheduleClear innerSubdRef
14621852 weakSelf <- liftIO $ newIORef $ error "getCoincidenceSubscribed: weakSelf not yet implemented"
14631853 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupCoincidenceSubscribed
1854+#ifdef DEBUG_NODEIDS
1855+ nid <- liftIO newNodeId
1856+#endif
14641857 let subscribed = CoincidenceSubscribed
14651858 { coincidenceSubscribedCachedSubscribed = coincidenceSubscribed c
14661859 , coincidenceSubscribedOccurrence = occRef
@@ -1471,7 +1864,7 @@ getCoincidenceSubscribed c sub = do
14711864 , coincidenceSubscribedInnerParent = innerSubdRef
14721865 , coincidenceSubscribedWeakSelf = weakSelf
14731866#ifdef DEBUG_NODEIDS
1474− , coincidenceSubscribedNodeId = unsafeNodeId c
1867+ , coincidenceSubscribedNodeId = nid
14751868#endif
14761869 }
14771870 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "CoincidenceSubscribed"
@@ -1488,79 +1881,260 @@ cleanupCoincidenceSubscribed subscribed = do
14881881subscribeCoincidenceSubscribed :: CoincidenceSubscribed x a -> Subscriber x a -> IO WeakBagTicket
14891882subscribeCoincidenceSubscribed subscribed sub = WeakBag.insert sub (coincidenceSubscribedSubscribers subscribed) (coincidenceSubscribedWeakSelf subscribed) cleanupCoincidenceSubscribed
14901883
1491−{-# INLINE merge #-}
1492−merge :: forall k x. GCompare k => Dynamic x (R.PatchDMap k (Event x)) -> Event x (DMap k Identity)
1493−merge d = cacheEvent $ Event $ \sub -> do
1494− initialParents <- readBehaviorUntracked $ dynamicCurrent d
1495− accumRef <- liftIO $ newIORef $ error "merge: accumRef not yet initialized"
1496− heightRef <- liftIO $ newIORef $ error "merge: heightRef not yet initialized"
1497− heightBagRef <- liftIO $ newIORef $ error "merge: heightBagRef not yet initialized"
1498− parentsRef <- liftIO $ newIORef $ error "merge: parentsRef not yet initialized"
1499− let scheduleSelf height = scheduleMerge' height heightRef $ do
1500− m <- liftIO $ readIORef accumRef
1501− liftIO $ writeIORef accumRef $! DMap.empty
1502− --TODO: Assert that m is not empty
1503− subscriberPropagate sub m
1504− invalidateMyHeight = do
1505− oldHeight <- readIORef heightRef
1506− when (oldHeight /= invalidHeight) $ do -- If the height used to be valid, it must be invalid now; we should never have *more* heights than we have parents
1507− writeIORef heightRef $! invalidHeight
1508− subscriberInvalidateHeight sub oldHeight
1509− revalidateMyHeight = do
1510− currentHeight <- readIORef heightRef
1511− when (currentHeight == invalidHeight) $ do -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
1512− heights <- readIORef heightBagRef
1513− parents <- readIORef parentsRef
1514− -- When the number of heights in the bag reaches the number of parents, we should have a valid height
1515− case heightBagSize heights `compare` DMap.size parents of
1516− LT -> return ()
1517− EQ -> do
1518− let height = succHeight $ heightBagMax heights
1519− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: height: " <> show height
1520− writeIORef heightRef $! height
1521− subscriberRecalculateHeight sub height
1522− GT -> error $ "revalidateMergeHeight: more heights than parents for Merge"
1523− subscriber :: forall a. k a -> Subscriber x a
1524− subscriber k = Subscriber
1525− { subscriberPropagate = \a -> do
1526− oldM <- liftIO $ readIORef accumRef
1527− let newM = DMap.insertWith (error $ "Same key fired multiple times for Merge") k (Identity a) oldM
1528− tracePropagate $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
1529− liftIO $ writeIORef accumRef $! newM
1530− when (DMap.null oldM) $ do -- Only schedule the firing once
1531− height <- liftIO $ readIORef heightRef
1532− --TODO: assertions about height
1533− currentHeight <- getCurrentHeight
1534− when (height <= currentHeight) $ do
1535− if height /= invalidHeight
1536− then do
1537− myStack <- liftIO $ whoCreatedIORef undefined --TODO
1538− error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
1539− else liftIO $ do
1884+{-# INLINE mergeG #-}
1885+mergeG :: forall k q x v. (HasSpiderTimeline x, GCompare k)
1886+ => (forall a. q a -> Event x (v a))
1887+ -> DynamicS x (PatchDMap k q) -> Event x (DMap k v)
1888+mergeG nt d = cacheEvent (mergeCheap nt d)
1889+
1890+{-# INLINE mergeWithMove #-}
1891+mergeWithMove :: forall k v q x. (HasSpiderTimeline x, GCompare k)
1892+ => (forall a. q a -> Event x (v a))
1893+ -> DynamicS x (PatchDMapWithMove k q) -> Event x (DMap k v)
1894+mergeWithMove nt d = cacheEvent (mergeCheapWithMove nt d)
1895+
1896+{-# INLINE [1] mergeCheap #-}
1897+mergeCheap
1898+ :: forall k x q v. (HasSpiderTimeline x, GCompare k)
1899+ => (forall a. q a -> Event x (v a))
1900+ -> DynamicS x (PatchDMap k q)
1901+ -> Event x (DMap k v)
1902+mergeCheap nt = mergeGCheap' unMergeSubscribedParent getInitialSubscribers updateMe destroy
1903+ where
1904+ updateMe :: MergeUpdateFunc k v x (PatchDMap k q) (MergeSubscribedParent x)
1905+ updateMe subscriber heightBagRef oldParents (PatchDMap p) = do
1906+ let f (subscriptionsToKill, ps) (k :=> ComposeMaybe me) = do
1907+ (mOldSubd, newPs) <- case me of
1908+ Nothing -> return $ DMap.updateLookupWithKey (\_ _ -> Nothing) k ps
1909+ Just e -> do
1910+ let s = subscriber $ return k
1911+ subscription@(EventSubscription _ subd) <- subscribe (nt e) s
1912+ newParentHeight <- liftIO $ getEventSubscribedHeight subd
1913+ let newParent = MergeSubscribedParent subscription
1914+ liftIO $ modifyIORef' heightBagRef $ heightBagAdd newParentHeight
1915+ return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
1916+ forM_ mOldSubd $ \oldSubd -> do
1917+ oldHeight <- liftIO $ getEventSubscribedHeight $
1918+ _eventSubscription_subscribed $ unMergeSubscribedParent oldSubd
1919+
1920+ liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
1921+ return (maybeToList (unMergeSubscribedParent <$> mOldSubd) ++ subscriptionsToKill, newPs)
1922+ foldM f ([], oldParents) $ DMap.toList p
1923+
1924+ getInitialSubscribers :: MergeInitFunc k v q x (MergeSubscribedParent x)
1925+ getInitialSubscribers initialParents subscriber = do
1926+ subscribers <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
1927+ let s = subscriber $ return k
1928+ (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead (nt e) s
1929+ height <- liftIO $ getEventSubscribedHeight parentSubd
1930+ return (fmap (k :=>) parentOcc, height, k :=> MergeSubscribedParent subscription)
1931+ return ( DMap.fromDistinctAscList $ mapMaybe (\(x, _, _) -> x) subscribers
1932+ , fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
1933+ , DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1934+ )
1935+
1936+ destroy :: MergeDestroyFunc k (MergeSubscribedParent x)
1937+ destroy s = forM_ (DMap.toList s) $ \(_ :=> MergeSubscribedParent sub) -> unsubscribe sub
1938+
1939+{-# INLINE [1] mergeCheapWithMove #-}
1940+mergeCheapWithMove :: forall k x v q. (HasSpiderTimeline x, GCompare k)
1941+ => (forall a. q a -> Event x (v a))
1942+ -> DynamicS x (PatchDMapWithMove k q)
1943+ -> Event x (DMap k v)
1944+mergeCheapWithMove nt = mergeGCheap' _mergeSubscribedParentWithMove_subscription getInitialSubscribers updateMe destroy
1945+ where
1946+ updateMe :: MergeUpdateFunc k v x (PatchDMapWithMove k q) (MergeSubscribedParentWithMove x k)
1947+ updateMe subscriber heightBagRef oldParents p = do
1948+ -- Prepare new parents for insertion
1949+ let subscribeParent :: forall a. k a -> Event x (v a) -> EventM x (MergeSubscribedParentWithMove x k a)
1950+ subscribeParent k e = do
1951+ keyRef <- liftIO $ newIORef k
1952+ let s = subscriber $ liftIO $ readIORef keyRef
1953+ subscription@(EventSubscription _ subd) <- subscribe e s
1954+ liftIO $ do
1955+ newParentHeight <- getEventSubscribedHeight subd
1956+ modifyIORef' heightBagRef $ heightBagAdd newParentHeight
1957+ return $ MergeSubscribedParentWithMove subscription keyRef
1958+ p' <- PatchDMapWithMove.traversePatchDMapWithMoveWithKey (\k q -> subscribeParent k (nt q)) p
1959+ -- Collect old parents for deletion and update the keys of moved parents
1960+ let moveOrDelete :: forall a. k a -> PatchDMapWithMove.NodeInfo k q a -> MergeSubscribedParentWithMove x k a -> Constant (EventM x (Maybe (EventSubscription x))) a
1961+ moveOrDelete _ ni parent = Constant $ case getComposeMaybe $ PatchDMapWithMove._nodeInfo_to ni of
1962+ Nothing -> do
1963+ oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $
1964+ _mergeSubscribedParentWithMove_subscription parent
1965+
1966+ liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
1967+ return $ Just $ _mergeSubscribedParentWithMove_subscription parent
1968+ Just toKey -> do
1969+ liftIO $ writeIORef (_mergeSubscribedParentWithMove_key parent) $! toKey
1970+ return Nothing
1971+ toDelete <- fmap catMaybes $ mapM (\(_ :=> v) -> getConstant v) $ DMap.toList $
1972+ DMap.intersectionWithKey moveOrDelete (unPatchDMapWithMove p) oldParents
1973+
1974+ return (toDelete, applyAlways p' oldParents)
1975+ getInitialSubscribers :: MergeInitFunc k v q x (MergeSubscribedParentWithMove x k)
1976+ getInitialSubscribers initialParents subscriber = do
1977+ subscribers <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
1978+ keyRef <- liftIO $ newIORef k
1979+ let s = subscriber $ liftIO $ readIORef keyRef
1980+ (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead (nt e) s
1981+ height <- liftIO $ getEventSubscribedHeight parentSubd
1982+ return (fmap (k :=>) parentOcc, height, k :=> MergeSubscribedParentWithMove subscription keyRef)
1983+ return ( DMap.fromDistinctAscList $ mapMaybe (\(x, _, _) -> x) subscribers
1984+ , fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
1985+ , DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1986+ )
1987+
1988+ destroy :: MergeDestroyFunc k (MergeSubscribedParentWithMove x k)
1989+ destroy s = forM_ (DMap.toList s) $ \(_ :=> MergeSubscribedParentWithMove sub _) -> unsubscribe sub
1990+
1991+type MergeUpdateFunc k v x p s
1992+ = (forall a. EventM x (k a) -> Subscriber x (v a))
1993+ -> IORef HeightBag
1994+ -> DMap k s
1995+ -> p
1996+ -> EventM x ([EventSubscription x], DMap k s)
1997+
1998+type MergeGetSubscription x s = forall a. s a -> EventSubscription x
1999+
2000+type MergeInitFunc k v q x s
2001+ = DMap k q
2002+ -> (forall a. EventM x (k a) -> Subscriber x (v a))
2003+ -> EventM x (DMap k v, [Height], DMap k s)
2004+
2005+type MergeDestroyFunc k s
2006+ = DMap k s
2007+ -> IO ()
2008+
2009+data Merge x k v s = Merge
2010+ { _merge_parentsRef :: {-# UNPACK #-} !(IORef (DMap k s))
2011+ , _merge_heightBagRef :: {-# UNPACK #-} !(IORef HeightBag)
2012+ , _merge_heightRef :: {-# UNPACK #-} !(IORef Height)
2013+ , _merge_sub :: {-# UNPACK #-} !(Subscriber x (DMap k v))
2014+ , _merge_accumRef :: {-# UNPACK #-} !(IORef (DMap k v))
2015+ }
2016+
2017+invalidateMergeHeight :: Merge x k v s -> IO ()
2018+invalidateMergeHeight m = invalidateMergeHeight' (_merge_heightRef m) (_merge_sub m)
2019+
2020+invalidateMergeHeight' :: IORef Height -> Subscriber x a -> IO ()
2021+invalidateMergeHeight' heightRef sub = do
2022+ oldHeight <- readIORef heightRef
2023+ -- If the height used to be valid, it must be invalid now; we should never have *more* heights than we have parents
2024+ when (oldHeight /= invalidHeight) $ do
2025+ writeIORef heightRef $! invalidHeight
2026+ subscriberInvalidateHeight sub oldHeight
2027+
2028+revalidateMergeHeight :: Merge x k v s -> IO ()
2029+revalidateMergeHeight m = do
2030+ currentHeight <- readIORef $ _merge_heightRef m
2031+
2032+ -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
2033+ when (currentHeight == invalidHeight) $ do
2034+ heights <- readIORef $ _merge_heightBagRef m
2035+ parents <- readIORef $ _merge_parentsRef m
2036+ -- When the number of heights in the bag reaches the number of parents, we should have a valid height
2037+ case heightBagSize heights `compare` DMap.size parents of
2038+ LT -> return ()
2039+ EQ -> do
2040+ let height = succHeight $ heightBagMax heights
2041+ traceInvalidateHeight $ "recalculateSubscriberHeight: height: " <> show height
2042+ writeIORef (_merge_heightRef m) $! height
2043+ subscriberRecalculateHeight (_merge_sub m) height
2044+ GT -> error $ "revalidateMergeHeight: more heights (" <> show (heightBagSize heights) <> ") than parents (" <> show (DMap.size parents) <> ") for Merge"
2045+
2046+scheduleMergeSelf :: HasSpiderTimeline x => Merge x k v s -> Height -> EventM x ()
2047+scheduleMergeSelf m height = scheduleMerge' height (_merge_heightRef m) $ do
2048+ vals <- liftIO $ readIORef $ _merge_accumRef m
2049+ -- Once we're done with this, we can clear it immediately, because if there's a cacheEvent in front of us,
2050+ -- it'll handle subsequent subscribers, and if not, we won't get subsequent subscribers
2051+ liftIO $ writeIORef (_merge_accumRef m) $! DMap.empty
2052+ --TODO: Assert that m is not empty
2053+ subscriberPropagate (_merge_sub m) vals
2054+
2055+checkCycle :: HasSpiderTimeline x => EventSubscribed x -> EventM x ()
2056+checkCycle subscribed = liftIO $ do
2057+ height <- readIORef (eventSubscribedHeightRef subscribed)
2058+
2059+ -- currentHeight <- getCurrentHeight
2060+ -- when (height <= currentHeight) $ if height /= invalidHeight
2061+ -- then do
2062+ -- myStack <- liftIO $ whoCreatedIORef undefined --TODO
2063+ -- error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
2064+ -- else liftIO $
2065+ when (height == invalidHeight) $
15402066#ifdef DEBUG_CYCLES
1541− nodesInvolvedInCycle <- walkInvalidHeightParents $ eventSubscribedMerge subscribed
1542− stacks <- forM nodesInvolvedInCycle $ \(Some.This es) -> whoCreatedEventSubscribed es
1543− let cycleInfo = ":\n" <> drawForest (listsToForest stacks)
2067+ do
2068+ nodesInvolvedInCycle <- walkInvalidHeightParents subscribed
2069+ stacks <- forM nodesInvolvedInCycle whoCreatedEventSubscribed
2070+ throwIO (EventLoopException stacks)
15442071#else
1545− let cycleInfo = ""
2072+ throwIO EventLoopException
15462073#endif
1547− error $ "Causality loop found" <> cycleInfo
1548− scheduleSelf height
1549− , subscriberInvalidateHeight = \old -> do --TODO: When removing a parent doesn't actually change the height, maybe we can avoid invalidating
1550− modifyIORef' heightBagRef $ heightBagRemove old
1551− invalidateMyHeight
1552− , subscriberRecalculateHeight = \new -> do
1553− modifyIORef' heightBagRef $ heightBagAdd new
1554− revalidateMyHeight
2074+
2075+
2076+mergeSubscriber :: forall x k v s a. (HasSpiderTimeline x, GCompare k) => EventSubscribed x -> Merge x k v s -> EventM x (k a) -> Subscriber x (v a)
2077+mergeSubscriber subscribed m getKey = Subscriber
2078+ { subscriberPropagate = \a -> do
2079+ oldM <- liftIO $ readIORef $ _merge_accumRef m
2080+ k <- getKey
2081+ let newM = DMap.insertWith (error "Same key fired multiple times for Merge") k a oldM
2082+ tracePropagate (Proxy :: Proxy x) $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
2083+ liftIO $ writeIORef (_merge_accumRef m) $! newM
2084+ when (DMap.null oldM) $ do -- Only schedule the firing once
2085+ height <- liftIO $ readIORef $ _merge_heightRef m
2086+ checkCycle subscribed
2087+
2088+ scheduleMergeSelf m height
2089+ , subscriberInvalidateHeight = \old -> do --TODO: When removing a parent doesn't actually change the height, maybe we can avoid invalidating
2090+ modifyIORef' (_merge_heightBagRef m) $ heightBagRemove old
2091+ invalidateMergeHeight m
2092+ , subscriberRecalculateHeight = \new -> do
2093+ modifyIORef' (_merge_heightBagRef m) $ heightBagAdd new
2094+ revalidateMergeHeight m
2095+ }
2096+
2097+--TODO: Be able to run as much of this as possible promptly
2098+updateMerge :: (HasSpiderTimeline x, GCompare k) => EventSubscribed x -> Merge x k v s -> MergeUpdateFunc k v x p s -> p -> SomeMergeUpdate x
2099+updateMerge subscribed m updateFunc p = SomeMergeUpdate updateMe (invalidateMergeHeight m) (revalidateMergeHeight m)
2100+ where updateMe = do
2101+ oldParents <- liftIO $ readIORef $ _merge_parentsRef m
2102+ (subscriptionsToKill, newParents) <- updateFunc (mergeSubscriber subscribed m) (_merge_heightBagRef m) oldParents p
2103+ liftIO $ writeIORef (_merge_parentsRef m) $! newParents
2104+ return subscriptionsToKill
2105+
2106+{-# INLINE mergeGCheap' #-}
2107+mergeGCheap' :: forall k v x p s q. (HasSpiderTimeline x, GCompare k, PatchTarget p ~ DMap k q)
2108+ => MergeGetSubscription x s -> MergeInitFunc k v q x s -> MergeUpdateFunc k v x p s -> MergeDestroyFunc k s -> DynamicS x p -> Event x (DMap k v)
2109+mergeGCheap' getParent getInitialSubscribers updateFunc destroy d = Event $ \sub -> do
2110+ initialParents <- readBehaviorUntracked $ dynamicCurrent d
2111+ accumRef <- liftIO $ newIORef $ error "merge: accumRef not yet initialized"
2112+ heightRef <- liftIO $ newIORef $ error "merge: heightRef not yet initialized"
2113+ heightBagRef <- liftIO $ newIORef $ error "merge: heightBagRef not yet initialized"
2114+ parentsRef :: IORef (DMap k s) <- liftIO $ newIORef $ error "merge: parentsRef not yet initialized"
2115+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
2116+
2117+ let subscribed = EventSubscribed
2118+ { eventSubscribedHeightRef = heightRef
2119+ , eventSubscribedRetained = toAny (parentsRef, changeSubdRef)
2120+#ifdef DEBUG_CYCLES
2121+ , eventSubscribedGetParents = do
2122+ let getParent' (_ :=> v) = _eventSubscription_subscribed (getParent v)
2123+ fmap getParent' . DMap.toList <$> readIORef parentsRef
2124+ , eventSubscribedHasOwnHeightRef = False
2125+ , eventSubscribedWhoCreated = whoCreatedIORef heightRef
2126+#endif
2127+ }
2128+
2129+ m = Merge
2130+ { _merge_parentsRef = parentsRef
2131+ , _merge_heightBagRef = heightBagRef
2132+ , _merge_heightRef = heightRef
2133+ , _merge_sub = sub
2134+ , _merge_accumRef = accumRef
15552135 }
1556− subscribers :: [(Maybe (DSum k Identity), Height, DSum k (MergeSubscribedParent x k))] <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
1557− let s = subscriber k
1558− (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead e s
1559− height <- liftIO $ getEventSubscribedHeight parentSubd
1560− return $ (fmap (\x -> k :=> Identity x) parentOcc, height, k :=> MergeSubscribedParent subscription s)
1561− let dm = DMap.fromDistinctAscList $ mapMaybe (\(x, _, _) -> x) subscribers
1562− heights = fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
1563− myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
2136+ (dm, heights, initialParentState) <- getInitialSubscribers initialParents $ mergeSubscriber subscribed m
2137+ let myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
15642138 myHeight = if invalidHeight `elem` heights
15652139 then invalidHeight
15662140 else succHeight $ heightBagMax myHeightBag
@@ -1568,132 +2142,250 @@ merge d = cacheEvent $ Event $ \sub -> do
15682142 let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
15692143 then (if DMap.null dm then Nothing else Just dm, DMap.empty)
15702144 else (Nothing, dm)
1571− unless (DMap.null accum) $ do
1572− scheduleSelf myHeight
1573− occRef <- liftIO $ newIORef occ
1574− when (isJust occ) $ scheduleClear occRef
2145+ unless (DMap.null accum) $ scheduleMergeSelf m myHeight
15752146 liftIO $ writeIORef accumRef $! accum
15762147 liftIO $ writeIORef heightRef $! myHeight
15772148 liftIO $ writeIORef heightBagRef $! myHeightBag
2149+ liftIO $ writeIORef parentsRef $! initialParentState
2150+ defer $ SomeMergeInit $ do
2151+ let changeSubscriber = Subscriber
2152+ { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
2153+ tracePropagate (Proxy :: Proxy x) "SubscriberMerge/Change"
2154+ defer $ updateMerge subscribed m updateFunc a
2155+ , subscriberInvalidateHeight = \_ -> return ()
2156+ , subscriberRecalculateHeight = \_ -> return ()
2157+ }
2158+ (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) changeSubscriber
2159+ forM_ change $ \c -> defer $ updateMerge subscribed m updateFunc c
2160+ -- We explicitly hold on to the unsubscribe function from subscribing to the update event.
2161+ -- If we don't do this, there are certain cases where mergeCheap will fail to properly retain
2162+ -- its subscription.
2163+ liftIO $ writeIORef changeSubdRef (changeSubscriber, changeSubscription)
2164+ let unsubscribeAll = destroy =<< readIORef parentsRef
2165+
2166+ return (EventSubscription unsubscribeAll subscribed, occ)
2167+
2168+
2169+mergeInt :: forall x a. (HasSpiderTimeline x) => DynamicS x (PatchIntMap (Event x a)) -> Event x (IntMap a)
2170+mergeInt = cacheEvent . mergeIntCheap
2171+
2172+{-# INLINABLE mergeIntCheap #-}
2173+mergeIntCheap :: forall x a. (HasSpiderTimeline x) => DynamicS x (PatchIntMap (Event x a)) -> Event x (IntMap a)
2174+mergeIntCheap d = Event $ \sub -> do
2175+ initialParents <- readBehaviorUntracked $ dynamicCurrent d
2176+ accum <- liftIO $ FastMutableIntMap.newEmpty
2177+ heightRef <- liftIO $ newIORef zeroHeight
2178+ heightBagRef <- liftIO $ newIORef heightBagEmpty
2179+ parents <- liftIO $ FastMutableIntMap.newEmpty
15782180 changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
1579− liftIO $ writeIORef parentsRef $! DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1580− let updateMe (R.PatchDMap p) = do
1581− oldParents <- liftIO $ readIORef parentsRef
1582− let f (subscriptionsToKill, ps) (k :=> R.ComposeMaybe me) = do
1583− (mOldSubd, newPs) <- case me of
1584− Nothing -> return $ DMap.updateLookupWithKey (\_ _ -> Nothing) k ps
1585− Just e -> do
1586− let s = subscriber k
1587− subscription@(EventSubscription _ subd) <- subscribe e s
1588− newParentHeight <- liftIO $ getEventSubscribedHeight subd
1589− let newParent = MergeSubscribedParent subscription s
1590− liftIO $ modifyIORef' heightBagRef $ heightBagAdd newParentHeight
1591− return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
1592− forM_ mOldSubd $ \oldSubd -> do
1593− oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription oldSubd
1594− liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
1595− return (maybeToList (mergeSubscribedParentSubscription <$> mOldSubd) ++ subscriptionsToKill, newPs)
1596− (subscriptionsToKill, newParents) <- foldM f ([], oldParents) $ DMap.toList p --TODO: I think this runEventM is OK, since no events are firing at this time, but it might not be
1597− liftIO $ writeIORef parentsRef $! newParents
1598− return subscriptionsToKill
2181+ let subscribed = EventSubscribed
2182+ { eventSubscribedHeightRef = heightRef
2183+ , eventSubscribedRetained = toAny (parents, changeSubdRef)
2184+#ifdef DEBUG_CYCLES
2185+ , eventSubscribedGetParents = fmap (_eventSubscription_subscribed . snd) <$> FastMutableIntMap.toList parents
2186+ , eventSubscribedHasOwnHeightRef = False
2187+ , eventSubscribedWhoCreated = whoCreatedIORef heightRef
2188+#endif
2189+ }
2190+ let scheduleSelf = do
2191+ height <- liftIO $ readIORef $ heightRef
2192+ scheduleMerge' height heightRef $ do
2193+ vals <- liftIO $ FastMutableIntMap.getFrozenAndClear accum
2194+ subscriberPropagate sub vals
2195+ invalidateMyHeight = invalidateMergeHeight' heightRef sub
2196+ recalculateMyHeight = do
2197+ currentHeight <- readIORef heightRef
2198+ when (currentHeight == invalidHeight) $ do --TODO: This will almost always be true; can we get rid of this check and just proceed to the next one always?
2199+ heights <- readIORef heightBagRef
2200+ numParents <- FastMutableIntMap.size parents
2201+ case heightBagSize heights `compare` numParents of
2202+ LT -> return ()
2203+ EQ -> do
2204+ let height = succHeight $ heightBagMax heights
2205+ traceInvalidateHeight $ "recalculateSubscriberHeight: height: " <> show height
2206+ writeIORef heightRef $! height
2207+ subscriberRecalculateHeight sub height
2208+ GT -> error $ "revalidateMergeHeight: more heights (" <> show (heightBagSize heights) <> ") than parents (" <> show numParents <> ") for Merge"
2209+ mySubscriber k = Subscriber
2210+ { subscriberPropagate = \a -> do
2211+ checkCycle subscribed
2212+
2213+ wasEmpty <- liftIO $ FastMutableIntMap.isEmpty accum
2214+ liftIO $ FastMutableIntMap.insert accum k a
2215+ when wasEmpty scheduleSelf
2216+ , subscriberInvalidateHeight = \old -> do
2217+ modifyIORef' heightBagRef $ heightBagRemove old
2218+ invalidateMyHeight
2219+ , subscriberRecalculateHeight = \new -> do
2220+ modifyIORef' heightBagRef $ heightBagAdd new
2221+ recalculateMyHeight
2222+ }
2223+ forM_ (IntMap.toList initialParents) $ \(k, p) -> do
2224+ (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead p $ mySubscriber k
2225+ liftIO $ do
2226+ forM_ parentOcc $ FastMutableIntMap.insert accum k
2227+ FastMutableIntMap.insert parents k subscription
2228+ height <- getEventSubscribedHeight parentSubd
2229+ if height == invalidHeight
2230+ then writeIORef heightRef invalidHeight
2231+ else do
2232+ modifyIORef' heightBagRef $ heightBagAdd height
2233+ modifyIORef' heightRef $ \oldHeight ->
2234+ if oldHeight == invalidHeight
2235+ then invalidHeight
2236+ else max (succHeight height) oldHeight
2237+ myHeight <- liftIO $ readIORef heightRef
2238+ currentHeight <- getCurrentHeight
2239+ isEmpty <- liftIO $ FastMutableIntMap.isEmpty accum
2240+ occ <- if currentHeight >= myHeight -- If we should have fired by now
2241+ then if isEmpty
2242+ then return Nothing
2243+ else liftIO $ Just <$> FastMutableIntMap.getFrozenAndClear accum
2244+ else do when (not isEmpty) scheduleSelf -- We have things accumulated, but we shouldn't have fired them yet
2245+ return Nothing
15992246 defer $ SomeMergeInit $ do
1600− let s = Subscriber
2247+ let updateMe a = SomeMergeUpdate u invalidateMyHeight recalculateMyHeight
2248+ where
2249+ u = do
2250+ let f k newParent = do
2251+ subscription@(EventSubscription _ subd) <- subscribe newParent $ mySubscriber k
2252+ newParentHeight <- liftIO $ getEventSubscribedHeight subd
2253+ liftIO $ modifyIORef' heightBagRef $ heightBagAdd newParentHeight
2254+ return subscription
2255+ newSubscriptions <- FastMutableIntMap.traverseIntMapPatchWithKey f a
2256+ oldParents <- liftIO $ FastMutableIntMap.applyPatch parents newSubscriptions
2257+ liftIO $ for_ oldParents $ \oldParent -> do
2258+ oldParentHeight <- getEventSubscribedHeight $ _eventSubscription_subscribed oldParent
2259+
2260+ print ("updateMe", oldParentHeight)
2261+ modifyIORef' heightBagRef $ heightBagRemove oldParentHeight
2262+ return $ IntMap.elems oldParents
2263+ let changeSubscriber = Subscriber
16012264 { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
1602− tracePropagate $ "SubscriberMerge/Change"
1603− defer $ SomeMergeUpdate (updateMe a) invalidateMyHeight revalidateMyHeight
2265+ tracePropagate (Proxy :: Proxy x) $ "SubscriberMergeInt/Change"
2266+ defer $ updateMe a
16042267 , subscriberInvalidateHeight = \_ -> return ()
16052268 , subscriberRecalculateHeight = \_ -> return ()
16062269 }
1607− (EventSubscription _ changeSubd, change) <- subscribeAndRead (dynamicUpdated d) s
1608− forM_ change $ \c -> defer $ SomeMergeUpdate (updateMe c) invalidateMyHeight revalidateMyHeight
1609− liftIO $ writeIORef changeSubdRef (s, changeSubd)
1610− let unsubscribeAll = do
1611− parents <- readIORef parentsRef
1612− forM_ (DMap.toList parents) $ \(_ :=> MergeSubscribedParent s _) -> unsubscribe s
1613− return ( EventSubscription unsubscribeAll $ EventSubscribed heightRef $ toAny (parentsRef, changeSubdRef)
1614− , occ
1615− )
2270+ (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) changeSubscriber
2271+ forM_ change $ \c -> defer $ updateMe c
2272+ -- We explicitly hold on to the unsubscribe function from subscribing to the update event.
2273+ -- If we don't do this, there are certain cases where mergeCheap will fail to properly retain
2274+ -- its subscription.
2275+ liftIO $ writeIORef changeSubdRef (changeSubscriber, changeSubscription)
2276+ let unsubscribeAll = traverse_ unsubscribe =<< FastMutableIntMap.getFrozenAndClear parents
2277+
2278+
2279+ return (EventSubscription unsubscribeAll subscribed, occ)
16162280
16172281newtype EventSelector x k = EventSelector { select :: forall a. k a -> Event x a }
2282+newtype EventSelectorG x k v = EventSelectorG { selectG :: forall a. k a -> Event x (v a) }
16182283
1619−fan :: GCompare k => Event x (DMap k Identity) -> EventSelector x k
1620−fan e =
2284+fanG :: (HasSpiderTimeline x, GCompare k) => Event x (DMap k v) -> EventSelectorG x k v
2285+fanG e = unsafePerformIO $ do
2286+ ref <- newIORef Nothing
16212287 let f = Fan
16222288 { fanParent = e
1623− , fanSubscribed = unsafeNewIORef e Nothing
2289+ , fanSubscribed = ref
16242290 }
1625− in EventSelector $ \k -> eventFan k f
2291+ pure $ EventSelectorG $ \k -> eventFan k f
16262292
1627−runHoldInits :: IORef [SomeHoldInit x] -> IORef [SomeMergeInit x] -> EventM x ()
1628−runHoldInits holdInitRef mergeInitRef = do
2293+runHoldInits :: HasSpiderTimeline x => IORef [SomeHoldInit x] -> IORef [SomeDynInit x] -> IORef [SomeMergeInit x] -> EventM x ()
2294+runHoldInits holdInitRef dynInitRef mergeInitRef = do
16292295 holdInits <- liftIO $ readIORef holdInitRef
2296+ dynInits <- liftIO $ readIORef dynInitRef
16302297 mergeInits <- liftIO $ readIORef mergeInitRef
1631− unless (null holdInits && null mergeInits) $ do
2298+ unless (null holdInits && null dynInits && null mergeInits) $ do
16322299 liftIO $ writeIORef holdInitRef []
2300+ liftIO $ writeIORef dynInitRef []
16332301 liftIO $ writeIORef mergeInitRef []
16342302 mapM_ initHold holdInits
2303+ mapM_ initDyn dynInits
16352304 mapM_ unSomeMergeInit mergeInits
1636− runHoldInits holdInitRef mergeInitRef
2305+ runHoldInits holdInitRef dynInitRef mergeInitRef
16372306
1638−initHold :: SomeHoldInit x -> EventM x ()
2307+initHold :: HasSpiderTimeline x => SomeHoldInit x -> EventM x ()
16392308initHold (SomeHoldInit h) = void $ getHoldEventSubscription h
16402309
1641−-- | Run an event action outside of a frame
1642−runFrame :: forall x a. EventM x a -> SpiderHost x a --TODO: This function also needs to hold the mutex
1643−runFrame a = SpiderHost $ ask >>= \spiderTimeline -> lift $ do
1644− -- Clear out pending unsubscriptions; these will need to happen eventually anyway, and might cause us a lot of extra work during the frame, so get rid of them now
1645− pendingCleanups <- atomicModifyIORef (_spiderTimeline_cleanups spiderTimeline) $ \x -> ([], x)
1646− {-# SCC "cleanups" #-} sequence_ pendingCleanups
2310+initDyn :: HasSpiderTimeline x => SomeDynInit x -> EventM x ()
2311+initDyn (SomeDynInit d) = void $ getDynHold d
2312+
2313+newEventEnv :: IO (EventEnv x)
2314+newEventEnv = do
16472315 toAssignRef <- newIORef [] -- This should only actually get used when events are firing
16482316 holdInitRef <- newIORef []
2317+ dynInitRef <- newIORef []
16492318 mergeUpdateRef <- newIORef []
16502319 mergeInitRef <- newIORef []
16512320 heightRef <- newIORef zeroHeight
16522321 toClearRef <- newIORef []
2322+ toClearIntRef <- newIORef []
16532323 toClearRootRef <- newIORef []
16542324 coincidenceInfosRef <- newIORef []
1655− delayedRef <- liftIO $ newIORef IntMap.empty
1656− let env = EventEnv spiderTimeline toAssignRef holdInitRef mergeUpdateRef mergeInitRef toClearRef toClearRootRef heightRef coincidenceInfosRef delayedRef
2325+ delayedRef <- newIORef IntMap.empty
2326+ return $ EventEnv toAssignRef holdInitRef dynInitRef mergeUpdateRef mergeInitRef toClearRef toClearIntRef toClearRootRef heightRef coincidenceInfosRef delayedRef
2327+
2328+clearEventEnv :: EventEnv x -> IO ()
2329+clearEventEnv (EventEnv toAssignRef holdInitRef dynInitRef mergeUpdateRef mergeInitRef toClearRef toClearIntRef toClearRootRef heightRef coincidenceInfosRef delayedRef) = do
2330+ writeIORef toAssignRef []
2331+ writeIORef holdInitRef []
2332+ writeIORef dynInitRef []
2333+ writeIORef mergeUpdateRef []
2334+ writeIORef mergeInitRef []
2335+ writeIORef heightRef zeroHeight
2336+ writeIORef toClearRef []
2337+ writeIORef toClearIntRef []
2338+ writeIORef toClearRootRef []
2339+ writeIORef coincidenceInfosRef []
2340+ writeIORef delayedRef IntMap.empty
2341+
2342+-- | Run an event action outside of a frame
2343+runFrame :: forall x a. HasSpiderTimeline x => EventM x a -> SpiderHost x a --TODO: This function also needs to hold the mutex
2344+runFrame a = SpiderHost $ do
2345+ let env = _spiderTimeline_eventEnv $ unSTE (spiderTimeline :: SpiderTimelineEnv x)
16572346 let go = do
16582347 result <- a
1659− runHoldInits holdInitRef mergeInitRef -- This must happen before doing the assignments, in case subscribing a Hold causes existing Holds to be read by the newly-propagated events
2348+ runHoldInits (eventEnvHoldInits env) (eventEnvDynInits env) (eventEnvMergeInits env) -- This must happen before doing the assignments, in case subscribing a Hold causes existing Holds to be read by the newly-propagated events
16602349 return result
1661− result <- runEventM go env
1662− toClear <- readIORef toClearRef
1663− forM_ toClear $ \(SomeClear ref) -> {-# SCC "clear" #-} writeIORef ref Nothing
1664− toClearRoot <- readIORef toClearRootRef
1665− forM_ toClearRoot $ \(SomeRootClear ref) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
1666− toAssign <- readIORef toAssignRef
2350+ result <- runEventM go
2351+ toClear <- readIORef $ eventEnvClears env
2352+ forM_ toClear $ \(Some (Clear ref)) -> {-# SCC "clear" #-} writeIORef ref Nothing
2353+ toClearInt <- readIORef $ eventEnvIntClears env
2354+ forM_ toClearInt $ \(Some (IntClear ref)) -> {-# SCC "intClear" #-} writeIORef ref $! IntMap.empty
2355+ toClearRoot <- readIORef $ eventEnvRootClears env
2356+ forM_ toClearRoot $ \(Some (RootClear ref)) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
2357+ toAssign <- readIORef $ eventEnvAssignments env
16672358 toReconnectRef <- newIORef []
1668− coincidenceInfos <- readIORef coincidenceInfosRef
2359+ coincidenceInfos <- readIORef $ eventEnvResetCoincidences env
16692360 forM_ toAssign $ \(SomeAssignment vRef iRef v) -> {-# SCC "assignment" #-} do
16702361 writeIORef vRef v
1671− when debugInvalidate $ putStrLn $ "Invalidating Hold"
2362+ traceInvalidate $ "Invalidating Hold"
16722363 writeIORef iRef =<< evaluate =<< invalidate toReconnectRef =<< readIORef iRef
1673− mergeUpdates <- readIORef mergeUpdateRef
1674− writeIORef mergeUpdateRef []
1675− when debugPropagate $ putStrLn "Updating merges"
1676− mergeSubscriptionsToKill <- flip runEventM env $ concat <$> mapM _someMergeUpdate_update mergeUpdates
1677− when debugPropagate $ putStrLn "Updating merges done"
2364+ mergeUpdates <- readIORef $ eventEnvMergeUpdates env
2365+ writeIORef (eventEnvMergeUpdates env) []
2366+ tracePropagate (Proxy::Proxy x) $ "Updating merges"
2367+ mergeSubscriptionsToKill <- runEventM $ concat <$> mapM _someMergeUpdate_update mergeUpdates
2368+ tracePropagate (Proxy::Proxy x) $ "Updating merges done"
16782369 toReconnect <- readIORef toReconnectRef
2370+ clearEventEnv env
16792371 switchSubscriptionsToKill <- forM toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
16802372 oldSubscription <- readIORef $ switchSubscribedCurrentParent subscribed
16812373 wi <- readIORef $ switchSubscribedOwnWeakInvalidator subscribed
1682− when debugInvalidate $ putStrLn $ "Finalizing invalidator for Switch" <> showNodeId subscribed
2374+ traceInvalidate $ "Finalizing invalidator for Switch" <> showNodeId subscribed
16832375 finalize wi
16842376 i <- evaluate $ switchSubscribedOwnInvalidator subscribed
16852377 wi' <- mkWeakPtrWithDebug i "wi'"
16862378 writeIORef (switchSubscribedOwnWeakInvalidator subscribed) $! wi'
16872379 writeIORef (switchSubscribedBehaviorParents subscribed) []
1688− writeIORef holdInitRef [] --TODO: Should we reuse this?
1689− e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) holdInitRef
1690− runEventM (runHoldInits holdInitRef mergeInitRef) env --TODO: Is this actually OK? It seems like it should be, since we know that no events are firing at this point, but it still seems inelegant
2380+ writeIORef (eventEnvHoldInits env) [] --TODO: Should we reuse this?
2381+ e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) $ eventEnvHoldInits env
2382+ runEventM $ runHoldInits (eventEnvHoldInits env) (eventEnvDynInits env) (eventEnvMergeInits env) --TODO: Is this actually OK? It seems like it should be, since we know that no events are firing at this point, but it still seems inelegant
16912383 --TODO: Make sure we touch the pieces of the SwitchSubscribed at the appropriate times
16922384 sub <- newSubscriberSwitch subscribed
1693− subscription <- runReaderT (unSpiderHost (runFrame ({-# SCC "subscribeSwitch" #-} subscribe e sub))) spiderTimeline --TODO: Assert that the event isn't firing --TODO: This should not loop because none of the events should be firing, but still, it is inefficient
2385+ subscription <- unSpiderHost $ runFrame $ {-# SCC "subscribeSwitch" #-} subscribe e sub --TODO: Assert that the event isn't firing --TODO: This should not loop because none of the events should be firing, but still, it is inefficient
16942386 {-
16952387 stackTrace <- liftIO $ fmap renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
1696− liftIO $ putStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
2388+ liftIO $ debugStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
16972389 EventRoot _ -> "EventRoot"
16982390 EventNever -> "EventNever"
16992391 _ -> "something else"
@@ -1708,7 +2400,7 @@ runFrame a = SpiderHost $ ask >>= \spiderTimeline -> lift $ do
17082400 myHeight <- readIORef $ switchSubscribedHeight subscribed
17092401 when (parentHeight /= myHeight) $ do
17102402 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
1711− WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
2403+ WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
17122404 mapM_ _someMergeUpdate_invalidateHeight mergeUpdates --TODO: In addition to when the patch is completely empty, we should also not run this if it has some Nothing values, but none of them have actually had any effect; potentially, we could even check for Just values with no effect (e.g. by comparing their IORefs and ignoring them if they are unchanged); actually, we could just check if the new height is different
17132405 forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
17142406 unsubscribe subscription
@@ -1749,7 +2441,7 @@ invalidateCoincidenceHeight subscribed = do
17492441 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
17502442 when (oldHeight /= invalidHeight) $ do
17512443 writeIORef (coincidenceSubscribedHeight subscribed) $! invalidHeight
1752− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
2444+ WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
17532445
17542446updateSwitchHeight :: Height -> SwitchSubscribed x a -> IO ()
17552447updateSwitchHeight new subscribed = do
@@ -1757,7 +2449,7 @@ updateSwitchHeight new subscribed = do
17572449 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
17582450 when (new /= invalidHeight) $ do --TODO: This 'when' should probably be an assertion
17592451 writeIORef (switchSubscribedHeight subscribed) $! new
1760− WeakBag.traverse (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
2452+ WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
17612453
17622454recalculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
17632455recalculateCoincidenceHeight subscribed = do
@@ -1766,7 +2458,7 @@ recalculateCoincidenceHeight subscribed = do
17662458 height <- calculateCoincidenceHeight subscribed
17672459 when (height /= invalidHeight) $ do
17682460 writeIORef (coincidenceSubscribedHeight subscribed) $! height
1769− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
2461+ WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
17702462
17712463calculateSwitchHeight :: SwitchSubscribed x a -> IO Height
17722464calculateSwitchHeight subscribed = getEventSubscribedHeight . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
@@ -1805,183 +2497,170 @@ invalidate toReconnectRef wis = do
18052497-- Reflex integration
18062498--------------------------------------------------------------------------------
18072499
1808−-- | The default, global Spider environment
1809−type Spider = SpiderTimeline Global
1810−
18112500-- | Designates the default, global Spider timeline
1812−data Global
1813−
1814−{-# NOINLINE globalSpiderTimeline #-}
1815−globalSpiderTimeline :: SpiderTimeline Global
1816−globalSpiderTimeline = unsafePerformIO unsafeNewSpiderTimeline
1817−
1818−-- | Stores all global data relevant to a particular Spider timeline; only one
1819−-- value should exist for each type @x@
1820−data SpiderTimeline x = SpiderTimeline
1821− { _spiderTimeline_toUnsubscribe :: !(IORef [EventSubscription x])
1822− , _spiderTimeline_lock :: !(MVar ())
1823− , _spiderTimeline_cleanups :: !(IORef [IO ()])
1824−#ifdef DEBUG
1825− , _spiderTimeline_depth :: !(IORef Int)
1826−#endif
1827− }
2501+data SpiderTimeline x
18282502type role SpiderTimeline nominal
18292503
1830−instance GEq SpiderTimeline where
1831− a `geq` b = if _spiderTimeline_lock a == _spiderTimeline_lock b
1832− then Just $ unsafeCoerce Refl -- This unsafeCoerce is safe because the same SpiderTimeline can't have two different 'x' arguments
1833− else Nothing
1834−
1835−unsafeNewSpiderTimeline :: forall x. IO (SpiderTimeline x)
1836−unsafeNewSpiderTimeline = do
1837− toUnsubscribe <- newIORef []
1838− lock <- newMVar ()
1839− cleanups <- newIORef []
1840−#ifdef DEBUG
1841− depthRef <- newIORef 0
1842−#endif
1843− return $ SpiderTimeline
1844− { _spiderTimeline_toUnsubscribe = toUnsubscribe
1845− , _spiderTimeline_lock = lock
1846− , _spiderTimeline_cleanups = cleanups
1847−#ifdef DEBUG
1848− , _spiderTimeline_depth = depthRef
1849−#endif
1850− }
1851−
1852−-- | Create a new SpiderTimeline
1853−newSpiderTimeline :: IO (Some SpiderTimeline)
1854−newSpiderTimeline = withSpiderTimeline (pure . Some.This)
2504+-- | The default, global Spider environment
2505+type Spider = SpiderTimeline Global
18552506
1856−-- | Pass a new timeline to the given function.
1857−withSpiderTimeline :: (forall x. SpiderTimeline x -> IO r) -> IO r
1858−withSpiderTimeline k = unsafeNewSpiderTimeline >>= k
2507+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (EventM x) where
2508+ {-# INLINABLE sample #-}
2509+ sample (SpiderBehavior b) = readBehaviorUntracked b
18592510
1860−newtype SpiderPullM x a = SpiderPullM (BehaviorM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2511+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (EventM x) where
2512+ {-# INLINABLE hold #-}
2513+ hold = holdSpiderEventM
2514+ {-# INLINABLE holdDyn #-}
2515+ holdDyn = holdDynSpiderEventM
2516+ {-# INLINABLE holdIncremental #-}
2517+ holdIncremental = holdIncrementalSpiderEventM
2518+ {-# INLINABLE buildDynamic #-}
2519+ buildDynamic = buildDynamicSpiderEventM
2520+ {-# INLINABLE headE #-}
2521+ headE = R.slowHeadE
2522+-- headE (SpiderEvent e) = SpiderEvent <$> Reflex.Spider.Internal.headE e
2523+ {-# INLINABLE now #-}
2524+ now = nowSpiderEventM
2525+
2526+instance Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPullM x) where
2527+ {-# INLINABLE sample #-}
2528+ sample = coerce . readBehaviorTracked . unSpiderBehavior
18612529
1862−newtype SpiderPushM x a = SpiderPushM (ComputeM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2530+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPushM x) where
2531+ {-# INLINABLE sample #-}
2532+ sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
18632533
1864−instance Functor (R.Dynamic (SpiderTimeline x)) where
1865− fmap f = SpiderDynamic . newMapDyn f . unSpiderDynamic
2534+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderPushM x) where
2535+ {-# INLINABLE hold #-}
2536+ hold v0 e = Reflex.Class.current <$> Reflex.Class.holdDyn v0 e
2537+ {-# INLINABLE holdDyn #-}
2538+ holdDyn v0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce e
2539+ {-# INLINABLE holdIncremental #-}
2540+ holdIncremental v0 (SpiderEvent e) = SpiderPushM $ SpiderIncremental . dynamicHold <$> Reflex.Spider.Internal.hold v0 e
2541+ {-# INLINABLE buildDynamic #-}
2542+ buildDynamic getV0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . dynamicDynIdentity) $ Reflex.Spider.Internal.buildDynamic (coerce getV0) $ coerce e
2543+ {-# INLINABLE headE #-}
2544+ headE = R.slowHeadE
2545+-- headE (SpiderEvent e) = SpiderPushM $ SpiderEvent <$> Reflex.Spider.Internal.headE e
2546+ {-# INLINABLE now #-}
2547+ now = SpiderPushM nowSpiderEventM
18662548
1867−instance Applicative (R.Dynamic (SpiderTimeline x)) where
1868− pure = SpiderDynamic . dynamicConst
1869− SpiderDynamic a <*> SpiderDynamic b = SpiderDynamic $ zipDynWith ($) a b
1870− _ *> b = b
1871− a <* _ = a
18722549
1873−instance Monad (R.Dynamic (SpiderTimeline x)) where
2550+instance HasSpiderTimeline x => Monad (Reflex.Class.Dynamic (SpiderTimeline x)) where
18742551 {-# INLINE return #-}
18752552 return = pure
18762553 {-# INLINE (>>=) #-}
18772554 x >>= f = SpiderDynamic $ dynamicDynIdentity $ newJoinDyn $ newMapDyn (unSpiderDynamic . f) $ unSpiderDynamic x
18782555 {-# INLINE (>>) #-}
1879− _ >> y = y
2556+ (>>) = (*>)
2557+#if !MIN_VERSION_base(4,13,0)
18802558 {-# INLINE fail #-}
18812559 fail _ = error "Dynamic does not support 'fail'"
2560+#endif
18822561
1883−instance R.Reflex (SpiderTimeline x) where
1884− newtype Behavior (SpiderTimeline x) a = SpiderBehavior { unSpiderBehavior :: Behavior x a }
1885− newtype Event (SpiderTimeline x) a = SpiderEvent { unSpiderEvent :: Event x a }
1886− newtype Dynamic (SpiderTimeline x) a = SpiderDynamic { unSpiderDynamic :: Dynamic x (Identity a) } -- deriving (Functor, Applicative, Monad)
1887− newtype Incremental (SpiderTimeline x) p = SpiderIncremental { unSpiderIncremental :: Dynamic x p }
1888− type PullM (SpiderTimeline x) = SpiderPullM x
1889− type PushM (SpiderTimeline x) = SpiderPushM x
1890− {-# INLINABLE never #-}
1891− never = SpiderEvent eventNever
1892− {-# INLINABLE constant #-}
1893− constant = SpiderBehavior . behaviorConst
1894− {-# INLINABLE push #-}
1895− push f = SpiderEvent . push (coerce f) . unSpiderEvent
1896− {-# INLINABLE pull #-}
1897− pull = SpiderBehavior . pull . coerce
1898− {-# INLINABLE merge #-}
1899− merge = SpiderEvent . merge . dynamicConst . (coerce :: DMap k (R.Event (SpiderTimeline x)) -> DMap k (Event x))
1900− {-# INLINABLE fan #-}
1901− fan e = R.EventSelector $ SpiderEvent . select (fan (unSpiderEvent e))
1902− {-# INLINABLE switch #-}
1903− switch = SpiderEvent . switch . (coerce :: Behavior x (R.Event (SpiderTimeline x) a) -> Behavior x (Event x a)) . unSpiderBehavior
1904− {-# INLINABLE coincidence #-}
1905− coincidence = SpiderEvent . coincidence . (coerce :: Event x (R.Event (SpiderTimeline x) a) -> Event x (Event x a)) . unSpiderEvent
1906− {-# INLINABLE current #-}
1907− current = SpiderBehavior . dynamicCurrent . unSpiderDynamic
1908− {-# INLINABLE updated #-}
1909− updated = SpiderEvent . fmap runIdentity . dynamicUpdated . unSpiderDynamic
1910− {-# INLINABLE unsafeBuildDynamic #-}
1911− unsafeBuildDynamic readV0 v' = SpiderDynamic $ dynamicDynIdentity $ unsafeDyn (coerce readV0) $ coerce $ unSpiderEvent v'
1912− {-# INLINABLE unsafeBuildIncremental #-}
1913− unsafeBuildIncremental readV0 dv = SpiderIncremental $ dynamicDyn $ unsafeDyn (coerce readV0) $ unSpiderEvent dv
1914− {-# INLINABLE mergeIncremental #-}
1915− mergeIncremental = SpiderEvent . merge . (unsafeCoerce :: Dynamic x (R.PatchDMap k (R.Event (SpiderTimeline x))) -> Dynamic x (R.PatchDMap k (Event x))) . unSpiderIncremental
1916− {-# INLINABLE currentIncremental #-}
1917− currentIncremental = SpiderBehavior . dynamicCurrent . unSpiderIncremental
1918− {-# INLINABLE updatedIncremental #-}
1919− updatedIncremental = SpiderEvent . dynamicUpdated . unSpiderIncremental
1920− {-# INLINABLE incrementalToDynamic #-}
1921− incrementalToDynamic (SpiderIncremental i) = SpiderDynamic $ dynamicDynIdentity $ unsafeDyn (readBehaviorUntracked $ dynamicCurrent i) $ flip push (dynamicUpdated i) $ \p -> do
1922− c <- readBehaviorUntracked $ dynamicCurrent i
1923− return $ Identity <$> R.apply p c --TODO: Avoid the redundant 'apply'
1924− eventCoercion Coercion = Coercion
1925− behaviorCoercion Coercion = Coercion
1926− dynamicCoercion = unsafeCoerce --TODO: How can we avoid this unsafeCoerce? This is safe only because we know how Identity works as a Patch instance
2562+{-# INLINABLE newJoinDyn #-}
2563+newJoinDyn :: HasSpiderTimeline x => DynamicS x (Identity (DynamicS x (Identity a))) -> Reflex.Spider.Internal.Dyn x (Identity a)
2564+newJoinDyn d =
2565+ let readV0 = readBehaviorTracked . dynamicCurrent =<< readBehaviorTracked (dynamicCurrent d)
2566+ eOuter = Reflex.Spider.Internal.push (fmap (Just . Identity) . readBehaviorUntracked . dynamicCurrent . runIdentity) $ dynamicUpdated d
2567+ eInner = Reflex.Spider.Internal.switch $ dynamicUpdated <$> dynamicCurrent d
2568+ eBoth = Reflex.Spider.Internal.coincidence $ dynamicUpdated . runIdentity <$> dynamicUpdated d
2569+ v' = unSpiderEvent $ Reflex.Class.leftmost $ map SpiderEvent [eBoth, eOuter, eInner]
2570+ in Reflex.Spider.Internal.unsafeBuildDynamic readV0 v'
19272571
1928−instance R.MonadSample (SpiderTimeline x) (EventM x) where
1929− {-# INLINABLE sample #-}
1930− sample (SpiderBehavior b) = readBehaviorUntracked b
2572+instance HasSpiderTimeline x => Functor (Reflex.Class.Dynamic (SpiderTimeline x)) where
2573+ fmap = mapDynamicSpider
2574+ x <$ d = R.unsafeBuildDynamic (return x) $ x <$ R.updated d
19312575
1932−instance R.MonadHold (SpiderTimeline x) (EventM x) where
1933− {-# INLINABLE hold #-}
1934− hold = holdSpiderEventM
1935− {-# INLINABLE holdDyn #-}
1936− holdDyn = holdDynSpiderEventM
1937− {-# INLINABLE holdIncremental #-}
1938− holdIncremental = holdIncrementalSpiderEventM
2576+mapDynamicSpider :: HasSpiderTimeline x => (a -> b) -> Reflex.Class.Dynamic (SpiderTimeline x) a -> Reflex.Class.Dynamic (SpiderTimeline x) b
2577+mapDynamicSpider f = SpiderDynamic . newMapDyn f . unSpiderDynamic
2578+{-# INLINE [1] mapDynamicSpider #-}
19392579
1940−holdSpiderEventM :: a -> R.Event (SpiderTimeline x) a -> EventM x (R.Behavior (SpiderTimeline x) a)
1941−holdSpiderEventM v0 e = fmap (SpiderBehavior . behaviorHoldIdentity) $ hold v0 $ coerce $ unSpiderEvent e
2580+instance HasSpiderTimeline x => Applicative (Reflex.Class.Dynamic (SpiderTimeline x)) where
2581+ pure = SpiderDynamic . dynamicConst
2582+#if MIN_VERSION_base(4,10,0)
2583+ liftA2 f a b = SpiderDynamic $ Reflex.Spider.Internal.zipDynWith f (unSpiderDynamic a) (unSpiderDynamic b)
2584+#endif
2585+ SpiderDynamic a <*> SpiderDynamic b = SpiderDynamic $ Reflex.Spider.Internal.zipDynWith ($) a b
2586+ a *> b = R.unsafeBuildDynamic (R.sample $ R.current b) $ R.leftmost [R.updated b, R.tag (R.current b) $ R.updated a]
2587+ (<*) = flip (*>) -- There are no effects, so order doesn't matter
19422588
1943−holdDynSpiderEventM :: a -> R.Event (SpiderTimeline x) a -> EventM x (R.Dynamic (SpiderTimeline x) a)
1944−holdDynSpiderEventM v0 e = fmap (SpiderDynamic . dynamicHoldIdentity) $ hold v0 $ coerce $ unSpiderEvent e
2589+holdSpiderEventM :: HasSpiderTimeline x => a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Behavior (SpiderTimeline x) a)
2590+holdSpiderEventM v0 e = fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
19452591
1946−holdIncrementalSpiderEventM :: R.Patch p => R.PatchTarget p -> R.Event (SpiderTimeline x) p -> EventM x (R.Incremental (SpiderTimeline x) p)
1947−holdIncrementalSpiderEventM v0 e = fmap (SpiderIncremental . dynamicHold) $ hold v0 $ unSpiderEvent e
2592+holdDynSpiderEventM :: HasSpiderTimeline x => a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Dynamic (SpiderTimeline x) a)
2593+holdDynSpiderEventM v0 e = fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
19482594
1949−instance R.MonadHold (SpiderTimeline x) (SpiderHost x) where
2595+holdIncrementalSpiderEventM :: (HasSpiderTimeline x, Patch p) => PatchTarget p -> Reflex.Class.Event (SpiderTimeline x) p -> EventM x (Reflex.Class.Incremental (SpiderTimeline x) p)
2596+holdIncrementalSpiderEventM v0 e = fmap (SpiderIncremental . dynamicHold) $ Reflex.Spider.Internal.hold v0 $ unSpiderEvent e
2597+
2598+buildDynamicSpiderEventM :: HasSpiderTimeline x => SpiderPushM x a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Dynamic (SpiderTimeline x) a)
2599+buildDynamicSpiderEventM getV0 e = fmap (SpiderDynamic . dynamicDynIdentity) $ Reflex.Spider.Internal.buildDynamic (coerce getV0) $ coerce $ unSpiderEvent e
2600+
2601+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHost x) where
19502602 {-# INLINABLE hold #-}
1951− hold v0 e = R.runHostFrame $ R.hold v0 e
2603+ hold v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.hold v0 e
19522604 {-# INLINABLE holdDyn #-}
1953− holdDyn v0 e = R.runHostFrame $ R.holdDyn v0 e
2605+ holdDyn v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdDyn v0 e
19542606 {-# INLINABLE holdIncremental #-}
1955− holdIncremental v0 e = R.runHostFrame $ R.holdIncremental v0 e
2607+ holdIncremental v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdIncremental v0 e
2608+ {-# INLINABLE buildDynamic #-}
2609+ buildDynamic getV0 e = runFrame . runSpiderHostFrame $ Reflex.Class.buildDynamic getV0 e
2610+ {-# INLINABLE headE #-}
2611+ headE e = runFrame . runSpiderHostFrame $ Reflex.Class.headE e
2612+ {-# INLINABLE now #-}
2613+ now = runFrame . runSpiderHostFrame $ Reflex.Class.now
2614+
2615+
2616+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHostFrame x) where
2617+ sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
19562618
1957−instance R.MonadSample (SpiderTimeline x) (SpiderHost x) where
2619+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHostFrame x) where
2620+ {-# INLINABLE hold #-}
2621+ hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2622+ {-# INLINABLE holdDyn #-}
2623+ holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
2624+ {-# INLINABLE holdIncremental #-}
2625+ holdIncremental v0 e = SpiderHostFrame $ fmap (SpiderIncremental . dynamicHold) $ Reflex.Spider.Internal.hold v0 $ unSpiderEvent e
2626+ {-# INLINABLE buildDynamic #-}
2627+ buildDynamic getV0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicDynIdentity) $ Reflex.Spider.Internal.buildDynamic (coerce getV0) $ coerce $ unSpiderEvent e
2628+ {-# INLINABLE headE #-}
2629+ headE = R.slowHeadE
2630+-- headE (SpiderEvent e) = SpiderHostFrame $ SpiderEvent <$> Reflex.Spider.Internal.headE e
2631+ {-# INLINABLE now #-}
2632+ now = SpiderHostFrame Reflex.Class.now
2633+
2634+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHost x) where
19582635 {-# INLINABLE sample #-}
19592636 sample = runFrame . readBehaviorUntracked . unSpiderBehavior
19602637
1961−instance R.MonadSample (SpiderTimeline x) (SpiderPullM x) where
1962− {-# INLINABLE sample #-}
1963− sample = coerce . readBehaviorTracked . unSpiderBehavior
1964−
1965−instance R.MonadSample (SpiderTimeline x) (SpiderPushM x) where
2638+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
19662639 {-# INLINABLE sample #-}
1967− sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
2640+ sample = Reflex.Spider.Internal.ReadPhase . Reflex.Class.sample
19682641
1969−instance R.MonadHold (SpiderTimeline x) (SpiderPushM x) where
2642+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
19702643 {-# INLINABLE hold #-}
1971− hold v0 e = R.current <$> R.holdDyn v0 e
2644+ hold v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.hold v0 e
19722645 {-# INLINABLE holdDyn #-}
1973− holdDyn v0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . dynamicHoldIdentity) $ hold v0 $ coerce e
2646+ holdDyn v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdDyn v0 e
19742647 {-# INLINABLE holdIncremental #-}
1975− holdIncremental v0 (SpiderEvent e) = SpiderPushM $ SpiderIncremental . dynamicHold <$> hold v0 e
2648+ holdIncremental v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdIncremental v0 e
2649+ {-# INLINABLE buildDynamic #-}
2650+ buildDynamic getV0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.buildDynamic getV0 e
2651+ {-# INLINABLE headE #-}
2652+ headE e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.headE e
2653+ {-# INLINABLE now #-}
2654+ now = Reflex.Spider.Internal.ReadPhase Reflex.Class.now
19762655
1977−data RootTrigger x a = forall k. GCompare k => RootTrigger (WeakBag (Subscriber x a), IORef (DMap k Identity), k a)
1978−
1979−data SpiderEventHandle x a = SpiderEventHandle
1980− { spiderEventHandleSubscription :: EventSubscription x
1981− , spiderEventHandleValue :: IORef (Maybe a)
1982− }
2656+--------------------------------------------------------------------------------
2657+-- Deprecated items
2658+--------------------------------------------------------------------------------
19832659
1984−instance R.MonadSubscribeEvent (SpiderTimeline x) (SpiderHostFrame x) where
2660+-- | 'SpiderEnv' is the old name for 'SpiderTimeline'
2661+{-# DEPRECATED SpiderEnv "Use 'SpiderTimelineEnv' instead" #-}
2662+type SpiderEnv = SpiderTimeline
2663+instance HasSpiderTimeline x => Reflex.Host.Class.MonadSubscribeEvent (SpiderTimeline x) (SpiderHostFrame x) where
19852664 {-# INLINABLE subscribeEvent #-}
19862665 subscribeEvent e = SpiderHostFrame $ do
19872666 --TODO: Unsubscribe eventually (manually and/or with weak ref)
@@ -1998,18 +2677,149 @@ instance R.MonadSubscribeEvent (SpiderTimeline x) (SpiderHostFrame x) where
19982677 , spiderEventHandleValue = val
19992678 }
20002679
2001−instance R.ReflexHost (SpiderTimeline x) where
2680+instance HasSpiderTimeline x => Reflex.Host.Class.ReflexHost (SpiderTimeline x) where
20022681 type EventTrigger (SpiderTimeline x) = RootTrigger x
20032682 type EventHandle (SpiderTimeline x) = SpiderEventHandle x
20042683 type HostFrame (SpiderTimeline x) = SpiderHostFrame x
20052684
2006−instance R.MonadReadEvent (SpiderTimeline x) (ReadPhase x) where
2685+instance HasSpiderTimeline x => Reflex.Host.Class.MonadReadEvent (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
20072686 {-# NOINLINE readEvent #-}
2008− readEvent h = ReadPhase $ fmap (fmap return) $ liftIO $ do
2687+ readEvent h = Reflex.Spider.Internal.ReadPhase $ fmap (fmap return) $ liftIO $ do
20092688 result <- readIORef $ spiderEventHandleValue h
20102689 touch h
20112690 return result
20122691
2692+instance HasSpiderTimeline x => Reflex.Host.Class.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHost x) where
2693+ newEventWithTrigger = SpiderHost . fmap SpiderEvent . newEventWithTriggerIO
2694+ newFanEventWithTrigger f = SpiderHost $ do
2695+ es <- newFanEventWithTriggerIO f
2696+ return $ Reflex.Class.EventSelector $ SpiderEvent . Reflex.Spider.Internal.select es
2697+
2698+instance HasSpiderTimeline x => Reflex.Host.Class.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHostFrame x) where
2699+ newEventWithTrigger = SpiderHostFrame . EventM . liftIO . fmap SpiderEvent . newEventWithTriggerIO
2700+ newFanEventWithTrigger f = SpiderHostFrame $ EventM $ liftIO $ do
2701+ es <- newFanEventWithTriggerIO f
2702+ return $ Reflex.Class.EventSelector $ SpiderEvent . Reflex.Spider.Internal.select es
2703+
2704+instance HasSpiderTimeline x => Reflex.Host.Class.MonadSubscribeEvent (SpiderTimeline x) (SpiderHost x) where
2705+ {-# INLINABLE subscribeEvent #-}
2706+ subscribeEvent = runFrame . runSpiderHostFrame . Reflex.Host.Class.subscribeEvent
2707+
2708+instance HasSpiderTimeline x => Reflex.Host.Class.MonadReflexHost (SpiderTimeline x) (SpiderHost x) where
2709+ type ReadPhase (SpiderHost x) = Reflex.Spider.Internal.ReadPhase x
2710+ fireEventsAndRead es (Reflex.Spider.Internal.ReadPhase a) = run es a
2711+ runHostFrame = runFrame . runSpiderHostFrame
2712+
2713+unsafeNewSpiderTimelineEnv :: forall x. IO (SpiderTimelineEnv x)
2714+unsafeNewSpiderTimelineEnv = do
2715+ lock <- newMVar ()
2716+ env <- newEventEnv
2717+#ifdef DEBUG
2718+ depthRef <- newIORef 0
2719+#endif
2720+ return $ STE $ SpiderTimelineEnv
2721+ { _spiderTimeline_lock = lock
2722+ , _spiderTimeline_eventEnv = env
2723+#ifdef DEBUG
2724+ , _spiderTimeline_depth = depthRef
2725+#endif
2726+ }
2727+
2728+-- | Create a new SpiderTimelineEnv
2729+newSpiderTimeline :: IO (Some SpiderTimelineEnv)
2730+newSpiderTimeline = withSpiderTimeline (pure . Some)
2731+
2732+data LocalSpiderTimeline (x :: Type) s
2733+
2734+instance Reifies s (SpiderTimelineEnv x) =>
2735+ HasSpiderTimeline (LocalSpiderTimeline x s) where
2736+ spiderTimeline = localSpiderTimeline Proxy $ reflect (Proxy :: Proxy s)
2737+
2738+localSpiderTimeline
2739+ :: proxy s
2740+ -> SpiderTimelineEnv x
2741+ -> SpiderTimelineEnv (LocalSpiderTimeline x s)
2742+localSpiderTimeline _ = coerce
2743+
2744+-- | Pass a new timeline to the given function.
2745+withSpiderTimeline :: (forall x. HasSpiderTimeline x => SpiderTimelineEnv x -> IO r) -> IO r
2746+withSpiderTimeline k = do
2747+ env <- unsafeNewSpiderTimelineEnv
2748+ reify env $ \s -> k $ localSpiderTimeline s env
2749+
2750+newtype SpiderPullM (x :: Type) a = SpiderPullM (BehaviorM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2751+
2752+type ComputeM = EventM
2753+
2754+newtype SpiderPushM (x :: Type) a = SpiderPushM (ComputeM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2755+
2756+instance HasSpiderTimeline x => R.Reflex (SpiderTimeline x) where
2757+ {-# SPECIALIZE instance R.Reflex (SpiderTimeline Global) #-}
2758+ newtype Behavior (SpiderTimeline x) a = SpiderBehavior { unSpiderBehavior :: Behavior x a }
2759+ newtype Event (SpiderTimeline x) a = SpiderEvent { unSpiderEvent :: Event x a }
2760+ newtype Dynamic (SpiderTimeline x) a = SpiderDynamic { unSpiderDynamic :: DynamicS x (Identity a) } -- deriving (Functor, Applicative, Monad)
2761+ newtype Incremental (SpiderTimeline x) p = SpiderIncremental { unSpiderIncremental :: DynamicS x p }
2762+ type PullM (SpiderTimeline x) = SpiderPullM x
2763+ type PushM (SpiderTimeline x) = SpiderPushM x
2764+ {-# INLINABLE never #-}
2765+ never = SpiderEvent eventNever
2766+ {-# INLINABLE constant #-}
2767+ constant = SpiderBehavior . behaviorConst
2768+ {-# INLINE push #-}
2769+ push f = SpiderEvent . push (coerce f) . unSpiderEvent
2770+ {-# INLINE pushCheap #-}
2771+ pushCheap f = SpiderEvent . pushCheap (coerce f) . unSpiderEvent
2772+ {-# INLINABLE pull #-}
2773+ pull = SpiderBehavior . pull . coerce
2774+ {-# INLINABLE fanG #-}
2775+ fanG e = R.EventSelectorG $ SpiderEvent . selectG (fanG (unSpiderEvent e))
2776+ {-# INLINABLE mergeG #-}
2777+ mergeG
2778+ :: forall k2 (k :: k2 -> *) q (v :: k2 -> *). GCompare k
2779+ => (forall a. q a -> R.Event (SpiderTimeline x) (v a))
2780+ -> DMap k q
2781+ -> R.Event (SpiderTimeline x) (DMap k v)
2782+ mergeG nt = SpiderEvent . mergeG (unSpiderEvent #. nt) . dynamicConst
2783+ {-# INLINABLE switch #-}
2784+ switch = SpiderEvent . switch . (coerce :: Behavior x (R.Event (SpiderTimeline x) a) -> Behavior x (Event x a)) . unSpiderBehavior
2785+ {-# INLINABLE coincidence #-}
2786+ coincidence = SpiderEvent . coincidence . (coerce :: Event x (R.Event (SpiderTimeline x) a) -> Event x (Event x a)) . unSpiderEvent
2787+ {-# INLINABLE current #-}
2788+ current = SpiderBehavior . dynamicCurrent . unSpiderDynamic
2789+ {-# INLINABLE updated #-}
2790+ updated = SpiderEvent #. dynamicUpdated .# fmap coerce . unSpiderDynamic
2791+ {-# INLINABLE unsafeBuildDynamic #-}
2792+ unsafeBuildDynamic readV0 v' = SpiderDynamic $ dynamicDynIdentity $ unsafeBuildDynamic (coerce readV0) $ coerce $ unSpiderEvent v'
2793+ {-# INLINABLE unsafeBuildIncremental #-}
2794+ unsafeBuildIncremental readV0 dv = SpiderIncremental $ dynamicDyn $ unsafeBuildDynamic (coerce readV0) $ unSpiderEvent dv
2795+ {-# INLINABLE mergeIncrementalG #-}
2796+ mergeIncrementalG nt = SpiderEvent #. mergeG (coerce #. nt) .# unSpiderIncremental
2797+ {-# INLINABLE mergeIncrementalWithMoveG #-}
2798+ mergeIncrementalWithMoveG nt = SpiderEvent #. mergeWithMove (coerce #. nt) .# unSpiderIncremental
2799+ {-# INLINABLE currentIncremental #-}
2800+ currentIncremental = SpiderBehavior . dynamicCurrent . unSpiderIncremental
2801+ {-# INLINABLE updatedIncremental #-}
2802+ updatedIncremental = SpiderEvent . dynamicUpdated . unSpiderIncremental
2803+ {-# INLINABLE incrementalToDynamic #-}
2804+ incrementalToDynamic (SpiderIncremental i) = SpiderDynamic $ dynamicDynIdentity $ unsafeBuildDynamic (readBehaviorUntracked $ dynamicCurrent i) $ flip push (dynamicUpdated i) $ \p -> do
2805+ c <- readBehaviorUntracked $ dynamicCurrent i
2806+ return $ Identity <$> apply p c --TODO: Avoid the redundant 'apply'
2807+ eventCoercion Coercion = Coercion
2808+ behaviorCoercion Coercion = Coercion
2809+ dynamicCoercion Coercion = Coercion
2810+ incrementalCoercion Coercion Coercion = Coercion
2811+ {-# INLINABLE mergeIntIncremental #-}
2812+ mergeIntIncremental = SpiderEvent . mergeInt . coerce
2813+ {-# INLINABLE fanInt #-}
2814+ fanInt e = R.EventSelectorInt $ SpiderEvent . selectInt (fanInt (unSpiderEvent e))
2815+
2816+data RootTrigger x a = forall k. GCompare k => RootTrigger (WeakBag (Subscriber x a), IORef (DMap k Identity), k a)
2817+
2818+data SpiderEventHandle x a = SpiderEventHandle
2819+ { spiderEventHandleSubscription :: EventSubscription x
2820+ , spiderEventHandleValue :: IORef (Maybe a)
2821+ }
2822+
20132823instance MonadRef (EventM x) where
20142824 type Ref (EventM x) = Ref IO
20152825 {-# INLINABLE newRef #-}
@@ -2024,7 +2834,7 @@ instance MonadAtomicRef (EventM x) where
20242834 atomicModifyRef r f = liftIO $ atomicModifyRef r f
20252835
20262836-- | The monad for actions that manipulate a Spider timeline identified by @x@
2027−newtype SpiderHost x a = SpiderHost { unSpiderHost :: ReaderT (SpiderTimeline x) IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2837+newtype SpiderHost (x :: Type) a = SpiderHost { unSpiderHost :: IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
20282838
20292839instance Monad (SpiderHost x) where
20302840 {-# INLINABLE (>>=) #-}
@@ -2033,20 +2843,27 @@ instance Monad (SpiderHost x) where
20332843 SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
20342844 {-# INLINABLE return #-}
20352845 return x = SpiderHost $ return x
2846+#if !MIN_VERSION_base(4,13,0)
2847+ {-# INLINABLE fail #-}
2848+ fail = MonadFail.fail
2849+#endif
2850+
2851+instance MonadFail (SpiderHost x) where
20362852 {-# INLINABLE fail #-}
2037− fail s = SpiderHost $ fail s
2853+ fail s = SpiderHost $ MonadFail.fail s
20382854
20392855-- | Run an action affecting the global Spider timeline; this will be guarded by
20402856-- a mutex for that timeline
20412857runSpiderHost :: SpiderHost Global a -> IO a
2042−runSpiderHost (SpiderHost a) = runReaderT a globalSpiderTimeline
2858+runSpiderHost (SpiderHost a) = a
20432859
20442860-- | Run an action affecting a given Spider timeline; this will be guarded by a
20452861-- mutex for that timeline
2046−runSpiderHostForTimeline :: SpiderHost x a -> SpiderTimeline x -> IO a
2047−runSpiderHostForTimeline (SpiderHost a) = runReaderT a
2862+runSpiderHostForTimeline :: SpiderHost x a -> SpiderTimelineEnv x -> IO a
2863+runSpiderHostForTimeline (SpiderHost a) _ = a
20482864
2049−newtype SpiderHostFrame x a = SpiderHostFrame { runSpiderHostFrame :: EventM x a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2865+newtype SpiderHostFrame (x :: Type) a = SpiderHostFrame { runSpiderHostFrame :: EventM x a }
2866+ deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
20502867
20512868instance Monad (SpiderHostFrame x) where
20522869 {-# INLINABLE (>>=) #-}
@@ -2055,26 +2872,21 @@ instance Monad (SpiderHostFrame x) where
20552872 SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
20562873 {-# INLINABLE return #-}
20572874 return x = SpiderHostFrame $ return x
2875+#if !MIN_VERSION_base(4,13,0)
20582876 {-# INLINABLE fail #-}
20592877 fail s = SpiderHostFrame $ fail s
2878+#endif
20602879
2061−instance R.MonadSample (SpiderTimeline x) (SpiderHostFrame x) where
2062− sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
2880+instance NotReady (SpiderTimeline x) (SpiderHostFrame x) where
2881+ notReadyUntil _ = pure ()
2882+ notReady = pure ()
20632883
2064−instance R.MonadHold (SpiderTimeline x) (SpiderHostFrame x) where
2065− {-# INLINABLE hold #-}
2066− hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . behaviorHoldIdentity) $ hold v0 $ coerce $ unSpiderEvent e
2067− {-# INLINABLE holdDyn #-}
2068− holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicHoldIdentity) $ hold v0 $ coerce $ unSpiderEvent e
2069− {-# INLINABLE holdIncremental #-}
2070− holdIncremental v0 e = SpiderHostFrame $ fmap (SpiderIncremental . dynamicHold) $ hold v0 $ unSpiderEvent e
2071−
2072−newEventWithTriggerIO :: (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
2884+newEventWithTriggerIO :: forall x a. HasSpiderTimeline x => (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
20732885newEventWithTriggerIO f = do
20742886 es <- newFanEventWithTriggerIO $ \Refl -> f
20752887 return $ select es Refl
20762888
2077−newFanEventWithTriggerIO :: GCompare k => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
2889+newFanEventWithTriggerIO :: (HasSpiderTimeline x, GCompare k) => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
20782890newFanEventWithTriggerIO f = do
20792891 occRef <- newIORef DMap.empty
20802892 subscribedRef <- newIORef DMap.empty
@@ -2085,41 +2897,8 @@ newFanEventWithTriggerIO f = do
20852897 }
20862898 return $ EventSelector $ \k -> eventRoot k r
20872899
2088−instance R.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHost x) where
2089− newEventWithTrigger = SpiderHost . lift . fmap SpiderEvent . newEventWithTriggerIO
2090− newFanEventWithTrigger f = SpiderHost $ lift $ do
2091− es <- newFanEventWithTriggerIO f
2092− return $ R.EventSelector $ SpiderEvent . select es
2093−
2094−instance R.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHostFrame x) where
2095− newEventWithTrigger = SpiderHostFrame . EventM . liftIO . fmap SpiderEvent . newEventWithTriggerIO
2096− newFanEventWithTrigger f = SpiderHostFrame $ EventM $ liftIO $ do
2097− es <- newFanEventWithTriggerIO f
2098− return $ R.EventSelector $ SpiderEvent . select es
2099−
2100−instance R.MonadSubscribeEvent (SpiderTimeline x) (SpiderHost x) where
2101− {-# INLINABLE subscribeEvent #-}
2102− subscribeEvent = runFrame . runSpiderHostFrame . R.subscribeEvent
2103−
21042900newtype ReadPhase x a = ReadPhase (ResultM x a) deriving (Functor, Applicative, Monad, MonadFix)
21052901
2106−instance R.MonadSample (SpiderTimeline x) (ReadPhase x) where
2107− {-# INLINABLE sample #-}
2108− sample = ReadPhase . R.sample
2109−
2110−instance R.MonadHold (SpiderTimeline x) (ReadPhase x) where
2111− {-# INLINABLE hold #-}
2112− hold v0 e = ReadPhase $ R.hold v0 e
2113− {-# INLINABLE holdDyn #-}
2114− holdDyn v0 e = ReadPhase $ R.holdDyn v0 e
2115− {-# INLINABLE holdIncremental #-}
2116− holdIncremental v0 e = ReadPhase $ R.holdIncremental v0 e
2117−
2118−instance R.MonadReflexHost (SpiderTimeline x) (SpiderHost x) where
2119− type ReadPhase (SpiderHost x) = ReadPhase x
2120− fireEventsAndRead es (ReadPhase a) = run es a
2121− runHostFrame = runFrame . runSpiderHostFrame
2122−
21232902instance MonadRef (SpiderHost x) where
21242903 type Ref (SpiderHost x) = Ref IO
21252904 newRef = SpiderHost . newRef
@@ -2142,9 +2921,10 @@ instance PrimMonad (SpiderHostFrame x) where
21422921 type PrimState (SpiderHostFrame x) = PrimState IO
21432922 primitive = SpiderHostFrame . EventM . primitive
21442923
2145−--------------------------------------------------------------------------------
2146−-- Deprecated items
2147−--------------------------------------------------------------------------------
2924+instance NotReady (SpiderTimeline x) (SpiderHost x) where
2925+ notReadyUntil _ = return ()
2926+ notReady = return ()
21482927
2149−{-# DEPRECATED SpiderEnv "Use 'SpiderTimeline' instead" #-}
2150−type SpiderEnv = SpiderTimeline
2928+instance HasSpiderTimeline x => NotReady (SpiderTimeline x) (PerformEventT (SpiderTimeline x) (SpiderHost x)) where
2929+ notReadyUntil _ = return ()
2930+ notReady = return ()