on f0b5e75 help sign in
88 files changed+3681−6313
since splitsnapshots
unifiedsplit
.github/workflows/haskell.yml−41 .stylish-haskell.yaml+3−2 .travis.yml+15 CONTRIBUTING.md−66 ChangeLog.md−151 Quickref.md+11−143 README.md+11−15 bench-cbits/checkCapability.c+12−11 bench/Main.hs+6−7 bench/RunAll.hs+1−1 cabal.haskell-ci−23 cabal.project−1 default.nix+34 dep/reflex-platform/default.nix−7 dep/reflex-platform/github.json−7 reflex.cabal+88−276 release.nix−58 src/Control/Monad/ReaderIO.hs−60 src/Data/AppendMap.hs+382−58 src/Data/FastMutableIntMap.hs+29−26 src/Data/FastWeakBag.hs+12−16 src/Data/Functor/Misc.hs+345 src/Data/Map/Misc.hs−71 src/Data/WeakBag.hs+12−14 src/Reflex.hs+2−10 src/Reflex/Adjustable/Class.hs−140 src/Reflex/BehaviorWriter/Base.hs−211 src/Reflex/BehaviorWriter/Class.hs−31 src/Reflex/Class.hs+343−780 src/Reflex/Collection.hs−225 src/Reflex/Dynamic.hs+234−92 src/Reflex/Dynamic/TH.hs+28−4 src/Reflex/DynamicWriter.hs+189−4 src/Reflex/DynamicWriter/Base.hs−246 src/Reflex/DynamicWriter/Class.hs−28 src/Reflex/EventWriter.hs+266−4 src/Reflex/EventWriter/Base.hs−317 src/Reflex/EventWriter/Class.hs−26 src/Reflex/FastWeak.hs+6−73 src/Reflex/FunctorMaybe.hs+16−34 src/Reflex/Host/Class.hs+26−6 src/Reflex/Host/Headless.hs−128 src/Reflex/Network.hs−45 src/Reflex/NotReady/Class.hs−77 src/Reflex/Optimizer.hs+4−13 src/Reflex/Patch.hs+33 src/Reflex/Patch/Class.hs+20 src/Reflex/Patch/DMap.hs+61 src/Reflex/Patch/DMapWithMove.hs+281 src/Reflex/Patch/Map.hs+52 src/Reflex/Patch/MapWithMove.hs+159 src/Reflex/PerformEvent/Base.hs+4−9 src/Reflex/PerformEvent/Class.hs+2−6 src/Reflex/PostBuild/Base.hs+3−15 src/Reflex/PostBuild/Class.hs+2 src/Reflex/Profiled.hs+23−99 src/Reflex/Pure.hs+27−38 src/Reflex/Query/Base.hs+51−122 src/Reflex/Query/Class.hs+11−92 src/Reflex/Requester/Base.hs+27−215 src/Reflex/Requester/Class.hs+1 src/Reflex/Spider.hs+7−5 src/Reflex/Spider/Internal.hs+506−977 src/Reflex/Spider/SpiderTimeline.include.hs+155 src/Reflex/Spider/SpiderTimelineHost.include.hs+57 src/Reflex/Time.hs−384 src/Reflex/TriggerEvent/Base.hs+1−16 src/Reflex/TriggerEvent/Class.hs+1−6 src/Reflex/Widget/Basic.hs+2−4 src/Reflex/Workflow.hs−50 stylize−4 test/Adjustable.hs−62 test/DebugCycles.hs−171 test/EventWriterT.hs+6−96 test/GC.hs+8−14 test/Headless.hs−10 test/QueryT.hs+21−24 test/Reflex/Bench/Focused.hs+1−13 test/Reflex/Plan/Pure.hs+4−5 test/Reflex/Plan/Reflex.hs+2−2 test/Reflex/Test/CrossImpl.hs+28−37 test/Reflex/Test/Micro.hs+17−84 test/Reflex/TestPlan.hs+2−2 test/RequesterT.hs+16−186 test/Test/Run.hs−8 test/hlint.hs+10−6 test/rootCleanup.hs+3−3 test/semantics.hs+2
.github/workflows/haskell.ymldeleted−41
@@ -1,41 +0,0 @@
1−name: github-action
2−
3−on: [push, pull_request]
4−
5−jobs:
6− build:
7− strategy:
8− matrix:
9− ghc: ['8.4.4', '8.6.5', '8.8.4', '8.10.2']
10− os: ['ubuntu-latest', 'macos-latest']
11− runs-on: ${{ matrix.os }}
12−
13− name: GHC ${{ matrix.ghc }} on ${{ matrix.os }}
14− steps:
15− - uses: actions/checkout@v2
16− - uses: actions/setup-haskell@v1
17− with:
18− ghc-version: ${{ matrix.ghc }}
19− - name: Cache
20− uses: actions/cache@v1
21− env:
22− cache-name: cache-cabal
23− with:
24− path: ~/.cabal
25− key: ${{ runner.os }}-${{ matrix.ghc }}-build-${{ env.cache-name }}-${{ hashFiles('**/*.cabal') }}-${{ hashFiles('**/cabal.project') }}
26− restore-keys: |
27− ${{ runner.os }}-${{ matrix.ghc }}-build-${{ env.cache-name }}-
28− ${{ runner.os }}-${{ matrix.ghc }}-build-
29− ${{ runner.os }}-${{ matrix.ghc }}-
30− ${{ runner.os }}
31−
32− - name: Install dependencies
33− run: |
34− cabal update
35− cabal build --only-dependencies --enable-tests --enable-benchmarks
36− - name: Build
37− run: cabal build --enable-tests --enable-benchmarks all
38− - name: Run tests
39− run: cabal test all
40− - name: Build Docs
41− run: cabal haddock
.stylish-haskell.yaml+3−2
@@ -149,5 +149,6 @@ columns: 110
149149# needs to be aware of these, so it can parse the file correctly.
150150#
151151# No language extensions are enabled by default.
152−language_extensions:
153− - TemplateHaskell
152+# language_extensions:
153+ # - TemplateHaskell
154+ # - QuasiQuotes
.travis.ymlnew file+15
@@ -0,0 +1,15 @@
1+# Cache Buster: 0
2+language: nix
3+cache:
4+ directories:
5+ - /nix
6+matrix:
7+ include:
8+ - env: COMPILER=ghc7103
9+ - env: COMPILER=ghc821
10+ - env: COMPILER=ghcjs
11+script:
12+ - set -e
13+ - nix-build -E "with (import <nixpkgs> {}); pkgs.haskell.packages.$COMPILER.callPackage ./default.nix { }"
14+ - nix-collect-garbage -d # This is important to do right before 'script' ends so the cache gets GCed
15+
CONTRIBUTING.mddeleted−66
@@ -1,66 +0,0 @@
1−# Contribution Guide
2−
3−Contributions and issue reports are encouraged and appreciated!
4−
5−- [Opening Issues](#opening-issues)
6−- [Submitting Changes](#submitting-changes)
7− - [Guidelines for Commit Messages](#guidelines-for-commit-messages)
8− - [Guidelines for Pull Requests](#guidelines-for-pull-requests)
9− - [Code Quality](#code-quality)
10− - [Documentation](#documentation)
11−
12−## Opening Issues
13−
14−Before opening an issue, please check whether your issue has already been reported. Assuming it has not:
15−
16−* Describe the issue you're encountering or the suggestion you're making
17−* Include any relevant steps to reproduce or code samples you can. It's always easier for us to debug if we have something that demonstrates the error.
18−* Let us know what version of reflex you were using. If you're using a github checkout, provide the git hash.
19−* Describe how you're building reflex (i.e., via reflex-platform, cabal install, stack, obelisk, etc.). If you're using reflex-platform or obelisk, provide the git hash of your checkout.
20−
21−## Submitting Changes
22−
23−### Guidelines for Commit Messages
24−
25−#### Summary Line
26−The summary line of your commit message should summarize the changes being made. Commit messages should be written in the imperative mood and should describe what happens when the commit is applied.
27−
28−One way to think about it is that your commit message should be able to complete the sentence:
29−"When applied, this commit will..."
30−
31−#### Body
32−For breaking changes, new features, refactors, or other major changes, the body of the commit message should describe the motivation behind the change in greater detail and may include references to the issue tracker. The body shouldn't repeat code/comments from the diff.
33−
34−### Guidelines for Pull Requests
35−
36−Wherever possible, pull requests should add a single feature or fix a single bug. Pull requests should not bundle several unrelated changes.
37−
38−### Code Quality
39−
40−#### Warnings
41−
42−Your pull request should add no new warnings to the project. It should also generally not disable any warnings.
43−
44−#### Build and Test
45−
46−Make sure the project builds and that the tests pass! This will generally also be checked by CI before merge, but trying it yourself first means you'll catch problems earlier and your contribution can be merged that much sooner!
47−
48−#### Dependencies
49−
50−Include version bounds whenever adding a dependency to the library stanza of the cabal file. Note that libraries added to reflex.cabal also need to be added to default.nix.
51−
52−### Documentation
53−
54−#### In the code
55−We're always striving to improve documentation. Please include [haddock](https://haskell-haddock.readthedocs.io/en/latest/index.html) documentation for any added code, and update the documentation for any code you modify.
56−
57−#### In the [Changelog](ChangeLog.md)
58−Add an entry to the changelog when your PR:
59−* Adds a feature
60−* Deprecates something
61−* Includes a breaking change
62−* Makes any other change that will impact users
63−
64−#### In the [Readme](README.md)
65−The readme is the first place a lot of people look for information about the repository. Update any parts of the readme that are affected by your PR.
66−
ChangeLog.mddeleted−151
@@ -1,151 +0,0 @@
1−# Revision history for reflex
2−
3−## 0.8.2.0
4−
5−* Add `matchResponseMapWithRequests`, which it similar to `matchResponsesWithRequests` but allows processing of multiple responses at once.
6−
7−## 0.8.1.1
8−
9−* Allow newer hlint for older GHCs, and add upper bound for newer GHCs
10−
11−## 0.8.1.0
12−
13−* Add support for GHC 8.10
14−* Drop support for GHC < 8.4
15−
16−## 0.8.0.0
17−
18−* Replace 0.7.2.0 with 0.8.0.0 to reflect the `MonadHold` interface change. Deprecates 0.7.2.0.
19−
20−## 0.7.2.0 -- *Deprecated*
21−
22−* ([#416](https://github.com/reflex-frp/reflex/pull/416)) Add `now :: m (Event t ())` to `MonadHold`.
23−* Extend some dependency version bounds
24−* Fix HLint 3 test
25−
26−## 0.7.1.1
27−
28−*Backport release*.
29−Changes do not carry forward to 0.7.2.0.
30−
31−* Add support for GHC 8.10
32−* Drop support for GHC < 8.4
33−* Extend some dependency version bounds
34−* Fix HLint 3 test
35−
36−## 0.7.1.0
37−
38−* ([#413](https://github.com/reflex-frp/reflex/pull/413), [#417](https://github.com/reflex-frp/reflex/pull/417)) Add `Reflex.Host.Headless` module which provides `runHeadlessApp` as an easy way to run a Reflex network in a "headless" environment.
39−* ([#420](https://github.com/reflex-frp/reflex/pull/420)) Add a [`Data.Zip.Unzip`](https://hackage.haskell.org/package/semialign-1.1/docs/Data-Zip.html#t:Unzip) instance for `Event`.
40−* ([#419](https://github.com/reflex-frp/reflex/pull/419)) Add `distributeIntMapOverDynPure` and `joinDynThroughIntMap` as convenience functions for working with `Dynamic` `IntMap`s.
41−
42−
43−## 0.7.0.0
44−
45−* Add lifting instances for most classes to `Reflex.Profiled.Profiled`. ([#398](https://github.com/reflex-frp/reflex/pull/398))
46−* Class `MonadQuery t q m` now has a `Monad m` superclass constraint. ([#400](https://github.com/reflex-frp/reflex/pull/400))
47−* **(Breaking change)** Rename class `MonadBehaviorWriter` -> `BehaviorWriter` for consistency with `EventWriter`/`DynamicWriter`. ([#401](https://github.com/reflex-frp/reflex/pull/401))
48−* Introduce deprecated alias `MonadBehaviorWriter = BehaviorWriter`. ([#401](https://github.com/reflex-frp/reflex/pull/401))
49−* Fix bug in spider where event subscriptions would be prematurely finalized due to over-aggressive inlining. ([#409](https://github.com/reflex-frp/reflex/pull/409))
50−* Add instances of `PerformEvent` and `TriggerEvent` for `MaybeT`. ([#395](https://github.com/reflex-frp/reflex/pull/395))
51−
52−## 0.6.4.1
53−
54−* Fix a bug in the Reflex Profiled transformer where
55− `Reflex.Class.mergeIncrementalG` and
56− `Reflex.Class.mergeIncrementalWithMoveG` implementations referenced
57− itself instead of the inner transformed timeline, causing an
58− infinite loop.
59−
60−## 0.6.4
61−
62−* Support GHC 8.8
63−
64−* Add `Reflex.Query.Base.mapQueryT`. See that module for documentation
65−
66−* The `Reflex.Patch.*` modules were moved to the `patch` library.
67− They are `Data.Patch.*` there, but reexported under their old names for backwards compatability here.
68−
69−* Additional instances for `Query` classes for basic types.
70−
71−* Add cabal flags `debug-propagation` and `debug-event-cycles` to build in debugging
72− code for performance and for cyclic dependencies between events
73−
74−## 0.6.3
75−
76−* `Data.WeakBag.traverse` and `Data.FastWeakBag.traverse` have been deprecated.
77− They are replaced with `Data.WeakBag.traverse_` and `Data.FastWeakBag.traverse_`, respectively.
78−
79−* Fixes a bug in `Reflex.Patch.MapWithMove.patchThatSortsMapWith` that was producing invalid `PatchMapWithMove`.
80−
81−* Add missing `NotReady` instances:
82− - `instance NotReady (SpiderTimeline x) (SpiderHost x)`
83− - `instance HasSpiderTimeline x => NotReady (SpiderTimeline x) (PerformEventT (SpiderTimeline x) (SpiderHost x))`
84−
85−## 0.6.2.4
86−
87−* Update to monoidal-containers 0.6
88−
89−## 0.6.2.3
90−
91−* Add an upper-bound to witherable
92−
93−## 0.6.2.2
94−
95−* Support these >= 1. Add `split-these` flag to control whether to use new these/semialign combination or not.
96−
97−* Update version bounds to fix some CI failures
98−
99−* Add travis CI configuration
100−
101−## 0.6.2.1
102−
103−* Generalize `fan` to `fanG` to take a `DMap` with non-`Identity`
104− functor:
105− * `fan` to `fanG`
106− * `EventSelectorG` for `fanG` result selector.
107−
108−* Reduce the amount of unsafeCoerce in coercing newtypes under Event/Dynamic/Behavior.
109− * Add fused ReaderIO for the purpose of coercion (ReaderT's third argument has nominal role preventing automated coerce)
110− * Add incrementalCoercion/coerceIncremental to go with dynamicCoercion/coerceDynamic
111−
112−* Generalize merging functions:
113− `merge` to `mergeG`,
114− `mergeIncremental` to `mergeIncrementalG`,
115− `mergeIncrementalWithMove` to `mergeIncrementalWithMoveG`.
116−
117−* Generalize distribute function:
118− `distributeDMapOverDynPure` to `distributeDMapOverDynPureG`,
119−
120−## 0.6.2.0
121−
122−* Fix `holdDyn` so that it is lazy in its event argument
123− These produce `DMap`s whose values needn't be `Identity`.
124−
125−* Stop using the now-deprecated `*Tag` classes (e.g., `ShowTag`).
126−
127−* Fix `holdDyn` so that it is lazy in its event argument.
128−
129−## 0.6.1.0
130−
131−* Re-export all of `Data.Map.Monoidal`
132−
133−* Fix `QueryT` and `RequesterT` tests
134−
135−## 0.6.0.0 -- 2019-03-20
136−
137−* Deprecate `FunctorMaybe` in favor of `Data.Witherable.Filterable`. We still export `fmapMaybe`, `ffilter`, etc., but they all rely on `Filterable` now.
138−
139−* Rename `MonadDynamicWriter` to `DynamicWriter` and add a deprecation for the old name.
140−
141−* Remove many deprecated functions.
142−
143−* Add a `Num` instance for `Dynamic`.
144−
145−* Add `matchRequestsWithResponses` to make it easier to use `Requester` with protocols that don't do this matching for you.
146−
147−* Add `withRequesterT` to map functions over the request and response of a `RequesterT`.
148−
149−* Suppress nil patches in `QueryT` as an optimization. The `Query` type must now have an `Eq` instance.
150−
151−* Add `throttleBatchWithLag` to `Reflex.Time`. See that module for details.
Quickref.md+11−143
@@ -13,6 +13,7 @@ Some of these functions are *pure*: They operate on Events, Behaviors, or Dynam
1313[S] -- Function runs in any monad supporting MonadSample
1414[H] -- Function runs in any monad supporting MonadHold
1515```
16+
1617Since MonadHold depends on MonadSample, any [S] function also runs in [H] context.
1718
1819## Functions producing Event
@@ -30,7 +31,6 @@ Since MonadHold depends on MonadSample, any [S] function also runs in [H] contex
3031[ ] ffilter :: (a -> Bool) -> Event a -> Event a
3132[ ] ffor :: Event a -> (a -> b) -> Event b
3233[ ] fforMaybe :: Event a -> (a -> Maybe b) -> Event b
33−[ ] <$ :: a -> Event b -> Event a
3434
3535-- Event to identical Event with debug trace. (Only prints if Event is ultimately used.)
3636[ ] traceEvent :: Show a => String -> Event a -> Event a
@@ -46,27 +46,24 @@ Since MonadHold depends on MonadSample, any [S] function also runs in [H] contex
4646[ ] attachPromptlyDynWith :: (a -> b -> c) -> Dynamic a -> Event b -> Event c
4747[ ] attachWithMaybe :: (a -> b -> Maybe c) -> Behavior a -> Event b -> Event c
4848[ ] attachPromptlyDynWithMaybe :: (a -> b -> Maybe c) -> Dynamic a -> Event b -> Event c
49−[ ] <@> :: Behavior (a -> b) -> Event a -> Event b
50−[ ] <@ :: Behavior a -> Event b -> Event a
5149
5250-- Combine multiple Events
5351[ ] <> :: Semigroup a => Event a -> Event a -> Event a
5452[ ] difference :: Event a -> Event b -> Event a
5553[ ] align :: Event a -> Event b -> Event (These a b)
5654[ ] alignWith :: (These a b -> c) -> Event a -> Event b -> Event c
57− -- Note align functions from Data.Align in semialign package
5855[ ] mergeWith :: (a -> a -> a) -> [Event a] -> Event a
5956[ ] leftmost :: [Event a] -> Event a
6057[ ] mergeList :: [Event a] -> Event (NonEmpty a)
61−[ ] merge :: GCompare k => DMap k Event -> Event (DMap k Identity)
58+[ ] merge :: GCompare k => DMap (WrapArg Event k) -> Event (DMap k)
6259[ ] mergeMap :: Ord k => Map k (Event a) -> Event (Map k a)
6360
6461-- Efficient one-to-many fanout
65−[ ] fanMap :: Ord k => Event (Map k a) -> EventSelector (Const2 k a)
66−[ ] fan :: GCompare k => Event (DMap k Identity) -> EventSelector k
67−[ ] select :: EventSelector k -> k a -> Event a
68−[ ] fanEither :: Event (Either a b) -> (Event a, Event b)
69−[ ] fanThese :: Event (These a b) -> (Event a, Event b)
62+[ ] fanMap :: Ord k => Event (Map k a) -> EventSelector (Const2 k a)
63+[ ] fan :: GCompare k => Event (DMap k) -> EventSelector k
64+[ ] select :: EventSelector k -> k a -> Event a
65+[ ] fanEither :: Event (Either a b) -> (Event a, Event b)
66+[ ] fanThese :: Event (These a b) -> (Event a, Event b)
7067
7168-- Event to Event via function that can sample current values
7269[ ] push :: (a -> m (Maybe b)) -> Event a -> Event b
@@ -99,10 +96,6 @@ Since MonadHold depends on MonadSample, any [S] function also runs in [H] contex
9996[ ] <> :: Monoid a => Behavior a -> Behavior a -> Behavior a
10097-- ... plus many more due to typeclass membership
10198
102−-- Combine multiple behaviors via applicative instance
103−[ ] ffor2 :: Behavior a -> Behavior b -> (a -> b -> c) -> Behavior c
104−[ ] ffor3 :: Behavior a -> Behavior b -> Behavior c -> (a -> b -> c -> d) -> Behavior d
105−
10699-- Behavior to Behavior by sampling current values
107100[S] sample :: Behavior a -> m a
108101[ ] pull :: m a -> Behavior a
@@ -140,17 +133,12 @@ Since MonadHold depends on MonadSample, any [S] function also runs in [H] contex
140133[ ] >>= :: Dynamic a -> (a -> Dynamic b) -> Dynamic b
141134[ ] zipDynWith :: (a -> b -> c) -> Dynamic a -> Dynamic b -> Dynamic c
142135
143−-- Combine multiple dynamics via applicative instance
144−[ ] ffor2 :: Dynamic a -> Dynamic b -> (a -> b -> c) -> Dynamic c
145−[ ] ffor3 :: Dynamic a -> Dynamic b -> Dynamic c -> (a -> b -> c -> d) -> Dynamic d
146−
147136-- Efficient one-to-many fanout
148137[ ] demux :: Ord k => Dynamic k -> Demux k
149138[ ] demuxed :: Eq k => Demux k -> k -> Dynamic Bool
150139
151140-- Dynamic to Dynamic, removing updates w/o value change
152−[H] holdUniqDyn :: Eq a => Dynamic a -> m (Dynamic a)
153−[H] holdUniqDynBy :: (a -> a -> Bool) -> Dynamic t a -> m (Dynamic t a)
141+[ ] uniqDyn :: Eq a => Dynamic a -> Dynamic a
154142
155143-- Dynamic to identical Dynamic with debug trace. (Only prints if Dynamic is ultimately used.)
156144[ ] traceDyn :: Show a => String -> Dynamic a -> Dynamic a
@@ -167,8 +155,8 @@ For Events, the returned Event fires whenever the latest Event supplied by the w
167155-- Flatten Behavior-of-Event to Event. Old Event is used during switchover.
168156[ ] switch :: Behavior (Event a) -> Event a
169157
170−-- Flatten Dynamic-of-Event to Event. New Event is used immediately.
171−[ ] switchDyn :: Dynamic (Event a) -> Event a
158+-- Flatten Dyanmic-of-Event to Event. New Event is used immediately.
159+[ ] switchPromptlyDyn :: Dynamic (Event a) -> Event a
172160
173161-- Flatten Event-of-Event to Event that fires when both wrapper AND new Event fire.
174162[ ] coincidence :: Event (Event a) -> Event a
@@ -191,125 +179,5 @@ For Events, the returned Event fires whenever the latest Event supplied by the w
191179
192180-- Similar to above, for Events. Created Event initially tracks the first argument.
193181-- At switchover, the output Event immediately tracks the new Event.
194−[H] switchHold :: Event a -> Event (Event a) -> m (Event a)
195−```
196−
197−## Typeclasses to introspect and modify an FRP network.
198−
199−The functions mentioned above are used to create a static FRP network.
200−There are additional typeclasses that can be used to modify the FRP network, to have it interact with IO action, or to introspect the building of the network.
201−
202−The typeclasses and their associated annotations include:
203−
204−- `PostBuild`
205− Fire an Event when an FRP network has been set up.
206− ```haskell
207− [B] -- Function runs in any monad supporting PostBuild
208− ```
209−
210−- `Adjustable`
211− Use Events to add or remove pieces of an FRP network.
212− ```haskell
213− [A] -- Function runs in any monad supporting Adjustable
214− ```
215−
216−- `TriggerEvent`
217− Create new externally-fired Events from within an FRP network.
218− ```haskell
219− [T] -- Function runs in any monad supporting TriggerEvent
220− ```
221−
222−- `PerformEvent`
223− Use Events to trigger IO actions and to collect their results.
224− ```haskell
225− [P] -- Function runs in any monad supporting PerformEvent
226− ```
227−
228−## Startup
229−
230−```haskell
231−-- One-shot Event that is triggered once the FRP network has been built
232−[B] getPostBuild :: m (Event ())
233−```
234−
235−## Collection management functions
236−
237−```haskell
238−-- Turn a Dynamic key/value map into a set of dynamically-changing widgets.
239−[H,A,B] listWithKey :: Ord k =>
240− Dynamic (Map k v) -> (k -> Dynamic v -> m a ) -> m (Dynamic (Map k a))
241−
242−-- Same as above where the widget constructor doesn't care about the key.
243−[H,A,B] list :: Ord k =>
244− Dynamic (Map k v) -> ( Dynamic v -> m a ) -> m (Dynamic (Map k a))
245−
246−-- Even simpler version where there are no keys and we just use a list.
247−[H,A,B] simpleList ::
248− Dynamic [v] -> ( Dynamic v -> m a ) -> m (Dynamic [a])
249−
250−-- Like listWithKey specialized for widgets returning (Event a).
251−[H,A,B] listViewWithKey :: Ord k =>
252− Dynamic (Map k v) -> (k -> Dynamic v -> m (Event a)) -> m (Event (Map k a))
253−
254−-- Create a dynamically-changing set of widgets, one of which is selected at any time.
255−[H,A,B] selectViewListWithKey_ :: Ord k => Dynamic k ->
256− Dynamic (Map k v) -> (k -> Dynamic v -> Dynamic Bool -> m (Event a)) -> m (Event k)
257−
258−-- Same as listWithKey, but takes initial values and an updates Event instead of a Dynamic.
259−[H,A] listWithKeyShallowDiff :: Ord k =>
260− Map k v -> Event (Map k (Maybe v)) -> (k -> v -> Event v -> m a) -> m (Dynamic (Map k a))
261−```
262−
263−## Creating new events from within an FRP network.
264−
265−```haskell
266−-- Create a new Event and a function that will cause the Event to fire, from within an FRP network
267−[T] newTriggerEvent :: m (Event a, a -> IO ())
268−```
269−
270−## Connecting to the real world (I/O)
271−
272−```haskell
273−-- Run side-effecting actions in Event when it occurs; returned Event contains
274−-- results. Side effects run in the (Performable m) monad which is associated with
275−-- the (PerformEvent t m) typeclass constraint.
276−-- This allows for working with IO when a ((MonadIO (Performable m)) constraint is available.
277−[P] performEvent :: Event (Performable m a ) -> m (Event a)
278−
279−-- Just run side-effects; no return Event
280−[P] performEvent_ :: Event (Performable m ()) -> m ()
281−
282−-- Actions run asynchronously; actions are given a callback to send return values
283−[P,T] performEventAsync :: Event ((a -> IO ()) -> Performable m ()) -> m (Event a)
284−```
285−
286−### Time
287−
288−```haskell
289−-- Create Event at given interval with given basis time.
290−[P,T] tickLossy :: NominalDiffTime -> UTCTime -> m (Event t TickInfo)
291−
292−-- Delay an Event's occurrences by a given amount in seconds.
293−[P,T] delay :: NominalDiffTime -> Event t a -> m (Event t a)
294−```
295−
296−## Networks
297−
298−```haskell
299−-- Functions from Reflex.Adjustable / Reflex.Network used to deal with Dynamics/Events carrying (m a)
300−
301−[A] runWithReplace :: m a -> Event t (m b) -> m (a, Event t b)
302−
303−-- Given a Dynamic of network-creating actions, create a network that is recreated whenever the Dynamic updates.
304−-- The returned Event of network results occurs when the Dynamic does. Note: Often, the type a is an Event,
305−-- in which case the return value is an Event-of-Events that would typically be flattened (via switchHold).
306−[P,A] networkView :: Dynamic (m a) -> m (Event a)
307−
308−-- Given an initial network and an Event of network-creating actions, create a network that is recreated whenever the
309−-- Event fires. The returned Dynamic of network results occurs when the Event does. Note: Often, the type a is an
310−-- Event, in which case the return value is a Dynamic-of-Events that would typically be flattened.
311−[H,A] networkHold :: m a -> Event (m a) -> m (Dynamic a)
312−
313−-- Render a placeholder network to be shown while another network is not yet done building
314−[P,A] untilReady :: m a -> m b -> m (a, Event b)
182+[H] switchPromptly :: Event a -> Event (Event a) -> m (Event a)
315183```
README.md+11−15
@@ -1,23 +1,19 @@
1−# [Reflex](https://reflex-frp.org/)
1+## Reflex
2+### Practical Functional Reactive Programming
23
3−[![Haskell](https://img.shields.io/badge/language-Haskell-orange.svg)](https://haskell.org) [![Hackage](https://img.shields.io/hackage/v/reflex.svg)](https://hackage.haskell.org/package/reflex) [![Hackage CI](https://matrix.hackage.haskell.org/api/v2/packages/reflex/badge)](https://matrix.hackage.haskell.org/#/package/reflex) [![BSD3 License](https://img.shields.io/badge/license-BSD3-blue.svg)](https://github.com/reflex-frp/reflex/blob/master/LICENSE)
4+Reflex is an fully-deterministic, higher-order Functional Reactive Programming (FRP) interface and an engine that efficiently implements that interface.
45
5−Interactive programs without callbacks or side-effects. Functional Reactive Programming (FRP) uses composable events and time-varying values to describe interactive systems as pure functions. Just like other pure functional code, functional reactive code is easier to get right on the first try, maintain, and reuse.
6+[Reflex-DOM](https://github.com/reflex-frp/reflex-dom) is a framework built on Reflex that facilitates the development of web pages, including highly-interactive single-page apps.
67
7−Reflex is a fully-deterministic, higher-order Functional Reactive Programming interface and an engine that efficiently implements that interface.
8+Comprehensive documentation is still a work in progress, but a tutorial for Reflex and Reflex-DOM is available at https://github.com/reflex-frp/reflex-platform and an introductory talk given at the New York Haskell Meetup is available here: [Part 1](https://www.youtube.com/watch?v=mYvkcskJbc4) / [Part 2](https://www.youtube.com/watch?v=3qfc9XFVo2c).
89
9−**Visit https://reflex-frp.org for more information, tutorials, documentation and [examples](https://examples.reflex-frp.org/).**
10+A summary of Reflex functions is available in the [quick reference](Quickref.md).
1011
11−## Resources
12+### Additional resources
13+[Get started with Reflex](https://github.com/reflex-frp/reflex-platform)
1214
13−* [Official Website](https://reflex-frp.org)
14−* [Quick Reference](Quickref.md)
15−* [Reflex-DOM](https://github.com/reflex-frp/reflex-dom): A framework built on Reflex that facilitates the development of web pages, including highly-interactive single-page apps.
16−* [Obelisk](https://github.com/obsidiansystems/obelisk#obelisk): A framework built on Reflex and Reflex-DOM for functional reactive web and mobile applications, with batteries included.
17−* [Get started with Reflex](https://github.com/reflex-frp/reflex-platform)
18−* [/r/reflexfrp](https://www.reddit.com/r/reflexfrp)
19−* [irc.freenode.net #reflex-frp](http://webchat.freenode.net?channels=%23reflex-frp&uio=d4)
15+[/r/reflexfrp](https://www.reddit.com/r/reflexfrp)
2016
21−## Hacking
17+[hackage](https://hackage.haskell.org/package/reflex)
2218
23−From the root of a [Reflex Platform](https://github.com/reflex-frp/reflex-platform) checkout, run `./scripts/hack-on haskell-overlays/reflex-packages/dep/reflex`. This will check out the reflex source code into the `haskell-overlays/reflex-packages/dep/reflex` directory. You can then point that checkout at your fork, make changes, etc. Use the `./try-reflex` or `./scripts/work-on` scripts to start a shell in which you can test your changes.
19+[irc.freenode.net #reflex-frp](http://webchat.freenode.net?channels=%23reflex-frp&uio=d4)
bench-cbits/checkCapability.c+12−11
@@ -42,7 +42,7 @@ typedef struct Task_ {
4242 // or just continue immediately. It's a workaround for the fact
4343 // that signalling a condition variable doesn't do anything if the
4444 // thread is already running, but we want it to be sticky.
45− HsBool wakeup;
45+ rtsBool wakeup;
4646#endif
4747
4848 // This points to the Capability that the Task "belongs" to. If
@@ -62,14 +62,14 @@ typedef struct Task_ {
6262 // The current top-of-stack InCall
6363 struct InCall_ *incall;
6464
65− uint32_t n_spare_incalls;
65+ nat n_spare_incalls;
6666 struct InCall_ *spare_incalls;
6767
68− HsBool worker; // == rtsTrue if this is a worker Task
69− HsBool stopped; // this task has stopped or exited Haskell
68+ rtsBool worker; // == rtsTrue if this is a worker Task
69+ rtsBool stopped; // this task has stopped or exited Haskell
7070
7171 // So that we can detect when a finalizer illegally calls back into Haskell
72− HsBool running_finalizers;
72+ rtsBool running_finalizers;
7373
7474 // Links tasks on the returning_tasks queue of a Capability, and
7575 // on spare_workers.
@@ -88,7 +88,7 @@ struct Capability_ {
8888 StgFunTable f;
8989 StgRegTable r;
9090
91− uint32_t no; // capability number.
91+ nat no; // capability number.
9292
9393 // The Task currently holding this Capability. This task has
9494 // exclusive access to the contents of this Capability (apart from
@@ -98,12 +98,12 @@ struct Capability_ {
9898
9999 // true if this Capability is running Haskell code, used for
100100 // catching unsafe call-ins.
101− HsBool in_haskell;
101+ rtsBool in_haskell;
102102
103103 // Has there been any activity on this Capability since the last GC?
104− uint32_t idle;
104+ nat idle;
105105
106− HsBool disabled;
106+ rtsBool disabled;
107107
108108 // The run queue. The Task owning this Capability has exclusive
109109 // access to its run queue, so can wake up threads without
@@ -159,7 +159,7 @@ struct Capability_ {
159159#if defined(THREADED_RTS)
160160 // Worker Tasks waiting in the wings. Singly-linked.
161161 Task *spare_workers;
162− uint32_t n_spare_workers; // count of above
162+ nat n_spare_workers; // count of above
163163
164164 // This lock protects:
165165 // running_task
@@ -192,9 +192,10 @@ struct Capability_ {
192192
193193 // Per-capability STM-related data
194194 StgTVarWatchQueue *free_tvar_watch_queues;
195+ StgInvariantCheckQueue *free_invariant_check_queues;
195196 StgTRecChunk *free_trec_chunks;
196197 StgTRecHeader *free_trec_headers;
197− uint32_t transaction_tokens;
198+ nat transaction_tokens;
198199} // typedef Capability is defined in RtsAPI.h
199200 // We never want a Capability to overlap a cache line with anything
200201 // else, so round it up to a cache line size:
bench/Main.hs+6−7
@@ -20,7 +20,6 @@ import qualified Data.Dependent.Map as DMap
2020import Data.Dependent.Sum
2121import Data.Functor.Misc
2222import Data.IORef
23−import Data.Maybe (fromJust)
2423import Reflex
2524import Reflex.Host.Class
2625
@@ -71,7 +70,7 @@ micros =
7170 , withSetupWHNF "fireEventsOnly"
7271 (newEventWithTriggerRef >>= subscribePair)
7372 (\(_, trigger) -> do
74− key <- fromJust <$> liftIO (readIORef trigger)
73+ Just key <- liftIO $ readIORef trigger
7574 fireEvents [key :=> Identity (42 :: Int)])
7675 , withSetupWHNF "fireEventsAndRead(head/merge1)"
7776 (setupMerge 1 >>= subscribePair)
@@ -85,14 +84,14 @@ micros =
8584 , withSetupWHNF "fireEventsOnly(head/merge100)"
8685 (setupMerge 100 >>= subscribePair)
8786 (\(_, t:_) -> do
88− key <- fromJust <$> liftIO (readIORef t)
87+ Just key <- liftIO $ readIORef t
8988 fireEvents [key :=> Identity (42 :: Int)])
9089 , withSetupWHNF "hold" newEventWithTriggerRef $ \(ev, _) -> hold (42 :: Int) ev
9190 , withSetupWHNF "sample" (newEventWithTriggerRef >>= hold (42 :: Int) . fst) sample
9291 ]
9392
9493setupMerge :: Int
95− -> SpiderHost Global ( Event (SpiderTimeline Global) (DMap (Const2 Int a) Identity)
94+ -> SpiderHost Global ( Event (SpiderEnv Global) (DMap (Const2 Int a) Identity)
9695 , [IORef (Maybe (EventTrigger Spider a))]
9796 )
9897setupMerge num = do
@@ -100,11 +99,11 @@ setupMerge num = do
10099 let !m = DMap.fromList [Const2 i :=> v | (i,v) <- zip [0..] evs]
101100 pure (merge m, triggers)
102101
103−subscribePair :: (Event (SpiderTimeline Global) a, b) -> SpiderHost Global (EventHandle (SpiderTimeline Global) a, b)
102+subscribePair :: (Event (SpiderEnv Global) a, b) -> SpiderHost Global (EventHandle (SpiderEnv Global) a, b)
104103subscribePair (ev, b) = (,b) <$> subscribeEvent ev
105104
106−fireAndRead :: IORef (Maybe (EventTrigger (SpiderTimeline Global) a)) -> a -> EventHandle (SpiderTimeline Global) b
105+fireAndRead :: IORef (Maybe (EventTrigger (SpiderEnv Global) a)) -> a -> EventHandle (SpiderEnv Global) b
107106 -> SpiderHost Global (Maybe b)
108107fireAndRead trigger val subd = do
109− key <- fromJust <$> liftIO (readIORef trigger)
108+ Just key <- liftIO $ readIORef trigger
110109 fireEventsAndRead [key :=> Identity val] $ readEvent subd >>= sequence
bench/RunAll.hs+1−1
@@ -136,7 +136,7 @@ benchmarks = implGroup "spider" runSpiderHost cases
136136pattern RunTestCaseFlag = "--run-test-case"
137137
138138spawnBenchmark :: String -> Benchmark
139−spawnBenchmark name = bench name . toBenchmarkable $ \n -> do
139+spawnBenchmark name = Benchmark name $ Benchmarkable $ \n -> do
140140 self <- getExecutablePath
141141 callProcess self [RunTestCaseFlag, name, show n, "+RTS", "-N1"]
142142
cabal.haskell-cideleted−23
@@ -1,23 +0,0 @@
1−distribution: xenial
2−benchmarks: False
3−unconstrained: False
4−installed: -all
5−
6−-- https://github.com/haskell/cabal/issues/6106
7−install-dependencies: False
8−
9−constraint-set no-th
10− constraints: reflex -use-template-haskell
11−
12−constraint-set old-these
13− ghc: <8.8
14− constraints: these <1
15−
16−constraint-set old-witherable
17− constraints: witherable <0.3.2
18−
19−constraint-set debug-propagation
20− constraints: reflex +debug-propagation
21−
22−constraint-set debug-cycles
23− constraints: reflex +debug-cycles
cabal.projectdeleted−1
@@ -1 +0,0 @@
1−packages: .
default.nixnew file+34
@@ -0,0 +1,34 @@
1+{ mkDerivation, ghc, base, bifunctors, containers, deepseq
2+, dependent-map, dependent-sum, exception-transformers
3+, haskell-src-exts, haskell-src-meta, hlint, lens, MemoTrie
4+, monad-control, mtl, primitive, ref-tf, semigroupoids
5+, semigroups, split, stdenv, stm, syb, template-haskell
6+, these, transformers, transformers-compat, prim-uniq
7+, data-default, filepath, directory, filemanip
8+, useTemplateHaskell ? true
9+}:
10+mkDerivation {
11+ pname = "reflex";
12+ version = "0.5.0";
13+ src = builtins.filterSource (path: type: !(builtins.elem (baseNameOf path) [ ".git" "dist" ])) ./.;
14+ libraryHaskellDepends = [
15+ base bifunctors containers dependent-map dependent-sum
16+ exception-transformers lens
17+ MemoTrie monad-control mtl primitive ref-tf semigroupoids
18+ semigroups stm syb template-haskell these transformers
19+ transformers-compat prim-uniq
20+ base bifunctors containers deepseq dependent-map dependent-sum
21+ mtl ref-tf split transformers data-default
22+ ] ++ (if !useTemplateHaskell then [] else [
23+ haskell-src-exts haskell-src-meta
24+ ]);
25+ testHaskellDepends = if ghc.isGhcjs or false then [] else [
26+ hlint filepath directory filemanip
27+ ];
28+ configureFlags = if useTemplateHaskell then [] else [
29+ "-f-use-template-haskell"
30+ ];
31+ homepage = "https://github.com/reflex-frp/reflex";
32+ description = "Higher-order Functional Reactive Programming";
33+ license = stdenv.lib.licenses.bsd3;
34+}
dep/reflex-platform/default.nixdeleted−7
@@ -1,7 +0,0 @@
1−# DO NOT HAND-EDIT THIS FILE
2−import ((import <nixpkgs> {}).fetchFromGitHub (
3− let json = builtins.fromJSON (builtins.readFile ./github.json);
4− in { inherit (json) owner repo rev sha256;
5− private = json.private or false;
6− }
7−))
dep/reflex-platform/github.jsondeleted−7
@@ -1,7 +0,0 @@
1−{
2− "owner": "reflex-frp",
3− "repo": "reflex-platform",
4− "branch": "develop",
5− "rev": "f628398d076243a0851b27e625b37f65dff9b89b",
6− "sha256": "0sl0hf1glgyb1vmf2mhw4r9ipmcqk1y19d3wsic7dix2jwywzrh9"
7−}
reflex.cabal+88−276
@@ -1,17 +1,7 @@
11Name: reflex
2−Version: 0.8.2.0
2+Version: 0.5.0
33Synopsis: Higher-order Functional Reactive Programming
4−Description:
5− Interactive programs without callbacks or side-effects.
6− Functional Reactive Programming (FRP) uses composable events and time-varying
7− values to describe interactive systems as pure functions.
8− Just like other pure functional code, functional reactive code is easier
9− to get right on the first try, maintain, and reuse.
10− .
11− Reflex is a fully-deterministic, higher-order Functional Reactive Programming
12− interface and an engine that efficiently implements that interface.
13− .
14− <https://reflex-frp.org>
4+Description: Reflex is a high-performance, deterministic, higher-order Functional Reactive Programming system
155License: BSD3
166License-file: LICENSE
177Author: Ryan Trinkle
@@ -19,17 +9,14 @@ Maintainer: ryan.trinkle@gmail.com
199Stability: Experimental
2010Category: FRP
2111Build-type: Simple
22−Cabal-version: 1.22
23−homepage: https://reflex-frp.org
12+Cabal-version: >=1.9.2
13+homepage: https://github.com/reflex-frp/reflex
2414bug-reports: https://github.com/reflex-frp/reflex/issues
25−extra-source-files:
26− README.md
27− Quickref.md
28− ChangeLog.md
2915
30−tested-with:
31− GHC ==8.4.4 || ==8.6.5 || ==8.8.1 || ==8.10.2,
32− GHCJS ==8.6
16+flag specialize-to-spidertimeline-global
17+ description: Specialize all Reflex functions to the SpiderTimeline Global implementation. This may improve performance, but will disable all other implementations.
18+ default: False
19+ manual: True
3320
3421flag use-reflex-optimizer
3522 description: Use the GHC plugin Reflex.Optimizer on some of the modules in the package. This is still experimental.
@@ -41,168 +28,132 @@ flag use-template-haskell
4128 default: True
4229 manual: True
4330
44−flag debug-trace-events
45− description: Add instrumentation that outputs the stack trace of the definition of an event whenever it is subscribed to. Warning: It is very slow!
31+flag expose-all-unfoldings
32+ description: Build the library with -fexpose-all-unfoldings which can help client code specialize better
4633 default: False
4734 manual: True
4835
49−flag fast-weak
50− description: Use the primitive implementation of FastWeak in GHCJS; note that this requires GHCJS to be built with FastWeak and FastWeakBag present in the RTS, which is not the default
36+flag debug-trace-events
37+ description: Add instrumentation that outputs the stack trace of the definition of an event whenever it is subscribed to. Warning: It is very slow!
5138 default: False
5239 manual: True
5340
54−flag debug-propagation
55− description: Enable debugging of spider internals
41+flag experimental-dependent-sum-instances
42+ description: Use experimental incoherent instances for certain forked dependent-sum typeclasses
5643 default: False
5744 manual: True
5845
59−flag debug-cycles
60− description: Enable debugging of event cycles
46+flag fast-weak
47+ description: Use the primitive implementation of FastWeak in GHCJS; note that this requires GHCJS to be built with FastWeak and FastWeakBag present in the RTS, which is not the default
6148 default: False
6249 manual: True
6350
64−flag split-these
65− description: Use split these/semialign packages
66− manual: False
67− default: True
68−
6951library
70− default-language: Haskell2010
7152 hs-source-dirs: src
7253 build-depends:
7354 MemoTrie == 0.6.*,
74− base >= 4.11 && < 4.15,
75− bifunctors >= 5.2 && < 5.6,
76− comonad >= 5.0.4 && < 5.1,
77− constraints >= 0.10 && <0.14,
78− constraints-extras >= 0.3 && < 0.4,
79− containers >= 0.6 && < 0.7,
55+ base >= 4.7 && < 4.11,
56+ bifunctors >= 5.2 && < 5.5,
57+ comonad,
58+ containers == 0.5.*,
8059 data-default >= 0.5 && < 0.8,
81− dependent-map >= 0.3 && < 0.5,
60+ dependent-map >= 0.2.4 && < 0.3,
8261 exception-transformers == 0.4.*,
8362 lens >= 4.7 && < 5,
84− mmorph >= 1.0 && < 1.2,
8563 monad-control >= 1.0.1 && < 1.1,
8664 mtl >= 2.1 && < 2.3,
87− patch >= 0.0.1 && < 0.1,
88− prim-uniq >= 0.1.0.1 && < 0.3,
89− primitive >= 0.5 && < 0.8,
90− profunctors >= 5.3 && < 5.7,
91− random == 1.1.*,
65+ prim-uniq >= 0.1.0.1 && < 0.2,
66+ primitive >= 0.5 && < 0.7,
9267 ref-tf == 0.4.*,
9368 reflection == 2.1.*,
9469 semigroupoids >= 4.0 && < 6,
95− stm >= 2.4 && < 2.6,
70+ semigroups >= 0.16 && < 0.19,
71+ stm == 2.4.*,
9672 syb >= 0.5 && < 0.8,
97− time >= 1.4 && < 1.10,
98− transformers >= 0.5.6.0 && < 0.6,
99− unbounded-delays >= 0.1.0.0 && < 0.2,
100− witherable >= 0.3 && < 0.5
101−
102− if flag(split-these)
103− build-depends: these >= 1 && <1.2,
104− semialign >=1 && <1.2,
105− monoidal-containers >= 0.6 && < 0.7
106− else
107− build-depends: these >= 0.4 && <0.9,
108− monoidal-containers == 0.4.0.0
73+ these >= 0.4 && < 0.8,
74+ transformers >= 0.2,
75+ transformers-compat >= 0.3
10976
11077 exposed-modules:
111− Control.Monad.ReaderIO
11278 Data.AppendMap,
113− Data.FastMutableIntMap,
114− Data.FastWeakBag,
115− Data.Map.Misc,
79+ Data.Functor.Misc,
11680 Data.WeakBag,
81+ Data.FastWeakBag,
82+ Data.FastMutableIntMap,
11783 Reflex,
11884 Reflex.Class,
119− Reflex.Adjustable.Class,
120− Reflex.BehaviorWriter.Base,
121− Reflex.BehaviorWriter.Class,
122− Reflex.Collection,
85+ Reflex.EventWriter,
12386 Reflex.Dynamic,
12487 Reflex.Dynamic.Uniq,
12588 Reflex.DynamicWriter,
126− Reflex.DynamicWriter.Base,
127− Reflex.DynamicWriter.Class,
128− Reflex.EventWriter,
129− Reflex.EventWriter.Base,
130− Reflex.EventWriter.Class,
13189 Reflex.FastWeak,
13290 Reflex.FunctorMaybe,
13391 Reflex.Host.Class,
134− Reflex.Host.Headless,
135− Reflex.Network,
136− Reflex.NotReady.Class,
92+ Reflex.Patch,
93+ Reflex.Patch.Class,
94+ Reflex.Patch.DMap,
95+ Reflex.Patch.DMapWithMove,
96+ Reflex.Patch.Map,
97+ Reflex.Patch.MapWithMove,
98+ Reflex.TriggerEvent.Base,
99+ Reflex.TriggerEvent.Class,
137100 Reflex.PerformEvent.Base,
138101 Reflex.PerformEvent.Class,
139102 Reflex.PostBuild.Base,
140103 Reflex.PostBuild.Class,
141104 Reflex.Profiled,
142− Reflex.Pure,
143105 Reflex.Query.Base,
144106 Reflex.Query.Class,
145107 Reflex.Requester.Base,
146108 Reflex.Requester.Class,
147109 Reflex.Spider,
148110 Reflex.Spider.Internal,
149− Reflex.Time,
150− Reflex.TriggerEvent.Base,
151− Reflex.TriggerEvent.Class,
152− Reflex.Widget.Basic,
153− Reflex.Workflow
111+ Reflex.Widget.Basic
154112
155− reexported-modules:
156− patch:Data.Functor.Misc,
157− patch:Data.Patch as Reflex.Patch,
158− patch:Data.Patch.Class as Reflex.Patch.Class,
159− patch:Data.Patch.DMap as Reflex.Patch.DMap,
160− patch:Data.Patch.DMapWithMove as Reflex.Patch.DMapWithMove,
161− patch:Data.Patch.IntMap as Reflex.Patch.IntMap,
162− patch:Data.Patch.Map as Reflex.Patch.Map,
163− patch:Data.Patch.MapWithMove as Reflex.Patch.MapWithMove
113+ ghc-options: -Wall -fwarn-tabs -funbox-strict-fields -O2 -fspecialise-aggressively -ddump-simpl -ddump-to-file -dsuppress-coercions -dsuppress-idinfo
114+ ghc-prof-options: -fprof-auto
164115
165− ghc-options: -Wall -fwarn-redundant-constraints -fwarn-tabs -funbox-strict-fields -O2 -fspecialise-aggressively
116+ if flag(specialize-to-spidertimeline-global)
117+ cpp-options: -DSPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
118+ else
119+ exposed-modules: Reflex.Pure
166120
167121 if flag(debug-trace-events)
168122 cpp-options: -DDEBUG_TRACE_EVENTS
169− build-depends:
170− bytestring >= 0.10.8 && < 0.11
123+ build-depends: bytestring
171124
172125 if flag(use-reflex-optimizer)
173126 cpp-options: -DUSE_REFLEX_OPTIMIZER
174127 build-depends: ghc
175128 exposed-modules: Reflex.Optimizer
176129
177− if flag(debug-propagation)
178− cpp-options: -DDEBUG -DDEBUG_TRACE_PROPAGATION -DDEBUG_TRACE_INVALIDATION
179−
180− if flag(debug-cycles)
181− cpp-options: -DDEBUG_CYCLES
182−
183130 if flag(use-template-haskell)
184131 cpp-options: -DUSE_TEMPLATE_HASKELL
185132 build-depends:
186− dependent-sum >= 0.6 && < 0.8,
187− haskell-src-exts >= 1.16 && < 1.24,
133+ dependent-sum >= 0.3 && < 0.5,
134+ haskell-src-exts >= 1.16 && < 1.19,
188135 haskell-src-meta >= 0.6 && < 0.9,
189− template-haskell >= 2.9 && < 2.17
136+ template-haskell >= 2.9 && < 2.13
190137 exposed-modules:
191138 Reflex.Dynamic.TH
192139 other-extensions: TemplateHaskell
193140 else
194141 build-depends:
195− dependent-sum >= 0.6 && < 0.8
142+ dependent-sum == 0.4.*
143+
144+ if flag(expose-all-unfoldings)
145+ ghc-options: -fexpose-all-unfoldings
146+
147+ if flag(experimental-dependent-sum-instances)
148+ ghc-options: -DEXPERIMENTAL_DEPENDENT_SUM_INSTANCES
196149
197150 if flag(fast-weak) && impl(ghcjs)
198− cpp-options: -DGHCJS_FAST_WEAK
151+ ghc-options: -DGHCJS_FAST_WEAK
199152
200153 if impl(ghcjs)
201− build-depends:
202− ghcjs-base == 0.2.*
154+ build-depends: ghcjs-base
203155
204156test-suite semantics
205− default-language: Haskell2010
206157 type: exitcode-stdio-1.0
207158 main-is: semantics.hs
208159 hs-source-dirs: test
@@ -211,46 +162,33 @@ test-suite semantics
211162 base,
212163 bifunctors,
213164 containers,
214− deepseq,
165+ deepseq >= 1.3 && < 1.5,
215166 dependent-map,
216167 dependent-sum,
217168 mtl,
218169 ref-tf,
219170 reflex,
220171 split,
221− transformers
222− other-modules:
223− Reflex.Bench.Focused
224− Reflex.Plan.Pure
225− Reflex.Plan.Reflex
226− Reflex.Test
227− Reflex.Test.Micro
228− Reflex.TestPlan
172+ transformers >= 0.3
173+ if flag(specialize-to-spidertimeline-global)
174+ buildable: False
229175
230176test-suite CrossImpl
231− default-language: Haskell2010
232177 type: exitcode-stdio-1.0
233178 main-is: Reflex/Test/CrossImpl.hs
234179 hs-source-dirs: test
235− ghc-options: -O2 -Wall -rtsopts
180+ ghc-options: -O2 -Wall -rtsopts -main-is Reflex.Test.CrossImpl.test
236181 build-depends:
237182 base,
238183 containers,
239184 dependent-map,
240− dependent-sum,
241− deepseq,
242185 mtl,
243− transformers,
244186 ref-tf,
245187 reflex
246− other-modules:
247− Reflex.Test
248− Reflex.TestPlan
249− Reflex.Plan.Reflex
250− Reflex.Plan.Pure
188+ if flag(specialize-to-spidertimeline-global)
189+ buildable: False
251190
252191test-suite hlint
253− default-language: Haskell2010
254192 type: exitcode-stdio-1.0
255193 main-is: hlint.hs
256194 hs-source-dirs: test
@@ -258,226 +196,104 @@ test-suite hlint
258196 , directory
259197 , filepath
260198 , filemanip
261− if impl(ghc >= 8.8)
262− build-depends: hlint >= 3 && < 4
263− else
264− build-depends: hlint (< 2.1 || >= 2.2.2) && < 4
199+ , hlint
265200 if impl(ghcjs)
266201 buildable: False
202+ buildable: False
267203
268204test-suite EventWriterT
269− default-language: Haskell2010
270205 type: exitcode-stdio-1.0
271206 main-is: EventWriterT.hs
272207 hs-source-dirs: test
273208 build-depends: base
274− , containers
275− , deepseq
276− , dependent-map
277209 , dependent-sum
278210 , lens
279− , mtl
280211 , these
281212 , transformers
282213 , reflex
283214 , ref-tf
284215
285− if flag(split-these)
286− build-depends: these-lens
287−
288− other-modules:
289− Test.Run
290−
291−
292−test-suite DebugCycles
293− default-language: Haskell2010
294− type: exitcode-stdio-1.0
295− main-is: DebugCycles.hs
296− hs-source-dirs: test
297− ghc-options: -threaded
298− build-depends: base
299− , containers
300− , deepseq
301− , dependent-map
302− , dependent-sum
303− , hspec
304− , lens
305− , mtl
306− , these
307− , transformers
308− , reflex
309− , ref-tf
310− , witherable
311− , proctest
312−
313−
314− if flag(split-these)
315− build-depends: these-lens, semialign
316−
317− other-modules:
318− Test.Run
319−
320−
321216test-suite RequesterT
322− default-language: Haskell2010
323217 type: exitcode-stdio-1.0
324218 main-is: RequesterT.hs
325219 hs-source-dirs: test
326220 build-depends: base
327− , constraints
328− , constraints-extras
329− , containers
330− , deepseq
331− , dependent-map
332221 , dependent-sum
222+ , dependent-map
333223 , lens
334− , mtl
335− , ref-tf
336− , reflex
337− , text
338224 , these
339225 , transformers
340−
341− if flag(split-these)
342− build-depends: these-lens
343−
344− other-modules:
345− Reflex.TestPlan
346− Reflex.Plan.Pure
347− Test.Run
348−
349−test-suite Headless
350− default-language: Haskell2010
351− type: exitcode-stdio-1.0
352− main-is: Headless.hs
353− hs-source-dirs: test
354− build-depends: base
355− , reflex
356−
357−test-suite Adjustable
358− default-language: Haskell2010
359− type: exitcode-stdio-1.0
360− main-is: Adjustable.hs
361− hs-source-dirs: test
362− build-depends: base
363− , containers
364− , dependent-sum
365226 , reflex
366227 , ref-tf
367− , these
368−
369− other-modules:
370− Test.Run
228+ buildable: False
371229
372230test-suite QueryT
373− default-language: Haskell2010
374231 type: exitcode-stdio-1.0
375232 main-is: QueryT.hs
376233 hs-source-dirs: test
377234 build-depends: base
378235 , containers
379− , dependent-map
380236 , dependent-sum
381− , deepseq
237+ , dependent-map
382238 , lens
383− , monoidal-containers
384− , mtl
385− , patch
386− , ref-tf
387− , reflex
388239 , these
389240 , transformers
390−
391− if flag(split-these)
392− build-depends: semialign, these-lens
393−
394− other-modules:
395− Test.Run
396− Reflex.TestPlan
397− Reflex.Plan.Reflex
398− Reflex.Plan.Pure
241+ , semigroups
242+ , reflex
243+ , ref-tf
399244
400245test-suite GC-Semantics
401− default-language: Haskell2010
402246 type: exitcode-stdio-1.0
403247 main-is: GC.hs
404248 hs-source-dirs: test
249+ if flag(specialize-to-spidertimeline-global)
250+ buildable: False
405251 build-depends: base
406− , containers
407252 , dependent-sum
408253 , dependent-map
409− , deepseq
410− , mtl
411− , patch
412254 , these
413255 , transformers
414256 , reflex
415257 , ref-tf
416−
417− if flag(split-these)
418− build-depends: semialign
419−
420− other-modules:
421− Reflex.Plan.Pure
422− Reflex.Plan.Reflex
423− Reflex.TestPlan
424− Test.Run
258+ if impl(ghc < 8)
259+ build-depends: semigroups
425260
426261test-suite rootCleanup
427− default-language: Haskell2010
428262 type: exitcode-stdio-1.0
429263 main-is: rootCleanup.hs
430264 hs-source-dirs: test
431265 build-depends: base
432− , containers
433− , deepseq
434− , dependent-sum
435− , mtl
436266 , reflex
437− , ref-tf
438− , these
439− other-modules:
440− Reflex.Plan.Pure
441− Reflex.TestPlan
442− Test.Run
443267
444268benchmark spider-bench
445− default-language: Haskell2010
446269 type: exitcode-stdio-1.0
447− hs-source-dirs: bench test
270+ hs-source-dirs: bench
448271 main-is: Main.hs
449272 ghc-options: -Wall -O2 -rtsopts
450273 build-depends:
451274 base,
452− containers,
453− criterion,
454− deepseq,
275+ criterion == 1.1.*,
276+ deepseq >= 1.3 && < 1.5,
455277 dependent-map,
456278 dependent-sum,
457− ref-tf,
458279 mtl,
459280 primitive,
460281 reflex,
461− split,
462282 stm,
463− transformers
464− other-modules:
465− Reflex.TestPlan
466− Reflex.Plan.Reflex
467− Reflex.Bench.Focused
283+ transformers >= 0.3
468284
469285benchmark saulzar-bench
470− default-language: Haskell2010
471286 type: exitcode-stdio-1.0
472287 hs-source-dirs: bench test
473288 c-sources: bench-cbits/checkCapability.c
474289 main-is: RunAll.hs
475290 ghc-options: -Wall -O2 -rtsopts -threaded
291+ ghc-prof-options: -fprof-auto
476292 build-depends:
477293 base,
478− containers,
479− criterion,
480− deepseq,
294+ containers == 0.5.*,
295+ criterion == 1.1.*,
296+ deepseq >= 1.3 && < 1.5,
481297 dependent-map,
482298 dependent-sum,
483299 loch-th,
@@ -489,11 +305,7 @@ benchmark saulzar-bench
489305 split,
490306 stm,
491307 time,
492− transformers
493− other-modules:
494− Reflex.TestPlan
495− Reflex.Plan.Reflex
496− Reflex.Bench.Focused
308+ transformers >= 0.3
497309
498310source-repository head
499311 type: git
release.nixdeleted−58
@@ -1,58 +0,0 @@
1−{ reflex-platform-fun ? import ./dep/reflex-platform
2−, supportedSystems ? ["x86_64-linux" "x86_64-darwin"]
3−}:
4−
5−let
6− native-reflex-platform = reflex-platform-fun {};
7− inherit (native-reflex-platform.nixpkgs) lib;
8−
9− perPlatform = lib.genAttrs supportedSystems (system: let
10− reflex-platform = reflex-platform-fun { inherit system; };
11− compilers = [
12− "ghc"
13− "ghcjs"
14− ] ++ lib.optionals (reflex-platform.androidSupport) [
15− "ghcAndroidAarch64"
16− "ghcAndroidAarch32"
17− ] ++ lib.optionals (reflex-platform.iosSupport) [
18− "ghcIosAarch64"
19− ];
20− variations = map (v: "reflex" + v) [
21− "-dontUseTemplateHaskell"
22− ""
23− ];
24− compilerPkgs = lib.genAttrs compilers (ghc: let
25− variationPkgs = lib.genAttrs variations (variation: let
26− reflex-platform = reflex-platform-fun {
27− inherit system;
28− __useTemplateHaskell = variation == "reflex"; # TODO hack
29− haskellOverlays = [
30− # Use this package's source for reflex
31− (self: super: {
32− _dep = super._dep // {
33− reflex = builtins.filterSource (path: type: !(builtins.elem (baseNameOf path) [
34− "release.nix"
35− ".git"
36− "dist"
37− "cabal.haskell-ci"
38− "cabal.project"
39− ".travis.yml"
40− ])) ./.;
41− };
42− })
43− ];
44− };
45− in reflex-platform.${ghc}.reflex);
46− in variationPkgs // {
47− cache = reflex-platform.pinBuildInputs "reflex-${system}-${ghc}"
48− (builtins.attrValues variationPkgs);
49− });
50− in compilerPkgs // {
51− cache = reflex-platform.pinBuildInputs "reflex-${system}"
52− (map (a: a.cache) (builtins.attrValues compilerPkgs));
53− });
54−
55− metaCache = native-reflex-platform.pinBuildInputs "reflex-everywhere"
56− (map (a: a.cache) (builtins.attrValues perPlatform));
57−
58−in perPlatform // { inherit metaCache; }
src/Control/Monad/ReaderIO.hsdeleted−60
@@ -1,60 +0,0 @@
1−{-# language RoleAnnotations #-}
2−{-# language MultiParamTypeClasses #-}
3−{-# language FlexibleInstances #-}
4−{-# language CPP #-}
5−module Control.Monad.ReaderIO
6− (
7− ReaderIO (..)
8− )
9− where
10−
11−import Control.Monad.Fix
12−#if MIN_VERSION_base(4,10,0)
13−import Control.Applicative
14−#endif
15−import Control.Monad
16−import Control.Monad.Reader.Class
17−import Control.Monad.IO.Class
18−
19−-- | An approximate clone of @RIO@ from the @rio@ package, but not based on
20−-- @ReaderT@. The trouble with @ReaderT@ is that its third type argument has a
21−-- @nominal@ role, so we can't coerce through it when it's wrapped in some
22−-- other @data@ type. Ugh.
23−newtype ReaderIO e a = ReaderIO { runReaderIO :: e -> IO a }
24−type role ReaderIO representational representational
25−
26−instance Functor (ReaderIO e) where
27− fmap = liftM
28− {-# INLINE fmap #-}
29− a <$ m = m >> pure a
30− {-# INLINE (<$) #-}
31−
32−instance Applicative (ReaderIO e) where
33− pure a = ReaderIO $ \_ -> pure a
34− {-# INLINE pure #-}
35− (<*>) = ap
36− {-# INLINE (<*>) #-}
37−#if MIN_VERSION_base(4,10,0)
38− liftA2 = liftM2
39− {-# INLINE liftA2 #-}
40−#endif
41− (*>) = (>>)
42− {-# INLINE (*>) #-}
43−
44−instance Monad (ReaderIO e) where
45− ReaderIO q >>= f = ReaderIO $ \e -> q e >>= \a -> runReaderIO (f a) e
46− {-# INLINE (>>=) #-}
47−
48−instance MonadFix (ReaderIO e) where
49− mfix f = ReaderIO $ \e -> mfix $ \r -> runReaderIO (f r) e
50− {-# INLINE mfix #-}
51−
52−instance MonadIO (ReaderIO e) where
53− liftIO m = ReaderIO $ \_ -> m
54− {-# INLINE liftIO #-}
55−
56−instance MonadReader e (ReaderIO e) where
57− ask = ReaderIO pure
58− {-# INLINE ask #-}
59− local f (ReaderIO m) = ReaderIO (m . f)
60− {-# INLINE local #-}
src/Data/AppendMap.hs+382−58
@@ -1,84 +1,408 @@
1−{-# LANGUAGE CPP #-}
1+{-# LANGUAGE DeriveFunctor #-}
2+{-# LANGUAGE DeriveGeneric #-}
3+{-# LANGUAGE DeriveTraversable #-}
24{-# LANGUAGE FlexibleContexts #-}
35{-# LANGUAGE FlexibleInstances #-}
6+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
47{-# LANGUAGE MultiParamTypeClasses #-}
5−{-# LANGUAGE PatternSynonyms #-}
68{-# LANGUAGE RoleAnnotations #-}
79{-# LANGUAGE ScopedTypeVariables #-}
810{-# LANGUAGE TypeFamilies #-}
9−{-# OPTIONS_GHC -fno-warn-orphans #-}
10−-- |
11−-- Module:
12−-- Data.AppendMap
13−-- Description:
14−-- Instances and convenience functions for 'Data.Map.Monoidal'. We use
15−-- monoidal-containers to take advantage of its better monoid instance.
16−-- 'Data.Map' has @mappend = union@, which is left-biased. 'MonoidalMap'
17−-- has @mappend = unionWith mappend@ instead.
18−module Data.AppendMap
19− ( module Data.AppendMap
20− , module Data.Map.Monoidal
21− ) where
22−
23−import Prelude hiding (null)
11+-- | 'Data.Map' with a better 'Monoid' instance
12+--
13+-- 'Data.Map' has @mappend = union@, which is left-biased. AppendMap has
14+-- @mappend = unionWith mappend@ instead.
15+module Data.AppendMap where
2416
17+import Prelude hiding (map)
18+
19+import Control.Lens
20+import Data.Align
2521import Data.Coerce
2622import Data.Default
2723import Data.Map (Map)
28−#if MIN_VERSION_containers(0,5,11)
29−import qualified Data.Map.Internal.Debug as Map (showTree, showTreeWith)
30−#else
31−import qualified Data.Map as Map (showTree, showTreeWith)
32−#endif
33−import qualified Data.Witherable as W
34−import Data.Map.Monoidal
35−import qualified Data.Map.Monoidal as MonoidalMap
36−
37−
38−{-# DEPRECATED AppendMap "Use 'MonoidalMap' instead" #-}
39−-- | AppendMap is a synonym for 'Data.Map.Monoidal.MonoidalMap'
40−type AppendMap = MonoidalMap
41−
42−{-# DEPRECATED _unAppendMap "Use 'getMonoidalMap' instead" #-}
43−-- | A synonym for 'getMonoidalMap'
44−_unAppendMap :: MonoidalMap k v -> Map k v
45−_unAppendMap = getMonoidalMap
46−
47−-- | Pattern synonym for 'MonoidalMap'
48−pattern AppendMap :: Map k v -> MonoidalMap k v
49−pattern AppendMap m = MonoidalMap m
50−
51−#if !MIN_VERSION_witherable(0,3,2)
52−instance W.Filterable (MonoidalMap k) where
53− mapMaybe = MonoidalMap.mapMaybe
54−#endif
24+import qualified Data.Map as Map
25+import Data.Semigroup
26+import Data.Set (Set)
27+import Data.Typeable
28+import GHC.Generics (Generic)
29+import Reflex.Class (FunctorMaybe (..))
30+import Reflex.Patch (Additive, Group (..))
31+
32+newtype AppendMap k m = AppendMap { _unAppendMap :: Map k m }
33+ deriving (Eq, Ord, Show, Read, Typeable, Generic, Functor, Foldable, Traversable, Align)
34+
35+type instance (Index (AppendMap k m)) = k
36+type instance (IxValue (AppendMap k m)) = m
37+
38+instance Ord k => Ixed (AppendMap k m) where
39+ ix i = _Wrapped . ix i
40+
41+instance Ord k => At (AppendMap k m) where
42+ at i = _Wrapped . at i
43+
44+instance FunctorMaybe (AppendMap k) where
45+ fmapMaybe = mapMaybe
5546
5647-- | Deletes a key, returning 'Nothing' if the result is empty.
57−nonEmptyDelete :: Ord k => k -> MonoidalMap k a -> Maybe (MonoidalMap k a)
48+nonEmptyDelete :: Ord k => k -> AppendMap k a -> Maybe (AppendMap k a)
5849nonEmptyDelete k vs =
5950 let deleted = delete k vs
60− in if null deleted
51+ in if Data.AppendMap.null deleted
6152 then Nothing
6253 else Just deleted
6354
64−-- | Like 'mapMaybe' but indicates whether the resulting container is empty
6555mapMaybeNoNull :: (a -> Maybe b)
66− -> MonoidalMap token a
67− -> Maybe (MonoidalMap token b)
56+ -> AppendMap token a
57+ -> Maybe (AppendMap token b)
6858mapMaybeNoNull f as =
69− let bs = mapMaybe f as
70− in if null bs
59+ let bs = fmapMaybe f as
60+ in if Data.AppendMap.null bs
7161 then Nothing
7262 else Just bs
7363
74−-- TODO: Move instances to `Data.Patch`
75−-- | Displays a 'MonoidalMap' as a tree. See 'Data.Map.Lazy.showTree' for details.
76−showTree :: forall k a. (Show k, Show a) => MonoidalMap k a -> String
77−showTree = coerce (Map.showTree :: Map k a -> String)
64+instance FunctorWithIndex k (AppendMap k) where
65+ imap f = AppendMap . imap f . _unAppendMap
66+ imapped = _Wrapped . imapped
67+
68+instance FoldableWithIndex k (AppendMap k) where
69+ ifolded = _Wrapped . ifolded
70+
71+instance TraversableWithIndex k (AppendMap k) where
72+ itraverse = itraverseOf itraversed
73+ itraversed = _Wrapped . itraversed
74+
75+instance (Ord k, Semigroup m) => Semigroup (AppendMap k m) where
76+ (AppendMap m0) <> (AppendMap m1) = AppendMap $ Map.unionWith (<>) m0 m1
77+
78+instance (Ord k, Semigroup m) => Monoid (AppendMap k m) where
79+ mempty = empty
80+ mappend = (<>)
81+
82+instance (Ord k, Group q) => Group (AppendMap k q) where
83+ negateG = map negateG
84+
85+instance (Ord k, Additive q) => Additive (AppendMap k q)
86+
87+(!) :: forall k a. Ord k => AppendMap k a -> k -> a
88+(!) = coerce ((Map.!) :: Map k a -> k -> a)
89+infixl 9 !
90+
91+(\\) :: forall k a b. Ord k => AppendMap k a -> AppendMap k b -> AppendMap k a
92+(\\) = coerce ((Map.\\) :: Map k a -> Map k b -> Map k a)
93+infixl 9 \\
94+
95+null :: forall k a. AppendMap k a -> Bool
96+null = coerce (Map.null :: Map k a -> Bool)
97+
98+size :: forall k a. AppendMap k a -> Int
99+size = coerce (Map.size :: Map k a -> Int)
100+
101+member :: forall k a. Ord k => k -> AppendMap k a -> Bool
102+member = coerce (Map.member :: k -> Map k a -> Bool)
103+
104+notMember :: forall k a. Ord k => k -> AppendMap k a -> Bool
105+notMember = coerce (Map.notMember :: k -> Map k a -> Bool)
106+
107+lookup :: forall k a. Ord k => k -> AppendMap k a -> Maybe a
108+lookup = coerce (Map.lookup :: k -> Map k a -> Maybe a)
109+
110+findWithDefault :: forall k a. Ord k => a -> k -> AppendMap k a -> a
111+findWithDefault = coerce (Map.findWithDefault :: a -> k -> Map k a -> a)
112+
113+lookupLT :: forall k a. Ord k => k -> AppendMap k a -> Maybe (k, a)
114+lookupLT = coerce (Map.lookupLT :: k -> Map k a -> Maybe (k,a))
115+
116+lookupGT :: forall k a. Ord k => k -> AppendMap k a -> Maybe (k, a)
117+lookupGT = coerce (Map.lookupGT :: k -> Map k a -> Maybe (k,a))
118+
119+lookupLE :: forall k a. Ord k => k -> AppendMap k a -> Maybe (k, a)
120+lookupLE = coerce (Map.lookupLE :: k -> Map k a -> Maybe (k,a))
121+
122+lookupGE :: forall k a. Ord k => k -> AppendMap k a -> Maybe (k, a)
123+lookupGE = coerce (Map.lookupGE :: k -> Map k a -> Maybe (k,a))
124+
125+empty :: forall k a. AppendMap k a
126+empty = coerce (Map.empty :: Map k a)
127+
128+singleton :: forall k a. k -> a -> AppendMap k a
129+singleton = coerce (Map.singleton :: k -> a -> Map k a)
130+
131+insert :: forall k a. Ord k => k -> a -> AppendMap k a -> AppendMap k a
132+insert = coerce (Map.insert :: k -> a -> Map k a -> Map k a)
133+
134+insertWith :: forall k a. Ord k => (a -> a -> a) -> k -> a -> AppendMap k a -> AppendMap k a
135+insertWith = coerce (Map.insertWith :: (a -> a -> a) -> k -> a -> Map k a -> Map k a)
136+
137+insertWithKey :: forall k a. Ord k => (k -> a -> a -> a) -> k -> a -> AppendMap k a -> AppendMap k a
138+insertWithKey = coerce (Map.insertWithKey :: (k -> a -> a -> a) -> k -> a -> Map k a -> Map k a)
139+
140+insertLookupWithKey :: forall k a. Ord k => (k -> a -> a -> a) -> k -> a -> AppendMap k a -> (Maybe a, AppendMap k a)
141+insertLookupWithKey = coerce (Map.insertLookupWithKey :: (k -> a -> a -> a) -> k -> a -> Map k a -> (Maybe a, Map k a))
142+
143+delete :: forall k a. Ord k => k -> AppendMap k a -> AppendMap k a
144+delete = coerce (Map.delete :: k -> Map k a -> Map k a)
145+
146+adjust :: forall k a. Ord k => (a -> a) -> k -> AppendMap k a -> AppendMap k a
147+adjust = coerce (Map.adjust :: (a -> a) -> k -> Map k a -> Map k a)
148+
149+adjustWithKey :: forall k a. Ord k => (k -> a -> a) -> k -> AppendMap k a -> AppendMap k a
150+adjustWithKey = coerce (Map.adjustWithKey :: (k -> a -> a) -> k -> Map k a -> Map k a)
151+
152+update :: forall k a. Ord k => (a -> Maybe a) -> k -> AppendMap k a -> AppendMap k a
153+update = coerce (Map.update :: (a -> Maybe a) -> k -> Map k a -> Map k a)
154+
155+updateWithKey :: forall k a. Ord k => (k -> a -> Maybe a) -> k -> AppendMap k a -> AppendMap k a
156+updateWithKey = coerce (Map.updateWithKey :: (k -> a -> Maybe a) -> k -> Map k a -> Map k a)
157+
158+updateLookupWithKey :: forall k a. Ord k => (k -> a -> Maybe a) -> k -> AppendMap k a -> (Maybe a, AppendMap k a)
159+updateLookupWithKey = coerce (Map.updateLookupWithKey :: (k -> a -> Maybe a) -> k -> Map k a -> (Maybe a, Map k a))
160+
161+alter :: forall k a. Ord k => (Maybe a -> Maybe a) -> k -> AppendMap k a -> AppendMap k a
162+alter = coerce (Map.alter :: (Maybe a -> Maybe a) -> k -> Map k a -> Map k a)
163+
164+unionWith :: forall k a. Ord k => (a -> a -> a) -> AppendMap k a -> AppendMap k a -> AppendMap k a
165+unionWith = coerce (Map.unionWith :: (a -> a -> a) -> Map k a -> Map k a -> Map k a)
166+
167+unionWithKey :: forall k a. Ord k => (k -> a -> a -> a) -> AppendMap k a -> AppendMap k a -> AppendMap k a
168+unionWithKey = coerce (Map.unionWithKey :: (k -> a -> a -> a) -> Map k a -> Map k a -> Map k a)
169+
170+unionsWith :: forall k a. Ord k => (a -> a -> a) -> [AppendMap k a] -> AppendMap k a
171+unionsWith = coerce (Map.unionsWith :: (a -> a -> a) -> [Map k a] -> Map k a)
172+
173+difference :: forall k a b. Ord k => AppendMap k a -> AppendMap k b -> AppendMap k a
174+difference = (\\)
175+
176+differenceWith :: forall k a b. Ord k => (a -> b -> Maybe a) -> AppendMap k a -> AppendMap k b -> AppendMap k a
177+differenceWith = coerce (Map.differenceWith :: (a -> b -> Maybe a) -> Map k a -> Map k b -> Map k a)
178+
179+differenceWithKey :: forall k a b. Ord k => (k -> a -> b -> Maybe a) -> AppendMap k a -> AppendMap k b -> AppendMap k a
180+differenceWithKey = coerce (Map.differenceWithKey :: (k -> a -> b -> Maybe a) -> Map k a -> Map k b -> Map k a)
181+
182+intersectionWith :: forall k a b c. Ord k => (a -> b -> c) -> AppendMap k a -> AppendMap k b -> AppendMap k c
183+intersectionWith = coerce (Map.intersectionWith :: (a -> b -> c) -> Map k a -> Map k b -> Map k c)
184+
185+intersectionWithKey :: forall k a b c. Ord k => (k -> a -> b -> c) -> AppendMap k a -> AppendMap k b -> AppendMap k c
186+intersectionWithKey = coerce (Map.intersectionWithKey :: (k -> a -> b -> c) -> Map k a -> Map k b -> Map k c)
187+
188+mergeWithKey :: forall k a b c. Ord k => (k -> a -> b -> Maybe c) -> (AppendMap k a -> AppendMap k c) -> (AppendMap k b -> AppendMap k c) -> AppendMap k a -> AppendMap k b -> AppendMap k c
189+mergeWithKey = coerce (Map.mergeWithKey :: (k -> a -> b -> Maybe c) -> (Map k a -> Map k c) -> (Map k b -> Map k c) -> Map k a -> Map k b -> Map k c)
190+
191+map :: (a -> b) -> AppendMap k a -> AppendMap k b
192+map = fmap
193+
194+mapWithKey :: (k -> a -> b) -> AppendMap k a -> AppendMap k b
195+mapWithKey = imap
196+
197+traverseWithKey :: Applicative t => (k -> a -> t b) -> AppendMap k a -> t (AppendMap k b)
198+traverseWithKey = itraverse
199+
200+mapAccum :: forall k a b c. (a -> b -> (a, c)) -> a -> AppendMap k b -> (a, AppendMap k c)
201+mapAccum = coerce (Map.mapAccum :: (a -> b -> (a, c)) -> a -> Map k b -> (a, Map k c))
202+
203+mapAccumWithKey :: forall k a b c. (a -> k -> b -> (a, c)) -> a -> AppendMap k b -> (a, AppendMap k c)
204+mapAccumWithKey = coerce (Map.mapAccumWithKey :: (a -> k -> b -> (a, c)) -> a -> Map k b -> (a, Map k c))
205+
206+mapAccumRWithKey :: forall k a b c. (a -> k -> b -> (a, c)) -> a -> AppendMap k b -> (a, AppendMap k c)
207+mapAccumRWithKey = coerce (Map.mapAccumRWithKey :: (a -> k -> b -> (a, c)) -> a -> Map k b -> (a, Map k c))
208+
209+mapKeys :: forall k1 k2 a. Ord k2 => (k1 -> k2) -> AppendMap k1 a -> AppendMap k2 a
210+mapKeys = coerce (Map.mapKeys :: (k1 -> k2) -> Map k1 a -> Map k2 a)
211+
212+mapKeysWith :: forall k1 k2 a. Ord k2 => (a -> a -> a) -> (k1 -> k2) -> AppendMap k1 a -> AppendMap k2 a
213+mapKeysWith = coerce (Map.mapKeysWith :: (a -> a -> a) -> (k1 -> k2) -> Map k1 a -> Map k2 a)
214+
215+mapKeysMonotonic :: forall k1 k2 a. (k1 -> k2) -> AppendMap k1 a -> AppendMap k2 a
216+mapKeysMonotonic = coerce (Map.mapKeysMonotonic :: (k1 -> k2) -> Map k1 a -> Map k2 a)
217+
218+foldr :: forall k a b. (a -> b -> b) -> b -> AppendMap k a -> b
219+foldr = coerce (Map.foldr :: (a -> b -> b) -> b -> Map k a -> b)
220+
221+foldl :: forall k a b. (a -> b -> a) -> a -> AppendMap k b -> a
222+foldl = coerce (Map.foldl :: (a -> b -> a) -> a -> Map k b -> a)
223+
224+foldrWithKey :: forall k a b. (k -> a -> b -> b) -> b -> AppendMap k a -> b
225+foldrWithKey = coerce (Map.foldrWithKey :: (k -> a -> b -> b) -> b -> Map k a -> b)
226+
227+foldlWithKey :: forall k a b. (a -> k -> b -> a) -> a -> AppendMap k b -> a
228+foldlWithKey = coerce (Map.foldlWithKey :: (a -> k -> b -> a) -> a -> Map k b -> a)
78229
79−-- | Displays a 'MonoidalMap' as a tree, using the supplied function to convert nodes to string.
80−showTreeWith :: forall k a. (k -> a -> String) -> Bool -> Bool -> MonoidalMap k a -> String
230+foldMapWithKey :: forall k a m. Monoid m => (k -> a -> m) -> AppendMap k a -> m
231+foldMapWithKey = coerce (Map.foldMapWithKey :: Monoid m => (k -> a -> m) -> Map k a -> m)
232+
233+foldr' :: forall k a b. (a -> b -> b) -> b -> AppendMap k a -> b
234+foldr' = coerce (Map.foldr' :: (a -> b -> b) -> b -> Map k a -> b)
235+
236+foldl' :: forall k a b. (a -> b -> a) -> a -> AppendMap k b -> a
237+foldl' = coerce (Map.foldl' :: (a -> b -> a) -> a -> Map k b -> a)
238+
239+foldrWithKey' :: forall k a b. (k -> a -> b -> b) -> b -> AppendMap k a -> b
240+foldrWithKey' = coerce (Map.foldrWithKey' :: (k -> a -> b -> b) -> b -> Map k a -> b)
241+
242+foldlWithKey' :: forall k a b. (a -> k -> b -> a) -> a -> AppendMap k b -> a
243+foldlWithKey' = coerce (Map.foldlWithKey' :: (a -> k -> b -> a) -> a -> Map k b -> a)
244+
245+elems :: forall k a. AppendMap k a -> [a]
246+elems = coerce (Map.elems :: Map k a -> [a])
247+
248+keys :: forall k a. AppendMap k a -> [k]
249+keys = coerce (Map.keys :: Map k a -> [k])
250+
251+assocs :: forall k a. AppendMap k a -> [(k, a)]
252+assocs = coerce (Map.assocs :: Map k a -> [(k, a)])
253+
254+keysSet :: forall k a. AppendMap k a -> Set k
255+keysSet = coerce (Map.keysSet :: Map k a -> Set k)
256+
257+fromSet :: forall k a. (k -> a) -> Set k -> AppendMap k a
258+fromSet = coerce (Map.fromSet :: (k -> a) -> Set k -> Map k a)
259+
260+toList :: forall k a. AppendMap k a -> [(k, a)]
261+toList = coerce (Map.toList :: Map k a -> [(k, a)])
262+
263+fromList :: forall k a. Ord k => [(k, a)] -> AppendMap k a
264+fromList = coerce (Map.fromList :: [(k, a)] -> Map k a)
265+
266+fromListWith :: forall k a. Ord k => (a -> a -> a) -> [(k, a)] -> AppendMap k a
267+fromListWith = coerce (Map.fromListWith :: (a -> a -> a) -> [(k, a)] -> Map k a)
268+
269+fromListWithKey :: forall k a. Ord k => (k -> a -> a -> a) -> [(k, a)] -> AppendMap k a
270+fromListWithKey = coerce (Map.fromListWithKey :: (k -> a -> a -> a) -> [(k, a)] -> Map k a)
271+
272+toAscList :: forall k a. AppendMap k a -> [(k, a)]
273+toAscList = coerce (Map.toAscList :: Map k a -> [(k, a)])
274+
275+toDescList :: forall k a. AppendMap k a -> [(k, a)]
276+toDescList = coerce (Map.toDescList :: Map k a -> [(k, a)])
277+
278+fromAscList :: forall k a. Eq k => [(k, a)] -> AppendMap k a
279+fromAscList = coerce (Map.fromAscList :: [(k, a)] -> Map k a)
280+
281+fromAscListWith :: forall k a. Eq k => (a -> a -> a) -> [(k, a)] -> AppendMap k a
282+fromAscListWith = coerce (Map.fromAscListWith :: (a -> a -> a) -> [(k, a)] -> Map k a)
283+
284+fromAscListWithKey :: forall k a. Eq k => (k -> a -> a -> a) -> [(k, a)] -> AppendMap k a
285+fromAscListWithKey = coerce (Map.fromAscListWithKey :: (k -> a -> a -> a) -> [(k, a)] -> Map k a)
286+
287+fromDistinctAscList :: forall k a. [(k, a)] -> AppendMap k a
288+fromDistinctAscList = coerce (Map.fromDistinctAscList :: [(k, a)] -> Map k a)
289+
290+filter :: forall k a. (a -> Bool) -> AppendMap k a -> AppendMap k a
291+filter = coerce (Map.filter :: (a -> Bool) -> Map k a -> Map k a)
292+
293+filterWithKey :: forall k a. (k -> a -> Bool) -> AppendMap k a -> AppendMap k a
294+filterWithKey = coerce (Map.filterWithKey :: (k -> a -> Bool) -> Map k a -> Map k a)
295+
296+partition :: forall k a. (a -> Bool) -> AppendMap k a -> (AppendMap k a, AppendMap k a)
297+partition = coerce (Map.partition :: (a -> Bool) -> Map k a -> (Map k a, Map k a))
298+
299+partitionWithKey :: forall k a. (k -> a -> Bool) -> AppendMap k a -> (AppendMap k a, AppendMap k a)
300+partitionWithKey = coerce (Map.partitionWithKey :: (k -> a -> Bool) -> Map k a -> (Map k a, Map k a))
301+
302+mapMaybe :: forall k a b. (a -> Maybe b) -> AppendMap k a -> AppendMap k b
303+mapMaybe = coerce (Map.mapMaybe :: (a -> Maybe b) -> Map k a -> Map k b)
304+
305+mapMaybeWithKey :: forall k a b. (k -> a -> Maybe b) -> AppendMap k a -> AppendMap k b
306+mapMaybeWithKey = coerce (Map.mapMaybeWithKey :: (k -> a -> Maybe b) -> Map k a -> Map k b)
307+
308+mapEither :: forall k a b c. (a -> Either b c) -> AppendMap k a -> (AppendMap k b, AppendMap k c)
309+mapEither = coerce (Map.mapEither :: (a -> Either b c) -> Map k a -> (Map k b, Map k c))
310+
311+mapEitherWithKey :: forall k a b c. (k -> a -> Either b c) -> AppendMap k a -> (AppendMap k b, AppendMap k c)
312+mapEitherWithKey = coerce (Map.mapEitherWithKey :: (k -> a -> Either b c) -> Map k a -> (Map k b, Map k c))
313+
314+split :: forall k a. Ord k => k -> AppendMap k a -> (AppendMap k a, AppendMap k a)
315+split = coerce (Map.split :: k -> Map k a -> (Map k a, Map k a))
316+
317+splitLookup :: forall k a. Ord k => k -> AppendMap k a -> (AppendMap k a, Maybe a, AppendMap k a)
318+splitLookup = coerce (Map.splitLookup :: k -> Map k a -> (Map k a, Maybe a, Map k a))
319+
320+splitRoot :: forall k a. AppendMap k a -> [AppendMap k a]
321+splitRoot = coerce (Map.splitRoot :: Map k a -> [Map k a])
322+
323+isSubmapOf :: forall k a. (Ord k, Eq a) => AppendMap k a -> AppendMap k a -> Bool
324+isSubmapOf = coerce (Map.isSubmapOf :: Map k a -> Map k a -> Bool)
325+
326+isSubmapOfBy :: forall k a b. Ord k => (a -> b -> Bool) -> AppendMap k a -> AppendMap k b -> Bool
327+isSubmapOfBy = coerce (Map.isSubmapOfBy :: (a -> b -> Bool) -> Map k a -> Map k b -> Bool)
328+
329+isProperSubmapOf :: forall k a. (Ord k, Eq a) => AppendMap k a -> AppendMap k a -> Bool
330+isProperSubmapOf = coerce (Map.isProperSubmapOf :: Map k a -> Map k a -> Bool)
331+
332+isProperSubmapOfBy :: forall k a b. Ord k => (a -> b -> Bool) -> AppendMap k a -> AppendMap k b -> Bool
333+isProperSubmapOfBy = coerce (Map.isProperSubmapOfBy :: (a -> b -> Bool) -> Map k a -> Map k b -> Bool)
334+
335+lookupIndex :: forall k a. Ord k => k -> AppendMap k a -> Maybe Int
336+lookupIndex = coerce (Map.lookupIndex :: k -> Map k a -> Maybe Int)
337+
338+findIndex :: forall k a. Ord k => k -> AppendMap k a -> Int
339+findIndex = coerce (Map.findIndex :: k -> Map k a -> Int)
340+
341+elemAt :: forall k a. Int -> AppendMap k a -> (k, a)
342+elemAt = coerce (Map.elemAt :: Int -> Map k a -> (k, a))
343+
344+updateAt :: forall k a. (k -> a -> Maybe a) -> Int -> AppendMap k a -> AppendMap k a
345+updateAt = coerce (Map.updateAt :: (k -> a -> Maybe a) -> Int -> Map k a -> Map k a)
346+
347+deleteAt :: forall k a. Int -> AppendMap k a -> AppendMap k a
348+deleteAt = coerce (Map.deleteAt :: Int -> Map k a -> Map k a)
349+
350+findMin :: forall k a. AppendMap k a -> (k, a)
351+findMin = coerce (Map.findMin :: Map k a -> (k, a))
352+
353+findMax :: forall k a. AppendMap k a -> (k, a)
354+findMax = coerce (Map.findMax :: Map k a -> (k, a))
355+
356+deleteMin :: forall k a. AppendMap k a -> AppendMap k a
357+deleteMin = coerce (Map.deleteMin :: Map k a -> Map k a)
358+
359+deleteMax :: forall k a. AppendMap k a -> AppendMap k a
360+deleteMax = coerce (Map.deleteMax :: Map k a -> Map k a)
361+
362+deleteFindMin :: forall k a. AppendMap k a -> ((k, a), AppendMap k a)
363+deleteFindMin = coerce (Map.deleteFindMin :: Map k a -> ((k, a), Map k a))
364+
365+deleteFindMax :: forall k a. AppendMap k a -> ((k, a), AppendMap k a)
366+deleteFindMax = coerce (Map.deleteFindMax :: Map k a -> ((k, a), Map k a))
367+
368+updateMin :: forall k a. (a -> Maybe a) -> AppendMap k a -> AppendMap k a
369+updateMin = coerce (Map.updateMin :: (a -> Maybe a) -> Map k a -> Map k a)
370+
371+updateMax :: forall k a. (a -> Maybe a) -> AppendMap k a -> AppendMap k a
372+updateMax = coerce (Map.updateMax :: (a -> Maybe a) -> Map k a -> Map k a)
373+
374+updateMinWithKey :: forall k a. (k -> a -> Maybe a) -> AppendMap k a -> AppendMap k a
375+updateMinWithKey = coerce (Map.updateMinWithKey :: (k -> a -> Maybe a) -> Map k a -> Map k a)
376+
377+updateMaxWithKey :: forall k a. (k -> a -> Maybe a) -> AppendMap k a -> AppendMap k a
378+updateMaxWithKey = coerce (Map.updateMaxWithKey :: (k -> a -> Maybe a) -> Map k a -> Map k a)
379+
380+minView :: forall k a. AppendMap k a -> Maybe (a, AppendMap k a)
381+minView = coerce (Map.minView :: Map k a -> Maybe (a, Map k a))
382+
383+maxView :: forall k a. AppendMap k a -> Maybe (a, AppendMap k a)
384+maxView = coerce (Map.maxView :: Map k a -> Maybe (a, Map k a))
385+
386+minViewWithKey :: forall k a. AppendMap k a -> Maybe ((k, a), AppendMap k a)
387+minViewWithKey = coerce (Map.minViewWithKey :: Map k a -> Maybe ((k, a), Map k a))
388+
389+maxViewWithKey :: forall k a. AppendMap k a -> Maybe ((k, a), AppendMap k a)
390+maxViewWithKey = coerce (Map.maxViewWithKey :: Map k a -> Maybe ((k, a), Map k a))
391+
392+showTree :: forall k a. (Show k, Show a) => AppendMap k a -> String
393+showTree = coerce (Map.showTree :: (Show k, Show a) => Map k a -> String)
394+
395+showTreeWith :: forall k a. (k -> a -> String) -> Bool -> Bool -> AppendMap k a -> String
81396showTreeWith = coerce (Map.showTreeWith :: (k -> a -> String) -> Bool -> Bool -> Map k a -> String)
82397
83−instance Default (MonoidalMap k a) where
398+valid :: forall k a. Ord k => AppendMap k a -> Bool
399+valid = coerce (Map.valid :: Ord k => Map k a -> Bool)
400+
401+instance Default (AppendMap k a) where
84402 def = empty
403+
404+instance AppendMap k' v' ~ t => Rewrapped (AppendMap k a) t
405+
406+instance Wrapped (AppendMap k a) where
407+ type Unwrapped (AppendMap k a) = Map k a
408+ _Wrapped' = iso (\(AppendMap m) -> m) AppendMap
src/Data/FastMutableIntMap.hs+29−26
@@ -1,9 +1,8 @@
1+{-# LANGUAGE DeriveFunctor #-}
2+{-# LANGUAGE DeriveFoldable #-}
3+{-# LANGUAGE DeriveTraversable #-}
4+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
15{-# LANGUAGE TypeFamilies #-}
2−-- |
3−-- Module:
4−-- Data.FastMutableIntMap
5−-- Description:
6−-- A mutable version of 'IntMap'
76module Data.FastMutableIntMap
87 ( FastMutableIntMap
98 , new
@@ -21,7 +20,6 @@ module Data.FastMutableIntMap
2120 , patchIntMapNewElements
2221 , patchIntMapNewElementsMap
2322 , getDeletions
24− , toList
2523 ) where
2624
2725--TODO: Pure JS version
@@ -29,52 +27,41 @@ module Data.FastMutableIntMap
2927--TODO: Fast patch type
3028
3129import Prelude hiding (lookup)
32−
33−import Control.Monad.IO.Class
34−import Data.Foldable (traverse_)
30+import Data.IORef
3531import Data.IntMap.Strict (IntMap)
3632import qualified Data.IntMap.Strict as IntMap
37−import Data.IORef
38−import Data.Patch.Class
39−import Data.Patch.IntMap
33+import Data.Maybe
34+import Reflex.Patch.Class
35+import Data.Foldable (traverse_)
36+import Control.Monad.IO.Class
4037
41−-- | A 'FastMutableIntMap' holds a map of values of type @a@ and allows low-overhead modifications via IO.
42−-- Operations on 'FastMutableIntMap' run in IO.
4338newtype FastMutableIntMap a = FastMutableIntMap (IORef (IntMap a))
4439
45−-- | Create a new 'FastMutableIntMap' out of an 'IntMap'
4640new :: IntMap a -> IO (FastMutableIntMap a)
4741new m = FastMutableIntMap <$> newIORef m
4842
49−-- | Create a new empty 'FastMutableIntMap'
5043newEmpty :: IO (FastMutableIntMap a)
5144newEmpty = FastMutableIntMap <$> newIORef IntMap.empty
5245
53−-- | Insert an element into a 'FastMutableIntMap' at the given key
5446insert :: FastMutableIntMap a -> Int -> a -> IO ()
5547insert (FastMutableIntMap r) k v = modifyIORef' r $ IntMap.insert k v
5648
57−-- | Attempt to lookup an element by key in a 'FastMutableIntMap'
5849lookup :: FastMutableIntMap a -> Int -> IO (Maybe a)
5950lookup (FastMutableIntMap r) k = IntMap.lookup k <$> readIORef r
6051
61−-- | Runs the provided action over the intersection of a 'FastMutableIntMap' and an 'IntMap'
6252forIntersectionWithImmutable_ :: MonadIO m => FastMutableIntMap a -> IntMap b -> (a -> b -> m ()) -> m ()
6353forIntersectionWithImmutable_ (FastMutableIntMap r) b f = do
6454 a <- liftIO $ readIORef r
6555 traverse_ (uncurry f) $ IntMap.intersectionWith (,) a b
6656
67−-- | Runs the provided action over the values of a 'FastMutableIntMap'
6857for_ :: MonadIO m => FastMutableIntMap a -> (a -> m ()) -> m ()
6958for_ (FastMutableIntMap r) f = do
7059 a <- liftIO $ readIORef r
7160 traverse_ f a
7261
73−-- | Checks whether a 'FastMutableIntMap' is empty
7462isEmpty :: FastMutableIntMap a -> IO Bool
7563isEmpty (FastMutableIntMap r) = IntMap.null <$> readIORef r
7664
77−-- | Retrieves the size of a 'FastMutableIntMap'
7865size :: FastMutableIntMap a -> IO Int
7966size (FastMutableIntMap r) = IntMap.size <$> readIORef r
8067
@@ -85,13 +72,29 @@ getFrozenAndClear (FastMutableIntMap r) = do
8572 writeIORef r IntMap.empty
8673 return result
8774
88−-- | Updates the value of a 'FastMutableIntMap' with the given patch (see 'Data.Patch.IntMap'),
89−-- and returns an 'IntMap' with the modified keys and values.
9075applyPatch :: FastMutableIntMap a -> PatchIntMap a -> IO (IntMap a)
9176applyPatch (FastMutableIntMap r) p@(PatchIntMap m) = do
9277 v <- readIORef r
9378 writeIORef r $! applyAlways p v
9479 return $ IntMap.intersection v m
9580
96−toList :: FastMutableIntMap a -> IO [(Int, a)]
97−toList (FastMutableIntMap r) = IntMap.toList <$> readIORef r
81+newtype PatchIntMap a = PatchIntMap (IntMap (Maybe a)) deriving (Functor, Foldable, Traversable, Monoid)
82+
83+instance Patch (PatchIntMap a) where
84+ type PatchTarget (PatchIntMap a) = IntMap a
85+ apply (PatchIntMap p) v = if IntMap.null p then Nothing else Just $
86+ let removes = IntMap.filter isNothing p
87+ adds = IntMap.mapMaybe id p
88+ in IntMap.union adds $ v `IntMap.difference` removes
89+
90+traverseIntMapPatchWithKey :: Applicative t => (Int -> a -> t b) -> PatchIntMap a -> t (PatchIntMap b)
91+traverseIntMapPatchWithKey f (PatchIntMap m) = PatchIntMap <$> IntMap.traverseWithKey (\k mv -> traverse (f k) mv) m
92+
93+patchIntMapNewElements :: PatchIntMap a -> [a]
94+patchIntMapNewElements (PatchIntMap m) = catMaybes $ IntMap.elems m
95+
96+patchIntMapNewElementsMap :: PatchIntMap a -> IntMap a
97+patchIntMapNewElementsMap (PatchIntMap m) = IntMap.mapMaybe id m
98+
99+getDeletions :: PatchIntMap v -> IntMap v' -> IntMap v'
100+getDeletions (PatchIntMap m) v = IntMap.intersection v m
src/Data/FastWeakBag.hs+12−16
@@ -18,7 +18,6 @@ module Data.FastWeakBag
1818 , isEmpty
1919 , insert
2020 , traverse
21− , traverse_
2221 , remove
2322 -- * Internal functions
2423 -- These will not always be available.
@@ -27,31 +26,32 @@ module Data.FastWeakBag
2726#endif
2827 ) where
2928
30−import Prelude hiding (traverse)
31−
32−import Control.Monad
29+import Control.Monad hiding (forM_, mapM_)
3330import Control.Monad.IO.Class
3431
3532#ifdef GHCJS_FAST_WEAK
3633import GHCJS.Types
37−import Reflex.FastWeak (js_isNull, unsafeFromRawJSVal, unsafeToRawJSVal)
34+import Reflex.FastWeak (unsafeFromRawJSVal, unsafeToRawJSVal, js_isNull)
3835#else
3936import Control.Exception
37+import Data.Foldable (forM_, mapM_)
4038import Data.IntMap.Strict (IntMap)
4139import qualified Data.IntMap.Strict as IntMap
4240import Data.IORef
4341import System.Mem.Weak
4442#endif
4543
46−-- | A 'FastWeakBag' holds a set of values of type @/a/@, but does not retain them -
47−-- that is, they can still be garbage-collected. As long as the @/a/@ values remain
44+import Prelude hiding (mapM_, traverse)
45+
46+-- | A @FastWeakBag a@ holds a set of values of type @a@, but does not retain them -
47+-- that is, they can still be garbage-collected. As long as the @a@s remain
4848-- alive, the 'FastWeakBag' will continue to refer to them.
4949#ifdef GHCJS_FAST_WEAK
5050newtype FastWeakBag a = FastWeakBag JSVal
5151#else
5252data FastWeakBag a = FastWeakBag
5353 { _weakBag_nextId :: {-# UNPACK #-} !(IORef Int) --TODO: what if this wraps around?
54− , _weakBag_children :: {-# UNPACK #-} !(IORef (IntMap (Weak a))) -- ^ Map of items contained by the 'FastWeakBag'
54+ , _weakBag_children :: {-# UNPACK #-} !(IORef (IntMap (Weak a)))
5555 }
5656#endif
5757
@@ -117,14 +117,14 @@ foreign import javascript unsafe "(function(){ for(var i = 0; i < $1.tickets.len
117117isEmpty bag = {-# SCC "isEmpty" #-} IntMap.null <$> readIORef (_weakBag_children bag)
118118#endif
119119
120−{-# INLINE traverse_ #-}
120+{-# INLINE traverse #-}
121121-- | Visit every node in the given list. If new nodes are appended during the
122122-- traversal, they will not be visited. Every live node that was in the list
123123-- when the traversal began will be visited exactly once; however, no guarantee
124124-- is made about the order of the traversal.
125−traverse_ :: forall a m. MonadIO m => FastWeakBag a -> (a -> m ()) -> m ()
125+traverse :: forall a m. MonadIO m => FastWeakBag a -> (a -> m ()) -> m ()
126126#ifdef GHCJS_FAST_WEAK
127−traverse_ wb f = do
127+traverse wb f = do
128128 let go cursor = when (not $ js_isNull cursor) $ do
129129 val <- liftIO $ js_getTicketValue cursor
130130 f $ unsafeFromRawJSVal val
@@ -135,17 +135,13 @@ foreign import javascript unsafe "$r = $1.val;" js_getTicketValue :: JSVal -> IO
135135--TODO: Fix the race condition where if a cursor is deleted (presumably using 'remove', below) while we're holding it, it can't find its way back to the correct bag
136136foreign import javascript unsafe "(function(){ for(var i = $1.pos - 1; i >= 0; i--) { if($1.bag.tickets[i] !== null) { return $1.bag.tickets[i]; } }; return null; })()" js_getNext :: FastWeakBagTicket a -> IO JSVal --TODO: Clean up as we go along so this isn't O(n) every time -- Result can be null or a FastWeakBagTicket a
137137#else
138−traverse_ (FastWeakBag _ children) f = {-# SCC "traverse_" #-} do
138+traverse (FastWeakBag _ children) f = {-# SCC "traverse" #-} do
139139 cs <- liftIO $ readIORef children
140140 forM_ cs $ \c -> do
141141 ma <- liftIO $ deRefWeak c
142142 mapM_ f ma
143143#endif
144144
145−{-# DEPRECATED traverse "Use 'traverse_' instead" #-}
146−traverse :: forall a m. MonadIO m => FastWeakBag a -> (a -> m ()) -> m ()
147−traverse = traverse_
148−
149145-- | Remove an item from the 'FastWeakBag'; does nothing if invoked multiple times
150146-- on the same 'FastWeakBagTicket'.
151147{-# INLINE remove #-}
src/Data/Functor/Misc.hsnew file+345
@@ -0,0 +1,345 @@
1+{-# LANGUAGE CPP #-}
2+{-# LANGUAGE DeriveDataTypeable #-}
3+{-# LANGUAGE DeriveFunctor #-}
4+{-# LANGUAGE FlexibleContexts #-}
5+{-# LANGUAGE FlexibleInstances #-}
6+{-# LANGUAGE GADTs #-}
7+{-# LANGUAGE KindSignatures #-}
8+{-# LANGUAGE LambdaCase #-}
9+{-# LANGUAGE MultiParamTypeClasses #-}
10+{-# LANGUAGE PatternSynonyms #-}
11+{-# LANGUAGE PolyKinds #-}
12+{-# LANGUAGE RankNTypes #-}
13+{-# LANGUAGE ScopedTypeVariables #-}
14+{-# LANGUAGE StandaloneDeriving #-}
15+#ifdef USE_REFLEX_OPTIMIZER
16+{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
17+#endif
18+-- | This module provides types and functions with no particular theme, but
19+-- which are relevant to the use of 'Functor'-based datastructures like
20+-- 'Data.Dependent.Map.DMap'.
21+module Data.Functor.Misc
22+ ( -- * Const2
23+ Const2 (..)
24+ , unConst2
25+ , dmapToMap
26+ , dmapToMapWith
27+ , mapToDMap
28+ , weakenDMapWith
29+ -- * WrapArg
30+ , WrapArg (..)
31+ -- * Convenience functions for DMap
32+ , mapWithFunctorToDMap
33+ , mapKeyValuePairsMonotonic
34+ , combineDMapsWithKey
35+ , EitherTag (..)
36+ , dmapToThese
37+ , eitherToDSum
38+ , dsumToEither
39+ -- * Deprecated functions
40+ , sequenceDmap
41+ , wrapDMap
42+ , rewrapDMap
43+ , unwrapDMap
44+ , unwrapDMapMaybe
45+ , extractFunctorDMap
46+ , ComposeMaybe (..)
47+ ) where
48+
49+import Control.Applicative (Applicative, (<$>))
50+import Control.Monad.Identity
51+import Data.Dependent.Map (DMap)
52+import qualified Data.Dependent.Map as DMap
53+import Data.Dependent.Sum
54+import Data.GADT.Compare
55+import Data.GADT.Show
56+import Data.Map (Map)
57+import qualified Data.Map as Map
58+import Data.Some (Some)
59+import qualified Data.Some as Some
60+import Data.These
61+import Data.Typeable hiding (Refl)
62+
63+--------------------------------------------------------------------------------
64+-- Const2
65+--------------------------------------------------------------------------------
66+
67+-- | 'Const2' stores a value of a given type 'k' and ensures that a particular
68+-- type 'v' is always given for the last type parameter
69+data Const2 :: * -> x -> x -> * where
70+ Const2 :: k -> Const2 k v v
71+ deriving (Typeable)
72+
73+unConst2 :: Const2 k v v' -> k
74+unConst2 (Const2 k) = k
75+
76+deriving instance Eq k => Eq (Const2 k v v')
77+deriving instance Ord k => Ord (Const2 k v v')
78+deriving instance Show k => Show (Const2 k v v')
79+deriving instance Read k => Read (Const2 k v v)
80+
81+instance Show k => GShow (Const2 k v) where
82+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
83+ gshowToShow (Const2 _) = id
84+#else
85+ gshowsPrec n x@(Const2 _) = showsPrec n x
86+#endif
87+
88+instance (Show k, Show (f v)) => ShowTag (Const2 k v) f where
89+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
90+ showTagToShow (Const2 _) _ = id
91+#else
92+ showTaggedPrec (Const2 _) = showsPrec
93+#endif
94+
95+instance Eq k => GEq (Const2 k v) where
96+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
97+ geqToEq _ = id
98+ geqUnify (Const2 _) (Const2 _) _ = id
99+#else
100+ geq (Const2 a) (Const2 b) =
101+ if a == b
102+ then Just Refl
103+ else Nothing
104+#endif
105+
106+instance Ord k => GCompare (Const2 k v) where
107+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
108+ gcompareToOrd (Const2 _) = id
109+ gcompare (Const2 a) (Const2 b) = strengthenOrdering $ compare a b
110+#else
111+ gcompare (Const2 a) (Const2 b) = case compare a b of
112+ LT -> GLT
113+ EQ -> GEQ
114+ GT -> GGT
115+#endif
116+
117+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
118+instance {-# INCOHERENT #-} (Eq k, Eq v) => EqTag (Const2 k v) Identity where
119+ eqTagToEq (Const2 _) _ = id
120+
121+instance {-# INCOHERENT #-} Eq k => EqTag (Const2 k v) (Const2 k v) where
122+ eqTagToEq (Const2 _) _ = id
123+#endif
124+
125+-- | Convert a 'DMap' to a regular 'Map'
126+dmapToMap :: DMap (Const2 k v) Identity -> Map k v
127+dmapToMap = Map.fromDistinctAscList . map (\(Const2 k :=> Identity v) -> (k, v)) . DMap.toAscList
128+
129+dmapToMapWith :: (f v -> v') -> DMap (Const2 k v) f -> Map k v'
130+dmapToMapWith f = Map.fromDistinctAscList . map (\(Const2 k :=> v) -> (k, f v)) . DMap.toAscList
131+
132+-- | Convert a regular 'Map' to a 'DMap'
133+mapToDMap :: Map k v -> DMap (Const2 k v) Identity
134+mapToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> Identity v) . Map.toAscList
135+
136+-- | Convert a regular 'Map', where the values are already wrapped in a functor,
137+-- to a 'DMap'
138+mapWithFunctorToDMap :: Map k (f v) -> DMap (Const2 k v) f
139+mapWithFunctorToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> v) . Map.toAscList
140+
141+weakenDMapWith :: (forall a. v a -> v') -> DMap k v -> Map (Some k) v'
142+weakenDMapWith f = Map.fromDistinctAscList . map (\(k :=> v) -> (Some.This k, f v)) . DMap.toAscList
143+
144+--------------------------------------------------------------------------------
145+-- WrapArg
146+--------------------------------------------------------------------------------
147+
148+-- | 'WrapArg' can be used to tag a value in one functor with a type
149+-- representing another functor. This was primarily used with dependent-map <
150+-- 0.2, in which the value type was not wrapped in a separate functor.
151+data WrapArg :: (k -> *) -> (k -> *) -> * -> * where
152+ WrapArg :: f a -> WrapArg g f (g a)
153+
154+deriving instance Eq (f a) => Eq (WrapArg g f (g' a))
155+deriving instance Ord (f a) => Ord (WrapArg g f (g' a))
156+deriving instance Show (f a) => Show (WrapArg g f (g' a))
157+deriving instance Read (f a) => Read (WrapArg g f (g a))
158+
159+instance GEq f => GEq (WrapArg g f) where
160+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
161+ geqToEq (WrapArg f) = geqToEq f
162+ geqUnify (WrapArg a) (WrapArg b) = geqUnify a b
163+#else
164+ geq (WrapArg a) (WrapArg b) = (\Refl -> Refl) <$> geq a b
165+#endif
166+
167+instance GCompare f => GCompare (WrapArg g f) where
168+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
169+ gcompareToOrd (WrapArg f) = gcompareToOrd f
170+#endif
171+ gcompare (WrapArg a) (WrapArg b) = case gcompare a b of
172+ GLT -> GLT
173+ GEQ -> GEQ
174+ GGT -> GGT
175+
176+--------------------------------------------------------------------------------
177+-- Convenience functions for DMap
178+--------------------------------------------------------------------------------
179+
180+-- | Map over all key/value pairs in a 'DMap', potentially altering the key as
181+-- well as the value. The provided function MUST preserve the ordering of the
182+-- keys, or the resulting 'DMap' will be malformed.
183+mapKeyValuePairsMonotonic :: (DSum k v -> DSum k' v') -> DMap k v -> DMap k' v'
184+mapKeyValuePairsMonotonic f = DMap.fromDistinctAscList . map f . DMap.toAscList
185+
186+{-# INLINE combineDMapsWithKey #-}
187+-- | Union two 'DMap's of different types, yielding another type. Each key that
188+-- is present in either input map will be present in the output.
189+combineDMapsWithKey :: forall f g h i.
190+ GCompare f
191+ => (forall a. f a -> These (g a) (h a) -> i a)
192+ -> DMap f g
193+ -> DMap f h
194+ -> DMap f i
195+combineDMapsWithKey f mg mh = DMap.fromList $ go (DMap.toList mg) (DMap.toList mh)
196+ where go :: [DSum f g] -> [DSum f h] -> [DSum f i]
197+ go [] hs = map (\(hk :=> hv) -> hk :=> f hk (That hv)) hs
198+ go gs [] = map (\(gk :=> gv) -> gk :=> f gk (This gv)) gs
199+ go gs@((gk :=> gv) : gs') hs@((hk :=> hv) : hs') = case gk `gcompare` hk of
200+ GLT -> (gk :=> f gk (This gv)) : go gs' hs
201+ GEQ -> (gk :=> f gk (These gv hv)) : go gs' hs'
202+ GGT -> (hk :=> f hk (That hv)) : go gs hs'
203+
204+-- | Extract the values of a 'DMap' of 'EitherTag's.
205+dmapToThese :: DMap (EitherTag a b) Identity -> Maybe (These a b)
206+dmapToThese m = case (DMap.lookup LeftTag m, DMap.lookup RightTag m) of
207+ (Nothing, Nothing) -> Nothing
208+ (Just (Identity a), Nothing) -> Just $ This a
209+ (Nothing, Just (Identity b)) -> Just $ That b
210+ (Just (Identity a), Just (Identity b)) -> Just $ These a b
211+
212+-- | Tag type for 'Either' to use it as a 'DSum'.
213+data EitherTag l r a where
214+ LeftTag :: EitherTag l r l
215+ RightTag :: EitherTag l r r
216+ deriving (Typeable)
217+
218+deriving instance Show (EitherTag l r a)
219+deriving instance Eq (EitherTag l r a)
220+deriving instance Ord (EitherTag l r a)
221+
222+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
223+instance {-# INCOHERENT #-} (Show (f l), Show (f r)) => ShowTag (EitherTag l r) f where
224+ showTagToShow e _ = case e of
225+ LeftTag -> id
226+ RightTag -> id
227+
228+instance {-# INCOHERENT #-} (Eq (f l), Eq (f r)) => EqTag (EitherTag l r) f where
229+ eqTagToEq e _ = case e of
230+ LeftTag -> id
231+ RightTag -> id
232+#endif
233+
234+instance GEq (EitherTag l r) where
235+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
236+ geqToEq _ = id
237+ geqUnify LeftTag LeftTag _ same = same
238+ geqUnify RightTag RightTag _ same = same
239+ geqUnify _ _ unknown _ = unknown
240+#endif
241+ geq a b = case (a, b) of
242+ (LeftTag, LeftTag) -> Just Refl
243+ (RightTag, RightTag) -> Just Refl
244+ _ -> Nothing
245+
246+instance GCompare (EitherTag l r) where
247+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
248+ gcompareToOrd _ = id
249+#endif
250+ gcompare a b = case (a, b) of
251+ (LeftTag, LeftTag) -> GEQ
252+ (LeftTag, RightTag) -> GLT
253+ (RightTag, LeftTag) -> GGT
254+ (RightTag, RightTag) -> GEQ
255+
256+instance GShow (EitherTag l r) where
257+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
258+ gshowToShow _ = id
259+#else
260+ gshowsPrec _ a = case a of
261+ LeftTag -> showString "LeftTag"
262+ RightTag -> showString "RightTag"
263+#endif
264+
265+instance (Show l, Show r) => ShowTag (EitherTag l r) Identity where
266+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
267+ showTagToShow t _ = case t of
268+ LeftTag -> id
269+ RightTag -> id
270+#else
271+ showTaggedPrec t n (Identity a) = case t of
272+ LeftTag -> showsPrec n a
273+ RightTag -> showsPrec n a
274+#endif
275+
276+-- | Convert 'Either' to a 'DSum'. Inverse of 'dsumToEither'.
277+eitherToDSum :: Either a b -> DSum (EitherTag a b) Identity
278+eitherToDSum = \case
279+ Left a -> (LeftTag :=> Identity a)
280+ Right b -> (RightTag :=> Identity b)
281+
282+-- | Convert 'DSum' to 'Either'. Inverse of 'eitherToDSum'.
283+dsumToEither :: DSum (EitherTag a b) Identity -> Either a b
284+dsumToEither = \case
285+ (LeftTag :=> Identity a) -> Left a
286+ (RightTag :=> Identity b) -> Right b
287+
288+--------------------------------------------------------------------------------
289+-- ComposeMaybe
290+--------------------------------------------------------------------------------
291+
292+-- | We can't use @Compose Maybe@ instead of 'ComposeMaybe', because that would
293+-- make the 'f' parameter have a nominal type role. We need f to be
294+-- representational so that we can use safe 'coerce'.
295+#if MIN_VERSION_transformers(5,2,0)
296+newtype ComposeMaybe f a =
297+#else
298+newtype ComposeMaybe (f :: * -> *) (a :: *) =
299+#endif
300+ ComposeMaybe { getComposeMaybe :: Maybe (f a) } deriving (Show, Eq, Ord)
301+
302+deriving instance Functor f => Functor (ComposeMaybe f)
303+
304+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
305+instance {-# INCOHERENT #-} EqTag f g => EqTag f (ComposeMaybe g) where
306+ eqTagToEq f _ = eqTagToEq f (Proxy :: Proxy g)
307+
308+instance {-# INCOHERENT #-} GShow k => ShowTag k (ComposeMaybe k) where
309+ showTagToShow k _ r = gshowToShow k (showTagToShow k (Proxy :: Proxy k) r)
310+#endif
311+--------------------------------------------------------------------------------
312+-- Deprecated functions
313+--------------------------------------------------------------------------------
314+
315+{-# INLINE sequenceDmap #-}
316+{-# DEPRECATED sequenceDmap "Use 'Data.Dependent.Map.traverseWithKey (\\_ -> fmap Identity)' instead" #-}
317+-- | Run the actions contained in the 'DMap'
318+sequenceDmap :: Applicative t => DMap f t -> t (DMap f Identity)
319+sequenceDmap = DMap.traverseWithKey $ \_ t -> Identity <$> t
320+
321+{-# DEPRECATED wrapDMap "Use 'Data.Dependent.Map.map (f . runIdentity)' instead" #-}
322+-- | Replace the 'Identity' functor for a 'DMap''s values with a different functor
323+wrapDMap :: (forall a. a -> f a) -> DMap k Identity -> DMap k f
324+wrapDMap f = DMap.map $ f . runIdentity
325+
326+{-# DEPRECATED rewrapDMap "Use 'Data.Dependent.Map.map' instead" #-}
327+-- | Replace one functor for a 'DMap''s values with a different functor
328+rewrapDMap :: (forall (a :: *). f a -> g a) -> DMap k f -> DMap k g
329+rewrapDMap = DMap.map
330+
331+{-# DEPRECATED unwrapDMap "Use 'Data.Dependent.Map.map (Identity . f)' instead" #-}
332+-- | Replace one functor for a 'DMap''s values with the 'Identity' functor
333+unwrapDMap :: (forall a. f a -> a) -> DMap k f -> DMap k Identity
334+unwrapDMap f = DMap.map $ Identity . f
335+
336+{-# DEPRECATED unwrapDMapMaybe "Use 'Data.Dependent.Map.mapMaybeWithKey (\\_ a -> fmap Identity $ f a)' instead" #-}
337+-- | Like 'unwrapDMap', but possibly delete some values from the DMap
338+unwrapDMapMaybe :: GCompare k => (forall a. f a -> Maybe a) -> DMap k f -> DMap k Identity
339+unwrapDMapMaybe f = DMap.mapMaybeWithKey $ \_ a -> Identity <$> f a
340+
341+{-# DEPRECATED extractFunctorDMap "Use 'mapKeyValuePairsMonotonic (\\(Const2 k :=> Identity v) -> Const2 k :=> v)' instead" #-}
342+-- | Eliminate the 'Identity' functor in a 'DMap' and replace it with the
343+-- underlying functor
344+extractFunctorDMap :: DMap (Const2 k (f v)) Identity -> DMap (Const2 k v) f
345+extractFunctorDMap = mapKeyValuePairsMonotonic $ \(Const2 k :=> Identity v) -> Const2 k :=> v
src/Data/Map/Misc.hsdeleted−71
@@ -1,71 +0,0 @@
1−{-# LANGUAGE LambdaCase #-}
2−-- | Additional functions for manipulating 'Map's.
3−module Data.Map.Misc
4− (
5− -- * Working with Maps
6− diffMapNoEq
7− , diffMap
8− , applyMap
9− , mapPartitionEithers
10− , applyMapKeysSet
11− ) where
12−
13−import Data.Align
14−import Data.Map (Map)
15−import qualified Data.Map as Map
16−import Data.Maybe
17−import Data.Set (Set)
18−import qualified Data.Set as Set
19−import Data.These
20−
21−-- |Produce a @'Map' k (Maybe v)@ by comparing two @'Map' k v@s, @old@ and @new@ respectively. @Just@ represents an association present in @new@ and @Nothing@
22−-- represents an association only present in @old@ but no longer present in @new@.
23−--
24−-- Similar to 'diffMap' but doesn't require 'Eq' on the values, thus can't tell if a value has changed or not.
25−diffMapNoEq :: (Ord k) => Map k v -> Map k v -> Map k (Maybe v)
26−diffMapNoEq olds news = flip Map.mapMaybe (align olds news) $ \case
27− This _ -> Just Nothing
28− These _ new -> Just $ Just new
29− That new -> Just $ Just new
30−
31−-- |Produce a @'Map' k (Maybe v)@ by comparing two @'Map' k v@s, @old@ and @new respectively. @Just@ represents an association present in @new@ and either not
32−-- present in @old@ or where the value has changed. @Nothing@ represents an association only present in @old@ but no longer present in @new@.
33−--
34−-- See also 'diffMapNoEq' for a similar but weaker version which does not require 'Eq' on the values but thus can't indicated a value not changing between
35−-- @old@ and @new@ with @Nothing@.
36−diffMap :: (Ord k, Eq v) => Map k v -> Map k v -> Map k (Maybe v)
37−diffMap olds news = flip Map.mapMaybe (align olds news) $ \case
38− This _ -> Just Nothing
39− These old new
40− | old == new -> Nothing
41− | otherwise -> Just $ Just new
42− That new -> Just $ Just new
43−
44−-- |Given a @'Map' k (Maybe v)@ representing keys to insert/update (@Just@) or delete (@Nothing@), produce a new map from the given input @'Map' k v@.
45−--
46−-- See also 'Data.Patch.Map' and 'Data.Patch.MapWithMove'.
47−applyMap :: Ord k => Map k (Maybe v) -> Map k v -> Map k v
48−applyMap patch old = insertions `Map.union` (old `Map.difference` deletions)
49− where (deletions, insertions) = Map.mapEither maybeToEither patch
50− maybeToEither = \case
51− Nothing -> Left ()
52− Just r -> Right r
53−
54−-- |Split a @'Map' k (Either a b)@ into @Map k a@ and @Map k b@, equivalent to @'Map.mapEither' id@
55−{-# DEPRECATED mapPartitionEithers "Use 'mapEither' instead" #-}
56−mapPartitionEithers :: Map k (Either a b) -> (Map k a, Map k b)
57−mapPartitionEithers = Map.mapEither id
58−
59−-- |Given a @'Map' k (Maybe v)@ representing keys to insert/update (@Just@) or delete (@Nothing@), produce a new @'Set' k@ from the given input set.
60−--
61−-- Equivalent to:
62−--
63−-- @
64−-- applyMapKeysSet patch ('Map.keysSet' m) == 'Map.keysSet' ('applyMap' patch m)
65−-- @
66−--
67−-- but avoids the intervening @Map@ and needs no values.
68−applyMapKeysSet :: Ord k => Map k (Maybe v) -> Set k -> Set k
69−applyMapKeysSet patch old = Map.keysSet insertions `Set.union` (old `Set.difference` Map.keysSet deletions)
70− where (insertions, deletions) = Map.partition isJust patch
71−
src/Data/WeakBag.hs+12−14
@@ -15,29 +15,29 @@ module Data.WeakBag
1515 , singleton
1616 , insert
1717 , traverse
18− , traverse_
1918 , remove
2019 -- * Internal functions
2120 -- These will not always be available.
2221 , _weakBag_children --TODO: Don't export this
2322 ) where
2423
25−import Prelude hiding (traverse)
26−
2724import Control.Exception
28−import Control.Monad
25+import Control.Monad hiding (forM_, mapM_)
2926import Control.Monad.IO.Class
27+import Data.Foldable (forM_, mapM_)
3028import Data.IntMap.Strict (IntMap)
3129import qualified Data.IntMap.Strict as IntMap
3230import Data.IORef
3331import System.Mem.Weak
3432
35−-- | A 'WeakBag' holds a set of values of type @/a/@, but does not retain them -
36−-- that is, they can still be garbage-collected. As long as the @/a/@ values remain
33+import Prelude hiding (mapM_, traverse)
34+
35+-- | A @WeakBag a@ holds a set of values of type @a@, but does not retain them -
36+-- that is, they can still be garbage-collected. As long as the @a@s remain
3737-- alive, the 'WeakBag' will continue to refer to them.
3838data WeakBag a = WeakBag
3939 { _weakBag_nextId :: {-# UNPACK #-} !(IORef Int) --TODO: what if this wraps around?
40− , _weakBag_children :: {-# UNPACK #-} !(IORef (IntMap (Weak a))) -- ^ The items referenced by the WeakBag
40+ , _weakBag_children :: {-# UNPACK #-} !(IORef (IntMap (Weak a)))
4141 }
4242
4343-- | When inserting an item into a 'WeakBag', a 'WeakBagTicket' is returned. If
@@ -72,6 +72,8 @@ insert a (WeakBag nextId children) wbRef finalizer = {-# SCC "insert" #-} do
7272 let !csWithoutMe = IntMap.delete myId cs
7373 in (csWithoutMe, csWithoutMe)
7474 when (IntMap.null csWithoutMe) $ finalizer b
75+ return ()
76+ return ()
7577 wa <- mkWeakPtr a' $ Just cleanup
7678 atomicModifyIORef' children $ \cs -> (IntMap.insert myId wa cs, ())
7779 return $ WeakBagTicket
@@ -100,22 +102,18 @@ singleton a wbRef finalizer = {-# SCC "singleton" #-} do
100102 ticket <- insert a bag wbRef finalizer
101103 return (bag, ticket)
102104
103−{-# INLINE traverse_ #-}
105+{-# INLINE traverse #-}
104106-- | Visit every node in the given list. If new nodes are appended during the
105107-- traversal, they will not be visited. Every live node that was in the list
106108-- when the traversal began will be visited exactly once; however, no guarantee
107109-- is made about the order of the traversal.
108−traverse_ :: MonadIO m => WeakBag a -> (a -> m ()) -> m ()
109−traverse_ (WeakBag _ children) f = {-# SCC "traverse" #-} do
110+traverse :: MonadIO m => WeakBag a -> (a -> m ()) -> m ()
111+traverse (WeakBag _ children) f = {-# SCC "traverse" #-} do
110112 cs <- liftIO $ readIORef children
111113 forM_ cs $ \c -> do
112114 ma <- liftIO $ deRefWeak c
113115 mapM_ f ma
114116
115−{-# DEPRECATED traverse "Use 'traverse_' instead" #-}
116−traverse :: MonadIO m => WeakBag a -> (a -> m ()) -> m ()
117−traverse = traverse_
118−
119117-- | Remove an item from the 'WeakBag'; does nothing if invoked multiple times
120118-- on the same 'WeakBagTicket'.
121119{-# INLINE remove #-}
src/Reflex.hs+2−10
@@ -6,20 +6,13 @@ module Reflex
66 ) where
77
88import Reflex.Class as X
9−import Reflex.Adjustable.Class as X
10−import Reflex.BehaviorWriter.Base as X
11−import Reflex.BehaviorWriter.Class as X
12−import Reflex.Collection as X
9+import Reflex.EventWriter as X
1310import Reflex.Dynamic as X
14−import Reflex.EventWriter.Base as X
15−import Reflex.EventWriter.Class as X
1611#ifdef USE_TEMPLATE_HASKELL
1712import Reflex.Dynamic.TH as X
1813#endif
1914import Reflex.Dynamic.Uniq as X
20−import Reflex.DynamicWriter.Base as X
21−import Reflex.DynamicWriter.Class as X
22−import Reflex.NotReady.Class as X
15+import Reflex.DynamicWriter as X
2316import Reflex.PerformEvent.Base as X
2417import Reflex.PerformEvent.Class as X
2518import Reflex.PostBuild.Base as X
@@ -30,6 +23,5 @@ import Reflex.Query.Class as X
3023import Reflex.Requester.Base as X
3124import Reflex.Requester.Class as X
3225import Reflex.Spider as X
33−import Reflex.Time as X
3426import Reflex.TriggerEvent.Base as X
3527import Reflex.TriggerEvent.Class as X
src/Reflex/Adjustable/Class.hsdeleted−140
@@ -1,140 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−{-# LANGUAGE ConstraintKinds #-}
3−{-# LANGUAGE FlexibleInstances #-}
4−{-# LANGUAGE FunctionalDependencies #-}
5−{-# LANGUAGE LambdaCase #-}
6−{-# LANGUAGE RankNTypes #-}
7−{-# LANGUAGE ScopedTypeVariables #-}
8−{-# LANGUAGE TypeFamilies #-}
9−{-# LANGUAGE UndecidableInstances #-}
10−#ifdef USE_REFLEX_OPTIMIZER
11−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
12−#endif
13−-- |
14−-- Module:
15−-- Reflex.Adjustable.Class
16−-- Description:
17−-- A class for actions that can be "adjusted" over time based on some 'Event'
18−-- such that, when observed after the firing of any such 'Event', the result
19−-- is as though the action was originally run with the 'Event's value.
20−module Reflex.Adjustable.Class
21− (
22− -- * The Adjustable typeclass
23− Adjustable(..)
24− , sequenceDMapWithAdjust
25− , sequenceDMapWithAdjustWithMove
26− , mapMapWithAdjustWithMove
27− -- * Deprecated aliases
28− , MonadAdjust
29− ) where
30−
31−import Control.Monad.Identity
32−import Control.Monad.Reader
33−import Data.Dependent.Map (DMap)
34−import Data.GADT.Compare (GCompare(..))
35−import qualified Data.Dependent.Map as DMap
36−import Data.Functor.Constant
37−import Data.Functor.Misc
38−import Data.IntMap.Strict (IntMap)
39−import qualified Data.IntMap.Strict as IntMap
40−import Data.Map (Map)
41−
42−import Reflex.Class
43−import Data.Patch.DMapWithMove
44−
45−-- | A 'Monad' that supports adjustment over time. After an action has been
46−-- run, if the given events fire, it will adjust itself so that its net effect
47−-- is as though it had originally been run with the new value. Note that there
48−-- is some issue here with persistent side-effects: obviously, IO (and some
49−-- other side-effects) cannot be undone, so it is up to the instance implementer
50−-- to determine what the best meaning for this class is in such cases.
51−class (Reflex t, Monad m) => Adjustable t m | m -> t where
52− runWithReplace
53− :: m a
54− -> Event t (m b)
55− -> m (a, Event t b)
56−
57− traverseIntMapWithKeyWithAdjust
58− :: (IntMap.Key -> v -> m v')
59− -> IntMap v
60− -> Event t (PatchIntMap v)
61− -> m (IntMap v', Event t (PatchIntMap v'))
62−
63− traverseDMapWithKeyWithAdjust
64− :: GCompare k
65− => (forall a. k a -> v a -> m (v' a))
66− -> DMap k v
67− -> Event t (PatchDMap k v)
68− -> m (DMap k v', Event t (PatchDMap k v'))
69− {-# INLINABLE traverseDMapWithKeyWithAdjust #-}
70− traverseDMapWithKeyWithAdjust f dm0 dm' = fmap (fmap (fmap fromPatchWithMove)) $
71− traverseDMapWithKeyWithAdjustWithMove f dm0 $ fmap toPatchWithMove dm'
72− where
73− toPatchWithMove (PatchDMap m) = PatchDMapWithMove $ DMap.map toNodeInfoWithMove m
74− toNodeInfoWithMove = \case
75− ComposeMaybe (Just v) -> NodeInfo (From_Insert v) $ ComposeMaybe Nothing
76− ComposeMaybe Nothing -> NodeInfo From_Delete $ ComposeMaybe Nothing
77− fromPatchWithMove (PatchDMapWithMove m) = PatchDMap $ DMap.map fromNodeInfoWithMove m
78− fromNodeInfoWithMove (NodeInfo from _) = ComposeMaybe $ case from of
79− From_Insert v -> Just v
80− From_Delete -> Nothing
81− From_Move _ -> error "traverseDMapWithKeyWithAdjust: implementation of traverseDMapWithKeyWithAdjustWithMove inserted spurious move"
82−
83− traverseDMapWithKeyWithAdjustWithMove
84− :: GCompare k
85− => (forall a. k a -> v a -> m (v' a))
86− -> DMap k v
87− -> Event t (PatchDMapWithMove k v)
88− -> m (DMap k v', Event t (PatchDMapWithMove k v'))
89−
90−instance Adjustable t m => Adjustable t (ReaderT r m) where
91− runWithReplace a0 a' = do
92− r <- ask
93− lift $ runWithReplace (runReaderT a0 r) $ fmap (`runReaderT` r) a'
94− traverseIntMapWithKeyWithAdjust f dm0 dm' = do
95− r <- ask
96− lift $ traverseIntMapWithKeyWithAdjust (\k v -> runReaderT (f k v) r) dm0 dm'
97− traverseDMapWithKeyWithAdjust f dm0 dm' = do
98− r <- ask
99− lift $ traverseDMapWithKeyWithAdjust (\k v -> runReaderT (f k v) r) dm0 dm'
100− traverseDMapWithKeyWithAdjustWithMove f dm0 dm' = do
101− r <- ask
102− lift $ traverseDMapWithKeyWithAdjustWithMove (\k v -> runReaderT (f k v) r) dm0 dm'
103−
104−-- | Traverse a 'DMap' of 'Adjustable' actions, running each of them. The provided 'Event' of patches
105−-- to the 'DMap' can add, remove, or update values.
106−sequenceDMapWithAdjust
107− :: (GCompare k, Adjustable t m)
108− => DMap k m
109− -> Event t (PatchDMap k m)
110− -> m (DMap k Identity, Event t (PatchDMap k Identity))
111−sequenceDMapWithAdjust = traverseDMapWithKeyWithAdjust $ \_ -> fmap Identity
112−
113−-- | Traverses a 'DMap' of 'Adjustable' actions, running each of them. The provided 'Event' of patches
114−-- to the 'DMap' can add, remove, update, move, or swap values.
115−sequenceDMapWithAdjustWithMove
116− :: (GCompare k, Adjustable t m)
117− => DMap k m
118− -> Event t (PatchDMapWithMove k m)
119− -> m (DMap k Identity, Event t (PatchDMapWithMove k Identity))
120−sequenceDMapWithAdjustWithMove = traverseDMapWithKeyWithAdjustWithMove $ \_ -> fmap Identity
121−
122−-- | Traverses a 'Map', running the provided 'Adjustable' action. The provided 'Event' of patches to the 'Map'
123−-- can add, remove, update, move, or swap values.
124−mapMapWithAdjustWithMove
125− :: forall t m k v v'. (Adjustable t m, Ord k)
126− => (k -> v -> m v')
127− -> Map k v
128− -> Event t (PatchMapWithMove k v)
129− -> m (Map k v', Event t (PatchMapWithMove k v'))
130−mapMapWithAdjustWithMove f m0 m' = do
131− (out0 :: DMap (Const2 k v) (Constant v'), out') <- traverseDMapWithKeyWithAdjustWithMove (\(Const2 k) (Identity v) -> Constant <$> f k v) (mapToDMap m0) (const2PatchDMapWithMoveWith Identity <$> m')
132− return (dmapToMapWith (\(Constant v') -> v') out0, patchDMapWithMoveToPatchMapWithMoveWith (\(Constant v') -> v') <$> out')
133−
134−--------------------------------------------------------------------------------
135−-- Deprecated functions
136−--------------------------------------------------------------------------------
137−
138−{-# DEPRECATED MonadAdjust "Use Adjustable instead" #-}
139−-- | Synonym for 'Adjustable'
140−type MonadAdjust = Adjustable
src/Reflex/BehaviorWriter/Base.hsdeleted−211
@@ -1,211 +0,0 @@
1−{-|
2−Module: Reflex.BehaviorWriter.Base
3−Description: Implementation of BehaviorWriter
4−-}
5−{-# LANGUAGE CPP #-}
6−{-# LANGUAGE FlexibleInstances #-}
7−{-# LANGUAGE GADTs #-}
8−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
9−{-# LANGUAGE MultiParamTypeClasses #-}
10−{-# LANGUAGE RankNTypes #-}
11−{-# LANGUAGE ScopedTypeVariables #-}
12−{-# LANGUAGE TypeFamilies #-}
13−{-# LANGUAGE UndecidableInstances #-}
14−{-# LANGUAGE StandaloneDeriving #-}
15−#ifdef USE_REFLEX_OPTIMIZER
16−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
17−#endif
18−module Reflex.BehaviorWriter.Base
19− ( BehaviorWriterT (..)
20− , runBehaviorWriterT
21− , withBehaviorWriterT
22− ) where
23−
24−import Control.Monad.Exception
25−import Control.Monad.Identity
26−import Control.Monad.IO.Class
27−import Control.Monad.Morph
28−import Control.Monad.Reader
29−import Control.Monad.Ref
30−import Control.Monad.State.Strict
31−import Data.Dependent.Map (DMap)
32−import qualified Data.Dependent.Map as DMap
33−import Data.Functor.Misc
34−import Data.IntMap (IntMap)
35−import qualified Data.IntMap as IntMap
36−import Data.Map (Map)
37−import qualified Data.Map as Map
38−import Data.Some (Some)
39−
40−import Reflex.Class
41−import Reflex.Adjustable.Class
42−import Reflex.BehaviorWriter.Class
43−import Reflex.Host.Class
44−import Reflex.PerformEvent.Class
45−import Reflex.PostBuild.Class
46−import Reflex.Query.Class
47−import Reflex.Requester.Class
48−import Reflex.TriggerEvent.Class
49−
50−-- | A basic implementation of 'BehaviorWriter'.
51−newtype BehaviorWriterT t w m a = BehaviorWriterT { unBehaviorWriterT :: StateT [Behavior t w] m a }
52− -- The list is kept in reverse order
53− deriving
54− ( Functor
55− , Applicative
56− , Monad
57− , MonadTrans
58− , MFunctor
59− , MonadIO
60− , MonadFix
61− , MonadAsyncException
62− , MonadException
63− )
64−
65−-- | Run a 'BehaviorWriterT' action. The behavior writer output will be provided
66−-- along with the result of the action.
67−runBehaviorWriterT :: (Monad m, Reflex t, Monoid w) => BehaviorWriterT t w m a -> m (a, Behavior t w)
68−runBehaviorWriterT (BehaviorWriterT a) = do
69− (result, ws) <- runStateT a []
70− return (result, mconcat $ reverse ws)
71−
72−-- | Map a function over the output of a 'BehaviorWriterT'.
73−withBehaviorWriterT :: (Monoid w, Monoid w', Reflex t, MonadHold t m)
74− => (w -> w')
75− -> BehaviorWriterT t w m a
76− -> BehaviorWriterT t w' m a
77−withBehaviorWriterT f dw = do
78− (r, d) <- lift $ do
79− (r, d) <- runBehaviorWriterT dw
80− let d' = fmap f d
81− return (r, d')
82− tellBehavior d
83− return r
84−
85−deriving instance MonadHold t m => MonadHold t (BehaviorWriterT t w m)
86−deriving instance MonadSample t m => MonadSample t (BehaviorWriterT t w m)
87−
88−instance MonadRef m => MonadRef (BehaviorWriterT t w m) where
89− type Ref (BehaviorWriterT t w m) = Ref m
90− newRef = lift . newRef
91− readRef = lift . readRef
92− writeRef r = lift . writeRef r
93−
94−instance MonadAtomicRef m => MonadAtomicRef (BehaviorWriterT t w m) where
95− atomicModifyRef r = lift . atomicModifyRef r
96−
97−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (BehaviorWriterT t w m) where
98− newEventWithTrigger = lift . newEventWithTrigger
99− newFanEventWithTrigger f = lift $ newFanEventWithTrigger f
100−
101−instance (Monad m, Monoid w, Reflex t) => BehaviorWriter t w (BehaviorWriterT t w m) where
102− tellBehavior w = BehaviorWriterT $ modify (w :)
103−
104−instance MonadReader r m => MonadReader r (BehaviorWriterT t w m) where
105− ask = lift ask
106− local f (BehaviorWriterT a) = BehaviorWriterT $ mapStateT (local f) a
107− reader = lift . reader
108−
109−instance PerformEvent t m => PerformEvent t (BehaviorWriterT t w m) where
110− type Performable (BehaviorWriterT t w m) = Performable m
111− performEvent_ = lift . performEvent_
112− performEvent = lift . performEvent
113−
114−instance TriggerEvent t m => TriggerEvent t (BehaviorWriterT t w m) where
115− newTriggerEvent = lift newTriggerEvent
116− newTriggerEventWithOnComplete = lift newTriggerEventWithOnComplete
117− newEventWithLazyTriggerWithOnComplete = lift . newEventWithLazyTriggerWithOnComplete
118−
119−instance PostBuild t m => PostBuild t (BehaviorWriterT t w m) where
120− getPostBuild = lift getPostBuild
121−
122−instance MonadState s m => MonadState s (BehaviorWriterT t w m) where
123− get = lift get
124− put = lift . put
125−
126−instance Requester t m => Requester t (BehaviorWriterT t w m) where
127− type Request (BehaviorWriterT t w m) = Request m
128− type Response (BehaviorWriterT t w m) = Response m
129− requesting = lift . requesting
130− requesting_ = lift . requesting_
131−
132−instance (MonadQuery t q m, Monad m) => MonadQuery t q (BehaviorWriterT t w m) where
133− tellQueryIncremental = lift . tellQueryIncremental
134− askQueryResult = lift askQueryResult
135− queryIncremental = lift . queryIncremental
136−
137−instance (Adjustable t m, Monoid w, MonadHold t m, Reflex t) => Adjustable t (BehaviorWriterT t w m) where
138− runWithReplace a0 a' = do
139− (result0, result') <- lift $ runWithReplace (runBehaviorWriterT a0) $ runBehaviorWriterT <$> a'
140− tellBehavior . join =<< hold (snd result0) (snd <$> result')
141− return (fst result0, fst <$> result')
142− traverseIntMapWithKeyWithAdjust = traverseIntMapWithKeyWithAdjustImpl traverseIntMapWithKeyWithAdjust
143− traverseDMapWithKeyWithAdjustWithMove = traverseDMapWithKeyWithAdjustImpl traverseDMapWithKeyWithAdjustWithMove mapPatchDMapWithMove weakenPatchDMapWithMoveWith
144−
145−traverseIntMapWithKeyWithAdjustImpl
146− :: forall t w v' p p' v m.
147− ( PatchTarget (p' (Behavior t w)) ~ IntMap (Behavior t w)
148− , Patch (p' (Behavior t w))
149− , Monoid w
150− , Reflex t
151− , MonadHold t m
152− , Functor p
153− , p ~ p'
154− )
155− => ( (IntMap.Key -> v -> m (v', Behavior t w))
156− -> IntMap v
157− -> Event t (p v)
158− -> m (IntMap (v', Behavior t w), Event t (p (v', Behavior t w)))
159− )
160− -> (IntMap.Key -> v -> BehaviorWriterT t w m v')
161− -> IntMap v
162− -> Event t (p v)
163− -> BehaviorWriterT t w m (IntMap v', Event t (p v'))
164−traverseIntMapWithKeyWithAdjustImpl base f (dm0 :: IntMap v) dm' = do
165− (result0, result') <- lift $ base (\k v -> runBehaviorWriterT $ f k v) dm0 dm'
166− let liftedResult0 = fmap fst result0
167− liftedResult' = fmap (fmap fst) result'
168− liftedWritten0 :: IntMap (Behavior t w)
169− liftedWritten0 = fmap snd result0
170− liftedWritten' = fmap (fmap snd) result'
171− i <- holdIncremental liftedWritten0 liftedWritten'
172− tellBehavior $ pull $ do
173− m <- sample $ currentIncremental i
174− mconcat . IntMap.elems <$> traverse sample m
175− return (liftedResult0, liftedResult')
176−
177−newtype BehaviorWriterTLoweredResult t w v a = BehaviorWriterTLoweredResult (v a, Behavior t w)
178−
179−traverseDMapWithKeyWithAdjustImpl
180− :: forall t w k v' p p' v m.
181− ( PatchTarget (p' (Some k) (Behavior t w)) ~ Map (Some k) (Behavior t w)
182− , Patch (p' (Some k) (Behavior t w))
183− , Monoid w
184− , Reflex t
185− , MonadHold t m
186− )
187− => ( (forall a. k a -> v a -> m (BehaviorWriterTLoweredResult t w v' a))
188− -> DMap k v
189− -> Event t (p k v)
190− -> m (DMap k (BehaviorWriterTLoweredResult t w v'), Event t (p k (BehaviorWriterTLoweredResult t w v')))
191− )
192− -> ((forall a. BehaviorWriterTLoweredResult t w v' a -> v' a) -> p k (BehaviorWriterTLoweredResult t w v') -> p k v')
193− -> ((forall a. BehaviorWriterTLoweredResult t w v' a -> Behavior t w) -> p k (BehaviorWriterTLoweredResult t w v') -> p' (Some k) (Behavior t w))
194− -> (forall a. k a -> v a -> BehaviorWriterT t w m (v' a))
195− -> DMap k v
196− -> Event t (p k v)
197− -> BehaviorWriterT t w m (DMap k v', Event t (p k v'))
198−traverseDMapWithKeyWithAdjustImpl base mapPatch weakenPatchWith f (dm0 :: DMap k v) dm' = do
199− (result0, result') <- lift $ base (\k v -> fmap BehaviorWriterTLoweredResult $ runBehaviorWriterT $ f k v) dm0 dm'
200− let getValue (BehaviorWriterTLoweredResult (v, _)) = v
201− getWritten (BehaviorWriterTLoweredResult (_, w)) = w
202− liftedResult0 = DMap.map getValue result0
203− liftedResult' = ffor result' $ mapPatch getValue
204− liftedWritten0 :: Map (Some k) (Behavior t w)
205− liftedWritten0 = weakenDMapWith getWritten result0
206− liftedWritten' = ffor result' $ weakenPatchWith getWritten
207− i <- holdIncremental liftedWritten0 liftedWritten'
208− tellBehavior $ pull $ do
209− m <- sample $ currentIncremental i
210− mconcat . Map.elems <$> traverse sample m
211− return (liftedResult0, liftedResult')
src/Reflex/BehaviorWriter/Class.hsdeleted−31
@@ -1,31 +0,0 @@
1−{-|
2−Module: Reflex.BehaviorWriter.Class
3−Description: This module defines the 'BehaviorWriter' class
4−-}
5−{-# LANGUAGE CPP #-}
6−{-# LANGUAGE ConstraintKinds #-}
7−{-# LANGUAGE FlexibleInstances #-}
8−{-# LANGUAGE FunctionalDependencies #-}
9−{-# LANGUAGE UndecidableInstances #-}
10−#ifdef USE_REFLEX_OPTIMIZER
11−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
12−#endif
13−module Reflex.BehaviorWriter.Class
14− ( MonadBehaviorWriter
15− , BehaviorWriter(..)
16− ) where
17−
18−import Control.Monad.Reader (ReaderT, lift)
19−import Reflex.Class (Behavior)
20−
21−{-# DEPRECATED MonadBehaviorWriter "Use 'BehaviorWriter' instead" #-}
22−-- | Type synonym for 'BehaviorWriter'
23−type MonadBehaviorWriter = BehaviorWriter
24−
25−-- | 'BehaviorWriter' efficiently collects 'Behavior' values using 'tellBehavior'
26−-- and combines them monoidally to provide a 'Behavior' result.
27−class (Monad m, Monoid w) => BehaviorWriter t w m | m -> t w where
28− tellBehavior :: Behavior t w -> m ()
29−
30−instance BehaviorWriter t w m => BehaviorWriter t w (ReaderT r m) where
31− tellBehavior = lift . tellBehavior
src/Reflex/Class.hs+343−780
@@ -1,14 +1,12 @@
1−{-# LANGUAGE BangPatterns #-}
21{-# LANGUAGE CPP #-}
3−{-# LANGUAGE ConstraintKinds #-}
42{-# LANGUAGE DefaultSignatures #-}
53{-# LANGUAGE FlexibleContexts #-}
64{-# LANGUAGE FlexibleInstances #-}
75{-# LANGUAGE FunctionalDependencies #-}
86{-# LANGUAGE GADTs #-}
97{-# LANGUAGE LambdaCase #-}
8+{-# LANGUAGE MultiParamTypeClasses #-}
109{-# LANGUAGE NoMonomorphismRestriction #-}
11−{-# LANGUAGE PolyKinds #-}
1210{-# LANGUAGE RankNTypes #-}
1311{-# LANGUAGE RecursiveDo #-}
1412{-# LANGUAGE RoleAnnotations #-}
@@ -16,56 +14,45 @@
1614{-# LANGUAGE TypeFamilies #-}
1715{-# LANGUAGE TypeOperators #-}
1816{-# LANGUAGE UndecidableInstances #-}
19−{-# LANGUAGE Trustworthy #-}
2017#ifdef USE_REFLEX_OPTIMIZER
2118{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
2219#endif
20+#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
21+{-# LANGUAGE EmptyDataDecls #-}
22+{-# OPTIONS_GHC -Wno-redundant-constraints #-}
23+#endif
2324
24−-- |
25−-- Module:
26−-- Reflex.Class
27−-- Description:
28−-- This module contains the Reflex interface, as well as a variety of
29−-- convenience functions for working with 'Event's, 'Behavior's, and other
30−-- signals.
25+-- | This module contains the Reflex interface, as well as a variety of
26+-- convenience functions for working with 'Event's, 'Behavior's, and other
27+-- signals.
3128module Reflex.Class
32− ( module Data.Patch
29+ ( module Reflex.Patch
3330 -- * Primitives
3431 , Reflex (..)
3532 , mergeInt
3633 , coerceBehavior
3734 , coerceEvent
3835 , coerceDynamic
39− , coerceIncremental
4036 , MonadSample (..)
4137 , MonadHold (..)
42− -- ** 'fan' related types
38+ -- ** 'fan'-related types
4339 , EventSelector (..)
44− , EventSelectorG (..)
4540 , EventSelectorInt (..)
41+ -- ** 'Incremental'-related types
4642 -- * Convenience functions
4743 , constDyn
4844 , pushAlways
4945 -- ** Combining 'Event's
5046 , leftmost
51− , merge
52− , mergeIncremental
53− , mergeIncrementalWithMove
5447 , mergeMap
55− , mergeIntMap
5648 , mergeMapIncremental
5749 , mergeMapIncrementalWithMove
58− , mergeIntMapIncremental
59− , coincidencePatchMap
60− , coincidencePatchMapWithMove
61− , coincidencePatchIntMap
6250 , mergeList
6351 , mergeWith
6452 , difference
6553 , alignEventWithMaybe
6654 -- ** Breaking up 'Event's
6755 , splitE
68− , fan
6956 , fanEither
7057 , fanThese
7158 , fanMap
@@ -73,16 +60,11 @@ module Reflex.Class
7360 , EitherTag (..)
7461 , eitherToDSum
7562 , dsumToEither
76− , factorEvent
77− , filterEventKey
78− -- ** Collapsing 'Event . Event'
79− , switchHold
80− , switchHoldPromptly
81− , switchHoldPromptOnly
82− , switchHoldPromptOnlyIncremental
63+ -- ** Switching between 'Event's
64+ , switchPromptly
65+ , switchPromptOnly
8366 -- ** Using 'Event's to sample 'Behavior's
8467 , tag
85− , tagMaybe
8668 , attach
8769 , attachWith
8870 , attachWithMaybe
@@ -90,7 +72,6 @@ module Reflex.Class
9072 , gate
9173 -- ** Combining 'Dynamic's
9274 , distributeDMapOverDynPure
93− , distributeDMapOverDynPureG
9475 , distributeListOverDyn
9576 , distributeListOverDynWith
9677 , zipDyn
@@ -117,14 +98,6 @@ module Reflex.Class
11798 , mapAccumM_
11899 , mapAccumMaybe_
119100 , mapAccumMaybeM_
120− , accumIncremental
121− , accumMIncremental
122− , accumMaybeIncremental
123− , accumMaybeMIncremental
124− , mapAccumIncremental
125− , mapAccumMIncremental
126− , mapAccumMaybeIncremental
127− , mapAccumMaybeMIncremental
128101 , zipListWithEvent
129102 , numberOccurrences
130103 , numberOccurrencesFrom
@@ -134,9 +107,6 @@ module Reflex.Class
134107 , tailE
135108 , headTailE
136109 , takeWhileE
137− , takeWhileJustE
138− , dropWhileE
139− , takeDropWhileJustE
140110 , switcher
141111 -- * Debugging functions
142112 , traceEvent
@@ -144,24 +114,23 @@ module Reflex.Class
144114 -- * Unsafe functions
145115 , unsafeDynamic
146116 , unsafeMapIncremental
147− -- * 'Filterable' convenience functions
148− , FunctorMaybe -- fmapMaybe is purposely not exported from deprecated 'FunctorMaybe' and the new alias is exported instead
149− , mapMaybe -- Re-exported for convenience
150− , fmapMaybe
117+ -- * 'FunctorMaybe'
118+ , FunctorMaybe (..)
151119 , fforMaybe
152120 , ffilter
153121 , filterLeft
154122 , filterRight
155123 -- * Miscellaneous convenience functions
156124 , ffor
157− , ffor2
158− , ffor3
125+ , MonadAdjust (..)
126+ , sequenceDMapWithAdjust
127+ , sequenceDMapWithAdjustWithMove
128+ , mapMapWithAdjustWithMove
159129 -- * Deprecated functions
160− , switchPromptly
161− , switchPromptOnly
162− -- * "Cheap" functions
130+ , appendEvents
131+ , onceE
132+ , sequenceThese
163133 , fmapMaybeCheap
164− , mapMaybeCheap
165134 , fmapCheap
166135 , fforCheap
167136 , fforMaybeCheap
@@ -171,63 +140,97 @@ module Reflex.Class
171140 , mergeWithCheap'
172141 -- * Slow, but general, implementations
173142 , slowHeadE
174− ) where
175−
176−#ifdef MIN_VERSION_semialign
177−import Prelude hiding (zip, zipWith)
178−
179−#if MIN_VERSION_these(0,8,0)
180−import Data.These.Combinators (justThese)
181−#endif
182−#if MIN_VERSION_semialign(1,1,0)
183−import Data.Zip (Zip (..), Unzip (..))
184−#endif
143+#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
144+ , Spider
145+ , SpiderEnv
146+ , SpiderTimeline
147+ , Global
148+ , Behavior (..)
149+ , Event (..)
150+ , Dynamic (..)
151+ , Incremental (..)
152+ , never
153+ , constant
154+ , push
155+ , pushCheap
156+ , pull
157+ , merge
158+ , fan
159+ , switch
160+ , coincidence
161+ , current
162+ , updated
163+ , unsafeBuildDynamic
164+ , unsafeBuildIncremental
165+ , mergeIncremental
166+ , mergeIncrementalWithMove
167+ , currentIncremental
168+ , updatedIncremental
169+ , incrementalToDynamic
170+ , behaviorCoercion
171+ , eventCoercion
172+ , dynamicCoercion
185173#endif
174+ ) where
186175
187176import Control.Applicative
188−import Control.Monad.Identity
189−import Control.Monad.Reader
190−import Control.Monad.State.Strict
191−import Control.Monad.Trans.Cont (ContT)
192−import Control.Monad.Trans.Except (ExceptT)
193−import Control.Monad.Trans.RWS (RWST)
194−import Control.Monad.Trans.Writer (WriterT)
177+import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
178+import Control.Monad.Reader hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
179+import Control.Monad.State.Strict hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
180+import Control.Monad.Trans.Cont (ContT ())
181+import Control.Monad.Trans.Except (ExceptT ())
182+import Control.Monad.Trans.RWS (RWST ())
183+import Control.Monad.Trans.Writer (WriterT ())
195184import Data.Align
196185import Data.Bifunctor
197186import Data.Coerce
198187import Data.Default
199−import Data.Dependent.Map (DMap)
200−import Data.Dependent.Sum (DSum (..))
188+import Data.Dependent.Map (DMap, DSum (..), GCompare (..))
201189import qualified Data.Dependent.Map as DMap
202−import Data.Functor.Compose
203−import Data.Functor.Product
204−import Data.GADT.Compare (GEq (..), GCompare (..))
205−import Data.FastMutableIntMap (PatchIntMap)
190+import Data.Either
206191import Data.Foldable
207−import Data.Functor.Bind
192+import Data.Functor.Bind hiding (join)
193+import qualified Data.Functor.Bind as Bind
194+import Data.Functor.Constant
208195import Data.Functor.Misc
209196import Data.Functor.Plus
210197import Data.IntMap.Strict (IntMap)
211198import qualified Data.IntMap.Strict as IntMap
212199import Data.List.NonEmpty (NonEmpty (..))
213200import Data.Map (Map)
214−import Data.Semigroup (Semigroup (..))
215−import Data.Some (Some(Some))
201+import Data.Maybe
202+import Data.Monoid hiding (Alt, (<>))
203+import Data.Semigroup (Semigroup, sconcat, stimes, (<>))
216204import Data.String
217205import Data.These
206+import Data.Traversable
218207import Data.Type.Coercion
219−import Data.Type.Equality ((:~:) (..))
220−import Data.Witherable (Filterable(..))
221−import qualified Data.Witherable as W
222−import Reflex.FunctorMaybe (FunctorMaybe)
223−import qualified Reflex.FunctorMaybe
224−import Data.Patch
225−import qualified Data.Patch.MapWithMove as PatchMapWithMove
208+import Reflex.FunctorMaybe
209+import Reflex.Patch
210+import Data.FastMutableIntMap (PatchIntMap)
211+
212+#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
213+import Reflex.Spider.Internal (EventM, Global, HasSpiderTimeline, SpiderHost (..), SpiderHostFrame (..),
214+ SpiderPullM, SpiderPushM (..), behaviorHoldIdentity, dynamicConst,
215+ dynamicCurrent, dynamicDynIdentity, dynamicHold, dynamicHoldIdentity,
216+ dynamicUpdated, newMapDyn, readBehaviorTracked, readBehaviorUntracked,
217+ runFrame, runSpiderHostFrame)
218+import qualified Reflex.Spider.Internal
219+import qualified Reflex.Spider.Internal as S
220+import Unsafe.Coerce
221+#endif
222+
223+-- Note: must come last to silence warnings due to AMP on GHC < 7.10
224+import Prelude hiding (foldl, mapM, mapM_, sequence, sequence_)
226225
227226import Debug.Trace (trace)
228227
228+#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
229+#include "Spider/SpiderTimeline.include.hs"
230+#endif
231+
229232-- | The 'Reflex' class contains all the primitive functionality needed for
230−-- Functional Reactive Programming (FRP). The @/t/@ type parameter indicates
233+-- Functional Reactive Programming (FRP). The @t@ type parameter indicates
231234-- which "timeline" is in use. Timelines are fully-independent FRP contexts,
232235-- and the type of the timeline determines the FRP engine to be used. For most
233236-- purposes, the 'Reflex.Spider' implementation is recommended.
@@ -237,6 +240,9 @@ class ( MonadHold t (PushM t)
237240 , Functor (Dynamic t)
238241 , Applicative (Dynamic t) -- Necessary for GHC <= 7.8
239242 , Monad (Dynamic t)
243+#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
244+ , t ~ SpiderTimeline Global
245+#endif
240246 ) => Reflex t where
241247 -- | A container for a value that can change over time. 'Behavior's can be
242248 -- sampled at will, but it is not possible to be notified when they change
@@ -259,6 +265,7 @@ class ( MonadHold t (PushM t)
259265 type PushM t :: * -> *
260266 -- | A monad for doing complex pull-based calculations efficiently
261267 type PullM t :: * -> *
268+#ifndef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
262269 -- | An 'Event' with no occurrences
263270 never :: Event t a
264271 -- | Create a 'Behavior' that always has the given value
@@ -273,23 +280,18 @@ class ( MonadHold t (PushM t)
273280 -- recomputed whenever any of the read 'Behavior's changes
274281 pull :: PullM t a -> Behavior t a
275282 -- | Merge a collection of events; the resulting 'Event' will only occur if at
276− -- least one input event is occurring, and will contain all of the input keys
283+ -- least one input event is occuring, and will contain all of the input keys
277284 -- that are occurring simultaneously
278−
279− --TODO: Generalize to get rid of DMap use --TODO: Provide a type-level guarantee that the result is not empty
280− mergeG :: GCompare k => (forall a. q a -> Event t (v a))
281− -> DMap k q -> Event t (DMap k v)
282−
283− -- | Efficiently fan-out an event to many destinations. You should save the
284− -- result in a @let@-binding, and then repeatedly 'selectG' on the result to
285− -- create child events
286− fanG :: GCompare k => Event t (DMap k v) -> EventSelectorG t k v
287−
285+ merge :: GCompare k => DMap k (Event t) -> Event t (DMap k Identity) --TODO: Generalize to get rid of DMap use --TODO: Provide a type-level guarantee that the result is not empty
286+ -- | Efficiently fan-out an event to many destinations. This function should
287+ -- be partially applied, and then the result applied repeatedly to create
288+ -- child events
289+ fan :: GCompare k => Event t (DMap k Identity) -> EventSelector t k --TODO: Can we help enforce the partial application discipline here? The combinator is worthless without it
288290 -- | Create an 'Event' that will occur whenever the currently-selected input
289291 -- 'Event' occurs
290292 switch :: Behavior t (Event t a) -> Event t a
291− -- | Create an 'Event' that will occur whenever the input event is occurring -- and its occurrence value, another 'Event', is also occurring.
292− -- You maybe looking for '@switchHold@ @never@' instead.
293+ -- | Create an 'Event' that will occur whenever the input event is occurring
294+ -- and its occurrence value, another 'Event', is also occurring
293295 coincidence :: Event t (Event t a) -> Event t a
294296 -- | Extract the 'Behavior' of a 'Dynamic'.
295297 current :: Dynamic t a -> Behavior t a
@@ -298,19 +300,14 @@ class ( MonadHold t (PushM t)
298300 -- | Create a new 'Dynamic'. The given 'PullM' must always return the most
299301 -- recent firing of the given 'Event', if any.
300302 unsafeBuildDynamic :: PullM t a -> Event t a -> Dynamic t a
301− -- | Create a new 'Incremental'. The given "PullM"'s value must always change
303+ -- | Create a new 'Incremental'. The given 'PullM''s value must always change
302304 -- in the same way that the accumulated application of patches would change
303305 -- that value.
304306 unsafeBuildIncremental :: Patch p => PullM t (PatchTarget p) -> Event t p -> Incremental t p
305307 -- | Create a merge whose parents can change over time
306− mergeIncrementalG :: GCompare k
307− => (forall a. q a -> Event t (v a))
308− -> Incremental t (PatchDMap k q)
309− -> Event t (DMap k v)
308+ mergeIncremental :: GCompare k => Incremental t (PatchDMap k (Event t)) -> Event t (DMap k Identity)
310309 -- | Experimental: Create a merge whose parents can change over time; changing the key of an Event is more efficient than with mergeIncremental
311− mergeIncrementalWithMoveG :: GCompare k
312− => (forall a. q a -> Event t (v a))
313− -> Incremental t (PatchDMapWithMove k q) -> Event t (DMap k v)
310+ mergeIncrementalWithMove :: GCompare k => Incremental t (PatchDMapWithMove k (Event t)) -> Event t (DMap k Identity)
314311 -- | Extract the 'Behavior' component of an 'Incremental'
315312 currentIncremental :: Patch p => Incremental t p -> Behavior t (PatchTarget p)
316313 -- | Extract the 'Event' component of an 'Incremental'
@@ -326,31 +323,86 @@ class ( MonadHold t (PushM t)
326323 -- | Construct a 'Coercion' for a 'Dynamic' given an 'Coercion' for its
327324 -- occurrence type
328325 dynamicCoercion :: Coercion a b -> Coercion (Dynamic t a) (Dynamic t b)
329− -- | Construct a 'Coercion' for an 'Incremental' given 'Coercion's for its
330− -- patch target and patch types.
331− incrementalCoercion
332− :: Coercion (PatchTarget a) (PatchTarget b) -> Coercion a b -> Coercion (Incremental t a) (Incremental t b)
333326 mergeIntIncremental :: Incremental t (PatchIntMap (Event t a)) -> Event t (IntMap a)
334327 fanInt :: Event t (IntMap a) -> EventSelectorInt t a
335−
336−-- | Efficiently fan-out an event to many destinations. You should save the
337−-- result in a @let@-binding, and then repeatedly 'select' on the result to
338−-- create child events
339−fan :: forall t k. (Reflex t, GCompare k)
340− => Event t (DMap k Identity) -> EventSelector t k
341− --TODO: Can we help enforce the partial application discipline here? The combinator is worthless without it
342−fan e = EventSelector (fixup (selectG (fanG e) :: k a -> Event t (Identity a)) :: forall a. k a -> Event t a)
343− where
344− fixup :: forall a. (k a -> Event t (Identity a)) -> k a -> Event t a
345− fixup = case eventCoercion Coercion :: Coercion (Event t (Identity a)) (Event t a) of
346− Coercion -> coerce
328+#endif
347329
348330--TODO: Specialize this so that we can take advantage of knowing that there's no changing going on
349−-- | Constructs a single 'Event' out of a map of events. The output event may fire with multiple
350−-- keys simultaneously.
351331mergeInt :: Reflex t => IntMap (Event t a) -> Event t (IntMap a)
352332mergeInt m = mergeIntIncremental $ unsafeBuildIncremental (return m) never
353333
334+#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
335+instance t ~ SpiderTimeline Global => Reflex t where
336+ newtype Behavior t a = SpiderBehavior { unSpiderBehavior :: Reflex.Spider.Internal.Behavior Global a }
337+ newtype Event t a = SpiderEvent { unSpiderEvent :: Reflex.Spider.Internal.Event Global a }
338+ newtype Dynamic t a = SpiderDynamic { unSpiderDynamic :: Reflex.Spider.Internal.Dynamic Global (Identity a) } -- deriving (Functor, Applicative, Monad)
339+ newtype Incremental t p = SpiderIncremental { unSpiderIncremental :: Reflex.Spider.Internal.Dynamic Global p }
340+ type PullM t = SpiderPullM Global
341+ type PushM t = SpiderPushM Global
342+never :: Reflex t => Event t a
343+constant :: Reflex t => a -> Behavior t a
344+push :: Reflex t => (a -> PushM t (Maybe b)) -> Event t a -> Event t b
345+pushCheap :: Reflex t => (a -> PushM t (Maybe b)) -> Event t a -> Event t b
346+pull :: Reflex t => PullM t a -> Behavior t a
347+merge :: (Reflex t, GCompare k) => DMap k (Event t) -> Event t (DMap k Identity)
348+fan :: (Reflex t, GCompare k) => Event t (DMap k Identity) -> EventSelector t k
349+switch :: Reflex t => Behavior t (Event t a) -> Event t a
350+coincidence :: Reflex t => Event t (Event t a) -> Event t a
351+current :: Reflex t => Dynamic t a -> Behavior t a
352+updated :: Reflex t => Dynamic t a -> Event t a
353+unsafeBuildDynamic :: Reflex t => PullM t a -> Event t a -> Dynamic t a
354+unsafeBuildIncremental :: (Reflex t, Patch p) => PullM t (PatchTarget p) -> Event t p -> Incremental t p
355+mergeIncremental :: (Reflex t, GCompare k) => Incremental t (PatchDMap k (Event t)) -> Event t (DMap k Identity)
356+mergeIncrementalWithMove :: (Reflex t, GCompare k) => Incremental t (PatchDMapWithMove k (Event t)) -> Event t (DMap k Identity)
357+currentIncremental :: (Reflex t, Patch p) => Incremental t p -> Behavior t (PatchTarget p)
358+updatedIncremental :: (Reflex t, Patch p) => Incremental t p -> Event t p
359+incrementalToDynamic :: (Reflex t, Patch p) => Incremental t p -> Dynamic t (PatchTarget p)
360+behaviorCoercion :: Reflex t => Coercion a b -> Coercion (Behavior t a) (Behavior t b)
361+eventCoercion :: Reflex t => Coercion a b -> Coercion (Event t a) (Event t b)
362+dynamicCoercion :: Reflex t => Coercion a b -> Coercion (Dynamic t a) (Dynamic t b)
363+{-# INLINE never #-}
364+never = SpiderEvent S.eventNever
365+{-# INLINE constant #-}
366+constant = SpiderBehavior . S.behaviorConst
367+{-# INLINE push #-}
368+push f = SpiderEvent . S.push (coerce f) . unSpiderEvent
369+{-# INLINE pushCheap #-}
370+pushCheap f = SpiderEvent . S.pushCheap (coerce f) . unSpiderEvent
371+{-# INLINE pull #-}
372+pull = SpiderBehavior . S.pull . coerce
373+{-# INLINE merge #-}
374+merge = SpiderEvent . S.merge . S.dynamicConst . (coerce :: DMap k (Event (SpiderTimeline x)) -> DMap k (S.Event x))
375+{-# INLINE fan #-}
376+fan e = EventSelector $ SpiderEvent . S.select (S.fan (unSpiderEvent e))
377+{-# INLINE switch #-}
378+switch = SpiderEvent . S.switch . (coerce :: S.Behavior x (Event (SpiderTimeline x) a) -> S.Behavior x (S.Event x a)) . unSpiderBehavior
379+{-# INLINE coincidence #-}
380+coincidence = SpiderEvent . S.coincidence . (coerce :: S.Event x (Event (SpiderTimeline x) a) -> S.Event x (S.Event x a)) . unSpiderEvent
381+{-# INLINE current #-}
382+current = SpiderBehavior . S.dynamicCurrent . unSpiderDynamic
383+{-# INLINE updated #-}
384+updated = coerceEvent . SpiderEvent . dynamicUpdated . unSpiderDynamic
385+{-# INLINE unsafeBuildDynamic #-}
386+unsafeBuildDynamic readV0 v' = SpiderDynamic $ dynamicDynIdentity $ S.unsafeBuildDynamic (coerce readV0) $ coerce $ unSpiderEvent v'
387+{-# INLINE unsafeBuildIncremental #-}
388+unsafeBuildIncremental readV0 dv = SpiderIncremental $ S.dynamicDyn $ S.unsafeBuildDynamic (coerce readV0) $ unSpiderEvent dv
389+{-# INLINE mergeIncremental #-}
390+mergeIncremental = SpiderEvent . S.merge . (unsafeCoerce :: S.Dynamic x (PatchDMap k (Event (SpiderTimeline x))) -> S.Dynamic x (PatchDMap k (S.Event x))) . unSpiderIncremental
391+{-# INLINE mergeIncrementalWithMove #-}
392+mergeIncrementalWithMove = SpiderEvent . S.mergeWithMove . (unsafeCoerce :: S.Dynamic x (PatchDMapWithMove k (Event (SpiderTimeline x))) -> S.Dynamic x (PatchDMapWithMove k (S.Event x))) . unSpiderIncremental
393+{-# INLINE currentIncremental #-}
394+currentIncremental = SpiderBehavior . dynamicCurrent . unSpiderIncremental
395+{-# INLINE updatedIncremental #-}
396+updatedIncremental = SpiderEvent . dynamicUpdated . unSpiderIncremental
397+{-# INLINE incrementalToDynamic #-}
398+incrementalToDynamic (SpiderIncremental i) = SpiderDynamic $ dynamicDynIdentity $ S.unsafeBuildDynamic (readBehaviorUntracked $ dynamicCurrent i) $ flip S.push (dynamicUpdated i) $ \p -> do
399+ c <- readBehaviorUntracked $ dynamicCurrent i
400+ return $ Identity <$> apply p c
401+eventCoercion Coercion = Coercion
402+behaviorCoercion Coercion = Coercion
403+dynamicCoercion = unsafeCoerce
404+#endif
405+
354406-- | Coerce a 'Behavior' between representationally-equivalent value types
355407coerceBehavior :: (Reflex t, Coercible a b) => Behavior t a -> Behavior t b
356408coerceBehavior = coerceWith $ behaviorCoercion Coercion
@@ -363,14 +415,8 @@ coerceEvent = coerceWith $ eventCoercion Coercion
363415coerceDynamic :: (Reflex t, Coercible a b) => Dynamic t a -> Dynamic t b
364416coerceDynamic = coerceWith $ dynamicCoercion Coercion
365417
366−-- | Coerce an 'Incremental' between representationally-equivalent value types
367−coerceIncremental
368− :: (Reflex t, Coercible a b, Coercible (PatchTarget a) (PatchTarget b))
369− => Incremental t a -> Incremental t b
370−coerceIncremental = coerceWith $ incrementalCoercion Coercion Coercion
371−
372418-- | Construct a 'Dynamic' from a 'Behavior' and an 'Event'. The 'Behavior'
373−-- __must__ change when and only when the 'Event' fires, such that the
419+-- _must_ change when and only when the 'Event' fires, such that the
374420-- 'Behavior''s value is always equal to the most recent firing of the 'Event';
375421-- if this is not the case, the resulting 'Dynamic' will behave
376422-- nondeterministically.
@@ -398,7 +444,7 @@ class MonadSample t m => MonadHold t m where
398444 -- value and will be updated whenever the given 'Event' occurs. The update
399445 -- takes effect immediately after the 'Event' occurs; if the occurrence that
400446 -- sets the 'Behavior' (or one that is simultaneous with it) is used to sample
401− -- the 'Behavior', it will see the __old__ value of the 'Behavior', not the new
447+ -- the 'Behavior', it will see the _old_ value of the 'Behavior', not the new
402448 -- one.
403449 hold :: a -> Event t a -> m (Behavior t a)
404450 default hold :: (m ~ f m', MonadTrans f, MonadHold t m') => a -> Event t a -> m (Behavior t a)
@@ -413,118 +459,16 @@ class MonadSample t m => MonadHold t m where
413459 holdIncremental :: Patch p => PatchTarget p -> Event t p -> m (Incremental t p)
414460 default holdIncremental :: (Patch p, m ~ f m', MonadTrans f, MonadHold t m') => PatchTarget p -> Event t p -> m (Incremental t p)
415461 holdIncremental v0 = lift . holdIncremental v0
416− buildDynamic :: PushM t a -> Event t a -> m (Dynamic t a)
462+ buildDynamic :: PullM t a -> Event t a -> m (Dynamic t a)
417463 {-
418464 default buildDynamic :: (m ~ f m', MonadTrans f, MonadHold t m') => PullM t a -> Event t a -> m (Dynamic t a)
419465 buildDynamic getV0 = lift . buildDynamic getV0
420466 -}
421− -- | Create a new 'Event' that only occurs only once, on the first occurrence of
467+ -- | Create a new 'Event' that only occurs only once, on the first occurence of
422468 -- the supplied 'Event'.
423469 headE :: Event t a -> m (Event t a)
424− -- | An event which only occurs at the current moment in time, such that:
425− --
426− -- > coincidence (pushAlways (\a -> (a <$) <$> now) e) = e
427− --
428− now :: m (Event t ())
429− default now :: (m ~ f m', MonadTrans f, MonadHold t m') => m (Event t ())
430− now = lift now
431−
432−-- | Accumulate an 'Incremental' with the supplied initial value and the firings of the provided 'Event',
433−-- using the combining function to produce a patch.
434−accumIncremental
435− :: (Reflex t, Patch p, MonadHold t m, MonadFix m)
436− => (PatchTarget p -> b -> p)
437− -> PatchTarget p
438− -> Event t b
439− -> m (Incremental t p)
440−accumIncremental f = accumMaybeIncremental $ \v o -> Just $ f v o
441−
442−-- | Similar to 'accumIncremental' but the combining function runs in 'PushM'
443−accumMIncremental
444− :: (Reflex t, Patch p, MonadHold t m, MonadFix m)
445− => (PatchTarget p -> b -> PushM t p)
446− -> PatchTarget p
447− -> Event t b
448− -> m (Incremental t p)
449−accumMIncremental f = accumMaybeMIncremental $ \v o -> Just <$> f v o
450−
451−-- | Similar to 'accumIncremental' but allows filtering of updates (by dropping updates when the
452−-- combining function produces @Nothing@)
453−accumMaybeIncremental
454− :: (Reflex t, Patch p, MonadHold t m, MonadFix m)
455− => (PatchTarget p -> b -> Maybe p)
456− -> PatchTarget p
457− -> Event t b
458− -> m (Incremental t p)
459−accumMaybeIncremental f = accumMaybeMIncremental $ \v o -> return $ f v o
460−
461−-- | Similar to 'accumMaybeMIncremental' but the combining function runs in 'PushM'
462−accumMaybeMIncremental
463− :: (Reflex t, Patch p, MonadHold t m, MonadFix m)
464− => (PatchTarget p -> b -> PushM t (Maybe p))
465− -> PatchTarget p
466− -> Event t b
467− -> m (Incremental t p)
468−accumMaybeMIncremental f z e = do
469− rec let e' = flip push e $ \o -> do
470− v <- sample $ currentIncremental d'
471− f v o
472− d' <- holdIncremental z e'
473− return d'
474470
475−-- | Accumulate an 'Incremental' by folding occurrences of an 'Event'
476−-- with a function that both accumulates and produces a value to fire
477−-- as an 'Event'. Returns both the accumulated value and the constructed
478−-- 'Event'.
479−mapAccumIncremental
480− :: (Reflex t, Patch p, MonadHold t m, MonadFix m)
481− => (PatchTarget p -> b -> (p, c))
482− -> PatchTarget p
483− -> Event t b
484− -> m (Incremental t p, Event t c)
485−mapAccumIncremental f = mapAccumMaybeIncremental $ \v o -> bimap Just Just $ f v o
486−
487−-- | Like 'mapAccumIncremental' but the combining function runs in 'PushM'
488−mapAccumMIncremental
489− :: (Reflex t, Patch p, MonadHold t m, MonadFix m)
490− => (PatchTarget p -> b -> PushM t (p, c))
491− -> PatchTarget p
492− -> Event t b
493− -> m (Incremental t p, Event t c)
494−mapAccumMIncremental f = mapAccumMaybeMIncremental $ \v o -> bimap Just Just <$> f v o
495−
496−-- | Accumulate an 'Incremental' by folding occurrences of an 'Event' with
497−-- a function that both optionally accumulates and optionally produces
498−-- a value to fire as a separate output 'Event'.
499−-- Note that because 'Nothing's are discarded in both cases, the output
500−-- 'Event' may fire even though the output 'Incremental' has not changed, and
501−-- the output 'Incremental' may update even when the output 'Event' is not firing.
502−mapAccumMaybeIncremental
503− :: (Reflex t, Patch p, MonadHold t m, MonadFix m)
504− => (PatchTarget p -> b -> (Maybe p, Maybe c))
505− -> PatchTarget p
506− -> Event t b
507− -> m (Incremental t p, Event t c)
508−mapAccumMaybeIncremental f = mapAccumMaybeMIncremental $ \v o -> return $ f v o
509−
510−-- | Like 'mapAccumMaybeIncremental' but the combining function is a 'PushM' action
511−mapAccumMaybeMIncremental
512− :: (Reflex t, Patch p, MonadHold t m, MonadFix m)
513− => (PatchTarget p -> b -> PushM t (Maybe p, Maybe c))
514− -> PatchTarget p
515− -> Event t b
516− -> m (Incremental t p, Event t c)
517−mapAccumMaybeMIncremental f z e = do
518− rec let e' = flip push e $ \o -> do
519− v <- sample $ currentIncremental d'
520− result <- f v o
521− return $ case result of
522− (Nothing, Nothing) -> Nothing
523− _ -> Just result
524− d' <- holdIncremental z $ mapMaybe fst e'
525− return (d', mapMaybe snd e')
526471
527−-- | A somewhat slow implementation of 'headE'
528472slowHeadE :: (Reflex t, MonadHold t m, MonadFix m) => Event t a -> m (Event t a)
529473slowHeadE e = do
530474 rec be <- hold e $ fmapCheap (const never) e'
@@ -533,31 +477,18 @@ slowHeadE e = do
533477
534478-- | An 'EventSelector' allows you to efficiently 'select' an 'Event' based on a
535479-- key. This is much more efficient than filtering for each key with
536−-- 'mapMaybe'.
480+-- 'fmapMaybe'.
537481newtype EventSelector t k = EventSelector
538482 { -- | Retrieve the 'Event' for the given key. The type of the 'Event' is
539483 -- determined by the type of the key, so this can be used to fan-out
540484 -- 'Event's whose sub-'Event's have different types.
541485 --
542486 -- Using 'EventSelector's and the 'fan' primitive is far more efficient than
543− -- (but equivalent to) using 'mapMaybe' to select only the relevant
487+ -- (but equivalent to) using 'fmapMaybe' to select only the relevant
544488 -- occurrences of an 'Event'.
545489 select :: forall a. k a -> Event t a
546490 }
547491
548−newtype EventSelectorG t k v = EventSelectorG
549− { -- | Retrieve the 'Event' for the given key. The type of the 'Event' is
550− -- determined by the type of the key, so this can be used to fan-out
551− -- 'Event's whose sub-'Event's have different types.
552− --
553− -- Using 'EventSelector's and the 'fan' primitive is far more efficient than
554− -- (but equivalent to) using 'mapMaybe' to select only the relevant
555− -- occurrences of an 'Event'.
556− selectG :: forall a. k a -> Event t (v a)
557− }
558−
559−-- | Efficiently select an 'Event' keyed on 'Int'. This is more efficient than manually
560−-- filtering by key.
561492newtype EventSelectorInt t a = EventSelectorInt { selectInt :: Int -> Event t a }
562493
563494--------------------------------------------------------------------------------
@@ -573,7 +504,6 @@ instance MonadHold t m => MonadHold t (ReaderT r m) where
573504 holdIncremental a0 = lift . holdIncremental a0
574505 buildDynamic a0 = lift . buildDynamic a0
575506 headE = lift . headE
576− now = lift now
577507
578508instance (MonadSample t m, Monoid r) => MonadSample t (WriterT r m) where
579509 sample = lift . sample
@@ -584,7 +514,6 @@ instance (MonadHold t m, Monoid r) => MonadHold t (WriterT r m) where
584514 holdIncremental a0 = lift . holdIncremental a0
585515 buildDynamic a0 = lift . buildDynamic a0
586516 headE = lift . headE
587− now = lift now
588517
589518instance MonadSample t m => MonadSample t (StateT s m) where
590519 sample = lift . sample
@@ -595,7 +524,6 @@ instance MonadHold t m => MonadHold t (StateT s m) where
595524 holdIncremental a0 = lift . holdIncremental a0
596525 buildDynamic a0 = lift . buildDynamic a0
597526 headE = lift . headE
598− now = lift now
599527
600528instance MonadSample t m => MonadSample t (ExceptT e m) where
601529 sample = lift . sample
@@ -606,7 +534,6 @@ instance MonadHold t m => MonadHold t (ExceptT e m) where
606534 holdIncremental a0 = lift . holdIncremental a0
607535 buildDynamic a0 = lift . buildDynamic a0
608536 headE = lift . headE
609− now = lift now
610537
611538instance (MonadSample t m, Monoid w) => MonadSample t (RWST r w s m) where
612539 sample = lift . sample
@@ -617,7 +544,6 @@ instance (MonadHold t m, Monoid w) => MonadHold t (RWST r w s m) where
617544 holdIncremental a0 = lift . holdIncremental a0
618545 buildDynamic a0 = lift . buildDynamic a0
619546 headE = lift . headE
620− now = lift now
621547
622548instance MonadSample t m => MonadSample t (ContT r m) where
623549 sample = lift . sample
@@ -628,7 +554,6 @@ instance MonadHold t m => MonadHold t (ContT r m) where
628554 holdIncremental a0 = lift . holdIncremental a0
629555 buildDynamic a0 = lift . buildDynamic a0
630556 headE = lift . headE
631− now = lift now
632557
633558--------------------------------------------------------------------------------
634559-- Convenience functions
@@ -643,14 +568,6 @@ pushAlways f = push (fmap Just . f)
643568ffor :: Functor f => f a -> (a -> b) -> f b
644569ffor = flip fmap
645570
646−-- | Rotated version of 'liftA2'.
647−ffor2 :: Applicative f => f a -> f b -> (a -> b -> c) -> f c
648−ffor2 a b f = liftA2 f a b
649−
650−-- | Rotated version of 'liftA3'.
651−ffor3 :: Applicative f => f a -> f b -> f c -> (a -> b -> c -> d) -> f d
652−ffor3 a b c f = liftA3 f a b c
653−
654571instance Reflex t => Applicative (Behavior t) where
655572 pure = constant
656573 f <*> x = pull $ sample f `ap` sample x
@@ -678,9 +595,7 @@ instance Reflex t => Monad (Behavior t) where
678595 a >>= f = pull $ sample a >>= sample . f
679596 -- Note: it is tempting to write (_ >> b = b); however, this would result in (fail x >> return y) succeeding (returning y), which violates the law that (a >> b = a >>= \_ -> b), since the implementation of (>>=) above actually will fail. Since we can't examine 'Behavior's other than by using sample, I don't think it's possible to write (>>) to be more efficient than the (>>=) above.
680597 return = constant
681−#if !MIN_VERSION_base(4,13,0)
682598 fail = error "Monad (Behavior t) does not support fail"
683−#endif
684599
685600instance (Reflex t, Monoid a) => Monoid (Behavior t a) where
686601 mempty = constant mempty
@@ -696,51 +611,40 @@ instance (Reflex t, Num a) => Num (Behavior t a) where
696611 negate = fmap negate
697612 signum = fmap signum
698613
699−instance (Num a, Reflex t) => Num (Dynamic t a) where
700− (+) = liftA2 (+)
701− (*) = liftA2 (*)
702− abs = fmap abs
703− signum = fmap signum
704− fromInteger = pure . fromInteger
705− negate = fmap negate
706− (-) = liftA2 (-)
707−
708614instance (Reflex t, Semigroup a) => Semigroup (Behavior t a) where
709615 a <> b = pull $ liftM2 (<>) (sample a) (sample b)
710616 sconcat = pull . fmap sconcat . mapM sample
617+#if MIN_VERSION_semigroups(0,17,0)
711618 stimes n = fmap $ stimes n
619+#else
620+ times1p n = fmap $ times1p n
621+#endif
712622
713−-- | Alias for 'mapMaybe'
714−fmapMaybe :: Filterable f => (a -> Maybe b) -> f a -> f b
715−fmapMaybe = mapMaybe
716−
717−-- | Flipped version of 'mapMaybe'.
718−fforMaybe :: Filterable f => f a -> (a -> Maybe b) -> f b
719−fforMaybe = flip mapMaybe
623+-- | Flipped version of 'fmapMaybe'.
624+fforMaybe :: FunctorMaybe f => f a -> (a -> Maybe b) -> f b
625+fforMaybe = flip fmapMaybe
720626
721627-- | Filter 'f a' using the provided predicate.
722−ffilter :: Filterable f => (a -> Bool) -> f a -> f a
723−ffilter = W.filter
628+-- Relies on 'fforMaybe'.
629+ffilter :: FunctorMaybe f => (a -> Bool) -> f a -> f a
630+ffilter f = fmapMaybe $ \x -> if f x then Just x else Nothing
724631
725632-- | Filter 'Left's from 'f (Either a b)' into 'a'.
726−filterLeft :: Filterable f => f (Either a b) -> f a
727−filterLeft = mapMaybe (either Just (const Nothing))
633+filterLeft :: FunctorMaybe f => f (Either a b) -> f a
634+filterLeft = fmapMaybe (either Just (const Nothing))
728635
729636-- | Filter 'Right's from 'f (Either a b)' into 'b'.
730−filterRight :: Filterable f => f (Either a b) -> f b
731−filterRight = mapMaybe (either (const Nothing) Just)
637+filterRight :: FunctorMaybe f => f (Either a b) -> f b
638+filterRight = fmapMaybe (either (const Nothing) Just)
732639
733640-- | Left-biased event union (prefers left event on simultaneous
734641-- occurrence).
735642instance Reflex t => Alt (Event t) where
736643 ev1 <!> ev2 = leftmost [ev1, ev2]
737644
738−-- | 'Event' intersection. Only occurs when both events are co-incident.
645+-- | 'Event' intersection (convenient interface to 'coincidence').
739646instance Reflex t => Apply (Event t) where
740− evf <.> evx = mapMaybe f (align evf evx) where
741− f (These g a) = Just (g a)
742− f _ = Nothing
743−
647+ evf <.> evx = coincidence (fmap (<$> evx) evf)
744648
745649-- | 'Event' intersection (convenient interface to 'coincidence').
746650instance Reflex t => Bind (Event t) where
@@ -749,18 +653,13 @@ instance Reflex t => Bind (Event t) where
749653
750654instance Reflex t => Functor (Event t) where
751655 {-# INLINE fmap #-}
752− fmap f = mapMaybe $ Just . f
656+ fmap f = fmapMaybe $ Just . f
753657 {-# INLINE (<$) #-}
754658 x <$ e = fmapCheap (const x) e
755659
756−-- TODO Remove this instance
757660instance Reflex t => FunctorMaybe (Event t) where
758661 {-# INLINE fmapMaybe #-}
759− fmapMaybe = mapMaybe
760−
761−instance Reflex t => Filterable (Event t) where
762− {-# INLINE mapMaybe #-}
763− mapMaybe f = push $ return . f
662+ fmapMaybe f = push $ return . f
764663
765664-- | Never: @'zero' = 'never'@.
766665instance Reflex t => Plus (Event t) where
@@ -771,13 +670,7 @@ instance Reflex t => Plus (Event t) where
771670tag :: Reflex t => Behavior t b -> Event t a -> Event t b
772671tag b = pushAlways $ \_ -> sample b
773672
774−-- | Replace each occurrence value of the 'Event' with the value of the
775−-- 'Behavior' at that time; if it is 'Just', fire with the contained value; if
776−-- it is 'Nothing', drop the occurrence.
777−tagMaybe :: Reflex t => Behavior t (Maybe b) -> Event t a -> Event t b
778−tagMaybe b = push $ \_ -> sample b
779−
780−-- | Create a new 'Event' that combines occurrences of supplied 'Event' with the
673+-- | Create a new 'Event' that combines occurences of supplied 'Event' with the
781674-- current value of the 'Behavior'.
782675attach :: Reflex t => Behavior t a -> Event t b -> Event t (a, b)
783676attach = attachWith (,)
@@ -787,118 +680,53 @@ attach = attachWith (,)
787680attachWith :: Reflex t => (a -> b -> c) -> Behavior t a -> Event t b -> Event t c
788681attachWith f = attachWithMaybe $ \a b -> Just $ f a b
789682
790−-- | Create a new 'Event' by combining each occurrence with the current value of
683+-- | Create a new 'Event' by combining each occurence with the current value of
791684-- the 'Behavior'. The occurrence is discarded if the combining function returns
792685-- Nothing
793686attachWithMaybe :: Reflex t => (a -> b -> Maybe c) -> Behavior t a -> Event t b -> Event t c
794687attachWithMaybe f b e = flip push e $ \o -> (`f` o) <$> sample b
795688
796−-- | Create a new 'Event' that occurs on all but the first occurrence of the
689+-- | Create a new 'Event' that occurs on all but the first occurence of the
797690-- supplied 'Event'.
798−tailE :: (Reflex t, MonadHold t m) => Event t a -> m (Event t a)
691+tailE :: (Reflex t, MonadHold t m, MonadFix m) => Event t a -> m (Event t a)
799692tailE e = snd <$> headTailE e
800693
801−-- | Create a tuple of two 'Event's with the first one occurring only the first
802−-- time the supplied 'Event' occurs and the second occurring on all but the first
803−-- occurrence.
804−headTailE :: (Reflex t, MonadHold t m) => Event t a -> m (Event t a, Event t a)
694+-- | Create a tuple of two 'Event's with the first one occuring only the first
695+-- time the supplied 'Event' occurs and the second occuring on all but the first
696+-- occurence.
697+headTailE :: (Reflex t, MonadHold t m, MonadFix m) => Event t a -> m (Event t a, Event t a)
805698headTailE e = do
806699 eHead <- headE e
807700 be <- hold never $ fmap (const e) eHead
808701 return (eHead, switch be)
809702
810−-- | Take the streak of occurrences starting at the current time for which the
811−-- event returns 'True'.
812−--
813−-- Starting at the current time, fire all the occurrences of the 'Event' for
814−-- which the given predicate returns 'True'. When first 'False' is returned,
815−-- do not fire, and permanently stop firing, even if 'True' values would have
816−-- been encountered later.
817−takeWhileE
818− :: forall t m a
819− . (Reflex t, MonadFix m, MonadHold t m)
820− => (a -> Bool)
821− -> Event t a
822− -> m (Event t a)
823−takeWhileE f = takeWhileJustE $ \v -> guard (f v) $> v
824−
825−-- | Take the streak of occurrences starting at the current time for which the
826−-- event returns 'Just b'.
827−--
828−-- Starting at the current time, fire all the occurrences of the 'Event' for
829−-- which the given predicate returns 'Just b'. When first 'Nothing' is returned,
830−-- do not fire, and permanently stop firing, even if 'Just b' values would have
831−-- been encountered later.
832−takeWhileJustE
833− :: forall t m a b
834− . (Reflex t, MonadFix m, MonadHold t m)
835− => (a -> Maybe b)
836− -> Event t a
837− -> m (Event t b)
838−takeWhileJustE f e = do
839− rec let (eBad, eTrue) = fanEither $ ffor e' $ \a -> case f a of
840− Nothing -> Left never
841− Just b -> Right b
842− eFirstBad <- headE eBad
843− e' <- switchHold e eFirstBad
703+-- | Starting at the current time, fire all the occurrences of the 'Event' for
704+-- which the given predicate returns 'True'. When 'False' is returned, do not
705+-- fire, and permanently stop firing, even if 'True' values are encountered
706+-- later.
707+takeWhileE :: forall t m a. (Reflex t, MonadFix m, MonadHold t m) => (a -> Bool) -> Event t a -> m (Event t a)
708+takeWhileE f e = do
709+ rec let (eFalse, eTrue) = fanEither $ ffor e' $ \a -> if f a
710+ then Right a
711+ else Left never
712+ be <- hold e eFalse
713+ let e' = switch be
844714 return eTrue
845715
846−-- | Drop the streak of occurrences starting at the current time for which the
847−-- event returns 'True'.
848−--
849−-- Starting at the current time, do not fire all the occurrences of the 'Event'
850−-- for which the given predicate returns 'True'. When 'False' is first
851−-- returned, do fire, and permanently continue firing, even if 'True' values
852−-- would have been encountered later.
853−dropWhileE
854− :: forall t m a
855− . (Reflex t, MonadFix m, MonadHold t m)
856− => (a -> Bool)
857− -> Event t a
858− -> m (Event t a)
859−dropWhileE f e = snd <$> takeDropWhileJustE (\v -> guard (f v) $> v) e
860−
861−-- | Both take and drop the streak of occurrences starting at the current time
862−-- for which the event returns 'Just b'.
863−--
864−-- For the left event, starting at the current time, fire all the occurrences
865−-- of the 'Event' for which the given function returns 'Just b'. When
866−-- 'Nothing' is returned, do not fire, and permanently stop firing, even if
867−-- 'Just b' values would have been encountered later.
868−--
869−-- For the right event, do not fire until the first occurrence where the given
870−-- function returns 'Nothing', and fire that one and all subsequent
871−-- occurrences. Even if the function would have again returned 'Just b', keep
872−-- on firing.
873−takeDropWhileJustE
874− :: forall t m a b
875− . (Reflex t, MonadFix m, MonadHold t m)
876− => (a -> Maybe b)
877− -> Event t a
878− -> m (Event t b, Event t a)
879−takeDropWhileJustE f e = do
880− rec let (eBad, eGood) = fanEither $ ffor e' $ \a -> case f a of
881− Nothing -> Left ()
882− Just b -> Right b
883− eFirstBad <- headE eBad
884− e' <- switchHold e (never <$ eFirstBad)
885− eRest <- switchHoldPromptOnly never (e <$ eFirstBad)
886− return (eGood, eRest)
887−
888−-- | Split the supplied 'Event' into two individual 'Event's occurring at the
716+-- | Split the supplied 'Event' into two individual 'Event's occuring at the
889717-- same time with the respective values from the tuple.
890718splitE :: Reflex t => Event t (a, b) -> (Event t a, Event t b)
891719splitE e = (fmap fst e, fmap snd e)
892720
893721-- | Print the supplied 'String' and the value of the 'Event' on each
894−-- occurrence. This should /only/ be used for debugging.
722+-- occurence. This should /only/ be used for debugging.
895723--
896724-- Note: As with Debug.Trace.trace, the message will only be printed if the
897725-- 'Event' is actually used.
898726traceEvent :: (Reflex t, Show a) => String -> Event t a -> Event t a
899727traceEvent s = traceEventWith $ \x -> s <> ": " <> show x
900728
901−-- | Print the output of the supplied function on each occurrence of the
729+-- | Print the output of the supplied function on each occurence of the
902730-- 'Event'. This should /only/ be used for debugging.
903731--
904732-- Note: As with Debug.Trace.trace, the message will only be printed if the
@@ -909,7 +737,11 @@ traceEventWith f = push $ \x -> trace (f x) $ return $ Just x
909737instance (Semigroup a, Reflex t) => Semigroup (Event t a) where
910738 (<>) = alignWith (mergeThese (<>))
911739 sconcat = fmap sconcat . mergeList . toList
740+#if MIN_VERSION_semigroups(0,17,0)
912741 stimes n = fmap $ stimes n
742+#else
743+ times1p n = fmap $ times1p n
744+#endif
913745
914746instance (Semigroup a, Reflex t) => Monoid (Event t a) where
915747 mempty = never
@@ -938,38 +770,25 @@ leftmost :: Reflex t => [Event t a] -> Event t a
938770leftmost = mergeWith const
939771
940772-- | Create a new 'Event' that occurs if at least one of the 'Event's in the
941−-- list occurs and has a list of the values of all 'Event's occurring at that
773+-- list occurs and has a list of the values of all 'Event's occuring at that
942774-- time.
943775mergeList :: Reflex t => [Event t a] -> Event t (NonEmpty a)
944776mergeList [] = never
945777mergeList es = mergeWithFoldCheap' id es
946778
947−unsafeMapIncremental
948− :: (Reflex t, Patch p, Patch p')
949− => (PatchTarget p -> PatchTarget p')
950− -> (p -> p')
951− -> Incremental t p
952− -> Incremental t p'
779+unsafeMapIncremental :: (Reflex t, Patch p, Patch p') => (PatchTarget p -> PatchTarget p') -> (p -> p') -> Incremental t p -> Incremental t p'
953780unsafeMapIncremental f g a = unsafeBuildIncremental (fmap f $ sample $ currentIncremental a) $ g <$> updatedIncremental a
954781
955782-- | Create a new 'Event' combining the map of 'Event's into an 'Event' that
956783-- occurs if at least one of them occurs and has a map of values of all 'Event's
957−-- occurring at that time.
784+-- occuring at that time.
958785mergeMap :: (Reflex t, Ord k) => Map k (Event t a) -> Event t (Map k a)
959786mergeMap = fmap dmapToMap . merge . mapWithFunctorToDMap
960787
961−-- | Like 'mergeMap' but for 'IntMap'.
962−mergeIntMap :: Reflex t => IntMap (Event t a) -> Event t (IntMap a)
963−mergeIntMap = fmap dmapToIntMap . merge . intMapWithFunctorToDMap
964−
965788-- | Create a merge whose parents can change over time
966789mergeMapIncremental :: (Reflex t, Ord k) => Incremental t (PatchMap k (Event t a)) -> Event t (Map k a)
967790mergeMapIncremental = fmap dmapToMap . mergeIncremental . unsafeMapIncremental mapWithFunctorToDMap (const2PatchDMapWith id)
968791
969−-- | Create a merge whose parents can change over time
970−mergeIntMapIncremental :: Reflex t => Incremental t (PatchIntMap (Event t a)) -> Event t (IntMap a)
971−mergeIntMapIncremental = fmap dmapToIntMap . mergeIncremental . unsafeMapIncremental intMapWithFunctorToDMap (const2IntPatchDMapWith id)
972−
973792-- | Experimental: Create a merge whose parents can change over time; changing the key of an Event is more efficient than with mergeIncremental
974793mergeMapIncrementalWithMove :: (Reflex t, Ord k) => Incremental t (PatchMapWithMove k (Event t a)) -> Event t (Map k a)
975794mergeMapIncrementalWithMove = fmap dmapToMap . mergeIncrementalWithMove . unsafeMapIncremental mapWithFunctorToDMap (const2PatchDMapWithMoveWith id)
@@ -979,7 +798,7 @@ fanEither :: Reflex t => Event t (Either a b) -> (Event t a, Event t b)
979798fanEither e =
980799 let justLeft = either Just (const Nothing)
981800 justRight = either (const Nothing) Just
982− in (mapMaybe justLeft e, mapMaybe justRight e)
801+ in (fmapMaybe justLeft e, fmapMaybe justRight e)
983802
984803-- | Split the event into separate events for 'This' and 'That' values,
985804-- allowing them to fire simultaneously when the input value is 'These'.
@@ -991,134 +810,43 @@ fanThese e =
991810 that (That y) = Just y
992811 that (These _ y) = Just y
993812 that _ = Nothing
994− in (mapMaybe this e, mapMaybe that e)
813+ in (fmapMaybe this e, fmapMaybe that e)
995814
996815-- | Split the event into an 'EventSelector' that allows efficient selection of
997816-- the individual 'Event's.
998817fanMap :: (Reflex t, Ord k) => Event t (Map k a) -> EventSelector t (Const2 k a)
999818fanMap = fan . fmap mapToDMap
1000819
1001−-- | Switches to the new event whenever it receives one. Only the old event is
1002−-- considered the moment a new one is switched in; the output event will fire at
1003−-- that moment only if the old event does.
1004−--
1005−-- Because the simultaneous firing case is irrelevant, this function imposes
1006−-- laxer "timing requirements" on the overall circuit, avoiding many potential
1007−-- cyclic dependency / metastability failures. It's also more performant. Use
1008−-- this rather than 'switchHoldPromptly' and 'switchHoldPromptOnly' unless you
1009−-- are absolutely sure you need to act on the new event in the coincidental
1010−-- case.
1011−switchHold :: (Reflex t, MonadHold t m) => Event t a -> Event t (Event t a) -> m (Event t a)
1012−switchHold ea0 eea = switch <$> hold ea0 eea
1013−
1014−-- | Switches to the new event whenever it receives one. Whenever a new event is
1015−-- provided, if it is firing, its value will be the resulting event's value; if
1016−-- it is not firing, but the old one is, the old one's value will be used.
1017−--
1018−-- 'switchHold', by always forwarding the old event the moment it is switched
1019−-- out, avoids many potential cyclic dependency problems / metastability
1020−-- problems. It's also more performant. Use it instead unless you are sure you
1021−-- cannot.
1022−switchHoldPromptly :: (Reflex t, MonadHold t m) => Event t a -> Event t (Event t a) -> m (Event t a)
1023−switchHoldPromptly ea0 eea = do
820+-- | Switches to the new event whenever it receives one. Whenever a new event
821+-- is provided, if it is firing, its value will be the resulting event's value;
822+-- if it is not firing, but the old one is, the old one's value will be used.
823+switchPromptly :: (Reflex t, MonadHold t m) => Event t a -> Event t (Event t a) -> m (Event t a)
824+switchPromptly ea0 eea = do
1024825 bea <- hold ea0 eea
1025826 let eLag = switch bea
1026827 eCoincidences = coincidence eea
1027828 return $ leftmost [eCoincidences, eLag]
1028829
1029−-- | switches to a new event whenever it receives one. At the moment of
830+-- | 'switch'es to a new event whenever it receives one. At the moment of
1030831-- switching, the old event will be ignored if it fires, and the new one will be
1031832-- used if it fires; this is the opposite of 'switch', which will use only the
1032833-- old value.
1033−--
1034−-- 'switchHold', by always forwarding the old event the moment it is switched
1035−-- out, avoids many potential cyclic dependency problems / metastability
1036−-- problems. It's also more performant. Use it instead unless you are sure you
1037−-- cannot.
1038−switchHoldPromptOnly :: (Reflex t, MonadHold t m) => Event t a -> Event t (Event t a) -> m (Event t a)
1039−switchHoldPromptOnly e0 e' = do
834+switchPromptOnly :: (Reflex t, MonadHold t m) => Event t a -> Event t (Event t a) -> m (Event t a)
835+switchPromptOnly e0 e' = do
1040836 eLag <- switch <$> hold e0 e'
1041837 return $ coincidence $ leftmost [e', eLag <$ eLag]
1042838
1043−-- | When the given outer event fires, condense the inner events into the contained patch. Non-firing inner events will be replaced with deletions.
1044−coincidencePatchMap :: (Reflex t, Ord k) => Event t (PatchMap k (Event t v)) -> Event t (PatchMap k v)
1045−coincidencePatchMap e = fmapCheap PatchMap $ coincidence $ ffor e $ \(PatchMap m) -> mergeMap $ ffor m $ \case
1046− Nothing -> fmapCheap (const Nothing) e
1047− Just ev -> leftmost [fmapCheap Just ev, fmapCheap (const Nothing) e]
1048−
1049−-- | See 'coincidencePatchMap'
1050−coincidencePatchIntMap :: Reflex t => Event t (PatchIntMap (Event t v)) -> Event t (PatchIntMap v)
1051−coincidencePatchIntMap e = fmapCheap PatchIntMap $ coincidence $ ffor e $ \(PatchIntMap m) -> mergeIntMap $ ffor m $ \case
1052− Nothing -> fmapCheap (const Nothing) e
1053− Just ev -> leftmost [fmapCheap Just ev, fmapCheap (const Nothing) e]
1054−
1055−-- | See 'coincidencePatchMap'
1056−coincidencePatchMapWithMove :: (Reflex t, Ord k) => Event t (PatchMapWithMove k (Event t v)) -> Event t (PatchMapWithMove k v)
1057−coincidencePatchMapWithMove e = fmapCheap unsafePatchMapWithMove $ coincidence $ ffor e $ \p -> mergeMap $ ffor (unPatchMapWithMove p) $ \ni -> case PatchMapWithMove._nodeInfo_from ni of
1058− PatchMapWithMove.From_Delete -> fforCheap e $ \_ ->
1059− ni { PatchMapWithMove._nodeInfo_from = PatchMapWithMove.From_Delete }
1060− PatchMapWithMove.From_Move k -> fforCheap e $ \_ ->
1061− ni { PatchMapWithMove._nodeInfo_from = PatchMapWithMove.From_Move k }
1062− PatchMapWithMove.From_Insert ev -> leftmost
1063− [ fforCheap ev $ \v ->
1064− ni { PatchMapWithMove._nodeInfo_from = PatchMapWithMove.From_Insert v }
1065− , fforCheap e $ \_ ->
1066− ni { PatchMapWithMove._nodeInfo_from = PatchMapWithMove.From_Delete }
1067− ]
1068−
1069−-- | Given a 'PatchTarget' of events (e.g., a 'Map' with 'Event' values) and an event of 'Patch'es
1070−-- (e.g., a 'PatchMap' with 'Event' values), produce an 'Event' of the 'PatchTarget' type that
1071−-- fires with the patched value.
1072−switchHoldPromptOnlyIncremental
1073− :: forall t m p pt w
1074− . ( Reflex t
1075− , MonadHold t m
1076− , Patch (p (Event t w))
1077− , PatchTarget (p (Event t w)) ~ pt (Event t w)
1078− , Patch (p w)
1079− , PatchTarget (p w) ~ pt w
1080− , Monoid (pt w)
1081− )
1082− => (Incremental t (p (Event t w)) -> Event t (pt w))
1083− -> (Event t (p (Event t w)) -> Event t (p w))
1084− -> pt (Event t w)
1085− -> Event t (p (Event t w))
1086− -> m (Event t (pt w))
1087−switchHoldPromptOnlyIncremental mergePatchIncremental coincidencePatch e0 e' = do
1088− lag <- mergePatchIncremental <$> holdIncremental e0 e'
1089− pure $ ffor (align lag (coincidencePatch e')) $ \case
1090− This old -> old
1091− That new -> new `applyAlways` mempty
1092− These old new -> new `applyAlways` old
1093−
1094839instance Reflex t => Align (Event t) where
1095840 nil = never
1096−#if MIN_VERSION_these(0, 8, 0)
1097−instance Reflex t => Semialign (Event t) where
1098−#endif
1099841 align = alignEventWithMaybe Just
1100842
1101−#ifdef MIN_VERSION_semialign
1102−#if MIN_VERSION_semialign(1,1,0)
1103−instance Reflex t => Zip (Event t) where
1104−#endif
1105− zip x y = mapMaybe justThese $ align x y
1106−#endif
1107−
1108−#ifdef MIN_VERSION_semialign
1109−#if MIN_VERSION_semialign(1,1,0)
1110−instance Reflex t => Unzip (Event t) where
1111− unzip = splitE
1112−#endif
1113−#endif
1114−
1115843-- | Create a new 'Event' that only occurs if the supplied 'Event' occurs and
1116−-- the 'Behavior' is true at the time of occurrence.
844+-- the 'Behavior' is true at the time of occurence.
1117845gate :: Reflex t => Behavior t Bool -> Event t a -> Event t a
1118846gate = attachWithMaybe $ \allow a -> if allow then Just a else Nothing
1119847
1120−-- | Create a new behavior given a starting behavior and switch to the behavior
1121−-- carried by the event when it fires.
848+-- | Create a new behavior given a starting behavior and switch to a the behvior
849+-- carried by the event when it fires.
1122850switcher :: (Reflex t, MonadHold t m)
1123851 => Behavior t a -> Event t (Behavior t a) -> m (Behavior t a)
1124852switcher b eb = pull . (sample <=< sample) <$> hold b eb
@@ -1133,7 +861,7 @@ zipDyn = zipDynWith (,)
1133861
1134862-- | Combine two 'Dynamic's with a combining function. The result will change
1135863-- whenever either (or both) input 'Dynamic' changes.
1136−-- More efficient than 'liftA2'.
864+-- More efficient than liftA2.
1137865zipDynWith :: Reflex t => (a -> b -> c) -> Dynamic t a -> Dynamic t b -> Dynamic t c
1138866zipDynWith f da db =
1139867 let eab = align (updated da) (updated db)
@@ -1149,10 +877,6 @@ zipDynWith f da db =
1149877 return $ Just $ f a b
1150878 in unsafeBuildDynamic (f <$> sample (current da) <*> sample (current db)) ec
1151879
1152−instance (Reflex t, Semigroup a) => Semigroup (Dynamic t a) where
1153− (<>) = zipDynWith (<>)
1154− stimes n = fmap $ stimes n
1155−
1156880instance (Reflex t, Monoid a) => Monoid (Dynamic t a) where
1157881 mconcat = distributeListOverDynWith mconcat
1158882 mempty = constDyn mempty
@@ -1160,23 +884,14 @@ instance (Reflex t, Monoid a) => Monoid (Dynamic t a) where
1160884
1161885-- | This function converts a 'DMap' whose elements are 'Dynamic's into a
1162886-- 'Dynamic' 'DMap'. Its implementation is more efficient than doing the same
1163−-- through the use of multiple uses of 'zipDynWith' or 'Applicative' operators.
887+-- through the use of multiple uses of 'zipWithDyn' or 'Applicative' operators.
1164888distributeDMapOverDynPure :: forall t k. (Reflex t, GCompare k) => DMap k (Dynamic t) -> Dynamic t (DMap k Identity)
1165−distributeDMapOverDynPure = distributeDMapOverDynPureG coerceDynamic
1166−
1167−-- | This function converts a 'DMap' whose elements are 'Dynamic's into a
1168−-- 'Dynamic' 'DMap'. Its implementation is more efficient than doing the same
1169−-- through the use of multiple uses of 'zipDynWith' or 'Applicative' operators.
1170−distributeDMapOverDynPureG
1171− :: forall t k q v. (Reflex t, GCompare k)
1172− => (forall a. q a -> Dynamic t (v a))
1173− -> DMap k q -> Dynamic t (DMap k v)
1174−distributeDMapOverDynPureG nt dm = case DMap.toList dm of
889+distributeDMapOverDynPure dm = case DMap.toList dm of
1175890 [] -> constDyn DMap.empty
1176− [k :=> v] -> DMap.singleton k <$> nt v
891+ [k :=> v] -> fmap (DMap.singleton k . Identity) v
1177892 _ ->
1178− let getInitial = DMap.traverseWithKey (\_ -> sample . current . nt) dm
1179− edmPre = mergeG getCompose $ DMap.map (Compose . updated . nt) dm
893+ let getInitial = DMap.traverseWithKey (\_ -> fmap Identity . sample . current) dm
894+ edmPre = merge $ DMap.map updated dm
1180895 result = unsafeBuildDynamic getInitial $ flip pushAlways edmPre $ \news -> do
1181896 olds <- sample $ current result
1182897 return $ DMap.unionWithKey (\_ _ new -> new) olds news
@@ -1188,73 +903,21 @@ distributeListOverDyn = distributeListOverDynWith id
1188903
1189904-- | Create a new 'Dynamic' by applying a combining function to a list of 'Dynamic's
1190905distributeListOverDynWith :: Reflex t => ([a] -> b) -> [Dynamic t a] -> Dynamic t b
1191−distributeListOverDynWith f =
1192− fmap (f . map fromDSum . DMap.toAscList) .
1193− distributeDMapOverDynPure .
1194− DMap.fromDistinctAscList .
1195− zipWith toDSum [0..]
1196− where
1197− toDSum :: Int -> Dynamic t a -> DSum (Const2 Int a) (Dynamic t)
1198− toDSum k v = Const2 k :=> v
1199− fromDSum :: DSum (Const2 Int a) Identity -> a
1200− fromDSum (Const2 _ :=> Identity v) = v
906+distributeListOverDynWith f = fmap (f . map (\(Const2 _ :=> Identity v) -> v) . DMap.toList) . distributeDMapOverDynPure . DMap.fromList . map (\(k, v) -> Const2 k :=> v) . zip [0 :: Int ..]
1201907
1202908-- | Create a new 'Event' that occurs when the first supplied 'Event' occurs
1203909-- unless the second supplied 'Event' occurs simultaneously.
1204910difference :: Reflex t => Event t a -> Event t b -> Event t a
1205911difference = alignEventWithMaybe $ \case
1206912 This a -> Just a
1207− _ -> Nothing
913+ _ -> Nothing
1208914
1209−-- | Zips two values by taking the union of their shapes and combining with the provided function.
1210−-- 'Nothing' values are dropped.
1211915alignEventWithMaybe :: Reflex t => (These a b -> Maybe c) -> Event t a -> Event t b -> Event t c
1212−alignEventWithMaybe f ea eb = mapMaybe (f <=< dmapToThese) $
1213− merge $ DMap.fromList [LeftTag :=> ea, RightTag :=> eb]
1214−
1215−-- | Produces an 'Event' that fires only when the input event fires with a 'DSum' key that
1216−-- matches the provided key.
1217−filterEventKey
1218− :: forall t m k v a.
1219− ( Reflex t
1220− , MonadFix m
1221− , MonadHold t m
1222− , GEq k
1223− )
1224− => k a
1225− -> Event t (DSum k v)
1226− -> m (Event t (v a))
1227−filterEventKey k kv' = do
1228− let f :: DSum k v -> Maybe (v a)
1229− f (newK :=> newV) = case newK `geq` k of
1230− Just Refl -> Just newV
1231− Nothing -> Nothing
1232− takeWhileJustE f kv'
1233−
1234−-- | "Factor" the input 'DSum' 'Event' to produce an 'Event' which
1235−-- fires when the 'DSum' key changes and contains both the value of the
1236−-- 'DSum' at switchover and an 'Event' of values produced by subsequent
1237−-- firings of the input 'Event' that do not change the 'DSum' key.
1238−factorEvent
1239− :: forall t m k v a.
1240− ( Reflex t
1241− , MonadFix m
1242− , MonadHold t m
1243− , GEq k
1244− )
1245− => k a
1246− -> Event t (DSum k v)
1247− -> m (Event t (v a), Event t (DSum k (Product v (Compose (Event t) v))))
1248−factorEvent k0 kv' = do
1249− key :: Behavior t (Some k) <- hold (Some k0) $ fmapCheap (\(k :=> _) -> Some k) kv'
1250− let update = flip push kv' $ \(newKey :=> newVal) -> sample key >>= \case
1251− Some oldKey -> case newKey `geq` oldKey of
1252− Just Refl -> return Nothing
1253− Nothing -> do
1254− newInner <- filterEventKey newKey kv'
1255− return $ Just $ newKey :=> Pair newVal (Compose newInner)
1256− eInitial <- filterEventKey k0 kv'
1257− return (eInitial, update)
916+alignEventWithMaybe f ea eb =
917+ fmapMaybe (f <=< dmapToThese)
918+ $ merge
919+ $ DMap.fromList [LeftTag :=> ea, RightTag :=> eb]
920+
1258921
1259922--------------------------------------------------------------------------------
1260923-- Accumulator
@@ -1284,94 +947,26 @@ class Reflex t => Accumulator t f | f -> t where
1284947 mapAccumMaybe f = mapAccumMaybeM $ \v o -> return $ f v o
1285948 mapAccumMaybeM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a, Maybe c)) -> a -> Event t b -> m (f a, Event t c)
1286949
1287−-- | Accumulate a 'Dynamic' by folding occurrences of an 'Event'
1288−-- with the provided function. See 'foldDyn'.
1289−accumDyn
1290− :: (Reflex t, MonadHold t m, MonadFix m)
1291− => (a -> b -> a)
1292− -> a
1293− -> Event t b
1294− -> m (Dynamic t a)
950+accumDyn :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> a) -> a -> Event t b -> m (Dynamic t a)
1295951accumDyn f = accumMaybeDyn $ \v o -> Just $ f v o
1296−
1297−-- | Accumulate a 'Dynamic' by folding occurrences of an 'Event'
1298−-- with the provided 'PushM' action.
1299−accumMDyn
1300− :: (Reflex t, MonadHold t m, MonadFix m)
1301− => (a -> b -> PushM t a)
1302− -> a
1303− -> Event t b
1304− -> m (Dynamic t a)
952+accumMDyn :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t a) -> a -> Event t b -> m (Dynamic t a)
1305953accumMDyn f = accumMaybeMDyn $ \v o -> Just <$> f v o
1306−
1307−-- | Accumulate a 'Dynamic' by folding occurrences of an 'Event'
1308−-- with the provided function, discarding 'Nothing' results.
1309−accumMaybeDyn
1310− :: (Reflex t, MonadHold t m, MonadFix m)
1311− => (a -> b -> Maybe a)
1312− -> a
1313− -> Event t b
1314− -> m (Dynamic t a)
954+accumMaybeDyn :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> Maybe a) -> a -> Event t b -> m (Dynamic t a)
1315955accumMaybeDyn f = accumMaybeMDyn $ \v o -> return $ f v o
1316−
1317−-- | Accumulate a 'Dynamic' by folding occurrences of an 'Event'
1318−-- with the provided 'PushM' action, discarding 'Nothing' results.
1319−accumMaybeMDyn
1320− :: (Reflex t, MonadHold t m, MonadFix m)
1321− => (a -> b -> PushM t (Maybe a))
1322− -> a
1323− -> Event t b
1324− -> m (Dynamic t a)
956+accumMaybeMDyn :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a)) -> a -> Event t b -> m (Dynamic t a)
1325957accumMaybeMDyn f z e = do
1326958 rec let e' = flip push e $ \o -> do
1327959 v <- sample $ current d'
1328960 f v o
1329961 d' <- holdDyn z e'
1330962 return d'
1331−
1332−-- | Accumulate a 'Dynamic' by folding occurrences of an 'Event'
1333−-- with a function that both accumulates and produces a value to fire
1334−-- as an 'Event'. Returns both the accumulated value and an 'Event'.
1335−mapAccumDyn
1336− :: (Reflex t, MonadHold t m, MonadFix m)
1337− => (a -> b -> (a, c))
1338− -> a
1339− -> Event t b
1340− -> m (Dynamic t a, Event t c)
963+mapAccumDyn :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> (a, c)) -> a -> Event t b -> m (Dynamic t a, Event t c)
1341964mapAccumDyn f = mapAccumMaybeDyn $ \v o -> bimap Just Just $ f v o
1342−
1343−-- | Similar to 'mapAccumDyn' except that the combining function is a
1344−-- 'PushM' action.
1345−mapAccumMDyn
1346− :: (Reflex t, MonadHold t m, MonadFix m)
1347− => (a -> b -> PushM t (a, c))
1348− -> a
1349− -> Event t b
1350− -> m (Dynamic t a, Event t c)
965+mapAccumMDyn :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t (a, c)) -> a -> Event t b -> m (Dynamic t a, Event t c)
1351966mapAccumMDyn f = mapAccumMaybeMDyn $ \v o -> bimap Just Just <$> f v o
1352−
1353−-- | Accumulate a 'Dynamic' by folding occurrences of an 'Event' with
1354−-- a function that both optionally accumulates and optionally produces
1355−-- a value to fire as a separate output 'Event'.
1356−-- Note that because 'Nothing's are discarded in both cases, the output
1357−-- 'Event' may fire even though the output 'Dynamic' has not changed, and
1358−-- the output 'Dynamic' may update even when the output 'Event' is not firing.
1359−mapAccumMaybeDyn
1360− :: (Reflex t, MonadHold t m, MonadFix m)
1361− => (a -> b -> (Maybe a, Maybe c))
1362− -> a
1363− -> Event t b
1364− -> m (Dynamic t a, Event t c)
967+mapAccumMaybeDyn :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> (Maybe a, Maybe c)) -> a -> Event t b -> m (Dynamic t a, Event t c)
1365968mapAccumMaybeDyn f = mapAccumMaybeMDyn $ \v o -> return $ f v o
1366−
1367−-- | Like 'mapAccumMaybeDyn' except that the combining function is a
1368−-- 'PushM' action.
1369−mapAccumMaybeMDyn
1370− :: (Reflex t, MonadHold t m, MonadFix m)
1371− => (a -> b -> PushM t (Maybe a, Maybe c))
1372− -> a
1373− -> Event t b
1374− -> m (Dynamic t a, Event t c)
969+mapAccumMaybeMDyn :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a, Maybe c)) -> a -> Event t b -> m (Dynamic t a, Event t c)
1375970mapAccumMaybeMDyn f z e = do
1376971 rec let e' = flip push e $ \o -> do
1377972 v <- sample $ current d'
@@ -1379,42 +974,18 @@ mapAccumMaybeMDyn f z e = do
1379974 return $ case result of
1380975 (Nothing, Nothing) -> Nothing
1381976 _ -> Just result
1382− d' <- holdDyn z $ mapMaybe fst e'
1383− return (d', mapMaybe snd e')
977+ d' <- holdDyn z $ fmapMaybe fst e'
978+ return (d', fmapMaybe snd e')
1384979
1385−-- | Accumulate a 'Behavior' by folding occurrences of an 'Event'
1386−-- with the provided function.
1387980{-# INLINE accumB #-}
1388−accumB
1389− :: (Reflex t, MonadHold t m, MonadFix m)
1390− => (a -> b -> a)
1391− -> a
1392− -> Event t b
1393− -> m (Behavior t a)
981+accumB :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> a) -> a -> Event t b -> m (Behavior t a)
1394982accumB f = accumMaybeB $ \v o -> Just $ f v o
1395−
1396−-- | Like 'accumB' except that the combining function is a 'PushM' action.
1397983{-# INLINE accumMB #-}
1398−accumMB
1399− :: (Reflex t, MonadHold t m, MonadFix m)
1400− => (a -> b -> PushM t a)
1401− -> a
1402− -> Event t b
1403− -> m (Behavior t a)
984+accumMB :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t a) -> a -> Event t b -> m (Behavior t a)
1404985accumMB f = accumMaybeMB $ \v o -> Just <$> f v o
1405−
1406−-- | Accumulate a 'Behavior' by folding occurrences of an 'Event'
1407−-- with the provided function, discarding 'Nothing' results.
1408986{-# INLINE accumMaybeB #-}
1409−accumMaybeB
1410− :: (Reflex t, MonadHold t m, MonadFix m)
1411− => (a -> b -> Maybe a)
1412− -> a
1413− -> Event t b
1414− -> m (Behavior t a)
987+accumMaybeB :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> Maybe a) -> a -> Event t b -> m (Behavior t a)
1415988accumMaybeB f = accumMaybeMB $ \v o -> return $ f v o
1416−
1417−-- | Like 'accumMaybeB' except that the combining function is a 'PushM' action.
1418989{-# INLINE accumMaybeMB #-}
1419990accumMaybeMB :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a)) -> a -> Event t b -> m (Behavior t a)
1420991accumMaybeMB f z e = do
@@ -1423,42 +994,16 @@ accumMaybeMB f z e = do
1423994 f v o
1424995 d' <- hold z e'
1425996 return d'
1426−
1427−-- | Accumulate a 'Behavior' by folding occurrences of an 'Event'
1428−-- with a function that both accumulates and produces a value to fire
1429−-- as an 'Event'. Returns both the accumulated value and an 'Event'.
1430997{-# INLINE mapAccumB #-}
1431−mapAccumB
1432− :: (Reflex t, MonadHold t m, MonadFix m)
1433− => (a -> b -> (a, c))
1434− -> a
1435− -> Event t b
1436− -> m (Behavior t a, Event t c)
998+mapAccumB :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> (a, c)) -> a -> Event t b -> m (Behavior t a, Event t c)
1437999mapAccumB f = mapAccumMaybeB $ \v o -> bimap Just Just $ f v o
1438−
1439−-- | Like 'mapAccumB' except that the combining function is a 'PushM' action.
14401000{-# INLINE mapAccumMB #-}
1441−mapAccumMB
1442− :: (Reflex t, MonadHold t m, MonadFix m)
1443− => (a -> b -> PushM t (a, c))
1444− -> a
1445− -> Event t b
1446− -> m (Behavior t a, Event t c)
1001+mapAccumMB :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t (a, c)) -> a -> Event t b -> m (Behavior t a, Event t c)
14471002mapAccumMB f = mapAccumMaybeMB $ \v o -> bimap Just Just <$> f v o
1448−
1449−-- | Accumulate a 'Behavior' by folding occurrences of an 'Event' with
1450−-- a function that both optionally accumulates and optionally produces
1451−-- a value to fire as a separate output 'Event'. 'Nothing's are discarded.
14521003{-# INLINE mapAccumMaybeB #-}
1453−mapAccumMaybeB
1454− :: (Reflex t, MonadHold t m, MonadFix m)
1455− => (a -> b -> (Maybe a, Maybe c))
1456− -> a
1457− -> Event t b
1458− -> m (Behavior t a, Event t c)
1004+mapAccumMaybeB :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> (Maybe a, Maybe c)) -> a -> Event t b -> m (Behavior t a, Event t c)
14591005mapAccumMaybeB f = mapAccumMaybeMB $ \v o -> return $ f v o
14601006
1461−-- | Like 'mapAccumMaybeB' except that the combining function is a 'PushM' action.
14621007{-# INLINE mapAccumMaybeMB #-}
14631008mapAccumMaybeMB :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a, Maybe c)) -> a -> Event t b -> m (Behavior t a, Event t c)
14641009mapAccumMaybeMB f z e = do
@@ -1468,8 +1013,8 @@ mapAccumMaybeMB f z e = do
14681013 return $ case result of
14691014 (Nothing, Nothing) -> Nothing
14701015 _ -> Just result
1471− d' <- hold z $ mapMaybe fst e'
1472− return (d', mapMaybe snd e')
1016+ d' <- hold z $ fmapMaybe fst e'
1017+ return (d', fmapMaybe snd e')
14731018
14741019-- | Accumulate occurrences of an 'Event', producing an output occurrence each
14751020-- time. Discard the underlying 'Accumulator'.
@@ -1516,7 +1061,7 @@ instance Reflex t => Accumulator t (Event t) where
15161061 accumMaybeM f z e = updated <$> accumMaybeM f z e
15171062 mapAccumMaybeM f z e = first updated <$> mapAccumMaybeM f z e
15181063
1519−-- | Create a new 'Event' by combining each occurrence with the next value of the
1064+-- | Create a new 'Event' by combining each occurence with the next value of the
15201065-- list using the supplied function. If the list runs out of items, all
15211066-- subsequent 'Event' occurrences will be ignored.
15221067zipListWithEvent :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> c) -> [a] -> Event t b -> m (Event t c)
@@ -1526,20 +1071,20 @@ zipListWithEvent f l e = do
15261071 _ -> (Nothing, Nothing) --TODO: Unsubscribe the event?
15271072 mapAccumMaybe_ f' l e
15281073
1529−-- | Assign a number to each occurrence of the given 'Event', starting from 0
1074+-- | Assign a number to each occurence of the given 'Event', starting from 0
15301075{-# INLINE numberOccurrences #-}
15311076numberOccurrences :: (Reflex t, MonadHold t m, MonadFix m, Num b) => Event t a -> m (Event t (b, a))
15321077numberOccurrences = numberOccurrencesFrom 0
15331078
1534−-- | Assign a number to each occurrence of the given 'Event'
1079+-- | Assign a number to each occurence of the given 'Event'
15351080{-# INLINE numberOccurrencesFrom #-}
15361081numberOccurrencesFrom :: (Reflex t, MonadHold t m, MonadFix m, Num b) => b -> Event t a -> m (Event t (b, a))
1537−numberOccurrencesFrom = mapAccum_ (\n a -> let !next = n + 1 in (next, (n, a)))
1082+numberOccurrencesFrom = mapAccum_ (\n a -> (n + 1, (n, a)))
15381083
1539−-- | Assign a number to each occurrence of the given 'Event'; discard the occurrences' values
1084+-- | Assign a number to each occurence of the given 'Event'; discard the occurrences' values
15401085{-# INLINE numberOccurrencesFrom_ #-}
15411086numberOccurrencesFrom_ :: (Reflex t, MonadHold t m, MonadFix m, Num b) => b -> Event t a -> m (Event t b)
1542−numberOccurrencesFrom_ = mapAccum_ (\n _ -> let !next = n + 1 in (next, n))
1087+numberOccurrencesFrom_ = mapAccum_ (\n _ -> (n + 1, n))
15431088
15441089-- | This is used to sample the value of a 'Behavior' using an 'Event'.
15451090--
@@ -1609,74 +1154,79 @@ infixl 4 <@>
16091154(<@) = tag
16101155infixl 4 <@
16111156
1157+-- | A 'Monad' that supports adjustment over time. After an action has been
1158+-- run, if the given events fire, it will adjust itself so that its net effect
1159+-- is as though it had originally been run with the new value. Note that there
1160+-- is some issue here with persistent side-effects: obviously, IO (and some
1161+-- other side-effects) cannot be undone, so it is up to the instance implementer
1162+-- to determine what the best meaning for this class is in such cases.
1163+class (Reflex t, Monad m) => MonadAdjust t m | m -> t where
1164+ runWithReplace :: m a -> Event t (m b) -> m (a, Event t b)
1165+ traverseIntMapWithKeyWithAdjust :: (IntMap.Key -> v -> m v') -> IntMap v -> Event t (PatchIntMap v) -> m (IntMap v', Event t (PatchIntMap v'))
1166+ traverseDMapWithKeyWithAdjust :: GCompare k => (forall a. k a -> v a -> m (v' a)) -> DMap k v -> Event t (PatchDMap k v) -> m (DMap k v', Event t (PatchDMap k v'))
1167+ traverseDMapWithKeyWithAdjustWithMove :: GCompare k => (forall a. k a -> v a -> m (v' a)) -> DMap k v -> Event t (PatchDMapWithMove k v) -> m (DMap k v', Event t (PatchDMapWithMove k v'))
1168+
1169+instance MonadAdjust t m => MonadAdjust t (ReaderT r m) where
1170+ runWithReplace a0 a' = do
1171+ r <- ask
1172+ lift $ runWithReplace (runReaderT a0 r) $ fmap (`runReaderT` r) a'
1173+ traverseIntMapWithKeyWithAdjust f dm0 dm' = do
1174+ r <- ask
1175+ lift $ traverseIntMapWithKeyWithAdjust (\k v -> runReaderT (f k v) r) dm0 dm'
1176+ traverseDMapWithKeyWithAdjust f dm0 dm' = do
1177+ r <- ask
1178+ lift $ traverseDMapWithKeyWithAdjust (\k v -> runReaderT (f k v) r) dm0 dm'
1179+ traverseDMapWithKeyWithAdjustWithMove f dm0 dm' = do
1180+ r <- ask
1181+ lift $ traverseDMapWithKeyWithAdjustWithMove (\k v -> runReaderT (f k v) r) dm0 dm'
1182+
1183+sequenceDMapWithAdjust :: (GCompare k, MonadAdjust t m) => DMap k m -> Event t (PatchDMap k m) -> m (DMap k Identity, Event t (PatchDMap k Identity))
1184+sequenceDMapWithAdjust = traverseDMapWithKeyWithAdjust $ \_ -> fmap Identity
1185+
1186+sequenceDMapWithAdjustWithMove :: (GCompare k, MonadAdjust t m) => DMap k m -> Event t (PatchDMapWithMove k m) -> m (DMap k Identity, Event t (PatchDMapWithMove k Identity))
1187+sequenceDMapWithAdjustWithMove = traverseDMapWithKeyWithAdjustWithMove $ \_ -> fmap Identity
1188+
1189+mapMapWithAdjustWithMove :: forall t m k v v'. (MonadAdjust t m, Ord k) => (k -> v -> m v') -> Map k v -> Event t (PatchMapWithMove k v) -> m (Map k v', Event t (PatchMapWithMove k v'))
1190+mapMapWithAdjustWithMove f m0 m' = do
1191+ (out0 :: DMap (Const2 k v) (Constant v'), out') <- traverseDMapWithKeyWithAdjustWithMove (\(Const2 k) (Identity v) -> Constant <$> f k v) (mapToDMap m0) (const2PatchDMapWithMoveWith Identity <$> m')
1192+ return (dmapToMapWith (\(Constant v') -> v') out0, patchDMapWithMoveToPatchMapWithMoveWith (\(Constant v') -> v') <$> out')
1193+
16121194------------------
16131195-- Cheap Functions
16141196------------------
16151197
1616−-- | A "cheap" version of 'pushAlways'. See the performance note on 'pushCheap'.
16171198{-# INLINE pushAlwaysCheap #-}
16181199pushAlwaysCheap :: Reflex t => (a -> PushM t b) -> Event t a -> Event t b
16191200pushAlwaysCheap f = pushCheap (fmap Just . f)
16201201
1621−-- | A "cheap" version of 'mapMaybe'. See the performance note on 'pushCheap'.
1622−{-# INLINE mapMaybeCheap #-}
1623−mapMaybeCheap :: Reflex t => (a -> Maybe b) -> Event t a -> Event t b
1624−mapMaybeCheap f = pushCheap $ return . f
1625−
1626−-- | An alias for 'mapMaybeCheap'
16271202{-# INLINE fmapMaybeCheap #-}
16281203fmapMaybeCheap :: Reflex t => (a -> Maybe b) -> Event t a -> Event t b
1629−fmapMaybeCheap = mapMaybeCheap
1204+fmapMaybeCheap f = pushCheap $ return . f
16301205
1631−
1632−-- | A "cheap" version of 'fforMaybe'. See the performance note on 'pushCheap'.
16331206{-# INLINE fforMaybeCheap #-}
16341207fforMaybeCheap :: Reflex t => Event t a -> (a -> Maybe b) -> Event t b
1635−fforMaybeCheap = flip mapMaybeCheap
1208+fforMaybeCheap = flip fmapMaybeCheap
16361209
1637−-- | A "cheap" version of 'ffor'. See the performance note on 'pushCheap'.
16381210{-# INLINE fforCheap #-}
16391211fforCheap :: Reflex t => Event t a -> (a -> b) -> Event t b
16401212fforCheap = flip fmapCheap
16411213
1642−-- | A "cheap" version of 'fmap'. See the performance note on 'pushCheap'.
16431214{-# INLINE fmapCheap #-}
16441215fmapCheap :: Reflex t => (a -> b) -> Event t a -> Event t b
16451216fmapCheap f = pushCheap $ return . Just . f
16461217
1647−-- | A "cheap" version of 'tag'. See the performance note on 'pushCheap'.
16481218{-# INLINE tagCheap #-}
16491219tagCheap :: Reflex t => Behavior t b -> Event t a -> Event t b
16501220tagCheap b = pushAlwaysCheap $ \_ -> sample b
16511221
1652−-- | Merge a collection of events; the resulting 'Event' will only occur if at
1653−-- least one input event is occurring, and will contain all of the input keys
1654−-- that are occurring simultaneously
1655−merge :: (Reflex t, GCompare k) => DMap k (Event t) -> Event t (DMap k Identity)
1656−merge = mergeG coerceEvent
1657−{-# INLINE merge #-}
1658−
1659−-- | Create a merge whose parents can change over time
1660−mergeIncremental :: (Reflex t, GCompare k)
1661− => Incremental t (PatchDMap k (Event t)) -> Event t (DMap k Identity)
1662−mergeIncremental = mergeIncrementalG coerceEvent
1663−
1664−-- | Experimental: Create a merge whose parents can change over time; changing the key of an Event is more efficient than with mergeIncremental
1665−mergeIncrementalWithMove :: (Reflex t, GCompare k)
1666− => Incremental t (PatchDMapWithMove k (Event t)) -> Event t (DMap k Identity)
1667−mergeIncrementalWithMove = mergeIncrementalWithMoveG coerceEvent
1668−
1669−-- | A "cheap" version of 'mergeWithCheap'. See the performance note on 'pushCheap'.
16701222{-# INLINE mergeWithCheap #-}
16711223mergeWithCheap :: Reflex t => (a -> a -> a) -> [Event t a] -> Event t a
16721224mergeWithCheap = mergeWithCheap' id
16731225
1674−-- | A "cheap" version of 'mergeWithCheap''. See the performance note on 'pushCheap'.
16751226{-# INLINE mergeWithCheap' #-}
16761227mergeWithCheap' :: Reflex t => (a -> b) -> (b -> b -> b) -> [Event t a] -> Event t b
16771228mergeWithCheap' f g = mergeWithFoldCheap' $ foldl1 g . fmap f
16781229
1679−-- | A "cheap" version of 'mergeWithFoldCheap''. See the performance note on 'pushCheap'.
16801230{-# INLINE mergeWithFoldCheap' #-}
16811231mergeWithFoldCheap' :: Reflex t => (NonEmpty a -> b) -> [Event t a] -> Event t b
16821232mergeWithFoldCheap' f es =
@@ -1689,11 +1239,24 @@ mergeWithFoldCheap' f es =
16891239-- Deprecated functions
16901240--------------------------------------------------------------------------------
16911241
1692−{-# DEPRECATED switchPromptly "Use 'switchHoldPromptly' instead. The 'switchHold*' naming convention was chosen because those functions are more closely related to each other than they are to 'switch'. " #-}
1693−-- | See 'switchHoldPromptly'
1694−switchPromptly :: (Reflex t, MonadHold t m) => Event t a -> Event t (Event t a) -> m (Event t a)
1695−switchPromptly = switchHoldPromptly
1696−{-# DEPRECATED switchPromptOnly "Use 'switchHoldPromptOnly' instead. The 'switchHold*' naming convention was chosen because those functions are more closely related to each other than they are to 'switch'. " #-}
1697−-- | See 'switchHoldPromptOnly'
1698−switchPromptOnly :: (Reflex t, MonadHold t m) => Event t a -> Event t (Event t a) -> m (Event t a)
1699−switchPromptOnly = switchHoldPromptOnly
1242+-- | Create a new 'Event' that occurs if at least one of the supplied 'Event's
1243+-- occurs. If both occur at the same time they are combined using 'mappend'.
1244+{-# DEPRECATED appendEvents "If a 'Semigroup a' instance is available, use 'mappend'; otherwise, use 'alignWith (mergeThese mappend)' instead" #-}
1245+appendEvents :: (Reflex t, Monoid a) => Event t a -> Event t a -> Event t a
1246+appendEvents = alignWith $ mergeThese mappend
1247+
1248+-- | Alias for 'headE'
1249+{-# DEPRECATED onceE "Use 'headE' instead" #-}
1250+onceE :: (Reflex t, MonadHold t m, MonadFix m) => Event t a -> m (Event t a)
1251+onceE = headE
1252+
1253+-- | Run both sides of a 'These' monadically, combining the results.
1254+{-# DEPRECATED sequenceThese "Use bisequenceA or bisequence from the bifunctors package instead" #-}
1255+#ifdef USE_TEMPLATE_HASKELL
1256+{-# ANN sequenceThese "HLint: ignore Use fmap" #-}
1257+#endif
1258+sequenceThese :: Monad m => These (m a) (m b) -> m (These a b)
1259+sequenceThese t = case t of
1260+ This ma -> fmap This ma
1261+ These ma mb -> liftM2 These ma mb
1262+ That mb -> fmap That mb
src/Reflex/Collection.hsdeleted−225
@@ -1,225 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−{-# LANGUAGE FlexibleInstances #-}
3−{-# LANGUAGE LambdaCase #-}
4−{-# LANGUAGE MultiParamTypeClasses #-}
5−{-# LANGUAGE RankNTypes #-}
6−{-# LANGUAGE RecursiveDo #-}
7−{-# LANGUAGE ScopedTypeVariables #-}
8−{-# LANGUAGE TypeFamilies #-}
9−{-# LANGUAGE UndecidableInstances #-}
10−#ifdef USE_REFLEX_OPTIMIZER
11−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
12−#endif
13−-- |
14−-- Module:
15−-- Reflex.Collection
16−module Reflex.Collection
17− (
18− -- * Widgets on Collections
19− listHoldWithKey
20− , listWithKey
21− , listWithKeyShallowDiff
22− , listViewWithKey
23− , selectViewListWithKey
24− , selectViewListWithKey_
25− -- * List Utils
26− , list
27− , simpleList
28− ) where
29−
30−#ifdef MIN_VERSION_semialign
31−import Prelude hiding (zip, zipWith)
32−#if MIN_VERSION_semialign(1,1,0)
33−import Data.Zip (Zip (..))
34−#endif
35−#endif
36−
37−import Control.Monad.Identity
38−import Data.Align
39−import Data.Functor.Misc
40−import Data.Map (Map)
41−import qualified Data.Map as Map
42−import Data.Map.Misc
43−import Data.These
44−
45−import Reflex.Class
46−import Reflex.Adjustable.Class
47−import Reflex.Dynamic
48−import Reflex.PostBuild.Class
49−
50−-- | Create a set of widgets based on the provided 'Map'. When the
51−-- input 'Event' fires, remove widgets for keys with the value 'Nothing'
52−-- and add/replace widgets for keys with 'Just' values.
53−listHoldWithKey
54− :: forall t m k v a
55− . (Ord k, Adjustable t m, MonadHold t m)
56− => Map k v
57− -> Event t (Map k (Maybe v))
58− -> (k -> v -> m a)
59− -> m (Dynamic t (Map k a))
60−listHoldWithKey m0 m' f = do
61− let dm0 = mapWithFunctorToDMap $ Map.mapWithKey f m0
62− dm' = fmap
63− (PatchDMap . mapWithFunctorToDMap . Map.mapWithKey
64− (\k v -> ComposeMaybe $ fmap (f k) v)
65− )
66− m'
67− (a0, a') <- sequenceDMapWithAdjust dm0 dm'
68−
69− --TODO: Move the dmapToMap to the righthand side so it doesn't get
70− --fully redone every time
71− fmap dmapToMap . incrementalToDynamic <$> holdIncremental a0 a'
72−
73−--TODO: Something better than Dynamic t (Map k v) - we want something
74−--where the Events carry diffs, not the whole value
75−listWithKey
76− :: forall t k v m a
77− . (Ord k, Adjustable t m, PostBuild t m, MonadFix m, MonadHold t m)
78− => Dynamic t (Map k v)
79− -> (k -> Dynamic t v -> m a)
80− -> m (Dynamic t (Map k a))
81−listWithKey vals mkChild = do
82− postBuild <- getPostBuild
83− let childValChangedSelector = fanMap $ updated vals
84−
85− -- We keep track of changes to children values in the mkChild
86− -- function we pass to listHoldWithKey The other changes we need
87− -- to keep track of are child insertions and
88− -- deletions. diffOnlyKeyChanges keeps track of insertions and
89− -- deletions but ignores value changes, since they're already
90− -- accounted for.
91− diffOnlyKeyChanges olds news =
92− flip Map.mapMaybe (align olds news) $ \case
93− This _ -> Just Nothing
94− These _ _ -> Nothing
95− That new -> Just $ Just new
96− rec sentVals :: Dynamic t (Map k v) <- foldDyn applyMap Map.empty changeVals
97− let changeVals :: Event t (Map k (Maybe v))
98− changeVals =
99− attachWith diffOnlyKeyChanges (current sentVals) $ leftmost
100− [ updated vals
101−
102− -- TODO: This should probably be added to the
103− -- attachWith, not to the updated; if we were using
104− -- diffMap instead of diffMapNoEq, I think it might not
105− -- work
106− , tag (current vals) postBuild
107− ]
108− listHoldWithKey Map.empty changeVals $ \k v ->
109− mkChild k =<< holdDyn v (select childValChangedSelector $ Const2 k)
110−
111−-- | Display the given map of items (in key order) using the builder
112−-- function provided, and update it with the given event. 'Nothing'
113−-- update entries will delete the corresponding children, and 'Just'
114−-- entries will create them if they do not exist or send an update
115−-- event to them if they do.
116−listWithKeyShallowDiff
117− :: (Ord k, Adjustable t m, MonadFix m, MonadHold t m)
118− => Map k v
119− -> Event t (Map k (Maybe v))
120− -> (k -> v -> Event t v -> m a)
121− -> m (Dynamic t (Map k a))
122−listWithKeyShallowDiff initialVals valsChanged mkChild = do
123− let childValChangedSelector = fanMap $ fmap (Map.mapMaybe id) valsChanged
124− sentVals <- foldDyn applyMap (void initialVals) $ fmap (fmap void) valsChanged
125− let relevantPatch patch _ = case patch of
126−
127− -- Even if we let a Nothing through when the element doesn't
128− -- already exist, this doesn't cause a problem because it is
129− -- ignored
130− Nothing -> Just Nothing
131−
132− -- We don't want to let spurious re-creations of items through
133− Just _ -> Nothing
134− listHoldWithKey
135− initialVals
136− (attachWith (flip (Map.differenceWith relevantPatch))
137− (current sentVals)
138− valsChanged
139− )
140− $ \k v -> mkChild k v $ select childValChangedSelector $ Const2 k
141−
142−--TODO: Something better than Dynamic t (Map k v) - we want something
143−--where the Events carry diffs, not the whole value
144−-- | Create a dynamically-changing set of Event-valued widgets. This
145−-- is like 'listWithKey', specialized for widgets returning @/Event t a/@.
146−-- 'listWithKey' would return @/Dynamic t (Map k (Event t a))/@ in
147−-- this scenario, but 'listViewWithKey' flattens this to
148−-- @/Event t (Map k a)/@ via 'switch'.
149−listViewWithKey
150− :: (Ord k, Adjustable t m, PostBuild t m, MonadHold t m, MonadFix m)
151− => Dynamic t (Map k v)
152− -> (k -> Dynamic t v -> m (Event t a))
153− -> m (Event t (Map k a))
154−listViewWithKey vals mkChild =
155− switch . fmap mergeMap <$> listViewWithKey' vals mkChild
156−
157−listViewWithKey'
158− :: (Ord k, Adjustable t m, PostBuild t m, MonadHold t m, MonadFix m)
159− => Dynamic t (Map k v)
160− -> (k -> Dynamic t v -> m a)
161− -> m (Behavior t (Map k a))
162−listViewWithKey' vals mkChild = current <$> listWithKey vals mkChild
163−
164−-- | Create a dynamically-changing set of widgets, one of which is
165−-- selected at any time.
166−selectViewListWithKey
167− :: forall t m k v a
168− . (Adjustable t m, Ord k, PostBuild t m, MonadHold t m, MonadFix m)
169− => Dynamic t k
170− -- ^ Current selection key
171− -> Dynamic t (Map k v)
172− -- ^ Dynamic key/value map
173− -> (k -> Dynamic t v -> Dynamic t Bool -> m (Event t a))
174− -- ^ Function to create a widget for a given key from Dynamic value
175− -- and Dynamic Bool indicating if this widget is currently selected
176− -> m (Event t (k, a))
177− -- ^ Event that fires when any child's return Event fires. Contains
178− -- key of an arbitrary firing widget.
179−selectViewListWithKey selection vals mkChild = do
180− -- For good performance, this value must be shared across all children
181− let selectionDemux = demux selection
182− selectChild <- listWithKey vals $ \k v -> do
183− let selected = demuxed selectionDemux k
184− selectSelf <- mkChild k v selected
185− return $ fmap ((,) k) selectSelf
186− return $ switchPromptlyDyn $ leftmost . Map.elems <$> selectChild
187−
188−-- | Like 'selectViewListWithKey' but discards the value of the list
189−-- item widget's output 'Event'.
190−selectViewListWithKey_
191− :: forall t m k v a
192− . (Adjustable t m, Ord k, PostBuild t m, MonadHold t m, MonadFix m)
193− => Dynamic t k
194− -- ^ Current selection key
195− -> Dynamic t (Map k v)
196− -- ^ Dynamic key/value map
197− -> (k -> Dynamic t v -> Dynamic t Bool -> m (Event t a))
198− -- ^ Function to create a widget for a given key from Dynamic value
199− -- and Dynamic Bool indicating if this widget is currently selected
200− -> m (Event t k)
201− -- ^ Event that fires when any child's return Event fires. Contains
202− -- key of an arbitrary firing widget.
203−selectViewListWithKey_ selection vals mkChild =
204− fmap fst <$> selectViewListWithKey selection vals mkChild
205−
206−-- | Create a dynamically-changing set of widgets from a Dynamic
207−-- key/value map. Unlike the 'withKey' variants, the child widgets
208−-- are insensitive to which key they're associated with.
209−list
210− :: (Ord k, Adjustable t m, MonadHold t m, PostBuild t m, MonadFix m)
211− => Dynamic t (Map k v)
212− -> (Dynamic t v -> m a)
213− -> m (Dynamic t (Map k a))
214−list dm mkChild = listWithKey dm (\_ dv -> mkChild dv)
215−
216−-- | Create a dynamically-changing set of widgets from a Dynamic list.
217−simpleList
218− :: (Adjustable t m, MonadHold t m, PostBuild t m, MonadFix m)
219− => Dynamic t [v]
220− -> (Dynamic t v -> m a)
221− -> m (Dynamic t [a])
222−simpleList xs mkChild =
223− fmap (fmap (map snd . Map.toList)) $ flip list mkChild $ fmap
224− (Map.fromList . zip [(1 :: Int) ..])
225− xs
src/Reflex/Dynamic.hs+234−92
@@ -17,24 +17,17 @@
1717#ifdef USE_REFLEX_OPTIMIZER
1818{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
1919#endif
20−-- |
21−-- Module:
22−-- Reflex.Dynamic
23−-- Description:
24−-- This module contains various functions for working with 'Dynamic' values.
25−-- 'Dynamic' and its primitives have been moved to the 'Reflex' class.
20+-- | This module contains various functions for working with 'Dynamic' values.
21+-- 'Dynamic' and its primitives have been moved to the 'Reflex' class.
2622module Reflex.Dynamic
2723 ( -- * Basics
2824 Dynamic -- Abstract so we can preserve the law that the current value is always equal to the most recent update
2925 , current
3026 , updated
3127 , holdDyn
32− , mapDynM
33− , forDynM
3428 , constDyn
3529 , count
3630 , toggle
37− , switchDyn
3831 , switchPromptlyDyn
3932 , tagPromptlyDyn
4033 , attachPromptlyDyn
@@ -53,18 +46,15 @@ module Reflex.Dynamic
5346 , foldDynMaybe
5447 , foldDynMaybeM
5548 , joinDynThroughMap
56− , joinDynThroughIntMap
5749 , traceDyn
5850 , traceDynWith
5951 , splitDynPure
6052 , distributeMapOverDynPure
61− , distributeIntMapOverDynPure
6253 , distributeDMapOverDynPure
6354 , distributeListOverDynPure
6455 , Demux
6556 , demux
6657 , demuxed
67− -- * Miscellaneous
6858 -- Things that probably aren't very useful:
6959 , HList (..)
7060 , FHList (..)
@@ -74,14 +64,36 @@ module Reflex.Dynamic
7464 , AllAreFunctors (..)
7565 , HListPtr (..)
7666 , distributeFHListOverDynPure
77− -- * Unsafe
67+ -- Unsafe
7868 , unsafeDynamic
69+ -- * Deprecated functions
70+ , apDyn
71+ , attachDyn
72+ , attachDynWith
73+ , attachDynWithMaybe
74+ , collectDyn
75+ , combineDyn
76+ , distributeDMapOverDyn
77+ , distributeFHListOverDyn
78+ , forDyn
79+ , forDynM
80+ , getDemuxed
81+ , joinDyn
82+ , mapDyn
83+ , mapDynM
84+ , mconcatDyn
85+ , nubDyn
86+ , splitDyn
87+ , tagDyn
88+ , uniqDyn
89+ , uniqDynBy
7990 ) where
8091
8192import Data.Functor.Compose
8293import Data.Functor.Misc
8394import Reflex.Class
8495
96+import Control.Applicative ((<*>))
8597import Control.Monad
8698import Control.Monad.Fix
8799import Control.Monad.Identity
@@ -89,25 +101,14 @@ import Data.Align
89101import Data.Dependent.Map (DMap)
90102import qualified Data.Dependent.Map as DMap
91103import Data.Dependent.Sum (DSum (..))
92−import Data.GADT.Compare (GCompare (..), GEq (..), GOrdering (..))
93−import Data.IntMap (IntMap)
94−import qualified Data.IntMap as IntMap
104+import Data.GADT.Compare ((:~:) (..), GCompare (..), GEq (..), GOrdering (..))
95105import Data.Map (Map)
96106import Data.Maybe
97−import Data.Monoid ((<>))
107+import Data.Monoid
98108import Data.These
99−import Data.Type.Equality ((:~:) (..))
100109
101110import Debug.Trace
102111
103−-- | Map a sampling function over a 'Dynamic'.
104−mapDynM :: forall t m a b. (Reflex t, MonadHold t m) => (forall m'. MonadSample t m' => a -> m' b) -> Dynamic t a -> m (Dynamic t b)
105−mapDynM f d = buildDynamic (f =<< sample (current d)) $ pushAlways f (updated d)
106−
107−-- | Flipped version of 'mapDynM'
108−forDynM :: forall t m a b. (Reflex t, MonadHold t m) => Dynamic t a -> (forall m'. MonadSample t m' => a -> m' b) -> m (Dynamic t b)
109−forDynM d f = mapDynM f d
110−
111112-- | Create a new 'Dynamic' that only signals changes if the values actually
112113-- changed.
113114holdUniqDyn :: (Reflex t, MonadHold t m, MonadFix m, Eq a) => Dynamic t a -> m (Dynamic t a)
@@ -119,7 +120,7 @@ holdUniqDyn = holdUniqDynBy (==)
119120holdUniqDynBy :: (Reflex t, MonadHold t m, MonadFix m) => (a -> a -> Bool) -> Dynamic t a -> m (Dynamic t a)
120121holdUniqDynBy eq = scanDynMaybe id (\new old -> if new `eq` old then Nothing else Just new)
121122
122−-- | @/Dynamic Maybe/@ that can only update from @/Nothing/@ to @/Just/@ or @/Just/@ to @/Just/@ (i.e., cannot revert to @/Nothing/@)
123+-- | Dynamic Maybe that can only update from Nothing to Just or Just to Just (i.e., cannot revert to Nothing)
123124improvingMaybe :: (Reflex t, MonadHold t m, MonadFix m) => Dynamic t (Maybe a) -> m (Dynamic t (Maybe a))
124125improvingMaybe = scanDynMaybe id (\new _ -> if isJust new then Just new else Nothing)
125126
@@ -163,7 +164,7 @@ foldDynMaybe = accumMaybeDyn . flip
163164foldDynMaybeM :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe b)) -> b -> Event t a -> m (Dynamic t b)
164165foldDynMaybeM = accumMaybeMDyn . flip
165166
166−-- | Create a new 'Dynamic' that counts the occurrences of the 'Event'.
167+-- | Create a new 'Dynamic' that counts the occurences of the 'Event'.
167168count :: (Reflex t, MonadHold t m, MonadFix m, Num b) => Event t a -> m (Dynamic t b)
168169count e = holdDyn 0 =<< zipListWithEvent const (iterate (+1) 1) e
169170
@@ -172,25 +173,10 @@ count e = holdDyn 0 =<< zipListWithEvent const (iterate (+1) 1) e
172173toggle :: (Reflex t, MonadHold t m, MonadFix m) => Bool -> Event t a -> m (Dynamic t Bool)
173174toggle = foldDyn (const not)
174175
175−-- | Switches to the new 'Event' whenever it receives one. Only the old event is
176−-- considered the moment a new one is switched in; the output event will fire at
177−-- that moment if only if the old event does.
178−--
179−-- Prefer this to 'switchPromptlyDyn' where possible. The lack of doing double
180−-- work when the outer and (new) inner fires means this imposes fewer "timing
181−-- requirements" and thus is far more easy to use without introducing fresh
182−-- failure cases. 'switchDyn' is also more performant.
183−switchDyn :: forall t a. Reflex t => Dynamic t (Event t a) -> Event t a
184−switchDyn d = switch (current d)
185−
186176-- | Switches to the new 'Event' whenever it receives one. Switching occurs
187−-- __before__ the inner 'Event' fires - so if the 'Dynamic' changes and both the
177+-- *before* the inner 'Event' fires - so if the 'Dynamic' changes and both the
188178-- old and new inner Events fire simultaneously, the output will fire with the
189−-- value of the __new__ 'Event'.
190−--
191−-- Prefer 'switchDyn' to this where possible. The timing requirements that
192−-- switching before imposes are likely to bring down your app unless you are
193−-- very careful. 'switchDyn' is also more performant.
179+-- value of the *new* 'Event'.
194180switchPromptlyDyn :: forall t a. Reflex t => Dynamic t (Event t a) -> Event t a
195181switchPromptlyDyn de =
196182 let eLag = switch $ current de
@@ -206,30 +192,28 @@ splitDynPure d = (fmap fst d, fmap snd d)
206192distributeMapOverDynPure :: (Reflex t, Ord k) => Map k (Dynamic t v) -> Dynamic t (Map k v)
207193distributeMapOverDynPure = fmap dmapToMap . distributeDMapOverDynPure . mapWithFunctorToDMap
208194
209−-- | Convert an 'IntMap' with 'Dynamic' elements into a 'Dynamic' of an 'IntMap' with
210−-- non-'Dynamic' elements.
211−distributeIntMapOverDynPure :: (Reflex t) => IntMap (Dynamic t v) -> Dynamic t (IntMap v)
212−distributeIntMapOverDynPure = fmap dmapToIntMap . distributeDMapOverDynPure . intMapWithFunctorToDMap
213−
214195-- | Convert a list with 'Dynamic' elements into a 'Dynamic' of a list with
215196-- non-'Dynamic' elements, preserving the order of the elements.
216−{-# DEPRECATED distributeListOverDynPure "Use 'distributeListOverDyn' instead" #-}
217197distributeListOverDynPure :: Reflex t => [Dynamic t v] -> Dynamic t [v]
218−distributeListOverDynPure = distributeListOverDyn
198+distributeListOverDynPure =
199+ fmap (map fromDSum . DMap.toAscList) .
200+ distributeDMapOverDynPure .
201+ DMap.fromDistinctAscList .
202+ zipWith toDSum [0..]
203+ where
204+ toDSum :: Int -> Dynamic t a -> DSum (Const2 Int a) (Dynamic t)
205+ toDSum k v = Const2 k :=> v
206+ fromDSum :: DSum (Const2 Int a) Identity -> a
207+ fromDSum (Const2 _ :=> Identity v) = v
219208
220209--TODO: Generalize this to functors other than Maps
221210-- | Combine a 'Dynamic' of a 'Map' of 'Dynamic's into a 'Dynamic'
222211-- with the current values of the 'Dynamic's in a map.
223212joinDynThroughMap :: forall t k a. (Reflex t, Ord k) => Dynamic t (Map k (Dynamic t a)) -> Dynamic t (Map k a)
224−joinDynThroughMap = (distributeMapOverDynPure =<<)
225−
226−-- | Combine a 'Dynamic' of an 'IntMap' of 'Dynamic's into a 'Dynamic'
227−-- with the current values of the 'Dynamic's in a map.
228−joinDynThroughIntMap :: forall t a. (Reflex t) => Dynamic t (IntMap (Dynamic t a)) -> Dynamic t (IntMap a)
229−joinDynThroughIntMap = (distributeIntMapOverDynPure =<<)
213+joinDynThroughMap = joinDyn . fmap distributeMapOverDynPure
230214
231215-- | Print the value of the 'Dynamic' when it is first read and on each
232−-- subsequent change that is observed (as 'traceEvent'), prefixed with the
216+-- subsequent change that is observed (as traceEvent), prefixed with the
233217-- provided string. This should /only/ be used for debugging.
234218--
235219-- Note: Just like Debug.Trace.trace, the value will only be shown if something
@@ -239,7 +223,7 @@ traceDyn s = traceDynWith $ \x -> s <> ": " <> show x
239223
240224-- | Print the result of applying the provided function to the value
241225-- of the 'Dynamic' when it is first read and on each subsequent change
242−-- that is observed (as 'traceEvent'). This should /only/ be used for
226+-- that is observed (as traceEvent). This should /only/ be used for
243227-- debugging.
244228--
245229-- Note: Just like Debug.Trace.trace, the value will only be shown if something
@@ -255,35 +239,36 @@ traceDynWith f d =
255239-- | Replace the value of the 'Event' with the current value of the 'Dynamic'
256240-- each time the 'Event' occurs.
257241--
258−-- Note: @/tagPromptlyDyn d e/@ differs from @/tag (current d) e/@ in the case that @/e/@ is firing
259−-- at the same time that @/d/@ is changing. With @/tagPromptlyDyn d e/@, the __new__ value of @/d/@
260−-- will replace the value of @/e/@, whereas with @/tag (current d) e/@, the __old__ value
242+-- Note: `tagPromptlyDyn d e` differs from `tag (current d) e` in the case that `e` is firing
243+-- at the same time that `d` is changing. With `tagPromptlyDyn d e`, the *new* value of `d`
244+-- will replace the value of `e`, whereas with `tag (current d) e`, the *old* value
261245-- will be used, since the 'Behavior' won't be updated until the end of the frame.
262246-- Additionally, this means that the output 'Event' may not be used to directly change
263−-- the input 'Dynamic', because that would mean its value depends on itself. __When creating__
264−-- __cyclic data flows, generally @/tag (current d) e/@ is preferred.__
247+-- the input 'Dynamic', because that would mean its value depends on itself. When creating
248+-- cyclic data flows, generally `tag (current d) e` is preferred.
265249tagPromptlyDyn :: Reflex t => Dynamic t a -> Event t b -> Event t a
266250tagPromptlyDyn = attachPromptlyDynWith const
267251
268252-- | Attach the current value of the 'Dynamic' to the value of the
269253-- 'Event' each time it occurs.
270254--
271−-- Note: @/attachPromptlyDyn d/@ is not the same as @/attach (current d)/@. See 'tagPromptlyDyn' for details.
255+-- Note: `attachPromptlyDyn d` is not the same as `attach (current d)`. See 'tagPromptlyDyn' for details.
272256attachPromptlyDyn :: Reflex t => Dynamic t a -> Event t b -> Event t (a, b)
273257attachPromptlyDyn = attachPromptlyDynWith (,)
274258
275259-- | Combine the current value of the 'Dynamic' with the value of the
276260-- 'Event' each time it occurs.
277261--
278−-- Note: @/attachPromptlyDynWith f d/@ is not the same as @/attachWith f (current d)/@. See 'tagPromptlyDyn' for details.
262+-- Note: `attachPromptlyDynWith f d` is not the same as `attachWith f (current d)`. See 'tagPromptlyDyn' for details.
279263attachPromptlyDynWith :: Reflex t => (a -> b -> c) -> Dynamic t a -> Event t b -> Event t c
280264attachPromptlyDynWith f = attachPromptlyDynWithMaybe $ \a b -> Just $ f a b
281265
282−-- | Create a new 'Event' by combining the value at each occurrence with the
266+-- | Create a new 'Event' by combining the value at each occurence with the
283267-- current value of the 'Dynamic' value and possibly filtering if the combining
284268-- function returns 'Nothing'.
285269--
286−-- Note: @/attachPromptlyDynWithMaybe f d/@ is not the same as @/attachWithMaybe f (current d)/@. See 'tagPromptlyDyn' for details.
270+-- Note: `attachPromptlyDynWithMaybe f d` is not the same as `attachWithMaybe f
271+-- (current d)`. See 'tagPromptlyDyn' for details.
287272attachPromptlyDynWithMaybe :: Reflex t => (a -> b -> Maybe c) -> Dynamic t a -> Event t b -> Event t c
288273attachPromptlyDynWithMaybe f d e =
289274 let e' = attach (current d) e
@@ -292,8 +277,8 @@ attachPromptlyDynWithMaybe f d e =
292277 These (_, b) a -> f a b -- Both events are firing, so use the newer value
293278 That _ -> Nothing -- The tagging event isn't firing, so don't fire
294279
295−-- | Factor a @/Dynamic t (Maybe a)/@ into a @/Dynamic t (Maybe (Dynamic t a))/@,
296−-- such that the outer 'Dynamic' is updated only when the "Maybe"'s constructor
280+-- | Factor a @Dynamic t (Maybe a)@ into a @Dynamic t (Maybe (Dynamic t a))@,
281+-- such that the outer 'Dynamic' is updated only when the 'Maybe''s constructor
297282-- chages from 'Nothing' to 'Just' or vice-versa. Whenever the constructor
298283-- becomes 'Just', an inner 'Dynamic' will be provided, whose value will track
299284-- the 'a' inside the 'Just'; when the constructor becomes 'Nothing', the
@@ -308,8 +293,6 @@ maybeDyn = fmap (fmap unpack) . eitherDyn . fmap pack
308293 Left _ -> Nothing
309294 Right a -> Just a
310295
311−-- | Turns a 'Dynamic t (Either a b)' into a 'Dynamic t (Either (Dynamic t a) (Dynamic t b))' such that
312−-- the outer 'Dynamic' is updated only when the 'Either' constructor changes (e.g., from 'Left' to 'Right').
313296eitherDyn :: forall t a b m. (Reflex t, MonadFix m, MonadHold t m) => Dynamic t (Either a b) -> m (Dynamic t (Either (Dynamic t a) (Dynamic t b)))
314297eitherDyn = fmap (fmap unpack) . factorDyn . fmap eitherToDSum
315298 where unpack :: DSum (EitherTag a b) (Compose (Dynamic t) Identity) -> Either (Dynamic t a) (Dynamic t b)
@@ -317,23 +300,26 @@ eitherDyn = fmap (fmap unpack) . factorDyn . fmap eitherToDSum
317300 LeftTag :=> Compose a -> Left $ coerceDynamic a
318301 RightTag :=> Compose b -> Right $ coerceDynamic b
319302
320−-- | Factor a 'Dynamic t DSum' into a 'Dynamic' 'DSum' containing nested 'Dynamic' values.
321−-- The outer 'Dynamic' updates only when the key of the 'DSum' changes, while the update of the inner
322−-- 'Dynamic' represents updates within the current key.
323−factorDyn :: forall t m k v. (Reflex t, MonadHold t m, GEq k)
324− => Dynamic t (DSum k v) -> m (Dynamic t (DSum k (Compose (Dynamic t) v)))
325−factorDyn d = buildDynamic (sample (current d) >>= holdKey) update where
326− update :: Event t (DSum k (Compose (Dynamic t) v))
327− update = flip push (updated d) $ \(newKey :=> newVal) -> do
328− (oldKey :=> _) <- sample (current d)
329− case newKey `geq` oldKey of
330− Just Refl -> return Nothing
331− Nothing -> Just <$> holdKey (newKey :=> newVal)
332−
333− holdKey (k :=> v) = do
334− inner' <- filterEventKey k (updated d)
335− inner <- holdDyn v inner'
336− return $ k :=> Compose inner
303+factorDyn :: forall t m k v. (Reflex t, MonadFix m, MonadHold t m, GEq k) => Dynamic t (DSum k v) -> m (Dynamic t (DSum k (Compose (Dynamic t) v)))
304+factorDyn d = do
305+ let inner :: forall m' a. (MonadFix m', MonadHold t m') => k a -> v a -> m' (Dynamic t (v a))
306+ inner k v0 = holdDyn v0 . fmapMaybe id =<< takeWhileE isJust newVal
307+ where newVal = ffor (updated d) $ \(newK :=> newV) -> case newK `geq` k of
308+ Just Refl -> Just newV
309+ Nothing -> Nothing
310+ getInitial = do
311+ k0 :=> (v0 :: v a) <- sample $ current d
312+ i0 <- inner k0 v0
313+ return $ k0 :=> Compose i0
314+ update = flip push (updated d) $ \(newKey :=> newVal) -> do
315+ (oldKey :=> _) <- sample $ current d
316+ case newKey `geq` oldKey of
317+ Just Refl -> return Nothing
318+ Nothing -> do
319+ newInner <- inner newKey newVal
320+ return $ Just $ newKey :=> Compose newInner
321+ o0 <- getInitial --TODO: Figure out how to get this to run inside something like the first argument to buildDynamic
322+ holdDyn o0 update
337323
338324--------------------------------------------------------------------------------
339325-- Demux
@@ -348,7 +334,7 @@ factorDyn d = buildDynamic (sample (current d) >>= holdKey) update where
348334--
349335-- > demuxed (demux d) k === fmap (== k) d
350336--
351−-- However, when 'demuxed' is used multiple times, the complexity is only
337+-- However, the when getDemuxed is used multiple times, the complexity is only
352338-- /O(log(n))/, rather than /O(n)/ for fmap.
353339data Demux t k = Demux { demuxValue :: Behavior t k
354340 , demuxSelector :: EventSelector t (Const2 k Bool)
@@ -418,12 +404,21 @@ data FHList f l where
418404 FHCons :: f e -> FHList f l -> FHList f (e ': l)
419405
420406instance GEq (HListPtr l) where
407+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
408+ geqToEq _ = id
409+ geqUnify HHeadPtr HHeadPtr _ same = same
410+ geqUnify (HTailPtr a) (HTailPtr b) different same = geqUnify a b different same
411+ geqUnify _ _ different _ = different
412+#endif
421413 HHeadPtr `geq` HHeadPtr = Just Refl
422414 HHeadPtr `geq` HTailPtr _ = Nothing
423415 HTailPtr _ `geq` HHeadPtr = Nothing
424416 HTailPtr a `geq` HTailPtr b = a `geq` b
425417
426418instance GCompare (HListPtr l) where -- Warning: This ordering can't change, dmapTo*HList will break
419+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
420+ gcompareToOrd _ = id
421+#endif
427422 HHeadPtr `gcompare` HHeadPtr = GEQ
428423 HHeadPtr `gcompare` HTailPtr _ = GLT
429424 HTailPtr _ `gcompare` HHeadPtr = GGT
@@ -502,7 +497,7 @@ instance AllAreFunctors f t => AllAreFunctors f (h ': t) where
502497
503498-- | Convert a datastructure whose constituent parts are all 'Dynamic's into a
504499-- single 'Dynamic' whose value represents all the current values of the input's
505−-- constituent 'Dynamic's.
500+-- consitutent 'Dynamic's.
506501collectDynPure :: ( RebuildSortedHList (HListElems b)
507502 , IsHList a, IsHList b
508503 , AllAreFunctors (Dynamic t) (HListElems b)
@@ -543,3 +538,150 @@ instance IsHList (a, b, c, d, e, f) where
543538#if !defined(__GLASGOW_HASKELL__) || __GLASGOW_HASKELL__ < 800
544539 _ -> error "fromHList: impossible" -- Otherwise, GHC complains of a non-exhaustive pattern match; see https://ghc.haskell.org/trac/ghc/ticket/4139
545540#endif
541+
542+--------------------------------------------------------------------------------
543+-- Deprecated functions
544+--------------------------------------------------------------------------------
545+
546+-- | Map a function over a 'Dynamic'.
547+{-# DEPRECATED mapDyn "Use 'return . fmap f' instead of 'mapDyn f'; consider eliminating monadic style" #-}
548+mapDyn :: (Reflex t, Monad m) => (a -> b) -> Dynamic t a -> m (Dynamic t b)
549+mapDyn f = return . fmap f
550+
551+-- | Map a sampling function over a 'Dynamic'. The sampling function will use the input 'Dynamic''s 'current' 'Behavior' until the first time its 'updated' 'Event' fires, at which point it will be invoked only once each time the 'Event' fires.
552+{-# DEPRECATED mapDynM "Consider using the Monad instance for Dynamic instead." #-}
553+mapDynM :: forall t m a b. (Reflex t, MonadHold t m) => (forall m'. MonadSample t m' => a -> m' b) -> Dynamic t a -> m (Dynamic t b)
554+mapDynM f d = do
555+ let e' = push (fmap Just . f :: a -> PushM t (Maybe b)) $ updated d
556+ eb' = fmap constant e'
557+ v0 = pull $ f =<< sample (current d)
558+ bb' :: Behavior t (Behavior t b) <- hold v0 eb'
559+ let b' = pull $ sample =<< sample bb'
560+ return $ unsafeDynamic b' e'
561+
562+-- | Flipped version of 'mapDyn'.
563+{-# DEPRECATED forDyn "Use 'return . ffor a' instead of 'forDyn a'; consider eliminating monadic style" #-}
564+forDyn :: (Reflex t, Monad m) => Dynamic t a -> (a -> b) -> m (Dynamic t b)
565+forDyn a = return . ffor a
566+
567+-- | Flipped version of 'mapDynM'
568+{-# DEPRECATED forDynM "Consider using the Monad instance for Dynamic instead." #-}
569+forDynM :: forall t m a b. (Reflex t, MonadHold t m) => Dynamic t a -> (forall m'. MonadSample t m' => a -> m' b) -> m (Dynamic t b)
570+forDynM d f = mapDynM f d
571+
572+-- | Split the 'Dynamic' into two 'Dynamic's, each taking the respective value
573+-- of the tuple.
574+{-# DEPRECATED splitDyn "Use 'return . splitDynPure' instead; consider eliminating monadic style" #-}
575+splitDyn :: (Reflex t, Monad m) => Dynamic t (a, b) -> m (Dynamic t a, Dynamic t b)
576+splitDyn = return . splitDynPure
577+
578+-- | Merge the 'Dynamic' values using their 'Monoid' instance.
579+{-# DEPRECATED mconcatDyn "Use 'return . mconcat' instead; consider eliminating monadic style" #-}
580+mconcatDyn :: forall t m a. (Reflex t, Monad m, Monoid a) => [Dynamic t a] -> m (Dynamic t a)
581+mconcatDyn = return . mconcat
582+
583+-- | This function no longer needs to be monadic; see 'distributeMapOverDynPure'.
584+{-# DEPRECATED distributeDMapOverDyn "Use 'return . distributeDMapOverDynPure' instead; consider eliminating monadic style" #-}
585+distributeDMapOverDyn :: (Reflex t, Monad m, GCompare k) => DMap k (Dynamic t) -> m (Dynamic t (DMap k Identity))
586+distributeDMapOverDyn = return . distributeDMapOverDynPure
587+
588+-- | Merge two 'Dynamic's into a new one using the provided function. The new
589+-- 'Dynamic' changes its value each time one of the original 'Dynamic's changes
590+-- its value.
591+{-# DEPRECATED combineDyn "Use 'return (zipDynWith f a b)' instead of 'combineDyn f a b'; consider eliminating monadic style" #-}
592+combineDyn :: forall t m a b c. (Reflex t, Monad m) => (a -> b -> c) -> Dynamic t a -> Dynamic t b -> m (Dynamic t c)
593+combineDyn f a b = return $ zipDynWith f a b
594+
595+-- | A psuedo applicative version of ap for 'Dynamic'. Example useage:
596+--
597+-- > do
598+-- > person <- Person `mapDyn` dynFirstName
599+-- > `apDyn` dynListName
600+-- > `apDyn` dynAge
601+-- > `apDyn` dynAddress
602+{-# DEPRECATED apDyn "Use 'ffor m (<*> a)' instead of 'apDyn m a'; consider eliminating monadic style, since Dynamics are now Applicative and can be used with applicative style directly" #-}
603+#ifdef USE_TEMPLATE_HASKELL
604+{-# ANN apDyn "HLint: ignore Use fmap" #-}
605+#endif
606+apDyn :: forall t m a b. (Reflex t, Monad m)
607+ => m (Dynamic t (a -> b))
608+ -> Dynamic t a
609+ -> m (Dynamic t b)
610+apDyn m a = fmap (<*> a) m
611+
612+--TODO: The pattern of using hold (sample b0) can be reused in various places as a safe way of building certain kinds of Dynamics; see if we can factor this out
613+-- | This function no longer needs to be monadic, so it has been replaced by
614+-- 'demuxed', which is pure.
615+{-# DEPRECATED getDemuxed "Use 'return . demuxed d' instead of 'getDemuxed d'; consider eliminating monadic style" #-}
616+getDemuxed :: (Reflex t, Monad m, Eq k) => Demux t k -> k -> m (Dynamic t Bool)
617+getDemuxed d = return . demuxed d
618+
619+-- | This function no longer needs to be monadic, so it has been replaced by
620+-- 'distributeFHListOverDynPure', which is pure.
621+{-# DEPRECATED distributeFHListOverDyn "Use 'return . distributeFHListOverDynPure' instead; consider eliminating monadic style" #-}
622+distributeFHListOverDyn :: forall t m l. (Reflex t, Monad m, RebuildSortedHList l) => FHList (Dynamic t) l -> m (Dynamic t (HList l))
623+distributeFHListOverDyn = return . distributeFHListOverDynPure
624+
625+-- | This function no longer needs to be monadic, so it has been replaced by
626+-- 'collectDynPure', which is pure.
627+{-# DEPRECATED collectDyn "Use 'return . collectDynPure' instead; consider eliminating monadic style" #-}
628+collectDyn :: ( RebuildSortedHList (HListElems b)
629+ , IsHList a, IsHList b
630+ , AllAreFunctors (Dynamic t) (HListElems b)
631+ , Reflex t, Monad m
632+ , HListElems a ~ FunctorList (Dynamic t) (HListElems b)
633+ ) => a -> m (Dynamic t b)
634+collectDyn = return . collectDynPure
635+
636+-- | This function has been renamed to 'tagPromptlyDyn' to clarify its
637+-- semantics.
638+{-# DEPRECATED tagDyn "Use 'tagPromptlyDyn' instead" #-}
639+tagDyn :: Reflex t => Dynamic t a -> Event t b -> Event t a
640+tagDyn = tagPromptlyDyn
641+
642+-- | This function has been renamed to 'attachPromptlyDyn' to clarify its
643+-- semantics.
644+{-# DEPRECATED attachDyn "Use 'attachPromptlyDyn' instead" #-}
645+attachDyn :: Reflex t => Dynamic t a -> Event t b -> Event t (a, b)
646+attachDyn = attachPromptlyDyn
647+
648+-- | This function has been renamed to 'attachPromptlyDynWith' to clarify its
649+-- semantics.
650+{-# DEPRECATED attachDynWith "Use 'attachPromptlyDynWith' instead" #-}
651+attachDynWith :: Reflex t => (a -> b -> c) -> Dynamic t a -> Event t b -> Event t c
652+attachDynWith = attachPromptlyDynWith
653+
654+-- | This function has been renamed to 'attachPromptlyDynWithMaybe' to clarify
655+-- its semantics.
656+{-# DEPRECATED attachDynWithMaybe "Use 'attachPromptlyDynWithMaybe' instead" #-}
657+attachDynWithMaybe :: Reflex t => (a -> b -> Maybe c) -> Dynamic t a -> Event t b -> Event t c
658+attachDynWithMaybe = attachPromptlyDynWithMaybe
659+
660+-- | Combine an inner and outer 'Dynamic' such that the resulting 'Dynamic''s
661+-- current value will always be equal to the current value's current value, and
662+-- will change whenever either the inner or the outer (or both) values change.
663+{-# DEPRECATED joinDyn "Use 'join' instead" #-}
664+joinDyn :: Reflex t => Dynamic t (Dynamic t a) -> Dynamic t a
665+joinDyn = join
666+
667+-- | WARNING: This function is only pure if @a@'s 'Eq' instance tests
668+-- representational equality. Use 'holdUniqDyn' instead, which is pure in all
669+-- circumstances. Also, note that, unlike 'nub', this function does not prevent
670+-- all recurrences of a value, only consecutive recurrences.
671+{-# DEPRECATED nubDyn "Use 'holdUniqDyn' instead; note that it returns a MonadHold action rather than a pure Dynamic" #-}
672+nubDyn :: (Reflex t, Eq a) => Dynamic t a -> Dynamic t a
673+nubDyn = uniqDyn
674+
675+-- | WARNING: This function is only pure if @a@'s 'Eq' instance tests
676+-- representational equality. Use 'holdUniqDyn' instead, which is pure in all
677+-- circumstances.
678+{-# DEPRECATED uniqDyn "Use 'holdUniqDyn' instead; note that it returns a MonadHold action rather than a pure Dynamic" #-}
679+uniqDyn :: (Reflex t, Eq a) => Dynamic t a -> Dynamic t a
680+uniqDyn = uniqDynBy (==)
681+
682+-- | WARNING: This function is impure. Use 'holdUniqDynBy' instead.
683+{-# DEPRECATED uniqDynBy "Use 'holdUniqDynBy' instead; note that it returns a MonadHold action rather than a pure Dynamic" #-}
684+uniqDynBy :: Reflex t => (a -> a -> Bool) -> Dynamic t a -> Dynamic t a
685+uniqDynBy eq d =
686+ let e' = attachWithMaybe (\x x' -> if x' `eq` x then Nothing else Just x') (current d) (updated d)
687+ in unsafeDynamic (current d) e'
src/Reflex/Dynamic/TH.hs+28−4
@@ -13,6 +13,9 @@ module Reflex.Dynamic.TH
1313 ( qDynPure
1414 , unqDyn
1515 , mkDynPure
16+ -- * Deprecated functions
17+ , qDyn
18+ , mkDyn
1619 ) where
1720
1821import Reflex.Dynamic
@@ -20,7 +23,7 @@ import Reflex.Dynamic
2023import Control.Monad.State
2124import Data.Data
2225import Data.Generics
23−import Data.Monoid ((<>))
26+import Data.Monoid
2427import qualified Language.Haskell.Exts as Hs
2528import qualified Language.Haskell.Meta.Syntax.Translate as Hs
2629import Language.Haskell.TH
@@ -44,8 +47,8 @@ qDynPure qe = do
4447 _ -> gmapM f d
4548 (e', exprsReversed) <- runStateT (gmapM f e) []
4649 let exprs = reverse exprsReversed
47− arg = foldr (\a b -> ConE 'FHCons `AppE` snd a `AppE` b) (ConE 'FHNil) exprs
48− param = foldr (\a b -> ConP 'HCons [VarP (fst a), b]) (ConP 'HNil []) exprs
50+ arg = foldr (\a b -> ConE 'FHCons `AppE` a `AppE` b) (ConE 'FHNil) $ map snd exprs
51+ param = foldr (\a b -> ConP 'HCons [VarP a, b]) (ConP 'HNil []) $ map fst exprs
4952 [| $(return $ LamE [param] e') <$> distributeFHListOverDynPure $(return arg) |]
5053
5154-- | Antiquote a 'Dynamic' expression. This can /only/ be used inside of a
@@ -81,7 +84,7 @@ mkDynPure = QuasiQuoter
8184 }
8285
8386mkDynExp :: String -> Q Exp
84−mkDynExp s = case Hs.parseExpWithMode Hs.defaultParseMode { Hs.extensions = [ Hs.EnableExtension Hs.TemplateHaskell ] } s of
87+mkDynExp s = case Hs.parseExpWithMode (Hs.defaultParseMode { Hs.extensions = [ Hs.EnableExtension Hs.TemplateHaskell ] }) s of
8588 Hs.ParseFailed (Hs.SrcLoc _ l c) err -> fail $ "mkDyn:" <> show l <> ":" <> show c <> ": " <> err
8689 Hs.ParseOk e -> qDynPure $ return $ everywhere (id `extT` reinstateUnqDyn) $ Hs.toExp $ everywhere (id `extT` antiE) e
8790 where TH.Name (TH.OccName occName) (TH.NameG _ _ (TH.ModName modName)) = 'unqMarker
@@ -104,3 +107,24 @@ mkDynExp s = case Hs.parseExpWithMode Hs.defaultParseMode { Hs.extensions = [ Hs
104107 reinstateUnqDyn (TH.Name (TH.OccName occName') (TH.NameQ (TH.ModName modName')))
105108 | modName == modName' && occName == occName' = 'unqMarker
106109 reinstateUnqDyn x = x
110+
111+--------------------------------------------------------------------------------
112+-- Deprecated
113+--------------------------------------------------------------------------------
114+
115+{-# DEPRECATED qDyn "Instead of $(qDyn x), use return $(qDynPure x)" #-}
116+-- | Like 'qDynPure', but wraps its result monadically using 'return'. This is
117+-- no longer necessary, due to 'Dynamic' being an instance of 'Functor'.
118+qDyn :: Q Exp -> Q Exp
119+qDyn qe = [| return $(qDynPure qe) |]
120+
121+{-# DEPRECATED mkDyn "Instead of [mkDyn| x |], use return [mkDynPure| x |]" #-}
122+-- | Like 'mkDynPure', but wraps its result monadically using 'return'. This is
123+-- no longer necessary, due to 'Dynamic' being an instance of 'Functor'.
124+mkDyn :: QuasiQuoter
125+mkDyn = QuasiQuoter
126+ { quoteExp = \s -> [| return $(mkDynExp s) |]
127+ , quotePat = error "mkDyn: pattern splices are not supported"
128+ , quoteType = error "mkDyn: type splices are not supported"
129+ , quoteDec = error "mkDyn: declaration splices are not supported"
130+ }
src/Reflex/DynamicWriter.hs+189−4
@@ -1,7 +1,192 @@
1+-- | This module defines 'MonadDynamicWriter' and 'DynamicWriterT', its standard
2+-- implementation.
3+{-# LANGUAGE CPP #-}
4+{-# LANGUAGE FlexibleInstances #-}
5+{-# LANGUAGE FunctionalDependencies #-}
6+{-# LANGUAGE GADTs #-}
7+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
8+{-# LANGUAGE LambdaCase #-}
9+{-# LANGUAGE MultiParamTypeClasses #-}
10+{-# LANGUAGE RankNTypes #-}
11+{-# LANGUAGE ScopedTypeVariables #-}
12+{-# LANGUAGE TypeFamilies #-}
13+{-# LANGUAGE UndecidableInstances #-}
14+#ifdef USE_REFLEX_OPTIMIZER
15+{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
16+#endif
117module Reflex.DynamicWriter
2− {-# DEPRECATED "Use 'Reflex.DynamicWriter.Class' and 'Reflex.DynamicWrite.Base' instead, or just import 'Reflex'" #-}
3− ( module X
18+ ( MonadDynamicWriter (..)
19+ , DynamicWriterT (..)
20+ , runDynamicWriterT
21+ , withDynamicWriterT
422 ) where
523
6−import Reflex.DynamicWriter.Base as X
7−import Reflex.DynamicWriter.Class as X
24+import Control.Monad.Exception
25+import Control.Monad.Identity
26+import Control.Monad.IO.Class
27+import Control.Monad.Reader
28+import Control.Monad.Ref
29+import Control.Monad.State.Strict
30+import Data.Align
31+import Data.Dependent.Map (DMap)
32+import qualified Data.Dependent.Map as DMap
33+import Data.Functor.Misc
34+import Data.Map (Map)
35+import qualified Data.Map as Map
36+import Data.Semigroup
37+import Data.Some (Some)
38+import Data.These
39+import Reflex.Class
40+import Reflex.Host.Class
41+import qualified Reflex.Patch.MapWithMove as MapWithMove
42+import Reflex.PerformEvent.Class
43+import Reflex.PostBuild.Class
44+import Reflex.Requester.Class
45+import Reflex.TriggerEvent.Class
46+
47+instance MonadTrans (DynamicWriterT t w) where
48+ lift = DynamicWriterT . lift
49+
50+mapIncrementalMapValues :: (Reflex t, Patch (p v), Patch (p v'), PatchTarget (p v) ~ f v, PatchTarget (p v') ~ f v', Functor p, Functor f) => (v -> v') -> Incremental t (p v) -> Incremental t (p v')
51+mapIncrementalMapValues f = unsafeMapIncremental (fmap f) (fmap f)
52+
53+mergeDynIncremental :: (Reflex t, Ord k) => Incremental t (PatchMap k (Dynamic t v)) -> Incremental t (PatchMap k v)
54+mergeDynIncremental a = unsafeBuildIncremental (mapM (sample . current) =<< sample (currentIncremental a)) $ addedAndRemovedValues <> changedValues
55+ where changedValues = fmap (PatchMap . fmap Just) $ mergeMapIncremental $ mapIncrementalMapValues updated a
56+ addedAndRemovedValues = flip pushAlways (updatedIncremental a) $ \(PatchMap m) -> PatchMap <$> mapM (mapM (sample . current)) m
57+
58+mergeDynIncrementalWithMove :: forall t k v. (Reflex t, Ord k) => Incremental t (PatchMapWithMove k (Dynamic t v)) -> Incremental t (PatchMapWithMove k v)
59+mergeDynIncrementalWithMove a = unsafeBuildIncremental (mapM (sample . current) =<< sample (currentIncremental a)) $ alignWith f addedAndRemovedValues changedValues
60+ where changedValues = mergeMapIncrementalWithMove $ mapIncrementalMapValues updated a
61+ addedAndRemovedValues = flip pushAlways (updatedIncremental a) $ fmap unsafePatchMapWithMove . mapM (mapM (sample . current)) . unPatchMapWithMove
62+ f :: These (PatchMapWithMove k v) (Map k v) -> PatchMapWithMove k v
63+ f x = unsafePatchMapWithMove $
64+ let (p, changed) = case x of
65+ This p_ -> (unPatchMapWithMove p_, mempty)
66+ That c -> (mempty, c)
67+ These p_ c -> (unPatchMapWithMove p_, c)
68+ (pWithNewVals, noLongerMoved) = flip runState [] $ forM p $ MapWithMove.nodeInfoMapMFrom $ \case
69+ MapWithMove.From_Insert v -> return $ MapWithMove.From_Insert v
70+ MapWithMove.From_Delete -> return $ MapWithMove.From_Delete
71+ MapWithMove.From_Move k -> case Map.lookup k changed of
72+ Nothing -> return $ MapWithMove.From_Move k
73+ Just v -> do
74+ modify (k:)
75+ return $ MapWithMove.From_Insert v
76+ noLongerMovedMap = Map.fromList $ fmap (\k -> (k, ())) noLongerMoved
77+ in Map.differenceWith (\e _ -> Just $ MapWithMove.nodeInfoSetTo Nothing e) pWithNewVals noLongerMovedMap --TODO: Check if any in the second map are not covered?
78+
79+-- | A basic implementation of 'MonadDynamicWriter'.
80+newtype DynamicWriterT t w m a = DynamicWriterT { unDynamicWriterT :: StateT [Dynamic t w] m a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadHold t, MonadSample t, MonadAsyncException, MonadException) -- The list is kept in reverse order
81+
82+instance MonadRef m => MonadRef (DynamicWriterT t w m) where
83+ type Ref (DynamicWriterT t w m) = Ref m
84+ newRef = lift . newRef
85+ readRef = lift . readRef
86+ writeRef r = lift . writeRef r
87+
88+instance MonadAtomicRef m => MonadAtomicRef (DynamicWriterT t w m) where
89+ atomicModifyRef r = lift . atomicModifyRef r
90+
91+instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (DynamicWriterT t w m) where
92+ newEventWithTrigger = lift . newEventWithTrigger
93+ newFanEventWithTrigger f = lift $ newFanEventWithTrigger f
94+
95+-- | Run a 'DynamicWriterT' action. The dynamic writer output will be provided
96+-- along with the result of the action.
97+runDynamicWriterT :: (MonadFix m, Reflex t, Monoid w) => DynamicWriterT t w m a -> m (a, Dynamic t w)
98+runDynamicWriterT (DynamicWriterT a) = do
99+ (result, ws) <- runStateT a []
100+ return (result, mconcat $ reverse ws)
101+
102+-- | 'MonadDynamicWriter' efficiently collects 'Dynamic' values using 'tellDyn'
103+-- and combines them monoidally to provide a 'Dynamic' result.
104+class (Monad m, Monoid w) => MonadDynamicWriter t w m | m -> t w where
105+ tellDyn :: Dynamic t w -> m ()
106+
107+instance (Monad m, Monoid w, Reflex t) => MonadDynamicWriter t w (DynamicWriterT t w m) where
108+ tellDyn w = DynamicWriterT $ modify (w :)
109+
110+instance MonadReader r m => MonadReader r (DynamicWriterT t w m) where
111+ ask = lift ask
112+ local f (DynamicWriterT a) = DynamicWriterT $ mapStateT (local f) a
113+ reader = lift . reader
114+
115+instance PerformEvent t m => PerformEvent t (DynamicWriterT t w m) where
116+ type Performable (DynamicWriterT t w m) = Performable m
117+ performEvent_ = lift . performEvent_
118+ performEvent = lift . performEvent
119+
120+instance TriggerEvent t m => TriggerEvent t (DynamicWriterT t w m) where
121+ newTriggerEvent = lift newTriggerEvent
122+ newTriggerEventWithOnComplete = lift newTriggerEventWithOnComplete
123+ newEventWithLazyTriggerWithOnComplete = lift . newEventWithLazyTriggerWithOnComplete
124+
125+instance PostBuild t m => PostBuild t (DynamicWriterT t w m) where
126+ getPostBuild = lift getPostBuild
127+
128+instance MonadDynamicWriter t w m => MonadDynamicWriter t w (ReaderT r m) where
129+ tellDyn = lift . tellDyn
130+
131+instance MonadState s m => MonadState s (DynamicWriterT t w m) where
132+ get = lift get
133+ put = lift . put
134+
135+newtype DynamicWriterTLoweredResult t w v a = DynamicWriterTLoweredResult (v a, Dynamic t w)
136+
137+-- | When the execution of a 'DynamicWriterT' action is adjusted using
138+-- 'MonadAdjust', the 'Dynamic' output of that action will also be updated to
139+-- match.
140+instance (MonadAdjust t m, MonadFix m, Monoid w, MonadHold t m, Reflex t) => MonadAdjust t (DynamicWriterT t w m) where
141+ runWithReplace a0 a' = do
142+ (result0, result') <- lift $ runWithReplace (runDynamicWriterT a0) $ runDynamicWriterT <$> a'
143+ tellDyn . join =<< holdDyn (snd result0) (snd <$> result')
144+ return (fst result0, fst <$> result')
145+ traverseDMapWithKeyWithAdjust = traverseDMapWithKeyWithAdjustImpl traverseDMapWithKeyWithAdjust mapPatchDMap weakenPatchDMapWith mergeDynIncremental
146+ traverseDMapWithKeyWithAdjustWithMove = traverseDMapWithKeyWithAdjustImpl traverseDMapWithKeyWithAdjustWithMove mapPatchDMapWithMove weakenPatchDMapWithMoveWith mergeDynIncrementalWithMove
147+
148+traverseDMapWithKeyWithAdjustImpl :: forall t w k v' p p' v m. (PatchTarget (p' (Some k) (Dynamic t w)) ~ Map (Some k) (Dynamic t w), PatchTarget (p' (Some k) w) ~ Map (Some k) w, Patch (p' (Some k) w), Patch (p' (Some k) (Dynamic t w)), MonadFix m, Monoid w, Reflex t, MonadHold t m)
149+ => ( (forall a. k a -> v a -> m (DynamicWriterTLoweredResult t w v' a))
150+ -> DMap k v
151+ -> Event t (p k v)
152+ -> m (DMap k (DynamicWriterTLoweredResult t w v'), Event t (p k (DynamicWriterTLoweredResult t w v')))
153+ )
154+ -> ((forall a. DynamicWriterTLoweredResult t w v' a -> v' a) -> p k (DynamicWriterTLoweredResult t w v') -> p k v')
155+ -> ((forall a. DynamicWriterTLoweredResult t w v' a -> Dynamic t w) -> p k (DynamicWriterTLoweredResult t w v') -> p' (Some k) (Dynamic t w))
156+ -> (Incremental t (p' (Some k) (Dynamic t w)) -> Incremental t (p' (Some k) w))
157+ -> (forall a. k a -> v a -> DynamicWriterT t w m (v' a))
158+ -> DMap k v
159+ -> Event t (p k v)
160+ -> DynamicWriterT t w m (DMap k v', Event t (p k v'))
161+traverseDMapWithKeyWithAdjustImpl base mapPatch weakenPatchWith mergeMyDynIncremental f (dm0 :: DMap k v) dm' = do
162+ (result0, result') <- lift $ base (\k v -> fmap DynamicWriterTLoweredResult $ runDynamicWriterT $ f k v) dm0 dm'
163+ let getValue (DynamicWriterTLoweredResult (v, _)) = v
164+ getWritten (DynamicWriterTLoweredResult (_, w)) = w
165+ liftedResult0 = DMap.map getValue result0
166+ liftedResult' = ffor result' $ mapPatch getValue
167+ liftedWritten0 :: Map (Some k) (Dynamic t w)
168+ liftedWritten0 = weakenDMapWith getWritten result0
169+ liftedWritten' = ffor result' $ weakenPatchWith getWritten
170+ --TODO: We should be able to improve the performance here by incrementally updating the mconcat of the merged Dynamics
171+ i <- holdIncremental liftedWritten0 liftedWritten'
172+ tellDyn $ fmap (mconcat . Map.elems) $ incrementalToDynamic $ mergeMyDynIncremental i
173+ return (liftedResult0, liftedResult')
174+
175+-- | Map a function over the output of a 'DynamicWriterT'.
176+withDynamicWriterT :: (Monoid w, Monoid w', Reflex t, MonadHold t m, MonadFix m)
177+ => (w -> w')
178+ -> DynamicWriterT t w m a
179+ -> DynamicWriterT t w' m a
180+withDynamicWriterT f dw = do
181+ (r, d) <- lift $ do
182+ (r, d) <- runDynamicWriterT dw
183+ let d' = fmap f d
184+ return (r, d')
185+ tellDyn d
186+ return r
187+
188+instance Requester t m => Requester t (DynamicWriterT t w m) where
189+ type Request (DynamicWriterT t w m) = Request m
190+ type Response (DynamicWriterT t w m) = Response m
191+ requesting = lift . requesting
192+ requesting_ = lift . requesting_
src/Reflex/DynamicWriter/Base.hsdeleted−246
@@ -1,246 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−{-# LANGUAGE FlexibleInstances #-}
3−{-# LANGUAGE GADTs #-}
4−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
5−{-# LANGUAGE LambdaCase #-}
6−{-# LANGUAGE MultiParamTypeClasses #-}
7−{-# LANGUAGE RankNTypes #-}
8−{-# LANGUAGE ScopedTypeVariables #-}
9−{-# LANGUAGE TupleSections #-}
10−{-# LANGUAGE TypeFamilies #-}
11−{-# LANGUAGE UndecidableInstances #-}
12−{-# LANGUAGE StandaloneDeriving #-}
13−#ifdef USE_REFLEX_OPTIMIZER
14−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
15−#endif
16−module Reflex.DynamicWriter.Base
17− ( DynamicWriterT (..)
18− , runDynamicWriterT
19− , withDynamicWriterT
20− ) where
21−
22−import Control.Monad.Exception
23−import Control.Monad.Identity
24−import Control.Monad.IO.Class
25−import Control.Monad.Morph
26−import Control.Monad.Primitive
27−import Control.Monad.Reader
28−import Control.Monad.Ref
29−import Control.Monad.State.Strict
30−import Data.Align
31−import Data.Dependent.Map (DMap)
32−import qualified Data.Dependent.Map as DMap
33−import Data.FastMutableIntMap
34−import Data.Functor.Misc
35−import Data.IntMap (IntMap)
36−import qualified Data.IntMap as IntMap
37−import Data.Map (Map)
38−import qualified Data.Map as Map
39−import Data.Semigroup (Semigroup(..))
40−import Data.Some (Some)
41−import Data.These
42−
43−import Reflex.Adjustable.Class
44−import Reflex.Class
45−import Reflex.DynamicWriter.Class
46−import Reflex.EventWriter.Class (EventWriter, tellEvent)
47−import Reflex.Host.Class
48−import qualified Data.Patch.MapWithMove as MapWithMove
49−import Reflex.PerformEvent.Class
50−import Reflex.PostBuild.Class
51−import Reflex.Query.Class
52−import Reflex.Requester.Class
53−import Reflex.TriggerEvent.Class
54−
55−mapIncrementalMapValues :: (Reflex t, Patch (p v), Patch (p v'), PatchTarget (p v) ~ f v, PatchTarget (p v') ~ f v', Functor p, Functor f) => (v -> v') -> Incremental t (p v) -> Incremental t (p v')
56−mapIncrementalMapValues f = unsafeMapIncremental (fmap f) (fmap f)
57−
58−mergeDynIncremental :: (Reflex t, Ord k) => Incremental t (PatchMap k (Dynamic t v)) -> Incremental t (PatchMap k v)
59−mergeDynIncremental a = unsafeBuildIncremental (mapM (sample . current) =<< sample (currentIncremental a)) $ addedAndRemovedValues <> changedValues
60− where changedValues = fmap (PatchMap . fmap Just) $ mergeMapIncremental $ mapIncrementalMapValues updated a
61− addedAndRemovedValues = flip pushAlways (updatedIncremental a) $ \(PatchMap m) -> PatchMap <$> mapM (mapM (sample . current)) m
62−
63−mergeIntMapDynIncremental :: Reflex t => Incremental t (PatchIntMap (Dynamic t v)) -> Incremental t (PatchIntMap v)
64−mergeIntMapDynIncremental a = unsafeBuildIncremental (mapM (sample . current) =<< sample (currentIncremental a)) $ addedAndRemovedValues <> changedValues
65− where changedValues = fmap (PatchIntMap . fmap Just) $ mergeIntMapIncremental $ mapIncrementalMapValues updated a
66− addedAndRemovedValues = flip pushAlways (updatedIncremental a) $ \(PatchIntMap m) -> PatchIntMap <$> mapM (mapM (sample . current)) m
67−
68−mergeDynIncrementalWithMove :: forall t k v. (Reflex t, Ord k) => Incremental t (PatchMapWithMove k (Dynamic t v)) -> Incremental t (PatchMapWithMove k v)
69−mergeDynIncrementalWithMove a = unsafeBuildIncremental (mapM (sample . current) =<< sample (currentIncremental a)) $ alignWith f addedAndRemovedValues changedValues
70− where changedValues = mergeMapIncrementalWithMove $ mapIncrementalMapValues updated a
71− addedAndRemovedValues = flip pushAlways (updatedIncremental a) $ fmap unsafePatchMapWithMove . mapM (mapM (sample . current)) . unPatchMapWithMove
72− f :: These (PatchMapWithMove k v) (Map k v) -> PatchMapWithMove k v
73− f x = unsafePatchMapWithMove $
74− let (p, changed) = case x of
75− This p_ -> (unPatchMapWithMove p_, mempty)
76− That c -> (mempty, c)
77− These p_ c -> (unPatchMapWithMove p_, c)
78− (pWithNewVals, noLongerMoved) = flip runState [] $ forM p $ MapWithMove.nodeInfoMapMFrom $ \case
79− MapWithMove.From_Insert v -> return $ MapWithMove.From_Insert v
80− MapWithMove.From_Delete -> return MapWithMove.From_Delete
81− MapWithMove.From_Move k -> case Map.lookup k changed of
82− Nothing -> return $ MapWithMove.From_Move k
83− Just v -> do
84− modify (k:)
85− return $ MapWithMove.From_Insert v
86− noLongerMovedMap = Map.fromList $ fmap (, ()) noLongerMoved
87− in Map.differenceWith (\e _ -> Just $ MapWithMove.nodeInfoSetTo Nothing e) pWithNewVals noLongerMovedMap --TODO: Check if any in the second map are not covered?
88−
89−-- | A basic implementation of 'DynamicWriter'.
90−newtype DynamicWriterT t w m a = DynamicWriterT { unDynamicWriterT :: StateT [Dynamic t w] m a }
91− -- The list is kept in reverse order
92− deriving
93− ( Functor
94− , Applicative
95− , Monad
96− , MonadTrans
97− , MFunctor
98− , MonadIO
99− , MonadFix
100− , MonadAsyncException
101− , MonadException
102− )
103−
104−deriving instance MonadHold t m => MonadHold t (DynamicWriterT t w m)
105−deriving instance MonadSample t m => MonadSample t (DynamicWriterT t w m)
106−
107−
108−instance MonadRef m => MonadRef (DynamicWriterT t w m) where
109− type Ref (DynamicWriterT t w m) = Ref m
110− newRef = lift . newRef
111− readRef = lift . readRef
112− writeRef r = lift . writeRef r
113−
114−instance MonadAtomicRef m => MonadAtomicRef (DynamicWriterT t w m) where
115− atomicModifyRef r = lift . atomicModifyRef r
116−
117−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (DynamicWriterT t w m) where
118− newEventWithTrigger = lift . newEventWithTrigger
119− newFanEventWithTrigger f = lift $ newFanEventWithTrigger f
120−
121−-- | Run a 'DynamicWriterT' action. The dynamic writer output will be provided
122−-- along with the result of the action.
123−runDynamicWriterT :: (MonadFix m, Reflex t, Monoid w) => DynamicWriterT t w m a -> m (a, Dynamic t w)
124−runDynamicWriterT (DynamicWriterT a) = do
125− (result, ws) <- runStateT a []
126− return (result, mconcat $ reverse ws)
127−
128−instance (Monad m, Monoid w, Reflex t) => DynamicWriter t w (DynamicWriterT t w m) where
129− tellDyn w = DynamicWriterT $ modify (w :)
130−
131−instance MonadReader r m => MonadReader r (DynamicWriterT t w m) where
132− ask = lift ask
133− local f (DynamicWriterT a) = DynamicWriterT $ mapStateT (local f) a
134− reader = lift . reader
135−
136−instance PerformEvent t m => PerformEvent t (DynamicWriterT t w m) where
137− type Performable (DynamicWriterT t w m) = Performable m
138− performEvent_ = lift . performEvent_
139− performEvent = lift . performEvent
140−
141−instance TriggerEvent t m => TriggerEvent t (DynamicWriterT t w m) where
142− newTriggerEvent = lift newTriggerEvent
143− newTriggerEventWithOnComplete = lift newTriggerEventWithOnComplete
144− newEventWithLazyTriggerWithOnComplete = lift . newEventWithLazyTriggerWithOnComplete
145−
146−instance PostBuild t m => PostBuild t (DynamicWriterT t w m) where
147− getPostBuild = lift getPostBuild
148−
149−instance MonadState s m => MonadState s (DynamicWriterT t w m) where
150− get = lift get
151− put = lift . put
152−
153−instance PrimMonad m => PrimMonad (DynamicWriterT t w m) where
154− type PrimState (DynamicWriterT t w m) = PrimState m
155− primitive = lift . primitive
156−
157−newtype DynamicWriterTLoweredResult t w v a = DynamicWriterTLoweredResult (v a, Dynamic t w)
158−
159−-- | When the execution of a 'DynamicWriterT' action is adjusted using
160−-- 'Adjustable', the 'Dynamic' output of that action will also be updated to
161−-- match.
162−instance (Adjustable t m, MonadFix m, Monoid w, MonadHold t m, Reflex t) => Adjustable t (DynamicWriterT t w m) where
163− runWithReplace a0 a' = do
164− (result0, result') <- lift $ runWithReplace (runDynamicWriterT a0) $ runDynamicWriterT <$> a'
165− tellDyn . join =<< holdDyn (snd result0) (snd <$> result')
166− return (fst result0, fst <$> result')
167− traverseIntMapWithKeyWithAdjust = traverseIntMapWithKeyWithAdjustImpl traverseIntMapWithKeyWithAdjust mergeIntMapDynIncremental
168− traverseDMapWithKeyWithAdjust = traverseDMapWithKeyWithAdjustImpl traverseDMapWithKeyWithAdjust mapPatchDMap weakenPatchDMapWith mergeDynIncremental
169− traverseDMapWithKeyWithAdjustWithMove = traverseDMapWithKeyWithAdjustImpl traverseDMapWithKeyWithAdjustWithMove mapPatchDMapWithMove weakenPatchDMapWithMoveWith mergeDynIncrementalWithMove
170−
171−traverseDMapWithKeyWithAdjustImpl :: forall t w k v' p p' v m. (PatchTarget (p' (Some k) (Dynamic t w)) ~ Map (Some k) (Dynamic t w), PatchTarget (p' (Some k) w) ~ Map (Some k) w, Patch (p' (Some k) w), Patch (p' (Some k) (Dynamic t w)), MonadFix m, Monoid w, Reflex t, MonadHold t m)
172− => ( (forall a. k a -> v a -> m (DynamicWriterTLoweredResult t w v' a))
173− -> DMap k v
174− -> Event t (p k v)
175− -> m (DMap k (DynamicWriterTLoweredResult t w v'), Event t (p k (DynamicWriterTLoweredResult t w v')))
176− )
177− -> ((forall a. DynamicWriterTLoweredResult t w v' a -> v' a) -> p k (DynamicWriterTLoweredResult t w v') -> p k v')
178− -> ((forall a. DynamicWriterTLoweredResult t w v' a -> Dynamic t w) -> p k (DynamicWriterTLoweredResult t w v') -> p' (Some k) (Dynamic t w))
179− -> (Incremental t (p' (Some k) (Dynamic t w)) -> Incremental t (p' (Some k) w))
180− -> (forall a. k a -> v a -> DynamicWriterT t w m (v' a))
181− -> DMap k v
182− -> Event t (p k v)
183− -> DynamicWriterT t w m (DMap k v', Event t (p k v'))
184−traverseDMapWithKeyWithAdjustImpl base mapPatch weakenPatchWith mergeMyDynIncremental f (dm0 :: DMap k v) dm' = do
185− (result0, result') <- lift $ base (\k v -> fmap DynamicWriterTLoweredResult $ runDynamicWriterT $ f k v) dm0 dm'
186− let getValue (DynamicWriterTLoweredResult (v, _)) = v
187− getWritten (DynamicWriterTLoweredResult (_, w)) = w
188− liftedResult0 = DMap.map getValue result0
189− liftedResult' = ffor result' $ mapPatch getValue
190− liftedWritten0 :: Map (Some k) (Dynamic t w)
191− liftedWritten0 = weakenDMapWith getWritten result0
192− liftedWritten' = ffor result' $ weakenPatchWith getWritten
193− --TODO: We should be able to improve the performance here by incrementally updating the mconcat of the merged Dynamics
194− i <- holdIncremental liftedWritten0 liftedWritten'
195− tellDyn $ fmap (mconcat . Map.elems) $ incrementalToDynamic $ mergeMyDynIncremental i
196− return (liftedResult0, liftedResult')
197−
198−traverseIntMapWithKeyWithAdjustImpl :: forall t w v' p p' v m. (PatchTarget (p' (Dynamic t w)) ~ IntMap (Dynamic t w), PatchTarget (p' w) ~ IntMap w, Patch (p' w), Patch (p' (Dynamic t w)), MonadFix m, Monoid w, Reflex t, MonadHold t m, Functor p, p ~ p')
199− => ( (IntMap.Key -> v -> m (v', Dynamic t w))
200− -> IntMap v
201− -> Event t (p v)
202− -> m (IntMap (v', Dynamic t w), Event t (p (v', Dynamic t w)))
203− )
204− -> (Incremental t (p' (Dynamic t w)) -> Incremental t (p' w))
205− -> (IntMap.Key -> v -> DynamicWriterT t w m v')
206− -> IntMap v
207− -> Event t (p v)
208− -> DynamicWriterT t w m (IntMap v', Event t (p v'))
209−traverseIntMapWithKeyWithAdjustImpl base mergeMyDynIncremental f (dm0 :: IntMap v) dm' = do
210− (result0, result') <- lift $ base (\k v -> runDynamicWriterT $ f k v) dm0 dm'
211− let liftedResult0 = fmap fst result0
212− liftedResult' = fmap (fmap fst) result'
213− liftedWritten0 :: IntMap (Dynamic t w)
214− liftedWritten0 = fmap snd result0
215− liftedWritten' = fmap (fmap snd) result'
216− --TODO: We should be able to improve the performance here by incrementally updating the mconcat of the merged Dynamics
217− i <- holdIncremental liftedWritten0 liftedWritten'
218− tellDyn $ fmap (mconcat . IntMap.elems) $ incrementalToDynamic $ mergeMyDynIncremental i
219− return (liftedResult0, liftedResult')
220−
221−-- | Map a function over the output of a 'DynamicWriterT'.
222−withDynamicWriterT :: (Monoid w, Monoid w', Reflex t, MonadHold t m, MonadFix m)
223− => (w -> w')
224− -> DynamicWriterT t w m a
225− -> DynamicWriterT t w' m a
226−withDynamicWriterT f dw = do
227− (r, d) <- lift $ do
228− (r, d) <- runDynamicWriterT dw
229− let d' = fmap f d
230− return (r, d')
231− tellDyn d
232− return r
233−
234−instance Requester t m => Requester t (DynamicWriterT t w m) where
235− type Request (DynamicWriterT t w m) = Request m
236− type Response (DynamicWriterT t w m) = Response m
237− requesting = lift . requesting
238− requesting_ = lift . requesting_
239−
240−instance (MonadQuery t q m, Monad m) => MonadQuery t q (DynamicWriterT t w m) where
241− tellQueryIncremental = lift . tellQueryIncremental
242− askQueryResult = lift askQueryResult
243− queryIncremental = lift . queryIncremental
244−
245−instance EventWriter t w m => EventWriter t w (DynamicWriterT t v m) where
246− tellEvent = lift . tellEvent
src/Reflex/DynamicWriter/Class.hsdeleted−28
@@ -1,28 +0,0 @@
1−-- | This module defines the 'DynamicWriter' class.
2−{-# LANGUAGE ConstraintKinds #-}
3−{-# LANGUAGE CPP #-}
4−{-# LANGUAGE FlexibleInstances #-}
5−{-# LANGUAGE FunctionalDependencies #-}
6−{-# LANGUAGE UndecidableInstances #-}
7−#ifdef USE_REFLEX_OPTIMIZER
8−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
9−#endif
10−module Reflex.DynamicWriter.Class
11− ( MonadDynamicWriter
12− , DynamicWriter(..)
13− ) where
14−
15−import Control.Monad.Reader (ReaderT, lift)
16−import Reflex.Class (Dynamic)
17−
18−{-# DEPRECATED MonadDynamicWriter "Use 'DynamicWriter' instead" #-}
19−-- | Type synonym for 'DynamicWriter'
20−type MonadDynamicWriter = DynamicWriter
21−
22−-- | 'MonadDynamicWriter' efficiently collects 'Dynamic' values using 'tellDyn'
23−-- and combines them monoidally to provide a 'Dynamic' result.
24−class (Monad m, Monoid w) => DynamicWriter t w m | m -> t w where
25− tellDyn :: Dynamic t w -> m ()
26−
27−instance DynamicWriter t w m => DynamicWriter t w (ReaderT r m) where
28− tellDyn = lift . tellDyn
src/Reflex/EventWriter.hs+266−4
@@ -1,7 +1,269 @@
1+-- | This module provides 'EventWriterT', the standard implementation of
2+-- 'EventWriter'.
3+{-# LANGUAGE CPP #-}
4+{-# LANGUAGE ExistentialQuantification #-}
5+{-# LANGUAGE FlexibleInstances #-}
6+{-# LANGUAGE FunctionalDependencies #-}
7+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
8+{-# LANGUAGE MultiParamTypeClasses #-}
9+{-# LANGUAGE Rank2Types #-}
10+{-# LANGUAGE ScopedTypeVariables #-}
11+{-# LANGUAGE TypeFamilies #-}
12+{-# LANGUAGE TypeOperators #-}
13+{-# LANGUAGE UndecidableInstances #-}
14+#ifdef USE_REFLEX_OPTIMIZER
15+{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
16+#endif
117module Reflex.EventWriter
2− {-# DEPRECATED "Use 'Reflex.EventWriter.Class' and 'Reflex.EventWriter.Base' instead, or just import 'Reflex'" #-}
3− ( module X
18+ ( EventWriterT (..)
19+ , runEventWriterT
20+ , EventWriter (..)
21+ , runWithReplaceEventWriterTWith
22+ , sequenceDMapWithAdjustEventWriterTWith
423 ) where
524
6−import Reflex.EventWriter.Base as X
7−import Reflex.EventWriter.Class as X
25+import Reflex.Class
26+import Reflex.Host.Class
27+import Reflex.PerformEvent.Class
28+import Reflex.PostBuild.Class
29+import Reflex.Query.Class
30+import Reflex.Requester.Class
31+import Reflex.TriggerEvent.Class
32+
33+import Control.Monad.Exception
34+import Control.Monad.Identity
35+import Control.Monad.Reader
36+import Control.Monad.Ref
37+import Control.Monad.State.Strict
38+import Data.Dependent.Map (DMap, DSum (..))
39+import qualified Data.Dependent.Map as DMap
40+import Data.FastMutableIntMap
41+import Data.Foldable
42+import Data.Functor.Compose
43+import Data.Functor.Misc
44+import Data.GADT.Compare (GEq (..), GCompare (..), GOrdering (..))
45+import Data.IntMap.Strict (IntMap)
46+import qualified Data.IntMap.Strict as IntMap
47+import Data.List.NonEmpty (NonEmpty (..))
48+import Data.Map (Map)
49+import Data.Semigroup
50+import Data.Some (Some)
51+import Data.Tuple
52+import Data.Type.Equality
53+
54+import Unsafe.Coerce
55+
56+-- | 'EventWriter' efficiently collects 'Event' values using 'tellEvent'
57+-- and combines them monoidally to provide an 'Event' result.
58+class (Monad m, Semigroup w) => EventWriter t w m | m -> t w where
59+ tellEvent :: Event t w -> m ()
60+
61+{-# DEPRECATED TellId "Do not construct this directly; use tellId instead" #-}
62+newtype TellId w x
63+ = TellId Int -- ^ WARNING: Do not construct this directly; use 'TellId' instead
64+ deriving (Show, Eq, Ord, Enum)
65+
66+tellId :: Int -> TellId w w
67+tellId = TellId
68+{-# INLINE tellId #-}
69+
70+tellIdRefl :: TellId w x -> w :~: x
71+tellIdRefl _ = unsafeCoerce Refl
72+
73+withTellIdRefl :: TellId w x -> (w ~ x => r) -> r
74+withTellIdRefl tid r = case tellIdRefl tid of
75+ Refl -> r
76+
77+instance GEq (TellId w) where
78+ a `geq` b =
79+ withTellIdRefl a $
80+ withTellIdRefl b $
81+ if a == b
82+ then Just Refl
83+ else Nothing
84+
85+instance GCompare (TellId w) where
86+ a `gcompare` b =
87+ withTellIdRefl a $
88+ withTellIdRefl b $
89+ case a `compare` b of
90+ LT -> GLT
91+ EQ -> GEQ
92+ GT -> GGT
93+
94+data EventWriterState t w = EventWriterState
95+ { _eventWriterState_nextId :: {-# UNPACK #-} !Int -- Always negative (and decreasing over time)
96+ , _eventWriterState_told :: ![DSum (TellId w) (Event t)] -- In increasing order
97+ }
98+
99+-- | A basic implementation of 'EventWriter'.
100+newtype EventWriterT t w m a = EventWriterT { unEventWriterT :: StateT (EventWriterState t w) m a }
101+ deriving (Functor, Applicative, Monad, MonadFix, MonadIO, MonadException, MonadAsyncException)
102+
103+-- | Run a 'EventWriterT' action.
104+runEventWriterT :: forall t m w a. (Reflex t, Monad m, Semigroup w) => EventWriterT t w m a -> m (a, Event t w)
105+runEventWriterT (EventWriterT a) = do
106+ (result, requests) <- runStateT a $ EventWriterState (-1) []
107+ let combineResults :: DMap (TellId w) Identity -> w
108+ combineResults = sconcat
109+ . (\(h : t) -> h :| t) -- Unconditional; 'merge' guarantees that it will only fire with non-empty DMaps
110+ . DMap.foldlWithKey (\vs tid (Identity v) -> withTellIdRefl tid $ v : vs) [] -- This is where we finally reverse the DMap to get things in the correct order
111+ return (result, fmap combineResults $ merge $ DMap.fromDistinctAscList $ _eventWriterState_told requests) --TODO: We can probably make this fromDistinctAscList more efficient by knowing the length in advance, but this will require exposing internals of DMap; also converting it to use a strict list might help
112+
113+instance (Reflex t, Monad m, Semigroup w) => EventWriter t w (EventWriterT t w m) where
114+ tellEvent w = EventWriterT $ modify $ \old ->
115+ let myId = _eventWriterState_nextId old
116+ in EventWriterState
117+ { _eventWriterState_nextId = pred myId
118+ , _eventWriterState_told = (tellId myId :=> w) : _eventWriterState_told old
119+ }
120+
121+instance EventWriter t w m => EventWriter t w (ReaderT r m) where
122+ tellEvent = lift . tellEvent
123+
124+instance MonadTrans (EventWriterT t w) where
125+ lift = EventWriterT . lift
126+
127+instance MonadSample t m => MonadSample t (EventWriterT t w m) where
128+ sample = lift . sample
129+
130+instance MonadHold t m => MonadHold t (EventWriterT t w m) where
131+ {-# INLINABLE hold #-}
132+ hold v0 = lift . hold v0
133+ {-# INLINABLE holdDyn #-}
134+ holdDyn v0 = lift . holdDyn v0
135+ {-# INLINABLE holdIncremental #-}
136+ holdIncremental v0 = lift . holdIncremental v0
137+ {-# INLINABLE buildDynamic #-}
138+ buildDynamic a0 = lift . buildDynamic a0
139+ {-# INLINABLE headE #-}
140+ headE = lift . headE
141+
142+instance (Reflex t, MonadAdjust t m, MonadHold t m, Semigroup w) => MonadAdjust t (EventWriterT t w m) where
143+ runWithReplace = runWithReplaceEventWriterTWith $ \dm0 dm' -> lift $ runWithReplace dm0 dm'
144+ traverseIntMapWithKeyWithAdjust = sequenceIntMapWithAdjustEventWriterTWith (\f dm0 dm' -> lift $ traverseIntMapWithKeyWithAdjust f dm0 dm') patchIntMapNewElements mergeIntIncremental
145+ traverseDMapWithKeyWithAdjust = sequenceDMapWithAdjustEventWriterTWith (\f dm0 dm' -> lift $ traverseDMapWithKeyWithAdjust f dm0 dm') mapPatchDMap weakenPatchDMapWith patchMapNewElements mergeMapIncremental
146+ traverseDMapWithKeyWithAdjustWithMove = sequenceDMapWithAdjustEventWriterTWith (\f dm0 dm' -> lift $ traverseDMapWithKeyWithAdjustWithMove f dm0 dm') mapPatchDMapWithMove weakenPatchDMapWithMoveWith patchMapWithMoveNewElements mergeMapIncrementalWithMove
147+
148+instance Requester t m => Requester t (EventWriterT t w m) where
149+ type Request (EventWriterT t w m) = Request m
150+ type Response (EventWriterT t w m) = Response m
151+ requesting = lift . requesting
152+ requesting_ = lift . requesting_
153+
154+-- | Given a function like 'runWithReplace' for the underlying monad, implement
155+-- 'runWithReplace' for 'EventWriterT'. This is necessary when the underlying
156+-- monad doesn't have a 'MonadAdjust' instance or to override the default
157+-- 'MonadAdjust' behavior.
158+runWithReplaceEventWriterTWith :: forall m t w a b. (Reflex t, MonadHold t m, Semigroup w)
159+ => (forall a' b'. m a' -> Event t (m b') -> EventWriterT t w m (a', Event t b'))
160+ -> EventWriterT t w m a
161+ -> Event t (EventWriterT t w m b)
162+ -> EventWriterT t w m (a, Event t b)
163+runWithReplaceEventWriterTWith f a0 a' = do
164+ (result0, result') <- f (runEventWriterT a0) $ fmapCheap runEventWriterT a'
165+ request <- holdDyn (snd result0) $ fmapCheap snd result'
166+ -- We add these two separately to take advantage of the free merge being done later. The coincidence case must come first so that it has precedence if both fire simultaneously. (Really, we should probably block the 'switch' whenever 'updated' fires, but switchPromptlyDyn has the same issue.)
167+ tellEvent $ coincidence $ updated request
168+ tellEvent $ switch $ current request
169+ return (fst result0, fmapCheap fst result')
170+
171+-- | Like 'runWithReplaceEventWriterTWith', but for 'sequenceIntMapWithAdjust'.
172+sequenceIntMapWithAdjustEventWriterTWith :: forall t m p w v v'. (Reflex t, MonadHold t m, Semigroup w, Semigroup w, Functor p, Patch (p (Event t w)), PatchTarget (p (Event t w)) ~ IntMap (Event t w))
173+ => ( (IntMap.Key -> v -> m (Event t w, v'))
174+ -> IntMap v
175+ -> Event t (p v)
176+ -> EventWriterT t w m (IntMap (Event t w, v'), Event t (p (Event t w, v')))
177+ )
178+ -> (p (Event t w) -> [Event t w])
179+ -> (Incremental t (p (Event t w)) -> Event t (IntMap w))
180+ -> (IntMap.Key -> v -> EventWriterT t w m v')
181+ -> IntMap v
182+ -> Event t (p v)
183+ -> EventWriterT t w m (IntMap v', Event t (p v'))
184+sequenceIntMapWithAdjustEventWriterTWith base patchNewElements mergePatchIncremental f dm0 dm' = do
185+ let f' :: IntMap.Key -> v -> m (Event t w, v')
186+ f' k v = swap <$> runEventWriterT (f k v)
187+ (children0, children') <- base f' dm0 dm'
188+ let result0 = fmap snd children0
189+ result' = fmapCheap (fmap snd) children'
190+ requests0 :: IntMap (Event t w)
191+ requests0 = fmap fst children0
192+ requests' :: Event t (p (Event t w))
193+ requests' = fmapCheap (fmap fst) children'
194+ childRequestMap :: Incremental t (p (Event t w)) <- holdIncremental requests0 requests'
195+ -- We add these two separately to take advantage of the free merge being done later. The coincidence case must come first so that it has precedence if both fire simultaneously. (Really, we should probably block the 'switch' whenever 'updated' fires, but switchPromptlyDyn has the same issue.)
196+ tellEvent $ coincidence $ fforCheap requests' $ \p -> mconcat $ patchNewElements p --TODO: Create a mergeIncrementalPromptly, and use that to eliminate this 'coincidence'
197+ tellEvent $ fforMaybeCheap (mergePatchIncremental childRequestMap) $ \m -> case toList m of
198+ [] -> Nothing
199+ h : t -> Just $ sconcat $ h :| t
200+ return (result0, result')
201+
202+-- | Like 'runWithReplaceEventWriterTWith', but for 'sequenceDMapWithAdjust'.
203+sequenceDMapWithAdjustEventWriterTWith :: forall t m p p' w k v v'. (Reflex t, MonadHold t m, Semigroup w, Patch (p' (Some k) (Event t w)), PatchTarget (p' (Some k) (Event t w)) ~ Map (Some k) (Event t w))
204+ => ( (forall a. k a -> v a -> m (Compose ((,) (Event t w)) v' a))
205+ -> DMap k v
206+ -> Event t (p k v)
207+ -> EventWriterT t w m (DMap k (Compose ((,) (Event t w)) v'), Event t (p k (Compose ((,) (Event t w)) v')))
208+ )
209+ -> ((forall a. Compose ((,) (Event t w)) v' a -> v' a) -> p k (Compose ((,) (Event t w)) v') -> p k v')
210+ -> ((forall a. Compose ((,) (Event t w)) v' a -> Event t w) -> p k (Compose ((,) (Event t w)) v') -> p' (Some k) (Event t w))
211+ -> (p' (Some k) (Event t w) -> [Event t w])
212+ -> (Incremental t (p' (Some k) (Event t w)) -> Event t (Map (Some k) w))
213+ -> (forall a. k a -> v a -> EventWriterT t w m (v' a))
214+ -> DMap k v
215+ -> Event t (p k v)
216+ -> EventWriterT t w m (DMap k v', Event t (p k v'))
217+sequenceDMapWithAdjustEventWriterTWith base mapPatch weakenPatchWith patchNewElements mergePatchIncremental f dm0 dm' = do
218+ let f' :: forall a. k a -> v a -> m (Compose ((,) (Event t w)) v' a)
219+ f' k v = Compose . swap <$> runEventWriterT (f k v)
220+ (children0, children') <- base f' dm0 dm'
221+ let result0 = DMap.map (snd . getCompose) children0
222+ result' = fforCheap children' $ mapPatch $ snd . getCompose
223+ requests0 :: Map (Some k) (Event t w)
224+ requests0 = weakenDMapWith (fst . getCompose) children0
225+ requests' :: Event t (p' (Some k) (Event t w))
226+ requests' = fforCheap children' $ weakenPatchWith $ fst . getCompose
227+ childRequestMap :: Incremental t (p' (Some k) (Event t w)) <- holdIncremental requests0 requests'
228+ -- We add these two separately to take advantage of the free merge being done later. The coincidence case must come first so that it has precedence if both fire simultaneously. (Really, we should probably block the 'switch' whenever 'updated' fires, but switchPromptlyDyn has the same issue.)
229+ tellEvent $ coincidence $ fforCheap requests' $ \p -> mconcat $ patchNewElements p --TODO: Create a mergeIncrementalPromptly, and use that to eliminate this 'coincidence'
230+ tellEvent $ fforMaybeCheap (mergePatchIncremental childRequestMap) $ \m -> case toList m of
231+ [] -> Nothing
232+ h : t -> Just $ sconcat $ h :| t
233+ return (result0, result')
234+
235+instance PerformEvent t m => PerformEvent t (EventWriterT t w m) where
236+ type Performable (EventWriterT t w m) = Performable m
237+ performEvent_ = lift . performEvent_
238+ performEvent = lift . performEvent
239+
240+instance PostBuild t m => PostBuild t (EventWriterT t w m) where
241+ getPostBuild = lift getPostBuild
242+
243+instance TriggerEvent t m => TriggerEvent t (EventWriterT t w m) where
244+ newTriggerEvent = lift newTriggerEvent
245+ newTriggerEventWithOnComplete = lift newTriggerEventWithOnComplete
246+ newEventWithLazyTriggerWithOnComplete = lift . newEventWithLazyTriggerWithOnComplete
247+
248+instance MonadReader r m => MonadReader r (EventWriterT t w m) where
249+ ask = lift ask
250+ local f (EventWriterT a) = EventWriterT $ mapStateT (local f) a
251+ reader = lift . reader
252+
253+instance MonadRef m => MonadRef (EventWriterT t w m) where
254+ type Ref (EventWriterT t w m) = Ref m
255+ newRef = lift . newRef
256+ readRef = lift . readRef
257+ writeRef r = lift . writeRef r
258+
259+instance MonadAtomicRef m => MonadAtomicRef (EventWriterT t w m) where
260+ atomicModifyRef r = lift . atomicModifyRef r
261+
262+instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (EventWriterT t w m) where
263+ newEventWithTrigger = lift . newEventWithTrigger
264+ newFanEventWithTrigger f = lift $ newFanEventWithTrigger f
265+
266+instance (MonadQuery t q m, Monad m) => MonadQuery t q (EventWriterT t w m) where
267+ tellQueryIncremental = lift . tellQueryIncremental
268+ askQueryResult = lift askQueryResult
269+ queryIncremental = lift . queryIncremental
src/Reflex/EventWriter/Base.hsdeleted−317
@@ -1,317 +0,0 @@
1−-- | This module provides 'EventWriterT', the standard implementation of
2−-- 'EventWriter'.
3−{-# LANGUAGE CPP #-}
4−{-# LANGUAGE ExistentialQuantification #-}
5−{-# LANGUAGE FlexibleInstances #-}
6−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
7−{-# LANGUAGE MultiParamTypeClasses #-}
8−{-# LANGUAGE Rank2Types #-}
9−{-# LANGUAGE ScopedTypeVariables #-}
10−{-# LANGUAGE TypeFamilies #-}
11−{-# LANGUAGE TypeOperators #-}
12−{-# LANGUAGE UndecidableInstances #-}
13−#ifdef USE_REFLEX_OPTIMIZER
14−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
15−#endif
16−module Reflex.EventWriter.Base
17− ( EventWriterT (..)
18− , runEventWriterT
19− , runWithReplaceEventWriterTWith
20− , sequenceDMapWithAdjustEventWriterTWith
21− , mapEventWriterT
22− , withEventWriterT
23− ) where
24−
25−import Reflex.Adjustable.Class
26−import Reflex.Class
27−import Reflex.EventWriter.Class (EventWriter, tellEvent)
28−import Reflex.DynamicWriter.Class (DynamicWriter, tellDyn)
29−import Reflex.Host.Class
30−import Reflex.PerformEvent.Class
31−import Reflex.PostBuild.Class
32−import Reflex.Query.Class
33−import Reflex.Requester.Class
34−import Reflex.TriggerEvent.Class
35−
36−import Control.Monad.Exception
37−import Control.Monad.Identity
38−import Control.Monad.Morph
39−import Control.Monad.Primitive
40−import Control.Monad.Reader
41−import Control.Monad.Ref
42−import Control.Monad.State.Strict
43−import Data.Dependent.Map (DMap)
44−import qualified Data.Dependent.Map as DMap
45−import Data.Dependent.Sum (DSum (..))
46−import Data.Functor.Compose
47−import Data.Functor.Misc
48−import Data.GADT.Compare (GCompare (..), GEq (..), GOrdering (..))
49−import Data.IntMap.Strict (IntMap)
50−import qualified Data.IntMap.Strict as IntMap
51−import Data.List.NonEmpty (NonEmpty (..))
52−import Data.Map (Map)
53−import qualified Data.Map as Map
54−import Data.Semigroup
55−import Data.Some (Some)
56−import Data.Tuple
57−import Data.Type.Equality
58−
59−import Unsafe.Coerce
60−
61−{-# DEPRECATED TellId "Do not construct this directly; use tellId instead" #-}
62−newtype TellId w x
63− = TellId Int -- ^ WARNING: Do not construct this directly; use 'tellId' instead
64− deriving (Show, Eq, Ord, Enum)
65−
66−tellId :: Int -> TellId w w
67−tellId = TellId
68−{-# INLINE tellId #-}
69−
70−tellIdRefl :: TellId w x -> w :~: x
71−tellIdRefl _ = unsafeCoerce Refl
72−
73−withTellIdRefl :: TellId w x -> (w ~ x => r) -> r
74−withTellIdRefl tid r = case tellIdRefl tid of
75− Refl -> r
76−
77−instance GEq (TellId w) where
78− a `geq` b =
79− withTellIdRefl a $
80− withTellIdRefl b $
81− if a == b
82− then Just Refl
83− else Nothing
84−
85−instance GCompare (TellId w) where
86− a `gcompare` b =
87− withTellIdRefl a $
88− withTellIdRefl b $
89− case a `compare` b of
90− LT -> GLT
91− EQ -> GEQ
92− GT -> GGT
93−
94−data EventWriterState t w = EventWriterState
95− { _eventWriterState_nextId :: {-# UNPACK #-} !Int -- Always negative (and decreasing over time)
96− , _eventWriterState_told :: ![DSum (TellId w) (Event t)] -- In increasing order
97− }
98−
99−-- | A basic implementation of 'EventWriter'.
100−newtype EventWriterT t w m a = EventWriterT { unEventWriterT :: StateT (EventWriterState t w) m a }
101− deriving
102− ( Functor
103− , Applicative
104− , Monad
105− , MonadTrans
106− , MFunctor
107− , MonadFix
108− , MonadIO
109− , MonadException
110− , MonadAsyncException
111− )
112−
113−-- | Run a 'EventWriterT' action.
114−runEventWriterT :: forall t m w a. (Reflex t, Monad m, Semigroup w) => EventWriterT t w m a -> m (a, Event t w)
115−runEventWriterT (EventWriterT a) = do
116− (result, requests) <- runStateT a $ EventWriterState (-1) []
117− let combineResults :: DMap (TellId w) Identity -> w
118− combineResults = sconcat
119− . (\(h : t) -> h :| t) -- Unconditional; 'merge' guarantees that it will only fire with non-empty DMaps
120− . DMap.foldlWithKey (\vs tid (Identity v) -> withTellIdRefl tid $ v : vs) [] -- This is where we finally reverse the DMap to get things in the correct order
121− return (result, fmap combineResults $ merge $ DMap.fromDistinctAscList $ _eventWriterState_told requests) --TODO: We can probably make this fromDistinctAscList more efficient by knowing the length in advance, but this will require exposing internals of DMap; also converting it to use a strict list might help
122−
123−instance (Reflex t, Monad m, Semigroup w) => EventWriter t w (EventWriterT t w m) where
124− tellEvent w = EventWriterT $ modify $ \old ->
125− let myId = _eventWriterState_nextId old
126− in EventWriterState
127− { _eventWriterState_nextId = pred myId
128− , _eventWriterState_told = (tellId myId :=> w) : _eventWriterState_told old
129− }
130−
131−instance MonadSample t m => MonadSample t (EventWriterT t w m) where
132− sample = lift . sample
133−
134−instance MonadHold t m => MonadHold t (EventWriterT t w m) where
135− {-# INLINABLE hold #-}
136− hold v0 = lift . hold v0
137− {-# INLINABLE holdDyn #-}
138− holdDyn v0 = lift . holdDyn v0
139− {-# INLINABLE holdIncremental #-}
140− holdIncremental v0 = lift . holdIncremental v0
141− {-# INLINABLE buildDynamic #-}
142− buildDynamic a0 = lift . buildDynamic a0
143− {-# INLINABLE headE #-}
144− headE = lift . headE
145− {-# INLINABLE now #-}
146− now = lift now
147−
148−instance (Reflex t, Adjustable t m, MonadHold t m, Semigroup w) => Adjustable t (EventWriterT t w m) where
149− runWithReplace = runWithReplaceEventWriterTWith $ \dm0 dm' -> lift $ runWithReplace dm0 dm'
150− traverseIntMapWithKeyWithAdjust = sequenceIntMapWithAdjustEventWriterTWith (\f dm0 dm' -> lift $ traverseIntMapWithKeyWithAdjust f dm0 dm') mergeIntIncremental coincidencePatchIntMap
151− traverseDMapWithKeyWithAdjust = sequenceDMapWithAdjustEventWriterTWith (\f dm0 dm' -> lift $ traverseDMapWithKeyWithAdjust f dm0 dm') mapPatchDMap weakenPatchDMapWith mergeMapIncremental coincidencePatchMap
152− traverseDMapWithKeyWithAdjustWithMove = sequenceDMapWithAdjustEventWriterTWith (\f dm0 dm' -> lift $ traverseDMapWithKeyWithAdjustWithMove f dm0 dm') mapPatchDMapWithMove weakenPatchDMapWithMoveWith mergeMapIncrementalWithMove coincidencePatchMapWithMove
153−
154−instance Requester t m => Requester t (EventWriterT t w m) where
155− type Request (EventWriterT t w m) = Request m
156− type Response (EventWriterT t w m) = Response m
157− requesting = lift . requesting
158− requesting_ = lift . requesting_
159−
160−-- | Given a function like 'runWithReplace' for the underlying monad, implement
161−-- 'runWithReplace' for 'EventWriterT'. This is necessary when the underlying
162−-- monad doesn't have a 'Adjustable' instance or to override the default
163−-- 'Adjustable' behavior.
164−runWithReplaceEventWriterTWith :: forall m t w a b. (Reflex t, MonadHold t m, Semigroup w)
165− => (forall a' b'. m a' -> Event t (m b') -> EventWriterT t w m (a', Event t b'))
166− -> EventWriterT t w m a
167− -> Event t (EventWriterT t w m b)
168− -> EventWriterT t w m (a, Event t b)
169−runWithReplaceEventWriterTWith f a0 a' = do
170− (result0, result') <- f (runEventWriterT a0) $ fmapCheap runEventWriterT a'
171− tellEvent =<< switchHoldPromptOnly (snd result0) (fmapCheap snd result')
172− return (fst result0, fmapCheap fst result')
173−
174−-- | Like 'runWithReplaceEventWriterTWith', but for 'sequenceIntMapWithAdjust'.
175−sequenceIntMapWithAdjustEventWriterTWith
176− :: forall t m p w v v'
177− . ( Reflex t
178− , MonadHold t m
179− , Semigroup w
180− , Functor p
181− , Patch (p (Event t w))
182− , PatchTarget (p (Event t w)) ~ IntMap (Event t w)
183− , Patch (p w)
184− , PatchTarget (p w) ~ IntMap w
185− )
186− => ( (IntMap.Key -> v -> m (Event t w, v'))
187− -> IntMap v
188− -> Event t (p v)
189− -> EventWriterT t w m (IntMap (Event t w, v'), Event t (p (Event t w, v')))
190− )
191− -> (Incremental t (p (Event t w)) -> Event t (PatchTarget (p w)))
192− -> (Event t (p (Event t w)) -> Event t (p w))
193− -> (IntMap.Key -> v -> EventWriterT t w m v')
194− -> IntMap v
195− -> Event t (p v)
196− -> EventWriterT t w m (IntMap v', Event t (p v'))
197−sequenceIntMapWithAdjustEventWriterTWith base mergePatchIncremental coincidencePatch f dm0 dm' = do
198− let f' :: IntMap.Key -> v -> m (Event t w, v')
199− f' k v = swap <$> runEventWriterT (f k v)
200− (children0, children') <- base f' dm0 dm'
201− let result0 = fmap snd children0
202− result' = fmapCheap (fmap snd) children'
203− requests0 :: IntMap (Event t w)
204− requests0 = fmap fst children0
205− requests' :: Event t (p (Event t w))
206− requests' = fmapCheap (fmap fst) children'
207− e <- switchHoldPromptOnlyIncremental mergePatchIncremental coincidencePatch requests0 requests'
208− tellEvent $ fforMaybeCheap e $ \m ->
209− case IntMap.elems m of
210− [] -> Nothing
211− h : t -> Just $ sconcat $ h :| t
212− return (result0, result')
213−
214−-- | Like 'runWithReplaceEventWriterTWith', but for 'sequenceDMapWithAdjust'.
215−sequenceDMapWithAdjustEventWriterTWith
216− :: forall t m p p' w k v v'
217− . ( Reflex t
218− , MonadHold t m
219− , Semigroup w
220− , Patch (p' (Some k) (Event t w))
221− , PatchTarget (p' (Some k) (Event t w)) ~ Map (Some k) (Event t w)
222− , GCompare k
223− , Patch (p' (Some k) w)
224− , PatchTarget (p' (Some k) w) ~ Map (Some k) w
225− )
226− => ( (forall a. k a -> v a -> m (Compose ((,) (Event t w)) v' a))
227− -> DMap k v
228− -> Event t (p k v)
229− -> EventWriterT t w m (DMap k (Compose ((,) (Event t w)) v'), Event t (p k (Compose ((,) (Event t w)) v')))
230− )
231− -> ((forall a. Compose ((,) (Event t w)) v' a -> v' a) -> p k (Compose ((,) (Event t w)) v') -> p k v')
232− -> ((forall a. Compose ((,) (Event t w)) v' a -> Event t w) -> p k (Compose ((,) (Event t w)) v') -> p' (Some k) (Event t w))
233− -> (Incremental t (p' (Some k) (Event t w)) -> Event t (PatchTarget (p' (Some k) w)))
234− -> (Event t (p' (Some k) (Event t w)) -> Event t (p' (Some k) w))
235− -> (forall a. k a -> v a -> EventWriterT t w m (v' a))
236− -> DMap k v
237− -> Event t (p k v)
238− -> EventWriterT t w m (DMap k v', Event t (p k v'))
239−sequenceDMapWithAdjustEventWriterTWith base mapPatch weakenPatchWith mergePatchIncremental coincidencePatch f dm0 dm' = do
240− let f' :: forall a. k a -> v a -> m (Compose ((,) (Event t w)) v' a)
241− f' k v = Compose . swap <$> runEventWriterT (f k v)
242− (children0, children') <- base f' dm0 dm'
243− let result0 = DMap.map (snd . getCompose) children0
244− result' = fforCheap children' $ mapPatch $ snd . getCompose
245− requests0 :: Map (Some k) (Event t w)
246− requests0 = weakenDMapWith (fst . getCompose) children0
247− requests' :: Event t (p' (Some k) (Event t w))
248− requests' = fforCheap children' $ weakenPatchWith $ fst . getCompose
249− e <- switchHoldPromptOnlyIncremental mergePatchIncremental coincidencePatch requests0 requests'
250− tellEvent $ fforMaybeCheap e $ \m ->
251− case Map.elems m of
252− [] -> Nothing
253− h : t -> Just $ sconcat $ h :| t
254− return (result0, result')
255−
256−instance PerformEvent t m => PerformEvent t (EventWriterT t w m) where
257− type Performable (EventWriterT t w m) = Performable m
258− performEvent_ = lift . performEvent_
259− performEvent = lift . performEvent
260−
261−instance PostBuild t m => PostBuild t (EventWriterT t w m) where
262− getPostBuild = lift getPostBuild
263−
264−instance TriggerEvent t m => TriggerEvent t (EventWriterT t w m) where
265− newTriggerEvent = lift newTriggerEvent
266− newTriggerEventWithOnComplete = lift newTriggerEventWithOnComplete
267− newEventWithLazyTriggerWithOnComplete = lift . newEventWithLazyTriggerWithOnComplete
268−
269−instance MonadReader r m => MonadReader r (EventWriterT t w m) where
270− ask = lift ask
271− local f (EventWriterT a) = EventWriterT $ mapStateT (local f) a
272− reader = lift . reader
273−
274−instance MonadRef m => MonadRef (EventWriterT t w m) where
275− type Ref (EventWriterT t w m) = Ref m
276− newRef = lift . newRef
277− readRef = lift . readRef
278− writeRef r = lift . writeRef r
279−
280−instance MonadAtomicRef m => MonadAtomicRef (EventWriterT t w m) where
281− atomicModifyRef r = lift . atomicModifyRef r
282−
283−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (EventWriterT t w m) where
284− newEventWithTrigger = lift . newEventWithTrigger
285− newFanEventWithTrigger f = lift $ newFanEventWithTrigger f
286−
287−instance (MonadQuery t q m, Monad m) => MonadQuery t q (EventWriterT t w m) where
288− tellQueryIncremental = lift . tellQueryIncremental
289− askQueryResult = lift askQueryResult
290− queryIncremental = lift . queryIncremental
291−
292−instance DynamicWriter t w m => DynamicWriter t w (EventWriterT t v m) where
293− tellDyn = lift . tellDyn
294−
295−instance PrimMonad m => PrimMonad (EventWriterT t w m) where
296− type PrimState (EventWriterT t w m) = PrimState m
297− primitive = lift . primitive
298−
299−-- | Map a function over the output of a 'EventWriterT'.
300−withEventWriterT :: (Semigroup w, Semigroup w', Reflex t, MonadHold t m)
301− => (w -> w')
302− -> EventWriterT t w m a
303− -> EventWriterT t w' m a
304−withEventWriterT f ew = do
305− (r, e) <- lift $ do
306− (r, e) <- runEventWriterT ew
307− let e' = fmap f e
308− return (r, e')
309− tellEvent e
310− return r
311−
312−-- | Change the monad underlying an EventWriterT
313−mapEventWriterT
314− :: (forall x. m x -> n x)
315− -> EventWriterT t w m a
316− -> EventWriterT t w n a
317−mapEventWriterT f (EventWriterT a) = EventWriterT $ mapStateT f a
src/Reflex/EventWriter/Class.hsdeleted−26
@@ -1,26 +0,0 @@
1−-- | This module defines the 'EventWriter' class.
2−{-# LANGUAGE CPP #-}
3−{-# LANGUAGE FlexibleInstances #-}
4−{-# LANGUAGE FunctionalDependencies #-}
5−{-# LANGUAGE UndecidableInstances #-}
6−#ifdef USE_REFLEX_OPTIMIZER
7−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
8−#endif
9−module Reflex.EventWriter.Class
10− ( EventWriter (..)
11− ) where
12−
13−import Control.Monad.Reader (ReaderT, lift)
14−import Data.Semigroup (Semigroup)
15−
16−import Reflex.Class (Event)
17−
18−
19−-- | 'EventWriter' efficiently collects 'Event' values using 'tellEvent'
20−-- and combines them via 'Semigroup' to provide an 'Event' result.
21−class (Monad m, Semigroup w) => EventWriter t w m | m -> t w where
22− tellEvent :: Event t w -> m ()
23−
24−
25−instance EventWriter t w m => EventWriter t w (ReaderT r m) where
26− tellEvent = lift . tellEvent
src/Reflex/FastWeak.hs+6−73
@@ -5,19 +5,6 @@
55{-# LANGUAGE ForeignFunctionInterface #-}
66{-# LANGUAGE JavaScriptFFI #-}
77#endif
8−
9−-- |
10−-- Module:
11−-- Reflex.FastWeak
12−-- Description:
13−-- 'FastWeak' is a weak pointer to some value, and 'FastWeakTicket' ensures the value
14−-- referred to by a 'FastWeak' stays live while the ticket is held (live).
15−--
16−-- On GHC or GHCJS when not built with the @fast-weak@ cabal flag, 'FastWeak' is a wrapper
17−-- around the simple version of 'System.Mem.Weak.Weak' where the key and value are the same.
18−--
19−-- On GHCJS when built with the @fast-weak@ cabal flag, 'FastWeak' is implemented directly
20−-- in JS using @h$FastWeak@ and @h$FastWeakTicket@ which are a nonstandard part of the GHCJS RTS.
218module Reflex.FastWeak
229 ( FastWeakTicket
2310 , FastWeak
@@ -48,57 +35,29 @@ import System.Mem.Weak
4835
4936
5037#ifdef GHCJS_FAST_WEAK
51−-- | A 'FastWeak' which has been promoted to a strong reference. 'getFastWeakTicketValue'
52−-- can be used to get the referred to value without fear of @Nothing,
53−-- and 'getFastWeakTicketWeak' can be used to get the weak version.
54−--
55−-- Implemented by way of special support in the GHCJS RTS, @h$FastWeakTicket@.
5638newtype FastWeakTicket a = FastWeakTicket JSVal
5739
58−-- | A reference to some value which can be garbage collected if there are only
59−-- weak references to the value left.
60−--
61−-- 'getFastWeakValue' can be used to try and obtain a strong reference to the value.
62−--
63−-- The value in a @FastWeak@ can also be kept alive by obtaining a 'FastWeakTicket' using
64−-- 'getFastWeakTicket' if the value hasn't been collected yet.
65−--
66−-- Implemented by way of special support in the GHCJS RTS, @h$FastWeak@.
6740newtype FastWeak a = FastWeak JSVal
6841
6942-- Just designed to mirror JSVal, so that we can unsafeCoerce between the two
7043data Val a = Val { unVal :: a }
7144
72−-- | Coerce a JSVal that represents the heap object of a value of type @a@ into a value of type @a@
45+-- | Coerce a JSVal that represents the heap object of a value of type 'a' into a value of type 'a'
7346unsafeFromRawJSVal :: JSVal -> a
7447unsafeFromRawJSVal v = unVal (unsafeCoerce v)
7548
76−-- | Coerce a heap object of type @a@ into a 'JSVal' which represents that object.
7749unsafeToRawJSVal :: a -> JSVal
7850unsafeToRawJSVal v = unsafeCoerce (Val v)
7951#else
80−-- | A 'FastWeak' which has been promoted to a strong reference. 'getFastWeakTicketValue'
81−-- can be used to get the referred to value without fear of @Nothing@,
82−-- and 'getFastWeakTicketWeak' can be used to get the weak version.
8352data FastWeakTicket a = FastWeakTicket
8453 { _fastWeakTicket_val :: !a
8554 , _fastWeakTicket_weak :: {-# UNPACK #-} !(Weak a)
8655 }
8756
88−-- | A reference to some value which can be garbage collected if there are only weak references to the value left.
89−--
90−-- 'getFastWeakValue' can be used to try and obtain a strong reference to the value.
91−--
92−-- The value in a @FastWeak@ can also be kept alive by obtaining a 'FastWeakTicket' using 'getFastWeakTicket'
93−-- if the value hasn't been collected yet.
94−--
95−-- Synonymous with 'Weak'.
9657type FastWeak a = Weak a
9758#endif
9859
99−-- | Return the @a@ kept alive by the given 'FastWeakTicket'.
100−--
101−-- This needs to be in IO so we know that we've relinquished the ticket.
60+-- This needs to be in IO so we know that we've relinquished the ticket
10261getFastWeakTicketValue :: FastWeakTicket a -> IO a
10362#ifdef GHCJS_FAST_WEAK
10463getFastWeakTicketValue t = do
@@ -110,8 +69,6 @@ foreign import javascript unsafe "$r = $1.val;" js_ticketVal :: FastWeakTicket a
11069getFastWeakTicketValue = return . _fastWeakTicket_val
11170#endif
11271
113−-- | Get the value referred to by a 'FastWeak' if it hasn't yet been collected,
114−-- or @Nothing@ if it has been collected.
11572getFastWeakValue :: FastWeak a -> IO (Maybe a)
11673#ifdef GHCJS_FAST_WEAK
11774getFastWeakValue w = do
@@ -127,9 +84,6 @@ foreign import javascript unsafe "$r = ($1.ticket === null) ? null : $1.ticket.v
12784getFastWeakValue = deRefWeak
12885#endif
12986
130−-- | Try to create a 'FastWeakTicket' for the given 'FastWeak' which will ensure the value referred
131−-- remains alive. Returns @Just@ if the value hasn't been collected
132−-- and a ticket can therefore be obtained, @Nothing@ if it's been collected.
13387getFastWeakTicket :: forall a. FastWeak a -> IO (Maybe (FastWeakTicket a))
13488#ifdef GHCJS_FAST_WEAK
13589getFastWeakTicket w = do
@@ -149,21 +103,8 @@ getFastWeakTicket w = do
149103 }
150104#endif
151105
152−-- | Create a 'FastWeakTicket' directly from a value, creating a 'FastWeak' in the process
153−-- which can be obtained with 'getFastWeakTicketValue'.
154−--
155−-- This function is marked NOINLINE so it is opaque to GHC.
156−-- If we do not do this, then GHC will sometimes fuse the constructor away
157−-- so any weak references that are attached to the ticket will have their
158−-- finalizer run. Using the opaque constructor, GHC does not see the
159−-- constructor application, so it behaves like an IORef and cannot be fused away.
160−--
161−-- The result is also evaluated to WHNF, since forcing a thunk invalidates
162−-- the weak pointer to it in some cases.
163−{-# NOINLINE mkFastWeakTicket #-}
106+-- I think it's fine if this is lazy - it'll retain the 'a', but so would the output; we just need to make sure it's forced before we start relying on the associated FastWeak to actually be weak
164107mkFastWeakTicket :: a -> IO (FastWeakTicket a)
165−-- I think it's fine if this is lazy - it'll retain the 'a', but so would the output; we just need to make sure it's forced before we start relying on the
166−-- associated FastWeak to actually be weak
167108#ifdef GHCJS_FAST_WEAK
168109mkFastWeakTicket v = js_fastWeakTicket (unsafeToRawJSVal v)
169110
@@ -178,16 +119,11 @@ mkFastWeakTicket v = do
178119 }
179120#endif
180121
181−-- | Demote a 'FastWeakTicket'; which ensures the value is alive, to a 'FastWeak' which doesn't.
182−-- Note that unless the ticket for the same 'FastWeak' is held in some other way
183−-- the value might be collected immediately.
184−getFastWeakTicketWeak :: FastWeakTicket a -> IO (FastWeak a)
185122-- Needs IO so that it can force the value - otherwise, could end up with a reference to the Ticket, which would retain the value
186123#ifdef GHCJS_FAST_WEAK
187−foreign import javascript unsafe "$r = $1.weak;" getFastWeakTicketWeak' :: FastWeakTicket a -> IO (FastWeak a)
188−{-# INLINE getFastWeakTicketWeak #-}
189−getFastWeakTicketWeak = getFastWeakTicketWeak'
124+foreign import javascript unsafe "$r = $1.weak;" getFastWeakTicketWeak :: FastWeakTicket a -> IO (FastWeak a)
190125#else
126+getFastWeakTicketWeak :: FastWeakTicket a -> IO (FastWeak a)
191127getFastWeakTicketWeak = return . _fastWeakTicket_weak
192128#endif
193129
@@ -197,6 +133,7 @@ emptyFastWeak = unsafeCoerce w
197133 where w :: FastWeak Any
198134#ifdef GHCJS_FAST_WEAK
199135 w = js_emptyWeak
136+foreign import javascript unsafe "$r = new h$FastWeak(null);" js_emptyWeak :: FastWeak Any
200137#else
201138 w = unsafePerformIO $ do
202139 w' <- mkWeakPtr undefined Nothing
@@ -204,7 +141,3 @@ emptyFastWeak = unsafeCoerce w
204141 return w'
205142#endif
206143{-# NOINLINE emptyFastWeak #-}
207−
208−#ifdef GHCJS_FAST_WEAK
209−foreign import javascript unsafe "$r = new h$FastWeak(null);" js_emptyWeak :: FastWeak Any
210−#endif
src/Reflex/FunctorMaybe.hs+16−34
@@ -1,47 +1,29 @@
1−{-# LANGUAGE CPP #-}
2−#if MIN_VERSION_base(4,9,0)
3−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
4−{-# LANGUAGE StandaloneDeriving #-}
5−#endif
6−
7−-- |
8−-- Module:
9−-- Reflex.FunctorMaybe
10−-- Description:
11−-- This module defines the FunctorMaybe class, which extends Functors with the
12−-- ability to delete values.
1+-- | This module defines the FunctorMaybe class, which extends Functors with the
2+-- ability to delete values.
133module Reflex.FunctorMaybe
144 ( FunctorMaybe (..)
155 ) where
166
17−import Data.IntMap (IntMap)
18−import Data.Map (Map)
19−#if MIN_VERSION_base(4,9,0)
20−import Data.Semigroup (Option(..))
21−#endif
22−import Data.Witherable
7+import Data.Maybe
238
249--TODO: See if there's a better class in the standard libraries already
2510
2611-- | A class for values that combines filtering and mapping using 'Maybe'.
27−-- Morally, @'FunctorMaybe' ~ KleisliFunctor 'Maybe'@.
28−{-# DEPRECATED FunctorMaybe "Use 'Filterable' from Data.Witherable instead" #-}
12+-- Morally, @'FunctorMaybe' ~ KleisliFunctor 'Maybe'@. Also similar is the
13+-- @Witherable@ typeclass, but it requires @Foldable f@ and @Traverable f@,
14+-- and e.g. 'Event' is instance of neither.
15+--
16+-- A definition of 'fmapMaybe' must satisfy the following laws:
17+--
18+-- [/identity/]
19+-- @'fmapMaybe' 'Just' ≡ 'id'@
20+--
21+-- [/composition/]
22+-- @'fmapMaybe' (f <=< g) ≡ 'fmapMaybe' f . 'fmapMaybe' g@
2923class FunctorMaybe f where
3024 -- | Combined mapping and filtering function.
3125 fmapMaybe :: (a -> Maybe b) -> f a -> f b
3226
33−instance FunctorMaybe Maybe where
34− fmapMaybe = mapMaybe
35−
36−#if MIN_VERSION_base(4,9,0)
37−deriving instance FunctorMaybe Option
38−#endif
39−
27+-- | @fmapMaybe f = catMaybes . fmap f@
4028instance FunctorMaybe [] where
41− fmapMaybe = mapMaybe
42−
43−instance FunctorMaybe (Map k) where
44− fmapMaybe = mapMaybe
45−
46−instance FunctorMaybe IntMap where
47− fmapMaybe = mapMaybe
29+ fmapMaybe f = catMaybes . fmap f
src/Reflex/Host/Class.hs+26−6
@@ -4,6 +4,7 @@
44{-# LANGUAGE FlexibleInstances #-}
55{-# LANGUAGE FunctionalDependencies #-}
66{-# LANGUAGE GADTs #-}
7+{-# LANGUAGE MultiParamTypeClasses #-}
78{-# LANGUAGE RankNTypes #-}
89{-# LANGUAGE RoleAnnotations #-}
910{-# LANGUAGE ScopedTypeVariables #-}
@@ -29,19 +30,38 @@ module Reflex.Host.Class
2930
3031import Reflex.Class
3132
33+import Control.Applicative
34+import Control.Monad
3235import Control.Monad.Fix
3336import Control.Monad.Identity
3437import Control.Monad.Ref
3538import Control.Monad.Trans
36−import Control.Monad.Trans.Cont (ContT)
37−import Control.Monad.Trans.Except (ExceptT)
38−import Control.Monad.Trans.Reader (ReaderT)
39−import Control.Monad.Trans.RWS (RWST)
40−import Control.Monad.Trans.State (StateT)
39+import Control.Monad.Trans.Cont (ContT ())
40+import Control.Monad.Trans.Except (ExceptT ())
41+import Control.Monad.Trans.Reader (ReaderT ())
42+import Control.Monad.Trans.RWS (RWST ())
43+import Control.Monad.Trans.State (StateT ())
4144import qualified Control.Monad.Trans.State.Strict as Strict
42−import Control.Monad.Trans.Writer (WriterT)
45+import Control.Monad.Trans.Writer (WriterT ())
4346import Data.Dependent.Sum (DSum (..))
4447import Data.GADT.Compare
48+import Data.Monoid
49+
50+#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
51+import Control.Monad.Primitive (touch)
52+import Data.IORef
53+import Reflex.Spider.Internal (EventM (..), HasSpiderTimeline, RootTrigger, SpiderEventHandle (..),
54+ SpiderHost (..), SpiderHostFrame (..), Subscriber (..), newEventWithTriggerIO,
55+ newFanEventWithTriggerIO, run, runFrame, scheduleClear, subscribe)
56+import qualified Reflex.Spider.Internal
57+#endif
58+
59+-- Note: this import must come last to silence warnings from AMP
60+import Prelude hiding (foldl, mapM, mapM_, sequence, sequence_)
61+
62+#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
63+#include "../Spider/SpiderTimelineHost.include.hs"
64+#endif
4565
4666-- | Framework implementation support class for the reflex implementation
4767-- represented by @t@.
src/Reflex/Host/Headless.hsdeleted−128
@@ -1,128 +0,0 @@
1−{-# LANGUAGE LambdaCase #-}
2−{-# LANGUAGE FlexibleContexts #-}
3−{-# LANGUAGE RankNTypes #-}
4−{-# LANGUAGE TypeFamilies #-}
5−{-# LANGUAGE ConstraintKinds #-}
6−
7−module Reflex.Host.Headless where
8−
9−import Control.Concurrent.Chan (newChan, readChan)
10−import Control.Monad (unless)
11−import Control.Monad.Fix (MonadFix, fix)
12−import Control.Monad.IO.Class (MonadIO, liftIO)
13−import Control.Monad.Primitive (PrimMonad)
14−import Control.Monad.Ref (MonadRef, Ref, readRef)
15−import Data.Dependent.Sum (DSum (..), (==>))
16−import Data.Foldable (for_)
17−import Data.Functor.Identity (Identity(..))
18−import Data.IORef (IORef, readIORef)
19−import Data.Maybe (catMaybes, fromMaybe)
20−import Data.Traversable (for)
21−
22−import Reflex
23−import Reflex.Host.Class
24−
25−type MonadHeadlessApp t m =
26− ( Adjustable t m
27− , MonadFix m
28− , MonadHold t m
29− , MonadIO (HostFrame t)
30− , MonadIO (Performable m)
31− , MonadIO m
32− , MonadRef (HostFrame t)
33− , NotReady t m
34− , PerformEvent t m
35− , PostBuild t m
36− , PrimMonad (HostFrame t)
37− , Ref (HostFrame t) ~ IORef
38− , Ref m ~ IORef
39− , Reflex t
40− , ReflexHost t
41− , TriggerEvent t m
42− )
43−
44−-- | Run a headless FRP network. Inside the action, you will most probably use
45−-- the capabilities provided by the 'TriggerEvent' and 'PerformEvent' type
46−-- classes to interface the FRP network with the outside world. Useful for
47−-- testing. Each headless network runs on its own spider timeline.
48−runHeadlessApp
49− :: (forall t m. MonadHeadlessApp t m => m (Event t ()))
50− -- ^ The action to be run in the headless FRP network. The FRP network is
51− -- closed at the first occurrence of the resulting 'Event'.
52− -> IO ()
53−runHeadlessApp guest =
54− -- We are using the 'Spider' implementation of reflex. Running the host
55− -- allows us to take actions on the FRP timeline.
56− withSpiderTimeline $ runSpiderHostForTimeline $ do
57− -- Create the "post-build" event and associated trigger. This event fires
58− -- once, when the application starts.
59− (postBuild, postBuildTriggerRef) <- newEventWithTriggerRef
60− -- Create a queue to which we will write 'Event's that need to be
61− -- processed.
62− events <- liftIO newChan
63− -- Run the "guest" application, providing the appropriate context. We'll
64− -- pure the result of the action, and a 'FireCommand' that will be used to
65− -- trigger events.
66− (result, fc@(FireCommand fire)) <- do
67− hostPerformEventT $ -- Allows the guest app to run
68− -- 'performEvent', so that actions
69− -- (e.g., IO actions) can be run when
70− -- 'Event's fire.
71−
72− flip runPostBuildT postBuild $ -- Allows the guest app to access to
73− -- a "post-build" 'Event'
74−
75− flip runTriggerEventT events $ -- Allows the guest app to create new
76− -- events and triggers and write
77− -- those triggers to a channel from
78− -- which they will be read and
79− -- processed.
80− guest
81−
82− -- Read the trigger reference for the post-build event. This will be
83− -- 'Nothing' if the guest application hasn't subscribed to this event.
84− mPostBuildTrigger <- readRef postBuildTriggerRef
85−
86− -- Subscribe to an 'Event' of that the guest application can use to
87− -- request application shutdown. We'll check whether this 'Event' is firing
88− -- to determine whether to terminate.
89− shutdown <- subscribeEvent result
90−
91− -- When there is a subscriber to the post-build event, fire the event.
92− soa <- for mPostBuildTrigger $ \postBuildTrigger ->
93− fire [postBuildTrigger :=> Identity ()] $ isFiring shutdown
94−
95− -- The main application loop. We wait for new events and fire those that
96− -- have subscribers. If we detect a shutdown request, the application
97− -- terminates.
98− unless (or (fromMaybe [] soa)) $ fix $ \loop -> do
99− -- Read the next event (blocking).
100− ers <- liftIO $ readChan events
101− stop <- do
102− -- Fire events that have subscribers.
103− fireEventTriggerRefs fc ers $
104− -- Check if the shutdown 'Event' is firing.
105− isFiring shutdown
106− if or stop
107− then pure ()
108− else loop
109− where
110− isFiring ev = readEvent ev >>= \case
111− Nothing -> pure False
112− Just _ -> pure True
113− -- Use the given 'FireCommand' to fire events that have subscribers
114− -- and call the callback for the 'TriggerInvocation' of each.
115− fireEventTriggerRefs
116− :: MonadIO m
117− => FireCommand t m
118− -> [DSum (EventTriggerRef t) TriggerInvocation]
119− -> ReadPhase m a
120− -> m [a]
121− fireEventTriggerRefs (FireCommand fire) ers rcb = do
122− mes <- liftIO $
123− for ers $ \(EventTriggerRef er :=> TriggerInvocation a _) -> do
124− me <- readIORef er
125− pure $ fmap (==> a) me
126− a <- fire (catMaybes mes) rcb
127− liftIO $ for_ ers $ \(_ :=> TriggerInvocation _ cb) -> cb
128− pure a
src/Reflex/Network.hsdeleted−45
@@ -1,45 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−{-# LANGUAGE MultiParamTypeClasses #-}
3−#ifdef USE_REFLEX_OPTIMIZER
4−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
5−#endif
6−-- |
7−-- Module:
8−-- Reflex.Network
9−-- Description:
10−-- This module provides combinators for building FRP graphs/networks and modifying them dynamically.
11−module Reflex.Network
12− ( networkView
13− , networkHold
14− , untilReady
15− ) where
16−
17−import Reflex.Class
18−import Reflex.Adjustable.Class
19−import Reflex.NotReady.Class
20−import Reflex.PostBuild.Class
21−
22−-- | A 'Dynamic' "network": Takes a 'Dynamic' of network-creating actions and replaces the network whenever the 'Dynamic' updates.
23−-- The returned Event of network results fires at post-build time and when the 'Dynamic' updates.
24−-- Note: Often, the type 'a' is an Event, in which case the return value is an Event-of-Events, where the outer 'Event' fires
25−-- when switching networks. Such an 'Event' would typically be flattened (via 'switchPromptly').
26−networkView :: (NotReady t m, Adjustable t m, PostBuild t m) => Dynamic t (m a) -> m (Event t a)
27−networkView child = do
28− postBuild <- getPostBuild
29− let newChild = leftmost [updated child, tagCheap (current child) postBuild]
30− snd <$> runWithReplace notReady newChild
31−
32−-- | Given an initial "network" and an 'Event' of network-creating actions, create a network that is recreated whenever the Event fires.
33−-- The returned Dynamic of network results occurs when the Event does.
34−-- Note: Often, the type 'a' is an Event, in which case the return value is a Dynamic-of-Events that would typically be flattened.
35−networkHold :: (Adjustable t m, MonadHold t m) => m a -> Event t (m a) -> m (Dynamic t a)
36−networkHold child0 newChild = do
37− (result0, newResult) <- runWithReplace child0 newChild
38− holdDyn result0 newResult
39−
40−-- | Render a placeholder network to be shown while another network is not yet
41−-- done building
42−untilReady :: (Adjustable t m, PostBuild t m) => m a -> m b -> m (a, Event t b)
43−untilReady a b = do
44− postBuild <- getPostBuild
45− runWithReplace a $ b <$ postBuild
src/Reflex/NotReady/Class.hsdeleted−77
@@ -1,77 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−{-# LANGUAGE DefaultSignatures #-}
3−{-# LANGUAGE FlexibleContexts #-}
4−{-# LANGUAGE FlexibleInstances #-}
5−{-# LANGUAGE FunctionalDependencies #-}
6−{-# LANGUAGE TypeFamilies #-}
7−{-# LANGUAGE UndecidableInstances #-}
8−#ifdef USE_REFLEX_OPTIMIZER
9−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
10−#endif
11−module Reflex.NotReady.Class
12− ( NotReady(..)
13− ) where
14−
15−import Control.Monad.Reader (ReaderT)
16−import Control.Monad.Trans
17−import Control.Monad.Trans.Writer (WriterT)
18−
19−import Reflex.BehaviorWriter.Base (BehaviorWriterT)
20−import Reflex.Class
21−import Reflex.DynamicWriter.Base (DynamicWriterT)
22−import Reflex.EventWriter.Base (EventWriterT)
23−import Reflex.Host.Class
24−import Reflex.PerformEvent.Base (PerformEventT (..))
25−import Reflex.PostBuild.Base (PostBuildT)
26−import Reflex.Query.Base (QueryT)
27−import Reflex.Requester.Base (RequesterT)
28−import Reflex.TriggerEvent.Base (TriggerEventT)
29−
30−class Monad m => NotReady t m | m -> t where
31− notReadyUntil :: Event t a -> m ()
32− default notReadyUntil :: (MonadTrans f, m ~ f m', NotReady t m') => Event t a -> m ()
33− notReadyUntil = lift . notReadyUntil
34−
35− notReady :: m ()
36− default notReady :: (MonadTrans f, m ~ f m', NotReady t m') => m ()
37− notReady = lift notReady
38−
39−instance NotReady t m => NotReady t (ReaderT r m) where
40− notReadyUntil = lift . notReadyUntil
41− notReady = lift notReady
42−
43−instance (NotReady t m, Monoid w) => NotReady t (WriterT w m) where
44− notReadyUntil = lift . notReadyUntil
45− notReady = lift notReady
46−
47−instance NotReady t m => NotReady t (PostBuildT t m) where
48− notReadyUntil = lift . notReadyUntil
49− notReady = lift notReady
50−
51−instance NotReady t m => NotReady t (EventWriterT t w m) where
52− notReadyUntil = lift . notReadyUntil
53− notReady = lift notReady
54−
55−instance NotReady t m => NotReady t (DynamicWriterT t w m) where
56− notReadyUntil = lift . notReadyUntil
57− notReady = lift notReady
58−
59−instance NotReady t m => NotReady t (BehaviorWriterT t w m) where
60− notReadyUntil = lift . notReadyUntil
61− notReady = lift notReady
62−
63−instance NotReady t m => NotReady t (QueryT t q m) where
64− notReadyUntil = lift . notReadyUntil
65− notReady = lift notReady
66−
67−instance (ReflexHost t, NotReady t (HostFrame t)) => NotReady t (PerformEventT t m) where
68− notReadyUntil = PerformEventT . notReadyUntil
69− notReady = PerformEventT notReady
70−
71−instance NotReady t m => NotReady t (RequesterT t request response m) where
72− notReadyUntil = lift . notReadyUntil
73− notReady = lift notReady
74−
75−instance NotReady t m => NotReady t (TriggerEventT t m) where
76− notReadyUntil = lift . notReadyUntil
77− notReady = lift notReady
src/Reflex/Optimizer.hs+4−13
@@ -1,14 +1,10 @@
1+-- | This module provides a GHC plugin designed to improve code that uses
2+-- Reflex. Currently, it just adds an INLINABLE pragma to any top-level
3+-- definition that doesn't have an explicit inlining pragma. In the future,
4+-- additional optimizations are likely to be added.
15{-# LANGUAGE CPP #-}
26{-# LANGUAGE LambdaCase #-}
37{-# LANGUAGE OverloadedStrings #-}
4−-- |
5−-- Module:
6−-- Reflex.Optimizer
7−-- Description:
8−-- This module provides a GHC plugin designed to improve code that uses
9−-- Reflex. Currently, it just adds an INLINABLE pragma to any top-level
10−-- definition that doesn't have an explicit inlining pragma. In the future,
11−-- additional optimizations are likely to be added.
128module Reflex.Optimizer
139 ( plugin
1410 ) where
@@ -20,11 +16,6 @@ import Control.Arrow
2016import CoreMonad
2117import Data.String
2218import GhcPlugins
23−
24−#if MIN_VERSION_base(4,9,0)
25−import Prelude hiding ((<>))
26−#endif
27−
2819#endif
2920
3021#ifdef ghcjs_HOST_OS
src/Reflex/Patch.hsnew file+33
@@ -0,0 +1,33 @@
1+-- | This module defines the 'Patch' class, which is used by Reflex to manage
2+-- changes to 'Reflex.Class.Incremental' values.
3+{-# LANGUAGE TypeFamilies #-}
4+module Reflex.Patch
5+ ( module Reflex.Patch
6+ , module X
7+ ) where
8+
9+import Reflex.Patch.Class as X
10+import Reflex.Patch.DMap as X
11+import Reflex.Patch.DMapWithMove as X (PatchDMapWithMove, const2PatchDMapWithMoveWith, patchDMapWithMoveToPatchMapWithMoveWith, mapPatchDMapWithMove, weakenPatchDMapWithMoveWith, traversePatchDMapWithMoveWithKey, unsafePatchDMapWithMove, unPatchDMapWithMove)
12+import Reflex.Patch.Map as X
13+import Reflex.Patch.MapWithMove as X (PatchMapWithMove, patchMapWithMoveNewElementsMap, patchMapWithMoveNewElements, unsafePatchMapWithMove, unPatchMapWithMove)
14+
15+import Data.Semigroup (Semigroup (..), (<>))
16+
17+---- Patches based on commutative groups
18+
19+-- | A 'Group' is a 'Monoid' where every element has an inverse.
20+class (Semigroup q, Monoid q) => Group q where
21+ negateG :: q -> q
22+ (~~) :: q -> q -> q
23+ r ~~ s = r <> negateG s
24+
25+-- | An 'Additive' 'Semigroup' is one where (<>) is commutative
26+class Semigroup q => Additive q where
27+
28+-- | The elements of an 'Additive' 'Semigroup' can be considered as patches of their own type.
29+newtype AdditivePatch p = AdditivePatch { unAdditivePatch :: p }
30+
31+instance Additive p => Patch (AdditivePatch p) where
32+ type PatchTarget (AdditivePatch p) = p
33+ apply (AdditivePatch p) q = Just $ p <> q
src/Reflex/Patch/Class.hsnew file+20
@@ -0,0 +1,20 @@
1+{-# LANGUAGE TypeFamilies #-}
2+module Reflex.Patch.Class where
3+
4+import Control.Monad.Identity
5+import Data.Maybe
6+
7+-- | A 'Patch' type represents a kind of change made to a datastructure.
8+class Patch p where
9+ type PatchTarget p :: *
10+ -- | Apply the patch @p a@ to the value @a@. If no change is needed, return
11+ -- 'Nothing'.
12+ apply :: p -> PatchTarget p -> Maybe (PatchTarget p)
13+
14+applyAlways :: Patch p => p -> PatchTarget p -> PatchTarget p
15+applyAlways p t = fromMaybe t $ apply p t
16+
17+instance Patch (Identity a) where
18+ type PatchTarget (Identity a) = a
19+ apply (Identity a) _ = Just a
20+
src/Reflex/Patch/DMap.hsnew file+61
@@ -0,0 +1,61 @@
1+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
2+{-# LANGUAGE LambdaCase #-}
3+{-# LANGUAGE PolyKinds #-}
4+{-# LANGUAGE Rank2Types #-}
5+{-# LANGUAGE ScopedTypeVariables #-}
6+{-# LANGUAGE StandaloneDeriving #-}
7+{-# LANGUAGE TypeFamilies #-}
8+module Reflex.Patch.DMap where
9+
10+import Reflex.Patch.Class
11+import Reflex.Patch.Map
12+
13+import Data.Dependent.Map (DMap, DSum (..), GCompare (..))
14+import qualified Data.Dependent.Map as DMap
15+import Data.Functor.Constant
16+import Data.Functor.Misc
17+import qualified Data.Map as Map
18+import Data.Semigroup (Semigroup (..))
19+import Data.Some (Some)
20+
21+-- | A set of changes to a 'DMap'. Any element may be inserted/updated or
22+-- deleted.
23+newtype PatchDMap k v = PatchDMap { unPatchDMap :: DMap k (ComposeMaybe v) }
24+
25+deriving instance GCompare k => Semigroup (PatchDMap k v)
26+
27+deriving instance GCompare k => Monoid (PatchDMap k v)
28+
29+instance GCompare k => Patch (PatchDMap k v) where
30+ type PatchTarget (PatchDMap k v) = DMap k v
31+ apply (PatchDMap diff) old = Just $! insertions `DMap.union` (old `DMap.difference` deletions) --TODO: return Nothing sometimes --Note: the strict application here is critical to ensuring that incremental merges don't hold onto all their prerequisite events forever; can we make this more robust?
32+ where insertions = DMap.mapMaybeWithKey (const $ getComposeMaybe) diff
33+ deletions = DMap.mapMaybeWithKey (const $ nothingToJust . getComposeMaybe) diff
34+ nothingToJust = \case
35+ Nothing -> Just $ Constant ()
36+ Just _ -> Nothing
37+
38+mapPatchDMap :: (forall a. v a -> v' a) -> PatchDMap k v -> PatchDMap k v'
39+mapPatchDMap f (PatchDMap p) = PatchDMap $ DMap.map (ComposeMaybe . fmap f . getComposeMaybe) p
40+
41+traversePatchDMap :: Applicative m => (forall a. v a -> m (v' a)) -> PatchDMap k v -> m (PatchDMap k v')
42+traversePatchDMap f = traversePatchDMapWithKey $ const f
43+
44+traversePatchDMapWithKey :: Applicative m => (forall a. k a -> v a -> m (v' a)) -> PatchDMap k v -> m (PatchDMap k v')
45+traversePatchDMapWithKey f (PatchDMap p) = PatchDMap <$> DMap.traverseWithKey (\k (ComposeMaybe v) -> ComposeMaybe <$> traverse (f k) v) p
46+
47+weakenPatchDMapWith :: (forall a. v a -> v') -> PatchDMap k v -> PatchMap (Some k) v'
48+weakenPatchDMapWith f (PatchDMap p) = PatchMap $ weakenDMapWith (fmap f . getComposeMaybe) p
49+
50+patchDMapToPatchMapWith :: (f v -> v') -> PatchDMap (Const2 k v) f -> PatchMap k v'
51+patchDMapToPatchMapWith f (PatchDMap p) = PatchMap $ dmapToMapWith (fmap f . getComposeMaybe) p
52+
53+const2PatchDMapWith :: forall k v f a. (v -> f a) -> PatchMap k v -> PatchDMap (Const2 k a) f
54+const2PatchDMapWith f (PatchMap p) = PatchDMap $ DMap.fromDistinctAscList $ g <$> Map.toAscList p
55+ where g :: (k, Maybe v) -> DSum (Const2 k a) (ComposeMaybe f)
56+ g (k, e) = Const2 k :=> ComposeMaybe (f <$> e)
57+
58+-- | Get the values that will be deleted if the given patch is applied to the
59+-- given 'DMap'. Includes values that will be replaced.
60+getDeletions :: GCompare k => PatchDMap k v -> DMap k v' -> DMap k v'
61+getDeletions (PatchDMap p) m = DMap.intersectionWithKey (\_ v _ -> v) m p
src/Reflex/Patch/DMapWithMove.hsnew file+281
@@ -0,0 +1,281 @@
1+{-# LANGUAGE CPP #-}
2+{-# LANGUAGE FlexibleContexts #-}
3+{-# LANGUAGE FlexibleInstances #-}
4+{-# LANGUAGE GADTs #-}
5+{-# LANGUAGE LambdaCase #-}
6+{-# LANGUAGE MultiParamTypeClasses #-}
7+{-# LANGUAGE PatternGuards #-}
8+{-# LANGUAGE PolyKinds #-}
9+{-# LANGUAGE Rank2Types #-}
10+{-# LANGUAGE ScopedTypeVariables #-}
11+{-# LANGUAGE TypeFamilies #-}
12+{-# LANGUAGE UndecidableInstances #-}
13+module Reflex.Patch.DMapWithMove where
14+
15+import Reflex.Patch.Class
16+import Reflex.Patch.MapWithMove (PatchMapWithMove (..))
17+import qualified Reflex.Patch.MapWithMove as MapWithMove
18+
19+import Data.Dependent.Map (DMap, DSum (..), GCompare (..))
20+import qualified Data.Dependent.Map as DMap
21+import Data.Dependent.Sum (EqTag (..))
22+import Data.Functor.Constant
23+import Data.Functor.Misc
24+import Data.Functor.Product
25+import Data.GADT.Compare (GEq (..))
26+import qualified Data.Map as Map
27+import Data.Maybe
28+import Data.Semigroup (Semigroup (..), (<>))
29+import Data.Some (Some)
30+import qualified Data.Some as Some
31+import Data.These
32+
33+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
34+import Data.Dependent.Sum (ShowTag (..))
35+import Data.GADT.Show (GShow (..))
36+import Data.Typeable (Proxy (..))
37+#endif
38+
39+-- | Like 'PatchMapWithMove', but for 'DMap'.
40+newtype PatchDMapWithMove k v = PatchDMapWithMove (DMap k (NodeInfo k v))
41+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
42+ deriving (Show)
43+#endif
44+
45+data NodeInfo k v a = NodeInfo
46+ { _nodeInfo_from :: !(From k v a)
47+ , _nodeInfo_to :: !(To k a)
48+ }
49+ deriving (Show)
50+
51+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
52+instance {-# INCOHERENT #-} (GShow k, ShowTag k v) => ShowTag k (NodeInfo k v) where
53+ showTagToShow k _ r = gshowToShow k $ showTagToShow k (Proxy :: Proxy v) r
54+
55+instance {-# INCOHERENT #-} (GEq k, EqTag k v) => EqTag k (From k v) where
56+ eqTagToEq k _ r = eqTagToEq k (Proxy :: Proxy v) (geqToEq k r)
57+#endif
58+
59+data From (k :: a -> *) (v :: a -> *) :: a -> * where
60+ From_Insert :: v a -> From k v a
61+ From_Delete :: From k v a
62+ From_Move :: !(k a) -> From k v a
63+ deriving (Show, Read, Eq, Ord)
64+
65+type To = ComposeMaybe
66+
67+validPatchDMapWithMove :: forall k v. (GCompare k, EqTag k (ComposeMaybe k)) => PatchDMapWithMove k v -> Bool
68+validPatchDMapWithMove (PatchDMapWithMove m) = src == srcFromDst
69+ where
70+ src = DMap.map _nodeInfo_to m
71+ dst = DMap.map _nodeInfo_from m
72+ srcFromDst :: DMap k (ComposeMaybe k)
73+ srcFromDst = DMap.fromList $ flip fmap (DMap.toList dst) $ \(to :=> edit) -> case edit of
74+ From_Move from -> from :=> ComposeMaybe (Just to)
75+ _ -> to :=> ComposeMaybe Nothing
76+
77+instance EqTag k (NodeInfo k v) => Eq (PatchDMapWithMove k v) where
78+ PatchDMapWithMove a == PatchDMapWithMove b = a == b
79+
80+data Pair1 f g a = Pair1 (f a) (g a)
81+
82+instance GCompare k => Semigroup (PatchDMapWithMove k v) where
83+ (<>) = mappend
84+
85+data Fixup k v a
86+ = Fixup_Delete
87+ | Fixup_Update (These (From k v a) (To k a))
88+
89+instance GCompare k => Monoid (PatchDMapWithMove k v) where
90+ mempty = PatchDMapWithMove mempty
91+ PatchDMapWithMove ma `mappend` PatchDMapWithMove mb = PatchDMapWithMove m
92+ where
93+ connections = DMap.toList $ DMap.intersectionWithKey (\_ a b -> Pair1 (_nodeInfo_to a) (_nodeInfo_from b)) ma mb
94+ h :: DSum k (Pair1 (ComposeMaybe k) (From k v)) -> [DSum k (Fixup k v)]
95+ h (_ :=> Pair1 (ComposeMaybe mToAfter) editBefore) = case (mToAfter, editBefore) of
96+ (Just toAfter, From_Move fromBefore)
97+ | isJust $ fromBefore `geq` toAfter
98+ -> [toAfter :=> Fixup_Delete]
99+ | otherwise
100+ -> [ toAfter :=> Fixup_Update (This editBefore)
101+ , fromBefore :=> Fixup_Update (That (ComposeMaybe mToAfter))
102+ ]
103+ (Nothing, From_Move fromBefore) -> [fromBefore :=> Fixup_Update (That (ComposeMaybe mToAfter))] -- The item is destroyed in the second patch, so indicate that it is destroyed in the source map
104+ (Just toAfter, _) -> [toAfter :=> Fixup_Update (This editBefore)]
105+ (Nothing, _) -> []
106+ mergeFixups _ Fixup_Delete Fixup_Delete = Fixup_Delete
107+ mergeFixups _ (Fixup_Update a) (Fixup_Update b)
108+ | This x <- a, That y <- b
109+ = Fixup_Update $ These x y
110+ | That y <- a, This x <- b
111+ = Fixup_Update $ These x y
112+ mergeFixups _ _ _ = error "PatchDMapWithMove: incompatible fixups"
113+ fixups = DMap.fromListWithKey mergeFixups $ concatMap h connections
114+ combineNodeInfos _ nia nib = NodeInfo
115+ { _nodeInfo_from = _nodeInfo_from nia
116+ , _nodeInfo_to = _nodeInfo_to nib
117+ }
118+ applyFixup _ ni = \case
119+ Fixup_Delete -> Nothing
120+ Fixup_Update u -> Just $ NodeInfo
121+ { _nodeInfo_from = fromMaybe (_nodeInfo_from ni) $ getHere u
122+ , _nodeInfo_to = fromMaybe (_nodeInfo_to ni) $ getThere u
123+ }
124+ m = DMap.differenceWithKey applyFixup (DMap.unionWithKey combineNodeInfos ma mb) fixups
125+
126+getHere :: These a b -> Maybe a
127+getHere = \case
128+ This a -> Just a
129+ These a _ -> Just a
130+ That _ -> Nothing
131+
132+getThere :: These a b -> Maybe b
133+getThere = \case
134+ This _ -> Nothing
135+ These _ b -> Just b
136+ That b -> Just b
137+
138+{-
139+mappendPatchDMapWithMoveSlow :: forall k v. (ShowTag k v, GCompare k) => PatchDMapWithMove k v -> PatchDMapWithMove k v -> PatchDMapWithMove k v
140+PatchDMapWithMove dstAfter srcAfter `mappendPatchDMapWithMoveSlow` PatchDMapWithMove dstBefore srcBefore = PatchDMapWithMove dst src
141+ where
142+ getDstAction k m = fromMaybe (From_Move k) $ DMap.lookup k m -- Any key that isn't present is treated as that key moving to itself
143+ removeRedundantDst toKey (From_Move fromKey) | isJust (toKey `geq` fromKey) = Nothing
144+ removeRedundantDst _ a = Just a
145+ f :: forall a. k a -> From k v a -> Maybe (From k v a)
146+ f toKey _ = removeRedundantDst toKey $ case getDstAction toKey dstAfter of
147+ From_Move fromKey -> getDstAction fromKey dstBefore
148+ nonMove -> nonMove
149+ dst = DMap.mapMaybeWithKey f $ DMap.union dstAfter dstBefore
150+ getSrcAction k m = fromMaybe (ComposeMaybe $ Just k) $ DMap.lookup k m
151+ removeRedundantSrc fromKey (ComposeMaybe (Just toKey)) | isJust (fromKey `geq` toKey) = Nothing
152+ removeRedundantSrc _ a = Just a
153+ g :: forall a. k a -> ComposeMaybe k a -> Maybe (ComposeMaybe k a)
154+ g fromKey _ = removeRedundantSrc fromKey $ case getSrcAction fromKey srcBefore of
155+ ComposeMaybe Nothing -> ComposeMaybe Nothing
156+ ComposeMaybe (Just toKeyBefore) -> getSrcAction toKeyBefore srcAfter
157+ src = DMap.mapMaybeWithKey g $ DMap.union srcAfter srcBefore
158+-}
159+
160+moveDMapKey :: GCompare k => k a -> k a -> PatchDMapWithMove k v
161+moveDMapKey src dst = case src `geq` dst of
162+ Nothing -> PatchDMapWithMove $ DMap.fromList
163+ [ dst :=> NodeInfo (From_Move src) (ComposeMaybe Nothing)
164+ , src :=> NodeInfo From_Delete (ComposeMaybe $ Just dst)
165+ ]
166+ Just _ -> mempty
167+
168+deleteDMapKey :: k a -> PatchDMapWithMove k v
169+deleteDMapKey k = PatchDMapWithMove $ DMap.singleton k $ NodeInfo From_Delete $ ComposeMaybe Nothing
170+
171+{-
172+k1, k2 :: Const2 Int () ()
173+k1 = Const2 1
174+k2 = Const2 2
175+p1, p2 :: PatchDMapWithMove (Const2 Int ()) Identity
176+p1 = moveDMapKey k1 k2
177+p2 = moveDMapKey k2 k1
178+p12 = p1 <> p2
179+p21 = p2 <> p1
180+p12Slow = p1 `mappendPatchDMapWithMoveSlow` p2
181+p21Slow = p2 `mappendPatchDMapWithMoveSlow` p1
182+
183+testPatchDMapWithMove = do
184+ print p1
185+ print p2
186+ print $ p12 == deleteDMapKey k1
187+ print $ p21 == deleteDMapKey k2
188+ print $ p12Slow == deleteDMapKey k1
189+ print $ p21Slow == deleteDMapKey k2
190+
191+dst (PatchDMapWithMove x _) = x
192+src (PatchDMapWithMove _ x) = x
193+-}
194+
195+unPatchDMapWithMove :: PatchDMapWithMove k v -> DMap k (NodeInfo k v)
196+unPatchDMapWithMove (PatchDMapWithMove p) = p
197+
198+-- | Warning: when using this function, you must ensure that the invariants of
199+-- 'PatchDMapWithMove' are preserved; they will not be checked.
200+unsafePatchDMapWithMove :: DMap k (NodeInfo k v) -> PatchDMapWithMove k v
201+unsafePatchDMapWithMove = PatchDMapWithMove
202+
203+mapPatchDMapWithMove :: forall k v v'. (forall a. v a -> v' a) -> PatchDMapWithMove k v -> PatchDMapWithMove k v'
204+mapPatchDMapWithMove f (PatchDMapWithMove p) = PatchDMapWithMove $
205+ DMap.map (\ni -> ni { _nodeInfo_from = g $ _nodeInfo_from ni }) p
206+ where g :: forall a. From k v a -> From k v' a
207+ g = \case
208+ From_Insert v -> From_Insert $ f v
209+ From_Delete -> From_Delete
210+ From_Move k -> From_Move k
211+
212+traversePatchDMapWithMove :: forall m k v v'. Applicative m => (forall a. v a -> m (v' a)) -> PatchDMapWithMove k v -> m (PatchDMapWithMove k v')
213+traversePatchDMapWithMove f = traversePatchDMapWithMoveWithKey $ const f
214+
215+traversePatchDMapWithMoveWithKey :: forall m k v v'. Applicative m => (forall a. k a -> v a -> m (v' a)) -> PatchDMapWithMove k v -> m (PatchDMapWithMove k v')
216+traversePatchDMapWithMoveWithKey f (PatchDMapWithMove p) = PatchDMapWithMove <$> DMap.traverseWithKey (nodeInfoMapFromM . g) p
217+ where g :: forall a. k a -> From k v a -> m (From k v' a)
218+ g k = \case
219+ From_Insert v -> From_Insert <$> f k v
220+ From_Delete -> pure From_Delete
221+ From_Move fromKey -> pure $ From_Move fromKey
222+
223+nodeInfoMapFrom :: (From k v a -> From k v' a) -> NodeInfo k v a -> NodeInfo k v' a
224+nodeInfoMapFrom f ni = ni { _nodeInfo_from = f $ _nodeInfo_from ni }
225+
226+nodeInfoMapFromM :: Functor f => (From k v a -> f (From k v' a)) -> NodeInfo k v a -> f (NodeInfo k v' a)
227+nodeInfoMapFromM f ni = fmap (\result -> ni { _nodeInfo_from = result }) $ f $ _nodeInfo_from ni
228+
229+weakenPatchDMapWithMoveWith :: forall k v v'. (forall a. v a -> v') -> PatchDMapWithMove k v -> PatchMapWithMove (Some k) v'
230+weakenPatchDMapWithMoveWith f (PatchDMapWithMove p) = PatchMapWithMove $ weakenDMapWith g p
231+ where g :: forall a. NodeInfo k v a -> MapWithMove.NodeInfo (Some k) v'
232+ g ni = MapWithMove.NodeInfo
233+ { MapWithMove._nodeInfo_from = case _nodeInfo_from ni of
234+ From_Insert v -> MapWithMove.From_Insert $ f v
235+ From_Delete -> MapWithMove.From_Delete
236+ From_Move k -> MapWithMove.From_Move $ Some.This k
237+ , MapWithMove._nodeInfo_to = Some.This <$> getComposeMaybe (_nodeInfo_to ni)
238+ }
239+
240+patchDMapWithMoveToPatchMapWithMoveWith :: forall k f v v'. (f v -> v') -> PatchDMapWithMove (Const2 k v) f -> PatchMapWithMove k v'
241+patchDMapWithMoveToPatchMapWithMoveWith f (PatchDMapWithMove p) = PatchMapWithMove $ dmapToMapWith g p
242+ where g :: NodeInfo (Const2 k v) f v -> MapWithMove.NodeInfo k v'
243+ g ni = MapWithMove.NodeInfo
244+ { MapWithMove._nodeInfo_from = case _nodeInfo_from ni of
245+ From_Insert v -> MapWithMove.From_Insert $ f v
246+ From_Delete -> MapWithMove.From_Delete
247+ From_Move (Const2 k) -> MapWithMove.From_Move k
248+ , MapWithMove._nodeInfo_to = unConst2 <$> getComposeMaybe (_nodeInfo_to ni)
249+ }
250+
251+const2PatchDMapWithMoveWith :: forall k v f a. (v -> f a) -> PatchMapWithMove k v -> PatchDMapWithMove (Const2 k a) f
252+const2PatchDMapWithMoveWith f (PatchMapWithMove p) = PatchDMapWithMove $ DMap.fromDistinctAscList $ g <$> Map.toAscList p
253+ where g :: (k, MapWithMove.NodeInfo k v) -> DSum (Const2 k a) (NodeInfo (Const2 k a) f)
254+ g (k, ni) = Const2 k :=> NodeInfo
255+ { _nodeInfo_from = case MapWithMove._nodeInfo_from ni of
256+ MapWithMove.From_Insert v -> From_Insert $ f v
257+ MapWithMove.From_Delete -> From_Delete
258+ MapWithMove.From_Move fromKey -> From_Move $ Const2 fromKey
259+ , _nodeInfo_to = ComposeMaybe $ Const2 <$> MapWithMove._nodeInfo_to ni
260+ }
261+
262+instance GCompare k => Patch (PatchDMapWithMove k v) where
263+ type PatchTarget (PatchDMapWithMove k v) = DMap k v
264+ apply (PatchDMapWithMove p) old = Just $! insertions `DMap.union` (old `DMap.difference` deletions) --TODO: return Nothing sometimes --Note: the strict application here is critical to ensuring that incremental merges don't hold onto all their prerequisite events forever; can we make this more robust?
265+ where insertions = DMap.mapMaybeWithKey insertFunc p
266+ insertFunc :: forall a. k a -> NodeInfo k v a -> Maybe (v a)
267+ insertFunc _ ni = case _nodeInfo_from ni of
268+ From_Insert v -> Just v
269+ From_Move k -> DMap.lookup k old
270+ From_Delete -> Nothing
271+ deletions = DMap.mapMaybeWithKey deleteFunc p
272+ deleteFunc :: forall a. k a -> NodeInfo k v a -> Maybe (Constant () a)
273+ deleteFunc _ ni = case _nodeInfo_from ni of
274+ From_Delete -> Just $ Constant ()
275+ _ -> Nothing
276+
277+-- | Get the values that will be deleted or moved if the given patch is applied
278+-- to the given 'DMap'.
279+getDeletionsAndMoves :: GCompare k => PatchDMapWithMove k v -> DMap k v' -> DMap k (Product v' (ComposeMaybe k))
280+getDeletionsAndMoves (PatchDMapWithMove p) m = DMap.intersectionWithKey f m p
281+ where f _ v ni = Pair v $ _nodeInfo_to ni
src/Reflex/Patch/Map.hsnew file+52
@@ -0,0 +1,52 @@
1+{-# LANGUAGE CPP #-}
2+{-# LANGUAGE LambdaCase #-}
3+{-# LANGUAGE TypeFamilies #-}
4+module Reflex.Patch.Map where
5+
6+import Reflex.Patch.Class
7+
8+import Data.Semigroup
9+import Data.Map (Map)
10+import qualified Data.Map as Map
11+import Data.Maybe
12+
13+-- | A set of changes to a 'Map'. Any element may be inserted/updated or
14+-- deleted.
15+newtype PatchMap k v = PatchMap { unPatchMap :: Map k (Maybe v) }
16+
17+instance Ord k => Patch (PatchMap k v) where
18+ type PatchTarget (PatchMap k v) = Map k v
19+ {-# INLINABLE apply #-}
20+ apply (PatchMap p) old = Just $! insertions `Map.union` (old `Map.difference` deletions) --TODO: return Nothing sometimes --Note: the strict application here is critical to ensuring that incremental merges don't hold onto all their prerequisite events forever; can we make this more robust?
21+ where insertions = Map.mapMaybeWithKey (const id) p
22+ deletions = Map.mapMaybeWithKey (const nothingToJust) p
23+ nothingToJust = \case
24+ Nothing -> Just ()
25+ Just _ -> Nothing
26+
27+instance Ord k => Semigroup (PatchMap k v) where
28+ PatchMap a <> PatchMap b = PatchMap $ a `mappend` b --TODO: Add a semigroup instance for Map
29+ -- PatchMap is idempotent, so stimes n is id for every n
30+#if MIN_VERSION_semigroups(0,17,0)
31+ stimes = stimesIdempotentMonoid
32+#else
33+ times1p n x = case compare n 0 of
34+ LT -> error "stimesIdempotentMonoid: negative multiplier"
35+ EQ -> mempty
36+ GT -> x
37+#endif
38+
39+instance Ord k => Monoid (PatchMap k v) where
40+ mempty = PatchMap mempty
41+ mappend = (<>)
42+
43+instance Functor (PatchMap k) where
44+ fmap f = PatchMap . fmap (fmap f) . unPatchMap
45+
46+-- | Returns all the new elements that will be added to the 'Map'
47+patchMapNewElements :: PatchMap k v -> [v]
48+patchMapNewElements (PatchMap p) = catMaybes $ Map.elems p
49+
50+-- | Returns all the new elements that will be added to the 'Map'
51+patchMapNewElementsMap :: PatchMap k v -> Map k v
52+patchMapNewElementsMap (PatchMap p) = Map.mapMaybe id p
src/Reflex/Patch/MapWithMove.hsnew file+159
@@ -0,0 +1,159 @@
1+{-# LANGUAGE DeriveFoldable #-}
2+{-# LANGUAGE DeriveFunctor #-}
3+{-# LANGUAGE DeriveTraversable #-}
4+{-# LANGUAGE FlexibleContexts #-}
5+{-# LANGUAGE LambdaCase #-}
6+{-# LANGUAGE ScopedTypeVariables #-}
7+{-# LANGUAGE TypeFamilies #-}
8+module Reflex.Patch.MapWithMove where
9+
10+import Reflex.Patch.Class
11+
12+import Control.Arrow
13+import Control.Monad.State
14+import Data.Foldable
15+import Data.Function
16+import Data.List
17+import Data.Map (Map)
18+import qualified Data.Map as Map
19+import Data.Maybe
20+import qualified Data.Set as Set
21+import Data.Tuple
22+
23+-- | Patch a DMap with additions, deletions, and moves.
24+-- Invariants:
25+-- * The same source key may not be moved to two destination keys.
26+-- * Any key that is the source of a Move must also be edited
27+-- (otherwise, the Move would duplicate it)
28+newtype PatchMapWithMove k v = PatchMapWithMove (Map k (NodeInfo k v)) deriving (Show, Eq, Ord, Functor, Foldable, Traversable)
29+
30+data NodeInfo k v = NodeInfo
31+ { _nodeInfo_from :: !(From k v)
32+ , _nodeInfo_to :: !(To k)
33+ }
34+ deriving (Show, Read, Eq, Ord, Functor, Foldable, Traversable)
35+
36+unPatchMapWithMove :: PatchMapWithMove k v -> Map k (NodeInfo k v)
37+unPatchMapWithMove (PatchMapWithMove p) = p
38+
39+-- | Warning: when using this function, you must ensure that the invariants of
40+-- 'PatchMapWithMove' are preserved; they will not be checked.
41+unsafePatchMapWithMove :: Map k (NodeInfo k v) -> PatchMapWithMove k v
42+unsafePatchMapWithMove = PatchMapWithMove
43+
44+data From k v
45+ = From_Insert v -- ^ Insert the given value here
46+ | From_Delete -- ^ Delete the existing value, if any, from here
47+ | From_Move !k -- ^ Move the value here from the given key
48+ deriving (Show, Read, Eq, Ord, Functor, Foldable, Traversable)
49+
50+type To = Maybe
51+
52+instance Ord k => Patch (PatchMapWithMove k v) where
53+ type PatchTarget (PatchMapWithMove k v) = Map k v
54+ apply (PatchMapWithMove p) old = Just $! insertions `Map.union` (old `Map.difference` deletions) --TODO: return Nothing sometimes --Note: the strict application here is critical to ensuring that incremental merges don't hold onto all their prerequisite events forever; can we make this more robust?
55+ where insertions = flip Map.mapMaybeWithKey p $ \_ ni -> case _nodeInfo_from ni of
56+ From_Insert v -> Just v
57+ From_Move k -> Map.lookup k old
58+ From_Delete -> Nothing
59+ deletions = flip Map.mapMaybeWithKey p $ \_ ni -> case _nodeInfo_from ni of
60+ From_Delete -> Just ()
61+ _ -> Nothing
62+
63+-- | Returns all the new elements that will be added to the 'Map'
64+patchMapWithMoveNewElements :: PatchMapWithMove k v -> [v]
65+patchMapWithMoveNewElements = Map.elems . patchMapWithMoveNewElementsMap
66+
67+patchMapWithMoveNewElementsMap :: PatchMapWithMove k v -> Map k v
68+patchMapWithMoveNewElementsMap (PatchMapWithMove p) = Map.mapMaybe f p
69+ where f ni = case _nodeInfo_from ni of
70+ From_Insert v -> Just v
71+ From_Move _ -> Nothing
72+ From_Delete -> Nothing
73+
74+validPatchMapWithMove :: Ord k => PatchMapWithMove k v -> Bool
75+validPatchMapWithMove (PatchMapWithMove p) =
76+ let f ni = case _nodeInfo_from ni of
77+ From_Move k -> Just k
78+ _ -> Nothing
79+ moveSources = catMaybes $ f <$> Map.elems p
80+ in and
81+ [ -- All Moves must have unique source keys - a single source key can't be moved to two destinations
82+ all (==1) $ Map.fromListWith (+) $ fmap (\k -> (k, 1 :: Integer )) moveSources
83+ , -- All Move source keys must also be patched - since the value's being moved elsewhere, the original must either be Deleted or replaced (with Insert or Move)
84+ all (isJust . flip Map.lookup p) moveSources
85+ ]
86+
87+knownValidPatchMapWithMove :: [PatchMapWithMove Int Int]
88+knownValidPatchMapWithMove =
89+ [ PatchMapWithMove mempty
90+ , PatchMapWithMove $ Map.fromList
91+ [ (1, NodeInfo (From_Move 2) $ Just 1)
92+ , (2, NodeInfo (From_Move 1) $ Just 2)
93+ ]
94+ ]
95+
96+knownInvalidPatchMapWithMove :: [PatchMapWithMove Int Int]
97+knownInvalidPatchMapWithMove =
98+ [ -- Invalid because we move 2 to 1, but don't specify what to do with 2
99+ PatchMapWithMove $ Map.singleton 1 $ NodeInfo (From_Move 2) Nothing
100+ , -- Invalid because we have multiple moves from 3
101+ PatchMapWithMove $ Map.fromList
102+ [ (1, NodeInfo (From_Move 3) Nothing)
103+ , (2, NodeInfo (From_Move 3) Nothing)
104+ , (3, NodeInfo From_Delete (Just 1))
105+ ]
106+ ]
107+
108+patchThatSortsMapWith :: Ord k => (v -> v -> Ordering) -> Map k v -> PatchMapWithMove k v
109+patchThatSortsMapWith cmp m = PatchMapWithMove $ Map.fromList $ catMaybes $ zipWith g unsorted sorted
110+ where unsorted = Map.toList m
111+ sorted = sortBy (cmp `on` snd) unsorted
112+ f (to, _) (from, _) = if to == from then Nothing else
113+ Just (from, to)
114+ reverseMapping = Map.fromList $ catMaybes $ zipWith f unsorted sorted
115+ g (to, _) (from, _) = if to == from then Nothing else
116+ let Just movingTo = Map.lookup from reverseMapping
117+ in Just (to, NodeInfo (From_Move from) $ Just movingTo)
118+
119+patchThatChangesAndSortsMapWith :: forall k v. (Ord k, Ord v) => (v -> v -> Ordering) -> Map k v -> Map k v -> PatchMapWithMove k v
120+patchThatChangesAndSortsMapWith cmp oldByIndex newByIndexUnsorted = patch
121+ where oldByValue = Map.fromListWith Set.union $ swap . first Set.singleton <$> Map.toList oldByIndex
122+ newList = Map.toList newByIndexUnsorted
123+ newByIndex = Map.fromList $ zip (fst <$> newList) $ sortBy cmp $ snd <$> newList
124+ insertsAndMoves :: Map k (NodeInfo k v)
125+ (insertsAndMoves, unusedValuesByValue) = flip runState oldByValue $ do
126+ let f k v = do
127+ remainingValues <- get
128+ let putRemainingKeys remainingKeys = put $ if Set.null remainingKeys
129+ then Map.delete v remainingValues
130+ else Map.insert v remainingKeys remainingValues
131+ case Map.lookup v remainingValues of
132+ Nothing -> return $ NodeInfo (From_Insert v) $ Just undefined -- There's no existing value we can take
133+ Just fromKs ->
134+ if k `Set.member` fromKs
135+ then do
136+ putRemainingKeys $ Set.delete k fromKs
137+ return $ NodeInfo (From_Move k) $ Just undefined -- There's an existing value, and it's here, so no patch necessary
138+ else do
139+ Just (fromK, remainingKeys) <- return $ Set.minView fromKs -- There's an existing value, but it's not here; move it here
140+ putRemainingKeys remainingKeys
141+ return $ NodeInfo (From_Move fromK) $ Just undefined
142+ Map.traverseWithKey f newByIndex
143+ unusedOldKeys = fold unusedValuesByValue
144+ pointlessMove k = \case
145+ From_Move k' | k == k' -> True
146+ _ -> False
147+ keyWasMoved k = if k `Map.member` oldByIndex && not (k `Set.member` unusedOldKeys)
148+ then Just undefined
149+ else Nothing
150+ patch = unsafePatchMapWithMove $ Map.filterWithKey (\k -> not . pointlessMove k . _nodeInfo_from) $ Map.mergeWithKey (\k a _ -> Just $ nodeInfoSetTo (keyWasMoved k) a) (Map.mapWithKey $ \k -> nodeInfoSetTo $ keyWasMoved k) (Map.mapWithKey $ \k _ -> NodeInfo From_Delete $ keyWasMoved k) insertsAndMoves oldByIndex
151+
152+nodeInfoMapFrom :: (From k v -> From k v) -> NodeInfo k v -> NodeInfo k v
153+nodeInfoMapFrom f ni = ni { _nodeInfo_from = f $ _nodeInfo_from ni }
154+
155+nodeInfoMapMFrom :: Functor f => (From k v -> f (From k v)) -> NodeInfo k v -> f (NodeInfo k v)
156+nodeInfoMapMFrom f ni = fmap (\result -> ni { _nodeInfo_from = result }) $ f $ _nodeInfo_from ni
157+
158+nodeInfoSetTo :: To k -> NodeInfo k v -> NodeInfo k v
159+nodeInfoSetTo to ni = ni { _nodeInfo_to = to }
src/Reflex/PerformEvent/Base.hs+4−9
@@ -25,7 +25,6 @@ module Reflex.PerformEvent.Base
2525 ) where
2626
2727import Reflex.Class
28−import Reflex.Adjustable.Class
2928import Reflex.Host.Class
3029import Reflex.PerformEvent.Class
3130import Reflex.Requester.Base
@@ -41,9 +40,9 @@ import Data.Coerce
4140import Data.Dependent.Map (DMap)
4241import qualified Data.Dependent.Map as DMap
4342import Data.Dependent.Sum
43+import Data.FastMutableIntMap
4444import Data.IntMap.Strict (IntMap)
4545import qualified Data.IntMap.Strict as IntMap
46−import qualified Data.Semigroup as S
4746
4847-- | A function that fires events for the given 'EventTrigger's and then runs
4948-- any followup actions provided via 'PerformEvent'. The given 'ReadPhase'
@@ -61,21 +60,19 @@ deriving instance ReflexHost t => Monad (PerformEventT t m)
6160deriving instance ReflexHost t => MonadFix (PerformEventT t m)
6261deriving instance (ReflexHost t, MonadIO (HostFrame t)) => MonadIO (PerformEventT t m)
6362deriving instance (ReflexHost t, MonadException (HostFrame t)) => MonadException (PerformEventT t m)
64−deriving instance (ReflexHost t, Monoid a) => Monoid (PerformEventT t m a)
65−deriving instance (ReflexHost t, S.Semigroup a) => S.Semigroup (PerformEventT t m a)
6663
6764instance (PrimMonad (HostFrame t), ReflexHost t) => PrimMonad (PerformEventT t m) where
6865 type PrimState (PerformEventT t m) = PrimState (HostFrame t)
6966 primitive = PerformEventT . lift . primitive
7067
71−instance (ReflexHost t, Ref m ~ Ref IO) => PerformEvent t (PerformEventT t m) where
68+instance (ReflexHost t, Ref m ~ Ref IO, PrimMonad (HostFrame t)) => PerformEvent t (PerformEventT t m) where
7269 type Performable (PerformEventT t m) = HostFrame t
7370 {-# INLINABLE performEvent_ #-}
7471 performEvent_ = PerformEventT . requesting_
7572 {-# INLINABLE performEvent #-}
7673 performEvent = PerformEventT . requestingIdentity
7774
78−instance (ReflexHost t, PrimMonad (HostFrame t)) => Adjustable t (PerformEventT t m) where
75+instance (ReflexHost t, PrimMonad (HostFrame t)) => MonadAdjust t (PerformEventT t m) where
7976 runWithReplace outerA0 outerA' = PerformEventT $ runWithReplaceRequesterTWith f (coerce outerA0) (coerceEvent outerA')
8077 where f :: HostFrame t a -> Event t (HostFrame t b) -> RequesterT t (HostFrame t) Identity (HostFrame t) (a, Event t b)
8178 f a0 a' = do
@@ -141,7 +138,7 @@ hostPerformEventT a = do
141138 case mToPerform of
142139 Nothing -> return [result']
143140 Just toPerform -> do
144− responses <- runHostFrame $ traverseRequesterData (fmap Identity) toPerform
141+ responses <- runHostFrame $ traverseRequesterData (\v -> Identity <$> v) toPerform
145142 mrt <- readRef responseTrigger
146143 let followupEventTriggers = case mrt of
147144 Just rt -> [rt :=> Identity responses]
@@ -164,8 +161,6 @@ instance (ReflexHost t, MonadHold t m) => MonadHold t (PerformEventT t m) where
164161 buildDynamic getV0 v' = PerformEventT $ lift $ buildDynamic getV0 v'
165162 {-# INLINABLE headE #-}
166163 headE = PerformEventT . lift . headE
167− {-# INLINABLE now #-}
168− now = PerformEventT . lift $ now
169164
170165instance (MonadRef (HostFrame t), ReflexHost t) => MonadRef (PerformEventT t m) where
171166 type Ref (PerformEventT t m) = Ref (HostFrame t)
src/Reflex/PerformEvent/Class.hs+2−6
@@ -5,9 +5,11 @@
55{-# LANGUAGE FlexibleContexts #-}
66{-# LANGUAGE FlexibleInstances #-}
77{-# LANGUAGE FunctionalDependencies #-}
8+{-# LANGUAGE MultiParamTypeClasses #-}
89{-# LANGUAGE RankNTypes #-}
910{-# LANGUAGE ScopedTypeVariables #-}
1011{-# LANGUAGE TypeFamilies #-}
12+{-# LANGUAGE TypeOperators #-}
1113{-# LANGUAGE UndecidableInstances #-}
1214#ifdef USE_REFLEX_OPTIMIZER
1315{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
@@ -21,7 +23,6 @@ import Reflex.Class
2123import Reflex.TriggerEvent.Class
2224
2325import Control.Monad.Reader
24−import Control.Monad.Trans.Maybe (MaybeT (..))
2526
2627-- | 'PerformEvent' represents actions that can trigger other actions based on
2728-- 'Event's.
@@ -61,8 +62,3 @@ instance PerformEvent t m => PerformEvent t (ReaderT r m) where
6162 performEvent e = do
6263 r <- ask
6364 lift $ performEvent $ flip runReaderT r <$> e
64−
65−instance PerformEvent t m => PerformEvent t (MaybeT m) where
66− type Performable (MaybeT m) = MaybeT (Performable m)
67− performEvent_ = lift . performEvent_ . fmapCheap (void . runMaybeT)
68− performEvent = lift . fmap (fmapMaybe id) . performEvent . fmapCheap runMaybeT
src/Reflex/PostBuild/Base.hs+3−15
@@ -9,6 +9,7 @@
99{-# LANGUAGE RecursiveDo #-}
1010{-# LANGUAGE ScopedTypeVariables #-}
1111{-# LANGUAGE TypeFamilies #-}
12+{-# LANGUAGE TypeOperators #-}
1213{-# LANGUAGE UndecidableInstances #-}
1314#ifdef USE_REFLEX_OPTIMIZER
1415{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
@@ -22,13 +23,11 @@ module Reflex.PostBuild.Base
2223 ) where
2324
2425import Reflex.Class
25−import Reflex.Adjustable.Class
2626import Reflex.Host.Class
2727import Reflex.PerformEvent.Class
2828import Reflex.PostBuild.Class
2929import Reflex.TriggerEvent.Class
3030
31−import Control.Applicative (liftA2)
3231import Control.Monad.Exception
3332import Control.Monad.Identity
3433import Control.Monad.Primitive
@@ -40,7 +39,6 @@ import qualified Data.Dependent.Map as DMap
4039import Data.Functor.Compose
4140import Data.IntMap.Strict (IntMap)
4241import qualified Data.IntMap.Strict as IntMap
43−import qualified Data.Semigroup as S
4442
4543-- | Provides a basic implementation of 'PostBuild'.
4644newtype PostBuildT t m a = PostBuildT { unPostBuildT :: ReaderT (Event t ()) m a } deriving (Functor, Applicative, Monad, MonadFix, MonadIO, MonadTrans, MonadException, MonadAsyncException)
@@ -52,14 +50,6 @@ newtype PostBuildT t m a = PostBuildT { unPostBuildT :: ReaderT (Event t ()) m a
5250runPostBuildT :: PostBuildT t m a -> Event t () -> m a
5351runPostBuildT (PostBuildT a) = runReaderT a
5452
55−-- TODO: Monoid and Semigroup can likely be derived once ReaderT has them.
56−instance (Monoid a, Applicative m) => Monoid (PostBuildT t m a) where
57− mempty = pure mempty
58− mappend = liftA2 mappend
59−
60−instance (S.Semigroup a, Applicative m) => S.Semigroup (PostBuildT t m a) where
61− (<>) = liftA2 (S.<>)
62−
6353instance PrimMonad m => PrimMonad (PostBuildT x m) where
6454 type PrimState (PostBuildT x m) = PrimState m
6555 primitive = lift . primitive
@@ -83,8 +73,6 @@ instance MonadHold t m => MonadHold t (PostBuildT t m) where
8373 buildDynamic a0 = lift . buildDynamic a0
8474 {-# INLINABLE headE #-}
8575 headE = lift . headE
86− {-# INLINABLE now #-}
87− now = lift now
8876
8977instance PerformEvent t m => PerformEvent t (PostBuildT t m) where
9078 type Performable (PostBuildT t m) = Performable m
@@ -119,7 +107,7 @@ instance MonadAtomicRef m => MonadAtomicRef (PostBuildT t m) where
119107 {-# INLINABLE atomicModifyRef #-}
120108 atomicModifyRef r = lift . atomicModifyRef r
121109
122−instance (Reflex t, MonadHold t m, MonadFix m, Adjustable t m, PerformEvent t m) => Adjustable t (PostBuildT t m) where
110+instance (Reflex t, MonadHold t m, MonadFix m, MonadAdjust t m, PerformEvent t m) => MonadAdjust t (PostBuildT t m) where
123111 runWithReplace a0 a' = do
124112 postBuild <- getPostBuild
125113 lift $ do
@@ -153,7 +141,7 @@ mapIntMapWithAdjustImpl base f dm0 dm' = do
153141 rec (result0, result') <- base f' loweredDm0 loweredDm'
154142 cohortDone <- numberOccurrencesFrom_ 1 result'
155143 numberedDm' <- numberOccurrencesFrom 1 dm'
156− let postBuild' = fanInt $ fmapCheap (`IntMap.singleton` ()) cohortDone
144+ let postBuild' = fanInt $ fmapCheap (\n -> IntMap.singleton n ()) cohortDone
157145 loweredDm' = flip pushAlways numberedDm' $ \(n, p) -> do
158146 return $ fmap ((,) (selectInt postBuild' n)) p
159147 return (result0, result')
src/Reflex/PostBuild/Class.hs+2
@@ -4,8 +4,10 @@
44{-# LANGUAGE DataKinds #-}
55{-# LANGUAGE FlexibleInstances #-}
66{-# LANGUAGE FunctionalDependencies #-}
7+{-# LANGUAGE MultiParamTypeClasses #-}
78{-# LANGUAGE ScopedTypeVariables #-}
89{-# LANGUAGE TypeFamilies #-}
10+{-# LANGUAGE TypeOperators #-}
911{-# LANGUAGE UndecidableInstances #-}
1012#ifdef USE_REFLEX_OPTIMIZER
1113{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
src/Reflex/Profiled.hs+23−99
@@ -1,5 +1,4 @@
11{-# LANGUAGE EmptyDataDecls #-}
2−{-# LANGUAGE FlexibleContexts #-}
32{-# LANGUAGE FlexibleInstances #-}
43{-# LANGUAGE GeneralizedNewtypeDeriving #-}
54{-# LANGUAGE InstanceSigs #-}
@@ -8,56 +7,35 @@
87{-# LANGUAGE StandaloneDeriving #-}
98{-# LANGUAGE TypeFamilies #-}
109{-# LANGUAGE UndecidableInstances #-}
11−{-# LANGUAGE PolyKinds #-}
12−{-# LANGUAGE TypeApplications #-}
13−{-# LANGUAGE RankNTypes #-}
14−-- |
15−-- Module:
16−-- Reflex.Profiled
17−-- Description:
18−-- This module contains an instance of the 'Reflex' class that provides
19−-- profiling/cost-center information.
2010module Reflex.Profiled where
2111
12+import Control.Lens hiding (children)
2213import Control.Monad
23−import Control.Monad.Exception
2414import Control.Monad.Fix
2515import Control.Monad.Primitive
2616import Control.Monad.Reader
2717import Control.Monad.Ref
2818import Control.Monad.State.Strict (StateT, execStateT, modify)
29−import Data.Bifunctor
3019import Data.Coerce
31−import Data.Dependent.Map (DMap)
32−import Data.GADT.Compare (GCompare)
20+import Data.Dependent.Map (DMap, GCompare)
21+import Data.List
3322import Data.FastMutableIntMap
3423import Data.IORef
35−import Data.List
3624import Data.Map (Map)
3725import qualified Data.Map.Strict as Map
38−import Data.Monoid ((<>))
26+import Data.Monoid
3927import Data.Ord
40−import Data.Profunctor.Unsafe ((#.))
41−import qualified Data.Semigroup as S
4228import Data.Type.Coercion
4329import Foreign.Ptr
4430import GHC.Foreign
4531import GHC.IO.Encoding
4632import GHC.Stack
47−import Reflex.Adjustable.Class
48−import Reflex.BehaviorWriter.Class
4933import Reflex.Class
50−import Reflex.DynamicWriter.Class
51−import Reflex.EventWriter.Class
52−import Reflex.Host.Class
53−import Reflex.NotReady.Class
5434import Reflex.PerformEvent.Class
55−import Reflex.PostBuild.Class
56−import Reflex.Query.Class
57−import Reflex.Requester.Class
58−import Reflex.TriggerEvent.Class
35+import Reflex.Host.Class
5936
6037import System.IO.Unsafe
38+import Unsafe.Coerce
6139
6240data ProfiledTimeline t
6341
@@ -72,13 +50,9 @@ data CostCentreTree = CostCentreTree
7250 }
7351 deriving (Show, Eq, Ord)
7452
75−instance S.Semigroup CostCentreTree where
76− (CostCentreTree oa ea ca) <> (CostCentreTree ob eb cb) =
77− CostCentreTree (oa + ob) (ea + eb) $ Map.unionWith (S.<>) ca cb
78−
7953instance Monoid CostCentreTree where
8054 mempty = CostCentreTree 0 0 mempty
81− mappend = (S.<>)
55+ CostCentreTree oa ea ca `mappend` CostCentreTree ob eb cb = CostCentreTree (oa + ob) (ea + eb) $ Map.unionWith (<>) ca cb
8256
8357getCostCentreStack :: Ptr CostCentreStack -> IO [Ptr CostCentre]
8458getCostCentreStack = go []
@@ -90,9 +64,9 @@ getCostCentreStack = go []
9064 go (cc : l) parent
9165
9266toCostCentreTree :: Ptr CostCentreStack -> Int -> IO CostCentreTree
93−toCostCentreTree ccs n =
94− foldr (\cc child -> CostCentreTree 0 n $ Map.singleton cc child) (CostCentreTree n n mempty)
95− <$> getCostCentreStack ccs
67+toCostCentreTree ccs n = do
68+ ccList <- getCostCentreStack ccs
69+ return $ foldr (\cc child -> CostCentreTree 0 n $ Map.singleton cc child) (CostCentreTree n n mempty) ccList
9670
9771getCostCentreTree :: IO CostCentreTree
9872getCostCentreTree = do
@@ -121,8 +95,7 @@ writeProfilingData :: FilePath -> IO ()
12195writeProfilingData p = do
12296 writeFile p =<< formatCostCentreTree =<< getCostCentreTree
12397
124−newtype ProfiledM m a = ProfiledM { runProfiledM :: m a }
125− deriving (Functor, Applicative, Monad, MonadFix, MonadException, MonadAsyncException)
98+newtype ProfiledM m a = ProfiledM { runProfiledM :: m a } deriving (Functor, Applicative, Monad, MonadFix)
12699
127100profileEvent :: Reflex t => Event t a -> Event t a
128101profileEvent e = unsafePerformIO $ do
@@ -146,32 +119,27 @@ instance Reflex t => Reflex (ProfiledTimeline t) where
146119 push f (Event_Profiled e) = coerce $ push (coerce f) $ profileEvent e -- Profile before rather than after; this way fanout won't count against us
147120 pushCheap f (Event_Profiled e) = coerce $ pushCheap (coerce f) $ profileEvent e
148121 pull = Behavior_Profiled . pull . coerce
149− fanG (Event_Profiled e) = EventSelectorG $ coerce $ selectG (fanG $ profileEvent e)
150− mergeG :: forall z (k :: z -> *) q v. GCompare k
151− => (forall a. q a -> Event (ProfiledTimeline t) (v a))
152− -> DMap k q -> Event (ProfiledTimeline t) (DMap k v)
153− mergeG nt = Event_Profiled #. mergeG (coerce nt)
122+ merge :: forall k. GCompare k => DMap k (Event (ProfiledTimeline t)) -> Event (ProfiledTimeline t) (DMap k Identity)
123+ merge = Event_Profiled . merge . (unsafeCoerce :: DMap k (Event (ProfiledTimeline t)) -> DMap k (Event t))
124+ fan (Event_Profiled e) = EventSelector $ coerce $ select (fan $ profileEvent e)
154125 switch (Behavior_Profiled b) = coerce $ profileEvent $ switch (coerceBehavior b)
155126 coincidence (Event_Profiled e) = coerce $ profileEvent $ coincidence (coerceEvent e)
156127 current (Dynamic_Profiled d) = coerce $ current d
157128 updated (Dynamic_Profiled d) = coerce $ profileEvent $ updated d
158129 unsafeBuildDynamic (ProfiledM a0) (Event_Profiled a') = coerce $ unsafeBuildDynamic a0 a'
159130 unsafeBuildIncremental (ProfiledM a0) (Event_Profiled a') = coerce $ unsafeBuildIncremental a0 a'
160− mergeIncrementalG nt res = Event_Profiled $ mergeIncrementalG (coerce nt) (coerce res)
161− mergeIncrementalWithMoveG nt res = Event_Profiled $ mergeIncrementalWithMoveG (coerce nt) (coerce res)
131+ mergeIncremental = Event_Profiled . mergeIncremental . (unsafeCoerce :: Incremental (ProfiledTimeline t) (PatchDMap k (Event (ProfiledTimeline t))) -> Incremental t (PatchDMap k (Event t)))
132+ mergeIncrementalWithMove = Event_Profiled . mergeIncrementalWithMove . (unsafeCoerce :: Incremental (ProfiledTimeline t) (PatchDMapWithMove k (Event (ProfiledTimeline t))) -> Incremental t (PatchDMapWithMove k (Event t)))
162133 currentIncremental (Incremental_Profiled i) = coerce $ currentIncremental i
163134 updatedIncremental (Incremental_Profiled i) = coerce $ profileEvent $ updatedIncremental i
164135 incrementalToDynamic (Incremental_Profiled i) = coerce $ incrementalToDynamic i
165− behaviorCoercion c =
166− Coercion `trans` behaviorCoercion @t c `trans` Coercion
167− eventCoercion c =
168− Coercion `trans` eventCoercion @t c `trans` Coercion
169− dynamicCoercion c =
170− Coercion `trans` dynamicCoercion @t c `trans` Coercion
171− incrementalCoercion c d =
172− Coercion `trans` incrementalCoercion @t c d `trans` Coercion
173− mergeIntIncremental = Event_Profiled . mergeIntIncremental .
174− coerceWith (Coercion `trans` incrementalCoercion Coercion Coercion `trans` Coercion)
136+ behaviorCoercion (c :: Coercion a b) = case behaviorCoercion c :: Coercion (Behavior t a) (Behavior t b) of
137+ Coercion -> unsafeCoerce (Coercion :: Coercion (Behavior (ProfiledTimeline t) a) (Behavior (ProfiledTimeline t) a)) --TODO: Figure out how to make this typecheck without the unsafeCoerce
138+ eventCoercion (c :: Coercion a b) = case eventCoercion c :: Coercion (Event t a) (Event t b) of
139+ Coercion -> unsafeCoerce (Coercion :: Coercion (Event (ProfiledTimeline t) a) (Event (ProfiledTimeline t) a)) --TODO: Figure out how to make this typecheck without the unsafeCoerce
140+ dynamicCoercion (c :: Coercion a b) = case dynamicCoercion c :: Coercion (Dynamic t a) (Dynamic t b) of
141+ Coercion -> unsafeCoerce (Coercion :: Coercion (Dynamic (ProfiledTimeline t) a) (Dynamic (ProfiledTimeline t) a)) --TODO: Figure out how to make this typecheck without the unsafeCoerce
142+ mergeIntIncremental = Event_Profiled . mergeIntIncremental . (unsafeCoerce :: Incremental (ProfiledTimeline t) (PatchIntMap (Event (ProfiledTimeline t) a)) -> Incremental t (PatchIntMap (Event t a)))
175143 fanInt (Event_Profiled e) = coerce $ fanInt $ profileEvent e
176144
177145deriving instance Functor (Dynamic t) => Functor (Dynamic (ProfiledTimeline t))
@@ -184,21 +152,10 @@ instance MonadHold t m => MonadHold (ProfiledTimeline t) (ProfiledM m) where
184152 holdIncremental v0 (Event_Profiled v') = ProfiledM $ Incremental_Profiled <$> holdIncremental v0 v'
185153 buildDynamic (ProfiledM v0) (Event_Profiled v') = ProfiledM $ Dynamic_Profiled <$> buildDynamic v0 v'
186154 headE (Event_Profiled e) = ProfiledM $ Event_Profiled <$> headE e
187− now = ProfiledM $ Event_Profiled <$> now
188155
189156instance MonadSample t m => MonadSample (ProfiledTimeline t) (ProfiledM m) where
190157 sample (Behavior_Profiled b) = ProfiledM $ sample b
191158
192−instance Adjustable t m => Adjustable (ProfiledTimeline t) (ProfiledM m) where
193− runWithReplace a0 a' = (fmap . fmap) coerce . lift $
194− runWithReplace (coerce a0) (coerce $ coerce <$> a')
195− traverseIntMapWithKeyWithAdjust f dm0 dm' = (fmap . fmap) coerce . lift $
196− traverseIntMapWithKeyWithAdjust (\k v -> coerce $ f k v) dm0 (coerce dm')
197− traverseDMapWithKeyWithAdjust f dm0 dm' = (fmap . fmap) coerce . lift $
198− traverseDMapWithKeyWithAdjust (\k v -> coerce $ f k v) dm0 (coerce dm')
199− traverseDMapWithKeyWithAdjustWithMove f dm0 dm' = (fmap . fmap) coerce . lift $
200− traverseDMapWithKeyWithAdjustWithMove (\k v -> coerce $ f k v) dm0 (coerce dm')
201−
202159instance MonadTrans ProfiledM where
203160 lift = ProfiledM
204161
@@ -210,39 +167,6 @@ instance PerformEvent t m => PerformEvent (ProfiledTimeline t) (ProfiledM m) whe
210167 performEvent_ = lift . performEvent_ . coerce
211168 performEvent = lift . fmap coerce . performEvent . coerce
212169
213−instance TriggerEvent t m => TriggerEvent (ProfiledTimeline t) (ProfiledM m) where
214− newTriggerEvent = first coerce <$> lift newTriggerEvent
215− newTriggerEventWithOnComplete = first coerce <$> lift newTriggerEventWithOnComplete
216− newEventWithLazyTriggerWithOnComplete f = coerce <$> lift (newEventWithLazyTriggerWithOnComplete f)
217−
218−instance PostBuild t m => PostBuild (ProfiledTimeline t) (ProfiledM m) where
219− getPostBuild = coerce <$> lift getPostBuild
220−
221−instance NotReady t m => NotReady (ProfiledTimeline t) (ProfiledM m) where
222− notReady = lift notReady
223− notReadyUntil = lift . notReadyUntil . coerce
224−
225−instance BehaviorWriter t w m => BehaviorWriter (ProfiledTimeline t) w (ProfiledM m) where
226− tellBehavior = lift . tellBehavior . coerce
227−
228−instance DynamicWriter t w m => DynamicWriter (ProfiledTimeline t) w (ProfiledM m) where
229− tellDyn = lift . tellDyn . coerce
230−
231−instance EventWriter t w m => EventWriter (ProfiledTimeline t) w (ProfiledM m) where
232− tellEvent = lift . tellEvent . coerce
233−
234−instance MonadQuery t q m => MonadQuery (ProfiledTimeline t) q (ProfiledM m) where
235− tellQueryIncremental = lift . tellQueryIncremental . coerce
236− askQueryResult = coerce <$> lift askQueryResult
237− queryIncremental = fmap coerce . lift . queryIncremental . coerce
238−
239−instance Requester t m => Requester (ProfiledTimeline t) (ProfiledM m) where
240− type Request (ProfiledM m) = Request m
241− type Response (ProfiledM m) = Response m
242−
243− requesting = fmap coerce . lift . requesting . coerce
244− requesting_ = lift . requesting_ . coerce
245−
246170instance MonadRef m => MonadRef (ProfiledM m) where
247171 type Ref (ProfiledM m) = Ref m
248172 newRef = lift . newRef
src/Reflex/Pure.hs+27−38
@@ -5,9 +5,6 @@
55{-# LANGUAGE MultiParamTypeClasses #-}
66{-# LANGUAGE ScopedTypeVariables #-}
77{-# LANGUAGE TypeFamilies #-}
8−{-# LANGUAGE RankNTypes #-}
9−{-# LANGUAGE PolyKinds #-}
10−
118#ifdef USE_REFLEX_OPTIMIZER
129{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
1310#endif
@@ -16,13 +13,11 @@
1613-- * MonadSample (Pure t) ((->) t)
1714-- * MonadHold (Pure t) ((->) t)
1815{-# OPTIONS_GHC -fno-warn-orphans #-}
19−-- |
20−-- Module: Reflex.Pure
21−-- Description:
22−-- This module provides a pure implementation of Reflex, which is intended to
23−-- serve as a reference for the semantics of the Reflex class. All
24−-- implementations of Reflex should produce the same results as this
25−-- implementation, although performance and laziness/strictness may differ.
16+
17+-- | This module provides a pure implementation of Reflex, which is intended to
18+-- serve as a reference for the semantics of the Reflex class. All
19+-- implementations of Reflex should produce the same results as this
20+-- implementation, although performance and laziness/strictness may differ.
2621module Reflex.Pure
2722 ( Pure
2823 , Behavior (..)
@@ -31,10 +26,14 @@ module Reflex.Pure
3126 , Incremental (..)
3227 ) where
3328
29+#if !MIN_VERSION_base(4,8,0)
30+import Control.Applicative
31+#endif
32+
3433import Control.Monad
35−import Data.Dependent.Map (DMap)
36−import Data.GADT.Compare (GCompare)
34+import Data.Dependent.Map (DMap, GCompare)
3735import qualified Data.Dependent.Map as DMap
36+import Data.Functor.Identity
3837import Data.IntMap (IntMap)
3938import qualified Data.IntMap as IntMap
4039import Data.Maybe
@@ -42,15 +41,14 @@ import Data.MemoTrie
4241import Data.Monoid
4342import Data.Type.Coercion
4443import Reflex.Class
45−import Data.Kind (Type)
4644
4745-- | A completely pure-functional 'Reflex' timeline, identifying moments in time
48−-- with the type @/t/@.
49−data Pure (t :: Type)
46+-- with the type @t@.
47+data Pure t
5048
51−-- | The 'Enum' instance of @/t/@ must be dense: for all @/x :: t/@, there must not exist
52−-- any @/y :: t/@ such that @/'pred' x < y < x/@. The 'HasTrie' instance will be used
53−-- exclusively to memoize functions of @/t/@, not for any of its other capabilities.
49+-- | The Enum instance of t must be dense: for all x :: t, there must not exist
50+-- any y :: t such that pred x < y < x. The HasTrie instance will be used
51+-- exclusively to memoize functions of t, not for any of its other capabilities.
5452instance (Enum t, HasTrie t, Ord t) => Reflex (Pure t) where
5553
5654 newtype Behavior (Pure t) a = Behavior { unBehavior :: t -> a }
@@ -79,19 +77,17 @@ instance (Enum t, HasTrie t, Ord t) => Reflex (Pure t) where
7977 -- [UNUSED_CONSTRAINT]: The following type signature for merge will produce a
8078 -- warning because the GCompare instance is not used; however, removing the
8179 -- GCompare instance produces a different warning, due to that constraint
82− -- being present in the original class definition.
80+ -- being present in the original class definition
8381
84− --mergeG :: GCompare k => (forall a. q a -> Event (Pure t) (v a))
85− -- -> DMap k q -> Event (Pure t) (DMap k v)
86− mergeG nt events = Event $ memo $ \t ->
87− let currentOccurrences = DMap.mapMaybeWithKey (\_ q -> case nt q of Event a -> a t) events
82+ --merge :: GCompare k => DMap k (Event (Pure t)) -> Event (Pure t) (DMap k Identity)
83+ merge events = Event $ memo $ \t ->
84+ let currentOccurrences = DMap.mapMaybeWithKey (\_ (Event a) -> Identity <$> a t) events
8885 in if DMap.null currentOccurrences
8986 then Nothing
9087 else Just currentOccurrences
9188
92−-- The instance signature doeesn't compile, leave commented for documentation
93−-- fanG :: GCompare k => Event (Pure t) (DMap k v) -> EventSelectorG (Pure t) k v
94− fanG e = EventSelectorG $ \k -> Event $ \t -> unEvent e t >>= DMap.lookup k
89+ fan :: GCompare k => Event (Pure t) (DMap k Identity) -> EventSelector (Pure t) k
90+ fan e = EventSelector $ \k -> Event $ \t -> unEvent e t >>= fmap runIdentity . DMap.lookup k
9591
9692 switch :: Behavior (Pure t) (Event (Pure t) a) -> Event (Pure t) a
9793 switch b = Event $ memo $ \t -> unEvent (unBehavior b t) t
@@ -114,8 +110,8 @@ instance (Enum t, HasTrie t, Ord t) => Reflex (Pure t) where
114110 --a) -> Incremental (Pure t) p a
115111 unsafeBuildIncremental readV0 p = Incremental $ \t -> (readV0 t, unEvent p t)
116112
117− mergeIncrementalG = mergeIncrementalImpl
118− mergeIncrementalWithMoveG = mergeIncrementalImpl
113+ mergeIncremental = mergeIncrementalImpl
114+ mergeIncrementalWithMove = mergeIncrementalImpl
119115
120116 currentIncremental i = Behavior $ \t -> fst $ unIncremental i t
121117
@@ -130,17 +126,14 @@ instance (Enum t, HasTrie t, Ord t) => Reflex (Pure t) where
130126 behaviorCoercion Coercion = Coercion
131127 eventCoercion Coercion = Coercion
132128 dynamicCoercion Coercion = Coercion
133− incrementalCoercion Coercion Coercion = Coercion
134129
135130 fanInt e = EventSelectorInt $ \k -> Event $ \t -> unEvent e t >>= IntMap.lookup k
136131
137132 mergeIntIncremental = mergeIntIncrementalImpl
138133
139−mergeIncrementalImpl :: (PatchTarget p ~ DMap k q, GCompare k)
140− => (forall a. q a -> Event (Pure t) (v a))
141− -> Incremental (Pure t) p -> Event (Pure t) (DMap k v)
142−mergeIncrementalImpl nt i = Event $ \t ->
143− let results = DMap.mapMaybeWithKey (\_ q -> case nt q of Event e -> e t) $ fst $ unIncremental i t
134+mergeIncrementalImpl :: (PatchTarget p ~ DMap k (Event (Pure t)), GCompare k) => Incremental (Pure t) p -> Event (Pure t) (DMap k Identity)
135+mergeIncrementalImpl i = Event $ \t ->
136+ let results = DMap.mapMaybeWithKey (\_ (Event e) -> Identity <$> e t) $ fst $ unIncremental i t
144137 in if DMap.null results
145138 then Nothing
146139 else Just results
@@ -211,7 +204,3 @@ instance (Enum t, HasTrie t, Ord t) => MonadHold (Pure t) ((->) t) where
211204 Just x -> fromMaybe lastValue $ apply x lastValue
212205
213206 headE = slowHeadE
214− now t = Event $ guard . (t ==)
215−
216−
217−
src/Reflex/Query/Base.hs+51−122
@@ -1,14 +1,12 @@
11{-# LANGUAGE FlexibleInstances #-}
22{-# LANGUAGE GeneralizedNewtypeDeriving #-}
33{-# LANGUAGE InstanceSigs #-}
4−{-# LANGUAGE LambdaCase #-}
4+{-# LANGUAGE KindSignatures #-}
55{-# LANGUAGE MultiParamTypeClasses #-}
66{-# LANGUAGE RankNTypes #-}
77{-# LANGUAGE ScopedTypeVariables #-}
88{-# LANGUAGE TypeFamilies #-}
99{-# LANGUAGE UndecidableInstances #-}
10−{-# LANGUAGE StandaloneDeriving #-}
11−
1210module Reflex.Query.Base
1311 ( QueryT (..)
1412 , runQueryT
@@ -16,52 +14,38 @@ module Reflex.Query.Base
1614 , mapQueryResult
1715 , dynWithQueryT
1816 , withQueryT
19− , mapQueryT
2017 ) where
2118
22−import Control.Applicative (liftA2)
2319import Control.Monad.Exception
2420import Control.Monad.Fix
25−import Control.Monad.Morph
26−import Control.Monad.Primitive
2721import Control.Monad.Reader
2822import Control.Monad.Ref
2923import Control.Monad.State.Strict
3024import Data.Align
31−import Data.Dependent.Map (DMap)
25+import Data.Dependent.Map (DMap, DSum (..))
3226import qualified Data.Dependent.Map as DMap
33−import Data.Dependent.Sum (DSum(..))
3427import Data.Foldable
3528import Data.Functor.Compose
3629import Data.Functor.Misc
37−import Data.GADT.Compare (GCompare)
38−import Data.IntMap (IntMap)
39−import qualified Data.IntMap as IntMap
4030import Data.Map (Map)
4131import qualified Data.Map as Map
42−import Data.Monoid ((<>))
43−import qualified Data.Semigroup as S
44−import Data.Some (Some(Some))
32+import Data.Monoid
33+import Data.Some (Some)
34+import qualified Data.Some as Some
4535import Data.These
4636
4737import Reflex.Class
48−import Reflex.Adjustable.Class
49−import Reflex.DynamicWriter.Class
50−import Reflex.EventWriter.Base
51−import Reflex.EventWriter.Class
38+import Reflex.EventWriter
5239import Reflex.Host.Class
53−import qualified Data.Patch.MapWithMove as MapWithMove
5440import Reflex.PerformEvent.Class
5541import Reflex.PostBuild.Class
5642import Reflex.Query.Class
5743import Reflex.Requester.Class
5844import Reflex.TriggerEvent.Class
45+import qualified Reflex.Patch.MapWithMove as MapWithMove
5946
6047newtype QueryT t q m a = QueryT { unQueryT :: StateT [Behavior t q] (EventWriterT t q (ReaderT (Dynamic t (QueryResult q)) m)) a }
61− deriving (Functor, Applicative, Monad, MonadException, MonadFix, MonadIO, MonadAtomicRef)
62−
63−deriving instance MonadHold t m => MonadHold t (QueryT t q m)
64−deriving instance MonadSample t m => MonadSample t (QueryT t q m)
48+ deriving (Functor, Applicative, Monad, MonadException, MonadFix, MonadIO, MonadHold t, MonadSample t, MonadAtomicRef)
6549
6650runQueryT :: (MonadFix m, Additive q, Group q, Reflex t) => QueryT t q m a -> Dynamic t (QueryResult q) -> m (a, Incremental t (AdditivePatch q))
6751runQueryT (QueryT a) qr = do
@@ -76,69 +60,30 @@ getQueryTLoweredResultValue (QueryTLoweredResult (v, _)) = v
7660getQueryTLoweredResultWritten :: QueryTLoweredResult t q v -> [Behavior t q]
7761getQueryTLoweredResultWritten (QueryTLoweredResult (_, w)) = w
7862
79−maskMempty :: (Eq a, Monoid a) => a -> Maybe a
80−maskMempty x = if x == mempty then Nothing else Just x
81−
82−instance (Reflex t, MonadFix m, Group q, Additive q, Query q, Eq q, MonadHold t m, Adjustable t m) => Adjustable t (QueryT t q m) where
63+{-
64+let sampleBs :: forall m'. MonadSample t m' => [Behavior t q] -> m' q
65+ sampleBs = foldlM (\b a -> (b <>) <$> sample a) mempty
66+ bs' = fmapCheap snd $ r'
67+ patches = unsafeBuildIncremental (sampleBs bs0) $
68+ flip pushCheap bs' $ \bs -> do
69+ p <- (~~) <$> sampleBs bs <*> sample (currentIncremental patches)
70+ return (Just (AdditivePatch p))
71+-}
72+
73+instance (Reflex t, MonadFix m, Group q, Additive q, Query q, MonadHold t m, MonadAdjust t m) => MonadAdjust t (QueryT t q m) where
8374 runWithReplace (QueryT a0) a' = do
8475 ((r0, bs0), r') <- QueryT $ lift $ runWithReplace (runStateT a0 []) $ fmapCheap (flip runStateT [] . unQueryT) a'
8576 let sampleBs :: forall m'. MonadSample t m' => [Behavior t q] -> m' q
8677 sampleBs = foldlM (\b a -> (b <>) <$> sample a) mempty
8778 bs' = fmapCheap snd $ r'
8879 bbs <- hold bs0 bs'
89− let patches = flip pushCheap bs' $ \newBs -> do
80+ let patches = flip pushAlwaysCheap bs' $ \newBs -> do
9081 oldBs <- sample bbs
91− maskMempty <$> ((~~) <$> sampleBs newBs <*> sampleBs oldBs)
82+ (~~) <$> sampleBs newBs <*> sampleBs oldBs
9283 QueryT $ modify $ (:) $ pull $ sampleBs =<< sample bbs
9384 QueryT $ lift $ tellEvent patches
9485 return (r0, fmapCheap fst r')
95−
96− traverseIntMapWithKeyWithAdjust :: forall v v'. (IntMap.Key -> v -> QueryT t q m v') -> IntMap v -> Event t (PatchIntMap v) -> QueryT t q m (IntMap v', Event t (PatchIntMap v'))
97− traverseIntMapWithKeyWithAdjust f im0 im' = do
98− let f' :: IntMap.Key -> v -> EventWriterT t q (ReaderT (Dynamic t (QueryResult q)) m) (QueryTLoweredResult t q v')
99− f' k v = fmap QueryTLoweredResult $ flip runStateT [] $ unQueryT $ f k v
100− (result0, result') <- QueryT $ lift $ traverseIntMapWithKeyWithAdjust f' im0 im'
101− let liftedResult0 = IntMap.map getQueryTLoweredResultValue result0
102− liftedResult' = fforCheap result' $ \(PatchIntMap p) -> PatchIntMap $
103− IntMap.map (fmap getQueryTLoweredResultValue) p
104− liftedBs0 :: IntMap [Behavior t q]
105− liftedBs0 = IntMap.map getQueryTLoweredResultWritten result0
106− liftedBs' :: Event t (PatchIntMap [Behavior t q])
107− liftedBs' = fforCheap result' $ \(PatchIntMap p) -> PatchIntMap $
108− IntMap.map (fmap getQueryTLoweredResultWritten) p
109− sampleBs :: forall m'. MonadSample t m' => [Behavior t q] -> m' q
110− sampleBs = foldlM (\b a -> (b <>) <$> sample a) mempty
111− accumBehaviors :: forall m'. MonadHold t m'
112− => IntMap [Behavior t q]
113− -> PatchIntMap [Behavior t q]
114− -> m' ( Maybe (IntMap [Behavior t q])
115− , Maybe (AdditivePatch q))
116− -- f accumulates the child behavior state we receive from running traverseIntMapWithKeyWithAdjust for the underlying monad.
117− -- When an update occurs, it also computes a patch to communicate to the parent QueryT state.
118− -- bs0 is a Map denoting the behaviors of the current children.
119− -- pbs is a PatchMap denoting an update to the behaviors of the current children
120− accumBehaviors bs0 pbs@(PatchIntMap bs') = do
121− let p k bs = case IntMap.lookup k bs0 of
122− Nothing -> case bs of
123− -- If the update is to delete the state for a child that doesn't exist, the patch is mempty.
124− Nothing -> return mempty
125− -- If the update is to update the state for a child that doesn't exist, the patch is the sample of the new state.
126− Just newBs -> sampleBs newBs
127− Just oldBs -> case bs of
128− -- If the update is to delete the state for a child that already exists, the patch is the negation of the child's current state
129− Nothing -> negateG <$> sampleBs oldBs
130− -- If the update is to update the state for a child that already exists, the patch is the negation of sampling the child's current state
131− -- composed with the sampling the child's new state.
132− Just newBs -> (~~) <$> sampleBs newBs <*> sampleBs oldBs
133− -- we compute the patch by iterating over the update PatchMap and proceeding by cases. Then we fold over the
134− -- child patches and wrap them in AdditivePatch.
135− patch <- AdditivePatch . fold <$> IntMap.traverseWithKey p bs'
136− return (apply pbs bs0, Just patch)
137− (qpatch :: Event t (AdditivePatch q)) <- mapAccumMaybeM_ accumBehaviors liftedBs0 liftedBs'
138− tellQueryIncremental $ unsafeBuildIncremental (fold <$> mapM sampleBs liftedBs0) qpatch
139− return (liftedResult0, liftedResult')
140−
141− traverseDMapWithKeyWithAdjust :: forall (k :: * -> *) v v'. (GCompare k) => (forall a. k a -> v a -> QueryT t q m (v' a)) -> DMap k v -> Event t (PatchDMap k v) -> QueryT t q m (DMap k v', Event t (PatchDMap k v'))
86+ traverseDMapWithKeyWithAdjust :: forall (k :: * -> *) v v'. (DMap.GCompare k) => (forall a. k a -> v a -> QueryT t q m (v' a)) -> DMap k v -> Event t (PatchDMap k v) -> QueryT t q m (DMap k v', Event t (PatchDMap k v'))
14287 traverseDMapWithKeyWithAdjust f dm0 dm' = do
14388 let f' :: forall a. k a -> v a -> EventWriterT t q (ReaderT (Dynamic t (QueryResult q)) m) (Compose (QueryTLoweredResult t q) v' a)
14489 f' k v = fmap (Compose . QueryTLoweredResult) $ flip runStateT [] $ unQueryT $ f k v
@@ -147,10 +92,10 @@ instance (Reflex t, MonadFix m, Group q, Additive q, Query q, Eq q, MonadHold t
14792 liftedResult' = fforCheap result' $ \(PatchDMap p) -> PatchDMap $
14893 mapKeyValuePairsMonotonic (\(k :=> ComposeMaybe mr) -> k :=> ComposeMaybe (fmap (getQueryTLoweredResultValue . getCompose) mr)) p
14994 liftedBs0 :: Map (Some k) [Behavior t q]
150− liftedBs0 = Map.fromDistinctAscList $ (\(k :=> Compose r) -> (Some k, getQueryTLoweredResultWritten r)) <$> DMap.toList result0
95+ liftedBs0 = Map.fromDistinctAscList $ (\(k :=> Compose r) -> (Some.This k, getQueryTLoweredResultWritten r)) <$> DMap.toList result0
15196 liftedBs' :: Event t (PatchMap (Some k) [Behavior t q])
15297 liftedBs' = fforCheap result' $ \(PatchDMap p) -> PatchMap $
153− Map.fromDistinctAscList $ (\(k :=> ComposeMaybe mr) -> (Some k, fmap (getQueryTLoweredResultWritten . getCompose) mr)) <$> DMap.toList p
98+ Map.fromDistinctAscList $ (\(k :=> ComposeMaybe mr) -> (Some.This k, fmap (getQueryTLoweredResultWritten . getCompose) mr)) <$> DMap.toList p
15499 sampleBs :: forall m'. MonadSample t m' => [Behavior t q] -> m' q
155100 sampleBs = foldlM (\b a -> (b <>) <$> sample a) mempty
156101 accumBehaviors :: forall m'. MonadHold t m'
@@ -166,24 +111,23 @@ instance (Reflex t, MonadFix m, Group q, Additive q, Query q, Eq q, MonadHold t
166111 let p k bs = case Map.lookup k bs0 of
167112 Nothing -> case bs of
168113 -- If the update is to delete the state for a child that doesn't exist, the patch is mempty.
169− Nothing -> return Nothing
114+ Nothing -> return mempty
170115 -- If the update is to update the state for a child that doesn't exist, the patch is the sample of the new state.
171− Just newBs -> maskMempty <$> sampleBs newBs
116+ Just newBs -> sampleBs newBs
172117 Just oldBs -> case bs of
173118 -- If the update is to delete the state for a child that already exists, the patch is the negation of the child's current state
174− Nothing -> maskMempty . negateG <$> sampleBs oldBs
119+ Nothing -> negateG <$> sampleBs oldBs
175120 -- If the update is to update the state for a child that already exists, the patch is the negation of sampling the child's current state
176121 -- composed with the sampling the child's new state.
177− Just newBs -> maskMempty <$> ((~~) <$> sampleBs newBs <*> sampleBs oldBs)
122+ Just newBs -> (~~) <$> sampleBs newBs <*> sampleBs oldBs
178123 -- we compute the patch by iterating over the update PatchMap and proceeding by cases. Then we fold over the
179124 -- child patches and wrap them in AdditivePatch.
180− patch <- fold <$> Map.traverseWithKey p bs'
181− return (apply pbs bs0, AdditivePatch <$> patch)
125+ patch <- AdditivePatch . fold <$> Map.traverseWithKey p bs'
126+ return (apply pbs bs0, Just patch)
182127 (qpatch :: Event t (AdditivePatch q)) <- mapAccumMaybeM_ accumBehaviors liftedBs0 liftedBs'
183128 tellQueryIncremental $ unsafeBuildIncremental (fold <$> mapM sampleBs liftedBs0) qpatch
184129 return (liftedResult0, liftedResult')
185−
186− traverseDMapWithKeyWithAdjustWithMove :: forall (k :: * -> *) v v'. (GCompare k) => (forall a. k a -> v a -> QueryT t q m (v' a)) -> DMap k v -> Event t (PatchDMapWithMove k v) -> QueryT t q m (DMap k v', Event t (PatchDMapWithMove k v'))
130+ traverseDMapWithKeyWithAdjustWithMove :: forall (k :: * -> *) v v'. (DMap.GCompare k) => (forall a. k a -> v a -> QueryT t q m (v' a)) -> DMap k v -> Event t (PatchDMapWithMove k v) -> QueryT t q m (DMap k v', Event t (PatchDMapWithMove k v'))
187131 traverseDMapWithKeyWithAdjustWithMove f dm0 dm' = do
188132 let f' :: forall a. k a -> v a -> EventWriterT t q (ReaderT (Dynamic t (QueryResult q)) m) (Compose (QueryTLoweredResult t q) v' a)
189133 f' k v = fmap (Compose . QueryTLoweredResult) $ flip runStateT [] $ unQueryT $ f k v
@@ -191,10 +135,10 @@ instance (Reflex t, MonadFix m, Group q, Additive q, Query q, Eq q, MonadHold t
191135 let liftedResult0 = mapKeyValuePairsMonotonic (\(k :=> Compose r) -> k :=> getQueryTLoweredResultValue r) result0
192136 liftedResult' = fforCheap result' $ mapPatchDMapWithMove (getQueryTLoweredResultValue . getCompose)
193137 liftedBs0 :: Map (Some k) [Behavior t q]
194− liftedBs0 = Map.fromDistinctAscList $ (\(k :=> Compose r) -> (Some k, getQueryTLoweredResultWritten r)) <$> DMap.toList result0
138+ liftedBs0 = Map.fromDistinctAscList $ (\(k :=> Compose r) -> (Some.This k, getQueryTLoweredResultWritten r)) <$> DMap.toList result0
195139 liftedBs' :: Event t (PatchMapWithMove (Some k) [Behavior t q])
196140 liftedBs' = fforCheap result' $ weakenPatchDMapWithMoveWith (getQueryTLoweredResultWritten . getCompose) {- \(PatchDMap p) -> PatchMapWithMove $
197− Map.fromDistinctAscList $ (\(k :=> mr) -> (Some k, fmap (fmap (getQueryTLoweredResultWritten . getCompose)) mr)) <$> DMap.toList p -}
141+ Map.fromDistinctAscList $ (\(k :=> mr) -> (Some.This k, fmap (fmap (getQueryTLoweredResultWritten . getCompose)) mr)) <$> DMap.toList p -}
198142 sampleBs :: forall m'. MonadSample t m' => [Behavior t q] -> m' q
199143 sampleBs = foldlM (\b a -> (b <>) <$> sample a) mempty
200144 accumBehaviors' :: forall m'. MonadHold t m'
@@ -211,28 +155,28 @@ instance (Reflex t, MonadFix m, Group q, Additive q, Query q, Eq q, MonadHold t
211155 p k bs = case Map.lookup k bs0 of
212156 Nothing -> case MapWithMove._nodeInfo_from bs of
213157 -- If the update is to delete the state for a child that doesn't exist, the patch is mempty.
214− MapWithMove.From_Delete -> return Nothing
158+ MapWithMove.From_Delete -> return mempty
215159 -- If the update is to update the state for a child that doesn't exist, the patch is the sample of the new state.
216− MapWithMove.From_Insert newBs -> maskMempty <$> sampleBs newBs
160+ MapWithMove.From_Insert newBs -> sampleBs newBs
217161 MapWithMove.From_Move k' -> case Map.lookup k' bs0 of
218− Nothing -> return Nothing
219− Just newBs -> maskMempty <$> sampleBs newBs
162+ Nothing -> return mempty
163+ Just newBs -> sampleBs newBs
220164 Just oldBs -> case MapWithMove._nodeInfo_from bs of
221165 -- If the update is to delete the state for a child that already exists, the patch is the negation of the child's current state
222− MapWithMove.From_Delete -> maskMempty . negateG <$> sampleBs oldBs
166+ MapWithMove.From_Delete -> negateG <$> sampleBs oldBs
223167 -- If the update is to update the state for a child that already exists, the patch is the negation of sampling the child's current state
224168 -- composed with the sampling the child's new state.
225− MapWithMove.From_Insert newBs -> maskMempty <$> ((~~) <$> sampleBs newBs <*> sampleBs oldBs)
169+ MapWithMove.From_Insert newBs -> (~~) <$> sampleBs newBs <*> sampleBs oldBs
226170 MapWithMove.From_Move k'
227− | k' == k -> return Nothing
171+ | k' == k -> return mempty
228172 | otherwise -> case Map.lookup k' bs0 of
229173 -- If we are moving from a non-existent key, that is a delete
230− Nothing -> maskMempty . negateG <$> sampleBs oldBs
231− Just newBs -> maskMempty <$> ((~~) <$> sampleBs newBs <*> sampleBs oldBs)
174+ Nothing -> negateG <$> sampleBs oldBs
175+ Just newBs -> (~~) <$> sampleBs newBs <*> sampleBs oldBs
232176 -- we compute the patch by iterating over the update PatchMap and proceeding by cases. Then we fold over the
233177 -- child patches and wrap them in AdditivePatch.
234− patch <- fold <$> Map.traverseWithKey p bs'
235− return (apply pbs bs0, AdditivePatch <$> patch)
178+ patch <- AdditivePatch . fold <$> Map.traverseWithKey p bs'
179+ return (apply pbs bs0, Just patch)
236180 (qpatch :: Event t (AdditivePatch q)) <- mapAccumMaybeM_ accumBehaviors' liftedBs0 liftedBs'
237181 tellQueryIncremental $ unsafeBuildIncremental (fold <$> mapM sampleBs liftedBs0) qpatch
238182 return (liftedResult0, liftedResult')
@@ -240,13 +184,6 @@ instance (Reflex t, MonadFix m, Group q, Additive q, Query q, Eq q, MonadHold t
240184instance MonadTrans (QueryT t q) where
241185 lift = QueryT . lift . lift . lift
242186
243−instance MFunctor (QueryT t q) where
244− hoist = mapQueryT
245−
246−instance PrimMonad m => PrimMonad (QueryT t q m) where
247− type PrimState (QueryT t q m) = PrimState m
248− primitive = lift . primitive
249−
250187instance PostBuild t m => PostBuild t (QueryT t q m) where
251188 getPostBuild = lift getPostBuild
252189
@@ -273,13 +210,11 @@ instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (QueryT t q
273210 newEventWithTrigger = QueryT . newEventWithTrigger
274211 newFanEventWithTrigger a = QueryT . lift $ newFanEventWithTrigger a
275212
276−-- TODO: Monoid and Semigroup can likely be derived once StateT has them.
277−instance (Monoid a, Monad m) => Monoid (QueryT t q m a) where
278− mempty = pure mempty
279− mappend = (<>)
213+mapQuery :: QueryMorphism q q' -> q -> q'
214+mapQuery = _queryMorphism_mapQuery
280215
281−instance (S.Semigroup a, Monad m) => S.Semigroup (QueryT t q m a) where
282− (<>) = liftA2 (S.<>)
216+mapQueryResult :: QueryMorphism q q' -> QueryResult q' -> QueryResult q
217+mapQueryResult = _queryMorphism_mapQueryResult
283218
284219-- | withQueryT's QueryMorphism argument needs to be a group homomorphism in order to behave correctly
285220withQueryT :: (MonadFix m, PostBuild t m, Group q, Group q', Additive q, Additive q', Query q')
@@ -294,10 +229,6 @@ withQueryT f a = do
294229 (fmapCheap (AdditivePatch . mapQuery f . unAdditivePatch) $ updatedIncremental q)
295230 return result
296231
297−-- | Maps a function over a 'QueryT' that can change the underlying monad
298−mapQueryT :: (forall b. m b -> n b) -> QueryT t q m a -> QueryT t q n a
299−mapQueryT f (QueryT a) = QueryT $ mapStateT (mapEventWriterT (mapReaderT f)) a
300−
301232-- | dynWithQueryT's (Dynamic t QueryMorphism) argument needs to be a group homomorphism at all times in order to behave correctly
302233dynWithQueryT :: (MonadFix m, PostBuild t m, Group q, Additive q, Group q', Additive q', Query q')
303234 => Dynamic t (QueryMorphism q q')
@@ -310,7 +241,7 @@ dynWithQueryT f q = do
310241 return result
311242 where zipDynIncrementalWith g da ib =
312243 let eab = align (updated da) (updatedIncremental ib)
313− ec = flip push eab $ \case
244+ ec = flip push eab $ \o -> case o of
314245 This a -> do
315246 aOld <- sample $ current da
316247 b <- sample $ currentIncremental ib
@@ -331,7 +262,8 @@ instance (Monad m, Group q, Additive q, Query q, Reflex t) => MonadQuery t q (Qu
331262 askQueryResult = QueryT ask
332263 queryIncremental q = do
333264 tellQueryIncremental q
334− zipDynWith crop (incrementalToDynamic q) <$> askQueryResult
265+ r <- askQueryResult
266+ return $ zipDynWith crop (incrementalToDynamic q) r
335267
336268instance Requester t m => Requester t (QueryT t q m) where
337269 type Request (QueryT t q m) = Request m
@@ -341,6 +273,3 @@ instance Requester t m => Requester t (QueryT t q m) where
341273
342274instance EventWriter t w m => EventWriter t w (QueryT t q m) where
343275 tellEvent = lift . tellEvent
344−
345−instance DynamicWriter t w m => DynamicWriter t w (QueryT t q m) where
346− tellDyn = lift . tellDyn
src/Reflex/Query/Class.hs+11−92
@@ -1,18 +1,11 @@
1−{-# LANGUAGE CPP #-}
21{-# LANGUAGE DeriveDataTypeable #-}
32{-# LANGUAGE FlexibleContexts #-}
43{-# LANGUAGE FlexibleInstances #-}
54{-# LANGUAGE FunctionalDependencies #-}
65{-# LANGUAGE GeneralizedNewtypeDeriving #-}
6+{-# LANGUAGE MultiParamTypeClasses #-}
77{-# LANGUAGE TypeFamilies #-}
88{-# LANGUAGE UndecidableInstances #-}
9−-- |
10−-- Module:
11−-- Reflex.Query.Class
12−-- Description:
13−-- A class that ties together queries to some data source and their results,
14−-- providing methods for requesting data from the source and accumulating
15−-- streamed results.
169module Reflex.Query.Class
1710 ( Query (..)
1811 , QueryMorphism (..)
@@ -22,94 +15,29 @@ module Reflex.Query.Class
2215 , MonadQuery (..)
2316 , tellQueryDyn
2417 , queryDyn
25− , subQuery
26− , mapQuery
27− , mapQueryResult
2818 ) where
2919
30−import Control.Category (Category)
31−import qualified Control.Category as Cat
3220import Control.Monad.Reader
3321import Data.Bits
3422import Data.Data
3523import Data.Ix
36−import Data.Map.Monoidal (MonoidalMap)
37−import qualified Data.Map.Monoidal as MonoidalMap
38−import Data.Semigroup (Semigroup(..))
24+import Data.Semigroup
3925import Foreign.Storable
40−import Data.Void
41−import Data.Monoid hiding ((<>))
42−import Control.Applicative
4326
4427import Reflex.Class
4528
46−-- | A 'Query' can be thought of as a declaration of interest in some set of data.
47−-- A 'QueryResult' is the set of data associated with that interest set.
48−-- The @crop@ function provides a way to determine what part of a given 'QueryResult'
49−-- is relevant to a given 'Query'.
5029class (Monoid (QueryResult a), Semigroup (QueryResult a)) => Query a where
5130 type QueryResult a :: *
5231 crop :: a -> QueryResult a -> QueryResult a
5332
54−instance (Ord k, Query v) => Query (MonoidalMap k v) where
55− type QueryResult (MonoidalMap k v) = MonoidalMap k (QueryResult v)
56− crop q r = MonoidalMap.intersectionWith (flip crop) r q
57−
58−-- | the result of two queries is both results.
59−instance (Query a, Query b) => Query (a, b) where
60− type QueryResult (a, b) = (QueryResult a, QueryResult b)
61− crop (x, x') (y, y') = (crop x y, crop x' y')
62−
63−-- | Trivial queries have trivial results.
64−instance Query () where
65− type QueryResult () = ()
66− crop _ _ = ()
67−
68−-- | The result of an absurd query is trivial; If you can ask the question, the
69−-- answer cannot tell you anything you didn't already know.
70−--
71−-- 'QueryResult Void = @Void@' seems like it would also work, but that has
72−-- problems of robustness. In some applications, an unasked question can still
73−-- be answered, so it is important that the result is inhabited even when the
74−-- question isn't. Applications that wish to prevent this can mandate that the
75−-- query result be paired with the query: then the whole response will be
76−-- uninhabited as desired.
77−instance Query Void where
78− type QueryResult Void = ()
79− crop = absurd
80−
81−#if MIN_VERSION_base(4,12,0)
82−-- | We can lift queries into monoidal containers.
83−-- But beware of Applicatives whose monoid is different from (pure mempty, liftA2 mappend)
84−instance (Query q, Applicative f) => Query (Ap f q) where
85− type QueryResult (Ap f q) = Ap f (QueryResult q)
86− crop = liftA2 crop
87−#endif
88−
89−-- | QueryMorphism's must be group homomorphisms when acting on the query type
90−-- and compatible with the query relationship when acting on the query result.
33+-- | NB: QueryMorphism's must be group homomorphisms when acting on the query type
34+-- and compatible with the query relationship when acting on the query result
9135data QueryMorphism q q' = QueryMorphism
9236 { _queryMorphism_mapQuery :: q -> q'
9337 , _queryMorphism_mapQueryResult :: QueryResult q' -> QueryResult q
9438 }
9539
96−instance Category QueryMorphism where
97− id = QueryMorphism id id
98− qm . qm' = QueryMorphism
99− { _queryMorphism_mapQuery = mapQuery qm . mapQuery qm'
100− , _queryMorphism_mapQueryResult = mapQueryResult qm' . mapQueryResult qm
101− }
102−
103−-- | Apply a 'QueryMorphism' to a 'Query'
104−mapQuery :: QueryMorphism q q' -> q -> q'
105−mapQuery = _queryMorphism_mapQuery
106−
107−-- | Map a 'QueryMorphism' to a 'QueryResult'
108−mapQueryResult :: QueryMorphism q q' -> QueryResult q' -> QueryResult q
109−mapQueryResult = _queryMorphism_mapQueryResult
110−
111−-- | This type can be used to track of the frequency of interest in a given 'Query'. See note on
112−-- 'combineSelectedCounts'
40+-- | This type keeps track of the multiplicity of elements of the view selector that are being used by the app
11341newtype SelectedCount = SelectedCount { unSelectedCount :: Int }
11442 deriving (Eq, Ord, Show, Read, Integral, Num, Bounded, Enum, Real, Ix, Bits, FiniteBits, Storable, Data)
11543
@@ -125,34 +53,25 @@ instance Group SelectedCount where
12553
12654instance Additive SelectedCount
12755
128−-- | The Semigroup\/Monoid\/Group instances for a Query containing 'SelectedCount's should use
129−-- this function which returns Nothing if the result is 0. This allows the pruning of leaves
130−-- of the 'Query' that are no longer wanted.
56+-- | The Semigroup/Monoid/Group instances for a ViewSelector should use this function which returns Nothing if the result is 0. This allows the pruning of leaves that are no longer wanted.
13157combineSelectedCounts :: SelectedCount -> SelectedCount -> Maybe SelectedCount
13258combineSelectedCounts (SelectedCount i) (SelectedCount j) = if i == negate j then Nothing else Just $ SelectedCount (i + j)
13359
134−-- | A class that allows sending of 'Query's and retrieval of 'QueryResult's. See 'queryDyn' for a commonly
135−-- used interface.
136−class (Group q, Additive q, Query q, Monad m) => MonadQuery t q m | m -> q t where
60+class (Group q, Additive q, Query q) => MonadQuery t q m | m -> q t where
13761 tellQueryIncremental :: Incremental t (AdditivePatch q) -> m ()
13862 askQueryResult :: m (Dynamic t (QueryResult q))
13963 queryIncremental :: Incremental t (AdditivePatch q) -> m (Dynamic t (QueryResult q))
14064
141−instance MonadQuery t q m => MonadQuery t q (ReaderT r m) where
65+instance (Monad m, MonadQuery t q m) => MonadQuery t q (ReaderT r m) where
14266 tellQueryIncremental = lift . tellQueryIncremental
14367 askQueryResult = lift askQueryResult
14468 queryIncremental = lift . queryIncremental
14569
146−-- | Produce and send an 'Incremental' 'Query' from a 'Dynamic' 'Query'.
14770tellQueryDyn :: (Reflex t, MonadQuery t q m) => Dynamic t q -> m ()
14871tellQueryDyn d = tellQueryIncremental $ unsafeBuildIncremental (sample (current d)) $ attachWith (\old new -> AdditivePatch $ new ~~ old) (current d) (updated d)
14972
150−-- | Retrieve 'Dynamic'ally updating 'QueryResult's for a 'Dynamic'ally updating 'Query'.
151−queryDyn :: (Reflex t, MonadQuery t q m) => Dynamic t q -> m (Dynamic t (QueryResult q))
73+queryDyn :: (Reflex t, Monad m, MonadQuery t q m) => Dynamic t q -> m (Dynamic t (QueryResult q))
15274queryDyn q = do
15375 tellQueryDyn q
154− zipDynWith crop q <$> askQueryResult
155−
156−-- | Use a query morphism to operate on a smaller version of a query.
157−subQuery :: (Reflex t, MonadQuery t q2 m) => QueryMorphism q1 q2 -> Dynamic t q1 -> m (Dynamic t (QueryResult q1))
158−subQuery (QueryMorphism f g) x = fmap g <$> queryDyn (fmap f x)
76+ r <- askQueryResult
77+ return $ zipDynWith crop q r
src/Reflex/Requester/Base.hs+27−215
@@ -1,7 +1,7 @@
11-- | This module provides 'RequesterT', the standard implementation of
22-- 'Requester'.
33{-# LANGUAGE AllowAmbiguousTypes #-}
4−{-# LANGUAGE ApplicativeDo #-}
4+{-# LANGUAGE BangPatterns #-}
55{-# LANGUAGE CPP #-}
66{-# LANGUAGE EmptyDataDecls #-}
77{-# LANGUAGE ExistentialQuantification #-}
@@ -22,25 +22,17 @@
2222module Reflex.Requester.Base
2323 ( RequesterT (..)
2424 , runRequesterT
25− , withRequesterT
2625 , runWithReplaceRequesterTWith
2726 , traverseIntMapWithKeyWithAdjustRequesterTWith
2827 , traverseDMapWithKeyWithAdjustRequesterTWith
2928 , RequesterData
3029 , RequesterDataKey
3130 , traverseRequesterData
32− , forRequesterData
3331 , requesterDataToList
3432 , singletonRequesterData
35− , matchResponsesWithRequests
36− , matchResponseMapWithRequests
37− , multiEntry
38− , unMultiEntry
39− , requesting'
4033 ) where
4134
4235import Reflex.Class
43−import Reflex.Adjustable.Class
4436import Reflex.Dynamic
4537import Reflex.Host.Class
4638import Reflex.PerformEvent.Class
@@ -48,20 +40,17 @@ import Reflex.PostBuild.Class
4840import Reflex.Requester.Class
4941import Reflex.TriggerEvent.Class
5042
51−import Control.Applicative (liftA2)
5243import Control.Monad.Exception
5344import Control.Monad.Identity
54−import Control.Monad.Morph
55−import Control.Monad.Primitive
5645import Control.Monad.Reader
5746import Control.Monad.Ref
5847import Control.Monad.State.Strict
5948import Data.Bits
6049import Data.Coerce
61−import Data.Constraint
62−import Data.Dependent.Map (DMap)
50+import Data.Dependent.Map (DMap, DSum (..))
6351import qualified Data.Dependent.Map as DMap
64−import Data.Dependent.Sum (DSum (..))
52+import qualified Data.Some as Some
53+import Data.FastMutableIntMap
6554import Data.Functor.Compose
6655import Data.Functor.Misc
6756import Data.IntMap.Strict (IntMap)
@@ -69,11 +58,10 @@ import qualified Data.IntMap.Strict as IntMap
6958import Data.Map (Map)
7059import qualified Data.Map as Map
7160import Data.Monoid ((<>))
72−import Data.Proxy
73−import qualified Data.Semigroup as S
74−import Data.Some (Some(Some))
75−import Data.Type.Equality
7661import Data.Unique.Tag
62+import Data.Some (Some)
63+import Data.Type.Equality
64+import Data.Proxy
7765
7866import GHC.Exts (Any)
7967import Unsafe.Coerce
@@ -84,51 +72,19 @@ newtype TagMap (f :: * -> *) = TagMap (IntMap Any)
8472
8573newtype RequesterData f = RequesterData (TagMap (Entry f))
8674
87−emptyRequesterData :: RequesterData f
88−emptyRequesterData = RequesterData $ TagMap IntMap.empty
89−
9075data RequesterDataKey a where
9176 RequesterDataKey_Single :: {-# UNPACK #-} !(MyTag (Single a)) -> RequesterDataKey a
9277 RequesterDataKey_Multi :: {-# UNPACK #-} !(MyTag Multi) -> {-# UNPACK #-} !Int -> !(RequesterDataKey a) -> RequesterDataKey a --TODO: Don't put a second Int here (or in the other Multis); use a single Int instead
93− RequesterDataKey_Multi2 :: GCompare k => {-# UNPACK #-} !(MyTag (Multi2 k)) -> !(Some k) -> {-# UNPACK #-} !Int -> !(RequesterDataKey a) -> RequesterDataKey a
78+ RequesterDataKey_Multi2 :: {-# UNPACK #-} !(MyTag (Multi2 k)) -> !(Some k) -> {-# UNPACK #-} !Int -> !(RequesterDataKey a) -> RequesterDataKey a
9479 RequesterDataKey_Multi3 :: {-# UNPACK #-} !(MyTag Multi3) -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> !(RequesterDataKey a) -> RequesterDataKey a
9580
9681singletonRequesterData :: RequesterDataKey a -> f a -> RequesterData f
9782singletonRequesterData rdk v = case rdk of
9883 RequesterDataKey_Single k -> RequesterData $ singletonTagMap k $ Entry v
9984 RequesterDataKey_Multi k k' k'' -> RequesterData $ singletonTagMap k $ Entry $ IntMap.singleton k' $ singletonRequesterData k'' v
100− RequesterDataKey_Multi2 k k' k'' k''' -> RequesterData $ singletonTagMap k $ Entry $ Multi2Contents
101− { _multi2Contents_values = Map.singleton k' $ IntMap.singleton k'' $ singletonRequesterData k''' v
102− , _multi2Contents_dict = Dict
103− }
85+ RequesterDataKey_Multi2 k k' k'' k''' -> RequesterData $ singletonTagMap k $ Entry $ Map.singleton k' $ IntMap.singleton k'' $ singletonRequesterData k''' v
10486 RequesterDataKey_Multi3 k k' k'' k''' -> RequesterData $ singletonTagMap k $ Entry $ IntMap.singleton k' $ IntMap.singleton k'' $ singletonRequesterData k''' v
10587
106−mergeRequesterData :: RequesterData f -> RequesterData f -> RequesterData f
107−mergeRequesterData (RequesterData a) (RequesterData b) = RequesterData $ mergeTagMap a b
108−
109−mergeTagMap :: forall f. TagMap (Entry f) -> TagMap (Entry f) -> TagMap (Entry f)
110−mergeTagMap (TagMap m) (TagMap n) =
111− TagMap $ IntMap.unionWithKey (g' combiner) m n
112− where
113− combiner :: forall a. MyTag a -> Entry f a -> Entry f a -> Entry f a
114− combiner k (Entry a) (Entry b) = Entry $ case myKeyType k of
115− MyTagType_Single -> a
116− MyTagType_Multi -> IntMap.unionWith mergeRequesterData a b
117− MyTagType_Multi2 -> case _multi2Contents_dict a of
118− Dict -> Multi2Contents
119− { _multi2Contents_values = Map.unionWith (IntMap.unionWith mergeRequesterData) (_multi2Contents_values a) (_multi2Contents_values b)
120− , _multi2Contents_dict = Dict
121− }
122− MyTagType_Multi3 -> IntMap.unionWith (IntMap.unionWith mergeRequesterData) a b
123− g' :: (forall a. MyTag a -> Entry f a -> Entry f a -> Entry f a) -> Int -> Any -> Any -> Any
124− g' f rawKey a b =
125− let k = MyTag rawKey :: MyTag a
126− fromAny :: Any -> Entry f a
127− fromAny = unsafeCoerce
128− toAny :: Entry f a -> Any
129− toAny = unsafeCoerce
130− in toAny $ f k (fromAny a) (fromAny b)
131−
13288requesterDataToList :: RequesterData f -> [DSum RequesterDataKey f]
13389requesterDataToList (RequesterData m) = do
13490 k :=> Entry e <- tagMapToList m
@@ -138,12 +94,11 @@ requesterDataToList (RequesterData m) = do
13894 (k', e') <- IntMap.toList e
13995 k'' :=> e'' <- requesterDataToList e'
14096 return $ RequesterDataKey_Multi k k' k'' :=> e''
141− MyTagType_Multi2 -> case _multi2Contents_dict e of
142− Dict -> do
143− (k', e') <- Map.toList $ _multi2Contents_values e
144− (k'', e'') <- IntMap.toList e'
145− k''' :=> e''' <- requesterDataToList e''
146− return $ RequesterDataKey_Multi2 k k' k'' k''' :=> e'''
97+ MyTagType_Multi2 -> do
98+ (k', e') <- Map.toList e
99+ (k'', e'') <- IntMap.toList e'
100+ k''' :=> e''' <- requesterDataToList e''
101+ return $ RequesterDataKey_Multi2 k k' k'' k''' :=> e'''
147102 MyTagType_Multi3 -> do
148103 (k', e') <- IntMap.toList e
149104 (k'', e'') <- IntMap.toList e'
@@ -154,9 +109,9 @@ singletonTagMap :: forall f a. MyTag a -> f a -> TagMap f
154109singletonTagMap (MyTag k) v = TagMap $ IntMap.singleton k $ (unsafeCoerce :: f a -> Any) v
155110
156111tagMapToList :: forall f. TagMap f -> [DSum MyTag f]
157−tagMapToList (TagMap m) = f <$> IntMap.toList m
112+tagMapToList (TagMap m) = fmap f $ IntMap.toList m
158113 where f :: (Int, Any) -> DSum MyTag f
159− f (k, v) = MyTag k :=> (unsafeCoerce :: Any -> f a) v
114+ f (k, v) = MyTag k :=> ((unsafeCoerce :: Any -> f a) v)
160115
161116traverseTagMapWithKey :: forall t f g. Applicative t => (forall a. MyTag a -> f a -> t (g a)) -> TagMap f -> t (TagMap g)
162117traverseTagMapWithKey f (TagMap m) = TagMap <$> IntMap.traverseWithKey g m
@@ -171,19 +126,9 @@ traverseRequesterData f (RequesterData m) = RequesterData <$> traverseTagMapWith
171126 go k (Entry request) = Entry <$> case myKeyType k of
172127 MyTagType_Single -> f request
173128 MyTagType_Multi -> traverse (traverseRequesterData f) request
174− MyTagType_Multi2 -> case request of
175− Multi2Contents { _multi2Contents_values = request', _multi2Contents_dict = Dict } -> do
176− v <- traverse (traverse (traverseRequesterData f)) request'
177− pure $ Multi2Contents
178− { _multi2Contents_values = v
179− , _multi2Contents_dict = Dict
180− }
129+ MyTagType_Multi2 -> traverse (traverse (traverseRequesterData f)) request
181130 MyTagType_Multi3 -> traverse (traverse (traverseRequesterData f)) request
182131
183−-- | 'traverseRequesterData' with its arguments flipped
184−forRequesterData :: forall request response m. Applicative m => RequesterData request -> (forall a. request a -> m (response a)) -> m (RequesterData response)
185−forRequesterData r f = traverseRequesterData f r
186−
187132data MyTagType :: * -> * where
188133 MyTagType_Single :: MyTagType (Single a)
189134 MyTagType_Multi :: MyTagType Multi
@@ -221,14 +166,9 @@ instance MyTagTypeOffset Multi3 where
221166type family EntryContents request a where
222167 EntryContents request (Single a) = request a
223168 EntryContents request Multi = IntMap (RequesterData request)
224− EntryContents request (Multi2 k) = Multi2Contents k request
169+ EntryContents request (Multi2 k) = Map (Some k) (IntMap (RequesterData request))
225170 EntryContents request Multi3 = IntMap (IntMap (RequesterData request))
226171
227−data Multi2Contents k request = Multi2Contents
228− { _multi2Contents_dict :: {-# UNPACK #-} !(Dict (GCompare k)) -- This is a Dict instead of an existential context because we only want to use it in certain circumstances
229− , _multi2Contents_values :: {-# UNPACK #-} !(Map (Some k) (IntMap (RequesterData request)))
230− }
231−
232172newtype Entry request x = Entry { unEntry :: EntryContents request x }
233173
234174{-# INLINE singleEntry #-}
@@ -298,23 +238,11 @@ deriving instance MonadHold t m => MonadHold t (RequesterT t request response m)
298238deriving instance PostBuild t m => PostBuild t (RequesterT t request response m)
299239deriving instance TriggerEvent t m => TriggerEvent t (RequesterT t request response m)
300240
301−instance PrimMonad m => PrimMonad (RequesterT t request response m) where
302− type PrimState (RequesterT t request response m) = PrimState m
303− primitive = lift . primitive
304−
305−-- TODO: Monoid and Semigroup can likely be derived once StateT has them.
306−instance (Monoid a, Monad m) => Monoid (RequesterT t request response m a) where
307− mempty = pure mempty
308− mappend = liftA2 mappend
309−
310−instance (S.Semigroup a, Monad m) => S.Semigroup (RequesterT t request response m a) where
311− (<>) = liftA2 (S.<>)
312−
313−
314241-- | Run a 'RequesterT' action. The resulting 'Event' will fire whenever
315242-- requests are made, and responses should be provided in the input 'Event'.
316243-- The 'Tag' keys will be used to return the responses to the same place the
317244-- requests were issued.
245+
318246runRequesterT :: (Reflex t, Monad m)
319247 => RequesterT t request response m a
320248 -> Event t (RequesterData response) --TODO: This DMap will be in reverse order, so we need to make sure the caller traverses it in reverse
@@ -324,20 +252,6 @@ runRequesterT (RequesterT a) responses = do
324252 coerceEvent responses
325253 return (result, fmapCheap (RequesterData . TagMap) $ mergeInt $ IntMap.fromDistinctAscList $ _requesterState_requests s)
326254
327−-- | Map a function over the request and response of a 'RequesterT'
328−withRequesterT
329− :: (Reflex t, MonadFix m)
330− => (forall x. req x -> req' x) -- ^ The function to map over the request
331− -> (forall x. rsp' x -> rsp x) -- ^ The function to map over the response
332− -> RequesterT t req rsp m a -- ^ The internal 'RequesterT' whose input and output will be transformed
333− -> RequesterT t req' rsp' m a -- ^ The resulting 'RequesterT'
334−withRequesterT freq frsp child = do
335− rec let rsp = fmap (runIdentity . traverseRequesterData (Identity . frsp)) rsp'
336− (a, req) <- lift $ runRequesterT child rsp
337− rsp' <- fmap (flip selectInt 0 . fanInt . fmapCheap unMultiEntry) $ requesting' $
338− fmapCheap (multiEntry . IntMap.singleton 0) $ fmap (runIdentity . traverseRequesterData (Identity . freq)) req
339− return a
340−
341255instance (Reflex t, Monad m) => Requester t (RequesterT t request response m) where
342256 type Request (RequesterT t request response m) = request
343257 type Response (RequesterT t request response m) = response
@@ -357,7 +271,7 @@ tagRequest req = do
357271 return t
358272
359273{-# INLINE responseFromTag #-}
360−responseFromTag :: forall m t request response x. Monad m => MyTagWrap response (Entry response x) -> RequesterT t request response m (Event t (Entry response x))
274+responseFromTag :: (Monad m, Reflex t) => MyTagWrap response (Entry response x) -> RequesterT t request response m (Event t (Entry response x))
361275responseFromTag (MyTagWrap t) = do
362276 responses :: EventSelectorInt t Any <- RequesterT ask
363277 return $ (unsafeCoerce :: Event t Any -> Event t (Entry response x)) $ selectInt responses t
@@ -365,9 +279,6 @@ responseFromTag (MyTagWrap t) = do
365279instance MonadTrans (RequesterT t request response) where
366280 lift = RequesterT . lift . lift
367281
368−instance MFunctor (RequesterT t request response) where
369− hoist f = RequesterT . hoist (hoist f) . unRequesterT
370−
371282instance PerformEvent t m => PerformEvent t (RequesterT t request response m) where
372283 type Performable (RequesterT t request response m) = Performable m
373284 performEvent_ = lift . performEvent_
@@ -388,14 +299,14 @@ instance MonadReader r m => MonadReader r (RequesterT t request response m) wher
388299 local f (RequesterT a) = RequesterT $ mapStateT (mapReaderT $ local f) a
389300 reader = lift . reader
390301
391−instance (Reflex t, Adjustable t m, MonadHold t m, MonadFix m) => Adjustable t (RequesterT t request response m) where
302+instance (Reflex t, MonadAdjust t m, MonadHold t m, MonadFix m) => MonadAdjust t (RequesterT t request response m) where
392303 runWithReplace = runWithReplaceRequesterTWith $ \dm0 dm' -> lift $ runWithReplace dm0 dm'
393304 traverseIntMapWithKeyWithAdjust = traverseIntMapWithKeyWithAdjustRequesterTWith (\f dm0 dm' -> lift $ traverseIntMapWithKeyWithAdjust f dm0 dm') patchIntMapNewElementsMap mergeIntIncremental
394305 {-# INLINABLE traverseDMapWithKeyWithAdjust #-}
395306 traverseDMapWithKeyWithAdjust = traverseDMapWithKeyWithAdjustRequesterTWith (\f dm0 dm' -> lift $ traverseDMapWithKeyWithAdjust f dm0 dm') mapPatchDMap weakenPatchDMapWith patchMapNewElementsMap mergeMapIncremental
396307 traverseDMapWithKeyWithAdjustWithMove = traverseDMapWithKeyWithAdjustRequesterTWith (\f dm0 dm' -> lift $ traverseDMapWithKeyWithAdjustWithMove f dm0 dm') mapPatchDMapWithMove weakenPatchDMapWithMoveWith patchMapWithMoveNewElementsMap mergeMapIncrementalWithMove
397308
398−requesting' :: (MyTagTypeOffset x, Monad m) => Event t (Entry request x) -> RequesterT t request response m (Event t (Entry response x))
309+requesting' :: (MyTagTypeOffset x, Monad m, Reflex t) => Event t (Entry request x) -> RequesterT t request response m (Event t (Entry response x))
399310requesting' = responseFromTag . castMyTagWrap <=< tagRequest
400311
401312{-# INLINABLE runWithReplaceRequesterTWith #-}
@@ -444,10 +355,10 @@ traverseIntMapWithKeyWithAdjustRequesterTWith base patchNewElements mergePatchIn
444355 pack = Entry
445356 f' :: IntMap.Key -> (Int, v) -> m (Event t (IntMap (RequesterData request)), v')
446357 f' k (n, v) = do
447− (result, myRequests) <- runRequesterT (f k v) $ mapMaybeCheap (IntMap.lookup n) $ selectInt responses k --TODO: Instead of doing mapMaybeCheap, can we share a fanInt across all instances of a given key, or at least the ones that are adjacent in time?
358+ (result, myRequests) <- runRequesterT (f k v) $ fmapMaybeCheap (IntMap.lookup n) $ selectInt responses k --TODO: Instead of doing fmapMaybeCheap, can we share a fanInt across all instances of a given key, or at least the ones that are adjacent in time?
448359 return (fmapCheap (IntMap.singleton n) myRequests, result)
449360 ndm' <- numberOccurrencesFrom 1 dm'
450− (children0, children') <- base f' (fmap ((,) 0) dm0) $ fmap (\(n, dm) -> fmap ((,) n) dm) ndm' --TODO: Avoid this somehow, probably by adding some sort of per-cohort information passing to Adjustable
361+ (children0, children') <- base f' (fmap ((,) 0) dm0) $ fmap (\(n, dm) -> fmap ((,) n) dm) ndm' --TODO: Avoid this somehow, probably by adding some sort of per-cohort information passing to MonadAdjust
451362 let result0 = fmap snd children0
452363 result' = fforCheap children' $ fmap snd
453364 requests0 :: IntMap (Event t (IntMap (RequesterData request)))
@@ -487,12 +398,12 @@ traverseDMapWithKeyWithAdjustRequesterTWith base mapPatch weakenPatchWith patchN
487398 let responses :: EventSelector t (Const2 (Some k) (IntMap (RequesterData response)))
488399 responses = fanMap $ fmapCheap unpack response
489400 unpack :: Entry response (Multi2 k) -> Map (Some k) (IntMap (RequesterData response))
490− unpack = _multi2Contents_values . unEntry
401+ unpack = unEntry
491402 pack :: Map (Some k) (IntMap (RequesterData request)) -> Entry request (Multi2 k)
492− pack m = Entry $ Multi2Contents { _multi2Contents_values = m, _multi2Contents_dict = Dict }
403+ pack = Entry
493404 f' :: forall a. k a -> Compose ((,) Int) v a -> m (Compose ((,) (Event t (IntMap (RequesterData request)))) v' a)
494405 f' k (Compose (n, v)) = do
495− (result, myRequests) <- runRequesterT (f k v) $ mapMaybeCheap (IntMap.lookup n) $ select responses (Const2 (Some k))
406+ (result, myRequests) <- runRequesterT (f k v) $ fmapMaybeCheap (IntMap.lookup n) $ select responses (Const2 (Some.This k))
496407 return $ Compose (fmapCheap (IntMap.singleton n) myRequests, result)
497408 ndm' <- numberOccurrencesFrom 1 dm'
498409 (children0, children') <- base f' (DMap.map (\v -> Compose (0, v)) dm0) $ fmap (\(n, dm) -> mapPatch (\v -> Compose (n, v)) dm) ndm'
@@ -506,102 +417,3 @@ traverseDMapWithKeyWithAdjustRequesterTWith base mapPatch weakenPatchWith patchN
506417 promptRequests = coincidence $ fmapCheap (mergeMap . patchNewElements) requests' --TODO: Create a mergeIncrementalPromptly, and use that to eliminate this 'coincidence'
507418 requests <- holdIncremental requests0 requests'
508419 return (result0, result')
509−
510−data Decoder rawResponse response =
511− forall a. Decoder (RequesterDataKey a) (rawResponse -> response a)
512−
513−matchResponsesWithRequests
514− :: forall t rawRequest rawResponse request response m.
515− ( MonadFix m
516− , MonadHold t m
517− , Reflex t
518− )
519− => (forall a. request a -> (rawRequest, rawResponse -> response a))
520− -- ^ Given a request (from 'Requester'), produces the wire format of the
521− -- request and a function used to process the associated response
522− -> Event t (RequesterData request)
523− -- ^ The outgoing requests
524− -> Event t (Int, rawResponse)
525− -- ^ The incoming responses, tagged by an identifying key
526− -> m ( Event t (Map Int rawRequest)
527− , Event t (RequesterData response)
528− )
529− -- ^ A map of outgoing wire-format requests and an event of responses keyed
530− -- by the 'RequesterData' key of the associated outgoing request
531−matchResponsesWithRequests f send recv = matchResponseMapWithRequests f send $ uncurry Map.singleton <$> recv
532−
533−-- | Matches incoming responses with previously-sent requests
534−-- and uses the provided request "decoder" function to process
535−-- incoming responses.
536−matchResponseMapWithRequests
537− :: forall t rawRequest rawResponse request response m.
538− ( MonadFix m
539− , MonadHold t m
540− , Reflex t
541− )
542− => (forall a. request a -> (rawRequest, rawResponse -> response a))
543− -- ^ Given a request (from 'Requester'), produces the wire format of the
544− -- request and a function used to process the associated response
545− -> Event t (RequesterData request)
546− -- ^ The outgoing requests
547− -> Event t (Map Int rawResponse)
548− -- ^ A map of incoming responses, tagged by an identifying key
549− -> m ( Event t (Map Int rawRequest)
550− , Event t (RequesterData response)
551− )
552− -- ^ A map of outgoing wire-format requests and an event of responses keyed
553− -- by the 'RequesterData' key of the associated outgoing request
554−matchResponseMapWithRequests f send recv = do
555− rec nextId <- hold 1 $ fmap (\(next, _, _) -> next) outgoing
556− waitingFor :: Incremental t (PatchMap Int (Decoder rawResponse response)) <-
557− holdIncremental mempty $ leftmost
558− [ fmap (\(_, outstanding, _) -> outstanding) outgoing
559− , snd <$> incoming
560− ]
561− let outgoing = processOutgoing nextId send
562− incoming = processIncoming waitingFor recv
563− return (fmap (\(_, _, rawReqs) -> rawReqs) outgoing, fst <$> incoming)
564− where
565− -- Tags each outgoing request with an identifying integer key
566− -- and returns the next available key, a map of response decoders
567− -- for requests for which there are outstanding responses, and the
568− -- raw requests to be sent out.
569− processOutgoing
570− :: Behavior t Int
571− -- The next available key
572− -> Event t (RequesterData request)
573− -- The outgoing request
574− -> Event t ( Int
575− , PatchMap Int (Decoder rawResponse response)
576− , Map Int rawRequest )
577− -- The new next-available-key, a map of requests expecting responses, and the tagged raw requests
578− processOutgoing nextId out = flip pushAlways out $ \dm -> do
579− oldNextId <- sample nextId
580− let (result, newNextId) = flip runState oldNextId $ forM (requesterDataToList dm) $ \(k :=> v) -> do
581− n <- get
582− put $ succ n
583− let (rawReq, rspF) = f v
584− return (n, rawReq, Decoder k rspF)
585− patchWaitingFor = PatchMap $ Map.fromList $
586− (\(n, _, dec) -> (n, Just dec)) <$> result
587− toSend = Map.fromList $ (\(n, rawReq, _) -> (n, rawReq)) <$> result
588− return (newNextId, patchWaitingFor, toSend)
589− -- Looks up the each incoming raw response in a map of response
590− -- decoders and returns the decoded response and a patch that can
591− -- be used to clear the ID of the consumed response out of the queue
592− -- of expected responses.
593− processIncoming
594− :: Incremental t (PatchMap Int (Decoder rawResponse response))
595− -- A map of outstanding expected responses
596− -> Event t (Map Int rawResponse)
597− -- A incoming response paired with its identifying key
598− -> Event t (RequesterData response, PatchMap Int v)
599− -- The decoded response and a patch that clears the outstanding responses queue
600− processIncoming waitingFor inc = flip push inc $ \rspMap -> do
601− wf <- sample $ currentIncremental waitingFor
602− let match rawRsp (Decoder k rspF) =
603− let rsp = rspF rawRsp
604− in singletonRequesterData k rsp
605− matches = Map.intersectionWith match rspMap wf
606− pure $ if Map.null matches then Nothing else Just
607− (Map.foldl' mergeRequesterData emptyRequesterData matches, PatchMap $ Nothing <$ matches)
src/Reflex/Requester/Class.hs+1
@@ -6,6 +6,7 @@
66{-# LANGUAGE CPP #-}
77{-# LANGUAGE FlexibleInstances #-}
88{-# LANGUAGE FunctionalDependencies #-}
9+{-# LANGUAGE MultiParamTypeClasses #-}
910{-# LANGUAGE RecursiveDo #-}
1011{-# LANGUAGE TypeFamilies #-}
1112{-# LANGUAGE UndecidableInstances #-}
src/Reflex/Spider.hs+7−5
@@ -1,20 +1,22 @@
11{-# LANGUAGE CPP #-}
2−-- |
3−-- Module:
4−-- Reflex.Spider
5−-- Description:
6−-- This module exports all of the user-facing functionality of the 'Spider' 'Reflex' engine
2+-- | This module exports all of the user-facing functionality of the 'Spider'
3+-- 'Reflex' engine
74module Reflex.Spider
85 ( Spider
96 , SpiderTimeline
107 , Global
118 , SpiderHost
129 , runSpiderHost
10+#ifndef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
1311 , runSpiderHostForTimeline
1412 , newSpiderTimeline
1513 , withSpiderTimeline
14+#endif
1615 -- * Deprecated
1716 , SpiderEnv
1817 ) where
1918
19+#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
20+import Reflex.Class
21+#endif
2022import Reflex.Spider.Internal
src/Reflex/Spider/Internal.hs+506−977
@@ -9,49 +9,40 @@
99{-# LANGUAGE GADTs #-}
1010{-# LANGUAGE GeneralizedNewtypeDeriving #-}
1111{-# LANGUAGE LambdaCase #-}
12+{-# LANGUAGE MagicHash #-}
13+{-# LANGUAGE MultiParamTypeClasses #-}
14+{-# LANGUAGE MultiWayIf #-}
1215{-# LANGUAGE RankNTypes #-}
1316{-# LANGUAGE RoleAnnotations #-}
1417{-# LANGUAGE ScopedTypeVariables #-}
1518{-# LANGUAGE TypeFamilies #-}
1619{-# LANGUAGE TypeOperators #-}
1720{-# LANGUAGE UndecidableInstances #-}
18−{-# LANGUAGE PolyKinds #-}
19−{-# LANGUAGE DeriveFunctor #-}
20−{-# LANGUAGE StandaloneDeriving #-}
21−{-# LANGUAGE InstanceSigs #-}
22−{-# LANGUAGE MultiWayIf #-}
23−
2421#ifdef USE_REFLEX_OPTIMIZER
2522{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
2623#endif
27−{-# OPTIONS_GHC -Wunused-binds #-}
24+#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
25+{-# OPTIONS_GHC -fno-warn-orphans #-}
26+#endif
2827-- | This module is the implementation of the 'Spider' 'Reflex' engine. It uses
2928-- a graph traversal algorithm to propagate 'Event's and 'Behavior's.
3029module Reflex.Spider.Internal (module Reflex.Spider.Internal) where
3130
32−#if MIN_VERSION_base(4,10,0)
33−import Control.Applicative (liftA2)
34−#endif
31+import Control.Applicative
3532import Control.Concurrent
3633import Control.Exception
37−import Control.Monad hiding (forM, forM_, mapM, mapM_)
34+import Control.Monad hiding (forM, forM_, mapM, mapM_, sequence)
3835import Control.Monad.Exception
39−import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_)
36+import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_, sequence)
4037import Control.Monad.Primitive
41−import Control.Monad.Reader.Class
42−import Control.Monad.IO.Class
43−import Control.Monad.ReaderIO
38+import Control.Monad.Reader hiding (forM, forM_, mapM, mapM_, sequence)
4439import Control.Monad.Ref
45−import Control.Monad.Fail (MonadFail)
46−import qualified Control.Monad.Fail as MonadFail
4740import Data.Align
4841import Data.Coerce
49−import Data.Dependent.Map (DMap)
42+import Data.Dependent.Map (DMap, DSum (..))
5043import 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
5444import Data.Foldable hiding (concat, elem, sequence_)
45+import Data.Function
5546import Data.Functor.Constant
5647import Data.Functor.Misc
5748import Data.Functor.Product
@@ -59,73 +50,62 @@ import Data.GADT.Compare
5950import Data.IntMap.Strict (IntMap)
6051import qualified Data.IntMap.Strict as IntMap
6152import Data.IORef
62−import Data.Kind (Type)
63−import Data.Maybe hiding (mapMaybe)
64−import Data.Monoid (mempty, (<>))
53+import Data.List hiding (foldl')
54+import Data.Maybe
55+import Data.Monoid ((<>))
6556import Data.Proxy
6657import Data.These
6758import Data.Traversable
68−import Data.Type.Equality ((:~:)(Refl))
69−import Data.Witherable (Filterable, mapMaybe)
70−import GHC.Exts hiding (toList)
59+import Data.Word
60+import Data.FastMutableIntMap (FastMutableIntMap, PatchIntMap (..))
61+import qualified Data.FastMutableIntMap as FastMutableIntMap
62+import GHC.Exts
7163import GHC.IORef (IORef (..))
7264import GHC.Stack
7365import Reflex.FastWeak
66+import Reflex.FunctorMaybe
7467import System.IO.Unsafe
7568import System.Mem.Weak
7669import Unsafe.Coerce
7770
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−
8771#ifdef DEBUG_CYCLES
8872import Control.Monad.State hiding (forM, forM_, mapM, mapM_, sequence)
89−#endif
90−
9173import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
9274import qualified Data.List.NonEmpty as NonEmpty
75+import Data.Monoid (mempty)
9376import Data.Tree (Forest, Tree (..), drawForest)
94−import Data.List (isPrefixOf)
77+#endif
9578
96−import Data.FastWeakBag (FastWeakBag, FastWeakBagTicket)
79+import Data.FastWeakBag (FastWeakBag)
9780import qualified Data.FastWeakBag as FastWeakBag
98−
99−import Data.Reflection
100−import Data.Some (Some(Some))
101−import Data.Type.Coercion
102−import Data.Profunctor.Unsafe ((#.), (.#))
10381import Data.WeakBag (WeakBag, WeakBagTicket, _weakBag_children)
10482import qualified Data.WeakBag as WeakBag
83+#ifndef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
84+import Data.Reflection
85+import Data.Some (Some)
86+import qualified Data.Some as Some
87+import Data.Type.Coercion
10588import qualified Reflex.Class
10689import qualified Reflex.Class as R
10790import 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)
91+#endif
92+import Reflex.Patch
93+import qualified Reflex.Patch.DMapWithMove as PatchDMapWithMove
94+
95+-- Note: must come last to silence warnings due to AMP on GHC < 7.10
96+import Prelude hiding (any, concat, mapM, mapM_, sequence)
11297
11398#ifdef DEBUG_TRACE_EVENTS
114−import qualified Data.ByteString.Char8 as BS8
11599import System.IO (stderr)
116−import Data.List (isPrefixOf)
100+import qualified Data.ByteString.Char8 as BS8
117101#endif
118102
119−-- TODO stdout might not be the best channel for debug output
120−debugStrLn :: String -> IO ()
121−debugStrLn = putStrLn
122−
123103#ifdef DEBUG_TRACE_EVENTS
104+
124105withStackOneLine :: (BS8.ByteString -> a) -> a
125106withStackOneLine expr = unsafePerformIO $ do
126107 stack <- currentCallStack
127− return (expr . BS8.pack . unwords . dropInternal . reverse $ stack)
128− where dropInternal = filterStack "Reflex.Spider.Internal"
108+ return (expr (BS8.pack (unwords (reverse stack))))
129109
130110#endif
131111
@@ -136,42 +116,28 @@ debugInvalidateHeight :: Bool
136116debugInvalidate :: Bool
137117
138118#ifdef DEBUG
119+
139120#define DEBUG_NODEIDS
140121
141−#ifdef DEBUG_TRACE_PROPAGATION
142122debugPropagate = True
143−#else
144−debugPropagate = False
145−#endif
146123
147−#ifdef DEBUG_TRACE_HEIGHT
148−debugInvalidateHeight = True
149−#else
150124debugInvalidateHeight = False
151−#endif
152125
153−#ifdef DEBUG_TRACE_INVALIDATION
154126debugInvalidate = True
155−#else
156−debugInvalidate = False
157−#endif
158127
159128class HasNodeId a where
160129 getNodeId :: a -> Int
161130
162−instance HasNodeId (CacheSubscribed x a) where
163− getNodeId = _cacheSubscribed_nodeId
164−
165−instance HasNodeId (FanInt x a) where
166− getNodeId = _fanInt_nodeId
167−
168−instance HasNodeId (Hold x p) where
131+instance HasNodeId (Hold x p a) where
169132 getNodeId = holdNodeId
170133
134+instance HasNodeId (PushSubscribed x a b) where
135+ getNodeId = pushSubscribedNodeId
136+
171137instance HasNodeId (SwitchSubscribed x a) where
172138 getNodeId = switchSubscribedNodeId
173139
174−instance HasNodeId (FanSubscribed x v a) where
140+instance HasNodeId (FanSubscribed x a) where
175141 getNodeId = fanSubscribedNodeId
176142
177143instance HasNodeId (CoincidenceSubscribed x a) where
@@ -185,16 +151,41 @@ instance HasNodeId (Pull x a) where
185151
186152{-# INLINE showNodeId #-}
187153showNodeId :: HasNodeId a => a -> String
188−showNodeId = showNodeId' . getNodeId
189−
190−showNodeId' :: Int -> String
191−showNodeId' = ("#"<>) . show
192−
154+showNodeId = ("#"<>) . show . getNodeId
155+
156+showSubscriberType :: Subscriber x a -> String
157+showSubscriberType = \case
158+ SubscriberPush _ _ -> "SubscriberPush"
159+ SubscriberMerge _ _ -> "SubscriberMerge"
160+ SubscriberFan _ -> "SubscriberFan"
161+ SubscriberMergeChange _ -> "SubscriberMergeChange"
162+ SubscriberHold _ -> "SubscriberHold"
163+ SubscriberHoldIdentity _ -> "SubscriberHoldIdentity"
164+ SubscriberSwitch _ -> "SubscriberSwitch"
165+ SubscriberCoincidenceOuter _ -> "SubscriberCoincidenceOuter"
166+ SubscriberCoincidenceInner _ -> "SubscriberCoincidenceInner"
167+ SubscriberHandle -> "SubscriberHandle"
168+
169+showEventType :: Event x a -> String
170+showEventType = \case
171+ EventRoot _ _ -> "EventRoot"
172+ EventNever -> "EventNever"
173+ EventPush _ -> "EventPush"
174+ EventMerge _ -> "EventMerge"
175+ EventFan _ _ -> "EventFan"
176+ EventSwitch _ -> "EventSwitch"
177+ EventCoincidence _ -> "EventCoincidence"
178+ EventHold _ -> "EventHold"
179+ EventDyn _ -> "EventDyn"
180+ EventHoldIdentity _ -> "EventHoldIdentity"
181+ EventDynIdentity _ -> "EventDynIdentity"
193182
194183#else
195184
196185debugPropagate = False
186+
197187debugInvalidateHeight = False
188+
198189debugInvalidate = False
199190
200191-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
@@ -202,10 +193,6 @@ debugInvalidate = False
202193showNodeId :: a -> String
203194showNodeId _ = ""
204195
205−{-# INLINE showNodeId' #-}
206−showNodeId' :: Int -> String
207−showNodeId' _ = ""
208−
209196#endif
210197
211198#ifdef DEBUG_NODEIDS
@@ -215,6 +202,12 @@ nextNodeIdRef = unsafePerformIO $ newIORef 1
215202
216203newNodeId :: IO Int
217204newNodeId = atomicModifyIORef' nextNodeIdRef $ \n -> (succ n, n)
205+
206+{-# NOINLINE unsafeNodeId #-}
207+unsafeNodeId :: a -> Int
208+unsafeNodeId a = unsafePerformIO $ do
209+ touch a
210+ newNodeId
218211#endif
219212
220213--------------------------------------------------------------------------------
@@ -253,7 +246,7 @@ subscribeAndRead = unEvent
253246{-# INLINE [1] pushCheap #-}
254247pushCheap :: HasSpiderTimeline x => (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
255248pushCheap !f e = Event $ \sub -> do
256− (subscription, occ) <- subscribeAndRead e $ debugSubscriber' "push" $ sub
249+ (subscription, occ) <- subscribeAndRead e $ sub
257250 { subscriberPropagate = \a -> do
258251 mb <- f a
259252 mapM_ (subscriberPropagate sub) mb
@@ -272,10 +265,10 @@ terminalSubscriber p = Subscriber
272265
273266-- | Subscribe to an Event only for the duration of one occurrence
274267{-# INLINE subscribeAndReadHead #-}
275−subscribeAndReadHead :: HasSpiderTimeline x => Event x a -> Subscriber x a -> EventM x (EventSubscription x, Maybe a)
268+subscribeAndReadHead :: Event x a -> Subscriber x a -> EventM x (EventSubscription x, Maybe a)
276269subscribeAndReadHead e sub = do
277270 subscriptionRef <- liftIO $ newIORef $ error "subscribeAndReadHead: not initialized"
278− (subscription, occ) <- subscribeAndRead e $ debugSubscriber' "head" $ sub
271+ (subscription, occ) <- subscribeAndRead e $ sub
279272 { subscriberPropagate = \a -> do
280273 liftIO $ unsubscribe =<< readIORef subscriptionRef
281274 subscriberPropagate sub a
@@ -286,42 +279,24 @@ subscribeAndReadHead e sub = do
286279 return (subscription, occ)
287280
288281--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)
282+headE :: (MonadIO m, Defer (SomeMergeInit x) m) => Event x a -> m (Event x a)
290283headE originalE = do
291284 parent <- liftIO $ newIORef $ Just originalE
292285 defer $ SomeMergeInit $ do --TODO: Rename SomeMergeInit appropriately
293286 let clearParent = liftIO $ writeIORef parent Nothing
294− (_, occ) <- subscribeAndReadHead originalE $ terminalSubscriber $ const clearParent
287+ (_, occ) <- subscribeAndReadHead originalE $ terminalSubscriber $ \_ -> clearParent
295288 when (isJust occ) clearParent
296− return $ Event $ \sub ->
289+ return $ Event $ \sub -> do
297290 liftIO (readIORef parent) >>= \case
298− Nothing -> subscribeAndReadNever
291+ Nothing -> return (EventSubscription (return ()) $ EventSubscribed zeroRef $ toAny (), Nothing)
299292 Just e -> subscribeAndReadHead e sub
300293
301294data CacheSubscribed x a
302295 = CacheSubscribed { _cacheSubscribed_subscribers :: {-# UNPACK #-} !(FastWeakBag (Subscriber x a))
303296 , _cacheSubscribed_parent :: {-# UNPACK #-} !(EventSubscription x)
304297 , _cacheSubscribed_occurrence :: {-# UNPACK #-} !(IORef (Maybe a))
305−#ifdef DEBUG_NODEIDS
306− , _cacheSubscribed_nodeId :: {-# UNPACK #-} !Int
307−#endif
308298 }
309299
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−
325300-- | Construct an 'Event' whose value is guaranteed not to be recomputed
326301-- repeatedly
327302--
@@ -336,33 +311,27 @@ cacheEvent e =
336311#else
337312 Event $
338313#endif
339− unsafePerformIO $ do
340− mSubscribedRef :: IORef (FastWeak (CacheSubscribed x a))
341− <- newIORef emptyFastWeak
342− pure $ \sub -> {-# SCC "cacheEvent" #-} do
314+ let mSubscribedRef :: IORef (FastWeak (CacheSubscribed x a))
315+ !mSubscribedRef = unsafeNewIORef e emptyFastWeak
316+ in \sub -> {-# SCC "cacheEvent" #-} do
343317#ifdef DEBUG_TRACE_EVENTS
344318 unless (BS8.null callSite) $ liftIO $ BS8.hPutStrLn stderr callSite
345319#endif
346320 subscribedTicket <- liftIO (readIORef mSubscribedRef >>= getFastWeakTicket) >>= \case
347321 Just subscribedTicket -> return subscribedTicket
348322 Nothing -> do
349−#ifdef DEBUG_NODEIDS
350− nodeId <- liftIO newNodeId
351−#endif
352323 subscribers <- liftIO FastWeakBag.empty
353324 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
357325 (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− }
326+ { subscriberPropagate = \a -> do
327+ liftIO $ writeIORef occRef $ Just a
328+ scheduleClear occRef
329+ propagateFast a subscribers
330+ , subscriberInvalidateHeight = \old -> do
331+ FastWeakBag.traverse subscribers $ invalidateSubscriberHeight old
332+ , subscriberRecalculateHeight = \new -> do
333+ FastWeakBag.traverse subscribers $ recalculateSubscriberHeight new
334+ }
366335 when (isJust occ) $ do
367336 liftIO $ writeIORef occRef occ -- Set the initial value of occRef; we don't need to do this if occ is Nothing
368337 scheduleClear occRef
@@ -370,45 +339,29 @@ cacheEvent e =
370339 { _cacheSubscribed_subscribers = subscribers
371340 , _cacheSubscribed_parent = parentSub
372341 , _cacheSubscribed_occurrence = occRef
373−#ifdef DEBUG_NODEIDS
374− , _cacheSubscribed_nodeId = nodeId
375−#endif
376342 }
377343 subscribedTicket <- liftIO $ mkFastWeakTicket subscribed
378344 liftIO $ writeIORef mSubscribedRef =<< getFastWeakTicketWeak subscribedTicket
379345 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−
346+ liftIO $ do
347+ subscribed <- getFastWeakTicketValue subscribedTicket
348+ ticket <- FastWeakBag.insert sub $ _cacheSubscribed_subscribers subscribed
349+ occ <- readIORef $ _cacheSubscribed_occurrence subscribed
350+ let es = EventSubscription
351+ { _eventSubscription_unsubscribe = do
352+ FastWeakBag.remove ticket
353+ isEmpty <- FastWeakBag.isEmpty $ _cacheSubscribed_subscribers subscribed
354+ when isEmpty $ do
355+ writeIORef mSubscribedRef emptyFastWeak
356+ unsubscribe $ _cacheSubscribed_parent subscribed
357+ touch ticket
358+ touch subscribedTicket
359+ , _eventSubscription_subscribed = EventSubscribed
360+ { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ _cacheSubscribed_parent subscribed
361+ , eventSubscribedRetained = toAny subscribedTicket
362+ }
363+ }
364+ return (es, occ)
412365
413366subscribe :: Event x a -> Subscriber x a -> EventM x (EventSubscription x)
414367subscribe e s = fst <$> subscribeAndRead e s
@@ -420,16 +373,13 @@ wrap tag getSpecificSubscribed sub = do
420373 let es = tag subd
421374 return (EventSubscription (WeakBag.remove sln >> touch sln) es, occ)
422375
423−eventRoot :: (GCompare k, HasSpiderTimeline x) => k a -> Root x k -> Event x a
376+eventRoot :: GCompare k => k a -> Root x k -> Event x a
424377eventRoot !k !r = Event $ wrap eventSubscribedRoot $ liftIO . getRootSubscribed k r
425378
426−subscribeAndReadNever :: EventM x (EventSubscription x, Maybe a)
427−subscribeAndReadNever = return (EventSubscription (return ()) eventSubscribedNever, Nothing)
428−
429379eventNever :: Event x a
430−eventNever = Event $ const subscribeAndReadNever
380+eventNever = Event $ \_ -> return (EventSubscription (return ()) eventSubscribedNever, Nothing)
431381
432−eventFan :: (GCompare k, HasSpiderTimeline x) => k a -> Fan x k v -> Event x (v a)
382+eventFan :: (GCompare k, HasSpiderTimeline x) => k a -> Fan x k -> Event x a
433383eventFan !k !f = Event $ wrap eventSubscribedFan $ getFanSubscribed k f
434384
435385eventSwitch :: HasSpiderTimeline x => Switch x a -> Event x a
@@ -438,7 +388,7 @@ eventSwitch !s = Event $ wrap eventSubscribedSwitch $ getSwitchSubscribed s
438388eventCoincidence :: HasSpiderTimeline x => Coincidence x a -> Event x a
439389eventCoincidence !c = Event $ wrap eventSubscribedCoincidence $ getCoincidenceSubscribed c
440390
441−eventHold :: Hold x p -> Event x p
391+eventHold :: HasSpiderTimeline x => Hold x p -> Event x p
442392eventHold !h = Event $ subscribeHoldEvent h
443393
444394eventDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> Event x p
@@ -464,6 +414,16 @@ data Subscriber x a = Subscriber
464414 , subscriberRecalculateHeight :: !(Height -> IO ())
465415 }
466416
417+--TODO: Move this comment to WeakBag
418+-- These function are constructor functions that are marked NOINLINE so they are
419+-- opaque to GHC. If we do not do this, then GHC will sometimes fuse the constructor away
420+-- so any weak references that are attached to the constructors will have their
421+-- finalizer run. Using the opaque constructor, does not see the
422+-- constructor application, so it behaves like an IORef and cannot be fused away.
423+--
424+-- The result is also evaluated to WHNF, since forcing a thunk invalidates
425+-- the weak pointer to it in some cases.
426+
467427newSubscriberHold :: (HasSpiderTimeline x, Patch p) => Hold x p -> IO (Subscriber x p)
468428newSubscriberHold h = return $ Subscriber
469429 { subscriberPropagate = {-# SCC "traverseHold" #-} propagateSubscriberHold h
@@ -471,68 +431,85 @@ newSubscriberHold h = return $ Subscriber
471431 , subscriberRecalculateHeight = \_ -> return ()
472432 }
473433
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
434+newSubscriberFan :: forall x k. (HasSpiderTimeline x, GCompare k) => FanSubscribed x k -> IO (Subscriber x (DMap k Identity))
435+newSubscriberFan subscribed = return $ Subscriber
476436 { subscriberPropagate = \a -> {-# SCC "traverseFan" #-} do
477437 subs <- liftIO $ readIORef $ fanSubscribedSubscribers subscribed
478− tracePropagate (Proxy :: Proxy x) $ show (DMap.size subs) <> " keys subscribed, " <> show (DMap.size a) <> " keys firing"
438+ tracePropagate (Proxy :: Proxy x) $ "SubscriberFan" <> showNodeId subscribed <> ": " ++ show (DMap.size subs) ++ " keys subscribed, " ++ show (DMap.size a) ++ " keys firing"
479439 liftIO $ writeIORef (fanSubscribedOccurrence subscribed) $ Just a
480440 scheduleClear $ fanSubscribedOccurrence subscribed
481− let f _ (Pair v subsubs) = do
441+ let f _ (Pair (Identity v) subsubs) = do
482442 propagate v $ _fanSubscribedChildren_list subsubs
483443 return $ Constant ()
484444 _ <- DMap.traverseWithKey f $ DMap.intersectionWithKey (\_ -> Pair) a subs --TODO: Would be nice to have DMap.traverse_
485445 return ()
486446 , subscriberInvalidateHeight = \old -> do
447+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
487448 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
488− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
449+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
450+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
489451 , subscriberRecalculateHeight = \new -> do
452+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
490453 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
491− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
454+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
455+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
492456 }
493457
494458newSubscriberSwitch :: forall x a. HasSpiderTimeline x => SwitchSubscribed x a -> IO (Subscriber x a)
495−newSubscriberSwitch subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
459+newSubscriberSwitch subscribed = return $ Subscriber
496460 { subscriberPropagate = \a -> {-# SCC "traverseSwitch" #-} do
461+ tracePropagate (Proxy :: Proxy x) $ "SubscriberSwitch" <> showNodeId subscribed
497462 liftIO $ writeIORef (switchSubscribedOccurrence subscribed) $ Just a
498463 scheduleClear $ switchSubscribedOccurrence subscribed
499464 propagate a $ switchSubscribedSubscribers subscribed
500465 , subscriberInvalidateHeight = \_ -> do
466+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
501467 oldHeight <- readIORef $ switchSubscribedHeight subscribed
502468 when (oldHeight /= invalidHeight) $ do
503469 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
504− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
505− , subscriberRecalculateHeight = (`updateSwitchHeight` subscribed)
506− }
470+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
471+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
472+ , subscriberRecalculateHeight = \new -> do
473+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
474+ updateSwitchHeight new subscribed
475+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
476+ }
507477
508478newSubscriberCoincidenceOuter :: forall x b. HasSpiderTimeline x => CoincidenceSubscribed x b -> IO (Subscriber x (Event x b))
509−newSubscriberCoincidenceOuter subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
479+newSubscriberCoincidenceOuter subscribed = return $ Subscriber
510480 { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceOuter" #-} do
481+ tracePropagate (Proxy :: Proxy x) $ "SubscriberCoincidenceOuter" <> showNodeId subscribed
511482 outerHeight <- liftIO $ readIORef $ coincidenceSubscribedHeight subscribed
512483 tracePropagate (Proxy :: Proxy x) $ " outerHeight = " <> show outerHeight
513484 (occ, innerHeight, innerSubd) <- subscribeCoincidenceInner a outerHeight subscribed
514485 tracePropagate (Proxy :: Proxy x) $ " isJust occ = " <> show (isJust occ)
515486 tracePropagate (Proxy :: Proxy x) $ " innerHeight = " <> show innerHeight
516−
517487 liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
518488 scheduleClear $ coincidenceSubscribedInnerParent subscribed
519489 case occ of
520− Nothing ->
490+ Nothing -> do
521491 when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
522492 writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
523− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
524− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
493+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
494+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
525495 Just o -> do -- Since it's already firing, no need to adjust height
526496 liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
527497 scheduleClear $ coincidenceSubscribedOccurrence subscribed
528498 propagate o $ coincidenceSubscribedSubscribers subscribed
529− , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
530− , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
499+ , subscriberInvalidateHeight = \_ -> do
500+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
501+ invalidateCoincidenceHeight subscribed
502+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
503+ , subscriberRecalculateHeight = \_ -> do
504+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
505+ recalculateCoincidenceHeight subscribed
506+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
531507 }
532508
533509newSubscriberCoincidenceInner :: forall x a. HasSpiderTimeline x => CoincidenceSubscribed x a -> IO (Subscriber x a)
534−newSubscriberCoincidenceInner subscribed = debugSubscriber ("SubscriberCoincidenceInner" <> showNodeId subscribed) $ Subscriber
510+newSubscriberCoincidenceInner subscribed = return $ Subscriber
535511 { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceInner" #-} do
512+ tracePropagate (Proxy :: Proxy x) $ "SubscriberCoincidenceInner" <> showNodeId subscribed
536513 occ <- liftIO $ readIORef $ coincidenceSubscribedOccurrence subscribed
537514 case occ of
538515 Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
@@ -540,8 +517,14 @@ newSubscriberCoincidenceInner subscribed = debugSubscriber ("SubscriberCoinciden
540517 liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $ Just a
541518 scheduleClear $ coincidenceSubscribedOccurrence subscribed
542519 propagate a $ coincidenceSubscribedSubscribers subscribed
543− , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
544− , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
520+ , subscriberInvalidateHeight = \_ -> do
521+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
522+ invalidateCoincidenceHeight subscribed
523+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
524+ , subscriberRecalculateHeight = \_ -> do
525+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
526+ recalculateCoincidenceHeight subscribed
527+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
545528 }
546529
547530invalidateSubscriberHeight :: Height -> Subscriber x a -> IO ()
@@ -551,18 +534,18 @@ recalculateSubscriberHeight :: Height -> Subscriber x a -> IO ()
551534recalculateSubscriberHeight = flip subscriberRecalculateHeight
552535
553536-- | 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) $
537+propagate :: a -> WeakBag (Subscriber x a) -> EventM x ()
538+propagate a subscribers = withIncreasedDepth $ do
556539 -- 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
557540 --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
541+ WeakBag.traverse subscribers $ \s -> subscriberPropagate s a
559542
560543-- | 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) $
544+propagateFast :: a -> FastWeakBag (Subscriber x a) -> EventM x ()
545+propagateFast a subscribers = withIncreasedDepth $ do
563546 -- 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
564547 --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
548+ FastWeakBag.traverse subscribers $ \s -> subscriberPropagate s a
566549
567550--------------------------------------------------------------------------------
568551-- EventSubscribed
@@ -571,16 +554,11 @@ propagateFast a subscribers = withIncreasedDepth (Proxy::Proxy x) $
571554toAny :: a -> Any
572555toAny = unsafeCoerce
573556
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.
579557data EventSubscribed x = EventSubscribed
580558 { eventSubscribedHeightRef :: {-# UNPACK #-} !(IORef Height)
581559 , eventSubscribedRetained :: {-# NOUNPACK #-} !Any
582560#ifdef DEBUG_CYCLES
583− , eventSubscribedGetParents :: !(IO [EventSubscribed x]) -- For debugging loops
561+ , eventSubscribedGetParents :: !(IO [Some (EventSubscribed x)]) -- For debugging loops
584562 , eventSubscribedHasOwnHeightRef :: !Bool
585563 , eventSubscribedWhoCreated :: !(IO [String])
586564#endif
@@ -607,23 +585,13 @@ eventSubscribedNever = EventSubscribed
607585 , eventSubscribedWhoCreated = return ["never"]
608586#endif
609587 }
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− }
620588
621−eventSubscribedFan :: FanSubscribed x k v -> EventSubscribed x
589+eventSubscribedFan :: FanSubscribed x k -> EventSubscribed x
622590eventSubscribedFan !subscribed = EventSubscribed
623591 { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
624592 , eventSubscribedRetained = toAny subscribed
625593#ifdef DEBUG_CYCLES
626− , eventSubscribedGetParents = return [_eventSubscription_subscribed $ fanSubscribedParent subscribed]
594+ , eventSubscribedGetParents = return [Some.This $ _eventSubscription_subscribed $ fanSubscribedParent subscribed]
627595 , eventSubscribedHasOwnHeightRef = False
628596 , eventSubscribedWhoCreated = whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
629597#endif
@@ -636,7 +604,7 @@ eventSubscribedSwitch !subscribed = EventSubscribed
636604#ifdef DEBUG_CYCLES
637605 , eventSubscribedGetParents = do
638606 s <- readIORef $ switchSubscribedCurrentParent subscribed
639− return [_eventSubscription_subscribed s]
607+ return [Some.This $ _eventSubscription_subscribed s]
640608 , eventSubscribedHasOwnHeightRef = True
641609 , eventSubscribedWhoCreated = whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
642610#endif
@@ -649,8 +617,8 @@ eventSubscribedCoincidence !subscribed = EventSubscribed
649617#ifdef DEBUG_CYCLES
650618 , eventSubscribedGetParents = do
651619 innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
652− let outerParent = _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
653− innerParents = maybeToList $ innerSubscription
620+ let outerParent = Some.This $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
621+ innerParents = maybeToList $ fmap Some.This innerSubscription
654622 return $ outerParent : innerParents
655623 , eventSubscribedHasOwnHeightRef = True
656624 , eventSubscribedWhoCreated = whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
@@ -664,20 +632,20 @@ getEventSubscribedHeight es = readIORef $ eventSubscribedHeightRef es
664632whoCreatedEventSubscribed :: EventSubscribed x -> IO [String]
665633whoCreatedEventSubscribed = eventSubscribedWhoCreated
666634
667−walkInvalidHeightParents :: EventSubscribed x -> IO [EventSubscribed x]
635+walkInvalidHeightParents :: EventSubscribed x -> IO [Some (EventSubscribed x)]
668636walkInvalidHeightParents s0 = do
669− subscribers <- flip execStateT mempty $ ($ s0) $ fix $ \loop s -> do
637+ subscribers <- flip execStateT mempty $ ($ Some.This s0) $ fix $ \loop (Some.This s) -> do
670638 h <- liftIO $ readIORef $ eventSubscribedHeightRef s
671639 when (h == invalidHeight) $ do
672640 when (eventSubscribedHasOwnHeightRef s) $ liftIO $ writeIORef (eventSubscribedHeightRef s) $! invalidHeightBeingTraversed
673− modify (s :)
641+ modify (Some.This s :)
674642 mapM_ loop =<< liftIO (eventSubscribedGetParents s)
675− forM_ subscribers $ \s -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
643+ forM_ subscribers $ \(Some.This s) -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
676644 return subscribers
677645#endif
678646
679647{-# INLINE subscribeHoldEvent #-}
680−subscribeHoldEvent :: Hold x p -> Subscriber x p -> EventM x (EventSubscription x, Maybe p)
648+subscribeHoldEvent :: HasSpiderTimeline x => Hold x p -> Subscriber x p -> EventM x (EventSubscription x, Maybe p)
681649subscribeHoldEvent = subscribeAndRead . holdEvent
682650
683651--------------------------------------------------------------------------------
@@ -700,7 +668,7 @@ behaviorPull !p = Behavior $ do
700668 val <- liftIO $ readIORef $ pullValue p
701669 case val of
702670 Just subscribed -> do
703− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedPull subscribed)) :))
671+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
704672 askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (pullSubscribedInvalidators subscribed) (wi:))
705673 liftIO $ touch $ pullSubscribedOwnInvalidator subscribed
706674 return $ pullSubscribedValue subscribed
@@ -709,7 +677,7 @@ behaviorPull !p = Behavior $ do
709677 wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorPull"
710678 parentsRef <- liftIO $ newIORef []
711679 holdInits <- askBehaviorHoldInits
712− a <- liftIO $ runReaderIO (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
680+ a <- liftIO $ runReaderT (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
713681 invsRef <- liftIO . newIORef . maybeToList =<< askInvalidator
714682 parents <- liftIO $ readIORef parentsRef
715683 let subscribed = PullSubscribed
@@ -719,7 +687,7 @@ behaviorPull !p = Behavior $ do
719687 , pullSubscribedParents = parents
720688 }
721689 liftIO $ writeIORef (pullValue p) $ Just subscribed
722− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (Some (BehaviorSubscribedPull subscribed)) :))
690+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
723691 return a
724692
725693behaviorDyn :: Patch p => Dyn x p -> Behavior x (PatchTarget p)
@@ -730,8 +698,7 @@ readHoldTracked :: Hold x p -> BehaviorM x (PatchTarget p)
730698readHoldTracked h = do
731699 result <- liftIO $ readIORef $ holdValue h
732700 askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (holdInvalidators h) (wi:))
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
701+ askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedHold h) :))
735702 return result
736703
737704{-# INLINABLE readBehaviorUntracked #-}
@@ -744,46 +711,42 @@ readBehaviorUntracked b = do
744711-- Dynamic
745712--------------------------------------------------------------------------------
746713
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`?
714+data Dynamic x p = Dynamic
715+ { dynamicCurrent :: !(Behavior x (PatchTarget p))
716+ , dynamicUpdated :: !(Event x p)
752717 }
753718
754−deriving instance (HasSpiderTimeline x) => Functor (Dynamic x target)
755−
756−
757−
758−
759−dynamicHold :: Hold x p -> DynamicS x p
719+dynamicHold :: HasSpiderTimeline x => Hold x p -> Dynamic x p
760720dynamicHold !h = Dynamic
761721 { dynamicCurrent = behaviorHold h
762722 , dynamicUpdated = eventHold h
763723 }
764724
765−dynamicHoldIdentity :: Hold x (Identity a) -> DynamicS x (Identity a)
725+dynamicHoldIdentity :: HasSpiderTimeline x => Hold x (Identity a) -> Dynamic x (Identity a)
766726dynamicHoldIdentity = dynamicHold
767727
768−dynamicConst :: PatchTarget p -> DynamicS x p
728+dynamicConst :: PatchTarget p -> Dynamic x p
769729dynamicConst !a = Dynamic
770730 { dynamicCurrent = behaviorConst a
771731 , dynamicUpdated = eventNever
772732 }
773733
774−dynamicDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> DynamicS x p
734+dynamicDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> Dynamic x p
775735dynamicDyn !d = Dynamic
776736 { dynamicCurrent = behaviorDyn d
777737 , dynamicUpdated = eventDyn d
778738 }
779739
780−dynamicDynIdentity :: HasSpiderTimeline x => Dyn x (Identity a) -> DynamicS x (Identity a)
740+dynamicDynIdentity :: HasSpiderTimeline x => Dyn x (Identity a) -> Dynamic x (Identity a)
781741dynamicDynIdentity = dynamicDyn
782742
783743--------------------------------------------------------------------------------
784744-- Combinators
785745--------------------------------------------------------------------------------
786746
747+--TODO: Figure out why certain things are not 'representational', then make them
748+--representational so we can use coerce
749+
787750--type role Hold representational
788751data Hold x p
789752 = Hold { holdValue :: !(IORef (PatchTarget p))
@@ -795,7 +758,9 @@ data Hold x p
795758#endif
796759 }
797760
798−-- | A statically allocated 'SpiderTimeline'
761+-- | A statically allocated 'SpiderTimeline'; this is the only instance of
762+-- 'SpiderTimeline' that can used when using
763+-- -fspecialize-to-spidertimeline-global.
799764data Global
800765
801766{-# NOINLINE globalSpiderTimelineEnv #-}
@@ -804,27 +769,30 @@ globalSpiderTimelineEnv = unsafePerformIO unsafeNewSpiderTimelineEnv
804769
805770-- | Stores all global data relevant to a particular Spider timeline; only one
806771-- 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
772+data SpiderTimelineEnv x = SpiderTimelineEnv
813773 { _spiderTimeline_lock :: {-# UNPACK #-} !(MVar ())
814774 , _spiderTimeline_eventEnv :: {-# UNPACK #-} !(EventEnv x)
815775#ifdef DEBUG
816776 , _spiderTimeline_depth :: {-# UNPACK #-} !(IORef Int)
817777#endif
818778 }
819−type role SpiderTimelineEnv' phantom
779+type role SpiderTimelineEnv nominal
820780
821781instance Eq (SpiderTimelineEnv x) where
822782 _ == _ = True -- Since only one exists of each type
823783
824784instance GEq SpiderTimelineEnv where
825− a `geq` b = if _spiderTimeline_lock (unSTE a) == _spiderTimeline_lock (unSTE b)
785+#ifdef EXPERIMENTAL_DEPENDENT_SUM_INSTANCES
786+ geqToEq _ = id
787+ geqUnify (a :: SpiderTimelineEnv a) (b :: SpiderTimelineEnv b) different same = if _spiderTimeline_lock a == _spiderTimeline_lock b
788+ then case unsafeCoerce Refl :: a :~: b of
789+ Refl -> same -- This unsafeCoerce is safe because the same SpiderTimelineEnv can't have two different 'x' arguments
790+ else different
791+#else
792+ a `geq` b = if _spiderTimeline_lock a == _spiderTimeline_lock b
826793 then Just $ unsafeCoerce Refl -- This unsafeCoerce is safe because the same SpiderTimelineEnv can't have two different 'x' arguments
827794 else Nothing
795+#endif
828796
829797data EventEnv x
830798 = EventEnv { eventEnvAssignments :: !(IORef [SomeAssignment x]) -- Needed for Subscribe
@@ -832,9 +800,9 @@ data EventEnv x
832800 , eventEnvDynInits :: !(IORef [SomeDynInit x])
833801 , eventEnvMergeUpdates :: !(IORef [SomeMergeUpdate x])
834802 , eventEnvMergeInits :: !(IORef [SomeMergeInit x]) -- Needed for Subscribe
835− , eventEnvClears :: !(IORef [Some Clear]) -- Needed for Subscribe
836− , eventEnvIntClears :: !(IORef [Some IntClear])
837− , eventEnvRootClears :: !(IORef [Some RootClear])
803+ , eventEnvClears :: !(IORef [SomeClear]) -- Needed for Subscribe
804+ , eventEnvIntClears :: !(IORef [SomeIntClear])
805+ , eventEnvRootClears :: !(IORef [SomeRootClear])
838806 , eventEnvCurrentHeight :: !(IORef Height) -- Needed for Subscribe
839807 , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence x]) -- Needed for Subscribe
840808 , eventEnvDelayedMerges :: !(IORef (IntMap [EventM x ()]))
@@ -845,7 +813,7 @@ runEventM :: EventM x a -> IO a
845813runEventM = unEventM
846814
847815asksEventEnv :: forall x a. HasSpiderTimeline x => (EventEnv x -> a) -> EventM x a
848−asksEventEnv f = return $ f $ _spiderTimeline_eventEnv (unSTE (spiderTimeline :: SpiderTimelineEnv x))
816+asksEventEnv f = return $ f $ _spiderTimeline_eventEnv (spiderTimeline :: SpiderTimelineEnv x)
849817
850818class MonadIO m => Defer a m where
851819 getDeferralQueue :: m (IORef [a])
@@ -894,7 +862,11 @@ instance HasSpiderTimeline x => HasCurrentHeight x (EventM x) where
894862 delayedRef <- asksEventEnv eventEnvDelayedMerges
895863 liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [subscribed]
896864
865+#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
866+class x ~ Global => HasSpiderTimeline x where
867+#else
897868class HasSpiderTimeline x where
869+#endif
898870 -- | Retrieve the current SpiderTimelineEnv
899871 spiderTimeline :: SpiderTimelineEnv x
900872
@@ -906,29 +878,29 @@ putCurrentHeight h = do
906878 heightRef <- asksEventEnv eventEnvCurrentHeight
907879 liftIO $ writeIORef heightRef $! h
908880
909−instance HasSpiderTimeline x => Defer (Some Clear) (EventM x) where
881+instance HasSpiderTimeline x => Defer SomeClear (EventM x) where
910882 {-# INLINE getDeferralQueue #-}
911883 getDeferralQueue = asksEventEnv eventEnvClears
912884
913885{-# INLINE scheduleClear #-}
914−scheduleClear :: Defer (Some Clear) m => IORef (Maybe a) -> m ()
915−scheduleClear r = defer $ Some $ Clear r
886+scheduleClear :: Defer SomeClear m => IORef (Maybe a) -> m ()
887+scheduleClear r = defer $ SomeClear r
916888
917−instance HasSpiderTimeline x => Defer (Some IntClear) (EventM x) where
889+instance HasSpiderTimeline x => Defer SomeIntClear (EventM x) where
918890 {-# INLINE getDeferralQueue #-}
919891 getDeferralQueue = asksEventEnv eventEnvIntClears
920892
921893{-# INLINE scheduleIntClear #-}
922−scheduleIntClear :: Defer (Some IntClear) m => IORef (IntMap a) -> m ()
923−scheduleIntClear r = defer $ Some $ IntClear r
894+scheduleIntClear :: Defer SomeIntClear m => IORef (IntMap a) -> m ()
895+scheduleIntClear r = defer $ SomeIntClear r
924896
925−instance HasSpiderTimeline x => Defer (Some RootClear) (EventM x) where
897+instance HasSpiderTimeline x => Defer SomeRootClear (EventM x) where
926898 {-# INLINE getDeferralQueue #-}
927899 getDeferralQueue = asksEventEnv eventEnvRootClears
928900
929901{-# INLINE scheduleRootClear #-}
930−scheduleRootClear :: Defer (Some RootClear) m => IORef (DMap k Identity) -> m ()
931−scheduleRootClear r = defer $ Some $ RootClear r
902+scheduleRootClear :: Defer SomeRootClear m => IORef (DMap k Identity) -> m ()
903+scheduleRootClear r = defer $ SomeRootClear r
932904
933905instance HasSpiderTimeline x => Defer (SomeResetCoincidence x) (EventM x) where
934906 {-# INLINE getDeferralQueue #-}
@@ -983,9 +955,9 @@ getHoldEventSubscription h = do
983955
984956type BehaviorEnv x = (Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]), IORef [SomeHoldInit x])
985957
958+--type role BehaviorM representational
986959-- BehaviorM can sample behaviors
987−newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderIO (BehaviorEnv x) a }
988− deriving (Functor, Applicative, MonadIO, MonadFix, MonadReader (BehaviorEnv x))
960+newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderT (BehaviorEnv x) IO a } deriving (Functor, Applicative, MonadIO, MonadFix)
989961
990962instance Monad (BehaviorM x) where
991963 {-# INLINE (>>=) #-}
@@ -994,16 +966,14 @@ instance Monad (BehaviorM x) where
994966 BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
995967 {-# INLINE return #-}
996968 return x = BehaviorM $ return x
997−#if !MIN_VERSION_base(4,13,0)
998969 {-# INLINE fail #-}
999970 fail s = BehaviorM $ fail s
1000−#endif
1001971
1002972data BehaviorSubscribed x a
1003973 = forall p. BehaviorSubscribedHold (Hold x p)
1004974 | BehaviorSubscribedPull (PullSubscribed x a)
1005975
1006−newtype SomeBehaviorSubscribed x = SomeBehaviorSubscribed (Some (BehaviorSubscribed x))
976+data SomeBehaviorSubscribed x = forall a. SomeBehaviorSubscribed (BehaviorSubscribed x a)
1007977
1008978--type role PullSubscribed representational
1009979data PullSubscribed x a
@@ -1038,7 +1008,7 @@ data RootSubscribed x a = forall k. GCompare k => RootSubscribed
10381008#endif
10391009 }
10401010
1041−data Root x k
1011+data Root x (k :: * -> *)
10421012 = Root { rootOccurrence :: !(IORef (DMap k Identity)) -- The currently-firing occurrence of this event
10431013 , rootSubscribed :: !(IORef (DMap k (RootSubscribed x)))
10441014 , rootInit :: !(forall a. k a -> RootTrigger x a -> IO (IO ()))
@@ -1057,7 +1027,7 @@ data SomeMergeUpdate x = SomeMergeUpdate
10571027newtype SomeMergeInit x = SomeMergeInit { unSomeMergeInit :: EventM x () }
10581028
10591029-- 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)
1030+newtype EventM x a = EventM { unEventM :: 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
10611031
10621032newtype MergeSubscribedParent x a = MergeSubscribedParent { unMergeSubscribedParent :: EventSubscription x }
10631033
@@ -1082,8 +1052,7 @@ heightBagFromList :: [Height] -> HeightBag
10821052heightBagFromList heights = heightBagVerify $ foldl' (flip heightBagAdd) heightBagEmpty heights
10831053
10841054heightBagAdd :: Height -> HeightBag -> HeightBag
1085−heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $
1086− IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
1055+heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
10871056
10881057heightBagRemove :: Height -> HeightBag -> HeightBag
10891058heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.lookup h c of
@@ -1092,13 +1061,6 @@ heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.loo
10921061 0 -> IntMap.delete h c
10931062 _ -> IntMap.insert h (pred old) c
10941063
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−
11021064heightBagMax :: HeightBag -> Height
11031065heightBagMax (HeightBag _ c) = case IntMap.maxViewWithKey c of
11041066 Just ((h, _), _) -> Height h
@@ -1116,25 +1078,25 @@ heightBagVerify b@(HeightBag s c) = if
11161078heightBagVerify = id
11171079#endif
11181080
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)))
1081+data FanSubscribedChildren (x :: *) k a = FanSubscribedChildren
1082+ { _fanSubscribedChildren_list :: !(WeakBag (Subscriber x a))
1083+ , _fanSubscribedChildren_self :: {-# NOUNPACK #-} !(k a, FanSubscribed x k)
1084+ , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed x k)))
11231085 }
11241086
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
1087+data FanSubscribed (x :: *) k
1088+ = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed x k)))
1089+ , fanSubscribedOccurrence :: !(IORef (Maybe (DMap k Identity)))
1090+ , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren x k))) -- This DMap should never be empty
11291091 , fanSubscribedParent :: !(EventSubscription x)
11301092#ifdef DEBUG_NODEIDS
11311093 , fanSubscribedNodeId :: Int
11321094#endif
11331095 }
11341096
1135−data Fan x k v
1136− = Fan { fanParent :: !(Event x (DMap k v))
1137− , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k v)))
1097+data Fan x k
1098+ = Fan { fanParent :: !(Event x (DMap k Identity))
1099+ , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k)))
11381100 }
11391101
11401102data SwitchSubscribed x a
@@ -1188,35 +1150,20 @@ newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
11881150newInvalidatorPull :: Pull x a -> IO (Invalidator x)
11891151newInvalidatorPull p = return $! InvalidatorPull p
11901152
1191−instance HasSpiderTimeline x => Filterable (Event x) where
1192− mapMaybe f = push $ return . f
1153+instance HasSpiderTimeline x => FunctorMaybe (Event x) where
1154+ fmapMaybe f = push $ return . f
11931155
11941156instance HasSpiderTimeline x => Align (Event x) where
11951157 nil = eventNever
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
1208−
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)
1158+ align ea eb = fmapMaybe dmapToThese $ merge $ dynamicConst $ DMap.fromDistinctAscList [LeftTag :=> ea, RightTag :=> eb]
12121159
1213−newtype Dyn (x :: Type) p = Dyn { unDyn :: IORef (DynType x p) }
1160+newtype Dyn x p = Dyn { unDyn :: IORef (Either (BehaviorM x (PatchTarget p), Event x p) (Hold x p)) }
12141161
1215−newMapDyn :: HasSpiderTimeline x => (a -> b) -> DynamicS x (Identity a) -> DynamicS x (Identity b)
1162+newMapDyn :: HasSpiderTimeline x => (a -> b) -> Dynamic x (Identity a) -> Dynamic x (Identity b)
12161163newMapDyn f d = dynamicDynIdentity $ unsafeBuildDynamic (fmap f $ readBehaviorTracked $ dynamicCurrent d) (Identity . f . runIdentity <$> dynamicUpdated d)
12171164
12181165--TODO: Avoid the duplication between this and R.zipDynWith
1219−zipDynWith :: HasSpiderTimeline x => (a -> b -> c) -> DynamicS x (Identity a) -> DynamicS x (Identity b) -> DynamicS x (Identity c)
1166+zipDynWith :: HasSpiderTimeline x => (a -> b -> c) -> Dynamic x (Identity a) -> Dynamic x (Identity b) -> Dynamic x (Identity c)
12201167zipDynWith f da db =
12211168 let eab = align (dynamicUpdated da) (dynamicUpdated db)
12221169 ec = flip push eab $ \o -> do
@@ -1231,20 +1178,26 @@ zipDynWith f da db =
12311178 return $ Just $ Identity $ f a b
12321179 in dynamicDynIdentity $ unsafeBuildDynamic (f <$> readBehaviorUntracked (dynamicCurrent da) <*> readBehaviorUntracked (dynamicCurrent db)) ec
12331180
1234−buildDynamic :: (Defer (SomeDynInit x) m, Patch p) => EventM x (PatchTarget p) -> Event x p -> m (Dyn x p)
1181+buildDynamic :: (Defer (SomeDynInit x) m, Patch p) => BehaviorM x (PatchTarget p) -> Event x p -> m (Dyn x p)
12351182buildDynamic readV0 v' = do
1236− result <- liftIO $ newIORef $ BuildDyn (readV0, v')
1183+ result <- liftIO $ newIORef $ Left (readV0, v')
12371184 let !d = Dyn result
12381185 defer $ SomeDynInit d
12391186 return d
12401187
12411188unsafeBuildDynamic :: BehaviorM x (PatchTarget p) -> Event x p -> Dyn x p
1242−unsafeBuildDynamic readV0 v' =
1243− Dyn $ unsafePerformIO $ newIORef $ UnsafeDyn (readV0, v')
1189+unsafeBuildDynamic readV0 v' = Dyn $ unsafeNewIORef x $ Left x
1190+ where x = (readV0, v')
12441191
12451192-- ResultM can read behaviors and events
12461193type ResultM = EventM
12471194
1195+{-# NOINLINE unsafeNewIORef #-}
1196+unsafeNewIORef :: a -> b -> IORef b
1197+unsafeNewIORef a b = unsafePerformIO $ do
1198+ touch a
1199+ newIORef b
1200+
12481201instance HasSpiderTimeline x => Functor (Event x) where
12491202 fmap f = push $ return . Just . f
12501203
@@ -1257,42 +1210,33 @@ push f e = cacheEvent (pushCheap f e)
12571210
12581211{-# INLINABLE pull #-}
12591212pull :: BehaviorM x a -> Behavior x a
1260−pull a = unsafePerformIO $ do
1261− ref <- newIORef Nothing
1262−#ifdef DEBUG_NODEIDS
1263− nid <- newNodeId
1264−#endif
1265− pure $ behaviorPull $ Pull
1266− { pullCompute = a
1267− , pullValue = ref
1213+pull a = behaviorPull $ Pull
1214+ { pullCompute = a
1215+ , pullValue = unsafeNewIORef a Nothing
12681216#ifdef DEBUG_NODEIDS
1269− , pullNodeId = nid
1217+ , pullNodeId = unsafeNodeId a
12701218#endif
1271− }
1219+ }
12721220
12731221{-# INLINABLE switch #-}
12741222switch :: 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− }
1223+switch a = eventSwitch $ Switch
1224+ { switchParent = a
1225+ , switchSubscribed = unsafeNewIORef a Nothing
1226+ }
12811227
12821228coincidence :: 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− }
1229+coincidence a = eventCoincidence $ Coincidence
1230+ { coincidenceParent = a
1231+ , coincidenceSubscribed = unsafeNewIORef a Nothing
1232+ }
12891233
12901234-- Propagate the given event occurrence; before cleaning up, run the given action, which may read the state of events and behaviors
12911235run :: forall x b. HasSpiderTimeline x => [DSum (RootTrigger x) Identity] -> ResultM x b -> SpiderHost x b
12921236run roots after = do
12931237 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
1238+ t <- SpiderHost ask
1239+ result <- SpiderHost $ lift $ withMVar (_spiderTimeline_lock t) $ \_ -> flip runReaderT t $ unSpiderHost $ runFrame $ do
12961240 rootsToPropagate <- forM roots $ \r@(RootTrigger (_, occRef, k) :=> a) -> do
12971241 occBefore <- liftIO $ do
12981242 occBefore <- readIORef occRef
@@ -1330,11 +1274,11 @@ scheduleMerge' initialHeight heightRef a = scheduleMerge initialHeight $ do
13301274 GT -> scheduleMerge' height heightRef a -- The height has been increased (by a coincidence event; TODO: is this the only way?)
13311275 EQ -> a
13321276
1333−newtype Clear a = Clear (IORef (Maybe a))
1277+data SomeClear = forall a. SomeClear {-# UNPACK #-} !(IORef (Maybe a))
13341278
1335−newtype IntClear a = IntClear (IORef (IntMap a))
1279+data SomeIntClear = forall a. SomeIntClear {-# UNPACK #-} !(IORef (IntMap a))
13361280
1337−newtype RootClear k = RootClear (IORef (DMap k Identity))
1281+data SomeRootClear = forall k. SomeRootClear {-# UNPACK #-} !(IORef (DMap k Identity))
13381282
13391283data SomeAssignment x = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak (Invalidator x)]) a
13401284
@@ -1346,110 +1290,55 @@ mkWeakPtrWithDebug x debugNote = do
13461290 x' <- evaluate x
13471291 mkWeakPtr x' $
13481292 if debugFinalize
1349− then Just $ debugStrLn $ "finalizing: " ++ debugNote
1293+ then Just $ putStrLn $ "finalizing: " ++ debugNote
13501294 else Nothing
13511295
13521296type WeakList a = [Weak a]
13531297
1354−type CanTrace x m = (HasSpiderTimeline x, MonadIO m)
1355−
1356−
1357−
1358−
1359−#ifdef DEBUG
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−
13811298{-# 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
1299+#ifdef DEBUG
1300+withIncreasedDepth :: CanTrace x m => m a -> m a
1301+withIncreasedDepth a = do
1302+ spiderTimeline <- askSpiderTimelineEnv
1303+ liftIO $ modifyIORef' (_spiderTimeline_depth spiderTimeline) succ
13851304 result <- a
1386− liftIO $ modifyIORef' (_spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)) pred
1305+ liftIO $ modifyIORef' (_spiderTimeline_depth spiderTimeline) pred
13871306 return result
1388−
1389−{-# INLINE tracePropagate #-}
1390−tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1391−tracePropagate p = when debugPropagate . trace p
1392−
1393−{-# INLINE traceInvalidate #-}
1394−traceInvalidate :: String -> IO ()
1395−traceInvalidate = when debugInvalidate . liftIO . debugStrLn
1396−
1397−{-# INLINE traceInvalidateHeight #-}
1398−traceInvalidateHeight :: String -> IO ()
1399−traceInvalidateHeight = when debugInvalidateHeight . liftIO . debugStrLn
1400−
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
1408− message <- getMessage
1409− d <- liftIO $ readIORef $ _spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)
1410− liftIO $ debugStrLn $ replicate d ' ' <> message
1411−
14121307#else
1308+withIncreasedDepth :: m a -> m a
1309+withIncreasedDepth = id
1310+#endif
14131311
1414−{-# INLINE withIncreasedDepth #-}
1415−withIncreasedDepth :: proxy x -> m a -> m a
1416−withIncreasedDepth _ = id
1312+type CanTrace x m = (HasSpiderTimeline x, MonadIO m)
14171313
14181314{-# INLINE tracePropagate #-}
14191315tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1420−tracePropagate _ _ = return ()
1316+tracePropagate p = traceWhen p debugPropagate
14211317
14221318{-# INLINE traceInvalidate #-}
14231319traceInvalidate :: String -> IO ()
1424−traceInvalidate _ = return ()
1320+traceInvalidate = when debugInvalidate . liftIO . putStrLn
14251321
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 ()
1322+{-# INLINE traceWhen #-}
1323+traceWhen :: (CanTrace x m) => proxy x -> Bool -> String -> m ()
1324+traceWhen p b message = traceMWhen p b $ return message
14471325
1326+{-# INLINE traceMWhen #-}
1327+traceMWhen :: (CanTrace x m) => proxy x -> Bool -> m String -> m ()
1328+traceMWhen _ b getMessage = when b $ do
1329+ message <- getMessage
1330+#ifdef DEBUG
1331+ spiderTimeline <- askSpiderTimelineEnv
1332+ d <- liftIO $ readIORef $ _spiderTimeline_depth spiderTimeline
1333+#else
1334+ let d = 0
14481335#endif
1336+ liftIO $ putStrLn $ replicate d ' ' <> message
14491337
14501338whoCreatedIORef :: IORef a -> IO [String]
14511339whoCreatedIORef (IORef a) = whoCreated $! a
14521340
1341+#ifdef DEBUG_CYCLES
14531342groupByHead :: Eq a => [NonEmpty a] -> [(a, NonEmpty [a])]
14541343groupByHead = \case
14551344 [] -> []
@@ -1460,54 +1349,20 @@ groupByHead = \case
14601349 | otherwise -> (x, xs :| []) : l
14611350
14621351listsToForest :: 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
1474−#endif
1475−
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−
1352+listsToForest l = fmap (\(a, l') -> Node a $ listsToForest $ toList l') $ groupByHead $ catMaybes $ fmap nonEmpty l
14951353#endif
14961354
1497−
14981355{-# INLINE propagateSubscriberHold #-}
14991356propagateSubscriberHold :: forall x p. (HasSpiderTimeline x, Patch p) => Hold x p -> p -> EventM x ()
15001357propagateSubscriberHold h a = do
1501− {-# SCC "trace" #-} when debugPropagate $ traceM (Proxy :: Proxy x) $ liftIO $ do
1358+ {-# SCC "trace" #-} traceMWhen (Proxy :: Proxy x) debugPropagate $ liftIO $ do
15021359 invalidators <- liftIO $ readIORef $ holdInvalidators h
15031360 return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
1504−
15051361 v <- {-# SCC "read" #-} liftIO $ readIORef $ holdValue h
15061362 case {-# SCC "apply" #-} apply a v of
15071363 Nothing -> return ()
15081364 Just v' -> do
1509− {-# SCC "trace2" #-} withIncreasedDepth (Proxy :: Proxy x) $
1510− tracePropagate (Proxy :: Proxy x) ("propagateSubscriberHold: assigning Hold" <> showNodeId h)
1365+ {-# SCC "trace2" #-} withIncreasedDepth $ tracePropagate (Proxy :: Proxy x) $ "propagateSubscriberHold: assigning Hold" <> showNodeId h
15111366 vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
15121367 iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
15131368 defer $ {-# SCC "assignment" #-} SomeAssignment vRef iRef v'
@@ -1515,25 +1370,25 @@ propagateSubscriberHold h a = do
15151370data SomeResetCoincidence x = forall a. SomeResetCoincidence !(EventSubscription x) !(Maybe (CoincidenceSubscribed x a)) -- The CoincidenceSubscriber will be present only if heights need to be reset
15161371
15171372runBehaviorM :: BehaviorM x a -> Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]) -> IORef [SomeHoldInit x] -> IO a
1518−runBehaviorM a mwi holdInits = runReaderIO (unBehaviorM a) (mwi, holdInits)
1373+runBehaviorM a mwi holdInits = runReaderT (unBehaviorM a) (mwi, holdInits)
15191374
15201375askInvalidator :: BehaviorM x (Maybe (Weak (Invalidator x)))
15211376askInvalidator = do
1522− (!m, _) <- ask
1377+ (!m, _) <- BehaviorM ask
15231378 case m of
15241379 Nothing -> return Nothing
15251380 Just (!wi, _) -> return $ Just wi
15261381
15271382askParentsRef :: BehaviorM x (Maybe (IORef [SomeBehaviorSubscribed x]))
15281383askParentsRef = do
1529− (!m, _) <- ask
1384+ (!m, _) <- BehaviorM ask
15301385 case m of
15311386 Nothing -> return Nothing
15321387 Just (_, !p) -> return $ Just p
15331388
15341389askBehaviorHoldInits :: BehaviorM x (IORef [SomeHoldInit x])
15351390askBehaviorHoldInits = do
1536− (_, !his) <- ask
1391+ (_, !his) <- BehaviorM ask
15371392 return his
15381393
15391394{-# INLINE getDynHold #-}
@@ -1541,27 +1396,20 @@ getDynHold :: (Defer (SomeHoldInit x) m, Patch p) => Dyn x p -> m (Hold x p)
15411396getDynHold d = do
15421397 mh <- liftIO $ readIORef $ unDyn d
15431398 case mh of
1544− HoldDyn h -> return h
1545− UnsafeDyn (readV0, v') -> do
1399+ Right h -> return h
1400+ Left (readV0, v') -> do
15461401 holdInits <- getDeferralQueue
15471402 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
15541403 h <- hold v0 v'
1555− liftIO $ writeIORef (unDyn d) $ HoldDyn h
1404+ liftIO $ writeIORef (unDyn d) $ Right h
15561405 return h
15571406
1558−
15591407-- Always refers to 0
15601408{-# NOINLINE zeroRef #-}
15611409zeroRef :: IORef Height
15621410zeroRef = unsafePerformIO $ newIORef zeroHeight
15631411
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)
1412+getRootSubscribed :: GCompare k => k a -> Root x k -> Subscriber x a -> IO (WeakBagTicket, RootSubscribed x a, Maybe a)
15651413getRootSubscribed k r sub = do
15661414 mSubscribed <- readIORef $ rootSubscribed r
15671415 let getOcc = fmap (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
@@ -1575,14 +1423,9 @@ getRootSubscribed k r sub = do
15751423 let !cached = rootSubscribed r
15761424 uninitRef <- newIORef $ error "getRootsubscribed: uninitRef not initialized"
15771425 (subs, sln) <- WeakBag.singleton sub weakSelf cleanupRootSubscribed
1578−
1579− tracePropagate (Proxy::Proxy x) $ "getRootSubscribed: calling rootInit"
1580−
1426+ when debugPropagate $ putStrLn $ "getRootSubscribed: calling rootInit"
15811427 uninit <- rootInit r k $ RootTrigger (subs, rootOccurrence r, k)
15821428 writeIORef uninitRef $! uninit
1583−#ifdef DEBUG_NODEIDS
1584− nid <- newNodeId
1585−#endif
15861429 let !subscribed = RootSubscribed
15871430 { rootSubscribedKey = k
15881431 , rootSubscribedCachedSubscribed = cached
@@ -1591,7 +1434,7 @@ getRootSubscribed k r sub = do
15911434 , rootSubscribedUninit = uninit
15921435 , rootSubscribedWeakSelf = weakSelf
15931436#ifdef DEBUG_NODEIDS
1594− , rootSubscribedNodeId = nid
1437+ , rootSubscribedNodeId = unsafeNodeId (k, r, subs)
15951438#endif
15961439 }
15971440 -- If we die at the same moment that all our children die, they will
@@ -1627,9 +1470,6 @@ data FanInt x a = FanInt
16271470 { _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
16281471 , _fanInt_subscriptionRef :: {-# UNPACK #-} !(IORef (EventSubscription x)) -- This should have a valid subscription iff subscribers is non-empty
16291472 , _fanInt_occRef :: {-# UNPACK #-} !(IORef (IntMap a))
1630−#ifdef DEBUG_NODEIDS
1631− , _fanInt_nodeId :: {-# UNPACK #-} !Int
1632−#endif
16331473 }
16341474
16351475newFanInt :: IO (FanInt x a)
@@ -1637,39 +1477,38 @@ newFanInt = do
16371477 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
16381478 subscriptionRef <- newIORef $ error "fanInt: no subscription"
16391479 occRef <- newIORef $ error "fanInt: no occurrence"
1640−#ifdef DEBUG_NODEIDS
1641− nodeId <- newNodeId
1642−#endif
16431480 return $ FanInt
16441481 { _fanInt_subscribers = subscribers
16451482 , _fanInt_subscriptionRef = subscriptionRef
16461483 , _fanInt_occRef = occRef
1647−#ifdef DEBUG_NODEIDS
1648− , _fanInt_nodeId = nodeId
1649−#endif
16501484 }
16511485
1486+{-# NOINLINE unsafeNewFanInt #-}
1487+unsafeNewFanInt :: b -> FanInt x a
1488+unsafeNewFanInt b = unsafePerformIO $ do
1489+ touch b
1490+ newFanInt
1491+
16521492fanInt :: HasSpiderTimeline x => Event x (IntMap a) -> EventSelectorInt x a
1653−fanInt p = unsafePerformIO $ do
1654− self <- newFanInt
1655− pure $ EventSelectorInt $ \k -> Event $ \sub -> do
1493+fanInt p =
1494+ let self = unsafeNewFanInt p
1495+ in EventSelectorInt $ \k -> Event $ \sub -> do
16561496 isEmpty <- liftIO $ FastMutableIntMap.isEmpty (_fanInt_subscribers self)
16571497 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
1498+ (subscription, parentOcc) <- subscribeAndRead p $ Subscriber
16601499 { subscriberPropagate = \m -> do
16611500 liftIO $ writeIORef (_fanInt_occRef self) m
16621501 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 ->
1502+ FastMutableIntMap.forIntersectionWithImmutable_ (_fanInt_subscribers self) m $ \b v -> do --TODO: Do we need to know that no subscribers are being added as we traverse?
1503+ FastWeakBag.traverse b $ \s -> do
16651504 subscriberPropagate s v
1666− , subscriberInvalidateHeight = \old ->
1667− FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1668− FastWeakBag.traverse_ b $ \s ->
1505+ , subscriberInvalidateHeight = \old -> do
1506+ FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b -> do
1507+ FastWeakBag.traverse b $ \s -> do
16691508 subscriberInvalidateHeight s old
1670− , subscriberRecalculateHeight = \new ->
1671− FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1672− FastWeakBag.traverse_ b $ \s ->
1509+ , subscriberRecalculateHeight = \new -> do
1510+ FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b -> do
1511+ FastWeakBag.traverse b $ \s -> do
16731512 subscriberRecalculateHeight s new
16741513 }
16751514 liftIO $ do
@@ -1683,28 +1522,13 @@ fanInt p = unsafePerformIO $ do
16831522 FastMutableIntMap.insert (_fanInt_subscribers self) k b
16841523 return b
16851524 Just b -> return b
1686− ticket <- liftIO $ FastWeakBag.insert sub b
1525+ t <- liftIO $ FastWeakBag.insert sub b
16871526 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−
1527+ (EventSubscription _ (EventSubscribed !heightRef _)) <- readIORef (_fanInt_subscriptionRef self)
1528+ return (EventSubscription (FastWeakBag.remove t) $! EventSubscribed heightRef $! toAny (_fanInt_subscriptionRef self, t), IntMap.lookup k currentOcc)
17051529
17061530{-# 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))
1531+getFanSubscribed :: (HasSpiderTimeline x, GCompare k) => k a -> Fan x k -> Subscriber x a -> EventM x (WeakBagTicket, FanSubscribed x k, Maybe a)
17081532getFanSubscribed k f sub = do
17091533 mSubscribed <- liftIO $ readIORef $ fanSubscribed f
17101534 case mSubscribed of
@@ -1722,16 +1546,13 @@ getFanSubscribed k f sub = do
17221546 subscribersRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribersRef not yet initialized"
17231547 occRef <- liftIO $ newIORef parentOcc
17241548 when (isJust parentOcc) $ scheduleClear occRef
1725−#ifdef DEBUG_NODEIDS
1726− nid <- liftIO newNodeId
1727−#endif
17281549 let subscribed = FanSubscribed
17291550 { fanSubscribedCachedSubscribed = fanSubscribed f
17301551 , fanSubscribedOccurrence = occRef
17311552 , fanSubscribedParent = subscription
17321553 , fanSubscribedSubscribers = subscribersRef
17331554#ifdef DEBUG_NODEIDS
1734− , fanSubscribedNodeId = nid
1555+ , fanSubscribedNodeId = unsafeNodeId f
17351556#endif
17361557 }
17371558 let !self = (k, subscribed)
@@ -1741,7 +1562,7 @@ getFanSubscribed k f sub = do
17411562 liftIO $ writeIORef (fanSubscribed f) $ Just subscribed
17421563 return (slnForSub, subscribed, coerce $ DMap.lookup k =<< parentOcc)
17431564
1744−cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k v) -> IO ()
1565+cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k) -> IO ()
17451566cleanupFanSubscribed (k, subscribed) = do
17461567 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
17471568 let reducedSubscribers = DMap.delete k subscribers
@@ -1753,7 +1574,7 @@ cleanupFanSubscribed (k, subscribed) = do
17531574 else writeIORef (fanSubscribedSubscribers subscribed) $! reducedSubscribers
17541575
17551576{-# INLINE subscribeFanSubscribed #-}
1756−subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k v -> Subscriber x (v a) -> IO WeakBagTicket
1577+subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k -> Subscriber x a -> IO WeakBagTicket
17571578subscribeFanSubscribed k subscribed sub = do
17581579 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
17591580 case DMap.lookup k subscribers of
@@ -1791,9 +1612,6 @@ getSwitchSubscribed s sub = do
17911612 when (isJust parentOcc) $ scheduleClear occRef
17921613 weakSelf <- liftIO $ newIORef $ error "getSwitchSubscribed: weakSelf not yet initialized"
17931614 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupSwitchSubscribed
1794−#ifdef DEBUG_NODEIDS
1795− nid <- liftIO newNodeId
1796−#endif
17971615 let !subscribed = SwitchSubscribed
17981616 { switchSubscribedCachedSubscribed = switchSubscribed s
17991617 , switchSubscribedOccurrence = occRef
@@ -1806,7 +1624,7 @@ getSwitchSubscribed s sub = do
18061624 , switchSubscribedCurrentParent = subscriptionRef
18071625 , switchSubscribedWeakSelf = weakSelf
18081626#ifdef DEBUG_NODEIDS
1809− , switchSubscribedNodeId = nid
1627+ , switchSubscribedNodeId = unsafeNodeId s
18101628#endif
18111629 }
18121630 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "switchSubscribedWeakSelf"
@@ -1851,9 +1669,6 @@ getCoincidenceSubscribed c sub = do
18511669 scheduleClear innerSubdRef
18521670 weakSelf <- liftIO $ newIORef $ error "getCoincidenceSubscribed: weakSelf not yet implemented"
18531671 (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupCoincidenceSubscribed
1854−#ifdef DEBUG_NODEIDS
1855− nid <- liftIO newNodeId
1856−#endif
18571672 let subscribed = CoincidenceSubscribed
18581673 { coincidenceSubscribedCachedSubscribed = coincidenceSubscribed c
18591674 , coincidenceSubscribedOccurrence = occRef
@@ -1864,7 +1679,7 @@ getCoincidenceSubscribed c sub = do
18641679 , coincidenceSubscribedInnerParent = innerSubdRef
18651680 , coincidenceSubscribedWeakSelf = weakSelf
18661681#ifdef DEBUG_NODEIDS
1867− , coincidenceSubscribedNodeId = nid
1682+ , coincidenceSubscribedNodeId = unsafeNodeId c
18681683#endif
18691684 }
18701685 liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "CoincidenceSubscribed"
@@ -1881,72 +1696,57 @@ cleanupCoincidenceSubscribed subscribed = do
18811696subscribeCoincidenceSubscribed :: CoincidenceSubscribed x a -> Subscriber x a -> IO WeakBagTicket
18821697subscribeCoincidenceSubscribed subscribed sub = WeakBag.insert sub (coincidenceSubscribedSubscribers subscribed) (coincidenceSubscribedWeakSelf subscribed) cleanupCoincidenceSubscribed
18831698
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)
1699+{-# INLINE merge #-}
1700+merge :: forall k x. (HasSpiderTimeline x, GCompare k) => Dynamic x (PatchDMap k (Event x)) -> Event x (DMap k Identity)
1701+merge d = cacheEvent (mergeCheap d)
18891702
18901703{-# 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)
1704+mergeWithMove :: forall k x. (HasSpiderTimeline x, GCompare k) => Dynamic x (PatchDMapWithMove k (Event x)) -> Event x (DMap k Identity)
1705+mergeWithMove d = cacheEvent (mergeCheapWithMove d)
18951706
18961707{-# 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
1708+mergeCheap :: forall k x. (HasSpiderTimeline x, GCompare k) => Dynamic x (PatchDMap k (Event x)) -> Event x (DMap k Identity)
1709+mergeCheap = mergeCheap' getInitialSubscribers updateMe destroy
19031710 where
1904− updateMe :: MergeUpdateFunc k v x (PatchDMap k q) (MergeSubscribedParent x)
1711+ updateMe :: MergeUpdateFunc k x (PatchDMap k (Event x)) (MergeSubscribedParent x)
19051712 updateMe subscriber heightBagRef oldParents (PatchDMap p) = do
19061713 let f (subscriptionsToKill, ps) (k :=> ComposeMaybe me) = do
19071714 (mOldSubd, newPs) <- case me of
19081715 Nothing -> return $ DMap.updateLookupWithKey (\_ _ -> Nothing) k ps
19091716 Just e -> do
19101717 let s = subscriber $ return k
1911− subscription@(EventSubscription _ subd) <- subscribe (nt e) s
1718+ subscription@(EventSubscription _ subd) <- subscribe e s
19121719 newParentHeight <- liftIO $ getEventSubscribedHeight subd
19131720 let newParent = MergeSubscribedParent subscription
19141721 liftIO $ modifyIORef' heightBagRef $ heightBagAdd newParentHeight
19151722 return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
19161723 forM_ mOldSubd $ \oldSubd -> do
1917− oldHeight <- liftIO $ getEventSubscribedHeight $
1918− _eventSubscription_subscribed $ unMergeSubscribedParent oldSubd
1919−
1724+ oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $ unMergeSubscribedParent oldSubd
19201725 liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
19211726 return (maybeToList (unMergeSubscribedParent <$> mOldSubd) ++ subscriptionsToKill, newPs)
19221727 foldM f ([], oldParents) $ DMap.toList p
1923−
1924− getInitialSubscribers :: MergeInitFunc k v q x (MergeSubscribedParent x)
1728+ getInitialSubscribers :: MergeInitFunc k x (MergeSubscribedParent x)
19251729 getInitialSubscribers initialParents subscriber = do
19261730 subscribers <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
19271731 let s = subscriber $ return k
1928− (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead (nt e) s
1732+ (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead e s
19291733 height <- liftIO $ getEventSubscribedHeight parentSubd
1930− return (fmap (k :=>) parentOcc, height, k :=> MergeSubscribedParent subscription)
1734+ return (fmap (\x -> k :=> Identity x) parentOcc, height, k :=> MergeSubscribedParent subscription)
19311735 return ( DMap.fromDistinctAscList $ mapMaybe (\(x, _, _) -> x) subscribers
19321736 , fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
19331737 , DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
19341738 )
1935−
19361739 destroy :: MergeDestroyFunc k (MergeSubscribedParent x)
19371740 destroy s = forM_ (DMap.toList s) $ \(_ :=> MergeSubscribedParent sub) -> unsubscribe sub
19381741
19391742{-# 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
1743+mergeCheapWithMove :: forall k x. (HasSpiderTimeline x, GCompare k) => Dynamic x (PatchDMapWithMove k (Event x)) -> Event x (DMap k Identity)
1744+mergeCheapWithMove = mergeCheap' getInitialSubscribers updateMe destroy
19451745 where
1946− updateMe :: MergeUpdateFunc k v x (PatchDMapWithMove k q) (MergeSubscribedParentWithMove x k)
1746+ updateMe :: MergeUpdateFunc k x (PatchDMapWithMove k (Event x)) (MergeSubscribedParentWithMove x k)
19471747 updateMe subscriber heightBagRef oldParents p = do
19481748 -- Prepare new parents for insertion
1949− let subscribeParent :: forall a. k a -> Event x (v a) -> EventM x (MergeSubscribedParentWithMove x k a)
1749+ let subscribeParent :: forall a. k a -> Event x a -> EventM x (MergeSubscribedParentWithMove x k a)
19501750 subscribeParent k e = do
19511751 keyRef <- liftIO $ newIORef k
19521752 let s = subscriber $ liftIO $ readIORef keyRef
@@ -1955,82 +1755,73 @@ mergeCheapWithMove nt = mergeGCheap' _mergeSubscribedParentWithMove_subscription
19551755 newParentHeight <- getEventSubscribedHeight subd
19561756 modifyIORef' heightBagRef $ heightBagAdd newParentHeight
19571757 return $ MergeSubscribedParentWithMove subscription keyRef
1958− p' <- PatchDMapWithMove.traversePatchDMapWithMoveWithKey (\k q -> subscribeParent k (nt q)) p
1758+ p' <- PatchDMapWithMove.traversePatchDMapWithMoveWithKey subscribeParent p
19591759 -- 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
1760+ let moveOrDelete :: forall a. k a -> PatchDMapWithMove.NodeInfo k (Event x) a -> MergeSubscribedParentWithMove x k a -> Constant (EventM x (Maybe (EventSubscription x))) a
19611761 moveOrDelete _ ni parent = Constant $ case getComposeMaybe $ PatchDMapWithMove._nodeInfo_to ni of
19621762 Nothing -> do
1963− oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $
1964− _mergeSubscribedParentWithMove_subscription parent
1965−
1763+ oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $ _mergeSubscribedParentWithMove_subscription parent
19661764 liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
19671765 return $ Just $ _mergeSubscribedParentWithMove_subscription parent
19681766 Just toKey -> do
19691767 liftIO $ writeIORef (_mergeSubscribedParentWithMove_key parent) $! toKey
19701768 return Nothing
1971− toDelete <- fmap catMaybes $ mapM (\(_ :=> v) -> getConstant v) $ DMap.toList $
1972− DMap.intersectionWithKey moveOrDelete (unPatchDMapWithMove p) oldParents
1973−
1769+ toDelete <- fmap catMaybes $ mapM (\(_ :=> v) -> getConstant v) $ DMap.toList $ DMap.intersectionWithKey moveOrDelete (unPatchDMapWithMove p) oldParents
19741770 return (toDelete, applyAlways p' oldParents)
1975− getInitialSubscribers :: MergeInitFunc k v q x (MergeSubscribedParentWithMove x k)
1771+ getInitialSubscribers :: MergeInitFunc k x (MergeSubscribedParentWithMove x k)
19761772 getInitialSubscribers initialParents subscriber = do
19771773 subscribers <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
19781774 keyRef <- liftIO $ newIORef k
19791775 let s = subscriber $ liftIO $ readIORef keyRef
1980− (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead (nt e) s
1776+ (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead e s
19811777 height <- liftIO $ getEventSubscribedHeight parentSubd
1982− return (fmap (k :=>) parentOcc, height, k :=> MergeSubscribedParentWithMove subscription keyRef)
1778+ return (fmap (\x -> k :=> Identity x) parentOcc, height, k :=> MergeSubscribedParentWithMove subscription keyRef)
19831779 return ( DMap.fromDistinctAscList $ mapMaybe (\(x, _, _) -> x) subscribers
19841780 , fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
19851781 , DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
19861782 )
1987−
19881783 destroy :: MergeDestroyFunc k (MergeSubscribedParentWithMove x k)
19891784 destroy s = forM_ (DMap.toList s) $ \(_ :=> MergeSubscribedParentWithMove sub _) -> unsubscribe sub
19901785
1991−type MergeUpdateFunc k v x p s
1992− = (forall a. EventM x (k a) -> Subscriber x (v a))
1786+type MergeUpdateFunc k x p s
1787+ = (forall a. EventM x (k a) -> Subscriber x a)
19931788 -> IORef HeightBag
19941789 -> DMap k s
19951790 -> p
19961791 -> EventM x ([EventSubscription x], DMap k s)
19971792
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)
1793+type MergeInitFunc k x s
1794+ = DMap k (Event x)
1795+ -> (forall a. EventM x (k a) -> Subscriber x a)
1796+ -> EventM x (DMap k Identity, [Height], DMap k s)
20041797
20051798type MergeDestroyFunc k s
20061799 = DMap k s
20071800 -> IO ()
20081801
2009−data Merge x k v s = Merge
1802+data Merge x k s = Merge
20101803 { _merge_parentsRef :: {-# UNPACK #-} !(IORef (DMap k s))
20111804 , _merge_heightBagRef :: {-# UNPACK #-} !(IORef HeightBag)
20121805 , _merge_heightRef :: {-# UNPACK #-} !(IORef Height)
2013− , _merge_sub :: {-# UNPACK #-} !(Subscriber x (DMap k v))
2014− , _merge_accumRef :: {-# UNPACK #-} !(IORef (DMap k v))
1806+ , _merge_sub :: {-# UNPACK #-} !(Subscriber x (DMap k Identity))
1807+ , _merge_accumRef :: {-# UNPACK #-} !(IORef (DMap k Identity))
20151808 }
20161809
2017−invalidateMergeHeight :: Merge x k v s -> IO ()
1810+invalidateMergeHeight :: Merge x k s -> IO ()
20181811invalidateMergeHeight m = invalidateMergeHeight' (_merge_heightRef m) (_merge_sub m)
20191812
20201813invalidateMergeHeight' :: IORef Height -> Subscriber x a -> IO ()
20211814invalidateMergeHeight' heightRef sub = do
20221815 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
1816+ 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
20251817 writeIORef heightRef $! invalidHeight
20261818 subscriberInvalidateHeight sub oldHeight
20271819
2028−revalidateMergeHeight :: Merge x k v s -> IO ()
1820+
1821+revalidateMergeHeight :: Merge x k s -> IO ()
20291822revalidateMergeHeight m = do
20301823 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
1824+ when (currentHeight == invalidHeight) $ do -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
20341825 heights <- readIORef $ _merge_heightBagRef m
20351826 parents <- readIORef $ _merge_parentsRef m
20361827 -- When the number of heights in the bag reaches the number of parents, we should have a valid height
@@ -2038,53 +1829,44 @@ revalidateMergeHeight m = do
20381829 LT -> return ()
20391830 EQ -> do
20401831 let height = succHeight $ heightBagMax heights
2041− traceInvalidateHeight $ "recalculateSubscriberHeight: height: " <> show height
1832+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: height: " <> show height
20421833 writeIORef (_merge_heightRef m) $! height
20431834 subscriberRecalculateHeight (_merge_sub m) height
20441835 GT -> error $ "revalidateMergeHeight: more heights (" <> show (heightBagSize heights) <> ") than parents (" <> show (DMap.size parents) <> ") for Merge"
20451836
2046−scheduleMergeSelf :: HasSpiderTimeline x => Merge x k v s -> Height -> EventM x ()
1837+scheduleMergeSelf :: HasSpiderTimeline x => Merge x k s -> Height -> EventM x ()
20471838scheduleMergeSelf m height = scheduleMerge' height (_merge_heightRef m) $ do
20481839 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
1840+ 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
20521841 --TODO: Assert that m is not empty
20531842 subscriberPropagate (_merge_sub m) vals
20541843
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) $
2066−#ifdef DEBUG_CYCLES
2067− do
2068− nodesInvolvedInCycle <- walkInvalidHeightParents subscribed
2069− stacks <- forM nodesInvolvedInCycle whoCreatedEventSubscribed
2070− throwIO (EventLoopException stacks)
2071−#else
2072− throwIO EventLoopException
2073−#endif
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
1844+mergeSubscriber :: forall x k s a. (HasSpiderTimeline x, GCompare k) => Merge x k s -> EventM x (k a) -> Subscriber x a
1845+mergeSubscriber m getKey = Subscriber
20781846 { subscriberPropagate = \a -> do
20791847 oldM <- liftIO $ readIORef $ _merge_accumRef m
20801848 k <- getKey
2081− let newM = DMap.insertWith (error "Same key fired multiple times for Merge") k a oldM
1849+ let newM = DMap.insertWith (error $ "Same key fired multiple times for Merge") k (Identity a) oldM
20821850 tracePropagate (Proxy :: Proxy x) $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
20831851 liftIO $ writeIORef (_merge_accumRef m) $! newM
20841852 when (DMap.null oldM) $ do -- Only schedule the firing once
20851853 height <- liftIO $ readIORef $ _merge_heightRef m
2086− checkCycle subscribed
2087−
1854+ --TODO: assertions about height
1855+ currentHeight <- getCurrentHeight
1856+ when (height <= currentHeight) $ do
1857+ if height /= invalidHeight
1858+ then do
1859+ myStack <- liftIO $ whoCreatedIORef undefined --TODO
1860+ error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
1861+ else liftIO $ do
1862+#ifdef DEBUG_CYCLES
1863+ nodesInvolvedInCycle <- walkInvalidHeightParents $ eventSubscribedMerge subscribed
1864+ stacks <- forM nodesInvolvedInCycle $ \(Some.This es) -> whoCreatedEventSubscribed es
1865+ let cycleInfo = ":\n" <> drawForest (listsToForest stacks)
1866+#else
1867+ let cycleInfo = ""
1868+#endif
1869+ error $ "Causality loop found" <> cycleInfo
20881870 scheduleMergeSelf m height
20891871 , subscriberInvalidateHeight = \old -> do --TODO: When removing a parent doesn't actually change the height, maybe we can avoid invalidating
20901872 modifyIORef' (_merge_heightBagRef m) $ heightBagRemove old
@@ -2095,45 +1877,30 @@ mergeSubscriber subscribed m getKey = Subscriber
20951877 }
20961878
20971879--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)
1880+updateMerge :: (HasSpiderTimeline x, GCompare k) => Merge x k s -> MergeUpdateFunc k x p s -> p -> SomeMergeUpdate x
1881+updateMerge m updateFunc p = SomeMergeUpdate updateMe (invalidateMergeHeight m) (revalidateMergeHeight m)
21001882 where updateMe = do
21011883 oldParents <- liftIO $ readIORef $ _merge_parentsRef m
2102− (subscriptionsToKill, newParents) <- updateFunc (mergeSubscriber subscribed m) (_merge_heightBagRef m) oldParents p
1884+ (subscriptionsToKill, newParents) <- updateFunc (mergeSubscriber m) (_merge_heightBagRef m) oldParents p
21031885 liftIO $ writeIORef (_merge_parentsRef m) $! newParents
21041886 return subscriptionsToKill
21051887
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
1888+{-# INLINE mergeCheap' #-}
1889+mergeCheap' :: forall k x p s. (HasSpiderTimeline x, GCompare k, PatchTarget p ~ DMap k (Event x)) => MergeInitFunc k x s -> MergeUpdateFunc k x p s -> MergeDestroyFunc k s -> Dynamic x p -> Event x (DMap k Identity)
1890+mergeCheap' getInitialSubscribers updateFunc destroy d = Event $ \sub -> do
21101891 initialParents <- readBehaviorUntracked $ dynamicCurrent d
21111892 accumRef <- liftIO $ newIORef $ error "merge: accumRef not yet initialized"
21121893 heightRef <- liftIO $ newIORef $ error "merge: heightRef not yet initialized"
21131894 heightBagRef <- liftIO $ newIORef $ error "merge: heightBagRef not yet initialized"
21141895 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
1896+ let m = Merge
21301897 { _merge_parentsRef = parentsRef
21311898 , _merge_heightBagRef = heightBagRef
21321899 , _merge_heightRef = heightRef
21331900 , _merge_sub = sub
21341901 , _merge_accumRef = accumRef
21351902 }
2136− (dm, heights, initialParentState) <- getInitialSubscribers initialParents $ mergeSubscriber subscribed m
1903+ (dm, heights, initialParentState) <- getInitialSubscribers initialParents $ mergeSubscriber m
21371904 let myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
21381905 myHeight = if invalidHeight `elem` heights
21391906 then invalidHeight
@@ -2142,57 +1909,50 @@ mergeGCheap' getParent getInitialSubscribers updateFunc destroy d = Event $ \sub
21421909 let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
21431910 then (if DMap.null dm then Nothing else Just dm, DMap.empty)
21441911 else (Nothing, dm)
2145− unless (DMap.null accum) $ scheduleMergeSelf m myHeight
1912+ unless (DMap.null accum) $ do
1913+ scheduleMergeSelf m myHeight
21461914 liftIO $ writeIORef accumRef $! accum
21471915 liftIO $ writeIORef heightRef $! myHeight
21481916 liftIO $ writeIORef heightBagRef $! myHeightBag
1917+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
21491918 liftIO $ writeIORef parentsRef $! initialParentState
21501919 defer $ SomeMergeInit $ do
2151− let changeSubscriber = Subscriber
1920+ let s = Subscriber
21521921 { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
2153− tracePropagate (Proxy :: Proxy x) "SubscriberMerge/Change"
2154− defer $ updateMerge subscribed m updateFunc a
1922+ tracePropagate (Proxy :: Proxy x) $ "SubscriberMerge/Change"
1923+ defer $ updateMerge m updateFunc a
21551924 , subscriberInvalidateHeight = \_ -> return ()
21561925 , subscriberRecalculateHeight = \_ -> return ()
21571926 }
2158− (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) changeSubscriber
2159− forM_ change $ \c -> defer $ updateMerge subscribed m updateFunc c
1927+ (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) s
1928+ forM_ change $ \c -> defer $ updateMerge m updateFunc c
21601929 -- We explicitly hold on to the unsubscribe function from subscribing to the update event.
21611930 -- If we don't do this, there are certain cases where mergeCheap will fail to properly retain
21621931 -- its subscription.
2163− liftIO $ writeIORef changeSubdRef (changeSubscriber, changeSubscription)
1932+ liftIO $ writeIORef changeSubdRef (s, changeSubscription)
21641933 let unsubscribeAll = destroy =<< readIORef parentsRef
1934+ return ( EventSubscription unsubscribeAll $ EventSubscribed heightRef $ toAny (parentsRef, changeSubdRef)
1935+ , occ
1936+ )
21651937
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)
1938+mergeInt :: forall x a. (HasSpiderTimeline x) => Dynamic x (PatchIntMap (Event x a)) -> Event x (IntMap a)
21701939mergeInt = cacheEvent . mergeIntCheap
21711940
21721941{-# INLINABLE mergeIntCheap #-}
2173−mergeIntCheap :: forall x a. (HasSpiderTimeline x) => DynamicS x (PatchIntMap (Event x a)) -> Event x (IntMap a)
1942+mergeIntCheap :: forall x a. (HasSpiderTimeline x) => Dynamic x (PatchIntMap (Event x a)) -> Event x (IntMap a)
21741943mergeIntCheap d = Event $ \sub -> do
21751944 initialParents <- readBehaviorUntracked $ dynamicCurrent d
21761945 accum <- liftIO $ FastMutableIntMap.newEmpty
21771946 heightRef <- liftIO $ newIORef zeroHeight
21781947 heightBagRef <- liftIO $ newIORef heightBagEmpty
21791948 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− }
21901949 let scheduleSelf = do
21911950 height <- liftIO $ readIORef $ heightRef
21921951 scheduleMerge' height heightRef $ do
21931952 vals <- liftIO $ FastMutableIntMap.getFrozenAndClear accum
21941953 subscriberPropagate sub vals
2195− invalidateMyHeight = invalidateMergeHeight' heightRef sub
1954+ invalidateMyHeight = do
1955+ invalidateMergeHeight' heightRef sub
21961956 recalculateMyHeight = do
21971957 currentHeight <- readIORef heightRef
21981958 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 +1962,12 @@ mergeIntCheap d = Event $ \sub -> do
22021962 LT -> return ()
22031963 EQ -> do
22041964 let height = succHeight $ heightBagMax heights
2205− traceInvalidateHeight $ "recalculateSubscriberHeight: height: " <> show height
1965+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: height: " <> show height
22061966 writeIORef heightRef $! height
22071967 subscriberRecalculateHeight sub height
22081968 GT -> error $ "revalidateMergeHeight: more heights (" <> show (heightBagSize heights) <> ") than parents (" <> show numParents <> ") for Merge"
22091969 mySubscriber k = Subscriber
22101970 { subscriberPropagate = \a -> do
2211− checkCycle subscribed
2212−
22131971 wasEmpty <- liftIO $ FastMutableIntMap.isEmpty accum
22141972 liftIO $ FastMutableIntMap.insert accum k a
22151973 when wasEmpty scheduleSelf
@@ -2243,6 +2001,7 @@ mergeIntCheap d = Event $ \sub -> do
22432001 else liftIO $ Just <$> FastMutableIntMap.getFrozenAndClear accum
22442002 else do when (not isEmpty) scheduleSelf -- We have things accumulated, but we shouldn't have fired them yet
22452003 return Nothing
2004+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
22462005 defer $ SomeMergeInit $ do
22472006 let updateMe a = SomeMergeUpdate u invalidateMyHeight recalculateMyHeight
22482007 where
@@ -2256,39 +2015,35 @@ mergeIntCheap d = Event $ \sub -> do
22562015 oldParents <- liftIO $ FastMutableIntMap.applyPatch parents newSubscriptions
22572016 liftIO $ for_ oldParents $ \oldParent -> do
22582017 oldParentHeight <- getEventSubscribedHeight $ _eventSubscription_subscribed oldParent
2259−
2260− print ("updateMe", oldParentHeight)
22612018 modifyIORef' heightBagRef $ heightBagRemove oldParentHeight
22622019 return $ IntMap.elems oldParents
2263− let changeSubscriber = Subscriber
2020+ let s = Subscriber
22642021 { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
22652022 tracePropagate (Proxy :: Proxy x) $ "SubscriberMergeInt/Change"
22662023 defer $ updateMe a
22672024 , subscriberInvalidateHeight = \_ -> return ()
22682025 , subscriberRecalculateHeight = \_ -> return ()
22692026 }
2270− (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) changeSubscriber
2027+ (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) s
22712028 forM_ change $ \c -> defer $ updateMe c
22722029 -- We explicitly hold on to the unsubscribe function from subscribing to the update event.
22732030 -- If we don't do this, there are certain cases where mergeCheap will fail to properly retain
22742031 -- its subscription.
2275− liftIO $ writeIORef changeSubdRef (changeSubscriber, changeSubscription)
2032+ liftIO $ writeIORef changeSubdRef (s, changeSubscription)
22762033 let unsubscribeAll = traverse_ unsubscribe =<< FastMutableIntMap.getFrozenAndClear parents
2277−
2278−
2279− return (EventSubscription unsubscribeAll subscribed, occ)
2034+ return ( EventSubscription unsubscribeAll $ EventSubscribed heightRef $ toAny (parents, changeSubdRef)
2035+ , occ
2036+ )
22802037
22812038newtype 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) }
22832039
2284−fanG :: (HasSpiderTimeline x, GCompare k) => Event x (DMap k v) -> EventSelectorG x k v
2285−fanG e = unsafePerformIO $ do
2286− ref <- newIORef Nothing
2040+fan :: (HasSpiderTimeline x, GCompare k) => Event x (DMap k Identity) -> EventSelector x k
2041+fan e =
22872042 let f = Fan
22882043 { fanParent = e
2289− , fanSubscribed = ref
2044+ , fanSubscribed = unsafeNewIORef e Nothing
22902045 }
2291− pure $ EventSelectorG $ \k -> eventFan k f
2046+ in EventSelector $ \k -> eventFan k f
22922047
22932048runHoldInits :: HasSpiderTimeline x => IORef [SomeHoldInit x] -> IORef [SomeDynInit x] -> IORef [SomeMergeInit x] -> EventM x ()
22942049runHoldInits holdInitRef dynInitRef mergeInitRef = do
@@ -2341,37 +2096,37 @@ clearEventEnv (EventEnv toAssignRef holdInitRef dynInitRef mergeUpdateRef mergeI
23412096
23422097-- | Run an event action outside of a frame
23432098runFrame :: 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)
2099+runFrame a = SpiderHost $ ask >>= \_ -> lift $ do
2100+ let env = _spiderTimeline_eventEnv (spiderTimeline :: SpiderTimelineEnv x)
23462101 let go = do
23472102 result <- a
23482103 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
23492104 return result
23502105 result <- runEventM go
23512106 toClear <- readIORef $ eventEnvClears env
2352− forM_ toClear $ \(Some (Clear ref)) -> {-# SCC "clear" #-} writeIORef ref Nothing
2107+ forM_ toClear $ \(SomeClear ref) -> {-# SCC "clear" #-} writeIORef ref Nothing
23532108 toClearInt <- readIORef $ eventEnvIntClears env
2354− forM_ toClearInt $ \(Some (IntClear ref)) -> {-# SCC "intClear" #-} writeIORef ref $! IntMap.empty
2109+ forM_ toClearInt $ \(SomeIntClear ref) -> {-# SCC "intClear" #-} writeIORef ref $! IntMap.empty
23552110 toClearRoot <- readIORef $ eventEnvRootClears env
2356− forM_ toClearRoot $ \(Some (RootClear ref)) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
2111+ forM_ toClearRoot $ \(SomeRootClear ref) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
23572112 toAssign <- readIORef $ eventEnvAssignments env
23582113 toReconnectRef <- newIORef []
23592114 coincidenceInfos <- readIORef $ eventEnvResetCoincidences env
23602115 forM_ toAssign $ \(SomeAssignment vRef iRef v) -> {-# SCC "assignment" #-} do
23612116 writeIORef vRef v
2362− traceInvalidate $ "Invalidating Hold"
2117+ when debugInvalidate $ putStrLn $ "Invalidating Hold"
23632118 writeIORef iRef =<< evaluate =<< invalidate toReconnectRef =<< readIORef iRef
23642119 mergeUpdates <- readIORef $ eventEnvMergeUpdates env
23652120 writeIORef (eventEnvMergeUpdates env) []
2366− tracePropagate (Proxy::Proxy x) $ "Updating merges"
2121+ when debugPropagate $ putStrLn "Updating merges"
23672122 mergeSubscriptionsToKill <- runEventM $ concat <$> mapM _someMergeUpdate_update mergeUpdates
2368− tracePropagate (Proxy::Proxy x) $ "Updating merges done"
2123+ when debugPropagate $ putStrLn "Updating merges done"
23692124 toReconnect <- readIORef toReconnectRef
23702125 clearEventEnv env
23712126 switchSubscriptionsToKill <- forM toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
23722127 oldSubscription <- readIORef $ switchSubscribedCurrentParent subscribed
23732128 wi <- readIORef $ switchSubscribedOwnWeakInvalidator subscribed
2374− traceInvalidate $ "Finalizing invalidator for Switch" <> showNodeId subscribed
2129+ when debugInvalidate $ putStrLn $ "Finalizing invalidator for Switch" <> showNodeId subscribed
23752130 finalize wi
23762131 i <- evaluate $ switchSubscribedOwnInvalidator subscribed
23772132 wi' <- mkWeakPtrWithDebug i "wi'"
@@ -2382,10 +2137,10 @@ runFrame a = SpiderHost $ do
23822137 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
23832138 --TODO: Make sure we touch the pieces of the SwitchSubscribed at the appropriate times
23842139 sub <- newSubscriberSwitch subscribed
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
2140+ 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
23862141 {-
23872142 stackTrace <- liftIO $ fmap renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
2388− liftIO $ debugStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
2143+ liftIO $ putStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
23892144 EventRoot _ -> "EventRoot"
23902145 EventNever -> "EventNever"
23912146 _ -> "something else"
@@ -2400,7 +2155,7 @@ runFrame a = SpiderHost $ do
24002155 myHeight <- readIORef $ switchSubscribedHeight subscribed
24012156 when (parentHeight /= myHeight) $ do
24022157 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
2403− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
2158+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
24042159 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
24052160 forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
24062161 unsubscribe subscription
@@ -2441,7 +2196,7 @@ invalidateCoincidenceHeight subscribed = do
24412196 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
24422197 when (oldHeight /= invalidHeight) $ do
24432198 writeIORef (coincidenceSubscribedHeight subscribed) $! invalidHeight
2444− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
2199+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
24452200
24462201updateSwitchHeight :: Height -> SwitchSubscribed x a -> IO ()
24472202updateSwitchHeight new subscribed = do
@@ -2449,7 +2204,7 @@ updateSwitchHeight new subscribed = do
24492204 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24502205 when (new /= invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24512206 writeIORef (switchSubscribedHeight subscribed) $! new
2452− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
2207+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
24532208
24542209recalculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
24552210recalculateCoincidenceHeight subscribed = do
@@ -2458,7 +2213,7 @@ recalculateCoincidenceHeight subscribed = do
24582213 height <- calculateCoincidenceHeight subscribed
24592214 when (height /= invalidHeight) $ do
24602215 writeIORef (coincidenceSubscribedHeight subscribed) $! height
2461− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
2216+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
24622217
24632218calculateSwitchHeight :: SwitchSubscribed x a -> IO Height
24642219calculateSwitchHeight subscribed = getEventSubscribedHeight . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
@@ -2497,219 +2252,14 @@ invalidate toReconnectRef wis = do
24972252-- Reflex integration
24982253--------------------------------------------------------------------------------
24992254
2500−-- | Designates the default, global Spider timeline
2501−data SpiderTimeline x
2502−type role SpiderTimeline nominal
2503−
2504−-- | The default, global Spider environment
2505−type Spider = SpiderTimeline Global
2506−
2507−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (EventM x) where
2508− {-# INLINABLE sample #-}
2509− sample (SpiderBehavior b) = readBehaviorUntracked b
2510−
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
2529−
2530−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPushM x) where
2531− {-# INLINABLE sample #-}
2532− sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
2533−
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
2548−
2549−
2550−instance HasSpiderTimeline x => Monad (Reflex.Class.Dynamic (SpiderTimeline x)) where
2551− {-# INLINE return #-}
2552− return = pure
2553− {-# INLINE (>>=) #-}
2554− x >>= f = SpiderDynamic $ dynamicDynIdentity $ newJoinDyn $ newMapDyn (unSpiderDynamic . f) $ unSpiderDynamic x
2555− {-# INLINE (>>) #-}
2556− (>>) = (*>)
2557−#if !MIN_VERSION_base(4,13,0)
2558− {-# INLINE fail #-}
2559− fail _ = error "Dynamic does not support 'fail'"
2255+#ifndef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
2256+-- When we're specializing, we include this from Reflex.Class instead, because
2257+-- it needs access to these types; when we're not, we want them here, so our
2258+-- instance isn't an orphan instance.
2259+#include "SpiderTimeline.include.hs"
2260+#include "SpiderTimelineHost.include.hs"
25602261#endif
25612262
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'
2571−
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
2575−
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 #-}
2579−
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
2588−
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
2591−
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
2594−
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
2602− {-# INLINABLE hold #-}
2603− hold v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.hold v0 e
2604− {-# INLINABLE holdDyn #-}
2605− holdDyn v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdDyn v0 e
2606− {-# INLINABLE holdIncremental #-}
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
2618−
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
2635− {-# INLINABLE sample #-}
2636− sample = runFrame . readBehaviorUntracked . unSpiderBehavior
2637−
2638−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2639− {-# INLINABLE sample #-}
2640− sample = Reflex.Spider.Internal.ReadPhase . Reflex.Class.sample
2641−
2642−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2643− {-# INLINABLE hold #-}
2644− hold v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.hold v0 e
2645− {-# INLINABLE holdDyn #-}
2646− holdDyn v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdDyn v0 e
2647− {-# INLINABLE holdIncremental #-}
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
2655−
2656−--------------------------------------------------------------------------------
2657−-- Deprecated items
2658−--------------------------------------------------------------------------------
2659−
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
2664− {-# INLINABLE subscribeEvent #-}
2665− subscribeEvent e = SpiderHostFrame $ do
2666− --TODO: Unsubscribe eventually (manually and/or with weak ref)
2667− val <- liftIO $ newIORef Nothing
2668− subscription <- subscribe (unSpiderEvent e) $ Subscriber
2669− { subscriberPropagate = \a -> do
2670− liftIO $ writeIORef val $ Just a
2671− scheduleClear val
2672− , subscriberInvalidateHeight = \_ -> return ()
2673− , subscriberRecalculateHeight = \_ -> return ()
2674− }
2675− return $ SpiderEventHandle
2676− { spiderEventHandleSubscription = subscription
2677− , spiderEventHandleValue = val
2678− }
2679−
2680−instance HasSpiderTimeline x => Reflex.Host.Class.ReflexHost (SpiderTimeline x) where
2681− type EventTrigger (SpiderTimeline x) = RootTrigger x
2682− type EventHandle (SpiderTimeline x) = SpiderEventHandle x
2683− type HostFrame (SpiderTimeline x) = SpiderHostFrame x
2684−
2685−instance HasSpiderTimeline x => Reflex.Host.Class.MonadReadEvent (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
2686− {-# NOINLINE readEvent #-}
2687− readEvent h = Reflex.Spider.Internal.ReadPhase $ fmap (fmap return) $ liftIO $ do
2688− result <- readIORef $ spiderEventHandleValue h
2689− touch h
2690− return result
2691−
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−
27132263unsafeNewSpiderTimelineEnv :: forall x. IO (SpiderTimelineEnv x)
27142264unsafeNewSpiderTimelineEnv = do
27152265 lock <- newMVar ()
@@ -2717,7 +2267,7 @@ unsafeNewSpiderTimelineEnv = do
27172267#ifdef DEBUG
27182268 depthRef <- newIORef 0
27192269#endif
2720− return $ STE $ SpiderTimelineEnv
2270+ return $ SpiderTimelineEnv
27212271 { _spiderTimeline_lock = lock
27222272 , _spiderTimeline_eventEnv = env
27232273#ifdef DEBUG
@@ -2725,40 +2275,43 @@ unsafeNewSpiderTimelineEnv = do
27252275#endif
27262276 }
27272277
2278+#ifndef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
27282279-- | Create a new SpiderTimelineEnv
27292280newSpiderTimeline :: IO (Some SpiderTimelineEnv)
2730−newSpiderTimeline = withSpiderTimeline (pure . Some)
2281+newSpiderTimeline = withSpiderTimeline (pure . Some.This)
27312282
2732−data LocalSpiderTimeline (x :: Type) s
2283+data LocalSpiderTimeline x s
27332284
27342285instance Reifies s (SpiderTimelineEnv x) =>
27352286 HasSpiderTimeline (LocalSpiderTimeline x s) where
2736− spiderTimeline = localSpiderTimeline Proxy $ reflect (Proxy :: Proxy s)
2287+ spiderTimeline = localSpiderTimeline (Proxy :: Proxy s) $ reflect (Proxy :: Proxy s)
27372288
27382289localSpiderTimeline
2739− :: proxy s
2290+ :: Proxy s
27402291 -> SpiderTimelineEnv x
27412292 -> SpiderTimelineEnv (LocalSpiderTimeline x s)
2742−localSpiderTimeline _ = coerce
2293+localSpiderTimeline _ = unsafeCoerce
27432294
27442295-- | Pass a new timeline to the given function.
27452296withSpiderTimeline :: (forall x. HasSpiderTimeline x => SpiderTimelineEnv x -> IO r) -> IO r
27462297withSpiderTimeline k = do
27472298 env <- unsafeNewSpiderTimelineEnv
27482299 reify env $ \s -> k $ localSpiderTimeline s env
2300+#endif
27492301
2750−newtype SpiderPullM (x :: Type) a = SpiderPullM (BehaviorM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2302+newtype SpiderPullM x a = SpiderPullM (BehaviorM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
27512303
27522304type ComputeM = EventM
27532305
2754−newtype SpiderPushM (x :: Type) a = SpiderPushM (ComputeM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2306+newtype SpiderPushM x a = SpiderPushM (ComputeM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
27552307
2308+#ifndef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
27562309instance HasSpiderTimeline x => R.Reflex (SpiderTimeline x) where
27572310 {-# SPECIALIZE instance R.Reflex (SpiderTimeline Global) #-}
27582311 newtype Behavior (SpiderTimeline x) a = SpiderBehavior { unSpiderBehavior :: Behavior x a }
27592312 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 }
2313+ newtype Dynamic (SpiderTimeline x) a = SpiderDynamic { unSpiderDynamic :: Dynamic x (Identity a) } -- deriving (Functor, Applicative, Monad)
2314+ newtype Incremental (SpiderTimeline x) p = SpiderIncremental { unSpiderIncremental :: Dynamic x p }
27622315 type PullM (SpiderTimeline x) = SpiderPullM x
27632316 type PushM (SpiderTimeline x) = SpiderPushM x
27642317 {-# INLINABLE never #-}
@@ -2771,15 +2324,10 @@ instance HasSpiderTimeline x => R.Reflex (SpiderTimeline x) where
27712324 pushCheap f = SpiderEvent . pushCheap (coerce f) . unSpiderEvent
27722325 {-# INLINABLE pull #-}
27732326 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
2327+ {-# INLINABLE merge #-}
2328+ merge = SpiderEvent . merge . dynamicConst . (coerce :: DMap k (R.Event (SpiderTimeline x)) -> DMap k (Event x))
2329+ {-# INLINABLE fan #-}
2330+ fan e = R.EventSelector $ SpiderEvent . select (fan (unSpiderEvent e))
27832331 {-# INLINABLE switch #-}
27842332 switch = SpiderEvent . switch . (coerce :: Behavior x (R.Event (SpiderTimeline x) a) -> Behavior x (Event x a)) . unSpiderBehavior
27852333 {-# INLINABLE coincidence #-}
@@ -2787,15 +2335,15 @@ instance HasSpiderTimeline x => R.Reflex (SpiderTimeline x) where
27872335 {-# INLINABLE current #-}
27882336 current = SpiderBehavior . dynamicCurrent . unSpiderDynamic
27892337 {-# INLINABLE updated #-}
2790− updated = SpiderEvent #. dynamicUpdated .# fmap coerce . unSpiderDynamic
2338+ updated = coerce $ SpiderEvent . dynamicUpdated . unSpiderDynamic
27912339 {-# INLINABLE unsafeBuildDynamic #-}
27922340 unsafeBuildDynamic readV0 v' = SpiderDynamic $ dynamicDynIdentity $ unsafeBuildDynamic (coerce readV0) $ coerce $ unSpiderEvent v'
27932341 {-# INLINABLE unsafeBuildIncremental #-}
27942342 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
2343+ {-# INLINABLE mergeIncremental #-}
2344+ mergeIncremental = SpiderEvent . merge . (unsafeCoerce :: Dynamic x (PatchDMap k (R.Event (SpiderTimeline x))) -> Dynamic x (PatchDMap k (Event x))) . unSpiderIncremental
2345+ {-# INLINABLE mergeIncrementalWithMove #-}
2346+ mergeIncrementalWithMove = SpiderEvent . mergeWithMove . (unsafeCoerce :: Dynamic x (PatchDMapWithMove k (R.Event (SpiderTimeline x))) -> Dynamic x (PatchDMapWithMove k (Event x))) . unSpiderIncremental
27992347 {-# INLINABLE currentIncremental #-}
28002348 currentIncremental = SpiderBehavior . dynamicCurrent . unSpiderIncremental
28012349 {-# INLINABLE updatedIncremental #-}
@@ -2806,12 +2354,12 @@ instance HasSpiderTimeline x => R.Reflex (SpiderTimeline x) where
28062354 return $ Identity <$> apply p c --TODO: Avoid the redundant 'apply'
28072355 eventCoercion Coercion = Coercion
28082356 behaviorCoercion Coercion = Coercion
2809− dynamicCoercion Coercion = Coercion
2810− incrementalCoercion Coercion Coercion = Coercion
2357+ dynamicCoercion = unsafeCoerce --TODO: How can we avoid this unsafeCoerce? This is safe only because we know how Identity works as a Patch instance
28112358 {-# INLINABLE mergeIntIncremental #-}
2812− mergeIntIncremental = SpiderEvent . mergeInt . coerce
2359+ mergeIntIncremental = SpiderEvent . mergeInt . (unsafeCoerce :: Dynamic x (PatchIntMap (R.Event (SpiderTimeline x) a)) -> Dynamic x (PatchIntMap (Event x a))) . unSpiderIncremental
28132360 {-# INLINABLE fanInt #-}
28142361 fanInt e = R.EventSelectorInt $ SpiderEvent . selectInt (fanInt (unSpiderEvent e))
2362+#endif
28152363
28162364data RootTrigger x a = forall k. GCompare k => RootTrigger (WeakBag (Subscriber x a), IORef (DMap k Identity), k a)
28172365
@@ -2834,7 +2382,7 @@ instance MonadAtomicRef (EventM x) where
28342382 atomicModifyRef r f = liftIO $ atomicModifyRef r f
28352383
28362384-- | The monad for actions that manipulate a Spider timeline identified by @x@
2837−newtype SpiderHost (x :: Type) a = SpiderHost { unSpiderHost :: IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2385+newtype SpiderHost x a = SpiderHost { unSpiderHost :: ReaderT (SpiderTimelineEnv x) IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
28382386
28392387instance Monad (SpiderHost x) where
28402388 {-# INLINABLE (>>=) #-}
@@ -2843,27 +2391,22 @@ instance Monad (SpiderHost x) where
28432391 SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
28442392 {-# INLINABLE return #-}
28452393 return x = SpiderHost $ return x
2846−#if !MIN_VERSION_base(4,13,0)
28472394 {-# INLINABLE fail #-}
2848− fail = MonadFail.fail
2849−#endif
2850−
2851−instance MonadFail (SpiderHost x) where
2852− {-# INLINABLE fail #-}
2853− fail s = SpiderHost $ MonadFail.fail s
2395+ fail s = SpiderHost $ fail s
28542396
28552397-- | Run an action affecting the global Spider timeline; this will be guarded by
28562398-- a mutex for that timeline
28572399runSpiderHost :: SpiderHost Global a -> IO a
2858−runSpiderHost (SpiderHost a) = a
2400+runSpiderHost (SpiderHost a) = runReaderT a globalSpiderTimelineEnv
28592401
2402+#ifndef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
28602403-- | Run an action affecting a given Spider timeline; this will be guarded by a
28612404-- mutex for that timeline
28622405runSpiderHostForTimeline :: SpiderHost x a -> SpiderTimelineEnv x -> IO a
2863−runSpiderHostForTimeline (SpiderHost a) _ = a
2406+runSpiderHostForTimeline (SpiderHost a) = runReaderT a
2407+#endif
28642408
2865−newtype SpiderHostFrame (x :: Type) a = SpiderHostFrame { runSpiderHostFrame :: EventM x a }
2866− deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2409+newtype SpiderHostFrame x a = SpiderHostFrame { runSpiderHostFrame :: EventM x a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
28672410
28682411instance Monad (SpiderHostFrame x) where
28692412 {-# INLINABLE (>>=) #-}
@@ -2872,21 +2415,15 @@ instance Monad (SpiderHostFrame x) where
28722415 SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
28732416 {-# INLINABLE return #-}
28742417 return x = SpiderHostFrame $ return x
2875−#if !MIN_VERSION_base(4,13,0)
28762418 {-# INLINABLE fail #-}
28772419 fail s = SpiderHostFrame $ fail s
2878−#endif
28792420
2880−instance NotReady (SpiderTimeline x) (SpiderHostFrame x) where
2881− notReadyUntil _ = pure ()
2882− notReady = pure ()
2883−
2884−newEventWithTriggerIO :: forall x a. HasSpiderTimeline x => (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
2421+newEventWithTriggerIO :: (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
28852422newEventWithTriggerIO f = do
28862423 es <- newFanEventWithTriggerIO $ \Refl -> f
28872424 return $ select es Refl
28882425
2889−newFanEventWithTriggerIO :: (HasSpiderTimeline x, GCompare k) => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
2426+newFanEventWithTriggerIO :: GCompare k => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
28902427newFanEventWithTriggerIO f = do
28912428 occRef <- newIORef DMap.empty
28922429 subscribedRef <- newIORef DMap.empty
@@ -2920,11 +2457,3 @@ instance MonadAtomicRef (SpiderHostFrame x) where
29202457instance PrimMonad (SpiderHostFrame x) where
29212458 type PrimState (SpiderHostFrame x) = PrimState IO
29222459 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 ()
src/Reflex/Spider/SpiderTimeline.include.hsnew file+155
@@ -0,0 +1,155 @@
1+-- | Designates the default, global Spider timeline
2+data SpiderTimeline x
3+type role SpiderTimeline nominal
4+
5+-- | The default, global Spider environment
6+type Spider = SpiderTimeline Global
7+
8+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (EventM x) where
9+ {-# INLINABLE sample #-}
10+ sample (SpiderBehavior b) = readBehaviorUntracked b
11+
12+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (EventM x) where
13+ {-# INLINABLE hold #-}
14+ hold = holdSpiderEventM
15+ {-# INLINABLE holdDyn #-}
16+ holdDyn = holdDynSpiderEventM
17+ {-# INLINABLE holdIncremental #-}
18+ holdIncremental = holdIncrementalSpiderEventM
19+ {-# INLINABLE buildDynamic #-}
20+ buildDynamic = buildDynamicSpiderEventM
21+ {-# INLINABLE headE #-}
22+ headE = R.slowHeadE
23+-- headE (SpiderEvent e) = SpiderEvent <$> Reflex.Spider.Internal.headE e
24+
25+instance (
26+#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
27+ x ~ Global
28+#endif
29+ ) => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPullM x) where
30+ {-# INLINABLE sample #-}
31+ sample = coerce . readBehaviorTracked . unSpiderBehavior
32+
33+instance (
34+#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
35+ x ~ Global
36+#else
37+ HasSpiderTimeline x
38+#endif
39+ ) => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPushM x) where
40+ {-# INLINABLE sample #-}
41+ sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
42+
43+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderPushM x) where
44+ {-# INLINABLE hold #-}
45+ hold v0 e = Reflex.Class.current <$> Reflex.Class.holdDyn v0 e
46+ {-# INLINABLE holdDyn #-}
47+ holdDyn v0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce e
48+ {-# INLINABLE holdIncremental #-}
49+ holdIncremental v0 (SpiderEvent e) = SpiderPushM $ SpiderIncremental . dynamicHold <$> Reflex.Spider.Internal.hold v0 e
50+ {-# INLINABLE buildDynamic #-}
51+ buildDynamic getV0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . dynamicDynIdentity) $ Reflex.Spider.Internal.buildDynamic (coerce getV0) $ coerce e
52+ {-# INLINABLE headE #-}
53+ headE = R.slowHeadE
54+-- headE (SpiderEvent e) = SpiderPushM $ SpiderEvent <$> Reflex.Spider.Internal.headE e
55+
56+instance HasSpiderTimeline x => Monad (Reflex.Class.Dynamic (SpiderTimeline x)) where
57+ {-# INLINE return #-}
58+ return = pure
59+ {-# INLINE (>>=) #-}
60+ x >>= f = SpiderDynamic $ dynamicDynIdentity $ newJoinDyn $ newMapDyn (unSpiderDynamic . f) $ unSpiderDynamic x
61+ {-# INLINE (>>) #-}
62+ _ >> y = y
63+ {-# INLINE fail #-}
64+ fail _ = error "Dynamic does not support 'fail'"
65+
66+{-# INLINABLE newJoinDyn #-}
67+newJoinDyn :: HasSpiderTimeline x => Reflex.Spider.Internal.Dynamic x (Identity (Reflex.Spider.Internal.Dynamic x (Identity a))) -> Reflex.Spider.Internal.Dyn x (Identity a)
68+newJoinDyn d =
69+ let readV0 = readBehaviorTracked . dynamicCurrent =<< readBehaviorTracked (dynamicCurrent d)
70+ eOuter = Reflex.Spider.Internal.push (fmap (Just . Identity) . readBehaviorUntracked . dynamicCurrent . runIdentity) $ dynamicUpdated d
71+ eInner = Reflex.Spider.Internal.switch $ dynamicUpdated <$> dynamicCurrent d
72+ eBoth = Reflex.Spider.Internal.coincidence $ dynamicUpdated . runIdentity <$> dynamicUpdated d
73+ v' = unSpiderEvent $ Reflex.Class.leftmost $ map SpiderEvent [eBoth, eOuter, eInner]
74+ in Reflex.Spider.Internal.unsafeBuildDynamic readV0 v'
75+
76+instance HasSpiderTimeline x => Functor (Reflex.Class.Dynamic (SpiderTimeline x)) where
77+ fmap f = SpiderDynamic . newMapDyn f . unSpiderDynamic
78+ x <$ _ = pure x
79+
80+instance HasSpiderTimeline x => Applicative (Reflex.Class.Dynamic (SpiderTimeline x)) where
81+ pure = SpiderDynamic . dynamicConst
82+#if MIN_VERSION_base(4,10,0)
83+ liftA2 f a b = SpiderDynamic $ Reflex.Spider.Internal.zipDynWith f (unSpiderDynamic a) (unSpiderDynamic b)
84+#endif
85+ SpiderDynamic a <*> SpiderDynamic b = SpiderDynamic $ Reflex.Spider.Internal.zipDynWith ($) a b
86+ _ *> b = b
87+ a <* _ = a --TODO: The semantics of *>, <*, and <$ might not be quite right - they drop changes
88+
89+holdSpiderEventM :: HasSpiderTimeline x => a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Behavior (SpiderTimeline x) a)
90+holdSpiderEventM v0 e = fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
91+
92+holdDynSpiderEventM :: HasSpiderTimeline x => a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Dynamic (SpiderTimeline x) a)
93+holdDynSpiderEventM v0 e = fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
94+
95+holdIncrementalSpiderEventM :: (HasSpiderTimeline x, Patch p) => PatchTarget p -> Reflex.Class.Event (SpiderTimeline x) p -> EventM x (Reflex.Class.Incremental (SpiderTimeline x) p)
96+holdIncrementalSpiderEventM v0 e = fmap (SpiderIncremental . dynamicHold) $ Reflex.Spider.Internal.hold v0 $ unSpiderEvent e
97+
98+buildDynamicSpiderEventM :: HasSpiderTimeline x => SpiderPullM x a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Dynamic (SpiderTimeline x) a)
99+buildDynamicSpiderEventM getV0 e = fmap (SpiderDynamic . dynamicDynIdentity) $ Reflex.Spider.Internal.buildDynamic (coerce getV0) $ coerce $ unSpiderEvent e
100+
101+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHost x) where
102+ {-# INLINABLE hold #-}
103+ hold v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.hold v0 e
104+ {-# INLINABLE holdDyn #-}
105+ holdDyn v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdDyn v0 e
106+ {-# INLINABLE holdIncremental #-}
107+ holdIncremental v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdIncremental v0 e
108+ {-# INLINABLE buildDynamic #-}
109+ buildDynamic getV0 e = runFrame . runSpiderHostFrame $ Reflex.Class.buildDynamic getV0 e
110+ {-# INLINABLE headE #-}
111+ headE e = runFrame . runSpiderHostFrame $ Reflex.Class.headE e
112+
113+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHostFrame x) where
114+ sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
115+
116+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHostFrame x) where
117+ {-# INLINABLE hold #-}
118+ hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
119+ {-# INLINABLE holdDyn #-}
120+ holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
121+ {-# INLINABLE holdIncremental #-}
122+ holdIncremental v0 e = SpiderHostFrame $ fmap (SpiderIncremental . dynamicHold) $ Reflex.Spider.Internal.hold v0 $ unSpiderEvent e
123+ {-# INLINABLE buildDynamic #-}
124+ buildDynamic getV0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicDynIdentity) $ Reflex.Spider.Internal.buildDynamic (coerce getV0) $ coerce $ unSpiderEvent e
125+ {-# INLINABLE headE #-}
126+ headE = R.slowHeadE
127+-- headE (SpiderEvent e) = SpiderHostFrame $ SpiderEvent <$> Reflex.Spider.Internal.headE e
128+
129+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHost x) where
130+ {-# INLINABLE sample #-}
131+ sample = runFrame . readBehaviorUntracked . unSpiderBehavior
132+
133+instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
134+ {-# INLINABLE sample #-}
135+ sample = Reflex.Spider.Internal.ReadPhase . Reflex.Class.sample
136+
137+instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
138+ {-# INLINABLE hold #-}
139+ hold v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.hold v0 e
140+ {-# INLINABLE holdDyn #-}
141+ holdDyn v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdDyn v0 e
142+ {-# INLINABLE holdIncremental #-}
143+ holdIncremental v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdIncremental v0 e
144+ {-# INLINABLE buildDynamic #-}
145+ buildDynamic getV0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.buildDynamic getV0 e
146+ {-# INLINABLE headE #-}
147+ headE e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.headE e
148+
149+--------------------------------------------------------------------------------
150+-- Deprecated items
151+--------------------------------------------------------------------------------
152+
153+-- | 'SpiderEnv' is the old name for 'SpiderTimeline'
154+{-# DEPRECATED SpiderEnv "Use 'SpiderTimelineEnv' instead" #-}
155+type SpiderEnv = SpiderTimeline
src/Reflex/Spider/SpiderTimelineHost.include.hsnew file+57
@@ -0,0 +1,57 @@
1+instance HasSpiderTimeline x => Reflex.Host.Class.MonadSubscribeEvent (SpiderTimeline x) (SpiderHostFrame x) where
2+ {-# INLINABLE subscribeEvent #-}
3+ subscribeEvent e = SpiderHostFrame $ do
4+ --TODO: Unsubscribe eventually (manually and/or with weak ref)
5+ val <- liftIO $ newIORef Nothing
6+ subscription <- subscribe (unSpiderEvent e) $ Subscriber
7+ { subscriberPropagate = \a -> do
8+ liftIO $ writeIORef val $ Just a
9+ scheduleClear val
10+ , subscriberInvalidateHeight = \_ -> return ()
11+ , subscriberRecalculateHeight = \_ -> return ()
12+ }
13+ return $ SpiderEventHandle
14+ { spiderEventHandleSubscription = subscription
15+ , spiderEventHandleValue = val
16+ }
17+
18+instance HasSpiderTimeline x => Reflex.Host.Class.ReflexHost (SpiderTimeline x) where
19+ type EventTrigger (SpiderTimeline x) = RootTrigger x
20+ type EventHandle (SpiderTimeline x) = SpiderEventHandle x
21+ type HostFrame (SpiderTimeline x) = SpiderHostFrame x
22+
23+instance HasSpiderTimeline x => Reflex.Host.Class.MonadReadEvent (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
24+ {-# NOINLINE readEvent #-}
25+ readEvent h = Reflex.Spider.Internal.ReadPhase $ fmap (fmap return) $ liftIO $ do
26+ result <- readIORef $ spiderEventHandleValue h
27+ touch h
28+ return result
29+
30+instance (
31+#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
32+ x ~ Global
33+#endif
34+ ) => Reflex.Host.Class.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHost x) where
35+ newEventWithTrigger = SpiderHost . lift . fmap SpiderEvent . newEventWithTriggerIO
36+ newFanEventWithTrigger f = SpiderHost $ lift $ do
37+ es <- newFanEventWithTriggerIO f
38+ return $ Reflex.Class.EventSelector $ SpiderEvent . Reflex.Spider.Internal.select es
39+
40+instance (
41+#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
42+ x ~ Global
43+#endif
44+ ) => Reflex.Host.Class.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHostFrame x) where
45+ newEventWithTrigger = SpiderHostFrame . EventM . liftIO . fmap SpiderEvent . newEventWithTriggerIO
46+ newFanEventWithTrigger f = SpiderHostFrame $ EventM $ liftIO $ do
47+ es <- newFanEventWithTriggerIO f
48+ return $ Reflex.Class.EventSelector $ SpiderEvent . Reflex.Spider.Internal.select es
49+
50+instance HasSpiderTimeline x => Reflex.Host.Class.MonadSubscribeEvent (SpiderTimeline x) (SpiderHost x) where
51+ {-# INLINABLE subscribeEvent #-}
52+ subscribeEvent = runFrame . runSpiderHostFrame . Reflex.Host.Class.subscribeEvent
53+
54+instance HasSpiderTimeline x => Reflex.Host.Class.MonadReflexHost (SpiderTimeline x) (SpiderHost x) where
55+ type ReadPhase (SpiderHost x) = Reflex.Spider.Internal.ReadPhase x
56+ fireEventsAndRead es (Reflex.Spider.Internal.ReadPhase a) = run es a
57+ runHostFrame = runFrame . runSpiderHostFrame
src/Reflex/Time.hsdeleted−384
@@ -1,384 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−{-# LANGUAGE DeriveDataTypeable #-}
3−{-# LANGUAGE DeriveGeneric #-}
4−{-# LANGUAGE DeriveTraversable #-}
5−{-# LANGUAGE FlexibleContexts #-}
6−{-# LANGUAGE MultiParamTypeClasses #-}
7−{-# LANGUAGE RecursiveDo #-}
8−{-# LANGUAGE ScopedTypeVariables #-}
9−{-# LANGUAGE TupleSections #-}
10−{-# LANGUAGE TypeFamilies #-}
11−#ifdef USE_TEMPLATE_HASKELL
12−{-# LANGUAGE TemplateHaskell #-}
13−#endif
14−-- |
15−-- Module:
16−-- Reflex.Time
17−-- Description:
18−-- Clocks, timers, and other time-related functions.
19−module Reflex.Time where
20−
21−import Reflex.Class
22−import Reflex.Dynamic
23−import Reflex.PerformEvent.Class
24−import Reflex.PostBuild.Class
25−import Reflex.TriggerEvent.Class
26−
27−import Control.Concurrent
28−import qualified Control.Concurrent.Thread.Delay as Concurrent
29−import Control.Lens hiding ((|>))
30−import Control.Monad
31−import Control.Monad.Fix
32−import Control.Monad.IO.Class
33−import Data.Align
34−import Data.Data (Data)
35−import Data.Fixed
36−import Data.Semigroup (Semigroup(..))
37−import Data.Sequence (Seq, (|>))
38−import qualified Data.Sequence as Seq
39−import Data.These
40−import Data.Time.Clock
41−import Data.Typeable
42−import GHC.Generics (Generic)
43−import System.Random
44−
45−-- | Metadata associated with a timer "tick"
46−data TickInfo
47− = TickInfo { _tickInfo_lastUTC :: UTCTime
48− -- ^ UTC time immediately after the last tick.
49− , _tickInfo_n :: Integer
50− -- ^ Number of time periods or ticks since the start of the timer
51− , _tickInfo_alreadyElapsed :: NominalDiffTime
52− -- ^ Amount of time that has elapsed in the current tick period.
53− }
54− deriving (Eq, Ord, Show, Typeable)
55−
56−-- | Fires an 'Event' once every time provided interval elapses, approximately.
57−-- The provided 'UTCTime' is used bootstrap the determination of how much time has elapsed with each tick.
58−-- This is a special case of 'tickLossyFrom' that uses the post-build event to start the tick thread.
59−tickLossy :: (PostBuild t m, PerformEvent t m, TriggerEvent t m, MonadIO (Performable m), MonadFix m) => NominalDiffTime -> UTCTime -> m (Event t TickInfo)
60−tickLossy dt t0 = tickLossyFrom dt t0 =<< getPostBuild
61−
62−-- | Fires an 'Event' once every time provided interval elapses, approximately.
63−-- This is a special case of 'tickLossyFrom' that uses the post-build event to start the tick thread and the time of the post-build as the tick basis time.
64−tickLossyFromPostBuildTime :: (PostBuild t m, PerformEvent t m, TriggerEvent t m, MonadIO (Performable m), MonadFix m) => NominalDiffTime -> m (Event t TickInfo)
65−tickLossyFromPostBuildTime dt = do
66− postBuild <- getPostBuild
67− postBuildTime <- performEvent $ liftIO getCurrentTime <$ postBuild
68− tickLossyFrom' $ (dt,) <$> postBuildTime
69−
70−-- | Fires an 'Event' approximately each time the provided interval elapses. If the system starts running behind, occurrences will be dropped rather than buffered.
71−-- Each occurrence of the resulting event will contain the index of the current interval, with 0 representing the provided initial time.
72−tickLossyFrom
73− :: (PerformEvent t m, TriggerEvent t m, MonadIO (Performable m), MonadFix m)
74− => NominalDiffTime
75− -- ^ The length of a tick interval
76− -> UTCTime
77− -- ^ The basis time from which intervals count and with which the initial calculation of elapsed time will be made.
78− -> Event t a
79− -- ^ Event that starts a tick generation thread. Usually you want this to
80− -- be something like the result of getPostBuild that only fires once. But
81− -- there could be uses for starting multiple timer threads.
82− -> m (Event t TickInfo)
83−tickLossyFrom dt t0 e = tickLossyFrom' $ (dt, t0) <$ e
84−
85−-- | Generalization of tickLossyFrom that takes the delay and initial time as an 'Event'.
86−tickLossyFrom'
87− :: (PerformEvent t m, TriggerEvent t m, MonadIO (Performable m), MonadFix m)
88− => Event t (NominalDiffTime, UTCTime)
89− -- ^ Event that starts a tick generation thread. Usually you want this to
90− -- be something like the result of 'getPostBuild' that only fires once. But
91− -- there could be uses for starting multiple timer threads.
92− -> m (Event t TickInfo)
93−tickLossyFrom' e = do
94− rec result <- performEventAsync $ callAtNextInterval <$> leftmost [e, snd <$> result]
95− return $ fst <$> result
96− where callAtNextInterval pair cb = void $ liftIO $ forkIO $ do
97− tick <- uncurry getCurrentTick pair
98− Concurrent.delay $ ceiling $ (fst pair - _tickInfo_alreadyElapsed tick) * 1000000
99− cb (tick, pair)
100−
101−-- | Like 'tickLossy', but immediately calculates the first tick and provides a 'Dynamic' that is updated as ticks fire.
102−clockLossy :: (MonadIO m, PerformEvent t m, TriggerEvent t m, MonadIO (Performable m), PostBuild t m, MonadHold t m, MonadFix m) => NominalDiffTime -> UTCTime -> m (Dynamic t TickInfo)
103−clockLossy dt t0 = do
104− initial <- liftIO $ getCurrentTick dt t0
105− e <- tickLossy dt t0
106− holdDyn initial e
107−
108−-- | Generates a 'TickInfo', given the specified interval and timestamp. The 'TickInfo' will include the
109−-- current time, the number of ticks that have elapsed since the timestamp, and the amount of time that
110−-- has elapsed since the start time of this tick.
111−getCurrentTick :: NominalDiffTime -> UTCTime -> IO TickInfo
112−getCurrentTick dt t0 = do
113− t <- getCurrentTime
114− let offset = t `diffUTCTime` t0
115− (n, alreadyElapsed) = offset `divMod'` dt
116− return $ TickInfo t n alreadyElapsed
117−
118−-- | Delay an Event's occurrences by a given amount in seconds.
119−delay :: (PerformEvent t m, TriggerEvent t m, MonadIO (Performable m)) => NominalDiffTime -> Event t a -> m (Event t a)
120−delay dt e = performEventAsync $ ffor e $ \a cb -> liftIO $ void $ forkIO $ do
121− Concurrent.delay $ ceiling $ dt * 1000000
122− cb a
123−
124−-- | Send events with Poisson timing with the given basis and rate
125−-- Each occurrence of the resulting event will contain the index of
126−-- the current interval, with 0 representing the basis time
127−poissonLossyFrom
128− :: (RandomGen g, MonadIO (Performable m), PerformEvent t m, TriggerEvent t m)
129− => g
130− -> Double
131− -- ^ Poisson event rate (Hz)
132− -> UTCTime
133− -- ^ Baseline time for events
134− -> Event t a
135− -- ^ Event that starts a tick generation thread. Usually you want this to
136− -- be something like the result of getPostBuild that only fires once. But
137− -- there could be uses for starting multiple timer threads.
138− -- Start sending events in response to the event parameter.
139− -> m (Event t TickInfo)
140−poissonLossyFrom rnd rate = inhomogeneousPoissonFrom rnd (constant rate) rate
141−
142−
143−-- | Send events with Poisson timing with the given basis and rate
144−-- Each occurrence of the resulting event will contain the index of
145−-- the current interval, with 0 representing the basis time.
146−-- Automatically begin sending events when the DOM is built
147−poissonLossy
148− :: (RandomGen g, MonadIO (Performable m), PerformEvent t m, TriggerEvent t m, PostBuild t m)
149− => g
150− -> Double
151− -- ^ Poisson event rate (Hz)
152− -> UTCTime
153− -- ^ Baseline time for events
154− -> m (Event t TickInfo)
155−poissonLossy rnd rate t0 = poissonLossyFrom rnd rate t0 =<< getPostBuild
156−
157−-- | Send events with inhomogeneous Poisson timing with the given basis
158−-- and variable rate. Provide a maxRate that you expect to support.
159−inhomogeneousPoissonFrom
160− :: (RandomGen g, MonadIO (Performable m), PerformEvent t m, TriggerEvent t m)
161− => g
162− -> Behavior t Double
163− -> Double
164− -> UTCTime
165− -> Event t a
166− -> m (Event t TickInfo)
167−inhomogeneousPoissonFrom rnd rate maxRate t0 e = do
168−
169− -- Create a thread for producing homogeneous poisson events
170− -- along with random Doubles (usage of Double's explained below)
171− ticksWithRateRand <- performEventAsync $
172− fmap callAtNextInterval e
173−
174− -- Filter homogeneous events according to associated
175− -- random values and the current rate parameter
176− return $ attachWithMaybe filterFun rate ticksWithRateRand
177−
178− where
179−
180− -- Inhomogeneous poisson processes are built from faster
181− -- homogeneous ones by randomly dropping events from the
182− -- fast process. For each fast homogeneous event, choose
183− -- a uniform random sample from (0, rMax). If the
184− -- inhomogeneous rate at this moment is greater than the
185− -- random sample, then keep this event, otherwise drop it
186− filterFun :: Double -> (TickInfo, Double) -> Maybe TickInfo
187− filterFun r (tInfo, p)
188− | r >= p = Just tInfo
189− | otherwise = Nothing
190−
191− callAtNextInterval _ cb = void $ liftIO $ forkIO $ go t0 rnd cb 0
192−
193− go tTargetLast lastGen cb lastN = do
194− t <- getCurrentTime
195−
196− -- Generate random numbers for this poisson interval (u)
197− -- and sample-retention likelihood (p)
198− let (u, nextGen) = randomR (0,1) lastGen
199− (p :: Double, nextGen') = randomR (0,maxRate) nextGen
200−
201− -- Inter-event interval is drawn from exponential
202− -- distribution accourding to u
203− let dt = realToFrac $ (-1) * log u / maxRate :: NominalDiffTime
204− nEvents = lastN + 1
205− alreadyElapsed = diffUTCTime t tTargetLast
206− tTarget = addUTCTime dt tTargetLast
207− thisDelay = realToFrac $ diffUTCTime tTarget t :: Double
208− Concurrent.delay $ ceiling $ thisDelay * 1000000
209− _ <- cb (TickInfo t nEvents alreadyElapsed, p)
210− go tTarget nextGen' cb nEvents
211−
212−-- | Send events with inhomogeneous Poisson timing with the given basis
213−-- and variable rate. Provide a maxRate that you expect to support
214−inhomogeneousPoisson
215− :: (RandomGen g, MonadIO (Performable m), PerformEvent t m, TriggerEvent t m, PostBuild t m)
216− => g
217− -> Behavior t Double
218− -> Double
219− -> UTCTime
220− -> m (Event t TickInfo)
221−inhomogeneousPoisson rnd rate maxRate t0 =
222− inhomogeneousPoissonFrom rnd rate maxRate t0 =<< getPostBuild
223−
224−-- | Block occurrences of an Event until the given number of seconds elapses without
225−-- the Event firing, at which point the last occurrence of the Event will fire.
226−debounce :: (MonadFix m, MonadHold t m, PerformEvent t m, TriggerEvent t m, MonadIO (Performable m)) => NominalDiffTime -> Event t a -> m (Event t a)
227−debounce dt e = do
228− n :: Dynamic t Integer <- count e
229− let tagged = attachPromptlyDynWith (,) n e
230− delayed <- delay dt tagged
231− return $ attachWithMaybe (\n' (t, v) -> if n' == t then Just v else Nothing) (current n) delayed
232−
233−-- | When the given 'Event' occurs, wait the given amount of time and collect
234−-- all occurrences during that time. Then, fire the output 'Event' with the
235−-- collected output.
236−batchOccurrences :: (MonadFix m, MonadHold t m, PerformEvent t m, TriggerEvent t m, MonadIO (Performable m)) => NominalDiffTime -> Event t a -> m (Event t (Seq a))
237−batchOccurrences t newValues = do
238− let f s x = (Just newState, out)
239− where newState = case x of
240− This a -> s |> a
241− That _ -> mempty
242− These a _ -> Seq.singleton a
243− out = case x of
244− This _ -> if Seq.null s then Just () else Nothing
245− That _ -> Nothing
246− These _ _ -> Just ()
247− rec (buffer, toDelay) <- mapAccumMaybe f mempty $ align newValues delayed
248− delayed <- delay t toDelay
249− return $ tag buffer delayed
250−
251−-- | Throttle an input event, ensuring that at least a given amount of time passes between occurrences of the output event. If the input event occurs too
252−-- frequently, the output event occurs with the most recently seen input value after the given delay passes since the last occurrence of the output.
253−-- If the output event has not occurred recently, occurrences of the input event will cause the output event to fire immediately.
254−throttle :: (MonadFix m, MonadHold t m, PerformEvent t m, TriggerEvent t m, MonadIO (Performable m)) => NominalDiffTime -> Event t a -> m (Event t a)
255−throttle t e = do
256− let f (immediate, buffer) x = case x of -- (Just newState, out)
257− This a -- If only the input event fires
258− | immediate -> -- and we're in immediate mode
259− -- Immediate mode turns off, and the buffer is empty.
260− -- We fire the output event with the input event value immediately.
261− (Just (False, Nothing), Just a)
262− | otherwise -> -- and we're not in immediate mode
263− -- Immediate mode remains off, and we replace the contents of the buffer (if any) with the input value.
264− -- We don't fire the output event.
265− (Just (False, Just a), Nothing)
266− That _ -> -- If only the delayed output event fires,
267− case buffer of
268− Nothing -> -- and the buffer is empty:
269− -- Immediate mode turns back on, and the buffer remains empty.
270− -- We don't fire.
271− (Just (True, Nothing), Nothing)
272− Just b -> -- and the buffer is full:
273− -- Immediate mode remains off, and the buffer is cleared.
274− -- We fire with the buffered value.
275− (Just (False, Nothing), Just b)
276− These a _ -> -- If both the input and delayed output event fire simultaneously:
277− -- Immediate mode turns off, and the buffer is empty.
278− -- We fire with the input event's value, as it is the most recent we have seen at this moment.
279− (Just (False, Nothing), Just a)
280− rec (_, outE) <- mapAccumMaybeDyn f (True, Nothing) $ align e delayed -- We start in immediate mode with an empty buffer.
281− delayed <- delay t outE
282− return outE
283−
284−data ThrottleState b
285− = ThrottleState_Immediate
286− | ThrottleState_Buffered (ThrottleBuffer b)
287− deriving (Eq, Ord, Show, Functor, Foldable, Traversable, Generic, Data, Typeable)
288−
289−data ThrottleBuffer b
290− = ThrottleBuffer_Empty -- Empty conflicts with lens, and hiding it would require turning
291− -- on PatternSynonyms
292− | ThrottleBuffer_Full b
293− deriving (Eq, Ord, Show, Functor, Foldable, Traversable, Generic, Data, Typeable)
294−
295−instance Semigroup b => Semigroup (ThrottleBuffer b) where
296− x <> y = case x of
297− ThrottleBuffer_Empty -> y
298− ThrottleBuffer_Full b1 -> case y of
299− ThrottleBuffer_Empty -> x
300− ThrottleBuffer_Full b2 -> ThrottleBuffer_Full $ b1 <> b2
301− {-# INLINE (<>) #-}
302−
303−instance Semigroup b => Monoid (ThrottleBuffer b) where
304− mempty = ThrottleBuffer_Empty
305− {-# INLINE mempty #-}
306− mappend = (<>)
307− {-# INLINE mappend #-}
308−
309−-- | Throttle an input event, ensuring that the output event doesn't occur more often than you are ready for it. If the input event occurs too
310−-- frequently, the output event will contain semigroup-based summaries of the input firings that happened since the last output firing.
311−-- If the output event has not occurred recently, occurrences of the input event will cause the output event to fire immediately.
312−-- The first parameter is a function that receives access to the output event, and should construct an event that fires when the receiver is
313−-- ready for more input. For example, using @delay 20@ would give a simple time-based throttle.
314−--
315−-- NB: The provided lag function must *actually* delay the event.
316−throttleBatchWithLag :: (MonadFix m, MonadHold t m, PerformEvent t m, Semigroup a) => (Event t () -> m (Event t ())) -> Event t a -> m (Event t a)
317−-- Invariants:
318−-- * Immediate mode must turn off whenever output is produced.
319−-- * Output must be produced whenever immediate mode turns from on to off.
320−-- * Immediate mode can only go from off to on when the delayed event fires.
321−-- * Every input firing must go into either an immediate output firing or the
322−-- buffer, but not both.
323−-- * An existing full buffer must either stay in the buffer or go to output,
324−-- but not both.
325−throttleBatchWithLag lag e = do
326− let f state x = case x of -- (Just $ newState, out)
327− This a -> -- If only the input event fires
328− case state of
329− ThrottleState_Immediate -> -- and we're in immediate mode
330− -- Immediate mode turns off, and the buffer is empty.
331− -- We fire the output event with the input event value immediately.
332− (Just $ ThrottleState_Buffered $ ThrottleBuffer_Empty, Just a)
333− ThrottleState_Buffered b -> -- and we're not in immediate mode
334− -- Immediate mode remains off, and we accumulate the input value.
335− -- We don't fire the output event.
336− (Just $ ThrottleState_Buffered $ b <> ThrottleBuffer_Full a, Nothing)
337− That _ -> -- If only the delayed output event fires,
338− case state of
339− ThrottleState_Immediate -> -- and we're in immediate mode
340− -- Nothing happens.
341− (Nothing, Nothing)
342− ThrottleState_Buffered ThrottleBuffer_Empty -> -- and the buffer is empty:
343− -- Immediate mode turns back on, and the buffer remains empty.
344− -- We don't fire.
345− (Just ThrottleState_Immediate, Nothing)
346− ThrottleState_Buffered (ThrottleBuffer_Full b) -> -- and the buffer is full:
347− -- Immediate mode remains off, and the buffer is cleared.
348− -- We fire with the buffered value.
349− (Just $ ThrottleState_Buffered ThrottleBuffer_Empty, Just b)
350− These a _ -> -- If both the input and delayed output event fire simultaneously:
351− case state of
352− ThrottleState_Immediate -> -- and we're in immediate mode
353− -- Immediate mode turns off, and the buffer is empty.
354− -- We fire with the input event's value, as it is the most recent we have seen at this moment.
355− (Just $ ThrottleState_Buffered ThrottleBuffer_Empty, Just a)
356− ThrottleState_Buffered ThrottleBuffer_Empty -> -- and the buffer is empty:
357− -- Immediate mode stays off, and the buffer remains empty.
358− -- We fire with the input event's value.
359− (Just $ ThrottleState_Buffered ThrottleBuffer_Empty, Just a)
360− ThrottleState_Buffered (ThrottleBuffer_Full b) -> -- and the buffer is full:
361− -- Immediate mode remains off, and the buffer is cleared.
362− -- We fire with everything including the buffered value.
363− (Just $ ThrottleState_Buffered ThrottleBuffer_Empty, Just (b <> a))
364− rec (_stateDyn, outE) <- mapAccumMaybeDyn f
365− ThrottleState_Immediate -- We start in immediate mode with an empty buffer.
366− (align e delayed)
367− delayed <- lag (void outE)
368− return outE
369−
370−#ifdef USE_TEMPLATE_HASKELL
371−makeLensesWith (lensRules & simpleLenses .~ True) ''TickInfo
372−#else
373−tickInfo_lastUTC :: Lens' TickInfo UTCTime
374−tickInfo_lastUTC f (TickInfo x1 x2 x3) = (\y -> TickInfo y x2 x3) <$> f x1
375−{-# INLINE tickInfo_lastUTC #-}
376−
377−tickInfo_n :: Lens' TickInfo Integer
378−tickInfo_n f (TickInfo x1 x2 x3) = (\y -> TickInfo x1 y x3) <$> f x2
379−{-# INLINE tickInfo_n #-}
380−
381−tickInfo_alreadyElapsed :: Lens' TickInfo NominalDiffTime
382−tickInfo_alreadyElapsed f (TickInfo x1 x2 x3) = (\y -> TickInfo x1 x2 y) <$> f x3
383−{-# INLINE tickInfo_alreadyElapsed #-}
384−#endif
src/Reflex/TriggerEvent/Base.hs+1−16
@@ -13,7 +13,6 @@ module Reflex.TriggerEvent.Base
1313 , EventTriggerRef (..)
1414 ) where
1515
16−import Control.Applicative (liftA2)
1716import Control.Concurrent
1817import Control.Monad.Exception
1918import Control.Monad.Primitive
@@ -22,10 +21,7 @@ import Control.Monad.Ref
2221import Data.Coerce
2322import Data.Dependent.Sum
2423import Data.IORef
25−import Data.Monoid ((<>))
26−import qualified Data.Semigroup as S
2724import Reflex.Class
28−import Reflex.Adjustable.Class
2925import Reflex.Host.Class
3026import Reflex.PerformEvent.Class
3127import Reflex.PostBuild.Class
@@ -122,10 +118,8 @@ instance MonadHold t m => MonadHold t (TriggerEventT t m) where
122118 buildDynamic a0 = lift . buildDynamic a0
123119 {-# INLINABLE headE #-}
124120 headE = lift . headE
125− {-# INLINABLE now #-}
126− now = lift now
127121
128−instance Adjustable t m => Adjustable t (TriggerEventT t m) where
122+instance MonadAdjust t m => MonadAdjust t (TriggerEventT t m) where
129123 {-# INLINABLE runWithReplace #-}
130124 runWithReplace (TriggerEventT a0) a' = TriggerEventT $ runWithReplace a0 (coerceEvent a')
131125 {-# INLINABLE traverseIntMapWithKeyWithAdjust #-}
@@ -135,15 +129,6 @@ instance Adjustable t m => Adjustable t (TriggerEventT t m) where
135129 {-# INLINABLE traverseDMapWithKeyWithAdjustWithMove #-}
136130 traverseDMapWithKeyWithAdjustWithMove f dm0 dm' = TriggerEventT $ traverseDMapWithKeyWithAdjustWithMove (coerce . f) dm0 dm'
137131
138−-- TODO: Monoid and Semigroup can likely be derived once ReaderT has them.
139−instance (Monoid a, Applicative m) => Monoid (TriggerEventT t m a) where
140− mempty = pure mempty
141− mappend = (<>)
142−
143−instance (S.Semigroup a, Applicative m) => S.Semigroup (TriggerEventT t m a) where
144− (<>) = liftA2 (S.<>)
145−
146−
147132-- | Retrieve the current 'Chan'; event trigger invocations pushed into it will
148133-- be fired.
149134askEvents :: Monad m => TriggerEventT t m (Chan [DSum (EventTriggerRef t) TriggerInvocation])
src/Reflex/TriggerEvent/Class.hs+1−6
@@ -2,6 +2,7 @@
22-- new 'Event's that can be triggered from 'IO'.
33{-# LANGUAGE FlexibleInstances #-}
44{-# LANGUAGE FunctionalDependencies #-}
5+{-# LANGUAGE MultiParamTypeClasses #-}
56{-# LANGUAGE UndecidableInstances #-}
67module Reflex.TriggerEvent.Class
78 ( TriggerEvent (..)
@@ -12,7 +13,6 @@ import Reflex.Class
1213import Control.Monad.Reader
1314import Control.Monad.State
1415import qualified Control.Monad.State.Strict as Strict
15−import Control.Monad.Trans.Maybe (MaybeT)
1616
1717--TODO: Shouldn't have IO hard-coded
1818-- | 'TriggerEvent' represents actions that can create 'Event's that can be
@@ -48,8 +48,3 @@ instance TriggerEvent t m => TriggerEvent t (Strict.StateT s m) where
4848 newTriggerEvent = lift newTriggerEvent
4949 newTriggerEventWithOnComplete = lift newTriggerEventWithOnComplete
5050 newEventWithLazyTriggerWithOnComplete = lift . newEventWithLazyTriggerWithOnComplete
51−
52−instance TriggerEvent t m => TriggerEvent t (MaybeT m) where
53− newTriggerEvent = lift newTriggerEvent
54− newTriggerEventWithOnComplete = lift newTriggerEventWithOnComplete
55− newEventWithLazyTriggerWithOnComplete = lift . newEventWithLazyTriggerWithOnComplete
src/Reflex/Widget/Basic.hs+2−4
@@ -10,10 +10,8 @@ module Reflex.Widget.Basic where
1010
1111import Control.Monad.Fix (MonadFix)
1212import Data.Map (Map)
13−
1413import Reflex.Class
15−import Reflex.Adjustable.Class
16−import Data.Patch.MapWithMove
14+import Reflex.Patch.MapWithMove
1715
1816
1917-- | Build sortable content in such a way that re-sorting it can cause minimal
@@ -32,7 +30,7 @@ import Data.Patch.MapWithMove
3230-- > (\k v -> text $ "\n" ++ show k ++ " " ++ v) -- show each element on a new line
3331-- > (Map.fromList $ zip [0..] [(3, "a"), (2, "b"), (1, "c")])
3432-- > sortEvent
35−sortableList :: forall t m k v a. (MonadHold t m, MonadFix m, Adjustable t m, Ord k)
33+sortableList :: forall t m k v a. (MonadHold t m, MonadFix m, MonadAdjust t m, Ord k)
3634 => (k -> v -> m a) -- ^ Function to render the content for each key/value pair
3735 -> Map k v -- ^ The sortable list with an initial ordering determined by the @Map@ keys in ascending order
3836 -> Event t (v -> v -> Ordering) -- ^ An event carrying a sort function for the list
src/Reflex/Workflow.hsdeleted−50
@@ -1,50 +0,0 @@
1−{-# LANGUAGE RecursiveDo #-}
2−{-# LANGUAGE ScopedTypeVariables #-}
3−-- |
4−-- Module:
5−-- Reflex.Workflow
6−-- Description:
7−-- Provides a convenient way to describe a series of interrelated widgets that
8−-- can send data to, invoke, and replace one another. Useful for modeling user interface
9−-- "workflows."
10−module Reflex.Workflow (
11− Workflow (..)
12− , workflow
13− , workflowView
14− , mapWorkflow
15− , mapWorkflowCheap
16− ) where
17−
18−import Control.Arrow ((***))
19−import Control.Monad.Fix (MonadFix)
20−
21−import Reflex.Class
22−import Reflex.Adjustable.Class
23−import Reflex.Network
24−import Reflex.NotReady.Class
25−import Reflex.PostBuild.Class
26−
27−-- | A widget in a workflow
28−-- When the 'Event' returned by a 'Workflow' fires, the current 'Workflow' is replaced by the one inside the firing 'Event'. A series of 'Workflow's must share the same return type.
29−newtype Workflow t m a = Workflow { unWorkflow :: m (a, Event t (Workflow t m a)) }
30−
31−-- | Runs a 'Workflow' and returns the 'Dynamic' result of the 'Workflow' (i.e., a 'Dynamic' of the value produced by the current 'Workflow' node, and whose update 'Event' fires whenever one 'Workflow' is replaced by another).
32−workflow :: forall t m a. (Reflex t, Adjustable t m, MonadFix m, MonadHold t m) => Workflow t m a -> m (Dynamic t a)
33−workflow w0 = do
34− rec eResult <- networkHold (unWorkflow w0) $ fmap unWorkflow $ switch $ snd <$> current eResult
35− return $ fmap fst eResult
36−
37−-- | Similar to 'workflow', but outputs an 'Event' that fires at post-build time and whenever the current 'Workflow' is replaced by the next 'Workflow'.
38−workflowView :: forall t m a. (Reflex t, NotReady t m, Adjustable t m, MonadFix m, MonadHold t m, PostBuild t m) => Workflow t m a -> m (Event t a)
39−workflowView w0 = do
40− rec eResult <- networkView . fmap unWorkflow =<< holdDyn w0 eReplace
41− eReplace <- fmap switch $ hold never $ fmap snd eResult
42− return $ fmap fst eResult
43−
44−-- | Map a function over a 'Workflow', possibly changing the return type.
45−mapWorkflow :: (Reflex t, Functor m) => (a -> b) -> Workflow t m a -> Workflow t m b
46−mapWorkflow f (Workflow x) = Workflow (fmap (f *** fmap (mapWorkflow f)) x)
47−
48−-- | Map a "cheap" function over a 'Workflow'. Refer to the documentation for 'pushCheap' for more information and performance considerations.
49−mapWorkflowCheap :: (Reflex t, Functor m) => (a -> b) -> Workflow t m a -> Workflow t m b
50−mapWorkflowCheap f (Workflow x) = Workflow (fmap (f *** fmapCheap (mapWorkflowCheap f)) x)
stylizedeleted−4
@@ -1,4 +0,0 @@
1−#!/usr/bin/env bash
2−set -euo pipefail
3−
4−for x in **/*.hs ; do stylish-haskell -i "$x" ; done
test/Adjustable.hsdeleted−62
@@ -1,62 +0,0 @@
1−{-# LANGUAGE BangPatterns #-}
2−{-# LANGUAGE LambdaCase #-}
3−{-# LANGUAGE RankNTypes #-}
4−{-# LANGUAGE RecursiveDo #-}
5−
6−module Main where
7−
8−import Control.Monad.Fix
9−import Data.Maybe
10−import qualified Data.Map as Map
11−
12−import Reflex
13−import Reflex.EventWriter.Base
14−import Reflex.Network
15−import Reflex.Patch.MapWithMove
16−import Test.Run
17−
18−main :: IO ()
19−main = do
20− let actions = [ Increment, Update0th, Increment, Swap, Increment, Increment ]
21− os <- runAppB testPatchMapWithMove $ map Just actions
22− -- If the final counter value in the adjusted widgets corresponds to the number of times it has
23− -- been incremented, we know that the networks haven't broken.
24− let expectedCount = length $ ffilter (== Increment) actions
25− -- let !True = last (last os) == [expectedCount,expectedCount] -- TODO re-enable this test after issue #369 has been resolved
26− return ()
27−
28−data PatchMapTestAction
29− = Increment
30− | Swap
31− | Update0th
32− deriving Eq
33−
34−-- See https://github.com/reflex-frp/reflex/issues/369 for the bug that this is testing.
35−testPatchMapWithMove
36− :: forall t m
37− . ( Reflex t
38− , Adjustable t m
39− , MonadHold t m
40− , MonadFix m
41− )
42− => Event t PatchMapTestAction
43− -> m (Behavior t [Int])
44−testPatchMapWithMove pulse = do
45− let pulseAction = ffor pulse $ \case
46− Increment -> Nothing
47− Swap -> patchMapWithMove $ Map.fromList
48− [ (0, NodeInfo (From_Move 1) (Just 1))
49− , (1, NodeInfo (From_Move 0) (Just 0))
50− ]
51− Update0th -> patchMapWithMove $ Map.fromList
52− [ (0, NodeInfo (From_Insert 'z') Nothing) ]
53− (_, result) <- runBehaviorWriterT $ mdo
54− counter <- foldDyn (+) 1 $ fmapMaybe (\e -> if isNothing e then Just 1 else Nothing) pulseAction
55− _ <- mapMapWithAdjustWithMove
56− (\_ _ -> networkHold
57− (tellBehavior $ constant [])
58− ((\t -> tellBehavior $ constant [t]) <$> updated counter))
59− (Map.fromList $ zip [0..] "ab")
60− (fmapMaybe id pulseAction)
61− return ()
62− return result
test/DebugCycles.hsdeleted−171
@@ -1,171 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−{-# LANGUAGE ConstraintKinds #-}
3−{-# LANGUAGE FlexibleContexts #-}
4−{-# LANGUAGE GADTs #-}
5−{-# LANGUAGE RecursiveDo #-}
6−{-# LANGUAGE ScopedTypeVariables #-}
7−{-# LANGUAGE PatternSynonyms #-}
8−{-# LANGUAGE RankNTypes #-}
9−
10−module Main where
11−
12−import Data.Foldable
13−import Control.Lens
14−import Control.Applicative
15−import Control.Monad
16−import Control.Monad.Fix
17−import Control.Exception
18−import System.Timeout
19−import Data.Maybe (isJust)
20−import Data.Functor.Misc
21−import qualified Data.Map as Map
22−import Data.Map (Map)
23−import qualified Data.IntMap as IntMap
24−import Data.IntMap (IntMap)
25−import Data.These
26−import Data.Align
27−import Reflex
28−import Reflex.EventWriter.Base
29−import Test.Run
30−import Test.Hspec
31−import Reflex.Spider.Internal (EventLoopException)
32−import Data.Witherable (Filterable)
33−
34−#if defined(MIN_VERSION_these_lens) || (MIN_VERSION_these(0,8,0) && !MIN_VERSION_these(0,9,0))
35−import Data.These.Lens
36−#endif
37−
38−type Widget t m = (MonadHold t m, Reflex t, MonadFix m)
39−
40−connectDyn :: Widget t m => Event t () -> (Dynamic t a, Dynamic t a) -> m (Dynamic t a)
41−connectDyn e (d, d') = do
42− dd <- holdDyn d (d' <$ e)
43− return $ join dd
44−
45−dynLoop :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
46−dynLoop (e1, e2) = do
47− -- "heightBagRemove: Height 2 not present in bag HeightBag {_heightBag_size = 2, _heightBag_contents = fromList [(0,1)]}"
48− rec
49− d <- count e1
50− d' <- connectDyn e2 (d, liftA2 (+) d d')
51− return $ updated d'
52−
53−connectOnCoincidence :: Widget t m => Event t () -> Event t a -> m (Event t a)
54−connectOnCoincidence click e = do
55− d <- holdDyn never (e <$ click)
56− return $ coincidence (updated d)
57−
58−coincidenceLoop :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
59−coincidenceLoop (e1, e2) = do
60−-- "heightBagRemove: Height 1 not present in bag HeightBag {_heightBag_size = 1, _heightBag_contents = fromList [(0,0)]}"
61−-- (simpler version of dynLoop)
62− rec
63− e' <- connectOnCoincidence e2 (updated d)
64− d <- count (align e' e1)
65− return $ updated d
66−
67−addHeight :: Reflex t => Event t a -> Event t a
68−addHeight e = leftmost [e4, e4] where
69− e1 = leftmost [e, e]
70− e2 = leftmost [e1, e1]
71− e3 = leftmost [e2, e2]
72− e4 = leftmost [e3, e3]
73−
74−-- Take an existing test and build it inside a
75−buildLoop :: Widget t m => (forall t m. Widget t m => (Event t Int, Event t ()) -> m (Event t Int)) -> (Event t Int, Event t ()) -> m (Event t Int)
76−buildLoop test (e1, e2) = switchHold never buildLoop
77− where buildLoop = pushAlways (const $ test (e1, e2)) e2
78−
79−connectButtonPromptly :: Widget t m => Event t () -> Event t a -> m (Event t a)
80−connectButtonPromptly click e = do
81− d <- holdDyn never (e <$ click)
82− return (switchDyn d)
83−
84−connectButton :: Widget t m => Event t () -> Event t a -> m (Event t a)
85−connectButton click e = do
86− d <- hold never (e <$ click)
87− return (switch d)
88−
89−switchLoop01 :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
90−switchLoop01 (e1, e2) = do
91− rec
92− e' <- connectButton e2 (updated d)
93− d <- count (align e' e1)
94− return $ updated d
95−
96−mergeLoop :: forall t m. (Adjustable t m, Widget t m) => (Event t Int, Event t ()) -> m (Event t Int)
97−mergeLoop (e1, e2) = do
98− rec
99− (_, e) <- runEventWriterT $
100− runWithReplace w (leftmost [w <$ e1])
101− return (sum <$> e)
102− where
103− w = do
104− c <- count e1
105− tellEvent (updated ((pure <$> c) :: Dynamic t [Int]))
106−
107−switchLoop02 :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
108−switchLoop02 (e1, e2) = do
109− rec
110− e' <- connectButton e2 (updated d)
111− d <- count (leftmost [e', e1])
112− return $ updated d
113−
114−switchLoop03 :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
115−switchLoop03 (e1, e2) = do
116− rec
117− e' <- connectButton e2 (addHeight $ updated d)
118− d <- count (align e' e1)
119− return $ updated d
120−
121−staticLoop01 :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
122−staticLoop01 (e1, e2) = do
123− rec
124− d <- foldDyn (+) (0 :: Int) (1 <$ align e1 (updated d))
125− return $ updated d
126−
127−staticLoop02 :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
128−staticLoop02 (e1, e2) = do
129− rec
130− d <- foldDyn (+) (0 :: Int) (leftmost [e1, updated d])
131− return $ updated d
132−
133−buildStaticLoop :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
134−buildStaticLoop (e1, e2) = switchHold never buildLoop
135− where buildLoop = pushAlways (const $ staticLoop01 (e1, e2)) e2
136−
137−splitThese :: Filterable f => f (These a b) -> (f a, f b)
138−splitThese f = (mapMaybe (preview here) f, mapMaybe (preview there) f)
139−
140−main :: IO ()
141−main = hspec $ do
142− describe "DebugCycles" $ do
143− it "throws EventLoopException on switchLoop01" $ do
144− check switchLoop01
145− it "throws EventLoopException on switchLoop02" $ do
146− check switchLoop02
147− it "throws EventLoopException on switchLoop03" $ do
148− check switchLoop03
149− it "throws EventLoopException on buildSwitchLoop" $ do
150− check $ buildLoop switchLoop01
151− xit "throws EventLoopException on mergeLoop" $ do
152− check mergeLoop
153− xit "throws EventLoopException on staticLoop01" $ do
154− check staticLoop01
155− xit "throws EventLoopException on staticLoop02" $ do
156− check staticLoop02
157− xit "throws EventLoopException on buildStaticLoop" $ do
158− check buildStaticLoop
159− xit "throws EventLoopException on coincidenceLoop" $ do
160− check coincidenceLoop
161− xit "throws EventLoopException on dynLoop" $ do
162− check dynLoop
163− xit "throws EventLoopException on buildCoincidenceLoop" $ do
164− check $ buildLoop coincidenceLoop
165− where
166− milliseconds = (*1000)
167− occs = [ This 1, This 2, That (), This 3, That (), This 1 ]
168− check test = do
169− let action = timeout (milliseconds 50) $ do
170− runApp' (test . splitThese) (Just <$> occs)
171− action `shouldThrow` (const True :: Selector EventLoopException)
test/EventWriterT.hs+6−96
@@ -1,25 +1,12 @@
1−{-# LANGUAGE CPP #-}
2−{-# LANGUAGE BangPatterns #-}
3−{-# LANGUAGE FlexibleContexts #-}
4−{-# LANGUAGE GADTs #-}
5−{-# LANGUAGE RecursiveDo #-}
6−{-# LANGUAGE ScopedTypeVariables #-}
1+{-# LANGUAGE FlexibleContexts, GADTs #-}
72module Main where
83
94import Control.Lens
105import Control.Monad
11−import Control.Monad.Fix
12−import qualified Data.Dependent.Map as DMap
13−import Data.Functor.Misc
14−import qualified Data.Map as M
156import Data.These
167
17−#if defined(MIN_VERSION_these_lens) || (MIN_VERSION_these(0,8,0) && !MIN_VERSION_these(0,9,0))
18−import Data.These.Lens
19−#endif
20−
218import Reflex
22−import Reflex.EventWriter.Base
9+import Reflex.EventWriter
2310import Test.Run
2411
2512main :: IO ()
@@ -36,15 +23,6 @@ main = do
3623 , These () ()
3724 ]
3825 print os2
39− os3@[[Nothing, Just [2]]] <- runApp' (unwrapApp testMoribundTellEvent) [Just ()]
40− print os3
41− os4@[[Nothing, Just [2]]] <- runApp' (unwrapApp testMoribundTellEventDMap) [Just ()]
42− print os4
43− os5@[[Nothing, Just [1, 2]]] <- runApp' (unwrapApp testLiveTellEventDMap) [Just ()]
44− print os5
45− os6 <- runApp' (unwrapApp delayedPulse) [Just ()]
46− print os6
47− let ![[Nothing, Nothing]] = os6
4826 return ()
4927
5028unwrapApp :: (Reflex t, Monad m) => (a -> EventWriterT t [Int] m ()) -> a -> m (Event t [Int])
@@ -53,82 +31,14 @@ unwrapApp x appIn = do
5331 return e
5432
5533testOrdering :: (Reflex t, Monad m) => Event t () -> EventWriterT t [Int] m ()
56−testOrdering pulse = forM_ [10,9..1] $ \i -> tellEvent ([i] <$ pulse)
34+testOrdering pulse = do
35+ forM_ [10,9..1] $ \i -> tellEvent ([i] <$ pulse)
36+ return ()
5737
58−testSimultaneous :: (Reflex t, Adjustable t m, MonadHold t m) => Event t (These () ()) -> EventWriterT t [Int] m ()
38+testSimultaneous :: (Reflex t, MonadAdjust t m, MonadHold t m) => Event t (These () ()) -> EventWriterT t [Int] m ()
5939testSimultaneous pulse = do
6040 let e0 = fmapMaybe (^? here) pulse
6141 e1 = fmapMaybe (^? there) pulse
6242 forM_ [1,3..9] $ \i -> runWithReplace (tellEvent ([i] <$ e0)) $ ffor e1 $ \_ -> tellEvent ([i+1] <$ e0)
63−
64−-- | Test that a widget telling and event which fires at the same time it has been replaced
65−-- doesn't count along with the new widget.
66−testMoribundTellEvent
67− :: forall t m
68− . ( Reflex t
69− , Adjustable t m
70− , MonadHold t m
71− , MonadFix m
72− )
73− => Event t ()
74− -> EventWriterT t [Int] m ()
75−testMoribundTellEvent pulse = do
76− rec let tellIntOnReplace :: Int -> EventWriterT t [Int] m ()
77− tellIntOnReplace x = tellEvent $ [x] <$ rwrFinished
78− (_, rwrFinished) <- runWithReplace (tellIntOnReplace 1) $ tellIntOnReplace 2 <$ pulse
79− return ()
80−
81−-- | The equivalent of 'testMoribundTellEvent' for 'traverseDMapWithKeyWithAdjust'.
82−testMoribundTellEventDMap
83− :: forall t m
84− . ( Reflex t
85− , Adjustable t m
86− , MonadHold t m
87− , MonadFix m
88− )
89− => Event t ()
90− -> EventWriterT t [Int] m ()
91−testMoribundTellEventDMap pulse = do
92− rec let tellIntOnReplace :: Int -> EventWriterT t [Int] m ()
93− tellIntOnReplace x = tellEvent $ [x] <$ rwrFinished
94− (_, rwrFinished :: Event t (PatchDMap (Const2 () Int) Identity)) <-
95− traverseDMapWithKeyWithAdjust
96− (\(Const2 ()) (Identity v) -> Identity . const v <$> tellIntOnReplace v)
97− (mapToDMap $ M.singleton () 1)
98− ((PatchDMap $ DMap.map (ComposeMaybe . Just) $ mapToDMap $ M.singleton () 2) <$ pulse)
99− return ()
100−
101−-- | Ensures that elements which are _not_ removed can still fire 'tellEvent's
102−-- during the same frame as other elements are updated.
103−testLiveTellEventDMap
104− :: forall t m
105− . ( Reflex t
106− , Adjustable t m
107− , MonadHold t m
108− , MonadFix m
109− )
110− => Event t ()
111− -> EventWriterT t [Int] m ()
112−testLiveTellEventDMap pulse = do
113− rec let tellIntOnReplace :: Int -> EventWriterT t [Int] m ()
114− tellIntOnReplace x = tellEvent $ [x] <$ rwrFinished
115− (_, rwrFinished :: Event t (PatchDMap (Const2 Int ()) Identity)) <-
116− traverseDMapWithKeyWithAdjust
117− (\(Const2 k) (Identity ()) -> Identity <$> tellIntOnReplace k)
118− (mapToDMap $ M.singleton 1 ())
119− ((PatchDMap $ DMap.map (ComposeMaybe . Just) $ mapToDMap $ M.singleton 2 ()) <$ pulse)
12043 return ()
12144
122−delayedPulse
123− :: forall t m
124− . ( Reflex t
125− , Adjustable t m
126− , MonadHold t m
127− , MonadFix m
128− )
129− => Event t ()
130− -> EventWriterT t [Int] m ()
131−delayedPulse pulse = void $ flip runWithReplace (pure () <$ pulse) $ do
132− -- This has the effect of delaying pulse' from pulse
133− (_, pulse') <- runWithReplace (pure ()) $ pure [1] <$ pulse
134− tellEvent pulse'
test/GC.hs+8−14
@@ -1,9 +1,4 @@
1−{-# LANGUAGE FlexibleContexts #-}
2−{-# LANGUAGE GADTs #-}
3−{-# LANGUAGE OverloadedStrings #-}
4−{-# LANGUAGE RankNTypes #-}
5−{-# LANGUAGE ScopedTypeVariables #-}
6−{-# LANGUAGE TypeFamilies #-}
1+{-# LANGUAGE OverloadedStrings, FlexibleContexts, GADTs, TypeFamilies, RankNTypes, ScopedTypeVariables #-}
72module Main where
83
94import Control.Monad
@@ -18,17 +13,15 @@ import Data.GADT.Compare
1813import Data.IORef
1914import Data.Semigroup
2015import Data.These
21−import Data.Type.Equality ((:~:)(Refl))
2216
2317import Data.Functor.Misc
24−import Data.Patch
18+import Reflex.Patch
2519
26−import qualified Reflex.Host.Class as Host
2720import qualified Reflex.Spider.Internal as S
21+import qualified Reflex.Host.Class as Host
2822
29−import System.Exit
3023import System.Mem
31−import Data.Coerce
24+import System.Exit
3225
3326main :: IO ()
3427main = do
@@ -48,7 +41,7 @@ hostPerf ref = S.runSpiderHost $ do
4841 eventToPerform <- Host.runHostFrame $ do
4942 (reqMap :: S.Event S.Global (DMap (Const2 Int (DMap Tell (S.SpiderHostFrame S.Global))) Identity))
5043 <- S.SpiderHostFrame
51− $ fmap ( S.mergeG coerce
44+ $ fmap ( S.merge
5245 . S.dynamicHold)
5346 $ S.hold DMap.empty
5447 -- Construct a new heap object for the subscriber, invalidating any weak references to the subscriber if they are not retained
@@ -57,8 +50,8 @@ hostPerf ref = S.runSpiderHost $ do
5750 { S.subscriberPropagate = S.subscriberPropagate sub
5851 }
5952 return (s, o))
60− $ runIdentity . runIdentity <$> S.selectG
61− (S.fanG $ S.pushCheap (return . Just . mapKeyValuePairsMonotonic (\(t :=> e) -> WrapArg t :=> Identity e)) response)
53+ $ runIdentity <$> S.select
54+ (S.fan $ S.pushCheap (return . Just . mapKeyValuePairsMonotonic (\(t :=> e) -> WrapArg t :=> Identity e)) response)
6255 (WrapArg Request)
6356 return $ alignWith (mergeThese (<>))
6457 (flip S.pushCheap eadd $ \_ -> return $ Just $ DMap.singleton Request $ do
@@ -84,6 +77,7 @@ hostPerf ref = S.runSpiderHost $ do
8477 Nothing -> []
8578 Host.fireEventsAndRead followupEventTriggers $ return ()
8679 return ()
80+ return ()
8781
8882data Tell a where
8983 Action :: Tell ()
test/Headless.hsdeleted−10
@@ -1,10 +0,0 @@
1−module Main where
2−
3−import Reflex
4−import Reflex.Host.Headless (runHeadlessApp)
5−
6−main :: IO ()
7−main = do
8− runHeadlessApp $ do
9− pb <- getPostBuild
10− performEvent (pure <$> pb)
test/QueryT.hs+21−24
@@ -1,30 +1,23 @@
1−{-# LANGUAGE CPP #-}
21{-# LANGUAGE DeriveFunctor #-}
32{-# LANGUAGE FlexibleContexts #-}
3+{-# LANGUAGE TypeFamilies #-}
44{-# LANGUAGE GeneralizedNewtypeDeriving #-}
55{-# LANGUAGE LambdaCase #-}
66{-# LANGUAGE RankNTypes #-}
7−{-# LANGUAGE StandaloneDeriving #-}
8−{-# LANGUAGE TypeFamilies #-}
9−{-# LANGUAGE UndecidableInstances #-}
107
118import Control.Lens
129import Control.Monad.Fix
1310import Data.Align
11+import Data.AppendMap (AppendMap)
1412import qualified Data.AppendMap as AMap
1513import Data.Functor.Misc
1614import Data.Map (Map)
1715import qualified Data.Map as Map
18−import Data.Map.Monoidal (MonoidalMap)
1916import Data.Semigroup
2017import Data.These
2118
22−#if defined(MIN_VERSION_these_lens) || (MIN_VERSION_these(0,8,0) && !MIN_VERSION_these(0,9,0))
23−import Data.These.Lens
24−#endif
25−
2619import Reflex
27−import Data.Patch.MapWithMove
20+import Reflex.Patch.MapWithMove
2821import Test.Run
2922
3023newtype MyQuery = MyQuery SelectedCount
@@ -34,18 +27,14 @@ instance Query MyQuery where
3427 type QueryResult MyQuery = ()
3528 crop _ _ = ()
3629
37−instance (Ord k, Query a, Eq (QueryResult a), Align (MonoidalMap k)) => Query (Selector k a) where
30+instance (Ord k, Query a, Eq (QueryResult a)) => Query (Selector k a) where
3831 type QueryResult (Selector k a) = Selector k (QueryResult a)
3932 crop q r = undefined
4033
41−newtype Selector k a = Selector { unSelector :: MonoidalMap k a }
34+newtype Selector k a = Selector { unSelector :: AppendMap k a }
4235 deriving (Show, Read, Eq, Ord, Functor)
4336
44−#if !(MIN_VERSION_monoidal_containers(0,4,1))
45−deriving instance Ord k => Align (MonoidalMap k)
46−#endif
47−
48−instance (Ord k, Eq a, Monoid a, Align (MonoidalMap k)) => Semigroup (Selector k a) where
37+instance (Ord k, Eq a, Monoid a) => Semigroup (Selector k a) where
4938 (Selector a) <> (Selector b) = Selector $ fmapMaybe id $ f a b
5039 where
5140 f = alignWith $ \case
@@ -55,14 +44,14 @@ instance (Ord k, Eq a, Monoid a, Align (MonoidalMap k)) => Semigroup (Selector k
5544 let z = x `mappend` y
5645 in if z == mempty then Nothing else Just z
5746
58−instance (Ord k, Eq a, Monoid a, Align (MonoidalMap k)) => Monoid (Selector k a) where
47+instance (Ord k, Eq a, Monoid a) => Monoid (Selector k a) where
5948 mempty = Selector AMap.empty
6049 mappend = (<>)
6150
62−instance (Eq a, Ord k, Group a, Align (MonoidalMap k)) => Group (Selector k a) where
51+instance (Eq a, Ord k, Group a) => Group (Selector k a) where
6352 negateG = fmap negateG
6453
65−instance (Eq a, Ord k, Group a, Align (MonoidalMap k)) => Additive (Selector k a)
54+instance (Eq a, Ord k, Group a) => Additive (Selector k a)
6655
6756main :: IO ()
6857main = do
@@ -92,7 +81,7 @@ testQueryT w (AppIn _ pulse) = do
9281 }
9382
9483testRunWithReplace :: ( Reflex t
95− , Adjustable t m
84+ , MonadAdjust t m
9685 , MonadHold t m
9786 , MonadFix m
9887 , MonadQuery t (Selector Int MyQuery) m)
@@ -107,7 +96,7 @@ testRunWithReplace replace increment = do
10796 return ()
10897
10998testSequenceDMapWithAdjust :: ( Reflex t
110− , Adjustable t m
99+ , MonadAdjust t m
111100 , MonadHold t m
112101 , MonadFix m
113102 , MonadQuery t (Selector Int MyQuery) m)
@@ -121,7 +110,7 @@ testSequenceDMapWithAdjust replace increment = do
121110 return ()
122111
123112testSequenceDMapWithAdjustWithMove :: ( Reflex t
124− , Adjustable t m
113+ , MonadAdjust t m
125114 , MonadHold t m
126115 , MonadFix m
127116 , MonadQuery t (Selector Int MyQuery) m)
@@ -134,8 +123,16 @@ testSequenceDMapWithAdjustWithMove replace increment = do
134123 queryDyn $ zipDynWith (\x y -> Selector (AMap.singleton (x :: Int) y)) n $ pure $ MyQuery $ SelectedCount 1
135124 return ()
136125
126+listHoldWithKey :: forall t m k v a. (Ord k, MonadHold t m, MonadAdjust t m) => Map k v -> Event t (Map k (Maybe v)) -> (k -> v -> m a) -> m (Dynamic t (Map k a))
127+listHoldWithKey m0 m' f = do
128+ let dm0 = mapWithFunctorToDMap $ Map.mapWithKey f m0
129+ dm' = fmap (PatchDMap . mapWithFunctorToDMap . Map.mapWithKey (\k v -> ComposeMaybe $ fmap (f k) v)) m'
130+ (a0, a') <- sequenceDMapWithAdjust dm0 dm'
131+ fmap dmapToMap . incrementalToDynamic <$> holdIncremental a0 a'
132+
133+
137134-- scam it out to test traverseDMapWithAdjustWithMove
138−listHoldWithKeyWithMove :: forall t m k v a. (Ord k, MonadHold t m, Adjustable t m) => Map k v -> Event t (Map k (Maybe v)) -> (k -> v -> m a) -> m (Dynamic t (Map k a))
135+listHoldWithKeyWithMove :: forall t m k v a. (Ord k, MonadHold t m, MonadAdjust t m) => Map k v -> Event t (Map k (Maybe v)) -> (k -> v -> m a) -> m (Dynamic t (Map k a))
139136listHoldWithKeyWithMove m0 m' f = do
140137 (n0, n') <- mapMapWithAdjustWithMove f m0 $ ffor m' $ PatchMapWithMove . Map.map (\v -> NodeInfo (maybe From_Delete From_Insert v) Nothing)
141138 incrementalToDynamic <$> holdIncremental n0 n'
test/Reflex/Bench/Focused.hs+1−13
@@ -130,16 +130,6 @@ mapDynChain = iterM (return . fmap (+1))
130130joinDynChain :: (Reflex t, MonadHold t m) => Word -> Dynamic t Word -> m (Dynamic t Word)
131131joinDynChain = iterM (\d -> return $ join $ fmap (const d) d)
132132
133−holdDynChain :: (Reflex t, MonadHold t m) => Word -> Dynamic t Word -> m (Dynamic t Word)
134−holdDynChain = iterM (\d -> sample (current d) >>= flip holdDyn (updated d))
135−
136−buildDynChain :: (Reflex t, MonadHold t m) => Word -> Dynamic t Word -> m (Dynamic t Word)
137−buildDynChain = iterM (\d -> do
138− let b = fmap (+1) (current d)
139− e = fmap (*2) (updated d)
140− buildDynamic (sample b) e)
141−
142−
143133combineDynChain :: (Reflex t, MonadHold t m) => Word -> Dynamic t Word -> m (Dynamic t Word)
144134combineDynChain = iterM (\d -> return $ zipDynWith (+) d d)
145135
@@ -194,7 +184,7 @@ switchMergeBehaviors mapChanges = pull . joinMap <$> holdMap mapChanges
194184
195185-- | Turn an UpdatedMap into a Dynamic by applying the differences to the initial value
196186holdMapDyn :: (Reflex t, MonadHold t m, MonadFix m, Ord k) => UpdatedMap t k a -> m (Dynamic t (Map k a))
197−holdMapDyn (UpdatedMap initial changes) = foldDyn (flip (Map.foldrWithKey modify)) initial changes
187+holdMapDyn (UpdatedMap initial changes) = foldDyn (flip (Map.foldWithKey modify)) initial changes
198188
199189 where
200190 modify k Nothing items = Map.delete k items
@@ -318,8 +308,6 @@ dynamics :: Word -> [(String, TestCase)]
318308dynamics n =
319309 [ testE "mapDynChain" $ fmap updated $ mapDynChain n =<< d
320310 , testE "joinDynChain" $ fmap updated $ joinDynChain n =<< d
321− , testE "holdDynChain" $ fmap updated $ holdDynChain n =<< d
322− , testE "buildDynChain" $ fmap updated $ buildDynChain n =<< d
323311 , testE "combineDynChain" $ fmap updated $ combineDynChain n =<< d
324312 , testE "dense mergeTree" $ fmap (updated . mergeTreeDyn 8) dense
325313 , testE "sparse mergeTree" $ fmap (updated . mergeTreeDyn 8) sparse
test/Reflex/Plan/Pure.hs+4−5
@@ -41,7 +41,6 @@ instance MonadHold (Pure Int) PurePlan where
4141 holdIncremental initial = liftPlan . holdIncremental initial
4242 buildDynamic getInitial = liftPlan . buildDynamic getInitial
4343 headE = liftPlan . headE
44− now = liftPlan now
4544
4645instance MonadSample (Pure Int) PurePlan where
4746 sample = liftPlan . sample
@@ -56,15 +55,15 @@ instance TestPlan (Pure Int) PurePlan where
5655runPure :: PurePlan a -> (a, IntSet)
5756runPure (PurePlan p) = runStateT p mempty $ 0
5857
59−relevantTimes :: IntSet -> IntSet
60−relevantTimes occs = IntSet.fromList [0..l + 1]
58+relavantTimes :: IntSet -> IntSet
59+relavantTimes occs = IntSet.fromList [0..l + 1]
6160 where l = fromMaybe 0 (fst <$> IntSet.maxView occs)
6261
6362testBehavior :: (Behavior (Pure Int) a, IntSet) -> IntMap a
64−testBehavior (b, occs) = IntMap.fromSet (sample b) (relevantTimes occs)
63+testBehavior (b, occs) = IntMap.fromSet (sample b) (relavantTimes occs)
6564
6665testEvent :: (Event (Pure Int) a, IntSet) -> IntMap (Maybe a)
67−testEvent (Event readEvent, occs) = IntMap.fromSet readEvent (relevantTimes occs)
66+testEvent (Event readEvent, occs) = IntMap.fromSet readEvent (relavantTimes occs)
6867
6968
7069
test/Reflex/Plan/Reflex.hs+2−2
@@ -74,13 +74,13 @@ deriving instance ReflexHost t => MonadFix (Plan t)
7474
7575
7676instance (ReflexHost t, MonadRef (HostFrame t), Ref (HostFrame t) ~ Ref IO) => TestPlan t (Plan t) where
77− plan occurrences = Plan $ do
77+ plan occurances = Plan $ do
7878 (e, ref) <- newEventWithTriggerRef
7979 modify (IntMap.unionWith mappend (firings ref))
8080 return e
8181
8282 where
83− firings ref = IntMap.fromList (makeFiring ref <$> occurrences)
83+ firings ref = IntMap.fromList (makeFiring ref <$> occurances)
8484 makeFiring ref (t, a) = (fromIntegral t, [Firing ref a])
8585
8686
test/Reflex/Test/CrossImpl.hs+28−37
@@ -12,6 +12,7 @@
1212{-# LANGUAGE TypeFamilies #-}
1313{-# LANGUAGE TypeOperators #-}
1414{-# LANGUAGE UndecidableInstances #-}
15+module Reflex.Test.CrossImpl (test) where
1516
1617import Prelude hiding (and, foldl, mapM, mapM_, sequence, sequence_)
1718
@@ -19,23 +20,27 @@ import Control.Monad.Ref
1920import Reflex.Class
2021import Reflex.Dynamic
2122import Reflex.Host.Class
23+import qualified Reflex.Patch.DMapWithMove as PatchDMapWithMove
2224import qualified Reflex.Pure as P
2325import qualified Reflex.Spider.Internal as S
24−import qualified Reflex.Profiled as Prof
2526
2627import Control.Arrow (second, (&&&))
2728import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
2829import Control.Monad.State.Strict hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
29−import Data.Dependent.Sum (DSum (..))
30+import Control.Monad.Writer hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
31+import Data.Dependent.Map (DMap, DSum (..))
32+import qualified Data.Dependent.Map as DMap
3033import Data.Foldable
34+import Data.Functor.Misc
3135import Data.Map.Strict (Map)
3236import qualified Data.Map.Strict as Map
3337import qualified Data.Set as Set
34−import Data.Monoid
3538import Data.Traversable
3639import System.Exit
3740import System.Mem
3841
42+import System.IO.Unsafe
43+
3944mapToPureBehavior :: Map Int a -> Behavior PureReflexDomain a
4045mapToPureBehavior m = P.Behavior $ \t -> case Map.lookupLE t m of
4146 Nothing -> error $ "mapToPureBehavior: no value for time " <> show t
@@ -72,14 +77,11 @@ instance MapMSignals (Event t a) (Event t' a) t t' where
7277instance (MapMSignals a a' t t', MapMSignals b b' t t') => MapMSignals (a, b) (a', b') t t' where
7378 mapMSignals fb fe (a, b) = liftM2 (,) (mapMSignals fb fe a) (mapMSignals fb fe b)
7479
75−testTimeline
76− :: (forall m t. TestCaseConstraint t m => (Behavior t a, Event t b) -> m (Behavior t c, Event t d))
77− -> (Map Int a, Map Int b)
78− -> (forall m t. (MonadReflexHost t m, MonadIO m, MonadRef m, Ref m ~ Ref IO, MonadSample t m) => m (Map Int c, Map Int d))
79−testTimeline builder (bMap, eMap) = do
80+testSpider :: (forall m t. TestCaseConstraint t m => (Behavior t a, Event t b) -> m (Behavior t c, Event t d)) -> (Map Int a, Map Int b) -> (Map Int c, Map Int d)
81+testSpider builder (bMap, eMap) = unsafePerformIO $ S.runSpiderHost $ do
8082 (re, reTrigger) <- newEventWithTriggerRef
8183 (rb, rbTrigger) <- newEventWithTriggerRef
82− b <- runHostFrame $ hold (error "testTimeline: No value for input behavior yet") rb
84+ b <- runHostFrame $ hold (error "testSpider: No value for input behavior yet") rb
8385 (b', e') <- runHostFrame $ builder (b, re)
8486 e'Handle <- subscribeEvent e' --TODO: This should be unnecessary
8587 let times = relevantTestingTimes (bMap, eMap)
@@ -104,11 +106,9 @@ testAgreement :: (Eq c, Eq d, Show c, Show d) => (forall m t. TestCaseConstraint
104106testAgreement builder inputs = do
105107 let identityResult = testPure builder inputs
106108 tracePerf "---------" $ return ()
107− spiderResult <- S.runSpiderHost $ testTimeline builder inputs
108− tracePerf "---------" $ return ()
109− profiledResult <- S.runSpiderHost $ Prof.runProfiledM $ testTimeline builder inputs
109+ let spiderResult = testSpider builder inputs
110110 tracePerf "---------" $ return ()
111− let resultsAgree = identityResult == spiderResult && identityResult == profiledResult
111+ let resultsAgree = identityResult == spiderResult
112112 if resultsAgree
113113 then do --putStrLn "Success:"
114114 --print identityResult
@@ -116,7 +116,6 @@ testAgreement builder inputs = do
116116 else do putStrLn "Failure:"
117117 putStrLn $ "Pure result: " <> show identityResult
118118 putStrLn $ "Spider result: " <> show spiderResult
119− putStrLn $ "Profiled result: " <> show profiledResult
120119 return resultsAgree
121120
122121type TestCaseConstraint t m = (Reflex t, MonadSample t m, MonadHold t m, MonadFix m, MonadFix (PushM t))
@@ -156,35 +155,35 @@ testCases =
156155 let e' = leftmost [e, e]
157156 e'' <- switch <$> hold e' (fmap (const e) e)
158157 return (b, e'')
159− , (,) "switchHoldPromptly-1" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
158+ , (,) "switchPromptly-1" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
160159 let e' = fmap (const e) e
161− e'' <- switchHoldPromptly never e'
160+ e'' <- switchPromptly never e'
162161 return (b, e'')
163− , (,) "switchHoldPromptly-2" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
162+ , (,) "switchPromptly-2" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
164163 let e' = fmap (const e) e
165− e'' <- switchHoldPromptly never $ leftmost [e', e']
164+ e'' <- switchPromptly never $ leftmost [e', e']
166165 return (b, e'')
167− , (,) "switchHoldPromptly-3" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
166+ , (,) "switchPromptly-3" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
168167 let e' = leftmost [e, e]
169− e'' <- switchHoldPromptly never (fmap (const e) e')
168+ e'' <- switchPromptly never (fmap (const e) e')
170169 return (b, e'')
171− , (,) "switchHoldPromptly-4" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj"), (3, "asdf")]) $ \(b, e) -> do
170+ , (,) "switchPromptly-4" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj"), (3, "asdf")]) $ \(b, e) -> do
172171 let e' = leftmost [e, e]
173− e'' <- switchHoldPromptly never (fmap (const e') e)
172+ e'' <- switchPromptly never (fmap (const e') e)
174173 return (b, e'')
175174 , (,) "switch-5" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
176175 let e' = leftmost [e, e]
177176 e'' <- switch <$> hold never (fmap (const e') e)
178177 return (b, e'')
179− , (,) "switchHoldPromptly-5" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
178+ , (,) "switchPromptly-5" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
180179 let e' = flip push e $ \_ -> do
181180 Just <$> headE e
182− e'' <- switchHoldPromptly never e'
181+ e'' <- switchPromptly never e'
183182 return (b, e'')
184− , (,) "switchHoldPromptly-6" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
183+ , (,) "switchPromptly-6" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
185184 let e' = flip pushAlways e $ \_ -> do
186− switchHoldPromptly e never
187− e'' <- switchHoldPromptly never e'
185+ switchPromptly e never
186+ e'' <- switchPromptly never e'
188187 return (b, e'')
189188 , (,) "coincidence-1" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
190189 let e' = flip pushAlways e $ \_ -> return e
@@ -223,11 +222,6 @@ testCases =
223222 bb <- hold b $ pushAlways (const $ hold "asdf" eo) eo
224223 let b' = pull $ sample =<< sample bb
225224 return (b', e)
226− , (,) "foldDynWhileFiring" $ TestCase (Map.singleton 0 "zxc", Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(_, e) -> do
227− d <- foldDyn (:) [] $
228− pushAlways (\a -> foldDyn (:) [a] e) e
229− let b = current (join (fmap distributeListOverDynPure d))
230− return (b, e)
231225 , (,) "joinDyn" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
232226 bb <- hold "b" e
233227 bd <- hold never . fmap (const e) =<< headE e
@@ -239,9 +233,6 @@ testCases =
239233 rec result <- holdUniqDyn d
240234 d <- holdDyn (0 :: Int) e
241235 return (current result, updated result)
242−
243−
244−
245236 {-
246237 , (,) "mergeIncrementalWithMove" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, PatchDMapWithMove.moveDMapKey LeftTag RightTag), (2, mempty)]) $ \(b, e :: Event t (PatchDMapWithMove (EitherTag () ()) (Const2 () ()))) -> do
247238 x <- holdIncremental (DMap.singleton LeftTag $ void e) $ PatchDMapWithMove.mapPatchDMapWithMove (\(Const2 _) -> void e) <$> e
@@ -257,8 +248,8 @@ splitRecombineEvent e =
257248 in leftmost [ea, eb]
258249
259250
260−main :: IO ()
261−main = do
251+test :: IO ()
252+test = do
262253 results <- forM testCases $ \(name, TestCase inputs builder) -> do
263254 putStrLn $ "Test: " <> name
264255 testAgreement builder inputs
test/Reflex/Test/Micro.hs+17−84
@@ -3,7 +3,6 @@
33{-# LANGUAGE FlexibleContexts #-}
44{-# LANGUAGE FlexibleInstances #-}
55{-# LANGUAGE GADTs #-}
6−{-# LANGUAGE ScopedTypeVariables #-}
76{-# LANGUAGE MultiParamTypeClasses #-}
87{-# LANGUAGE RankNTypes #-}
98{-# LANGUAGE RecursiveDo #-}
@@ -24,24 +23,6 @@ import Data.Monoid
2423
2524import Prelude
2625
27−pushDyn :: (Reflex t, MonadHold t m) => (a -> PushM t b) -> Dynamic t a -> m (Dynamic t b)
28−pushDyn f d = buildDynamic (sample (current d) >>= f) (pushAlways f (updated d))
29−
30−foldedDyn :: (Reflex t, MonadHold t m) => (a -> a -> a) -> Dynamic t a -> m (Dynamic t a)
31−foldedDyn f d = fmap join $ flip buildDynamic never $ do
32− a <- sample (current d)
33− foldDyn f a (updated d)
34−
35−scannedDyn :: (Reflex t, MonadHold t m) => Dynamic t a -> m (Dynamic t [a])
36−scannedDyn = fmap (fmap reverse) . foldedDyn (<>) . fmap pure
37−
38−scanInnerDyns :: (Reflex t, MonadHold t m) => Dynamic t (Dynamic t a) -> m (Dynamic t [a])
39−scanInnerDyns d = do
40− scans <- scannedDyn d
41− return (join (fmap distributeListOverDynPure scans))
42−
43−
44−
4526{-# ANN testCases "HLint: ignore Functor law" #-}
4627testCases :: [(String, TestCase)]
4728testCases =
@@ -147,36 +128,36 @@ testCases =
147128 return $ coincidence $ flip pushAlways e $ const $ do
148129 switch <$> hold ("x" <$ e) (e <$ e)
149130
150− , testE "switchHoldPromptly-1" $ do
131+ , testE "switchPromptly-1" $ do
151132 e <- events1
152133 let e' = e <$ e
153− switchHoldPromptly never $ e <$ e'
134+ switchPromptly never $ e <$ e'
154135
155− , testE "switchHoldPromptly-2" $ do
136+ , testE "switchPromptly-2" $ do
156137 e <- events1
157− switchHoldPromptly never $ deep (e <$ e)
138+ switchPromptly never $ deep (e <$ e)
158139
159− , testE "switchHoldPromptly-3" $ do
140+ , testE "switchPromptly-3" $ do
160141 e <- events1
161− switchHoldPromptly never $ (e <$ deep e)
142+ switchPromptly never $ (e <$ deep e)
162143
163− , testE "switchHoldPromptly-4" $ do
144+ , testE "switchPromptly-4" $ do
164145 e <- events1
165− switchHoldPromptly never $ (deep e <$ e)
146+ switchPromptly never $ (deep e <$ e)
166147
167148 , testE "switch-5" $ do
168149 e <- events1
169150 switch <$> hold never (deep e <$ e)
170151
171− , testE "switchHoldPromptly-5" $ do
152+ , testE "switchPromptly-5" $ do
172153 e <- events1
173− switchHoldPromptly never $ flip push e $
154+ switchPromptly never $ flip push e $
174155 const (Just <$> headE e)
175156
176− , testE "switchHoldPromptly-6" $ do
157+ , testE "switchPromptly-6" $ do
177158 e <- events1
178− switchHoldPromptly never $ flip pushAlways e $
179− const (switchHoldPromptly e never)
159+ switchPromptly never $ flip pushAlways e $
160+ const (switchPromptly e never)
180161
181162 , testE "coincidence-1" $ do
182163 e <- events1
@@ -220,14 +201,6 @@ testCases =
220201 bb <- hold (constant "x") $ pushAlways (const $ hold "a" eo) eo
221202 return $ pull $ sample =<< sample bb
222203
223−
224− , testB "foldDynWhileFiring" $ do
225− e <- events1
226− d <- foldDyn (:) [] $
227− pushAlways (\a -> foldDyn (:) [a] e) e
228−
229− return $ current (join (fmap distributeListOverDynPure d))
230−
231204 , testE "joinDyn" $ do
232205 e <- events1
233206 bb <- hold "b" e
@@ -250,38 +223,6 @@ testCases =
250223 d2 <- fmap (fmap (map toUpper)) $ foldDyn (++) "0" =<< events2
251224
252225 return $ current $ zipDynWith (<>) d1 d2
253−
254− , testB "buildDynamicStrictness" $ do
255− rec
256− d'' <- pushDyn return d'
257− d' <- pushDyn return d
258− d <- holdDyn "0" =<< events1
259−
260− _ <- sample (current d'')
261− return (current d'')
262−
263− , testB "factorDyn" $ do
264− d <- holdDyn (Left "a") =<< eithers
265−
266− eithers' <- eitherDyn d
267− let unFactor = either id id
268− return $ current (join (fmap unFactor eithers'))
269−
270− , testB "pushDynDeep" $ do
271− _ <- events1
272− _ <- events2
273−
274− d1 <- holdDyn "d1" =<< events1
275− d2 <- holdDyn "d2" =<< events2
276−
277− d <- flip pushDyn d1 $ \a ->
278− flip pushDyn d2 $ \b ->
279− flip pushDyn d1 $ \c ->
280− return (a <> b <> c)
281−
282− d' <- pushDyn scanInnerDyns d >>= scanInnerDyns
283− return $ current d'
284−
285226 , testE "fan-1" $ do
286227 e <- fmap toMap <$> events1
287228 let es = select (fanMap e) . Const2 <$> values
@@ -322,24 +263,14 @@ testCases =
322263 let e = never <$ switch b
323264 return $ void e
324265 lazyHold
325− , testE "now-1" $ do
326− e1 <- events1
327− switchHoldPromptly never . pushAlways (\a -> fmap (a <$) now) $ e1
328− , testE "now-2" $ do
329− e1 <- events1
330− let e = pushAlways (\a -> if a == "a" then now else return never) e1
331− x <- accumDyn (<>) never e
332− return . coincidence $ updated x
266+
333267 ] where
334268
335269 events1, events2, events3 :: TestPlan t m => m (Event t String)
336270 events1 = plan [(1, "a"), (2, "b"), (5, "c"), (7, "d"), (8, "e")]
337271 events2 = plan [(1, "e"), (3, "d"), (4, "c"), (6, "b"), (7, "a")]
338− events3 = liftA2 mappend events1 events2
339−
340− eithers :: TestPlan t m => m (Event t (Either String String))
341− eithers = plan [(1, Left "e"), (3, Left "d"), (4, Right "c"), (6, Right "b"), (7, Left "a")]
342272
273+ events3 = liftA2 mappend events1 events2
343274
344275 values = "abcde"
345276 toMap str = Map.fromList $ map (\c -> (c, c)) str
@@ -350,3 +281,5 @@ testCases =
350281
351282 deep e = leftmost [e, e]
352283 leftmost2 e1 e2 = leftmost [e1, e2]
284+
285+
test/Reflex/TestPlan.hs+2−2
@@ -26,8 +26,8 @@ import Reflex.Class
2626import Prelude
2727
2828class (Reflex t, MonadHold t m, MonadFix m) => TestPlan t m where
29− -- | Specify a plan of an input Event firing
30− -- Occurrences must be in the future (i.e. Time > 0)
29+ -- | Speicify a plan of an input Event firing
30+ -- Occurances must be in the future (i.e. Time > 0)
3131 -- Initial specification is
3232
3333 plan :: [(Word, a)] -> m (Event t a)
test/RequesterT.hs+16−186
@@ -1,40 +1,11 @@
1−{-# LANGUAGE CPP #-}
2−{-# LANGUAGE BangPatterns #-}
3−{-# LANGUAGE FlexibleContexts #-}
4−{-# LANGUAGE FlexibleInstances #-}
5−{-# LANGUAGE GADTs #-}
6−{-# LANGUAGE LambdaCase #-}
7−{-# LANGUAGE MultiParamTypeClasses #-}
8−{-# LANGUAGE RecursiveDo #-}
9−{-# LANGUAGE ScopedTypeVariables #-}
10−{-# LANGUAGE TemplateHaskell #-}
11−{-# LANGUAGE TypeApplications #-}
12−{-# LANGUAGE TypeFamilies #-}
1+{-# LANGUAGE FlexibleContexts, GADTs, RankNTypes, ScopedTypeVariables #-}
132module Main where
143
15−import Control.Lens hiding (has)
4+import Control.Lens
165import Control.Monad
17−import Control.Monad.Fix
18−import Control.Monad.IO.Class (MonadIO)
19−import Data.Constraint.Extras
20−import Data.Constraint.Extras.TH
21−import Data.Constraint.Forall
226import qualified Data.Dependent.Map as DMap
237import Data.Dependent.Sum
24−import Data.Functor.Misc
25−import Data.List (words)
26−import Data.Map (Map)
27−import qualified Data.Map as M
28−#if !MIN_VERSION_these(4,11,0)
29−import Data.Semigroup ((<>))
30−#endif
31−import Data.Text (Text)
328import Data.These
33−import Text.Read (readMaybe)
34−
35−#if defined(MIN_VERSION_these_lens) || (MIN_VERSION_these(0,8,0) && !MIN_VERSION_these(0,9,0))
36−import Data.These.Lens
37−#endif
389
3910import Reflex
4011import Reflex.Requester.Base
@@ -46,38 +17,18 @@ data RequestInt a where
4617
4718main :: IO ()
4819main = do
49− os1 <- runApp' (unwrapApp testOrdering) $
20+ os1@[[Just [10,9,8,7,6,5,4,3,2,1]]] <- runApp' (unwrapApp testOrdering) $
5021 [ Just ()
5122 ]
5223 print os1
53− os2 <- runApp' (unwrapApp testSimultaneous) $ map Just $
54− [ This ()
55− , That ()
56− , This ()
57− , These () ()
58− ]
24+ os2@[[Just [1,3,5,7,9]],[Nothing,Nothing],[Just [2,4,6,8,10]],[Just [2,4,6,8,10],Nothing]]
25+ <- runApp' (unwrapApp testSimultaneous) $ map Just $
26+ [ This ()
27+ , That ()
28+ , This ()
29+ , These () ()
30+ ]
5931 print os2
60− os3 <- runApp' (unwrapApp testMoribundRequest) [Just ()]
61− print os3
62− os4 <- runApp' (unwrapApp testMoribundRequestDMap) [Just ()]
63− print os4
64− os5 <- runApp' (unwrapApp testLiveRequestDMap) [Just ()]
65− print os5
66− os6 <- runApp' (unwrapApp delayedPulse) [Just ()]
67− print os6
68− os7 <- runApp' testMatchRequestsWithResponses [ Just $ TestRequest_Increment 1 ]
69− print os7
70− os8 <- runApp' testMatchRequestsWithResponses [ Just $ TestRequest_Reverse "yoyo" ]
71− print os8
72− let ![[Just [1,2,3,4,5,6,7,8,9,10]]] = os1 -- The order is reversed here: see the documentation for 'runRequesterT'
73− let ![[Just [9,7,5,3,1]],[Nothing,Nothing],[Just [10,8,6,4,2]],[Just [10,8,6,4,2],Nothing]] = os2
74− let ![[Nothing, Just [2]]] = os3
75− let ![[Nothing, Just [2]]] = os4
76− let ![[Nothing, Just [1, 2]]] = os5
77− -- let ![[Nothing, Nothing]] = os6 -- TODO re-enable this test after issue #233 has been resolved
78− let !(Just [(1,"2")]) = M.toList <$> head (head os7)
79− let !(Just [(1,"oyoy")]) = M.toList <$> head (head os8)
80−
8132 return ()
8233
8334unwrapRequest :: DSum tag RequestInt -> Int
@@ -89,21 +40,22 @@ unwrapApp :: ( Reflex t, Monad m )
8940 -> m (Event t [Int])
9041unwrapApp x appIn = do
9142 ((), e) <- runRequesterT (x appIn) never
92− return $ fmap (map unwrapRequest . requesterDataToList) e
43+ return $ fmap (map unwrapRequest . DMap.toList) e
9344
9445testOrdering :: ( Response m ~ Identity
9546 , Request m ~ RequestInt
9647 , Requester t m
97− , Adjustable t m)
48+ , MonadAdjust t m)
9849 => Event t ()
9950 -> m ()
100−testOrdering pulse = forM_ [10,9..1] $ \i ->
101− requestingIdentity (RequestInt i <$ pulse)
51+testOrdering pulse = do
52+ forM_ [10,9..1] $ \i -> requestingIdentity (RequestInt i <$ pulse)
53+ return ()
10254
10355testSimultaneous :: ( Response m ~ Identity
10456 , Request m ~ RequestInt
10557 , Requester t m
106− , Adjustable t m)
58+ , MonadAdjust t m)
10759 => Event t (These () ())
10860 -> m ()
10961testSimultaneous pulse = do
@@ -111,125 +63,3 @@ testSimultaneous pulse = do
11163 switchE = fmapMaybe (^? there) pulse
11264 forM_ [1,3..9] $ \i -> runWithReplace (requestingIdentity (RequestInt i <$ tellE)) $ ffor switchE $ \_ ->
11365 requestingIdentity (RequestInt (i+1) <$ tellE)
114−
115−-- | Test that a widget requesting and event which fires at the same time it has been replaced
116−-- doesn't count along with the new widget.
117−testMoribundRequest
118− :: forall t m
119− . ( Reflex t
120− , Adjustable t m
121− , MonadHold t m
122− , MonadFix m
123− , Response m ~ Identity
124− , Request m ~ RequestInt
125− , Requester t m
126− )
127− => Event t ()
128− -> m ()
129−testMoribundRequest pulse = do
130− rec let requestIntOnReplace x = requestingIdentity $ RequestInt x <$ rwrFinished
131− (_, rwrFinished) <- runWithReplace (requestIntOnReplace 1) $ requestIntOnReplace 2 <$ pulse
132− return ()
133−
134−-- | The equivalent of 'testMoribundRequest' for 'traverseDMapWithKeyWithAdjust'.
135−testMoribundRequestDMap
136− :: forall t m
137− . ( Reflex t
138− , Adjustable t m
139− , MonadHold t m
140− , MonadFix m
141− , Response m ~ Identity
142− , Request m ~ RequestInt
143− , Requester t m
144− )
145− => Event t ()
146− -> m ()
147−testMoribundRequestDMap pulse = do
148− rec let requestIntOnReplace :: Int -> m ()
149− requestIntOnReplace x = void $ requestingIdentity $ RequestInt x <$ rwrFinished
150− (_, rwrFinished :: Event t (PatchDMap (Const2 () Int) Identity)) <-
151− traverseDMapWithKeyWithAdjust
152− (\(Const2 ()) (Identity v) -> Identity . const v <$> requestIntOnReplace v)
153− (mapToDMap $ M.singleton () 1)
154− ((PatchDMap $ DMap.map (ComposeMaybe . Just) $ mapToDMap $ M.singleton () 2) <$ pulse)
155− return ()
156−
157−-- | Ensures that elements which are _not_ removed can still fire requests
158−-- during the same frame as other elements are updated.
159−testLiveRequestDMap
160− :: forall t m
161− . ( Reflex t
162− , Adjustable t m
163− , MonadHold t m
164− , MonadFix m
165− , Response m ~ Identity
166− , Request m ~ RequestInt
167− , Requester t m
168− )
169− => Event t ()
170− -> m ()
171−testLiveRequestDMap pulse = do
172− rec let requestIntOnReplace :: Int -> m ()
173− requestIntOnReplace x = void $ requestingIdentity $ RequestInt x <$ rwrFinished
174− (_, rwrFinished :: Event t (PatchDMap (Const2 Int ()) Identity)) <-
175− traverseDMapWithKeyWithAdjust
176− (\(Const2 k) (Identity ()) -> Identity <$> requestIntOnReplace k)
177− (mapToDMap $ M.singleton 1 ())
178− ((PatchDMap $ DMap.map (ComposeMaybe . Just) $ mapToDMap $ M.singleton 2 ()) <$ pulse)
179− return ()
180−
181−delayedPulse
182− :: forall t m
183− . ( Reflex t
184− , Adjustable t m
185− , MonadHold t m
186− , MonadFix m
187− , Response m ~ Identity
188− , Request m ~ RequestInt
189− , PerformEvent t m
190− , Requester t m
191− )
192− => Event t ()
193− -> m ()
194−delayedPulse pulse = void $ flip runWithReplace (pure () <$ pulse) $ do
195− -- This has the effect of delaying pulse' from pulse
196− (_, pulse') <- runWithReplace (pure ()) $ pure (RequestInt 1) <$ pulse
197− requestingIdentity pulse'
198−
199−data TestRequest a where
200− TestRequest_Reverse :: String -> TestRequest String
201− TestRequest_Increment :: Int -> TestRequest Int
202−
203−testMatchRequestsWithResponses
204− :: forall m t req a
205− . ( MonadFix m
206− , MonadHold t m
207− , Reflex t
208− , PerformEvent t m
209− , MonadIO (Performable m)
210− , ForallF Show req
211− , Has Read req
212− )
213− => Event t (req a) -> m (Event t (Map Int String))
214−testMatchRequestsWithResponses pulse = mdo
215− (_, requests) <- runRequesterT (requesting pulse) responses
216− let rawResponses = M.map (\v ->
217− case words v of
218− ["reverse", str] -> reverse str
219− ["increment", i] -> show $ succ $ (read i :: Int)
220− ) <$> rawRequestMap
221− (rawRequestMap, responses) <- matchResponsesWithRequests reqEncoder requests (head . M.toList <$> rawResponses)
222− pure rawResponses
223− where
224− reqEncoder :: forall a. req a -> (String, String -> Maybe a)
225− reqEncoder r =
226− ( whichever @Show @req @a $ show r
227− , \x -> has @Read r $ readMaybe x
228− )
229−
230−deriveArgDict ''TestRequest
231−
232−instance Show (TestRequest a) where
233− show = \case
234− TestRequest_Reverse str -> "reverse " <> str
235− TestRequest_Increment i -> "increment " <> show i
test/Test/Run.hs−8
@@ -64,11 +64,3 @@ runApp' :: (t ~ SpiderTimeline Global, m ~ SpiderHost Global)
6464runApp' app input = do
6565 let app' = fmap (AppOut (pure ())) . app
6666 map (map snd) <$> runApp (app' . _appIn_event) () (map (fmap That) input)
67−
68−runAppB :: (t ~ SpiderTimeline Global, m ~ SpiderHost Global)
69− => (Event t eIn -> PerformEventT t m (Behavior t bOut))
70− -> [Maybe eIn]
71− -> IO [[bOut]]
72−runAppB app input = do
73− let app' = fmap (flip AppOut never) . app
74− map (map fst) <$> runApp (app' . _appIn_event) () (map (fmap That) input)
test/hlint.hs+10−6
@@ -1,11 +1,11 @@
11module Main where
22
33import Control.Monad
4−import Language.Haskell.HLint (hlint)
4+import Language.Haskell.HLint3 (hlint)
55import System.Directory
66import System.Exit (exitFailure, exitSuccess)
7−import System.FilePath
87import System.FilePath.Find
8+import System.FilePath
99
1010main :: IO ()
1111main = do
@@ -20,10 +20,7 @@ main = do
2020 , "--ignore=Use >=>"
2121 , "--ignore=Use ."
2222 , "--ignore=Use unless"
23− , "--ignore=Reduce duplication"
2423 , "--cpp-define=USE_TEMPLATE_HASKELL"
25− , "--cpp-define=DEBUG"
26− , "--ignore=Use tuple-section"
2724 ]
2825 recurseInto = and <$> sequence
2926 [ fileType ==? Directory
@@ -31,9 +28,16 @@ main = do
3128 ]
3229 matchFile = and <$> sequence
3330 [ extension ==? ".hs"
31+ , let notElem' = liftOp notElem
32+ in filePath `notElem'` filePathExceptions pwd
3433 ]
35− files <- find recurseInto matchFile (pwd </> "src") --TODO: Someday fix all hints in tests, etc.
34+ files <- find recurseInto matchFile pwd
3635 ideas <- fmap concat $ forM files $ \f -> do
3736 putStr $ "linting file " ++ drop (length pwd + 1) f ++ "... "
3837 runHlint f
3938 if null ideas then exitSuccess else exitFailure
39+
40+filePathExceptions :: FilePath -> [FilePath]
41+filePathExceptions pwd = map (pwd </>) $
42+ [ "src/Data/AppendMap.hs" -- parse error when hlint runs
43+ ]
test/rootCleanup.hs+3−3
@@ -1,10 +1,10 @@
1−import Control.Concurrent
21import Control.Monad
3−import Data.IORef
2+import Control.Concurrent
43import Reflex
54import Reflex.Host.Class
6−import System.Exit
75import System.Mem
6+import Data.IORef
7+import System.Exit
88
99main :: IO ()
1010main = do
test/semantics.hs+2
@@ -45,3 +45,5 @@ main = do
4545 ]
4646
4747 makeGroup name tests = first (\test -> intercalate "/" [name, test]) <$> tests
48+
49+