@@ -9,6 +9,7 @@
99{-# LANGUAGE GADTs #-}
1010{-# LANGUAGE GeneralizedNewtypeDeriving #-}
1111{-# LANGUAGE LambdaCase #-}
12+{-# LANGUAGE MultiWayIf #-}
1213{-# LANGUAGE RankNTypes #-}
1314{-# LANGUAGE RoleAnnotations #-}
1415{-# LANGUAGE ScopedTypeVariables #-}
@@ -19,7 +20,6 @@
1920{-# LANGUAGE DeriveFunctor #-}
2021{-# LANGUAGE StandaloneDeriving #-}
2122{-# LANGUAGE InstanceSigs #-}
22−{-# LANGUAGE MultiWayIf #-}
2323
2424#ifdef USE_REFLEX_OPTIMIZER
2525{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
@@ -38,17 +38,15 @@ import Control.Monad hiding (forM, forM_, mapM, mapM_)
3838import Control.Monad.Exception
3939import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_)
4040import Control.Monad.Primitive
41+--import Control.Monad.Reader hiding (forM, forM_, mapM, mapM_)
4142import Control.Monad.Reader.Class
4243import Control.Monad.IO.Class
4344import Control.Monad.ReaderIO
4445import Control.Monad.Ref
45−import Control.Monad.Fail (MonadFail)
46−import qualified Control.Monad.Fail as MonadFail
4746import Data.Align
4847import Data.Coerce
49−import Data.Dependent.Map (DMap)
48+import Data.Dependent.Map (DMap, DSum (..))
5049import qualified Data.Dependent.Map as DMap
51−import Data.Dependent.Sum (DSum (..))
5250import Data.FastMutableIntMap (FastMutableIntMap, PatchIntMap (..))
5351import qualified Data.FastMutableIntMap as FastMutableIntMap
5452import Data.Foldable hiding (concat, elem, sequence_)
@@ -61,13 +59,12 @@ import qualified Data.IntMap.Strict as IntMap
6159import Data.IORef
6260import Data.Kind (Type)
6361import Data.Maybe hiding (mapMaybe)
64−import Data.Monoid (mempty, (<>))
62+import Data.Monoid ((<>))
6563import Data.Proxy
6664import Data.These
6765import Data.Traversable
68−import Data.Type.Equality ((:~:)(Refl))
6966import Data.Witherable (Filterable, mapMaybe)
70−import GHC.Exts hiding (toList)
67+import GHC.Exts
7168import GHC.IORef (IORef (..))
7269import GHC.Stack
7370import Reflex.FastWeak
@@ -75,27 +72,22 @@ import System.IO.Unsafe
7572import System.Mem.Weak
7673import Unsafe.Coerce
7774
78−#ifdef MIN_VERSION_semialign
75+#if defined(MIN_VERSION_semialign)
7976#if MIN_VERSION_these(0,8,0)
8077import Data.These.Combinators (justThese)
8178#endif
82−#if MIN_VERSION_semialign(1,1,0)
83−import Data.Zip (Zip (..))
84−#endif
8579#endif
8680
8781#ifdef DEBUG_CYCLES
8882import Control.Monad.State hiding (forM, forM_, mapM, mapM_, sequence)
89−#endif
90−
9183import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
9284import qualified Data.List.NonEmpty as NonEmpty
85+import Data.Monoid (mempty)
9386import Data.Tree (Forest, Tree (..), drawForest)
94−import Data.List (isPrefixOf)
87+#endif
9588
96−import Data.FastWeakBag (FastWeakBag, FastWeakBagTicket)
89+import Data.FastWeakBag (FastWeakBag)
9790import qualified Data.FastWeakBag as FastWeakBag
98−
9991import Data.Reflection
10092import Data.Some (Some(Some))
10193import Data.Type.Coercion
@@ -106,65 +98,30 @@ import qualified Reflex.Class
10698import qualified Reflex.Class as R
10799import qualified Reflex.Host.Class
108100import Reflex.NotReady.Class
109−import Data.Patch
110−import qualified Data.Patch.DMapWithMove as PatchDMapWithMove
111−import Reflex.PerformEvent.Base (PerformEventT)
101+import Reflex.Patch
102+import qualified Reflex.Patch.DMapWithMove as PatchDMapWithMove
103+
104+
112105
113106#ifdef DEBUG_TRACE_EVENTS
114107import qualified Data.ByteString.Char8 as BS8
115108import System.IO (stderr)
116109import Data.List (isPrefixOf)
117−#endif
118−
119−-- TODO stdout might not be the best channel for debug output
120−debugStrLn :: String -> IO ()
121−debugStrLn = putStrLn
122110
123−#ifdef DEBUG_TRACE_EVENTS
124111withStackOneLine :: (BS8.ByteString -> a) -> a
125112withStackOneLine expr = unsafePerformIO $ do
126113 stack <- currentCallStack
127114 return (expr . BS8.pack . unwords . dropInternal . reverse $ stack)
128− where dropInternal = filterStack "Reflex.Spider.Internal"
115+ where dropInternal = filter (not . isPrefixOf "Reflex.Spider.Internal")
129116
130117#endif
131118
132−debugPropagate :: Bool
133−
134−debugInvalidateHeight :: Bool
135−
136−debugInvalidate :: Bool
137−
138119#ifdef DEBUG
139120#define DEBUG_NODEIDS
140121
141−#ifdef DEBUG_TRACE_PROPAGATION
142−debugPropagate = True
143−#else
144−debugPropagate = False
145−#endif
146−
147−#ifdef DEBUG_TRACE_HEIGHT
148−debugInvalidateHeight = True
149−#else
150−debugInvalidateHeight = False
151−#endif
152−
153−#ifdef DEBUG_TRACE_INVALIDATION
154−debugInvalidate = True
155−#else
156−debugInvalidate = False
157−#endif
158−
159122class HasNodeId a where
160123 getNodeId :: a -> Int
161124
162−instance HasNodeId (CacheSubscribed x a) where
163− getNodeId = _cacheSubscribed_nodeId
164−
165−instance HasNodeId (FanInt x a) where
166− getNodeId = _fanInt_nodeId
167−
168125instance HasNodeId (Hold x p) where
169126 getNodeId = holdNodeId
170127
@@ -185,27 +142,16 @@ instance HasNodeId (Pull x a) where
185142
186143{-# INLINE showNodeId #-}
187144showNodeId :: HasNodeId a => a -> String
188−showNodeId = showNodeId' . getNodeId
189−
190−showNodeId' :: Int -> String
191−showNodeId' = ("#"<>) . show
145+showNodeId = ("#"<>) . show . getNodeId
192146
193147
194148#else
195149
196−debugPropagate = False
197−debugInvalidateHeight = False
198−debugInvalidate = False
199−
200150-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
201151{-# INLINE showNodeId #-}
202152showNodeId :: a -> String
203153showNodeId _ = ""
204154
205−{-# INLINE showNodeId' #-}
206−showNodeId' :: Int -> String
207−showNodeId' _ = ""
208−
209155#endif
210156
211157#ifdef DEBUG_NODEIDS
@@ -251,9 +197,9 @@ subscribeAndRead = unEvent
251197-- caching; if the computation function is very cheap, this is (much) more
252198-- efficient than 'push'
253199{-# INLINE [1] pushCheap #-}
254−pushCheap :: HasSpiderTimeline x => (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
200+pushCheap :: (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
255201pushCheap !f e = Event $ \sub -> do
256− (subscription, occ) <- subscribeAndRead e $ debugSubscriber' "push" $ sub
202+ (subscription, occ) <- subscribeAndRead e $ sub
257203 { subscriberPropagate = \a -> do
258204 mb <- f a
259205 mapM_ (subscriberPropagate sub) mb
@@ -272,10 +218,10 @@ terminalSubscriber p = Subscriber
272218
273219-- | Subscribe to an Event only for the duration of one occurrence
274220{-# INLINE subscribeAndReadHead #-}
275−subscribeAndReadHead :: HasSpiderTimeline x => Event x a -> Subscriber x a -> EventM x (EventSubscription x, Maybe a)
221+subscribeAndReadHead :: Event x a -> Subscriber x a -> EventM x (EventSubscription x, Maybe a)
276222subscribeAndReadHead e sub = do
277223 subscriptionRef <- liftIO $ newIORef $ error "subscribeAndReadHead: not initialized"
278− (subscription, occ) <- subscribeAndRead e $ debugSubscriber' "head" $ sub
224+ (subscription, occ) <- subscribeAndRead e $ sub
279225 { subscriberPropagate = \a -> do
280226 liftIO $ unsubscribe =<< readIORef subscriptionRef
281227 subscriberPropagate sub a
@@ -286,42 +232,24 @@ subscribeAndReadHead e sub = do
286232 return (subscription, occ)
287233
288234--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)
235+headE :: (MonadIO m, Defer (SomeMergeInit x) m) => Event x a -> m (Event x a)
290236headE originalE = do
291237 parent <- liftIO $ newIORef $ Just originalE
292238 defer $ SomeMergeInit $ do --TODO: Rename SomeMergeInit appropriately
293239 let clearParent = liftIO $ writeIORef parent Nothing
294− (_, occ) <- subscribeAndReadHead originalE $ terminalSubscriber $ const clearParent
240+ (_, occ) <- subscribeAndReadHead originalE $ terminalSubscriber $ \_ -> clearParent
295241 when (isJust occ) clearParent
296− return $ Event $ \sub ->
242+ return $ Event $ \sub -> do
297243 liftIO (readIORef parent) >>= \case
298− Nothing -> subscribeAndReadNever
244+ Nothing -> return (EventSubscription (return ()) $ EventSubscribed zeroRef $ toAny (), Nothing)
299245 Just e -> subscribeAndReadHead e sub
300246
301247data CacheSubscribed x a
302248 = CacheSubscribed { _cacheSubscribed_subscribers :: {-# UNPACK #-} !(FastWeakBag (Subscriber x a))
303249 , _cacheSubscribed_parent :: {-# UNPACK #-} !(EventSubscription x)
304250 , _cacheSubscribed_occurrence :: {-# UNPACK #-} !(IORef (Maybe a))
305−#ifdef DEBUG_NODEIDS
306− , _cacheSubscribed_nodeId :: {-# UNPACK #-} !Int
307−#endif
308251 }
309252
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−
325253-- | Construct an 'Event' whose value is guaranteed not to be recomputed
326254-- repeatedly
327255--
@@ -346,23 +274,16 @@ cacheEvent e =
346274 subscribedTicket <- liftIO (readIORef mSubscribedRef >>= getFastWeakTicket) >>= \case
347275 Just subscribedTicket -> return subscribedTicket
348276 Nothing -> do
349−#ifdef DEBUG_NODEIDS
350− nodeId <- liftIO newNodeId
351−#endif
352277 subscribers <- liftIO FastWeakBag.empty
353278 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
357279 (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− }
280+ { subscriberPropagate = \a -> do
281+ liftIO $ writeIORef occRef (Just a)
282+ scheduleClear occRef
283+ propagateFast a subscribers
284+ , subscriberInvalidateHeight = FastWeakBag.traverse subscribers . invalidateSubscriberHeight
285+ , subscriberRecalculateHeight = FastWeakBag.traverse subscribers . recalculateSubscriberHeight
286+ }
366287 when (isJust occ) $ do
367288 liftIO $ writeIORef occRef occ -- Set the initial value of occRef; we don't need to do this if occ is Nothing
368289 scheduleClear occRef
@@ -370,45 +291,29 @@ cacheEvent e =
370291 { _cacheSubscribed_subscribers = subscribers
371292 , _cacheSubscribed_parent = parentSub
372293 , _cacheSubscribed_occurrence = occRef
373−#ifdef DEBUG_NODEIDS
374− , _cacheSubscribed_nodeId = nodeId
375−#endif
376294 }
377295 subscribedTicket <- liftIO $ mkFastWeakTicket subscribed
378296 liftIO $ writeIORef mSubscribedRef =<< getFastWeakTicketWeak subscribedTicket
379297 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− }
409− }
410− return (es, occ)
411−
298+ liftIO $ do
299+ subscribed <- getFastWeakTicketValue subscribedTicket
300+ ticket <- FastWeakBag.insert sub $ _cacheSubscribed_subscribers subscribed
301+ occ <- readIORef $ _cacheSubscribed_occurrence subscribed
302+ let es = EventSubscription
303+ { _eventSubscription_unsubscribe = do
304+ FastWeakBag.remove ticket
305+ isEmpty <- FastWeakBag.isEmpty $ _cacheSubscribed_subscribers subscribed
306+ when isEmpty $ do
307+ writeIORef mSubscribedRef emptyFastWeak
308+ unsubscribe $ _cacheSubscribed_parent subscribed
309+ touch ticket
310+ touch subscribedTicket
311+ , _eventSubscription_subscribed = EventSubscribed
312+ { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ _cacheSubscribed_parent subscribed
313+ , eventSubscribedRetained = toAny subscribedTicket
314+ }
315+ }
316+ return (es, occ)
412317
413318subscribe :: Event x a -> Subscriber x a -> EventM x (EventSubscription x)
414319subscribe e s = fst <$> subscribeAndRead e s
@@ -423,11 +328,8 @@ wrap tag getSpecificSubscribed sub = do
423328eventRoot :: (GCompare k, HasSpiderTimeline x) => k a -> Root x k -> Event x a
424329eventRoot !k !r = Event $ wrap eventSubscribedRoot $ liftIO . getRootSubscribed k r
425330
426−subscribeAndReadNever :: EventM x (EventSubscription x, Maybe a)
427−subscribeAndReadNever = return (EventSubscription (return ()) eventSubscribedNever, Nothing)
428−
429331eventNever :: Event x a
430−eventNever = Event $ const subscribeAndReadNever
332+eventNever = Event $ \_ -> return (EventSubscription (return ()) eventSubscribedNever, Nothing)
431333
432334eventFan :: (GCompare k, HasSpiderTimeline x) => k a -> Fan x k v -> Event x (v a)
433335eventFan !k !f = Event $ wrap eventSubscribedFan $ getFanSubscribed k f
@@ -464,6 +366,16 @@ data Subscriber x a = Subscriber
464366 , subscriberRecalculateHeight :: !(Height -> IO ())
465367 }
466368
369+--TODO: Move this comment to WeakBag
370+-- These function are constructor functions that are marked NOINLINE so they are
371+-- opaque to GHC. If we do not do this, then GHC will sometimes fuse the constructor away
372+-- so any weak references that are attached to the constructors will have their
373+-- finalizer run. Using the opaque constructor, does not see the
374+-- constructor application, so it behaves like an IORef and cannot be fused away.
375+--
376+-- The result is also evaluated to WHNF, since forcing a thunk invalidates
377+-- the weak pointer to it in some cases.
378+
467379newSubscriberHold :: (HasSpiderTimeline x, Patch p) => Hold x p -> IO (Subscriber x p)
468380newSubscriberHold h = return $ Subscriber
469381 { subscriberPropagate = {-# SCC "traverseHold" #-} propagateSubscriberHold h
@@ -485,12 +397,14 @@ newSubscriberFan subscribed = debugSubscriber ("SubscriberFan " <> showNodeId su
485397 return ()
486398 , subscriberInvalidateHeight = \old -> do
487399 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
488− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
400+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
401+
489402 , subscriberRecalculateHeight = \new -> do
490403 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
491− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
404+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
492405 }
493406
407+
494408newSubscriberSwitch :: forall x a. HasSpiderTimeline x => SwitchSubscribed x a -> IO (Subscriber x a)
495409newSubscriberSwitch subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
496410 { subscriberPropagate = \a -> {-# SCC "traverseSwitch" #-} do
@@ -501,7 +415,7 @@ newSubscriberSwitch subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <
501415 oldHeight <- readIORef $ switchSubscribedHeight subscribed
502416 when (oldHeight /= invalidHeight) $ do
503417 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
504− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
418+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
505419 , subscriberRecalculateHeight = (`updateSwitchHeight` subscribed)
506420 }
507421
@@ -517,17 +431,17 @@ newSubscriberCoincidenceOuter subscribed = debugSubscriber ("SubscriberCoinciden
517431 liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
518432 scheduleClear $ coincidenceSubscribedInnerParent subscribed
519433 case occ of
520− Nothing ->
434+ Nothing -> do
521435 when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
522436 writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
523− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
524− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
437+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
438+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
525439 Just o -> do -- Since it's already firing, no need to adjust height
526440 liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
527441 scheduleClear $ coincidenceSubscribedOccurrence subscribed
528442 propagate o $ coincidenceSubscribedSubscribers subscribed
529443 , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
530− , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
444+ , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
531445 }
532446
533447newSubscriberCoincidenceInner :: forall x a. HasSpiderTimeline x => CoincidenceSubscribed x a -> IO (Subscriber x a)
@@ -551,18 +465,18 @@ recalculateSubscriberHeight :: Height -> Subscriber x a -> IO ()
551465recalculateSubscriberHeight = flip subscriberRecalculateHeight
552466
553467-- | Propagate everything at the current height
554−propagate :: forall x a. HasSpiderTimeline x => a -> WeakBag (Subscriber x a) -> EventM x ()
555−propagate a subscribers = withIncreasedDepth (Proxy::Proxy x) $
468+propagate :: a -> WeakBag (Subscriber x a) -> EventM x ()
469+propagate a subscribers = withIncreasedDepth (Proxy::Proxy x) $ do
556470 -- 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
557471 --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
472+ WeakBag.traverse subscribers $ \s -> subscriberPropagate s a
559473
560474-- | 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) $
475+propagateFast :: a -> FastWeakBag (Subscriber x a) -> EventM x ()
476+propagateFast a subscribers = withIncreasedDepth (Proxy::Proxy x) $ do
563477 -- 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
564478 --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
565− FastWeakBag.traverse_ subscribers $ \s -> subscriberPropagate s a
479+ FastWeakBag.traverse subscribers $ \s -> subscriberPropagate s a
566480
567481--------------------------------------------------------------------------------
568482-- EventSubscribed
@@ -580,7 +494,7 @@ data EventSubscribed x = EventSubscribed
580494 { eventSubscribedHeightRef :: {-# UNPACK #-} !(IORef Height)
581495 , eventSubscribedRetained :: {-# NOUNPACK #-} !Any
582496#ifdef DEBUG_CYCLES
583− , eventSubscribedGetParents :: !(IO [EventSubscribed x]) -- For debugging loops
497+ , eventSubscribedGetParents :: !(IO [Some (EventSubscribed x)]) -- For debugging loops
584498 , eventSubscribedHasOwnHeightRef :: !Bool
585499 , eventSubscribedWhoCreated :: !(IO [String])
586500#endif
@@ -607,23 +521,13 @@ eventSubscribedNever = EventSubscribed
607521 , eventSubscribedWhoCreated = return ["never"]
608522#endif
609523 }
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− }
620524
621525eventSubscribedFan :: FanSubscribed x k v -> EventSubscribed x
622526eventSubscribedFan !subscribed = EventSubscribed
623527 { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
624528 , eventSubscribedRetained = toAny subscribed
625529#ifdef DEBUG_CYCLES
626− , eventSubscribedGetParents = return [_eventSubscription_subscribed $ fanSubscribedParent subscribed]
530+ , eventSubscribedGetParents = return [Some $ _eventSubscription_subscribed $ fanSubscribedParent subscribed]
627531 , eventSubscribedHasOwnHeightRef = False
628532 , eventSubscribedWhoCreated = whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
629533#endif
@@ -636,7 +540,7 @@ eventSubscribedSwitch !subscribed = EventSubscribed
636540#ifdef DEBUG_CYCLES
637541 , eventSubscribedGetParents = do
638542 s <- readIORef $ switchSubscribedCurrentParent subscribed
639− return [_eventSubscription_subscribed s]
543+ return [Some $ _eventSubscription_subscribed s]
640544 , eventSubscribedHasOwnHeightRef = True
641545 , eventSubscribedWhoCreated = whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
642546#endif
@@ -649,8 +553,8 @@ eventSubscribedCoincidence !subscribed = EventSubscribed
649553#ifdef DEBUG_CYCLES
650554 , eventSubscribedGetParents = do
651555 innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
652− let outerParent = _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
653− innerParents = maybeToList $ innerSubscription
556+ let outerParent = Some $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
557+ innerParents = maybeToList $ fmap Some innerSubscription
654558 return $ outerParent : innerParents
655559 , eventSubscribedHasOwnHeightRef = True
656560 , eventSubscribedWhoCreated = whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
@@ -664,15 +568,15 @@ getEventSubscribedHeight es = readIORef $ eventSubscribedHeightRef es
664568whoCreatedEventSubscribed :: EventSubscribed x -> IO [String]
665569whoCreatedEventSubscribed = eventSubscribedWhoCreated
666570
667−walkInvalidHeightParents :: EventSubscribed x -> IO [EventSubscribed x]
571+walkInvalidHeightParents :: EventSubscribed x -> IO [Some (EventSubscribed x)]
668572walkInvalidHeightParents s0 = do
669− subscribers <- flip execStateT mempty $ ($ s0) $ fix $ \loop s -> do
573+ subscribers <- flip execStateT mempty $ ($ Some s0) $ fix $ \loop (Some s) -> do
670574 h <- liftIO $ readIORef $ eventSubscribedHeightRef s
671575 when (h == invalidHeight) $ do
672576 when (eventSubscribedHasOwnHeightRef s) $ liftIO $ writeIORef (eventSubscribedHeightRef s) $! invalidHeightBeingTraversed
673− modify (s :)
577+ modify (Some s :)
674578 mapM_ loop =<< liftIO (eventSubscribedGetParents s)
675− forM_ subscribers $ \s -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
579+ forM_ subscribers $ \(Some s) -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
676580 return subscribers
677581#endif
678582
@@ -994,10 +898,8 @@ instance Monad (BehaviorM x) where
994898 BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
995899 {-# INLINE return #-}
996900 return x = BehaviorM $ return x
997−#if !MIN_VERSION_base(4,13,0)
998901 {-# INLINE fail #-}
999902 fail s = BehaviorM $ fail s
1000−#endif
1001903
1002904data BehaviorSubscribed x a
1003905 = forall p. BehaviorSubscribedHold (Hold x p)
@@ -1057,7 +959,7 @@ data SomeMergeUpdate x = SomeMergeUpdate
1057959newtype SomeMergeInit x = SomeMergeInit { unSomeMergeInit :: EventM x () }
1058960
1059961-- EventM can do everything BehaviorM can, plus create holds
1060−newtype EventM x a = EventM { unEventM :: IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadException, MonadAsyncException)
962+newtype EventM x a = EventM { unEventM :: IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadException, MonadAsyncException)
1061963
1062964newtype MergeSubscribedParent x a = MergeSubscribedParent { unMergeSubscribedParent :: EventSubscription x }
1063965
@@ -1082,8 +984,7 @@ heightBagFromList :: [Height] -> HeightBag
1082984heightBagFromList heights = heightBagVerify $ foldl' (flip heightBagAdd) heightBagEmpty heights
1083985
1084986heightBagAdd :: Height -> HeightBag -> HeightBag
1085−heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $
1086− IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
987+heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
1087988
1088989heightBagRemove :: Height -> HeightBag -> HeightBag
1089990heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.lookup h c of
@@ -1092,13 +993,6 @@ heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.loo
1092993 0 -> IntMap.delete h c
1093994 _ -> IntMap.insert h (pred old) c
1094995
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−
1102996heightBagMax :: HeightBag -> Height
1103997heightBagMax (HeightBag _ c) = case IntMap.maxViewWithKey c of
1104998 Just ((h, _), _) -> Height h
@@ -1199,10 +1093,7 @@ instance HasSpiderTimeline x => Semialign (Event x) where
11991093 align ea eb = mapMaybe dmapToThese $ mergeG coerce $ dynamicConst $
12001094 DMap.fromDistinctAscList [LeftTag :=> ea, RightTag :=> eb]
12011095
1202−#ifdef MIN_VERSION_semialign
1203−#if MIN_VERSION_semialign(1,1,0)
1204−instance HasSpiderTimeline x => Zip (Event x) where
1205−#endif
1096+#if defined(MIN_VERSION_semialign)
12061097 zip x y = mapMaybe justThese $ align x y
12071098#endif
12081099
@@ -1346,7 +1237,7 @@ mkWeakPtrWithDebug x debugNote = do
13461237 x' <- evaluate x
13471238 mkWeakPtr x' $
13481239 if debugFinalize
1349− then Just $ debugStrLn $ "finalizing: " ++ debugNote
1240+ then Just $ putStrLn $ "finalizing: " ++ debugNote
13501241 else Nothing
13511242
13521243type WeakList a = [Weak a]
@@ -1359,22 +1250,19 @@ type CanTrace x m = (HasSpiderTimeline x, MonadIO m)
13591250#ifdef DEBUG
13601251
13611252debugSubscriber :: 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
1253+debugSubscriber description subscribed = return $ Subscriber
13661254 {
13671255 subscriberPropagate = \m -> do
13681256 tracePropagate (Proxy :: Proxy x) ("subscriberPropagate: " <> description)
13691257 subscriberPropagate subscribed m
13701258 , subscriberInvalidateHeight = \old -> do
1371− traceInvalidateHeight $ "invalidateSubscriberHeight: " <> description <> ", old = " <> show (unHeight old)
1259+ putStrLn $ "invalidateSubscriberHeight: " <> description
13721260 subscriberInvalidateHeight subscribed old
1373− traceInvalidateHeight $ "invalidateSubscriberHeight: " <> description <> ", done"
1261+ putStrLn $ "invalidateSubscriberHeight: " <> description <> ", done"
13741262 , subscriberRecalculateHeight = \new -> do
1375− traceInvalidateHeight $ "subscriberRecalculateHeight: " <> description <> ", new = " <> show (unHeight new)
1263+ putStrLn $ "subscriberRecalculateHeight: " <> description
13761264 subscriberRecalculateHeight subscribed new
1377− traceInvalidateHeight $ "subscriberRecalculateHeight: " <> description <> ", done"
1265+ putStrLn $ "subscriberRecalculateHeight: " <> description <> ", done"
13781266 }
13791267
13801268
@@ -1388,15 +1276,11 @@ withIncreasedDepth _ a = do
13881276
13891277{-# INLINE tracePropagate #-}
13901278tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1391−tracePropagate p = when debugPropagate . trace p
1279+tracePropagate p = trace p
13921280
13931281{-# INLINE traceInvalidate #-}
13941282traceInvalidate :: String -> IO ()
1395−traceInvalidate = when debugInvalidate . liftIO . debugStrLn
1396−
1397−{-# INLINE traceInvalidateHeight #-}
1398−traceInvalidateHeight :: String -> IO ()
1399−traceInvalidateHeight = when debugInvalidateHeight . liftIO . debugStrLn
1283+traceInvalidate = liftIO . putStrLn
14001284
14011285{-# INLINE trace #-}
14021286trace :: (CanTrace x m) => proxy x -> String -> m ()
@@ -1407,7 +1291,7 @@ traceM :: forall x proxy m. (CanTrace x m) => proxy x -> m String -> m ()
14071291traceM _ getMessage = do
14081292 message <- getMessage
14091293 d <- liftIO $ readIORef $ _spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)
1410− liftIO $ debugStrLn $ replicate d ' ' <> message
1294+ liftIO $ putStrLn $ replicate d ' ' <> message
14111295
14121296#else
14131297
@@ -1423,20 +1307,10 @@ tracePropagate _ _ = return ()
14231307traceInvalidate :: String -> IO ()
14241308traceInvalidate _ = return ()
14251309
1426−{-# INLINE traceInvalidateHeight #-}
1427−traceInvalidateHeight :: String -> IO ()
1428−traceInvalidateHeight _ = return ()
1429−
14301310{-# INLINE debugSubscriber #-}
14311311debugSubscriber :: String -> Subscriber x a -> IO (Subscriber x a)
14321312debugSubscriber _ = return
14331313
1434−{-# INLINE debugSubscriber' #-}
1435−debugSubscriber' :: String -> Subscriber x a -> Subscriber x a
1436−debugSubscriber' _ = id
1437−
1438−
1439−
14401314{-# INLINE trace #-}
14411315trace :: (CanTrace x m) => proxy x -> String -> m ()
14421316trace _ _ = return ()
@@ -1447,9 +1321,13 @@ traceM _ _ = return ()
14471321
14481322#endif
14491323
1324+
1325+
1326+
14501327whoCreatedIORef :: IORef a -> IO [String]
14511328whoCreatedIORef (IORef a) = whoCreated $! a
14521329
1330+#ifdef DEBUG_CYCLES
14531331groupByHead :: Eq a => [NonEmpty a] -> [(a, NonEmpty [a])]
14541332groupByHead = \case
14551333 [] -> []
@@ -1460,45 +1338,13 @@ groupByHead = \case
14601338 | otherwise -> (x, xs :| []) : l
14611339
14621340listsToForest :: Eq a => [[a]] -> Forest a
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
1341+listsToForest l = fmap (\(a, l') -> Node a $ listsToForest $ toList l') $ groupByHead $ catMaybes $ fmap nonEmpty l
14741342#endif
14751343
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−
14981344{-# INLINE propagateSubscriberHold #-}
14991345propagateSubscriberHold :: forall x p. (HasSpiderTimeline x, Patch p) => Hold x p -> p -> EventM x ()
15001346propagateSubscriberHold h a = do
1501− {-# SCC "trace" #-} when debugPropagate $ traceM (Proxy :: Proxy x) $ liftIO $ do
1347+ traceM (Proxy :: Proxy x) $ liftIO $ do
15021348 invalidators <- liftIO $ readIORef $ holdInvalidators h
15031349 return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
15041350
@@ -1506,7 +1352,7 @@ propagateSubscriberHold h a = do
15061352 case {-# SCC "apply" #-} apply a v of
15071353 Nothing -> return ()
15081354 Just v' -> do
1509− {-# SCC "trace2" #-} withIncreasedDepth (Proxy :: Proxy x) $
1355+ withIncreasedDepth (Proxy :: Proxy x) $
15101356 tracePropagate (Proxy :: Proxy x) ("propagateSubscriberHold: assigning Hold" <> showNodeId h)
15111357 vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
15121358 iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
@@ -1627,9 +1473,6 @@ data FanInt x a = FanInt
16271473 { _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
16281474 , _fanInt_subscriptionRef :: {-# UNPACK #-} !(IORef (EventSubscription x)) -- This should have a valid subscription iff subscribers is non-empty
16291475 , _fanInt_occRef :: {-# UNPACK #-} !(IORef (IntMap a))
1630−#ifdef DEBUG_NODEIDS
1631− , _fanInt_nodeId :: {-# UNPACK #-} !Int
1632−#endif
16331476 }
16341477
16351478newFanInt :: IO (FanInt x a)
@@ -1637,16 +1480,10 @@ newFanInt = do
16371480 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
16381481 subscriptionRef <- newIORef $ error "fanInt: no subscription"
16391482 occRef <- newIORef $ error "fanInt: no occurrence"
1640−#ifdef DEBUG_NODEIDS
1641− nodeId <- newNodeId
1642−#endif
16431483 return $ FanInt
16441484 { _fanInt_subscribers = subscribers
16451485 , _fanInt_subscriptionRef = subscriptionRef
16461486 , _fanInt_occRef = occRef
1647−#ifdef DEBUG_NODEIDS
1648− , _fanInt_nodeId = nodeId
1649−#endif
16501487 }
16511488
16521489fanInt :: HasSpiderTimeline x => Event x (IntMap a) -> EventSelectorInt x a
@@ -1655,21 +1492,20 @@ fanInt p = unsafePerformIO $ do
16551492 pure $ EventSelectorInt $ \k -> Event $ \sub -> do
16561493 isEmpty <- liftIO $ FastMutableIntMap.isEmpty (_fanInt_subscribers self)
16571494 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
1495+ (subscription, parentOcc) <- subscribeAndRead p $ Subscriber
16601496 { subscriberPropagate = \m -> do
16611497 liftIO $ writeIORef (_fanInt_occRef self) m
16621498 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 ->
1499+ FastMutableIntMap.forIntersectionWithImmutable_ (_fanInt_subscribers self) m $ \b v -> do --TODO: Do we need to know that no subscribers are being added as we traverse?
1500+ FastWeakBag.traverse b $ \s -> do
16651501 subscriberPropagate s v
1666− , subscriberInvalidateHeight = \old ->
1667− FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1668− FastWeakBag.traverse_ b $ \s ->
1502+ , subscriberInvalidateHeight = \old -> do
1503+ FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b -> do
1504+ FastWeakBag.traverse b $ \s -> do
16691505 subscriberInvalidateHeight s old
1670− , subscriberRecalculateHeight = \new ->
1671− FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1672− FastWeakBag.traverse_ b $ \s ->
1506+ , subscriberRecalculateHeight = \new -> do
1507+ FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b -> do
1508+ FastWeakBag.traverse b $ \s -> do
16731509 subscriberRecalculateHeight s new
16741510 }
16751511 liftIO $ do
@@ -1683,25 +1519,10 @@ fanInt p = unsafePerformIO $ do
16831519 FastMutableIntMap.insert (_fanInt_subscribers self) k b
16841520 return b
16851521 Just b -> return b
1686− ticket <- liftIO $ FastWeakBag.insert sub b
1522+ t <- liftIO $ FastWeakBag.insert sub b
16871523 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−
1524+ (EventSubscription _ (EventSubscribed !heightRef _)) <- readIORef (_fanInt_subscriptionRef self)
1525+ return (EventSubscription (FastWeakBag.remove t) $! EventSubscribed heightRef $! toAny (_fanInt_subscriptionRef self, t), IntMap.lookup k currentOcc)
17051526
17061527{-# INLINABLE getFanSubscribed #-}
17071528getFanSubscribed :: (HasSpiderTimeline x, GCompare k) => k a -> Fan x k v -> Subscriber x (v a) -> EventM x (WeakBagTicket, FanSubscribed x k v, Maybe (v a))
@@ -1899,7 +1720,7 @@ mergeCheap
18991720 => (forall a. q a -> Event x (v a))
19001721 -> DynamicS x (PatchDMap k q)
19011722 -> Event x (DMap k v)
1902−mergeCheap nt = mergeGCheap' unMergeSubscribedParent getInitialSubscribers updateMe destroy
1723+mergeCheap nt = mergeGCheap' getInitialSubscribers updateMe destroy
19031724 where
19041725 updateMe :: MergeUpdateFunc k v x (PatchDMap k q) (MergeSubscribedParent x)
19051726 updateMe subscriber heightBagRef oldParents (PatchDMap p) = do
@@ -1914,9 +1735,7 @@ mergeCheap nt = mergeGCheap' unMergeSubscribedParent getInitialSubscribers updat
19141735 liftIO $ modifyIORef' heightBagRef $ heightBagAdd newParentHeight
19151736 return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
19161737 forM_ mOldSubd $ \oldSubd -> do
1917− oldHeight <- liftIO $ getEventSubscribedHeight $
1918− _eventSubscription_subscribed $ unMergeSubscribedParent oldSubd
1919−
1738+ oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $ unMergeSubscribedParent oldSubd
19201739 liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
19211740 return (maybeToList (unMergeSubscribedParent <$> mOldSubd) ++ subscriptionsToKill, newPs)
19221741 foldM f ([], oldParents) $ DMap.toList p
@@ -1941,7 +1760,7 @@ mergeCheapWithMove :: forall k x v q. (HasSpiderTimeline x, GCompare k)
19411760 => (forall a. q a -> Event x (v a))
19421761 -> DynamicS x (PatchDMapWithMove k q)
19431762 -> Event x (DMap k v)
1944−mergeCheapWithMove nt = mergeGCheap' _mergeSubscribedParentWithMove_subscription getInitialSubscribers updateMe destroy
1763+mergeCheapWithMove nt = mergeGCheap' getInitialSubscribers updateMe destroy
19451764 where
19461765 updateMe :: MergeUpdateFunc k v x (PatchDMapWithMove k q) (MergeSubscribedParentWithMove x k)
19471766 updateMe subscriber heightBagRef oldParents p = do
@@ -1960,17 +1779,13 @@ mergeCheapWithMove nt = mergeGCheap' _mergeSubscribedParentWithMove_subscription
19601779 let moveOrDelete :: forall a. k a -> PatchDMapWithMove.NodeInfo k q a -> MergeSubscribedParentWithMove x k a -> Constant (EventM x (Maybe (EventSubscription x))) a
19611780 moveOrDelete _ ni parent = Constant $ case getComposeMaybe $ PatchDMapWithMove._nodeInfo_to ni of
19621781 Nothing -> do
1963− oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $
1964− _mergeSubscribedParentWithMove_subscription parent
1965−
1782+ oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $ _mergeSubscribedParentWithMove_subscription parent
19661783 liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
19671784 return $ Just $ _mergeSubscribedParentWithMove_subscription parent
19681785 Just toKey -> do
19691786 liftIO $ writeIORef (_mergeSubscribedParentWithMove_key parent) $! toKey
19701787 return Nothing
1971− toDelete <- fmap catMaybes $ mapM (\(_ :=> v) -> getConstant v) $ DMap.toList $
1972− DMap.intersectionWithKey moveOrDelete (unPatchDMapWithMove p) oldParents
1973−
1788+ toDelete <- fmap catMaybes $ mapM (\(_ :=> v) -> getConstant v) $ DMap.toList $ DMap.intersectionWithKey moveOrDelete (unPatchDMapWithMove p) oldParents
19741789 return (toDelete, applyAlways p' oldParents)
19751790 getInitialSubscribers :: MergeInitFunc k v q x (MergeSubscribedParentWithMove x k)
19761791 getInitialSubscribers initialParents subscriber = do
@@ -1995,8 +1810,6 @@ type MergeUpdateFunc k v x p s
19951810 -> p
19961811 -> EventM x ([EventSubscription x], DMap k s)
19971812
1998−type MergeGetSubscription x s = forall a. s a -> EventSubscription x
1999−
20001813type MergeInitFunc k v q x s
20011814 = DMap k q
20021815 -> (forall a. EventM x (k a) -> Subscriber x (v a))
@@ -2020,17 +1833,14 @@ invalidateMergeHeight m = invalidateMergeHeight' (_merge_heightRef m) (_merge_su
20201833invalidateMergeHeight' :: IORef Height -> Subscriber x a -> IO ()
20211834invalidateMergeHeight' heightRef sub = do
20221835 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
1836+ 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
20251837 writeIORef heightRef $! invalidHeight
20261838 subscriberInvalidateHeight sub oldHeight
20271839
20281840revalidateMergeHeight :: Merge x k v s -> IO ()
20291841revalidateMergeHeight m = do
20301842 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
1843+ when (currentHeight == invalidHeight) $ do -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
20341844 heights <- readIORef $ _merge_heightBagRef m
20351845 parents <- readIORef $ _merge_parentsRef m
20361846 -- When the number of heights in the bag reaches the number of parents, we should have a valid height
@@ -2038,7 +1848,7 @@ revalidateMergeHeight m = do
20381848 LT -> return ()
20391849 EQ -> do
20401850 let height = succHeight $ heightBagMax heights
2041− traceInvalidateHeight $ "recalculateSubscriberHeight: height: " <> show height
1851+ traceInvalidate $ "recalculateSubscriberHeight: height: " <> show height
20421852 writeIORef (_merge_heightRef m) $! height
20431853 subscriberRecalculateHeight (_merge_sub m) height
20441854 GT -> error $ "revalidateMergeHeight: more heights (" <> show (heightBagSize heights) <> ") than parents (" <> show (DMap.size parents) <> ") for Merge"
@@ -2046,44 +1856,38 @@ revalidateMergeHeight m = do
20461856scheduleMergeSelf :: HasSpiderTimeline x => Merge x k v s -> Height -> EventM x ()
20471857scheduleMergeSelf m height = scheduleMerge' height (_merge_heightRef m) $ do
20481858 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
1859+ liftIO $ writeIORef (_merge_accumRef m) $! DMap.empty -- Once we're done with this, we can clear it immediately, because if there's a cacheEvent in front of us, it'll handle subsequent subscribers, and if not, we won't get subsequent subscribers
20521860 --TODO: Assert that m is not empty
20531861 subscriberPropagate (_merge_sub m) vals
20541862
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) $
1863+checkCycle :: HasSpiderTimeline x => Height -> EventM x ()
1864+checkCycle height = do
1865+ currentHeight <- getCurrentHeight
1866+ when (height <= currentHeight) $ if height /= invalidHeight
1867+ then do
1868+ myStack <- liftIO $ whoCreatedIORef undefined --TODO
1869+ error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
1870+ else liftIO $ do
20661871#ifdef DEBUG_CYCLES
2067− do
2068− nodesInvolvedInCycle <- walkInvalidHeightParents subscribed
2069− stacks <- forM nodesInvolvedInCycle whoCreatedEventSubscribed
2070− throwIO (EventLoopException stacks)
1872+ nodesInvolvedInCycle <- walkInvalidHeightParents $ eventSubscribedMerge subscribed
1873+ stacks <- forM nodesInvolvedInCycle $ \(Some es) -> whoCreatedEventSubscribed es
1874+ let cycleInfo = ":\n" <> drawForest (listsToForest stacks)
20711875#else
2072− throwIO EventLoopException
1876+ let cycleInfo = ""
20731877#endif
1878+ error $ "Causality loop found" <> cycleInfo
20741879
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
1880+mergeSubscriber :: forall x k v s a. (HasSpiderTimeline x, GCompare k) => Merge x k v s -> EventM x (k a) -> Subscriber x (v a)
1881+mergeSubscriber m getKey = Subscriber
20781882 { subscriberPropagate = \a -> do
20791883 oldM <- liftIO $ readIORef $ _merge_accumRef m
20801884 k <- getKey
2081− let newM = DMap.insertWith (error "Same key fired multiple times for Merge") k a oldM
1885+ let newM = DMap.insertWith (error $ "Same key fired multiple times for Merge") k a oldM
20821886 tracePropagate (Proxy :: Proxy x) $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
20831887 liftIO $ writeIORef (_merge_accumRef m) $! newM
20841888 when (DMap.null oldM) $ do -- Only schedule the firing once
20851889 height <- liftIO $ readIORef $ _merge_heightRef m
2086− checkCycle subscribed
1890+ checkCycle height --TODO: assertions about height
20871891
20881892 scheduleMergeSelf m height
20891893 , subscriberInvalidateHeight = \old -> do --TODO: When removing a parent doesn't actually change the height, maybe we can avoid invalidating
@@ -2095,45 +1899,31 @@ mergeSubscriber subscribed m getKey = Subscriber
20951899 }
20961900
20971901--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)
1902+updateMerge :: (HasSpiderTimeline x, GCompare k) => Merge x k v s -> MergeUpdateFunc k v x p s -> p -> SomeMergeUpdate x
1903+updateMerge m updateFunc p = SomeMergeUpdate updateMe (invalidateMergeHeight m) (revalidateMergeHeight m)
21001904 where updateMe = do
21011905 oldParents <- liftIO $ readIORef $ _merge_parentsRef m
2102− (subscriptionsToKill, newParents) <- updateFunc (mergeSubscriber subscribed m) (_merge_heightBagRef m) oldParents p
1906+ (subscriptionsToKill, newParents) <- updateFunc (mergeSubscriber m) (_merge_heightBagRef m) oldParents p
21031907 liftIO $ writeIORef (_merge_parentsRef m) $! newParents
21041908 return subscriptionsToKill
21051909
21061910{-# INLINE mergeGCheap' #-}
21071911mergeGCheap' :: 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
1912+ => MergeInitFunc k v q x s -> MergeUpdateFunc k v x p s -> MergeDestroyFunc k s -> DynamicS x p -> Event x (DMap k v)
1913+mergeGCheap' getInitialSubscribers updateFunc destroy d = Event $ \sub -> do
21101914 initialParents <- readBehaviorUntracked $ dynamicCurrent d
21111915 accumRef <- liftIO $ newIORef $ error "merge: accumRef not yet initialized"
21121916 heightRef <- liftIO $ newIORef $ error "merge: heightRef not yet initialized"
21131917 heightBagRef <- liftIO $ newIORef $ error "merge: heightBagRef not yet initialized"
21141918 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
1919+ let m = Merge
21301920 { _merge_parentsRef = parentsRef
21311921 , _merge_heightBagRef = heightBagRef
21321922 , _merge_heightRef = heightRef
21331923 , _merge_sub = sub
21341924 , _merge_accumRef = accumRef
21351925 }
2136− (dm, heights, initialParentState) <- getInitialSubscribers initialParents $ mergeSubscriber subscribed m
1926+ (dm, heights, initialParentState) <- getInitialSubscribers initialParents $ mergeSubscriber m
21371927 let myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
21381928 myHeight = if invalidHeight `elem` heights
21391929 then invalidHeight
@@ -2142,29 +1932,31 @@ mergeGCheap' getParent getInitialSubscribers updateFunc destroy d = Event $ \sub
21421932 let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
21431933 then (if DMap.null dm then Nothing else Just dm, DMap.empty)
21441934 else (Nothing, dm)
2145− unless (DMap.null accum) $ scheduleMergeSelf m myHeight
1935+ unless (DMap.null accum) $ do
1936+ scheduleMergeSelf m myHeight
21461937 liftIO $ writeIORef accumRef $! accum
21471938 liftIO $ writeIORef heightRef $! myHeight
21481939 liftIO $ writeIORef heightBagRef $! myHeightBag
1940+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
21491941 liftIO $ writeIORef parentsRef $! initialParentState
21501942 defer $ SomeMergeInit $ do
2151− let changeSubscriber = Subscriber
1943+ let s = Subscriber
21521944 { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
2153− tracePropagate (Proxy :: Proxy x) "SubscriberMerge/Change"
2154− defer $ updateMerge subscribed m updateFunc a
1945+ tracePropagate (Proxy :: Proxy x) $ "SubscriberMerge/Change"
1946+ defer $ updateMerge m updateFunc a
21551947 , subscriberInvalidateHeight = \_ -> return ()
21561948 , subscriberRecalculateHeight = \_ -> return ()
21571949 }
2158− (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) changeSubscriber
2159− forM_ change $ \c -> defer $ updateMerge subscribed m updateFunc c
1950+ (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) s
1951+ forM_ change $ \c -> defer $ updateMerge m updateFunc c
21601952 -- We explicitly hold on to the unsubscribe function from subscribing to the update event.
21611953 -- If we don't do this, there are certain cases where mergeCheap will fail to properly retain
21621954 -- its subscription.
2163− liftIO $ writeIORef changeSubdRef (changeSubscriber, changeSubscription)
1955+ liftIO $ writeIORef changeSubdRef (s, changeSubscription)
21641956 let unsubscribeAll = destroy =<< readIORef parentsRef
2165−
2166− return (EventSubscription unsubscribeAll subscribed, occ)
2167−
1957+ return ( EventSubscription unsubscribeAll $ EventSubscribed heightRef $ toAny (parentsRef, changeSubdRef)
1958+ , occ
1959+ )
21681960
21691961mergeInt :: forall x a. (HasSpiderTimeline x) => DynamicS x (PatchIntMap (Event x a)) -> Event x (IntMap a)
21701962mergeInt = cacheEvent . mergeIntCheap
@@ -2177,22 +1969,13 @@ mergeIntCheap d = Event $ \sub -> do
21771969 heightRef <- liftIO $ newIORef zeroHeight
21781970 heightBagRef <- liftIO $ newIORef heightBagEmpty
21791971 parents <- liftIO $ FastMutableIntMap.newEmpty
2180− changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
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− }
21901972 let scheduleSelf = do
21911973 height <- liftIO $ readIORef $ heightRef
21921974 scheduleMerge' height heightRef $ do
21931975 vals <- liftIO $ FastMutableIntMap.getFrozenAndClear accum
21941976 subscriberPropagate sub vals
2195− invalidateMyHeight = invalidateMergeHeight' heightRef sub
1977+ invalidateMyHeight = do
1978+ invalidateMergeHeight' heightRef sub
21961979 recalculateMyHeight = do
21971980 currentHeight <- readIORef heightRef
21981981 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?
@@ -2202,14 +1985,14 @@ mergeIntCheap d = Event $ \sub -> do
22021985 LT -> return ()
22031986 EQ -> do
22041987 let height = succHeight $ heightBagMax heights
2205− traceInvalidateHeight $ "recalculateSubscriberHeight: height: " <> show height
1988+ traceInvalidate $ "recalculateSubscriberHeight: height: " <> show height
22061989 writeIORef heightRef $! height
22071990 subscriberRecalculateHeight sub height
22081991 GT -> error $ "revalidateMergeHeight: more heights (" <> show (heightBagSize heights) <> ") than parents (" <> show numParents <> ") for Merge"
22091992 mySubscriber k = Subscriber
22101993 { subscriberPropagate = \a -> do
2211− checkCycle subscribed
2212−
1994+ liftIO (readIORef heightRef) >>= checkCycle
1995+
22131996 wasEmpty <- liftIO $ FastMutableIntMap.isEmpty accum
22141997 liftIO $ FastMutableIntMap.insert accum k a
22151998 when wasEmpty scheduleSelf
@@ -2243,6 +2026,7 @@ mergeIntCheap d = Event $ \sub -> do
22432026 else liftIO $ Just <$> FastMutableIntMap.getFrozenAndClear accum
22442027 else do when (not isEmpty) scheduleSelf -- We have things accumulated, but we shouldn't have fired them yet
22452028 return Nothing
2029+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
22462030 defer $ SomeMergeInit $ do
22472031 let updateMe a = SomeMergeUpdate u invalidateMyHeight recalculateMyHeight
22482032 where
@@ -2256,27 +2040,25 @@ mergeIntCheap d = Event $ \sub -> do
22562040 oldParents <- liftIO $ FastMutableIntMap.applyPatch parents newSubscriptions
22572041 liftIO $ for_ oldParents $ \oldParent -> do
22582042 oldParentHeight <- getEventSubscribedHeight $ _eventSubscription_subscribed oldParent
2259−
2260− print ("updateMe", oldParentHeight)
22612043 modifyIORef' heightBagRef $ heightBagRemove oldParentHeight
22622044 return $ IntMap.elems oldParents
2263− let changeSubscriber = Subscriber
2045+ let s = Subscriber
22642046 { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
22652047 tracePropagate (Proxy :: Proxy x) $ "SubscriberMergeInt/Change"
22662048 defer $ updateMe a
22672049 , subscriberInvalidateHeight = \_ -> return ()
22682050 , subscriberRecalculateHeight = \_ -> return ()
22692051 }
2270− (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) changeSubscriber
2052+ (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) s
22712053 forM_ change $ \c -> defer $ updateMe c
22722054 -- We explicitly hold on to the unsubscribe function from subscribing to the update event.
22732055 -- If we don't do this, there are certain cases where mergeCheap will fail to properly retain
22742056 -- its subscription.
2275− liftIO $ writeIORef changeSubdRef (changeSubscriber, changeSubscription)
2057+ liftIO $ writeIORef changeSubdRef (s, changeSubscription)
22762058 let unsubscribeAll = traverse_ unsubscribe =<< FastMutableIntMap.getFrozenAndClear parents
2277−
2278−
2279− return (EventSubscription unsubscribeAll subscribed, occ)
2059+ return ( EventSubscription unsubscribeAll $ EventSubscribed heightRef $ toAny (parents, changeSubdRef)
2060+ , occ
2061+ )
22802062
22812063newtype EventSelector x k = EventSelector { select :: forall a. k a -> Event x a }
22822064newtype EventSelectorG x k v = EventSelectorG { selectG :: forall a. k a -> Event x (v a) }
@@ -2385,7 +2167,7 @@ runFrame a = SpiderHost $ do
23852167 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
23862168 {-
23872169 stackTrace <- liftIO $ fmap renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
2388− liftIO $ debugStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
2170+ liftIO $ putStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
23892171 EventRoot _ -> "EventRoot"
23902172 EventNever -> "EventNever"
23912173 _ -> "something else"
@@ -2400,7 +2182,7 @@ runFrame a = SpiderHost $ do
24002182 myHeight <- readIORef $ switchSubscribedHeight subscribed
24012183 when (parentHeight /= myHeight) $ do
24022184 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
2403− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
2185+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
24042186 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
24052187 forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
24062188 unsubscribe subscription
@@ -2441,7 +2223,7 @@ invalidateCoincidenceHeight subscribed = do
24412223 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
24422224 when (oldHeight /= invalidHeight) $ do
24432225 writeIORef (coincidenceSubscribedHeight subscribed) $! invalidHeight
2444− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
2226+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
24452227
24462228updateSwitchHeight :: Height -> SwitchSubscribed x a -> IO ()
24472229updateSwitchHeight new subscribed = do
@@ -2449,7 +2231,7 @@ updateSwitchHeight new subscribed = do
24492231 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24502232 when (new /= invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24512233 writeIORef (switchSubscribedHeight subscribed) $! new
2452− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
2234+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
24532235
24542236recalculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
24552237recalculateCoincidenceHeight subscribed = do
@@ -2458,7 +2240,7 @@ recalculateCoincidenceHeight subscribed = do
24582240 height <- calculateCoincidenceHeight subscribed
24592241 when (height /= invalidHeight) $ do
24602242 writeIORef (coincidenceSubscribedHeight subscribed) $! height
2461− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
2243+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
24622244
24632245calculateSwitchHeight :: SwitchSubscribed x a -> IO Height
24642246calculateSwitchHeight subscribed = getEventSubscribedHeight . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
@@ -2520,8 +2302,6 @@ instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Event
25202302 {-# INLINABLE headE #-}
25212303 headE = R.slowHeadE
25222304-- headE (SpiderEvent e) = SpiderEvent <$> Reflex.Spider.Internal.headE e
2523− {-# INLINABLE now #-}
2524− now = nowSpiderEventM
25252305
25262306instance Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPullM x) where
25272307 {-# INLINABLE sample #-}
@@ -2543,9 +2323,6 @@ instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Spide
25432323 {-# INLINABLE headE #-}
25442324 headE = R.slowHeadE
25452325-- headE (SpiderEvent e) = SpiderPushM $ SpiderEvent <$> Reflex.Spider.Internal.headE e
2546− {-# INLINABLE now #-}
2547− now = SpiderPushM nowSpiderEventM
2548−
25492326
25502327instance HasSpiderTimeline x => Monad (Reflex.Class.Dynamic (SpiderTimeline x)) where
25512328 {-# INLINE return #-}
@@ -2554,10 +2331,8 @@ instance HasSpiderTimeline x => Monad (Reflex.Class.Dynamic (SpiderTimeline x))
25542331 x >>= f = SpiderDynamic $ dynamicDynIdentity $ newJoinDyn $ newMapDyn (unSpiderDynamic . f) $ unSpiderDynamic x
25552332 {-# INLINE (>>) #-}
25562333 (>>) = (*>)
2557−#if !MIN_VERSION_base(4,13,0)
25582334 {-# INLINE fail #-}
25592335 fail _ = error "Dynamic does not support 'fail'"
2560−#endif
25612336
25622337{-# INLINABLE newJoinDyn #-}
25632338newJoinDyn :: HasSpiderTimeline x => DynamicS x (Identity (DynamicS x (Identity a))) -> Reflex.Spider.Internal.Dyn x (Identity a)
@@ -2609,9 +2384,6 @@ instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Spide
26092384 buildDynamic getV0 e = runFrame . runSpiderHostFrame $ Reflex.Class.buildDynamic getV0 e
26102385 {-# INLINABLE headE #-}
26112386 headE e = runFrame . runSpiderHostFrame $ Reflex.Class.headE e
2612− {-# INLINABLE now #-}
2613− now = runFrame . runSpiderHostFrame $ Reflex.Class.now
2614−
26152387
26162388instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHostFrame x) where
26172389 sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
@@ -2628,8 +2400,6 @@ instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Spide
26282400 {-# INLINABLE headE #-}
26292401 headE = R.slowHeadE
26302402-- headE (SpiderEvent e) = SpiderHostFrame $ SpiderEvent <$> Reflex.Spider.Internal.headE e
2631− {-# INLINABLE now #-}
2632− now = SpiderHostFrame Reflex.Class.now
26332403
26342404instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHost x) where
26352405 {-# INLINABLE sample #-}
@@ -2650,8 +2420,6 @@ instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Refle
26502420 buildDynamic getV0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.buildDynamic getV0 e
26512421 {-# INLINABLE headE #-}
26522422 headE e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.headE e
2653− {-# INLINABLE now #-}
2654− now = Reflex.Spider.Internal.ReadPhase Reflex.Class.now
26552423
26562424--------------------------------------------------------------------------------
26572425-- Deprecated items
@@ -2775,7 +2543,7 @@ instance HasSpiderTimeline x => R.Reflex (SpiderTimeline x) where
27752543 fanG e = R.EventSelectorG $ SpiderEvent . selectG (fanG (unSpiderEvent e))
27762544 {-# INLINABLE mergeG #-}
27772545 mergeG
2778− :: forall k2 (k :: k2 -> *) q (v :: k2 -> *). GCompare k
2546+ :: forall (k :: k2 -> *) q (v :: k2 -> *). GCompare k
27792547 => (forall a. q a -> R.Event (SpiderTimeline x) (v a))
27802548 -> DMap k q
27812549 -> R.Event (SpiderTimeline x) (DMap k v)
@@ -2843,14 +2611,8 @@ instance Monad (SpiderHost x) where
28432611 SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
28442612 {-# INLINABLE return #-}
28452613 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
28522614 {-# INLINABLE fail #-}
2853− fail s = SpiderHost $ MonadFail.fail s
2615+ fail s = SpiderHost $ fail s
28542616
28552617-- | Run an action affecting the global Spider timeline; this will be guarded by
28562618-- a mutex for that timeline
@@ -2872,10 +2634,8 @@ instance Monad (SpiderHostFrame x) where
28722634 SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
28732635 {-# INLINABLE return #-}
28742636 return x = SpiderHostFrame $ return x
2875−#if !MIN_VERSION_base(4,13,0)
28762637 {-# INLINABLE fail #-}
28772638 fail s = SpiderHostFrame $ fail s
2878−#endif
28792639
28802640instance NotReady (SpiderTimeline x) (SpiderHostFrame x) where
28812641 notReadyUntil _ = pure ()
@@ -2920,11 +2680,3 @@ instance MonadAtomicRef (SpiderHostFrame x) where
29202680instance PrimMonad (SpiderHostFrame x) where
29212681 type PrimState (SpiderHostFrame x) = PrimState IO
29222682 primitive = SpiderHostFrame . EventM . primitive
2923−
2924−instance NotReady (SpiderTimeline x) (SpiderHost x) where
2925− notReadyUntil _ = return ()
2926− notReady = return ()
2927−
2928−instance HasSpiderTimeline x => NotReady (SpiderTimeline x) (PerformEventT (SpiderTimeline x) (SpiderHost x)) where
2929− notReadyUntil _ = return ()
2930− notReady = return ()