on d3a3059 help sign in
74 files changed+2918−2362
since splitsnapshots
unifiedsplit
.github/workflows/haskell.yml−41 .travis.yml+171 ChangeLog.md+4−98 Quickref.md+11−15 README.md+17−15 cabal.haskell-ci−7 cabal.project.freeze+1 dep/reflex-platform/default.nix−7 dep/reflex-platform/github.json−7 hydra.json+29 jobsets.nix+70 reflex-platform.nix+8 reflex.cabal+47−134 release.nix+7−56 src/Control/Monad/ReaderIO.hs+1−1 src/Data/AppendMap.hs+2−2 src/Data/FastMutableIntMap.hs+3−7 src/Data/FastWeakBag.hs+4−9 src/Data/Functor/Misc.hs+234 src/Data/List/NonEmpty/Deferred.hs+30 src/Data/Map/Misc.hs+1−1 src/Data/TagMap.hs+39 src/Data/Unique/Tag/Local.hs+11 src/Data/Unique/Tag/Local/Internal.hs+59 src/Data/WeakBag.hs+3−8 src/Reflex/Adjustable/Class.hs+2−3 src/Reflex/BehaviorWriter/Base.hs+7−16 src/Reflex/BehaviorWriter/Class.hs+5−11 src/Reflex/Class.hs+39−53 src/Reflex/Collection.hs+2−5 src/Reflex/Dynamic.hs+3−17 src/Reflex/DynamicWriter/Base.hs+5−14 src/Reflex/DynamicWriter/Class.hs+1 src/Reflex/EventWriter/Base.hs+14−67 src/Reflex/FanTag.hs+23 src/Reflex/FastWeak.hs−10 src/Reflex/Host/Headless.hs−128 src/Reflex/Network.hs+1−1 src/Reflex/NotReady/Class.hs+5 src/Reflex/Patch.hs+46 src/Reflex/Patch/Class.hs+34 src/Reflex/Patch/DMap.hs+82 src/Reflex/Patch/DMapWithMove.hs+363 src/Reflex/Patch/IntMap.hs+70 src/Reflex/Patch/Map.hs+55 src/Reflex/Patch/MapWithMove.hs+270 src/Reflex/PerformEvent/Base.hs+89−15 src/Reflex/PerformEvent/Class.hs+1−6 src/Reflex/PostBuild/Base.hs+1−2 src/Reflex/PostBuild/Class.hs+1 src/Reflex/Profiled.hs+5−59 src/Reflex/Pure.hs+1−6 src/Reflex/Query/Base.hs+4−15 src/Reflex/Query/Class.hs+4−44 src/Reflex/Requester/Base.hs+14−599 src/Reflex/Requester/Base/Internal.hs+674 src/Reflex/Requester/Class.hs+1−1 src/Reflex/Spider/Internal.hs+272−501 src/Reflex/TriggerEvent/Base.hs−2 src/Reflex/TriggerEvent/Class.hs−6 src/Reflex/Widget/Basic.hs+1−1 src/Reflex/Workflow.hs+1−1 test/Adjustable.hs−62 test/DebugCycles.hs−171 test/EventWriterT.hs+15−11 test/GC.hs+2−2 test/Headless.hs−10 test/QueryT.hs+1−1 test/Reflex/Bench/Focused.hs+1−1 test/Reflex/Plan/Pure.hs−1 test/Reflex/Test/CrossImpl.hs+8−13 test/Reflex/Test/Micro.hs+2−8 test/RequesterT.hs+33−89 test/hlint.hs+8−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
.travis.ymlnew file+171
@@ -0,0 +1,171 @@
1+# This Travis job script has been generated by a script via
2+#
3+# haskell-ci '--config=cabal.haskell-ci' 'cabal.project'
4+#
5+# For more information, see https://github.com/haskell-CI/haskell-ci
6+#
7+# version: 0.3.20190814
8+#
9+language: c
10+dist: xenial
11+sudo: required
12+git:
13+ # whether to recursively clone submodules
14+ submodules: false
15+cache:
16+ directories:
17+ - $HOME/.cabal/packages
18+ - $HOME/.cabal/store
19+before_cache:
20+ - rm -fv $CABALHOME/packages/hackage.haskell.org/build-reports.log
21+ # remove files that are regenerated by 'cabal update'
22+ - rm -fv $CABALHOME/packages/hackage.haskell.org/00-index.*
23+ - rm -fv $CABALHOME/packages/hackage.haskell.org/*.json
24+ - rm -fv $CABALHOME/packages/hackage.haskell.org/01-index.cache
25+ - rm -fv $CABALHOME/packages/hackage.haskell.org/01-index.tar
26+ - rm -fv $CABALHOME/packages/hackage.haskell.org/01-index.tar.idx
27+ - rm -rfv $CABALHOME/packages/head.hackage
28+matrix:
29+ include:
30+ - compiler: ghcjs-8.4
31+ addons: {"apt":{"sources":["hvr-ghc"],"packages":["cabal-install-3.0"]}}
32+ - compiler: ghc-8.6.5
33+ addons: {"apt":{"sources":["hvr-ghc"],"packages":["ghc-8.6.5","cabal-install-2.4"]}}
34+ - compiler: ghc-8.4.4
35+ addons: {"apt":{"sources":["hvr-ghc"],"packages":["ghc-8.4.4","cabal-install-2.4"]}}
36+ - compiler: ghc-8.2.2
37+ addons: {"apt":{"sources":["hvr-ghc"],"packages":["ghc-8.2.2","cabal-install-2.4"]}}
38+ - compiler: ghc-8.0.2
39+ addons: {"apt":{"sources":["hvr-ghc"],"packages":["ghc-8.0.2","cabal-install-2.4"]}}
40+before_install:
41+ - |
42+ if [ "$TRAVIS_OS_NAME" = "linux" ]; then
43+ sudo add-apt-repository -y ppa:hvr/ghcjs;
44+ curl -s https://deb.nodesource.com/gpgkey/nodesource.gpg.key | sudo apt-key add -
45+ sudo apt-add-repository 'https://deb.nodesource.com/node_8.x xenial main'
46+ sudo apt-get update;
47+ sudo apt-get install $CC cabal-install-3.0 nodejs;
48+ fi
49+ - HC=$(echo "/opt/$CC/bin/ghc" | sed 's/-/\//')
50+ - WITHCOMPILER="-w $HC"
51+ - |
52+ if echo $CC | grep -q ghcjs; then
53+ GHCJS=true
54+ HC=${HC}js
55+ WITHCOMPILER="--ghcjs ${WITHCOMPILER}js"
56+ else
57+ GHCJS=false;
58+ fi
59+ - if $GHCJS ; then sudo apt-get install -y ghc-8.4.4 ; fi
60+ - if $GHCJS ; then PATH="/opt/ghc/8.4.4/bin:$PATH" ; fi
61+ - HCPKG="$HC-pkg"
62+ - unset CC
63+ - CABAL=/opt/ghc/bin/cabal
64+ - CABALHOME=$HOME/.cabal
65+ - export PATH="$CABALHOME/bin:$PATH"
66+ - TOP=$(pwd)
67+ - "HCNUMVER=$(${HC} --numeric-version|perl -ne '/^(\\d+)\\.(\\d+)\\.(\\d+)(\\.(\\d+))?$/; print(10000 * $1 + 100 * $2 + ($3 == 0 ? $5 != 1 : $3))')"
68+ - echo $HCNUMVER
69+ - CABAL="$CABAL -vnormal+nowrap+markoutput"
70+ - set -o pipefail
71+ - |
72+ echo 'function blue(s) { printf "\033[0;34m" s "\033[0m " }' >> .colorful.awk
73+ echo 'BEGIN { state = "output"; }' >> .colorful.awk
74+ echo '/^-----BEGIN CABAL OUTPUT-----$/ { state = "cabal" }' >> .colorful.awk
75+ echo '/^-----END CABAL OUTPUT-----$/ { state = "output" }' >> .colorful.awk
76+ echo '!/^(-----BEGIN CABAL OUTPUT-----|-----END CABAL OUTPUT-----)/ {' >> .colorful.awk
77+ echo ' if (state == "cabal") {' >> .colorful.awk
78+ echo ' print blue($0)' >> .colorful.awk
79+ echo ' } else {' >> .colorful.awk
80+ echo ' print $0' >> .colorful.awk
81+ echo ' }' >> .colorful.awk
82+ echo '}' >> .colorful.awk
83+ - cat .colorful.awk
84+ - |
85+ color_cabal_output () {
86+ awk -f $TOP/.colorful.awk
87+ }
88+ - echo text | color_cabal_output
89+install:
90+ - ${CABAL} --version
91+ - echo "$(${HC} --version) [$(${HC} --print-project-git-commit-id 2> /dev/null || echo '?')]"
92+ - node --version
93+ - echo $GHCJS
94+ - TEST=--enable-tests
95+ - BENCH=--enable-benchmarks
96+ - BENCH=--disable-benchmarks
97+ - HEADHACKAGE=false
98+ - rm -f $CABALHOME/config
99+ - |
100+ echo "verbose: normal +nowrap +markoutput" >> $CABALHOME/config
101+ echo "remote-build-reporting: anonymous" >> $CABALHOME/config
102+ echo "write-ghc-environment-files: always" >> $CABALHOME/config
103+ echo "remote-repo-cache: $CABALHOME/packages" >> $CABALHOME/config
104+ echo "logs-dir: $CABALHOME/logs" >> $CABALHOME/config
105+ echo "world-file: $CABALHOME/world" >> $CABALHOME/config
106+ echo "extra-prog-path: $CABALHOME/bin" >> $CABALHOME/config
107+ echo "symlink-bindir: $CABALHOME/bin" >> $CABALHOME/config
108+ echo "installdir: $CABALHOME/bin" >> $CABALHOME/config
109+ echo "build-summary: $CABALHOME/logs/build.log" >> $CABALHOME/config
110+ echo "store-dir: $CABALHOME/store" >> $CABALHOME/config
111+ echo "install-dirs user" >> $CABALHOME/config
112+ echo " prefix: $CABALHOME" >> $CABALHOME/config
113+ echo "repository hackage.haskell.org" >> $CABALHOME/config
114+ echo " url: http://hackage.haskell.org/" >> $CABALHOME/config
115+ - cat $CABALHOME/config
116+ - rm -fv cabal.project cabal.project.local cabal.project.freeze
117+ - travis_retry ${CABAL} v2-update -v
118+ - if $GHCJS ; then (cd /tmp && ${CABAL} v2-install -w ghc-8.4.4 happy) ; fi
119+ # Generate cabal.project
120+ - rm -rf cabal.project cabal.project.local cabal.project.freeze
121+ - touch cabal.project
122+ - |
123+ echo "packages: ." >> cabal.project
124+ - |
125+ - cat cabal.project || true
126+ - cat cabal.project.local || true
127+ - if [ -f "./configure.ac" ]; then (cd "." && autoreconf -i); fi
128+ - ${CABAL} v2-freeze $WITHCOMPILER ${TEST} ${BENCH} | color_cabal_output
129+ - "cat cabal.project.freeze | sed -E 's/^(constraints: *| *)//' | sed 's/any.//'"
130+ - rm cabal.project.freeze
131+script:
132+ - DISTDIR=$(mktemp -d /tmp/dist-test.XXXX)
133+ # Packaging...
134+ - ${CABAL} v2-sdist all | color_cabal_output
135+ # Unpacking...
136+ - mv dist-newstyle/sdist/*.tar.gz ${DISTDIR}/
137+ - cd ${DISTDIR} || false
138+ - find . -maxdepth 1 -type f -name '*.tar.gz' -exec tar -xvf '{}' \;
139+ - find . -maxdepth 1 -type f -name '*.tar.gz' -exec rm '{}' \;
140+ - PKGDIR_reflex="$(find . -maxdepth 1 -type d -regex '.*/reflex-[0-9.]*')"
141+ # Generate cabal.project
142+ - rm -rf cabal.project cabal.project.local cabal.project.freeze
143+ - touch cabal.project
144+ - |
145+ echo "packages: ${PKGDIR_reflex}" >> cabal.project
146+ - |
147+ - cat cabal.project || true
148+ - cat cabal.project.local || true
149+ # Building...
150+ # this builds all libraries and executables (without tests/benchmarks)
151+ - ${CABAL} v2-build $WITHCOMPILER --disable-tests --disable-benchmarks all | color_cabal_output
152+ # Building with tests and benchmarks...
153+ # build & run tests, build benchmarks
154+ - ${CABAL} v2-build $WITHCOMPILER ${TEST} ${BENCH} all | color_cabal_output
155+ # Testing...
156+ - if ! $GHCJS ; then ${CABAL} v2-test $WITHCOMPILER ${TEST} ${BENCH} all | color_cabal_output ; fi
157+ # cabal check...
158+ - (cd ${PKGDIR_reflex} && ${CABAL} -vnormal check)
159+ # haddock...
160+ - if ! $GHCJS ; then ${CABAL} v2-haddock $WITHCOMPILER ${TEST} ${BENCH} all | color_cabal_output ; fi
161+ # Constraint sets
162+ - rm -rf cabal.project.local
163+ # Constraint set no-th
164+ - ${CABAL} v2-build $WITHCOMPILER --disable-tests --disable-benchmarks --constraint='reflex -use-template-haskell' all | color_cabal_output
165+ # Constraint set old-these
166+ - ${CABAL} v2-build $WITHCOMPILER --disable-tests --disable-benchmarks --constraint='these <1' all | color_cabal_output
167+ # Constraint set old-witherable
168+ - ${CABAL} v2-build $WITHCOMPILER --disable-tests --disable-benchmarks --constraint='witherable <0.3.2' all | color_cabal_output
169+
170+# REGENDATA ["--config=cabal.haskell-ci","cabal.project"]
171+# EOF
ChangeLog.md+4−98
@@ -1,87 +1,5 @@
11# Revision history for reflex
22
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−
853## 0.6.2.4
864
875* Update to monoidal-containers 0.6
@@ -93,9 +11,7 @@ Changes do not carry forward to 0.7.2.0.
9311## 0.6.2.2
9412
9513* Support these >= 1. Add `split-these` flag to control whether to use new these/semialign combination or not.
96−
9714* Update version bounds to fix some CI failures
98−
9915* Add travis CI configuration
10016
10117## 0.6.2.1
@@ -110,42 +26,32 @@ Changes do not carry forward to 0.7.2.0.
11026 * Add incrementalCoercion/coerceIncremental to go with dynamicCoercion/coerceDynamic
11127
11228* Generalize merging functions:
113− `merge` to `mergeG`,
114− `mergeIncremental` to `mergeIncrementalG`,
115− `mergeIncrementalWithMove` to `mergeIncrementalWithMoveG`.
29+ `merge` to `mergeG`,
30+ `mergeIncremental` to `mergeIncrementalG`,
31+ `mergeIncrementalWithMove` to `mergeIncrementalWithMoveG`.
11632
11733* Generalize distribute function:
11834 `distributeDMapOverDynPure` to `distributeDMapOverDynPureG`,
11935
12036## 0.6.2.0
12137
122−* Fix `holdDyn` so that it is lazy in its event argument
38+* Fix `holdDyn` so that it is lazy in its event argument
12339 These produce `DMap`s whose values needn't be `Identity`.
124−
12540* Stop using the now-deprecated `*Tag` classes (e.g., `ShowTag`).
126−
12741* Fix `holdDyn` so that it is lazy in its event argument.
12842
12943## 0.6.1.0
13044
13145* Re-export all of `Data.Map.Monoidal`
132−
13346* Fix `QueryT` and `RequesterT` tests
13447
13548## 0.6.0.0 -- 2019-03-20
13649
13750* Deprecate `FunctorMaybe` in favor of `Data.Witherable.Filterable`. We still export `fmapMaybe`, `ffilter`, etc., but they all rely on `Filterable` now.
138−
13951* Rename `MonadDynamicWriter` to `DynamicWriter` and add a deprecation for the old name.
140−
14152* Remove many deprecated functions.
142−
14353* Add a `Num` instance for `Dynamic`.
144−
14554* Add `matchRequestsWithResponses` to make it easier to use `Requester` with protocols that don't do this matching for you.
146−
14755* Add `withRequesterT` to map functions over the request and response of a `RequesterT`.
148−
14956* Suppress nil patches in `QueryT` as an optimization. The `Query` type must now have an `Eq` instance.
150−
15157* Add `throttleBatchWithLag` to `Reflex.Time`. See that module for details.
Quickref.md+11−15
@@ -54,7 +54,6 @@ Since MonadHold depends on MonadSample, any [S] function also runs in [H] contex
5454[ ] difference :: Event a -> Event b -> Event a
5555[ ] align :: Event a -> Event b -> Event (These a b)
5656[ ] alignWith :: (These a b -> c) -> Event a -> Event b -> Event c
57− -- Note align functions from Data.Align in semialign package
5857[ ] mergeWith :: (a -> a -> a) -> [Event a] -> Event a
5958[ ] leftmost :: [Event a] -> Event a
6059[ ] mergeList :: [Event a] -> Event (NonEmpty a)
@@ -199,7 +198,7 @@ For Events, the returned Event fires whenever the latest Event supplied by the w
199198The functions mentioned above are used to create a static FRP network.
200199There 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.
201200
202−The typeclasses and their associated annotations include:
201+Th typeclasses and their associated annotations include:
203202
204203- `PostBuild`
205204 Fire an Event when an FRP network has been set up.
@@ -207,7 +206,7 @@ The typeclasses and their associated annotations include:
207206 [B] -- Function runs in any monad supporting PostBuild
208207 ```
209208
210−- `Adjustable`
209+- `Adjustable`
211210 Use Events to add or remove pieces of an FRP network.
212211 ```haskell
213212 [A] -- Function runs in any monad supporting Adjustable
@@ -272,7 +271,7 @@ The typeclasses and their associated annotations include:
272271```haskell
273272-- Run side-effecting actions in Event when it occurs; returned Event contains
274273-- results. Side effects run in the (Performable m) monad which is associated with
275−-- the (PerformEvent t m) typeclass constraint.
274+-- the (PerformEvent t m) typeclass constraint.
276275-- This allows for working with IO when a ((MonadIO (Performable m)) constraint is available.
277276[P] performEvent :: Event (Performable m a ) -> m (Event a)
278277
@@ -296,20 +295,17 @@ The typeclasses and their associated annotations include:
296295## Networks
297296
298297```haskell
299−-- Functions from Reflex.Adjustable / Reflex.Network used to deal with Dynamics/Events carrying (m a)
298+-- Functions from Reflex.Network used to deal with Dynamics/Events carrying (m a)
300299
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,
300+-- Given a Dynamic of network-creating actions, create a network that is recreated whenever the Dynamic updates.
301+-- The returned Event of network results occurs when the Dynamic does. Note: Often, the type a is an Event,
305302-- 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)
303+[P,A] networkView :: Dynamic (m a) -> m (Event a)
307304
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
305+-- Given an initial network and an Event of network-creating actions, create a network that is recreated whenever the
306+-- Event fires. The returned Dynamic of network results occurs when the Event does. Note: Often, the type a is an
310307-- 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)
308+[H,A] networkHold :: m a -> Event (m a) -> m (Dynamic a)
312309
313310-- 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)
315−```
311+[P,A] untilReady :: m a -> m b -> m (a, Event b)
README.md+17−15
@@ -1,23 +1,25 @@
1−# [Reflex](https://reflex-frp.org/)
1+## [Reflex](https://reflex-frp.org/)
22
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)
3+[![Hackage](https://img.shields.io/hackage/v/reflex.svg)](http://hackage.haskell.org/package/reflex)
44
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.
5+### Practical Functional Reactive Programming
66
7−Reflex is a fully-deterministic, higher-order Functional Reactive Programming interface and an engine that efficiently implements that interface.
7+Reflex is a fully-deterministic, higher-order Functional Reactive Programming (FRP) interface and an engine that efficiently implements that interface.
88
9−**Visit https://reflex-frp.org for more information, tutorials, documentation and [examples](https://examples.reflex-frp.org/).**
9+[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.
1010
11−## Resources
11+A summary of Reflex functions is available in the [quick reference](Quickref.md).
1212
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)
13+**Visit https://reflex-frp.org/ for more information, tutorials, documentation and [examples](https://examples.reflex-frp.org/).**
2014
21−## Hacking
15+### Resources
16+[Get started with Reflex](https://github.com/reflex-frp/reflex-platform)
2217
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.
18+[/r/reflexfrp](https://www.reddit.com/r/reflexfrp)
19+
20+[irc.freenode.net #reflex-frp](http://webchat.freenode.net?channels=%23reflex-frp&uio=d4)
21+
22+### Hacking
23+
24+Use the `./scripts/hack-on reflex` script in [Reflex Platform](https://github.com/reflex-frp/reflex-platform) to checkout the source code of `reflex` locally in `reflex-platform/reflex` directory.
25+Then do modifications to the source in place, and use the `./try-reflex` or `./scripts/work-on` scripts to create the shell to test your changes.
cabal.haskell-ci−7
@@ -10,14 +10,7 @@ constraint-set no-th
1010 constraints: reflex -use-template-haskell
1111
1212constraint-set old-these
13− ghc: <8.8
1413 constraints: these <1
1514
1615constraint-set old-witherable
1716 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.project.freezenew file+1
@@ -0,0 +1 @@
1+constraints: any.text < 1.2.4.0
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−}
hydra.jsonnew file+29
@@ -0,0 +1,29 @@
1+{
2+ "enabled": 1,
3+ "hidden": true,
4+ "description": "Jobsets",
5+ "nixexprinput": "src",
6+ "nixexprpath": "jobsets.nix",
7+ "checkinterval": 300,
8+ "schedulingshares": 100,
9+ "enableemail": false,
10+ "emailoverride": "",
11+ "keepnr": 10,
12+ "inputs": {
13+ "src": {
14+ "type": "git",
15+ "value": "https://github.com/reflex-frp/reflex.git develop",
16+ "emailresponsible": false
17+ },
18+ "nixpkgs": {
19+ "type": "git",
20+ "value": "https://github.com/NixOS/nixpkgs-channels nixos-unstable",
21+ "emailresponsible": false
22+ },
23+ "prs": {
24+ "type": "githubpulls",
25+ "value": "reflex-frp reflex",
26+ "emailresponsible": false
27+ }
28+ }
29+}
jobsets.nixnew file+70
@@ -0,0 +1,70 @@
1+{ prs }:
2+
3+let
4+ pkgs = (import ./reflex-platform.nix {}).nixpkgs;
5+ mkFetchGithub = value: {
6+ inherit value;
7+ type = "git";
8+ emailresponsible = false;
9+ };
10+in
11+with pkgs.lib;
12+let
13+ defaults = jobs: {
14+ inherit (jobs) description;
15+ enabled = 1;
16+ hidden = false;
17+ keepnr = 10;
18+ schedulingshares = 100;
19+ checkinterval = 120;
20+ enableemail = false;
21+ emailoverride = "";
22+ nixexprinput = "reflex";
23+ nixexprpath = "release.nix";
24+ inputs = jobs.inputs // {
25+ nixpkgs = {
26+ type = "git";
27+ value = "https://github.com/NixOS/nixpkgs-channels nixos-unstable";
28+ emailresponsible = false;
29+ };
30+ config = {
31+ type = "nix";
32+ value = "{ android_sdk.accept_license = true; }";
33+ emailresponsible = false;
34+ };
35+ };
36+ };
37+ branchJobset = branch: defaults {
38+ description = "reflex-${branch}";
39+ inputs = {
40+ reflex = {
41+ value = "https://github.com/reflex-frp/reflex ${branch}";
42+ type = "git";
43+ emailresponsible = false;
44+ };
45+ };
46+ };
47+ makePr = num: info: {
48+ name = "reflex-pr-${num}";
49+ value = defaults {
50+ description = "#${num}: ${info.title}";
51+ inputs = {
52+ reflex = {
53+ #NOTE: This should really use "pull/${num}/merge"; however, GitHub's
54+ #status checks only operate on PR heads. This creates a race
55+ #condition, which can currently only be solved by requiring PRs to be
56+ #up to date before they're merged. See
57+ #https://github.com/isaacs/github/issues/1002
58+ value = "https://github.com/reflex-frp/reflex pull/${num}/head";
59+ type = "git";
60+ emailresponsible = false;
61+ };
62+ };
63+ };
64+ };
65+ processedPrs = mapAttrs' makePr (builtins.fromJSON (builtins.readFile prs));
66+ jobsetsAttrs = processedPrs //
67+ genAttrs ["develop"] branchJobset;
68+in {
69+ jobsets = pkgs.writeText "spec.json" (builtins.toJSON jobsetsAttrs);
70+}
reflex-platform.nixnew file+8
@@ -0,0 +1,8 @@
1+let
2+ reflex-platform-src = (import <nixpkgs> {}).fetchFromGitHub {
3+ owner = "reflex-frp";
4+ repo = "reflex-platform";
5+ rev = "384cd850f3adf1d404bced2424b5f6efb0f415f2";
6+ sha256 = "1ws77prqx8khmp8j6br1ij4k2v4dlgv170r9fmg0p1jivfbn8y9d";
7+ };
8+in import reflex-platform-src
reflex.cabal+47−134
@@ -1,17 +1,7 @@
11Name: reflex
2−Version: 0.8.2.0
2+Version: 0.6.2.4
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,7 +9,7 @@ Maintainer: ryan.trinkle@gmail.com
199Stability: Experimental
2010Category: FRP
2111Build-type: Simple
22−Cabal-version: 1.22
12+Cabal-version: >=1.9.2
2313homepage: https://reflex-frp.org
2414bug-reports: https://github.com/reflex-frp/reflex/issues
2515extra-source-files:
@@ -28,8 +18,8 @@ extra-source-files:
2818 ChangeLog.md
2919
3020tested-with:
31− GHC ==8.4.4 || ==8.6.5 || ==8.8.1 || ==8.10.2,
32− GHCJS ==8.6
21+ GHC ==8.0.2 || ==8.2.2 || ==8.4.4 || ==8.6.5,
22+ GHCJS ==8.4
3323
3424flag use-reflex-optimizer
3525 description: Use the GHC plugin Reflex.Optimizer on some of the modules in the package. This is still experimental.
@@ -51,57 +41,45 @@ flag fast-weak
5141 default: False
5242 manual: True
5343
54−flag debug-propagation
55− description: Enable debugging of spider internals
56− default: False
57− manual: True
58−
59−flag debug-cycles
60− description: Enable debugging of event cycles
61− default: False
62− manual: True
63−
6444flag split-these
6545 description: Use split these/semialign packages
6646 manual: False
6747 default: True
6848
6949library
70− default-language: Haskell2010
7150 hs-source-dirs: src
7251 build-depends:
7352 MemoTrie == 0.6.*,
74− base >= 4.11 && < 4.15,
53+ base >= 4.9 && < 4.13,
7554 bifunctors >= 5.2 && < 5.6,
7655 comonad >= 5.0.4 && < 5.1,
77− constraints >= 0.10 && <0.14,
7856 constraints-extras >= 0.3 && < 0.4,
7957 containers >= 0.6 && < 0.7,
8058 data-default >= 0.5 && < 0.8,
81− dependent-map >= 0.3 && < 0.5,
59+ dependent-map >= 0.3 && < 0.4,
60+ dlist == 0.8.*,
8261 exception-transformers == 0.4.*,
62+ profunctors >= 5.3 && < 5.5,
8363 lens >= 4.7 && < 5,
84− mmorph >= 1.0 && < 1.2,
8564 monad-control >= 1.0.1 && < 1.1,
8665 mtl >= 2.1 && < 2.3,
87− patch >= 0.0.1 && < 0.1,
88− prim-uniq >= 0.1.0.1 && < 0.3,
66+ prim-uniq >= 0.1.0.1 && < 0.2,
8967 primitive >= 0.5 && < 0.8,
90− profunctors >= 5.3 && < 5.7,
68+ profunctors,
9169 random == 1.1.*,
9270 ref-tf == 0.4.*,
9371 reflection == 2.1.*,
9472 semigroupoids >= 4.0 && < 6,
9573 stm >= 2.4 && < 2.6,
9674 syb >= 0.5 && < 0.8,
97− time >= 1.4 && < 1.10,
75+ time >= 1.4 && < 1.9,
9876 transformers >= 0.5.6.0 && < 0.6,
9977 unbounded-delays >= 0.1.0.0 && < 0.2,
100− witherable >= 0.3 && < 0.5
78+ witherable >= 0.3 && < 0.3.2
10179
10280 if flag(split-these)
103− build-depends: these >= 1 && <1.2,
104− semialign >=1 && <1.2,
81+ build-depends: these >= 1 && <1.1,
82+ semialign >=1 && <1.1,
10583 monoidal-containers >= 0.6 && < 0.7
10684 else
10785 build-depends: these >= 0.4 && <0.9,
@@ -112,13 +90,18 @@ library
11290 Data.AppendMap,
11391 Data.FastMutableIntMap,
11492 Data.FastWeakBag,
93+ Data.Functor.Misc,
94+ Data.List.NonEmpty.Deferred,
11595 Data.Map.Misc,
96+ Data.TagMap,
97+ Data.Unique.Tag.Local,
98+ Data.Unique.Tag.Local.Internal,
11699 Data.WeakBag,
117100 Reflex,
118− Reflex.Class,
119101 Reflex.Adjustable.Class,
120102 Reflex.BehaviorWriter.Base,
121103 Reflex.BehaviorWriter.Class,
104+ Reflex.Class,
122105 Reflex.Collection,
123106 Reflex.Dynamic,
124107 Reflex.Dynamic.Uniq,
@@ -128,12 +111,19 @@ library
128111 Reflex.EventWriter,
129112 Reflex.EventWriter.Base,
130113 Reflex.EventWriter.Class,
114+ Reflex.FanTag,
131115 Reflex.FastWeak,
132116 Reflex.FunctorMaybe,
133117 Reflex.Host.Class,
134− Reflex.Host.Headless,
135118 Reflex.Network,
136119 Reflex.NotReady.Class,
120+ Reflex.Patch,
121+ Reflex.Patch.Class,
122+ Reflex.Patch.DMap,
123+ Reflex.Patch.DMapWithMove,
124+ Reflex.Patch.IntMap,
125+ Reflex.Patch.Map,
126+ Reflex.Patch.MapWithMove,
137127 Reflex.PerformEvent.Base,
138128 Reflex.PerformEvent.Class,
139129 Reflex.PostBuild.Base,
@@ -143,6 +133,7 @@ library
143133 Reflex.Query.Base,
144134 Reflex.Query.Class,
145135 Reflex.Requester.Base,
136+ Reflex.Requester.Base.Internal,
146137 Reflex.Requester.Class,
147138 Reflex.Spider,
148139 Reflex.Spider.Internal,
@@ -152,61 +143,44 @@ library
152143 Reflex.Widget.Basic,
153144 Reflex.Workflow
154145
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
164−
165146 ghc-options: -Wall -fwarn-redundant-constraints -fwarn-tabs -funbox-strict-fields -O2 -fspecialise-aggressively
147+ ghc-prof-options: -fprof-auto-calls
166148
167149 if flag(debug-trace-events)
168150 cpp-options: -DDEBUG_TRACE_EVENTS
169− build-depends:
170− bytestring >= 0.10.8 && < 0.11
151+ build-depends: bytestring
171152
172153 if flag(use-reflex-optimizer)
173154 cpp-options: -DUSE_REFLEX_OPTIMIZER
174155 build-depends: ghc
175156 exposed-modules: Reflex.Optimizer
176157
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−
183158 if flag(use-template-haskell)
184159 cpp-options: -DUSE_TEMPLATE_HASKELL
185160 build-depends:
186− dependent-sum >= 0.6 && < 0.8,
187− haskell-src-exts >= 1.16 && < 1.24,
161+ dependent-sum >= 0.6 && < 0.7,
162+ haskell-src-exts >= 1.16 && < 1.22,
188163 haskell-src-meta >= 0.6 && < 0.9,
189− template-haskell >= 2.9 && < 2.17
164+ template-haskell >= 2.9 && < 2.15
190165 exposed-modules:
191166 Reflex.Dynamic.TH
192167 other-extensions: TemplateHaskell
193168 else
194169 build-depends:
195− dependent-sum >= 0.6 && < 0.8
170+ dependent-sum >= 0.6 && < 0.7
196171
197172 if flag(fast-weak) && impl(ghcjs)
198173 cpp-options: -DGHCJS_FAST_WEAK
199174
200175 if impl(ghcjs)
201− build-depends:
202− ghcjs-base == 0.2.*
176+ build-depends: ghcjs-base
203177
204178test-suite semantics
205− default-language: Haskell2010
206179 type: exitcode-stdio-1.0
207180 main-is: semantics.hs
208181 hs-source-dirs: test
209182 ghc-options: -O2 -Wall -rtsopts
183+ ghc-prof-options: -fprof-auto-calls
210184 build-depends:
211185 base,
212186 bifunctors,
@@ -228,11 +202,11 @@ test-suite semantics
228202 Reflex.TestPlan
229203
230204test-suite CrossImpl
231− default-language: Haskell2010
232205 type: exitcode-stdio-1.0
233206 main-is: Reflex/Test/CrossImpl.hs
234207 hs-source-dirs: test
235208 ghc-options: -O2 -Wall -rtsopts
209+ ghc-prof-options: -fprof-auto-calls
236210 build-depends:
237211 base,
238212 containers,
@@ -250,7 +224,6 @@ test-suite CrossImpl
250224 Reflex.Plan.Pure
251225
252226test-suite hlint
253− default-language: Haskell2010
254227 type: exitcode-stdio-1.0
255228 main-is: hlint.hs
256229 hs-source-dirs: test
@@ -258,15 +231,11 @@ test-suite hlint
258231 , directory
259232 , filepath
260233 , 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
234+ , hlint < 2.1 || >= 2.2.2
265235 if impl(ghcjs)
266236 buildable: False
267237
268238test-suite EventWriterT
269− default-language: Haskell2010
270239 type: exitcode-stdio-1.0
271240 main-is: EventWriterT.hs
272241 hs-source-dirs: test
@@ -286,55 +255,27 @@ test-suite EventWriterT
286255 build-depends: these-lens
287256
288257 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:
258+ Reflex.Test
259+ Reflex.TestPlan
260+ Reflex.Plan.Reflex
261+ Reflex.Plan.Pure
318262 Test.Run
319263
320264
321265test-suite RequesterT
322− default-language: Haskell2010
323266 type: exitcode-stdio-1.0
324267 main-is: RequesterT.hs
325268 hs-source-dirs: test
326269 build-depends: base
327− , constraints
328− , constraints-extras
329270 , containers
330271 , deepseq
331272 , dependent-map
332273 , dependent-sum
333274 , lens
334275 , mtl
276+ , primitive
335277 , ref-tf
336278 , reflex
337− , text
338279 , these
339280 , transformers
340281
@@ -346,31 +287,7 @@ test-suite RequesterT
346287 Reflex.Plan.Pure
347288 Test.Run
348289
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
365− , reflex
366− , ref-tf
367− , these
368−
369− other-modules:
370− Test.Run
371−
372290test-suite QueryT
373− default-language: Haskell2010
374291 type: exitcode-stdio-1.0
375292 main-is: QueryT.hs
376293 hs-source-dirs: test
@@ -382,7 +299,6 @@ test-suite QueryT
382299 , lens
383300 , monoidal-containers
384301 , mtl
385− , patch
386302 , ref-tf
387303 , reflex
388304 , these
@@ -398,7 +314,6 @@ test-suite QueryT
398314 Reflex.Plan.Pure
399315
400316test-suite GC-Semantics
401− default-language: Haskell2010
402317 type: exitcode-stdio-1.0
403318 main-is: GC.hs
404319 hs-source-dirs: test
@@ -408,7 +323,6 @@ test-suite GC-Semantics
408323 , dependent-map
409324 , deepseq
410325 , mtl
411− , patch
412326 , these
413327 , transformers
414328 , reflex
@@ -424,7 +338,6 @@ test-suite GC-Semantics
424338 Test.Run
425339
426340test-suite rootCleanup
427− default-language: Haskell2010
428341 type: exitcode-stdio-1.0
429342 main-is: rootCleanup.hs
430343 hs-source-dirs: test
@@ -442,11 +355,11 @@ test-suite rootCleanup
442355 Test.Run
443356
444357benchmark spider-bench
445− default-language: Haskell2010
446358 type: exitcode-stdio-1.0
447359 hs-source-dirs: bench test
448360 main-is: Main.hs
449361 ghc-options: -Wall -O2 -rtsopts
362+ ghc-prof-options: -fprof-auto-calls
450363 build-depends:
451364 base,
452365 containers,
@@ -467,12 +380,12 @@ benchmark spider-bench
467380 Reflex.Bench.Focused
468381
469382benchmark saulzar-bench
470− default-language: Haskell2010
471383 type: exitcode-stdio-1.0
472384 hs-source-dirs: bench test
473385 c-sources: bench-cbits/checkCapability.c
474386 main-is: RunAll.hs
475387 ghc-options: -Wall -O2 -rtsopts -threaded
388+ ghc-prof-options: -fprof-auto-calls
476389 build-depends:
477390 base,
478391 containers,
release.nix+7−56
@@ -1,58 +1,9 @@
1−{ reflex-platform-fun ? import ./dep/reflex-platform
2−, supportedSystems ? ["x86_64-linux" "x86_64-darwin"]
1+{ rp ? import ./reflex-platform.nix {}
32}:
4−
53let
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; }
4+ inherit (rp.nixpkgs) lib;
5+ compilers = ["ghc8_4" "ghc8_0" "ghcjs8_4" "ghcjs8_0"];
6+in lib.attrValues (lib.genAttrs compilers (ghc: {
7+ reflex-useTemplateHaskell = rp.${ghc}.callPackage ./. { useTemplateHaskell = true; splitThese = false; };
8+ reflex = rp.${ghc}.callPackage ./. { useTemplateHaskell = false; splitThese = false; };
9+}))
src/Control/Monad/ReaderIO.hs+1−1
@@ -37,7 +37,7 @@ instance Applicative (ReaderIO e) where
3737#if MIN_VERSION_base(4,10,0)
3838 liftA2 = liftM2
3939 {-# INLINE liftA2 #-}
40−#endif
40+#endif
4141 (*>) = (>>)
4242 {-# INLINE (*>) #-}
4343
src/Data/AppendMap.hs+2−2
@@ -20,7 +20,7 @@ module Data.AppendMap
2020 , module Data.Map.Monoidal
2121 ) where
2222
23−import Prelude hiding (null)
23+import Prelude hiding (map, null)
2424
2525import Data.Coerce
2626import Data.Default
@@ -71,7 +71,7 @@ mapMaybeNoNull f as =
7171 then Nothing
7272 else Just bs
7373
74−-- TODO: Move instances to `Data.Patch`
74+-- TODO: Move instances to `Reflex.Patch`
7575-- | Displays a 'MonoidalMap' as a tree. See 'Data.Map.Lazy.showTree' for details.
7676showTree :: forall k a. (Show k, Show a) => MonoidalMap k a -> String
7777showTree = coerce (Map.showTree :: Map k a -> String)
src/Data/FastMutableIntMap.hs+3−7
@@ -21,7 +21,6 @@ module Data.FastMutableIntMap
2121 , patchIntMapNewElements
2222 , patchIntMapNewElementsMap
2323 , getDeletions
24− , toList
2524 ) where
2625
2726--TODO: Pure JS version
@@ -35,8 +34,8 @@ import Data.Foldable (traverse_)
3534import Data.IntMap.Strict (IntMap)
3635import qualified Data.IntMap.Strict as IntMap
3736import Data.IORef
38−import Data.Patch.Class
39−import Data.Patch.IntMap
37+import Reflex.Patch.Class
38+import Reflex.Patch.IntMap
4039
4140-- | A 'FastMutableIntMap' holds a map of values of type @a@ and allows low-overhead modifications via IO.
4241-- Operations on 'FastMutableIntMap' run in IO.
@@ -85,13 +84,10 @@ getFrozenAndClear (FastMutableIntMap r) = do
8584 writeIORef r IntMap.empty
8685 return result
8786
88−-- | Updates the value of a 'FastMutableIntMap' with the given patch (see 'Data.Patch.IntMap'),
87+-- | Updates the value of a 'FastMutableIntMap' with the given patch (see 'Reflex.Patch.IntMap'),
8988-- and returns an 'IntMap' with the modified keys and values.
9089applyPatch :: FastMutableIntMap a -> PatchIntMap a -> IO (IntMap a)
9190applyPatch (FastMutableIntMap r) p@(PatchIntMap m) = do
9291 v <- readIORef r
9392 writeIORef r $! applyAlways p v
9493 return $ IntMap.intersection v m
95−
96−toList :: FastMutableIntMap a -> IO [(Int, a)]
97−toList (FastMutableIntMap r) = IntMap.toList <$> readIORef r
src/Data/FastWeakBag.hs+4−9
@@ -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.
@@ -117,14 +116,14 @@ foreign import javascript unsafe "(function(){ for(var i = 0; i < $1.tickets.len
117116isEmpty bag = {-# SCC "isEmpty" #-} IntMap.null <$> readIORef (_weakBag_children bag)
118117#endif
119118
120−{-# INLINE traverse_ #-}
119+{-# INLINE traverse #-}
121120-- | Visit every node in the given list. If new nodes are appended during the
122121-- traversal, they will not be visited. Every live node that was in the list
123122-- when the traversal began will be visited exactly once; however, no guarantee
124123-- is made about the order of the traversal.
125−traverse_ :: forall a m. MonadIO m => FastWeakBag a -> (a -> m ()) -> m ()
124+traverse :: forall a m. MonadIO m => FastWeakBag a -> (a -> m ()) -> m ()
126125#ifdef GHCJS_FAST_WEAK
127−traverse_ wb f = do
126+traverse wb f = do
128127 let go cursor = when (not $ js_isNull cursor) $ do
129128 val <- liftIO $ js_getTicketValue cursor
130129 f $ unsafeFromRawJSVal val
@@ -135,17 +134,13 @@ foreign import javascript unsafe "$r = $1.val;" js_getTicketValue :: JSVal -> IO
135134--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
136135foreign 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
137136#else
138−traverse_ (FastWeakBag _ children) f = {-# SCC "traverse_" #-} do
137+traverse (FastWeakBag _ children) f = {-# SCC "traverse" #-} do
139138 cs <- liftIO $ readIORef children
140139 forM_ cs $ \c -> do
141140 ma <- liftIO $ deRefWeak c
142141 mapM_ f ma
143142#endif
144143
145−{-# DEPRECATED traverse "Use 'traverse_' instead" #-}
146−traverse :: forall a m. MonadIO m => FastWeakBag a -> (a -> m ()) -> m ()
147−traverse = traverse_
148−
149144-- | Remove an item from the 'FastWeakBag'; does nothing if invoked multiple times
150145-- on the same 'FastWeakBagTicket'.
151146{-# INLINE remove #-}
src/Data/Functor/Misc.hsnew file+234
@@ -0,0 +1,234 @@
1+{-# LANGUAGE CPP #-}
2+{-# LANGUAGE DeriveDataTypeable #-}
3+{-# LANGUAGE DeriveFunctor #-}
4+{-# LANGUAGE FlexibleContexts #-}
5+{-# LANGUAGE FlexibleInstances #-}
6+{-# LANGUAGE GADTs #-}
7+{-# LANGUAGE LambdaCase #-}
8+{-# LANGUAGE MultiParamTypeClasses #-}
9+{-# LANGUAGE PatternSynonyms #-}
10+{-# LANGUAGE PolyKinds #-}
11+{-# LANGUAGE RankNTypes #-}
12+{-# LANGUAGE ScopedTypeVariables #-}
13+{-# LANGUAGE StandaloneDeriving #-}
14+#ifdef USE_REFLEX_OPTIMIZER
15+{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
16+#endif
17+-- | This module provides types and functions with no particular theme, but
18+-- which are relevant to the use of 'Functor'-based datastructures like
19+-- 'Data.Dependent.Map.DMap'.
20+module Data.Functor.Misc
21+ ( -- * Const2
22+ Const2 (..)
23+ , unConst2
24+ , dmapToMap
25+ , dmapToIntMap
26+ , dmapToMapWith
27+ , mapToDMap
28+ , weakenDMapWith
29+ -- * WrapArg
30+ , WrapArg (..)
31+ -- * Convenience functions for DMap
32+ , mapWithFunctorToDMap
33+ , intMapWithFunctorToDMap
34+ , mapKeyValuePairsMonotonic
35+ , combineDMapsWithKey
36+ , EitherTag (..)
37+ , dmapToThese
38+ , eitherToDSum
39+ , dsumToEither
40+ , ComposeMaybe (..)
41+ ) where
42+
43+import Control.Applicative ((<$>))
44+import Control.Monad.Identity
45+import Data.Dependent.Map (DMap)
46+import qualified Data.Dependent.Map as DMap
47+import Data.Dependent.Sum
48+import Data.GADT.Compare
49+import Data.GADT.Show
50+import Data.IntMap (IntMap)
51+import qualified Data.IntMap as IntMap
52+import Data.Map (Map)
53+import qualified Data.Map as Map
54+import Data.Some (Some(Some))
55+import Data.These
56+import Data.Typeable hiding (Refl)
57+
58+--------------------------------------------------------------------------------
59+-- Const2
60+--------------------------------------------------------------------------------
61+
62+-- | 'Const2' stores a value of a given type 'k' and ensures that a particular
63+-- type 'v' is always given for the last type parameter
64+data Const2 :: * -> x -> x -> * where
65+ Const2 :: k -> Const2 k v v
66+ deriving (Typeable)
67+
68+-- | Extract the value from a Const2
69+unConst2 :: Const2 k v v' -> k
70+unConst2 (Const2 k) = k
71+
72+deriving instance Eq k => Eq (Const2 k v v')
73+deriving instance Ord k => Ord (Const2 k v v')
74+deriving instance Show k => Show (Const2 k v v')
75+deriving instance Read k => Read (Const2 k v v)
76+
77+instance Show k => GShow (Const2 k v) where
78+ gshowsPrec n x@(Const2 _) = showsPrec n x
79+
80+instance Eq k => GEq (Const2 k v) where
81+ geq (Const2 a) (Const2 b) =
82+ if a == b
83+ then Just Refl
84+ else Nothing
85+
86+instance Ord k => GCompare (Const2 k v) where
87+ gcompare (Const2 a) (Const2 b) = case compare a b of
88+ LT -> GLT
89+ EQ -> GEQ
90+ GT -> GGT
91+
92+-- | Convert a 'DMap' to a regular 'Map'
93+dmapToMap :: DMap (Const2 k v) Identity -> Map k v
94+dmapToMap = Map.fromDistinctAscList . map (\(Const2 k :=> Identity v) -> (k, v)) . DMap.toAscList
95+
96+-- | Convert a 'DMap' to an 'IntMap'
97+dmapToIntMap :: DMap (Const2 IntMap.Key v) Identity -> IntMap v
98+dmapToIntMap = IntMap.fromDistinctAscList . map (\(Const2 k :=> Identity v) -> (k, v)) . DMap.toAscList
99+
100+-- | Convert a 'DMap' to a regular 'Map', applying the given function to remove
101+-- the wrapping 'Functor'
102+dmapToMapWith :: (f v -> v') -> DMap (Const2 k v) f -> Map k v'
103+dmapToMapWith f = Map.fromDistinctAscList . map (\(Const2 k :=> v) -> (k, f v)) . DMap.toAscList
104+
105+-- | Convert a regular 'Map' to a 'DMap'
106+mapToDMap :: Map k v -> DMap (Const2 k v) Identity
107+mapToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> Identity v) . Map.toAscList
108+
109+-- | Convert a regular 'Map', where the values are already wrapped in a functor,
110+-- to a 'DMap'
111+mapWithFunctorToDMap :: Map k (f v) -> DMap (Const2 k v) f
112+mapWithFunctorToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> v) . Map.toAscList
113+
114+-- | Convert a regular 'IntMap', where the values are already wrapped in a
115+-- functor, to a 'DMap'
116+intMapWithFunctorToDMap :: IntMap (f v) -> DMap (Const2 IntMap.Key v) f
117+intMapWithFunctorToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> v) . IntMap.toAscList
118+
119+-- | Convert a 'DMap' to a regular 'Map' by forgetting the types associated with
120+-- the keys, using a function to remove the wrapping 'Functor'
121+weakenDMapWith :: (forall a. v a -> v') -> DMap k v -> Map (Some k) v'
122+weakenDMapWith f = Map.fromDistinctAscList . map (\(k :=> v) -> (Some k, f v)) . DMap.toAscList
123+
124+--------------------------------------------------------------------------------
125+-- WrapArg
126+--------------------------------------------------------------------------------
127+
128+-- | 'WrapArg' can be used to tag a value in one functor with a type
129+-- representing another functor. This was primarily used with dependent-map <
130+-- 0.2, in which the value type was not wrapped in a separate functor.
131+data WrapArg :: (k -> *) -> (k -> *) -> * -> * where
132+ WrapArg :: f a -> WrapArg g f (g a)
133+
134+deriving instance Eq (f a) => Eq (WrapArg g f (g' a))
135+deriving instance Ord (f a) => Ord (WrapArg g f (g' a))
136+deriving instance Show (f a) => Show (WrapArg g f (g' a))
137+deriving instance Read (f a) => Read (WrapArg g f (g a))
138+
139+instance GEq f => GEq (WrapArg g f) where
140+ geq (WrapArg a) (WrapArg b) = (\Refl -> Refl) <$> geq a b
141+
142+instance GCompare f => GCompare (WrapArg g f) where
143+ gcompare (WrapArg a) (WrapArg b) = case gcompare a b of
144+ GLT -> GLT
145+ GEQ -> GEQ
146+ GGT -> GGT
147+
148+--------------------------------------------------------------------------------
149+-- Convenience functions for DMap
150+--------------------------------------------------------------------------------
151+
152+-- | Map over all key/value pairs in a 'DMap', potentially altering the key as
153+-- well as the value. The provided function MUST preserve the ordering of the
154+-- keys, or the resulting 'DMap' will be malformed.
155+mapKeyValuePairsMonotonic :: (DSum k v -> DSum k' v') -> DMap k v -> DMap k' v'
156+mapKeyValuePairsMonotonic f = DMap.fromDistinctAscList . map f . DMap.toAscList
157+
158+{-# INLINE combineDMapsWithKey #-}
159+-- | Union two 'DMap's of different types, yielding another type. Each key that
160+-- is present in either input map will be present in the output.
161+combineDMapsWithKey :: forall f g h i.
162+ GCompare f
163+ => (forall a. f a -> These (g a) (h a) -> i a)
164+ -> DMap f g
165+ -> DMap f h
166+ -> DMap f i
167+combineDMapsWithKey f mg mh = DMap.fromList $ go (DMap.toList mg) (DMap.toList mh)
168+ where go :: [DSum f g] -> [DSum f h] -> [DSum f i]
169+ go [] hs = map (\(hk :=> hv) -> hk :=> f hk (That hv)) hs
170+ go gs [] = map (\(gk :=> gv) -> gk :=> f gk (This gv)) gs
171+ go gs@((gk :=> gv) : gs') hs@((hk :=> hv) : hs') = case gk `gcompare` hk of
172+ GLT -> (gk :=> f gk (This gv)) : go gs' hs
173+ GEQ -> (gk :=> f gk (These gv hv)) : go gs' hs'
174+ GGT -> (hk :=> f hk (That hv)) : go gs hs'
175+
176+-- | Extract the values of a 'DMap' of 'EitherTag's.
177+dmapToThese :: DMap (EitherTag a b) Identity -> Maybe (These a b)
178+dmapToThese m = case (DMap.lookup LeftTag m, DMap.lookup RightTag m) of
179+ (Nothing, Nothing) -> Nothing
180+ (Just (Identity a), Nothing) -> Just $ This a
181+ (Nothing, Just (Identity b)) -> Just $ That b
182+ (Just (Identity a), Just (Identity b)) -> Just $ These a b
183+
184+-- | Tag type for 'Either' to use it as a 'DSum'.
185+data EitherTag l r a where
186+ LeftTag :: EitherTag l r l
187+ RightTag :: EitherTag l r r
188+ deriving (Typeable)
189+
190+deriving instance Show (EitherTag l r a)
191+deriving instance Eq (EitherTag l r a)
192+deriving instance Ord (EitherTag l r a)
193+
194+instance GEq (EitherTag l r) where
195+ geq a b = case (a, b) of
196+ (LeftTag, LeftTag) -> Just Refl
197+ (RightTag, RightTag) -> Just Refl
198+ _ -> Nothing
199+
200+instance GCompare (EitherTag l r) where
201+ gcompare a b = case (a, b) of
202+ (LeftTag, LeftTag) -> GEQ
203+ (LeftTag, RightTag) -> GLT
204+ (RightTag, LeftTag) -> GGT
205+ (RightTag, RightTag) -> GEQ
206+
207+instance GShow (EitherTag l r) where
208+ gshowsPrec _ a = case a of
209+ LeftTag -> showString "LeftTag"
210+ RightTag -> showString "RightTag"
211+
212+-- | Convert 'Either' to a 'DSum'. Inverse of 'dsumToEither'.
213+eitherToDSum :: Either a b -> DSum (EitherTag a b) Identity
214+eitherToDSum = \case
215+ Left a -> (LeftTag :=> Identity a)
216+ Right b -> (RightTag :=> Identity b)
217+
218+-- | Convert 'DSum' to 'Either'. Inverse of 'eitherToDSum'.
219+dsumToEither :: DSum (EitherTag a b) Identity -> Either a b
220+dsumToEither = \case
221+ (LeftTag :=> Identity a) -> Left a
222+ (RightTag :=> Identity b) -> Right b
223+
224+--------------------------------------------------------------------------------
225+-- ComposeMaybe
226+--------------------------------------------------------------------------------
227+
228+-- | We can't use @Compose Maybe@ instead of 'ComposeMaybe', because that would
229+-- make the 'f' parameter have a nominal type role. We need f to be
230+-- representational so that we can use safe 'coerce'.
231+newtype ComposeMaybe f a =
232+ ComposeMaybe { getComposeMaybe :: Maybe (f a) } deriving (Show, Eq, Ord)
233+
234+deriving instance Functor f => Functor (ComposeMaybe f)
src/Data/List/NonEmpty/Deferred.hsnew file+30
@@ -0,0 +1,30 @@
1+-- | Uses a non-associative internal structure to represent a NonEmpty list, but
2+-- prevents external observers from observing the non-associativity. This
3+-- allows O(1) '(<>)'.
4+
5+{-# LANGUAGE LambdaCase #-}
6+module Data.List.NonEmpty.Deferred
7+ ( NonEmptyDeferred
8+ , singleton
9+ , toNonEmpty
10+ ) where
11+
12+import Data.List.NonEmpty (NonEmpty (..))
13+import qualified Data.List.NonEmpty as NonEmpty
14+
15+data NonEmptyDeferred a
16+ = NonEmptyDeferred_Singleton a
17+ | NonEmptyDeferred_Append !(NonEmptyDeferred a) !(NonEmptyDeferred a)
18+
19+singleton :: a -> NonEmptyDeferred a
20+singleton = NonEmptyDeferred_Singleton
21+
22+{-# INLINE toNonEmpty #-}
23+toNonEmpty :: NonEmptyDeferred a -> NonEmpty a
24+toNonEmpty = go []
25+ where go t = \case
26+ NonEmptyDeferred_Singleton a -> a :| t
27+ NonEmptyDeferred_Append a b -> go (NonEmpty.toList $ go t b) a
28+
29+instance Semigroup (NonEmptyDeferred a) where
30+ (<>) = NonEmptyDeferred_Append
src/Data/Map/Misc.hs+1−1
@@ -43,7 +43,7 @@ diffMap olds news = flip Map.mapMaybe (align olds news) $ \case
4343
4444-- |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@.
4545--
46−-- See also 'Data.Patch.Map' and 'Data.Patch.MapWithMove'.
46+-- See also 'Reflex.Patch.Map' and 'Reflex.Patch.MapWithMove'.
4747applyMap :: Ord k => Map k (Maybe v) -> Map k v -> Map k v
4848applyMap patch old = insertions `Map.union` (old `Map.difference` deletions)
4949 where (deletions, insertions) = Map.mapEither maybeToEither patch
src/Data/TagMap.hsnew file+39
@@ -0,0 +1,39 @@
1+{-# LANGUAGE PolyKinds #-}
2+{-# LANGUAGE ScopedTypeVariables #-}
3+module Data.TagMap
4+ ( TagMap
5+ , unTagMap
6+ , fromDMap
7+ , toDMap
8+ , fromList
9+ , insert
10+ , size
11+ ) where
12+
13+import Data.IntMap (IntMap)
14+import qualified Data.IntMap as IntMap
15+import Data.Dependent.Map (DMap)
16+import qualified Data.Dependent.Map as DMap
17+import Data.Dependent.Sum (DSum (..))
18+import Data.Unique.Tag.Local
19+
20+import GHC.Exts (Any)
21+import Unsafe.Coerce
22+
23+-- | Like DMap, but with 'Data.Unique.Tag.Tag' as the keys. Implemented using 'Data.IntMap.IntMap' under the hood.
24+newtype TagMap x (v :: k -> *) = TagMap { unTagMap :: IntMap Any }
25+
26+fromDMap :: forall k x (v :: k -> *). DMap (Tag x) v -> TagMap x v
27+fromDMap = TagMap . IntMap.fromDistinctAscList . fmap (\((k :: Tag x (a :: k)) :=> v) -> (tagId k, (unsafeCoerce :: v a -> Any) v)) . DMap.toAscList
28+
29+toDMap :: forall x v. TagMap x v -> DMap (Tag x) v
30+toDMap = DMap.fromDistinctAscList . fmap (\(k, v) -> (unsafeTagFromId k :=> (unsafeCoerce :: Any -> v a) v)) . IntMap.toAscList . unTagMap
31+
32+insert :: forall x a v. Tag x a -> v a -> TagMap x v -> TagMap x v
33+insert k v = TagMap . IntMap.insert (tagId k) ((unsafeCoerce :: v a -> Any) v) . unTagMap
34+
35+fromList :: [DSum (Tag x) v] -> TagMap x v
36+fromList = TagMap . IntMap.fromList . fmap (\(t :=> v) -> (tagId t, (unsafeCoerce :: v a -> Any) v))
37+
38+size :: TagMap x v -> Int
39+size = IntMap.size . unTagMap
src/Data/Unique/Tag/Local.hsnew file+11
@@ -0,0 +1,11 @@
1+module Data.Unique.Tag.Local
2+ ( Tag
3+ , TagGen (..)
4+ , tagId
5+ , unsafeTagFromId
6+ , newTag
7+ , newTagGen
8+ , withTagGen
9+ ) where
10+
11+import Data.Unique.Tag.Local.Internal
src/Data/Unique/Tag/Local/Internal.hsnew file+59
@@ -0,0 +1,59 @@
1+-- | The type-safety of this module depends on two assumptions:
2+-- 1. If the `s` parameters on two `TagGen`s can unify, then they contain the same MutVar
3+-- 2. Two Tag values made from the same TagGen never contain the same Int
4+
5+{-# LANGUAGE EmptyDataDecls #-}
6+{-# LANGUAGE DeriveFunctor #-}
7+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
8+{-# LANGUAGE TypeFamilies #-}
9+{-# LANGUAGE PolyKinds #-}
10+{-# LANGUAGE RankNTypes #-}
11+{-# LANGUAGE ScopedTypeVariables #-}
12+{-# LANGUAGE MagicHash #-}
13+module Data.Unique.Tag.Local.Internal where
14+
15+import Control.Monad.Exception
16+import Control.Monad.Primitive
17+import Control.Monad.Reader
18+import Data.Primitive.MutVar
19+import Data.GADT.Compare
20+import Data.Some
21+import GHC.Exts (Int (..), Int#, MutVar#, unsafeCoerce#)
22+
23+import Unsafe.Coerce
24+
25+newtype Tag x a = Tag Int
26+
27+tagId :: Tag x a -> Int
28+tagId (Tag n) = n
29+
30+-- | WARNING: If you construct a tag with the wrong type, it will result in
31+-- incorrect unsafeCoerce applications, which can segfault or cause arbitrary
32+-- other damage to your program
33+unsafeTagFromId :: Int -> Tag x a
34+unsafeTagFromId n = Tag n
35+
36+-- We use Int because it is supported by e.g. IntMap
37+newtype TagGen ps s = TagGen { unTagGen :: MutVar ps Int }
38+
39+instance Show (TagGen ps s) where
40+ show (TagGen (MutVar m)) = show $ I# ((unsafeCoerce# :: MutVar# ps Int -> Int#) m)
41+
42+instance GEq (TagGen ps) where
43+ TagGen a `geq` TagGen b =
44+ if a == b
45+ then Just $ unsafeCoerce Refl
46+ else Nothing
47+
48+newTag :: PrimMonad m => TagGen (PrimState m) s -> m (Tag s a)
49+newTag (TagGen r) = do
50+ n <- atomicModifyMutVar' r $ \x -> (succ x, x)
51+ pure $ Tag n
52+
53+newTagGen :: PrimMonad m => m (Some (TagGen (PrimState m)))
54+newTagGen = Some . TagGen <$> newMutVar minBound
55+
56+withTagGen :: PrimMonad m => (forall s. TagGen (PrimState m) s -> m a) -> m a
57+withTagGen f = do
58+ g <- newTagGen
59+ withSome g f
src/Data/WeakBag.hs+3−8
@@ -15,7 +15,6 @@ module Data.WeakBag
1515 , singleton
1616 , insert
1717 , traverse
18− , traverse_
1918 , remove
2019 -- * Internal functions
2120 -- These will not always be available.
@@ -100,22 +99,18 @@ singleton a wbRef finalizer = {-# SCC "singleton" #-} do
10099 ticket <- insert a bag wbRef finalizer
101100 return (bag, ticket)
102101
103−{-# INLINE traverse_ #-}
102+{-# INLINE traverse #-}
104103-- | Visit every node in the given list. If new nodes are appended during the
105104-- traversal, they will not be visited. Every live node that was in the list
106105-- when the traversal began will be visited exactly once; however, no guarantee
107106-- 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
107+traverse :: MonadIO m => WeakBag a -> (a -> m ()) -> m ()
108+traverse (WeakBag _ children) f = {-# SCC "traverse" #-} do
110109 cs <- liftIO $ readIORef children
111110 forM_ cs $ \c -> do
112111 ma <- liftIO $ deRefWeak c
113112 mapM_ f ma
114113
115−{-# DEPRECATED traverse "Use 'traverse_' instead" #-}
116−traverse :: MonadIO m => WeakBag a -> (a -> m ()) -> m ()
117−traverse = traverse_
118−
119114-- | Remove an item from the 'WeakBag'; does nothing if invoked multiple times
120115-- on the same 'WeakBagTicket'.
121116{-# INLINE remove #-}
src/Reflex/Adjustable/Class.hs+2−3
@@ -30,8 +30,7 @@ module Reflex.Adjustable.Class
3030
3131import Control.Monad.Identity
3232import Control.Monad.Reader
33−import Data.Dependent.Map (DMap)
34−import Data.GADT.Compare (GCompare(..))
33+import Data.Dependent.Map (DMap, GCompare (..))
3534import qualified Data.Dependent.Map as DMap
3635import Data.Functor.Constant
3736import Data.Functor.Misc
@@ -40,7 +39,7 @@ import qualified Data.IntMap.Strict as IntMap
4039import Data.Map (Map)
4140
4241import Reflex.Class
43−import Data.Patch.DMapWithMove
42+import Reflex.Patch.DMapWithMove
4443
4544-- | A 'Monad' that supports adjustment over time. After an action has been
4645-- run, if the given events fire, it will adjust itself so that its net effect
src/Reflex/BehaviorWriter/Base.hs+7−16
@@ -1,6 +1,6 @@
11{-|
22Module: Reflex.BehaviorWriter.Base
3−Description: Implementation of BehaviorWriter
3+Description: Implementation of MonadBehaviorWriter
44-}
55{-# LANGUAGE CPP #-}
66{-# LANGUAGE FlexibleInstances #-}
@@ -24,7 +24,6 @@ module Reflex.BehaviorWriter.Base
2424import Control.Monad.Exception
2525import Control.Monad.Identity
2626import Control.Monad.IO.Class
27−import Control.Monad.Morph
2827import Control.Monad.Reader
2928import Control.Monad.Ref
3029import Control.Monad.State.Strict
@@ -47,20 +46,9 @@ import Reflex.Query.Class
4746import Reflex.Requester.Class
4847import Reflex.TriggerEvent.Class
4948
50−-- | A basic implementation of 'BehaviorWriter'.
49+-- | A basic implementation of 'MonadBehaviorWriter'.
5150newtype 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− )
51+ deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadAsyncException, MonadException) -- The list is kept in reverse order
6452
6553-- | Run a 'BehaviorWriterT' action. The behavior writer output will be provided
6654-- along with the result of the action.
@@ -85,6 +73,9 @@ withBehaviorWriterT f dw = do
8573deriving instance MonadHold t m => MonadHold t (BehaviorWriterT t w m)
8674deriving instance MonadSample t m => MonadSample t (BehaviorWriterT t w m)
8775
76+instance MonadTrans (BehaviorWriterT t w) where
77+ lift = BehaviorWriterT . lift
78+
8879instance MonadRef m => MonadRef (BehaviorWriterT t w m) where
8980 type Ref (BehaviorWriterT t w m) = Ref m
9081 newRef = lift . newRef
@@ -98,7 +89,7 @@ instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (BehaviorWri
9889 newEventWithTrigger = lift . newEventWithTrigger
9990 newFanEventWithTrigger f = lift $ newFanEventWithTrigger f
10091
101−instance (Monad m, Monoid w, Reflex t) => BehaviorWriter t w (BehaviorWriterT t w m) where
92+instance (Monad m, Monoid w, Reflex t) => MonadBehaviorWriter t w (BehaviorWriterT t w m) where
10293 tellBehavior w = BehaviorWriterT $ modify (w :)
10394
10495instance MonadReader r m => MonadReader r (BehaviorWriterT t w m) where
src/Reflex/BehaviorWriter/Class.hs+5−11
@@ -1,9 +1,8 @@
11{-|
22Module: Reflex.BehaviorWriter.Class
3−Description: This module defines the 'BehaviorWriter' class
3+Description: This module defines the 'MonadBehaviorWriter' class
44-}
55{-# LANGUAGE CPP #-}
6−{-# LANGUAGE ConstraintKinds #-}
76{-# LANGUAGE FlexibleInstances #-}
87{-# LANGUAGE FunctionalDependencies #-}
98{-# LANGUAGE UndecidableInstances #-}
@@ -11,21 +10,16 @@ Description: This module defines the 'BehaviorWriter' class
1110{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
1211#endif
1312module Reflex.BehaviorWriter.Class
14− ( MonadBehaviorWriter
15− , BehaviorWriter(..)
13+ ( MonadBehaviorWriter (..)
1614 ) where
1715
1816import Control.Monad.Reader (ReaderT, lift)
1917import Reflex.Class (Behavior)
2018
21−{-# DEPRECATED MonadBehaviorWriter "Use 'BehaviorWriter' instead" #-}
22−-- | Type synonym for 'BehaviorWriter'
23−type MonadBehaviorWriter = BehaviorWriter
24−
25−-- | 'BehaviorWriter' efficiently collects 'Behavior' values using 'tellBehavior'
19+-- | 'MonadBehaviorWriter' efficiently collects 'Behavior' values using 'tellBehavior'
2620-- and combines them monoidally to provide a 'Behavior' result.
27−class (Monad m, Monoid w) => BehaviorWriter t w m | m -> t w where
21+class (Monad m, Monoid w) => MonadBehaviorWriter t w m | m -> t w where
2822 tellBehavior :: Behavior t w -> m ()
2923
30−instance BehaviorWriter t w m => BehaviorWriter t w (ReaderT r m) where
24+instance MonadBehaviorWriter t w m => MonadBehaviorWriter t w (ReaderT r m) where
3125 tellBehavior = lift . tellBehavior
src/Reflex/Class.hs+39−53
@@ -29,7 +29,7 @@
2929-- convenience functions for working with 'Event's, 'Behavior's, and other
3030-- signals.
3131module Reflex.Class
32− ( module Data.Patch
32+ ( module Reflex.Patch
3333 -- * Primitives
3434 , Reflex (..)
3535 , mergeInt
@@ -169,19 +169,17 @@ module Reflex.Class
169169 , tagCheap
170170 , mergeWithCheap
171171 , mergeWithCheap'
172+ , sconcatCheap
172173 -- * Slow, but general, implementations
173174 , slowHeadE
174175 ) where
175176
176−#ifdef MIN_VERSION_semialign
177+#if defined(MIN_VERSION_semialign)
177178import Prelude hiding (zip, zipWith)
178179
179180#if MIN_VERSION_these(0,8,0)
180181import Data.These.Combinators (justThese)
181182#endif
182−#if MIN_VERSION_semialign(1,1,0)
183−import Data.Zip (Zip (..), Unzip (..))
184−#endif
185183#endif
186184
187185import Control.Applicative
@@ -196,12 +194,11 @@ import Data.Align
196194import Data.Bifunctor
197195import Data.Coerce
198196import Data.Default
199−import Data.Dependent.Map (DMap)
200−import Data.Dependent.Sum (DSum (..))
197+import Data.Dependent.Map (DMap, DSum (..))
201198import qualified Data.Dependent.Map as DMap
202199import Data.Functor.Compose
203200import Data.Functor.Product
204−import Data.GADT.Compare (GEq (..), GCompare (..))
201+import Data.GADT.Compare (GEq (..), GCompare (..), (:~:) (..))
205202import Data.FastMutableIntMap (PatchIntMap)
206203import Data.Foldable
207204import Data.Functor.Bind
@@ -211,18 +208,17 @@ import Data.IntMap.Strict (IntMap)
211208import qualified Data.IntMap.Strict as IntMap
212209import Data.List.NonEmpty (NonEmpty (..))
213210import Data.Map (Map)
214−import Data.Semigroup (Semigroup (..))
211+import Data.Semigroup (Semigroup, sconcat, stimes, (<>))
215212import Data.Some (Some(Some))
216213import Data.String
217214import Data.These
218215import Data.Type.Coercion
219−import Data.Type.Equality ((:~:) (..))
220216import Data.Witherable (Filterable(..))
221217import qualified Data.Witherable as W
222218import Reflex.FunctorMaybe (FunctorMaybe)
223219import qualified Reflex.FunctorMaybe
224−import Data.Patch
225−import qualified Data.Patch.MapWithMove as PatchMapWithMove
220+import Reflex.Patch
221+import qualified Reflex.Patch.MapWithMove as PatchMapWithMove
226222
227223import Debug.Trace (trace)
228224
@@ -288,8 +284,7 @@ class ( MonadHold t (PushM t)
288284 -- | Create an 'Event' that will occur whenever the currently-selected input
289285 -- 'Event' occurs
290286 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.
287+ -- | Create an 'Event' that will occur whenever the input event is occurring -- and its occurrence value, another 'Event', is also occurring
293288 coincidence :: Event t (Event t a) -> Event t a
294289 -- | Extract the 'Behavior' of a 'Dynamic'.
295290 current :: Dynamic t a -> Behavior t a
@@ -421,13 +416,6 @@ class MonadSample t m => MonadHold t m where
421416 -- | Create a new 'Event' that only occurs only once, on the first occurrence of
422417 -- the supplied 'Event'.
423418 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
431419
432420-- | Accumulate an 'Incremental' with the supplied initial value and the firings of the provided 'Event',
433421-- using the combining function to produce a patch.
@@ -573,7 +561,6 @@ instance MonadHold t m => MonadHold t (ReaderT r m) where
573561 holdIncremental a0 = lift . holdIncremental a0
574562 buildDynamic a0 = lift . buildDynamic a0
575563 headE = lift . headE
576− now = lift now
577564
578565instance (MonadSample t m, Monoid r) => MonadSample t (WriterT r m) where
579566 sample = lift . sample
@@ -584,7 +571,6 @@ instance (MonadHold t m, Monoid r) => MonadHold t (WriterT r m) where
584571 holdIncremental a0 = lift . holdIncremental a0
585572 buildDynamic a0 = lift . buildDynamic a0
586573 headE = lift . headE
587− now = lift now
588574
589575instance MonadSample t m => MonadSample t (StateT s m) where
590576 sample = lift . sample
@@ -595,7 +581,6 @@ instance MonadHold t m => MonadHold t (StateT s m) where
595581 holdIncremental a0 = lift . holdIncremental a0
596582 buildDynamic a0 = lift . buildDynamic a0
597583 headE = lift . headE
598− now = lift now
599584
600585instance MonadSample t m => MonadSample t (ExceptT e m) where
601586 sample = lift . sample
@@ -606,7 +591,6 @@ instance MonadHold t m => MonadHold t (ExceptT e m) where
606591 holdIncremental a0 = lift . holdIncremental a0
607592 buildDynamic a0 = lift . buildDynamic a0
608593 headE = lift . headE
609− now = lift now
610594
611595instance (MonadSample t m, Monoid w) => MonadSample t (RWST r w s m) where
612596 sample = lift . sample
@@ -617,7 +601,6 @@ instance (MonadHold t m, Monoid w) => MonadHold t (RWST r w s m) where
617601 holdIncremental a0 = lift . holdIncremental a0
618602 buildDynamic a0 = lift . buildDynamic a0
619603 headE = lift . headE
620− now = lift now
621604
622605instance MonadSample t m => MonadSample t (ContT r m) where
623606 sample = lift . sample
@@ -628,7 +611,6 @@ instance MonadHold t m => MonadHold t (ContT r m) where
628611 holdIncremental a0 = lift . holdIncremental a0
629612 buildDynamic a0 = lift . buildDynamic a0
630613 headE = lift . headE
631− now = lift now
632614
633615--------------------------------------------------------------------------------
634616-- Convenience functions
@@ -678,9 +660,7 @@ instance Reflex t => Monad (Behavior t) where
678660 a >>= f = pull $ sample a >>= sample . f
679661 -- 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.
680662 return = constant
681−#if !MIN_VERSION_base(4,13,0)
682663 fail = error "Monad (Behavior t) does not support fail"
683−#endif
684664
685665instance (Reflex t, Monoid a) => Monoid (Behavior t a) where
686666 mempty = constant mempty
@@ -911,6 +891,9 @@ instance (Semigroup a, Reflex t) => Semigroup (Event t a) where
911891 sconcat = fmap sconcat . mergeList . toList
912892 stimes n = fmap $ stimes n
913893
894+sconcatCheap :: (Semigroup a, Reflex t) => NonEmpty (Event t a) -> Event t a
895+sconcatCheap = fmapCheap sconcat . mergeList . toList
896+
914897instance (Semigroup a, Reflex t) => Monoid (Event t a) where
915898 mempty = never
916899 mappend = (<>)
@@ -925,6 +908,8 @@ mergeWith = mergeWith' id
925908
926909{-# INLINE mergeWith' #-}
927910mergeWith' :: Reflex t => (a -> b) -> (b -> b -> b) -> [Event t a] -> Event t b
911+mergeWith' _ _ [] = never
912+mergeWith' f _ [e] = fmap f e
928913mergeWith' f g es = fmap (Prelude.foldl1 g . fmap f)
929914 . mergeInt
930915 . IntMap.fromDistinctAscList
@@ -942,6 +927,7 @@ leftmost = mergeWith const
942927-- time.
943928mergeList :: Reflex t => [Event t a] -> Event t (NonEmpty a)
944929mergeList [] = never
930+mergeList [e] = fmapCheap (:|[]) e
945931mergeList es = mergeWithFoldCheap' id es
946932
947933unsafeMapIncremental
@@ -958,10 +944,6 @@ unsafeMapIncremental f g a = unsafeBuildIncremental (fmap f $ sample $ currentIn
958944mergeMap :: (Reflex t, Ord k) => Map k (Event t a) -> Event t (Map k a)
959945mergeMap = fmap dmapToMap . merge . mapWithFunctorToDMap
960946
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−
965947-- | Create a merge whose parents can change over time
966948mergeMapIncremental :: (Reflex t, Ord k) => Incremental t (PatchMap k (Event t a)) -> Event t (Map k a)
967949mergeMapIncremental = fmap dmapToMap . mergeIncremental . unsafeMapIncremental mapWithFunctorToDMap (const2PatchDMapWith id)
@@ -1038,23 +1020,27 @@ switchHoldPromptly ea0 eea = do
10381020switchHoldPromptOnly :: (Reflex t, MonadHold t m) => Event t a -> Event t (Event t a) -> m (Event t a)
10391021switchHoldPromptOnly e0 e' = do
10401022 eLag <- switch <$> hold e0 e'
1041− return $ coincidence $ leftmost [e', eLag <$ eLag]
1023+ return $ fmapMaybeCheap id $ leftmost
1024+ [ fmapCheap Just $ coincidence e'
1025+ , fmapCheap (const Nothing) e'
1026+ , fmapCheap Just eLag
1027+ ]
10421028
10431029-- | When the given outer event fires, condense the inner events into the contained patch. Non-firing inner events will be replaced with deletions.
10441030coincidencePatchMap :: (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
1031+coincidencePatchMap e = fmapCheap PatchMap $ coincidence $ fforCheap e $ \(PatchMap m) -> mergeMap $ ffor m $ \case
10461032 Nothing -> fmapCheap (const Nothing) e
10471033 Just ev -> leftmost [fmapCheap Just ev, fmapCheap (const Nothing) e]
10481034
10491035-- | See 'coincidencePatchMap'
10501036coincidencePatchIntMap :: 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
1037+coincidencePatchIntMap e = fmapCheap PatchIntMap $ coincidence $ fforCheap e $ \(PatchIntMap m) -> mergeIntMap $ ffor m $ \case
10521038 Nothing -> fmapCheap (const Nothing) e
10531039 Just ev -> leftmost [fmapCheap Just ev, fmapCheap (const Nothing) e]
10541040
10551041-- | See 'coincidencePatchMap'
10561042coincidencePatchMapWithMove :: (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
1043+coincidencePatchMapWithMove e = fmapCheap unsafePatchMapWithMove $ coincidence $ fforCheap e $ \p -> mergeMap $ ffor (unPatchMapWithMove p) $ \ni -> case PatchMapWithMove._nodeInfo_from ni of
10581044 PatchMapWithMove.From_Delete -> fforCheap e $ \_ ->
10591045 ni { PatchMapWithMove._nodeInfo_from = PatchMapWithMove.From_Delete }
10601046 PatchMapWithMove.From_Move k -> fforCheap e $ \_ ->
@@ -1098,19 +1084,10 @@ instance Reflex t => Semialign (Event t) where
10981084#endif
10991085 align = alignEventWithMaybe Just
11001086
1101−#ifdef MIN_VERSION_semialign
1102−#if MIN_VERSION_semialign(1,1,0)
1103−instance Reflex t => Zip (Event t) where
1104−#endif
1087+#if defined(MIN_VERSION_semialign)
11051088 zip x y = mapMaybe justThese $ align x y
11061089#endif
11071090
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
11141091
11151092-- | Create a new 'Event' that only occurs if the supplied 'Event' occurs and
11161093-- the 'Behavior' is true at the time of occurrence.
@@ -1323,7 +1300,7 @@ accumMaybeMDyn
13231300 -> Event t b
13241301 -> m (Dynamic t a)
13251302accumMaybeMDyn f z e = do
1326− rec let e' = flip push e $ \o -> do
1303+ rec let e' = flip pushCheap e $ \o -> do
13271304 v <- sample $ current d'
13281305 f v o
13291306 d' <- holdDyn z e'
@@ -1379,8 +1356,8 @@ mapAccumMaybeMDyn f z e = do
13791356 return $ case result of
13801357 (Nothing, Nothing) -> Nothing
13811358 _ -> Just result
1382− d' <- holdDyn z $ mapMaybe fst e'
1383− return (d', mapMaybe snd e')
1359+ d' <- holdDyn z $ fmapMaybeCheap fst e'
1360+ return (d', fmapMaybeCheap snd e')
13841361
13851362-- | Accumulate a 'Behavior' by folding occurrences of an 'Event'
13861363-- with the provided function.
@@ -1418,7 +1395,7 @@ accumMaybeB f = accumMaybeMB $ \v o -> return $ f v o
14181395{-# INLINE accumMaybeMB #-}
14191396accumMaybeMB :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a)) -> a -> Event t b -> m (Behavior t a)
14201397accumMaybeMB f z e = do
1421− rec let e' = flip push e $ \o -> do
1398+ rec let e' = flip pushCheap e $ \o -> do
14221399 v <- sample d'
14231400 f v o
14241401 d' <- hold z e'
@@ -1468,8 +1445,8 @@ mapAccumMaybeMB f z e = do
14681445 return $ case result of
14691446 (Nothing, Nothing) -> Nothing
14701447 _ -> Just result
1471− d' <- hold z $ mapMaybe fst e'
1472− return (d', mapMaybe snd e')
1448+ d' <- hold z $ fmapMaybeCheap fst e'
1449+ return (d', fmapMaybeCheap snd e')
14731450
14741451-- | Accumulate occurrences of an 'Event', producing an output occurrence each
14751452-- time. Discard the underlying 'Accumulator'.
@@ -1679,6 +1656,8 @@ mergeWithCheap' f g = mergeWithFoldCheap' $ foldl1 g . fmap f
16791656-- | A "cheap" version of 'mergeWithFoldCheap''. See the performance note on 'pushCheap'.
16801657{-# INLINE mergeWithFoldCheap' #-}
16811658mergeWithFoldCheap' :: Reflex t => (NonEmpty a -> b) -> [Event t a] -> Event t b
1659+mergeWithFoldCheap' f [] = never
1660+mergeWithFoldCheap' f [e] = fmapCheap (f . (:|[])) e
16821661mergeWithFoldCheap' f es =
16831662 fmapCheap (f . (\(h : t) -> h :| t) . IntMap.elems)
16841663 . mergeInt
@@ -1693,7 +1672,14 @@ mergeWithFoldCheap' f es =
16931672-- | See 'switchHoldPromptly'
16941673switchPromptly :: (Reflex t, MonadHold t m) => Event t a -> Event t (Event t a) -> m (Event t a)
16951674switchPromptly = switchHoldPromptly
1675+
16961676{-# 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'. " #-}
16971677-- | See 'switchHoldPromptOnly'
16981678switchPromptOnly :: (Reflex t, MonadHold t m) => Event t a -> Event t (Event t a) -> m (Event t a)
16991679switchPromptOnly = switchHoldPromptOnly
1680+
1681+{-# DEPRECATED mergeIntMap "Use 'mergeInt' instead" #-}
1682+-- | Like 'mergeMap' but for 'IntMap'.
1683+mergeIntMap :: Reflex t => IntMap (Event t a) -> Event t (IntMap a)
1684+mergeIntMap = mergeInt
1685+
src/Reflex/Collection.hs+2−5
@@ -27,11 +27,8 @@ module Reflex.Collection
2727 , simpleList
2828 ) where
2929
30−#ifdef MIN_VERSION_semialign
30+#if defined(MIN_VERSION_semialign)
3131import Prelude hiding (zip, zipWith)
32−#if MIN_VERSION_semialign(1,1,0)
33−import Data.Zip (Zip (..))
34−#endif
3532#endif
3633
3734import Control.Monad.Identity
@@ -130,7 +127,7 @@ listWithKeyShallowDiff initialVals valsChanged mkChild = do
130127 Nothing -> Just Nothing
131128
132129 -- We don't want to let spurious re-creations of items through
133− Just _ -> Nothing
130+ Just _ -> Nothing
134131 listHoldWithKey
135132 initialVals
136133 (attachWith (flip (Map.differenceWith relevantPatch))
src/Reflex/Dynamic.hs+3−17
@@ -53,12 +53,10 @@ module Reflex.Dynamic
5353 , foldDynMaybe
5454 , foldDynMaybeM
5555 , joinDynThroughMap
56− , joinDynThroughIntMap
5756 , traceDyn
5857 , traceDynWith
5958 , splitDynPure
6059 , distributeMapOverDynPure
61− , distributeIntMapOverDynPure
6260 , distributeDMapOverDynPure
6361 , distributeListOverDynPure
6462 , Demux
@@ -89,14 +87,11 @@ import Data.Align
8987import Data.Dependent.Map (DMap)
9088import qualified Data.Dependent.Map as DMap
9189import Data.Dependent.Sum (DSum (..))
92−import Data.GADT.Compare (GCompare (..), GEq (..), GOrdering (..))
93−import Data.IntMap (IntMap)
94−import qualified Data.IntMap as IntMap
90+import Data.GADT.Compare ((:~:) (..), GCompare (..), GEq (..), GOrdering (..))
9591import Data.Map (Map)
9692import Data.Maybe
9793import Data.Monoid ((<>))
9894import Data.These
99−import Data.Type.Equality ((:~:) (..))
10095
10196import Debug.Trace
10297
@@ -196,6 +191,7 @@ switchPromptlyDyn de =
196191 let eLag = switch $ current de
197192 eCoincidences = coincidence $ updated de
198193 in leftmost [eCoincidences, eLag]
194+--TODO: switchPromptlyDyn should get the `only` treatment like switchHoldPromptOnly
199195
200196-- | Split a 'Dynamic' pair into a pair of 'Dynamic's
201197splitDynPure :: Reflex t => Dynamic t (a, b) -> (Dynamic t a, Dynamic t b)
@@ -206,11 +202,6 @@ splitDynPure d = (fmap fst d, fmap snd d)
206202distributeMapOverDynPure :: (Reflex t, Ord k) => Map k (Dynamic t v) -> Dynamic t (Map k v)
207203distributeMapOverDynPure = fmap dmapToMap . distributeDMapOverDynPure . mapWithFunctorToDMap
208204
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−
214205-- | Convert a list with 'Dynamic' elements into a 'Dynamic' of a list with
215206-- non-'Dynamic' elements, preserving the order of the elements.
216207{-# DEPRECATED distributeListOverDynPure "Use 'distributeListOverDyn' instead" #-}
@@ -223,11 +214,6 @@ distributeListOverDynPure = distributeListOverDyn
223214joinDynThroughMap :: forall t k a. (Reflex t, Ord k) => Dynamic t (Map k (Dynamic t a)) -> Dynamic t (Map k a)
224215joinDynThroughMap = (distributeMapOverDynPure =<<)
225216
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 =<<)
230−
231217-- | Print the value of the 'Dynamic' when it is first read and on each
232218-- subsequent change that is observed (as 'traceEvent'), prefixed with the
233219-- provided string. This should /only/ be used for debugging.
@@ -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, 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)
src/Reflex/DynamicWriter/Base.hs+5−14
@@ -22,7 +22,6 @@ module Reflex.DynamicWriter.Base
2222import Control.Monad.Exception
2323import Control.Monad.Identity
2424import Control.Monad.IO.Class
25−import Control.Monad.Morph
2625import Control.Monad.Primitive
2726import Control.Monad.Reader
2827import Control.Monad.Ref
@@ -45,13 +44,16 @@ import Reflex.Class
4544import Reflex.DynamicWriter.Class
4645import Reflex.EventWriter.Class (EventWriter, tellEvent)
4746import Reflex.Host.Class
48−import qualified Data.Patch.MapWithMove as MapWithMove
47+import qualified Reflex.Patch.MapWithMove as MapWithMove
4948import Reflex.PerformEvent.Class
5049import Reflex.PostBuild.Class
5150import Reflex.Query.Class
5251import Reflex.Requester.Class
5352import Reflex.TriggerEvent.Class
5453
54+instance MonadTrans (DynamicWriterT t w) where
55+ lift = DynamicWriterT . lift
56+
5557mapIncrementalMapValues :: (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')
5658mapIncrementalMapValues f = unsafeMapIncremental (fmap f) (fmap f)
5759
@@ -88,18 +90,7 @@ mergeDynIncrementalWithMove a = unsafeBuildIncremental (mapM (sample . current)
8890
8991-- | A basic implementation of 'DynamicWriter'.
9092newtype 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− )
93+ deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadAsyncException, MonadException) -- The list is kept in reverse order
10394
10495deriving instance MonadHold t m => MonadHold t (DynamicWriterT t w m)
10596deriving instance MonadSample t m => MonadSample t (DynamicWriterT t w m)
src/Reflex/DynamicWriter/Class.hs+1
@@ -26,3 +26,4 @@ class (Monad m, Monoid w) => DynamicWriter t w m | m -> t w where
2626
2727instance DynamicWriter t w m => DynamicWriter t w (ReaderT r m) where
2828 tellDyn = lift . tellDyn
29+
src/Reflex/EventWriter/Base.hs+14−67
@@ -35,20 +35,20 @@ import Reflex.TriggerEvent.Class
3535
3636import Control.Monad.Exception
3737import Control.Monad.Identity
38−import Control.Monad.Morph
3938import Control.Monad.Primitive
4039import Control.Monad.Reader
4140import Control.Monad.Ref
4241import Control.Monad.State.Strict
43−import Data.Dependent.Map (DMap)
42+import Data.Dependent.Map (DMap, DSum (..))
4443import qualified Data.Dependent.Map as DMap
45−import Data.Dependent.Sum (DSum (..))
4644import Data.Functor.Compose
4745import Data.Functor.Misc
4846import Data.GADT.Compare (GCompare (..), GEq (..), GOrdering (..))
4947import Data.IntMap.Strict (IntMap)
5048import qualified Data.IntMap.Strict as IntMap
5149import Data.List.NonEmpty (NonEmpty (..))
50+import Data.List.NonEmpty.Deferred (NonEmptyDeferred)
51+import qualified Data.List.NonEmpty.Deferred as NonEmptyDeferred
5252import Data.Map (Map)
5353import qualified Data.Map as Map
5454import Data.Semigroup
@@ -56,77 +56,23 @@ import Data.Some (Some)
5656import Data.Tuple
5757import Data.Type.Equality
5858
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− }
59+type EventWriterState t w = Maybe (NonEmptyDeferred (Event t w))
9860
9961-- | A basic implementation of 'EventWriter'.
10062newtype 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− )
63+ deriving (Functor, Applicative, Monad, MonadFix, MonadIO, MonadException, MonadAsyncException)
11264
11365-- | Run a 'EventWriterT' action.
11466runEventWriterT :: forall t m w a. (Reflex t, Monad m, Semigroup w) => EventWriterT t w m a -> m (a, Event t w)
11567runEventWriterT (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
68+ (result, requests) <- runStateT a Nothing
69+ return (result, maybe never (sconcatCheap . NonEmptyDeferred.toNonEmpty) requests)
12270
12371instance (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− }
72+ tellEvent w = EventWriterT $ modify (<> Just (NonEmptyDeferred.singleton w))
73+
74+instance MonadTrans (EventWriterT t w) where
75+ lift = EventWriterT . lift
13076
13177instance MonadSample t m => MonadSample t (EventWriterT t w m) where
13278 sample = lift . sample
@@ -142,8 +88,6 @@ instance MonadHold t m => MonadHold t (EventWriterT t w m) where
14288 buildDynamic a0 = lift . buildDynamic a0
14389 {-# INLINABLE headE #-}
14490 headE = lift . headE
145− {-# INLINABLE now #-}
146− now = lift now
14791
14892instance (Reflex t, Adjustable t m, MonadHold t m, Semigroup w) => Adjustable t (EventWriterT t w m) where
14993 runWithReplace = runWithReplaceEventWriterTWith $ \dm0 dm' -> lift $ runWithReplace dm0 dm'
@@ -211,6 +155,9 @@ sequenceIntMapWithAdjustEventWriterTWith base mergePatchIncremental coincidenceP
211155 h : t -> Just $ sconcat $ h :| t
212156 return (result0, result')
213157
158+switchHoldPromptOnlyIntMapIncremental :: (Reflex t, MonadHold t m) => IntMap (Event t a) -> Event t (PatchIntMap (Event t a)) -> m (Event t (IntMap a))
159+switchHoldPromptOnlyIntMapIncremental = switchHoldPromptOnlyIncremental mergeIntIncremental coincidencePatchIntMap
160+
214161-- | Like 'runWithReplaceEventWriterTWith', but for 'sequenceDMapWithAdjust'.
215162sequenceDMapWithAdjustEventWriterTWith
216163 :: forall t m p p' w k v v'
src/Reflex/FanTag.hsnew file+23
@@ -0,0 +1,23 @@
1+{-# LANGUAGE PolyKinds #-}
2+{-# LANGUAGE ScopedTypeVariables #-}
3+module Reflex.FanTag
4+ ( EventSelectorTag
5+ , unEventSelectorTag
6+ , fanTag
7+ , selectTag
8+ ) where
9+
10+import Data.Unique.Tag.Local
11+import Data.TagMap
12+import Reflex.Class
13+
14+import GHC.Exts (Any)
15+import Unsafe.Coerce
16+
17+newtype EventSelectorTag t x (v :: k -> *) = EventSelectorTag { unEventSelectorTag :: EventSelectorInt t Any }
18+
19+fanTag :: Reflex t => Event t (TagMap x v) -> EventSelectorTag t x v
20+fanTag = EventSelectorTag . fanInt . fmapCheap unTagMap
21+
22+selectTag :: forall t x v a. Reflex t => EventSelectorTag t x v -> Tag x a -> Event t (v a)
23+selectTag (EventSelectorTag s) = fmapCheap (unsafeCoerce :: Any -> v a) . selectInt s . tagId
src/Reflex/FastWeak.hs−10
@@ -151,16 +151,6 @@ getFastWeakTicket w = do
151151
152152-- | Create a 'FastWeakTicket' directly from a value, creating a 'FastWeak' in the process
153153-- 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 #-}
164154mkFastWeakTicket :: a -> IO (FastWeakTicket a)
165155-- 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
166156-- associated FastWeak to actually be weak
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.hs+1−1
@@ -20,7 +20,7 @@ import Reflex.NotReady.Class
2020import Reflex.PostBuild.Class
2121
2222-- | 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.
23+-- The returned Event of network results fires when the 'Dynamic' updates.
2424-- Note: Often, the type 'a' is an Event, in which case the return value is an Event-of-Events, where the outer 'Event' fires
2525-- when switching networks. Such an 'Event' would typically be flattened (via 'switchPromptly').
2626networkView :: (NotReady t m, Adjustable t m, PostBuild t m) => Dynamic t (m a) -> m (Event t a)
src/Reflex/NotReady/Class.hs+5
@@ -25,6 +25,7 @@ import Reflex.PerformEvent.Base (PerformEventT (..))
2525import Reflex.PostBuild.Base (PostBuildT)
2626import Reflex.Query.Base (QueryT)
2727import Reflex.Requester.Base (RequesterT)
28+import Reflex.Requester.Base.Internal (RequesterInternalT)
2829import Reflex.TriggerEvent.Base (TriggerEventT)
2930
3031class Monad m => NotReady t m | m -> t where
@@ -72,6 +73,10 @@ instance NotReady t m => NotReady t (RequesterT t request response m) where
7273 notReadyUntil = lift . notReadyUntil
7374 notReady = lift notReady
7475
76+instance NotReady t m => NotReady t (RequesterInternalT s t request response m) where
77+ notReadyUntil = lift . notReadyUntil
78+ notReady = lift notReady
79+
7580instance NotReady t m => NotReady t (TriggerEventT t m) where
7681 notReadyUntil = lift . notReadyUntil
7782 notReady = lift notReady
src/Reflex/Patch.hsnew file+46
@@ -0,0 +1,46 @@
1+{-# LANGUAGE TypeFamilies #-}
2+-- |
3+-- Module:
4+-- Reflex.Patch
5+-- Description:
6+-- This module defines the 'Patch' class, which is used by Reflex to manage
7+-- changes to 'Reflex.Class.Incremental' values.
8+module Reflex.Patch
9+ ( module Reflex.Patch
10+ , module X
11+ ) where
12+
13+import Reflex.Patch.Class as X
14+import Reflex.Patch.DMap as X hiding (getDeletions)
15+import Reflex.Patch.DMapWithMove as X (PatchDMapWithMove, const2PatchDMapWithMoveWith, mapPatchDMapWithMove,
16+ patchDMapWithMoveToPatchMapWithMoveWith,
17+ traversePatchDMapWithMoveWithKey, unPatchDMapWithMove,
18+ unsafePatchDMapWithMove, weakenPatchDMapWithMoveWith)
19+import Reflex.Patch.IntMap as X hiding (getDeletions)
20+import Reflex.Patch.Map as X
21+import Reflex.Patch.MapWithMove as X (PatchMapWithMove, patchMapWithMoveNewElements,
22+ patchMapWithMoveNewElementsMap, unPatchMapWithMove,
23+ unsafePatchMapWithMove)
24+import Data.Map.Monoidal (MonoidalMap)
25+import Data.Semigroup (Semigroup (..), (<>))
26+
27+-- | A 'Group' is a 'Monoid' where every element has an inverse.
28+class (Semigroup q, Monoid q) => Group q where
29+ negateG :: q -> q
30+ (~~) :: q -> q -> q
31+ r ~~ s = r <> negateG s
32+
33+-- | An 'Additive' 'Semigroup' is one where (<>) is commutative
34+class Semigroup q => Additive q where
35+
36+-- | The elements of an 'Additive' 'Semigroup' can be considered as patches of their own type.
37+newtype AdditivePatch p = AdditivePatch { unAdditivePatch :: p }
38+
39+instance Additive p => Patch (AdditivePatch p) where
40+ type PatchTarget (AdditivePatch p) = p
41+ apply (AdditivePatch p) q = Just $ p <> q
42+
43+instance (Ord k, Group q) => Group (MonoidalMap k q) where
44+ negateG = fmap negateG
45+
46+instance (Ord k, Additive q) => Additive (MonoidalMap k q)
src/Reflex/Patch/Class.hsnew file+34
@@ -0,0 +1,34 @@
1+{-# LANGUAGE TypeFamilies #-}
2+-- | The interface for types which represent changes made to other types
3+module Reflex.Patch.Class where
4+
5+import Control.Monad.Identity
6+import Data.Maybe
7+import Data.Semigroup (Semigroup(..))
8+
9+-- | A 'Patch' type represents a kind of change made to a datastructure.
10+--
11+-- If an instance of 'Patch' is also an instance of 'Semigroup', it should obey
12+-- the law that @applyAlways (f <> g) == applyAlways f . applyAlways g@.
13+class Patch p where
14+ type PatchTarget p :: *
15+ -- | Apply the patch @p a@ to the value @a@. If no change is needed, return
16+ -- 'Nothing'.
17+ apply :: p -> PatchTarget p -> Maybe (PatchTarget p)
18+
19+-- | Apply a 'Patch'; if it does nothing, return the original value
20+applyAlways :: Patch p => p -> PatchTarget p -> PatchTarget p
21+applyAlways p t = fromMaybe t $ apply p t
22+
23+-- | 'Identity' can be used as a 'Patch' that always fully replaces the value
24+instance Patch (Identity a) where
25+ type PatchTarget (Identity a) = a
26+ apply (Identity a) _ = Just a
27+
28+-- | Like '(.)', but composes functions that return patches rather than
29+-- functions that return new values. The Semigroup instance for patches must
30+-- apply patches right-to-left, like '(.)'.
31+composePatchFunctions :: (Patch p, Semigroup p) => (PatchTarget p -> p) -> (PatchTarget p -> p) -> PatchTarget p -> p
32+composePatchFunctions g f a =
33+ let fp = f a
34+ in g (applyAlways fp a) <> fp
src/Reflex/Patch/DMap.hsnew file+82
@@ -0,0 +1,82 @@
1+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
2+{-# LANGUAGE LambdaCase #-}
3+{-# LANGUAGE PolyKinds #-}
4+{-# LANGUAGE Rank2Types #-}
5+{-# LANGUAGE ScopedTypeVariables #-}
6+{-# LANGUAGE StandaloneDeriving #-}
7+{-# LANGUAGE TypeFamilies #-}
8+-- | 'Patch'es on 'DMap' that consist only of insertions (or overwrites) and deletions.
9+module Reflex.Patch.DMap where
10+
11+import Reflex.Patch.Class
12+import Reflex.Patch.IntMap
13+import Reflex.Patch.Map
14+
15+import Data.Dependent.Map (DMap, DSum (..), GCompare (..))
16+import qualified Data.Dependent.Map as DMap
17+import Data.Functor.Constant
18+import Data.Functor.Misc
19+import qualified Data.IntMap as IntMap
20+import qualified Data.Map as Map
21+import Data.Semigroup (Semigroup (..))
22+import Data.Some (Some)
23+
24+-- | A set of changes to a 'DMap'. Any element may be inserted/updated or deleted.
25+-- Insertions are represented as @'ComposeMaybe' (Just value)@,
26+-- while deletions are represented as @'ComposeMaybe' Nothing@.
27+newtype PatchDMap k v = PatchDMap { unPatchDMap :: DMap k (ComposeMaybe v) }
28+
29+deriving instance GCompare k => Semigroup (PatchDMap k v)
30+
31+deriving instance GCompare k => Monoid (PatchDMap k v)
32+
33+-- | Apply the insertions or deletions to a given 'DMap'.
34+instance GCompare k => Patch (PatchDMap k v) where
35+ type PatchTarget (PatchDMap k v) = DMap k v
36+ 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?
37+ where insertions = DMap.mapMaybeWithKey (const $ getComposeMaybe) diff
38+ deletions = DMap.mapMaybeWithKey (const $ nothingToJust . getComposeMaybe) diff
39+ nothingToJust = \case
40+ Nothing -> Just $ Constant ()
41+ Just _ -> Nothing
42+
43+-- | Map a function @v a -> v' a@ over any inserts/updates in the given
44+-- @'PatchDMap' k v@ to produce a @'PatchDMap' k v'@.
45+mapPatchDMap :: (forall a. v a -> v' a) -> PatchDMap k v -> PatchDMap k v'
46+mapPatchDMap f (PatchDMap p) = PatchDMap $ DMap.map (ComposeMaybe . fmap f . getComposeMaybe) p
47+
48+-- | Map an effectful function @v a -> f (v' a)@ over any inserts/updates in the given
49+-- @'PatchDMap' k v@ to produce a @'PatchDMap' k v'@.
50+traversePatchDMap :: Applicative f => (forall a. v a -> f (v' a)) -> PatchDMap k v -> f (PatchDMap k v')
51+traversePatchDMap f = traversePatchDMapWithKey $ const f
52+
53+-- | Map an effectful function @k a -> v a -> f (v' a)@ over any inserts/updates
54+-- in the given @'PatchDMap' k v@ to produce a @'PatchDMap' k v'@.
55+traversePatchDMapWithKey :: Applicative m => (forall a. k a -> v a -> m (v' a)) -> PatchDMap k v -> m (PatchDMap k v')
56+traversePatchDMapWithKey f (PatchDMap p) = PatchDMap <$> DMap.traverseWithKey (\k (ComposeMaybe v) -> ComposeMaybe <$> traverse (f k) v) p
57+
58+-- | Weaken a @'PatchDMap' k v@ to a @'PatchMap' (Some k) v'@ using a function
59+-- @v a -> v'@ to weaken each value contained in the patch.
60+weakenPatchDMapWith :: (forall a. v a -> v') -> PatchDMap k v -> PatchMap (Some k) v'
61+weakenPatchDMapWith f (PatchDMap p) = PatchMap $ weakenDMapWith (fmap f . getComposeMaybe) p
62+
63+-- | Convert a weak @'PatchDMap' ('Const2' k a) v@ where the @a@ is known by way of
64+-- the @Const2@ into a @'PatchMap' k v'@ using a rank 1 function @v a -> v'@.
65+patchDMapToPatchMapWith :: (v a -> v') -> PatchDMap (Const2 k a) v -> PatchMap k v'
66+patchDMapToPatchMapWith f (PatchDMap p) = PatchMap $ dmapToMapWith (fmap f . getComposeMaybe) p
67+
68+-- | Convert a @'PatchMap' k v@ into a @'PatchDMap' ('Const2' k a) v'@ using a function @v -> v' a@.
69+const2PatchDMapWith :: forall k v v' a. (v -> v' a) -> PatchMap k v -> PatchDMap (Const2 k a) v'
70+const2PatchDMapWith f (PatchMap p) = PatchDMap $ DMap.fromDistinctAscList $ g <$> Map.toAscList p
71+ where g :: (k, Maybe v) -> DSum (Const2 k a) (ComposeMaybe v')
72+ g (k, e) = Const2 k :=> ComposeMaybe (f <$> e)
73+
74+-- | Convert a @'PatchIntMap' v@ into a @'PatchDMap' ('Const2' Int a) v'@ using a function @v -> v' a@.
75+const2IntPatchDMapWith :: forall v f a. (v -> f a) -> PatchIntMap v -> PatchDMap (Const2 IntMap.Key a) f
76+const2IntPatchDMapWith f (PatchIntMap p) = PatchDMap $ DMap.fromDistinctAscList $ g <$> IntMap.toAscList p
77+ where g :: (IntMap.Key, Maybe v) -> DSum (Const2 IntMap.Key a) (ComposeMaybe f)
78+ g (k, e) = Const2 k :=> ComposeMaybe (f <$> e)
79+
80+-- | Get the values that will be replaced or deleted if the given patch is applied to the given 'DMap'.
81+getDeletions :: GCompare k => PatchDMap k v -> DMap k v' -> DMap k v'
82+getDeletions (PatchDMap p) m = DMap.intersectionWithKey (\_ v _ -> v) m p
src/Reflex/Patch/DMapWithMove.hsnew file+363
@@ -0,0 +1,363 @@
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+
14+-- |Module containing @'PatchDMapWithMove' k v@ and associated functions, which represents a 'Patch' to a @'DMap' k v@ which can insert, update, delete, and
15+-- move values between keys.
16+module Reflex.Patch.DMapWithMove where
17+
18+import Reflex.Patch.Class
19+import Reflex.Patch.MapWithMove (PatchMapWithMove (..))
20+import qualified Reflex.Patch.MapWithMove as MapWithMove
21+
22+import Data.Constraint.Extras
23+import Data.Dependent.Map (DMap, DSum (..), GCompare (..))
24+import qualified Data.Dependent.Map as DMap
25+import Data.Functor.Constant
26+import Data.Functor.Misc
27+import Data.Functor.Product
28+import Data.GADT.Compare (GEq (..))
29+import Data.GADT.Show (GShow, gshow)
30+import qualified Data.Map as Map
31+import Data.Maybe
32+import Data.Semigroup (Semigroup (..), (<>))
33+import Data.Some (Some(Some))
34+import Data.These
35+
36+-- | Like 'PatchMapWithMove', but for 'DMap'. Each key carries a 'NodeInfo' which describes how it will be changed by the patch and connects move sources and
37+-- destinations.
38+--
39+-- Invariants:
40+--
41+-- * A key should not move to itself.
42+-- * A move should always be represented with both the destination key (as a 'From_Move') and the source key (as a @'ComposeMaybe' ('Just' destination)@)
43+newtype PatchDMapWithMove k v = PatchDMapWithMove (DMap k (NodeInfo k v))
44+
45+-- |Structure which represents what changes apply to a particular key. @_nodeInfo_from@ specifies what happens to this key, and in particular what other key
46+-- the current key is moving from, while @_nodeInfo_to@ specifies what key the current key is moving to if involved in a move.
47+data NodeInfo k v a = NodeInfo
48+ { _nodeInfo_from :: !(From k v a)
49+ -- ^Change applying to the current key, be it an insert, move, or delete.
50+ , _nodeInfo_to :: !(To k a)
51+ -- ^Where this key is moving to, if involved in a move. Should only be @ComposeMaybe (Just k)@ when there is a corresponding 'From_Move'.
52+ }
53+ deriving (Show)
54+
55+-- |Structure describing a particular change to a key, be it inserting a new key (@From_Insert@), updating an existing key (@From_Insert@ again), deleting a
56+-- key (@From_Delete@), or moving a key (@From_Move@).
57+data From (k :: a -> *) (v :: a -> *) :: a -> * where
58+ -- |Insert a new or update an existing key with the given value @v a@
59+ From_Insert :: v a -> From k v a
60+ -- |Delete the existing key
61+ From_Delete :: From k v a
62+ -- |Move the value from the given key @k a@ to this key. The source key should also have an entry in the patch giving the current key as @_nodeInfo_to@,
63+ -- usually but not necessarily with @From_Delete@.
64+ From_Move :: !(k a) -> From k v a
65+ deriving (Show, Read, Eq, Ord)
66+
67+-- |Type alias for the "to" part of a 'NodeInfo'. @'ComposeMaybe' ('Just' k)@ means the key is moving to another key, @ComposeMaybe Nothing@ for any other
68+-- operation.
69+type To = ComposeMaybe
70+
71+-- |Test whether a 'PatchDMapWithMove' satisfies its invariants.
72+validPatchDMapWithMove :: forall k v. (GCompare k, GShow k) => DMap k (NodeInfo k v) -> Bool
73+validPatchDMapWithMove = not . null . validationErrorsForPatchDMapWithMove
74+
75+-- |Enumerate what reasons a 'PatchDMapWithMove' doesn't satisfy its invariants, returning @[]@ if it's valid.
76+validationErrorsForPatchDMapWithMove :: forall k v. (GCompare k, GShow k) => DMap k (NodeInfo k v) -> [String]
77+validationErrorsForPatchDMapWithMove m =
78+ noSelfMoves <> movesBalanced
79+ where
80+ noSelfMoves = mapMaybe selfMove . DMap.toAscList $ m
81+ selfMove (dst :=> NodeInfo (From_Move src) _) | Just _ <- dst `geq` src = Just $ "self move of key " <> gshow src <> " at destination side"
82+ selfMove (src :=> NodeInfo _ (ComposeMaybe (Just dst))) | Just _ <- src `geq` dst = Just $ "self move of key " <> gshow dst <> " at source side"
83+ selfMove _ = Nothing
84+ movesBalanced = mapMaybe unbalancedMove . DMap.toAscList $ m
85+ unbalancedMove (dst :=> NodeInfo (From_Move src) _) =
86+ case DMap.lookup src m of
87+ Nothing -> Just $ "unbalanced move at destination key " <> gshow dst <> " supposedly from " <> gshow src <> " but source key is not in the patch"
88+ Just (NodeInfo _ (ComposeMaybe (Just dst'))) ->
89+ if isNothing (dst' `geq` dst)
90+ then Just $ "unbalanced move at destination key " <> gshow dst <> " from " <> gshow src <> " is going to " <> gshow dst' <> " instead"
91+ else Nothing
92+ _ ->
93+ Just $ "unbalanced move at destination key " <> gshow dst <> " supposedly from " <> gshow src <> " but source key has no move to key"
94+ unbalancedMove (src :=> NodeInfo _ (ComposeMaybe (Just dst))) =
95+ case DMap.lookup dst m of
96+ Nothing -> Just $ " unbalanced move at source key " <> gshow src <> " supposedly going to " <> gshow dst <> " but destination key is not in the patch"
97+ Just (NodeInfo (From_Move src') _) ->
98+ if isNothing (src' `geq` src)
99+ then Just $ "unbalanced move at source key " <> gshow src <> " to " <> gshow dst <> " is coming from " <> gshow src' <> " instead"
100+ else Nothing
101+
102+ _ ->
103+ Just $ "unbalanced move at source key " <> gshow src <> " supposedly going to " <> gshow dst <> " but destination key is not moving"
104+ unbalancedMove _ = Nothing
105+
106+-- |Test whether two @'PatchDMapWithMove' k v@ contain the same patch operations.
107+instance (GEq k, Has' Eq k (NodeInfo k v)) => Eq (PatchDMapWithMove k v) where
108+ PatchDMapWithMove a == PatchDMapWithMove b = a == b
109+
110+-- |Higher kinded 2-tuple, identical to @Data.Functor.Product@ from base ≥ 4.9
111+data Pair1 f g a = Pair1 (f a) (g a)
112+
113+-- |Helper data structure used for composing patches using the monoid instance.
114+data Fixup k v a
115+ = Fixup_Delete
116+ | Fixup_Update (These (From k v a) (To k a))
117+
118+-- |Compose patches having the same effect as applying the patches in turn: @'applyAlways' (p <> q) == 'applyAlways' p . 'applyAlways' q@
119+instance GCompare k => Semigroup (PatchDMapWithMove k v) where
120+ PatchDMapWithMove ma <> PatchDMapWithMove mb = PatchDMapWithMove m
121+ where
122+ connections = DMap.toList $ DMap.intersectionWithKey (\_ a b -> Pair1 (_nodeInfo_to a) (_nodeInfo_from b)) ma mb
123+ h :: DSum k (Pair1 (ComposeMaybe k) (From k v)) -> [DSum k (Fixup k v)]
124+ h (_ :=> Pair1 (ComposeMaybe mToAfter) editBefore) = case (mToAfter, editBefore) of
125+ (Just toAfter, From_Move fromBefore)
126+ | isJust $ fromBefore `geq` toAfter
127+ -> [toAfter :=> Fixup_Delete]
128+ | otherwise
129+ -> [ toAfter :=> Fixup_Update (This editBefore)
130+ , fromBefore :=> Fixup_Update (That (ComposeMaybe mToAfter))
131+ ]
132+ (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
133+ (Just toAfter, _) -> [toAfter :=> Fixup_Update (This editBefore)]
134+ (Nothing, _) -> []
135+ mergeFixups _ Fixup_Delete Fixup_Delete = Fixup_Delete
136+ mergeFixups _ (Fixup_Update a) (Fixup_Update b)
137+ | This x <- a, That y <- b
138+ = Fixup_Update $ These x y
139+ | That y <- a, This x <- b
140+ = Fixup_Update $ These x y
141+ mergeFixups _ _ _ = error "PatchDMapWithMove: incompatible fixups"
142+ fixups = DMap.fromListWithKey mergeFixups $ concatMap h connections
143+ combineNodeInfos _ nia nib = NodeInfo
144+ { _nodeInfo_from = _nodeInfo_from nia
145+ , _nodeInfo_to = _nodeInfo_to nib
146+ }
147+ applyFixup _ ni = \case
148+ Fixup_Delete -> Nothing
149+ Fixup_Update u -> Just $ NodeInfo
150+ { _nodeInfo_from = fromMaybe (_nodeInfo_from ni) $ getHere u
151+ , _nodeInfo_to = fromMaybe (_nodeInfo_to ni) $ getThere u
152+ }
153+ m = DMap.differenceWithKey applyFixup (DMap.unionWithKey combineNodeInfos ma mb) fixups
154+ getHere :: These a b -> Maybe a
155+ getHere = \case
156+ This a -> Just a
157+ These a _ -> Just a
158+ That _ -> Nothing
159+ getThere :: These a b -> Maybe b
160+ getThere = \case
161+ This _ -> Nothing
162+ These _ b -> Just b
163+ That b -> Just b
164+
165+-- |Compose patches having the same effect as applying the patches in turn: @'applyAlways' (p <> q) == 'applyAlways' p . 'applyAlways' q@
166+instance GCompare k => Monoid (PatchDMapWithMove k v) where
167+ mempty = PatchDMapWithMove mempty
168+ mappend = (<>)
169+
170+{-
171+mappendPatchDMapWithMoveSlow :: forall k v. (ShowTag k v, GCompare k) => PatchDMapWithMove k v -> PatchDMapWithMove k v -> PatchDMapWithMove k v
172+PatchDMapWithMove dstAfter srcAfter `mappendPatchDMapWithMoveSlow` PatchDMapWithMove dstBefore srcBefore = PatchDMapWithMove dst src
173+ where
174+ 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
175+ removeRedundantDst toKey (From_Move fromKey) | isJust (toKey `geq` fromKey) = Nothing
176+ removeRedundantDst _ a = Just a
177+ f :: forall a. k a -> From k v a -> Maybe (From k v a)
178+ f toKey _ = removeRedundantDst toKey $ case getDstAction toKey dstAfter of
179+ From_Move fromKey -> getDstAction fromKey dstBefore
180+ nonMove -> nonMove
181+ dst = DMap.mapMaybeWithKey f $ DMap.union dstAfter dstBefore
182+ getSrcAction k m = fromMaybe (ComposeMaybe $ Just k) $ DMap.lookup k m
183+ removeRedundantSrc fromKey (ComposeMaybe (Just toKey)) | isJust (fromKey `geq` toKey) = Nothing
184+ removeRedundantSrc _ a = Just a
185+ g :: forall a. k a -> ComposeMaybe k a -> Maybe (ComposeMaybe k a)
186+ g fromKey _ = removeRedundantSrc fromKey $ case getSrcAction fromKey srcBefore of
187+ ComposeMaybe Nothing -> ComposeMaybe Nothing
188+ ComposeMaybe (Just toKeyBefore) -> getSrcAction toKeyBefore srcAfter
189+ src = DMap.mapMaybeWithKey g $ DMap.union srcAfter srcBefore
190+-}
191+
192+-- |Make a @'PatchDMapWithMove' k v@ which has the effect of inserting or updating a value @v a@ to the given key @k a@, like 'DMap.insert'.
193+insertDMapKey :: k a -> v a -> PatchDMapWithMove k v
194+insertDMapKey k v =
195+ PatchDMapWithMove . DMap.singleton k $ NodeInfo (From_Insert v) (ComposeMaybe Nothing)
196+
197+-- |Make a @'PatchDMapWithMove' k v@ which has the effect of moving the value from the first key @k a@ to the second key @k a@, equivalent to:
198+--
199+-- @
200+-- 'DMap.delete' src (maybe dmap ('DMap.insert' dst) (DMap.lookup src dmap))
201+-- @
202+moveDMapKey :: GCompare k => k a -> k a -> PatchDMapWithMove k v
203+moveDMapKey src dst = case src `geq` dst of
204+ Nothing -> PatchDMapWithMove $ DMap.fromList
205+ [ dst :=> NodeInfo (From_Move src) (ComposeMaybe Nothing)
206+ , src :=> NodeInfo From_Delete (ComposeMaybe $ Just dst)
207+ ]
208+ Just _ -> mempty
209+
210+-- |Make a @'PatchDMapWithMove' k v@ which has the effect of swapping two keys in the mapping, equivalent to:
211+--
212+-- @
213+-- let aMay = DMap.lookup a dmap
214+-- bMay = DMap.lookup b dmap
215+-- in maybe id (DMap.insert a) (bMay `mplus` aMay)
216+-- . maybe id (DMap.insert b) (aMay `mplus` bMay)
217+-- . DMap.delete a . DMap.delete b $ dmap
218+-- @
219+swapDMapKey :: GCompare k => k a -> k a -> PatchDMapWithMove k v
220+swapDMapKey src dst = case src `geq` dst of
221+ Nothing -> PatchDMapWithMove $ DMap.fromList
222+ [ dst :=> NodeInfo (From_Move src) (ComposeMaybe $ Just src)
223+ , src :=> NodeInfo (From_Move dst) (ComposeMaybe $ Just dst)
224+ ]
225+ Just _ -> mempty
226+
227+-- |Make a @'PatchDMapWithMove' k v@ which has the effect of deleting a key in the mapping, equivalent to 'DMap.delete'.
228+deleteDMapKey :: k a -> PatchDMapWithMove k v
229+deleteDMapKey k = PatchDMapWithMove $ DMap.singleton k $ NodeInfo From_Delete $ ComposeMaybe Nothing
230+
231+{-
232+k1, k2 :: Const2 Int () ()
233+k1 = Const2 1
234+k2 = Const2 2
235+p1, p2 :: PatchDMapWithMove (Const2 Int ()) Identity
236+p1 = moveDMapKey k1 k2
237+p2 = moveDMapKey k2 k1
238+p12 = p1 <> p2
239+p21 = p2 <> p1
240+p12Slow = p1 `mappendPatchDMapWithMoveSlow` p2
241+p21Slow = p2 `mappendPatchDMapWithMoveSlow` p1
242+
243+testPatchDMapWithMove = do
244+ print p1
245+ print p2
246+ print $ p12 == deleteDMapKey k1
247+ print $ p21 == deleteDMapKey k2
248+ print $ p12Slow == deleteDMapKey k1
249+ print $ p21Slow == deleteDMapKey k2
250+
251+dst (PatchDMapWithMove x _) = x
252+src (PatchDMapWithMove _ x) = x
253+-}
254+
255+-- |Extract the 'DMap' representing the patch changes from the 'PatchDMapWithMove'.
256+unPatchDMapWithMove :: PatchDMapWithMove k v -> DMap k (NodeInfo k v)
257+unPatchDMapWithMove (PatchDMapWithMove p) = p
258+
259+-- |Wrap a 'DMap' representing patch changes into a 'PatchDMapWithMove', without checking any invariants.
260+--
261+-- __Warning:__ when using this function, you must ensure that the invariants of 'PatchDMapWithMove' are preserved; they will not be checked.
262+unsafePatchDMapWithMove :: DMap k (NodeInfo k v) -> PatchDMapWithMove k v
263+unsafePatchDMapWithMove = PatchDMapWithMove
264+
265+-- |Wrap a 'DMap' representing patch changes into a 'PatchDMapWithMove' while checking invariants. If the invariants are satisfied, @Right p@ is returned
266+-- otherwise @Left errors@.
267+patchDMapWithMove :: (GCompare k, GShow k) => DMap k (NodeInfo k v) -> Either [String] (PatchDMapWithMove k v)
268+patchDMapWithMove dm =
269+ case validationErrorsForPatchDMapWithMove dm of
270+ [] -> Right $ unsafePatchDMapWithMove dm
271+ errs -> Left errs
272+
273+-- |Map a natural transform @v -> v'@ over the given patch, transforming @'PatchDMapWithMove' k v@ into @'PatchDMapWithMove' k v'@.
274+mapPatchDMapWithMove :: forall k v v'. (forall a. v a -> v' a) -> PatchDMapWithMove k v -> PatchDMapWithMove k v'
275+mapPatchDMapWithMove f (PatchDMapWithMove p) = PatchDMapWithMove $
276+ DMap.map (\ni -> ni { _nodeInfo_from = g $ _nodeInfo_from ni }) p
277+ where g :: forall a. From k v a -> From k v' a
278+ g = \case
279+ From_Insert v -> From_Insert $ f v
280+ From_Delete -> From_Delete
281+ From_Move k -> From_Move k
282+
283+-- |Traverse an effectful function @forall a. v a -> m (v ' a)@ over the given patch, transforming @'PatchDMapWithMove' k v@ into @m ('PatchDMapWithMove' k v')@.
284+traversePatchDMapWithMove :: forall m k v v'. Applicative m => (forall a. v a -> m (v' a)) -> PatchDMapWithMove k v -> m (PatchDMapWithMove k v')
285+traversePatchDMapWithMove f = traversePatchDMapWithMoveWithKey $ const f
286+
287+-- |Map an effectful function @forall a. k a -> v a -> m (v ' a)@ over the given patch, transforming @'PatchDMapWithMove' k v@ into @m ('PatchDMapWithMove' k v')@.
288+traversePatchDMapWithMoveWithKey :: forall m k v v'. Applicative m => (forall a. k a -> v a -> m (v' a)) -> PatchDMapWithMove k v -> m (PatchDMapWithMove k v')
289+traversePatchDMapWithMoveWithKey f (PatchDMapWithMove p) = PatchDMapWithMove <$> DMap.traverseWithKey (nodeInfoMapFromM . g) p
290+ where g :: forall a. k a -> From k v a -> m (From k v' a)
291+ g k = \case
292+ From_Insert v -> From_Insert <$> f k v
293+ From_Delete -> pure From_Delete
294+ From_Move fromKey -> pure $ From_Move fromKey
295+
296+-- |Map a function which transforms @'From' k v a@ into a @'From' k v' a@ over a @'NodeInfo' k v a@.
297+nodeInfoMapFrom :: (From k v a -> From k v' a) -> NodeInfo k v a -> NodeInfo k v' a
298+nodeInfoMapFrom f ni = ni { _nodeInfo_from = f $ _nodeInfo_from ni }
299+
300+-- |Map an effectful function which transforms @'From' k v a@ into a @f ('From' k v' a)@ over a @'NodeInfo' k v a@.
301+nodeInfoMapFromM :: Functor f => (From k v a -> f (From k v' a)) -> NodeInfo k v a -> f (NodeInfo k v' a)
302+nodeInfoMapFromM f ni = fmap (\result -> ni { _nodeInfo_from = result }) $ f $ _nodeInfo_from ni
303+
304+-- |Weaken a 'PatchDMapWithMove' to a 'PatchMapWithMove' by weakening the keys from @k a@ to @'Some' k@ and applying a given weakening function @v a -> v'@ to
305+-- values.
306+weakenPatchDMapWithMoveWith :: forall k v v'. (forall a. v a -> v') -> PatchDMapWithMove k v -> PatchMapWithMove (Some k) v'
307+weakenPatchDMapWithMoveWith f (PatchDMapWithMove p) = PatchMapWithMove $ weakenDMapWith g p
308+ where g :: forall a. NodeInfo k v a -> MapWithMove.NodeInfo (Some k) v'
309+ g ni = MapWithMove.NodeInfo
310+ { MapWithMove._nodeInfo_from = case _nodeInfo_from ni of
311+ From_Insert v -> MapWithMove.From_Insert $ f v
312+ From_Delete -> MapWithMove.From_Delete
313+ From_Move k -> MapWithMove.From_Move $ Some k
314+ , MapWithMove._nodeInfo_to = Some <$> getComposeMaybe (_nodeInfo_to ni)
315+ }
316+
317+-- |"Weaken" a @'PatchDMapWithMove' (Const2 k a) v@ to a @'PatchMapWithMove' k v'@. Weaken is in scare quotes because the 'Const2' has already disabled any
318+-- dependency in the typing and all points are already @a@, hence the function to map each value to @v'@ is not higher rank.
319+patchDMapWithMoveToPatchMapWithMoveWith :: forall k v v' a. (v a -> v') -> PatchDMapWithMove (Const2 k a) v -> PatchMapWithMove k v'
320+patchDMapWithMoveToPatchMapWithMoveWith f (PatchDMapWithMove p) = PatchMapWithMove $ dmapToMapWith g p
321+ where g :: NodeInfo (Const2 k a) v a -> MapWithMove.NodeInfo k v'
322+ g ni = MapWithMove.NodeInfo
323+ { MapWithMove._nodeInfo_from = case _nodeInfo_from ni of
324+ From_Insert v -> MapWithMove.From_Insert $ f v
325+ From_Delete -> MapWithMove.From_Delete
326+ From_Move (Const2 k) -> MapWithMove.From_Move k
327+ , MapWithMove._nodeInfo_to = unConst2 <$> getComposeMaybe (_nodeInfo_to ni)
328+ }
329+
330+-- |"Strengthen" a @'PatchMapWithMove' k v@ into a @'PatchDMapWithMove ('Const2' k a)@; that is, turn a non-dependently-typed patch into a dependently typed
331+-- one but which always has a constant key type represented by 'Const2'. Apply the given function to each @v@ to produce a @v' a@.
332+-- Completemented by 'patchDMapWithMoveToPatchMapWithMoveWith'
333+const2PatchDMapWithMoveWith :: forall k v v' a. (v -> v' a) -> PatchMapWithMove k v -> PatchDMapWithMove (Const2 k a) v'
334+const2PatchDMapWithMoveWith f (PatchMapWithMove p) = PatchDMapWithMove $ DMap.fromDistinctAscList $ g <$> Map.toAscList p
335+ where g :: (k, MapWithMove.NodeInfo k v) -> DSum (Const2 k a) (NodeInfo (Const2 k a) v')
336+ g (k, ni) = Const2 k :=> NodeInfo
337+ { _nodeInfo_from = case MapWithMove._nodeInfo_from ni of
338+ MapWithMove.From_Insert v -> From_Insert $ f v
339+ MapWithMove.From_Delete -> From_Delete
340+ MapWithMove.From_Move fromKey -> From_Move $ Const2 fromKey
341+ , _nodeInfo_to = ComposeMaybe $ Const2 <$> MapWithMove._nodeInfo_to ni
342+ }
343+
344+-- | Apply the insertions, deletions, and moves to a given 'DMap'.
345+instance GCompare k => Patch (PatchDMapWithMove k v) where
346+ type PatchTarget (PatchDMapWithMove k v) = DMap k v
347+ 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?
348+ where insertions = DMap.mapMaybeWithKey insertFunc p
349+ insertFunc :: forall a. k a -> NodeInfo k v a -> Maybe (v a)
350+ insertFunc _ ni = case _nodeInfo_from ni of
351+ From_Insert v -> Just v
352+ From_Move k -> DMap.lookup k old
353+ From_Delete -> Nothing
354+ deletions = DMap.mapMaybeWithKey deleteFunc p
355+ deleteFunc :: forall a. k a -> NodeInfo k v a -> Maybe (Constant () a)
356+ deleteFunc _ ni = case _nodeInfo_from ni of
357+ From_Delete -> Just $ Constant ()
358+ _ -> Nothing
359+
360+-- | Get the values that will be replaced, deleted, or moved if the given patch is applied to the given 'DMap'.
361+getDeletionsAndMoves :: GCompare k => PatchDMapWithMove k v -> DMap k v' -> DMap k (Product v' (ComposeMaybe k))
362+getDeletionsAndMoves (PatchDMapWithMove p) m = DMap.intersectionWithKey f m p
363+ where f _ v ni = Pair v $ _nodeInfo_to ni
src/Reflex/Patch/IntMap.hsnew file+70
@@ -0,0 +1,70 @@
1+{-# LANGUAGE DeriveFoldable #-}
2+{-# LANGUAGE DeriveFunctor #-}
3+{-# LANGUAGE DeriveTraversable #-}
4+{-# LANGUAGE FlexibleInstances #-}
5+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
6+{-# LANGUAGE MultiParamTypeClasses #-}
7+{-# LANGUAGE TemplateHaskell #-}
8+{-# LANGUAGE TypeFamilies #-}
9+-- | Module containing 'PatchIntMap', a 'Patch' for 'IntMap' which allows for
10+-- insert/update or delete of associations.
11+module Reflex.Patch.IntMap where
12+
13+import Control.Lens
14+import Data.IntMap.Strict (IntMap)
15+import qualified Data.IntMap.Strict as IntMap
16+import Data.Maybe
17+import Data.Semigroup
18+import Reflex.Patch.Class
19+
20+-- | 'Patch' for 'IntMap' which represents insertion or deletion of keys in the mapping.
21+-- Internally represented by 'IntMap (Maybe a)', where @Just@ means insert/update
22+-- and @Nothing@ means delete.
23+newtype PatchIntMap a = PatchIntMap (IntMap (Maybe a)) deriving (Functor, Foldable, Traversable, Monoid)
24+
25+-- | @a <> b@ will apply the changes of @b@ and then apply the changes of @a@.
26+-- If the same key is modified by both patches, the one on the left will take
27+-- precedence.
28+instance Semigroup (PatchIntMap v) where
29+ PatchIntMap a <> PatchIntMap b = PatchIntMap $ a `mappend` b --TODO: Add a semigroup instance for Map
30+ -- PatchMap is idempotent, so stimes n is id for every n
31+ stimes = stimesIdempotentMonoid
32+
33+makeWrapped ''PatchIntMap
34+
35+-- | Apply the insertions or deletions to a given 'IntMap'.
36+instance Patch (PatchIntMap a) where
37+ type PatchTarget (PatchIntMap a) = IntMap a
38+ apply (PatchIntMap p) v = if IntMap.null p then Nothing else Just $
39+ let removes = IntMap.filter isNothing p
40+ adds = IntMap.mapMaybe id p
41+ in IntMap.union adds $ v `IntMap.difference` removes
42+
43+-- | Map a function @Int -> a -> b@ over all @a@s in the given @'PatchIntMap' a@
44+-- (that is, all inserts/updates), producing a @PatchIntMap b@.
45+mapIntMapPatchWithKey :: (Int -> a -> b) -> PatchIntMap a -> PatchIntMap b
46+mapIntMapPatchWithKey f (PatchIntMap m) = PatchIntMap $ IntMap.mapWithKey (\ k mv -> f k <$> mv) m
47+
48+instance FunctorWithIndex Int PatchIntMap
49+instance FoldableWithIndex Int PatchIntMap
50+instance TraversableWithIndex Int PatchIntMap where
51+ itraversed = _Wrapped . itraversed . traversed
52+
53+-- | Map an effectful function @Int -> a -> f b@ over all @a@s in the given @'PatchIntMap' a@
54+-- (that is, all inserts/updates), producing a @f (PatchIntMap b)@.
55+traverseIntMapPatchWithKey :: Applicative f => (Int -> a -> f b) -> PatchIntMap a -> f (PatchIntMap b)
56+traverseIntMapPatchWithKey f (PatchIntMap m) = PatchIntMap <$> IntMap.traverseWithKey (\k mv -> traverse (f k) mv) m
57+
58+-- | Extract all @a@s inserted/updated by the given @'PatchIntMap' a@.
59+patchIntMapNewElements :: PatchIntMap a -> [a]
60+patchIntMapNewElements (PatchIntMap m) = catMaybes $ IntMap.elems m
61+
62+-- | Convert the given @'PatchIntMap' a@ into an @'IntMap' a@ with all
63+-- the inserts/updates in the given patch.
64+patchIntMapNewElementsMap :: PatchIntMap a -> IntMap a
65+patchIntMapNewElementsMap (PatchIntMap m) = IntMap.mapMaybe id m
66+
67+-- | Subset the given @'IntMap' a@ to contain only the keys that would be
68+-- deleted by the given @'PatchIntMap' a@.
69+getDeletions :: PatchIntMap v -> IntMap v' -> IntMap v'
70+getDeletions (PatchIntMap m) v = IntMap.intersection v m
src/Reflex/Patch/Map.hsnew file+55
@@ -0,0 +1,55 @@
1+{-# LANGUAGE LambdaCase #-}
2+{-# LANGUAGE TypeFamilies #-}
3+-- | 'Patch'es on 'Map' that consist only of insertions (including overwrites)
4+-- and deletions
5+module Reflex.Patch.Map where
6+
7+import Reflex.Patch.Class
8+
9+import Data.Map (Map)
10+import qualified Data.Map as Map
11+import Data.Maybe
12+import Data.Semigroup
13+
14+-- | A set of changes to a 'Map'. Any element may be inserted/updated or
15+-- deleted. Insertions are represented as values wrapped in 'Just', while
16+-- deletions are represented as 'Nothing's
17+newtype PatchMap k v = PatchMap { unPatchMap :: Map k (Maybe v) }
18+ deriving (Show, Read, Eq, Ord)
19+
20+-- | Apply the insertions or deletions to a given 'Map'.
21+instance Ord k => Patch (PatchMap k v) where
22+ type PatchTarget (PatchMap k v) = Map k v
23+ {-# INLINABLE apply #-}
24+ 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?
25+ where insertions = Map.mapMaybeWithKey (const id) p
26+ deletions = Map.mapMaybeWithKey (const nothingToJust) p
27+ nothingToJust = \case
28+ Nothing -> Just ()
29+ Just _ -> Nothing
30+
31+-- | @a <> b@ will apply the changes of @b@ and then apply the changes of @a@.
32+-- If the same key is modified by both patches, the one on the left will take
33+-- precedence.
34+instance Ord k => Semigroup (PatchMap k v) where
35+ PatchMap a <> PatchMap b = PatchMap $ a `mappend` b --TODO: Add a semigroup instance for Map
36+ -- PatchMap is idempotent, so stimes n is id for every n
37+ stimes = stimesIdempotentMonoid
38+
39+-- | The empty 'PatchMap' contains no insertions or deletions
40+instance Ord k => Monoid (PatchMap k v) where
41+ mempty = PatchMap mempty
42+ mappend = (<>)
43+
44+-- | 'fmap'ping a 'PatchMap' will alter all of the values it will insert.
45+-- Deletions are unaffected.
46+instance Functor (PatchMap k) where
47+ fmap f = PatchMap . fmap (fmap f) . unPatchMap
48+
49+-- | Returns all the new elements that will be added to the 'Map'
50+patchMapNewElements :: PatchMap k v -> [v]
51+patchMapNewElements (PatchMap p) = catMaybes $ Map.elems p
52+
53+-- | Returns all the new elements that will be added to the 'Map'
54+patchMapNewElementsMap :: PatchMap k v -> Map k v
55+patchMapNewElementsMap (PatchMap p) = Map.mapMaybe id p
src/Reflex/Patch/MapWithMove.hsnew file+270
@@ -0,0 +1,270 @@
1+{-# LANGUAGE DeriveFoldable #-}
2+{-# LANGUAGE DeriveFunctor #-}
3+{-# LANGUAGE DeriveTraversable #-}
4+{-# LANGUAGE FlexibleContexts #-}
5+{-# LANGUAGE LambdaCase #-}
6+{-# LANGUAGE PatternGuards #-}
7+{-# LANGUAGE ScopedTypeVariables #-}
8+{-# LANGUAGE TypeFamilies #-}
9+-- | 'Patch'es on 'Map' that can insert, delete, and move values from one key to
10+-- another
11+module Reflex.Patch.MapWithMove where
12+
13+import Reflex.Patch.Class
14+
15+import Control.Arrow
16+import Control.Monad.State
17+import Data.Foldable
18+import Data.Function
19+import Data.List
20+import Data.Map (Map)
21+import qualified Data.Map as Map
22+import Data.Maybe
23+import Data.Semigroup (Semigroup (..), (<>))
24+import qualified Data.Set as Set
25+import Data.These (These(..))
26+import Data.Tuple
27+
28+-- | Patch a DMap with additions, deletions, and moves. Invariant: If key @k1@
29+-- is coming from @From_Move k2@, then key @k2@ should be going to @Just k1@,
30+-- and vice versa. There should never be any unpaired From/To keys.
31+newtype PatchMapWithMove k v = PatchMapWithMove (Map k (NodeInfo k v)) deriving (Show, Eq, Ord, Functor, Foldable, Traversable)
32+
33+-- | Holds the information about each key: where its new value should come from,
34+-- and where its old value should go to
35+data NodeInfo k v = NodeInfo
36+ { _nodeInfo_from :: !(From k v)
37+ -- ^ Where do we get the new value for this key?
38+ , _nodeInfo_to :: !(To k)
39+ -- ^ If the old value is being kept (i.e. moved rather than deleted or
40+ -- replaced), where is it going?
41+ }
42+ deriving (Show, Read, Eq, Ord, Functor, Foldable, Traversable)
43+
44+-- | Describe how a key's new value should be produced
45+data From k v
46+ = From_Insert v -- ^ Insert the given value here
47+ | From_Delete -- ^ Delete the existing value, if any, from here
48+ | From_Move !k -- ^ Move the value here from the given key
49+ deriving (Show, Read, Eq, Ord, Functor, Foldable, Traversable)
50+
51+-- | Describe where a key's old value will go. If this is 'Just', that means
52+-- the key's old value will be moved to the given other key; if it is 'Nothing',
53+-- that means it will be deleted.
54+type To = Maybe
55+
56+-- | Create a 'PatchMapWithMove', validating it
57+patchMapWithMove :: Ord k => Map k (NodeInfo k v) -> Maybe (PatchMapWithMove k v)
58+patchMapWithMove m = if valid then Just $ PatchMapWithMove m else Nothing
59+ where valid = forwardLinks == backwardLinks
60+ forwardLinks = Map.mapMaybe _nodeInfo_to m
61+ backwardLinks = Map.fromList $ catMaybes $ flip fmap (Map.toList m) $ \(to, v) ->
62+ case _nodeInfo_from v of
63+ From_Move from -> Just (from, to)
64+ _ -> Nothing
65+
66+-- | Create a 'PatchMapWithMove' that inserts everything in the given 'Map'
67+patchMapWithMoveInsertAll :: Map k v -> PatchMapWithMove k v
68+patchMapWithMoveInsertAll m = PatchMapWithMove $ flip fmap m $ \v -> NodeInfo
69+ { _nodeInfo_from = From_Insert v
70+ , _nodeInfo_to = Nothing
71+ }
72+
73+-- | Extract the internal representation of the 'PatchMapWithMove'
74+unPatchMapWithMove :: PatchMapWithMove k v -> Map k (NodeInfo k v)
75+unPatchMapWithMove (PatchMapWithMove p) = p
76+
77+-- | Make a @'PatchMapWithMove' k v@ which has the effect of inserting or updating a value @v@ to the given key @k@, like 'Map.insert'.
78+insertMapKey :: k -> v -> PatchMapWithMove k v
79+insertMapKey k v = PatchMapWithMove . Map.singleton k $ NodeInfo (From_Insert v) Nothing
80+
81+-- |Make a @'PatchMapWithMove' k v@ which has the effect of moving the value from the first key @k@ to the second key @k@, equivalent to:
82+--
83+-- @
84+-- 'Map.delete' src (maybe map ('Map.insert' dst) (Map.lookup src map))
85+-- @
86+moveMapKey :: Ord k => k -> k -> PatchMapWithMove k v
87+moveMapKey src dst
88+ | src == dst = mempty
89+ | otherwise =
90+ PatchMapWithMove $ Map.fromList
91+ [ (dst, NodeInfo (From_Move src) Nothing)
92+ , (src, NodeInfo From_Delete (Just dst))
93+ ]
94+
95+-- |Make a @'PatchMapWithMove' k v@ which has the effect of swapping two keys in the mapping, equivalent to:
96+--
97+-- @
98+-- let aMay = Map.lookup a map
99+-- bMay = Map.lookup b map
100+-- in maybe id (Map.insert a) (bMay `mplus` aMay)
101+-- . maybe id (Map.insert b) (aMay `mplus` bMay)
102+-- . Map.delete a . Map.delete b $ map
103+-- @
104+swapMapKey :: Ord k => k -> k -> PatchMapWithMove k v
105+swapMapKey src dst
106+ | src == dst = mempty
107+ | otherwise =
108+ PatchMapWithMove $ Map.fromList
109+ [ (dst, NodeInfo (From_Move src) (Just src))
110+ , (src, NodeInfo (From_Move dst) (Just dst))
111+ ]
112+
113+-- |Make a @'PatchMapWithMove' k v@ which has the effect of deleting a key in the mapping, equivalent to 'Map.delete'.
114+deleteMapKey :: k -> PatchMapWithMove k v
115+deleteMapKey k = PatchMapWithMove . Map.singleton k $ NodeInfo From_Delete Nothing
116+
117+-- | Wrap a @'Map' k (NodeInfo k v)@ representing patch changes into a @'PatchMapWithMove' k v@, without checking any invariants.
118+--
119+-- __Warning:__ when using this function, you must ensure that the invariants of 'PatchMapWithMove' are preserved; they will not be checked.
120+unsafePatchMapWithMove :: Map k (NodeInfo k v) -> PatchMapWithMove k v
121+unsafePatchMapWithMove = PatchMapWithMove
122+
123+-- | Apply the insertions, deletions, and moves to a given 'Map'
124+instance Ord k => Patch (PatchMapWithMove k v) where
125+ type PatchTarget (PatchMapWithMove k v) = Map k v
126+ 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?
127+ where insertions = flip Map.mapMaybeWithKey p $ \_ ni -> case _nodeInfo_from ni of
128+ From_Insert v -> Just v
129+ From_Move k -> Map.lookup k old
130+ From_Delete -> Nothing
131+ deletions = flip Map.mapMaybeWithKey p $ \_ ni -> case _nodeInfo_from ni of
132+ From_Delete -> Just ()
133+ _ -> Nothing
134+
135+-- | Returns all the new elements that will be added to the 'Map'.
136+patchMapWithMoveNewElements :: PatchMapWithMove k v -> [v]
137+patchMapWithMoveNewElements = Map.elems . patchMapWithMoveNewElementsMap
138+
139+-- | Return a @'Map' k v@ with all the inserts/updates from the given @'PatchMapWithMove' k v@.
140+patchMapWithMoveNewElementsMap :: PatchMapWithMove k v -> Map k v
141+patchMapWithMoveNewElementsMap (PatchMapWithMove p) = Map.mapMaybe f p
142+ where f ni = case _nodeInfo_from ni of
143+ From_Insert v -> Just v
144+ From_Move _ -> Nothing
145+ From_Delete -> Nothing
146+
147+-- | Create a 'PatchMapWithMove' that, if applied to the given 'Map', will sort
148+-- its values using the given ordering function. The set keys of the 'Map' is
149+-- not changed.
150+patchThatSortsMapWith :: Ord k => (v -> v -> Ordering) -> Map k v -> PatchMapWithMove k v
151+patchThatSortsMapWith cmp m = PatchMapWithMove $ Map.fromList $ catMaybes $ zipWith g unsorted sorted
152+ where unsorted = Map.toList m
153+ sorted = sortBy (cmp `on` snd) unsorted
154+ f (to, _) (from, _) = if to == from then Nothing else
155+ Just (from, to)
156+ reverseMapping = Map.fromList $ catMaybes $ zipWith f unsorted sorted
157+ g (to, _) (from, _) = if to == from then Nothing else
158+ let Just movingTo = Map.lookup from reverseMapping
159+ in Just (to, NodeInfo (From_Move from) $ Just movingTo)
160+
161+-- | Create a 'PatchMapWithMove' that, if applied to the first 'Map' provided,
162+-- will produce a 'Map' with the same values as the second 'Map' but with the
163+-- values sorted with the given ordering function.
164+patchThatChangesAndSortsMapWith :: forall k v. (Ord k, Ord v) => (v -> v -> Ordering) -> Map k v -> Map k v -> PatchMapWithMove k v
165+patchThatChangesAndSortsMapWith cmp oldByIndex newByIndexUnsorted = patchThatChangesMap oldByIndex newByIndex
166+ where newList = Map.toList newByIndexUnsorted
167+ newByIndex = Map.fromList $ zip (fst <$> newList) $ sortBy cmp $ snd <$> newList
168+
169+-- | Create a 'PatchMapWithMove' that, if applied to the first 'Map' provided,
170+-- will produce the second 'Map'.
171+patchThatChangesMap :: (Ord k, Ord v) => Map k v -> Map k v -> PatchMapWithMove k v
172+patchThatChangesMap oldByIndex newByIndex = patch
173+ where oldByValue = Map.fromListWith Set.union $ swap . first Set.singleton <$> Map.toList oldByIndex
174+ (insertsAndMoves, unusedValuesByValue) = flip runState oldByValue $ do
175+ let f k v = do
176+ remainingValues <- get
177+ let putRemainingKeys remainingKeys = put $ if Set.null remainingKeys
178+ then Map.delete v remainingValues
179+ else Map.insert v remainingKeys remainingValues
180+ case Map.lookup v remainingValues of
181+ Nothing -> return $ NodeInfo (From_Insert v) $ Just undefined -- There's no existing value we can take
182+ Just fromKs ->
183+ if k `Set.member` fromKs
184+ then do
185+ putRemainingKeys $ Set.delete k fromKs
186+ return $ NodeInfo (From_Move k) $ Just undefined -- There's an existing value, and it's here, so no patch necessary
187+ else do
188+ (fromK, remainingKeys) <- return . fromJust $ Set.minView fromKs -- There's an existing value, but it's not here; move it here
189+ putRemainingKeys remainingKeys
190+ return $ NodeInfo (From_Move fromK) $ Just undefined
191+ Map.traverseWithKey f newByIndex
192+ unusedOldKeys = fold unusedValuesByValue
193+ pointlessMove k = \case
194+ From_Move k' | k == k' -> True
195+ _ -> False
196+ keyWasMoved k = if k `Map.member` oldByIndex && not (k `Set.member` unusedOldKeys)
197+ then Just undefined
198+ else Nothing
199+ 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
200+
201+-- | Change the 'From' value of a 'NodeInfo'
202+nodeInfoMapFrom :: (From k v -> From k v) -> NodeInfo k v -> NodeInfo k v
203+nodeInfoMapFrom f ni = ni { _nodeInfo_from = f $ _nodeInfo_from ni }
204+
205+-- | Change the 'From' value of a 'NodeInfo', using a 'Functor' (or
206+-- 'Applicative', 'Monad', etc.) action to get the new value
207+nodeInfoMapMFrom :: Functor f => (From k v -> f (From k v)) -> NodeInfo k v -> f (NodeInfo k v)
208+nodeInfoMapMFrom f ni = fmap (\result -> ni { _nodeInfo_from = result }) $ f $ _nodeInfo_from ni
209+
210+-- | Set the 'To' field of a 'NodeInfo'
211+nodeInfoSetTo :: To k -> NodeInfo k v -> NodeInfo k v
212+nodeInfoSetTo to ni = ni { _nodeInfo_to = to }
213+
214+-- |Helper data structure used for composing patches using the monoid instance.
215+data Fixup k v
216+ = Fixup_Delete
217+ | Fixup_Update (These (From k v) (To k))
218+
219+-- |Compose patches having the same effect as applying the patches in turn: @'applyAlways' (p <> q) == 'applyAlways' p . 'applyAlways' q@
220+instance Ord k => Semigroup (PatchMapWithMove k v) where
221+ PatchMapWithMove ma <> PatchMapWithMove mb = PatchMapWithMove m
222+ where
223+ connections = Map.toList $ Map.intersectionWithKey (\_ a b -> (_nodeInfo_to a, _nodeInfo_from b)) ma mb
224+ h :: (k, (Maybe k, From k v)) -> [(k, Fixup k v)]
225+ h (_, (mToAfter, editBefore)) = case (mToAfter, editBefore) of
226+ (Just toAfter, From_Move fromBefore)
227+ | fromBefore == toAfter
228+ -> [(toAfter, Fixup_Delete)]
229+ | otherwise
230+ -> [ (toAfter, Fixup_Update (This editBefore))
231+ , (fromBefore, Fixup_Update (That mToAfter))
232+ ]
233+ (Nothing, From_Move fromBefore) -> [(fromBefore, Fixup_Update (That mToAfter))] -- The item is destroyed in the second patch, so indicate that it is destroyed in the source map
234+ (Just toAfter, _) -> [(toAfter, Fixup_Update (This editBefore))]
235+ (Nothing, _) -> []
236+ mergeFixups _ Fixup_Delete Fixup_Delete = Fixup_Delete
237+ mergeFixups _ (Fixup_Update a) (Fixup_Update b)
238+ | This x <- a, That y <- b
239+ = Fixup_Update $ These x y
240+ | That y <- a, This x <- b
241+ = Fixup_Update $ These x y
242+ mergeFixups _ _ _ = error "PatchMapWithMove: incompatible fixups"
243+ fixups = Map.fromListWithKey mergeFixups $ concatMap h connections
244+ combineNodeInfos _ nia nib = NodeInfo
245+ { _nodeInfo_from = _nodeInfo_from nia
246+ , _nodeInfo_to = _nodeInfo_to nib
247+ }
248+ applyFixup _ ni = \case
249+ Fixup_Delete -> Nothing
250+ Fixup_Update u -> Just $ NodeInfo
251+ { _nodeInfo_from = fromMaybe (_nodeInfo_from ni) $ getHere u
252+ , _nodeInfo_to = fromMaybe (_nodeInfo_to ni) $ getThere u
253+ }
254+ m = Map.differenceWithKey applyFixup (Map.unionWithKey combineNodeInfos ma mb) fixups
255+ getHere :: These a b -> Maybe a
256+ getHere = \case
257+ This a -> Just a
258+ These a _ -> Just a
259+ That _ -> Nothing
260+ getThere :: These a b -> Maybe b
261+ getThere = \case
262+ This _ -> Nothing
263+ These _ b -> Just b
264+ That b -> Just b
265+
266+--TODO: Figure out how to implement this in terms of PatchDMapWithMove rather than duplicating it here
267+-- |Compose patches having the same effect as applying the patches in turn: @'applyAlways' (p <> q) == 'applyAlways' p . 'applyAlways' q@
268+instance Ord k => Monoid (PatchMapWithMove k v) where
269+ mempty = PatchMapWithMove mempty
270+ mappend = (<>)
src/Reflex/PerformEvent/Base.hs+89−15
@@ -28,8 +28,10 @@ import Reflex.Class
2828import Reflex.Adjustable.Class
2929import Reflex.Host.Class
3030import Reflex.PerformEvent.Class
31−import Reflex.Requester.Base
31+import Reflex.Requester.Base.Internal
3232import Reflex.Requester.Class
33+import Reflex.EventWriter.Class
34+import Reflex.EventWriter.Base
3335
3436import Control.Lens
3537import Control.Monad.Exception
@@ -37,13 +39,25 @@ import Control.Monad.Identity
3739import Control.Monad.Primitive
3840import Control.Monad.Reader
3941import Control.Monad.Ref
40−import Data.Coerce
4142import Data.Dependent.Map (DMap)
4243import qualified Data.Dependent.Map as DMap
4344import Data.Dependent.Sum
45+import Data.Foldable
46+import Data.Functor.Compose
47+import Data.Functor.Misc
4448import Data.IntMap.Strict (IntMap)
4549import qualified Data.IntMap.Strict as IntMap
50+import Data.List.NonEmpty (NonEmpty (..))
51+import Data.List.NonEmpty.Deferred (NonEmptyDeferred)
52+import qualified Data.List.NonEmpty.Deferred as NonEmptyDeferred
53+import Data.Map (Map)
54+import qualified Data.Map as Map
55+import Data.Semigroup (Semigroup (sconcat))
4656import qualified Data.Semigroup as S
57+import Data.Unique.Tag.Local
58+import Data.Sequence (Seq)
59+import Data.Tuple
60+import qualified Data.TagMap as TagMap
4761
4862-- | A function that fires events for the given 'EventTrigger's and then runs
4963-- any followup actions provided via 'PerformEvent'. The given 'ReadPhase'
@@ -68,7 +82,7 @@ instance (PrimMonad (HostFrame t), ReflexHost t) => PrimMonad (PerformEventT t m
6882 type PrimState (PerformEventT t m) = PrimState (HostFrame t)
6983 primitive = PerformEventT . lift . primitive
7084
71−instance (ReflexHost t, Ref m ~ Ref IO) => PerformEvent t (PerformEventT t m) where
85+instance (ReflexHost t, Ref m ~ Ref IO, PrimMonad (HostFrame t)) => PerformEvent t (PerformEventT t m) where
7286 type Performable (PerformEventT t m) = HostFrame t
7387 {-# INLINABLE performEvent_ #-}
7488 performEvent_ = PerformEventT . requesting_
@@ -76,15 +90,74 @@ instance (ReflexHost t, Ref m ~ Ref IO) => PerformEvent t (PerformEventT t m) wh
7690 performEvent = PerformEventT . requestingIdentity
7791
7892instance (ReflexHost t, PrimMonad (HostFrame t)) => Adjustable t (PerformEventT t m) where
79− runWithReplace outerA0 outerA' = PerformEventT $ runWithReplaceRequesterTWith f (coerce outerA0) (coerceEvent outerA')
80− where f :: HostFrame t a -> Event t (HostFrame t b) -> RequesterT t (HostFrame t) Identity (HostFrame t) (a, Event t b)
81− f a0 a' = do
82− result0 <- lift a0
83− result' <- requestingIdentity a'
84− return (result0, result')
85− traverseIntMapWithKeyWithAdjust f outerDm0 outerDm' = PerformEventT $ traverseIntMapWithKeyWithAdjustRequesterTWith (defaultAdjustIntBase traverseIntMapPatchWithKey) patchIntMapNewElementsMap mergeIntIncremental (\k v -> unPerformEventT $ f k v) (coerce outerDm0) (coerceEvent outerDm')
86− traverseDMapWithKeyWithAdjust f outerDm0 outerDm' = PerformEventT $ traverseDMapWithKeyWithAdjustRequesterTWith (defaultAdjustBase traversePatchDMapWithKey) mapPatchDMap weakenPatchDMapWith patchMapNewElementsMap mergeMapIncremental (\k v -> unPerformEventT $ f k v) (coerce outerDm0) (coerceEvent outerDm')
87− traverseDMapWithKeyWithAdjustWithMove f outerDm0 outerDm' = PerformEventT $ traverseDMapWithKeyWithAdjustRequesterTWith (defaultAdjustBase traversePatchDMapWithMoveWithKey) mapPatchDMapWithMove weakenPatchDMapWithMoveWith patchMapWithMoveNewElementsMap mergeMapIncrementalWithMove (\k v -> unPerformEventT $ f k v) (coerce outerDm0) (coerceEvent outerDm')
93+ {-# INLINE runWithReplace #-}
94+ runWithReplace a0 a' = PerformEventT $ RequesterT $ do
95+ env@(_, _ :: TagGen (PrimState (HostFrame t)) FakeRequesterStatePhantom) <- RequesterInternalT ask
96+ let runA :: forall a. PerformEventT t m a -> HostFrame t (a, Event t (NonEmptyDeferred (RequestEnvelope FakeRequesterStatePhantom (HostFrame t))))
97+ runA (PerformEventT (RequesterT a)) = runEventWriterT $ runReaderT (unRequesterInternalT a) env
98+ (result0, requests0) <- lift $ runA a0
99+ newA <- requestingIdentity $ runA <$> a'
100+ requests <- switchHoldPromptOnly requests0 $ fmapCheap snd newA
101+ --TODO: promptly *prevent* events, then sign up the new ones; this is a serious breaking change to PerformEvent
102+ RequesterInternalT $ tellEvent requests
103+ pure (result0, fmapCheap fst newA)
104+ {-# INLINE traverseIntMapWithKeyWithAdjust #-}
105+ traverseIntMapWithKeyWithAdjust f a0 a' = PerformEventT $ RequesterT $ do
106+ env@(_, _ :: TagGen (PrimState (HostFrame t)) FakeRequesterStatePhantom) <- RequesterInternalT ask
107+ let runA :: forall a. PerformEventT t m a -> HostFrame t (a, Event t (NonEmptyDeferred (RequestEnvelope FakeRequesterStatePhantom (HostFrame t))))
108+ runA (PerformEventT (RequesterT a)) = runEventWriterT $ runReaderT (unRequesterInternalT a) env
109+ children' <- requestingIdentity $ itraverse (\k -> runA . f k) <$> a'
110+ children0 <- lift $ itraverse (\k -> runA . f k) a0
111+ let results0 = fmap fst children0
112+ requests0 = fmap snd children0
113+ results' = fmap fst <$> children'
114+ requests' = fmap snd `fmapCheap` children'
115+ requests <- switchHoldPromptOnlyIncremental mergeIntIncremental coincidencePatchIntMap requests0 requests'
116+ --TODO: promptly *prevent* events, then sign up the new ones; this is a serious breaking change to PerformEvent
117+ RequesterInternalT $ tellEvent $ fforMaybeCheap requests concatIntMapMaybe
118+ pure (results0, results')
119+ {-# INLINE traverseDMapWithKeyWithAdjust #-}
120+ traverseDMapWithKeyWithAdjust (f :: forall a. k a -> v a -> PerformEventT t m (v' a)) (a0 :: DMap k v) a' = PerformEventT $ RequesterT $ do
121+ env@(_, _ :: TagGen (PrimState (HostFrame t)) FakeRequesterStatePhantom) <- RequesterInternalT ask
122+ let runA :: forall a. k a -> v a -> HostFrame t (Compose ((,) (Event t (NonEmptyDeferred (RequestEnvelope FakeRequesterStatePhantom (HostFrame t))))) v' a)
123+ runA k v = fmap (Compose . swap) $ runEventWriterT $ runReaderT (unRequesterInternalT a) env
124+ where (PerformEventT (RequesterT a)) = f k v
125+ children' <- requestingIdentity $ traversePatchDMapWithKey runA <$> a'
126+ children0 <- lift $ DMap.traverseWithKey runA a0
127+ let results0 = DMap.map (snd . getCompose) children0
128+ requests0 = weakenDMapWith (fst . getCompose) children0
129+ results' = mapPatchDMap (snd . getCompose) <$> children'
130+ requests' = weakenPatchDMapWith (fst . getCompose) `fmapCheap` children'
131+ requests <- switchHoldPromptOnlyIncremental mergeMapIncremental coincidencePatchMap requests0 requests'
132+ --TODO: promptly *prevent* events, then sign up the new ones; this is a serious breaking change to PerformEvent
133+ RequesterInternalT $ tellEvent $ fforMaybeCheap requests concatMapMaybe
134+ pure (results0, results')
135+ {-# INLINE traverseDMapWithKeyWithAdjustWithMove #-}
136+ traverseDMapWithKeyWithAdjustWithMove (f :: forall a. k a -> v a -> PerformEventT t m (v' a)) (a0 :: DMap k v) a' = PerformEventT $ RequesterT $ do
137+ env@(_, _ :: TagGen (PrimState (HostFrame t)) FakeRequesterStatePhantom) <- RequesterInternalT ask
138+ let runA :: forall a. k a -> v a -> HostFrame t (Compose ((,) (Event t (NonEmptyDeferred (RequestEnvelope FakeRequesterStatePhantom (HostFrame t))))) v' a)
139+ runA k v = fmap (Compose . swap) $ runEventWriterT $ runReaderT (unRequesterInternalT a) env
140+ where (PerformEventT (RequesterT a)) = f k v
141+ children' <- requestingIdentity $ traversePatchDMapWithMoveWithKey runA <$> a'
142+ children0 <- lift $ DMap.traverseWithKey runA a0
143+ let results0 = DMap.map (snd . getCompose) children0
144+ requests0 = weakenDMapWith (fst . getCompose) children0
145+ results' = mapPatchDMapWithMove (snd . getCompose) <$> children'
146+ requests' = weakenPatchDMapWithMoveWith (fst . getCompose) `fmapCheap` children'
147+ requests <- switchHoldPromptOnlyIncremental mergeMapIncrementalWithMove coincidencePatchMapWithMove requests0 requests'
148+ --TODO: promptly *prevent* events, then sign up the new ones; this is a serious breaking change to PerformEvent
149+ RequesterInternalT $ tellEvent $ fforMaybeCheap requests concatMapMaybe
150+ pure (results0, results')
151+
152+concatIntMapMaybe :: Semigroup a => IntMap a -> Maybe a
153+concatIntMapMaybe m = case IntMap.elems m of
154+ [] -> Nothing
155+ h : t -> Just $ sconcat $ h :| t
156+
157+concatMapMaybe :: Semigroup a => Map k a -> Maybe a
158+concatMapMaybe m = case Map.elems m of
159+ [] -> Nothing
160+ h : t -> Just $ sconcat $ h :| t
88161
89162defaultAdjustBase :: forall t v v2 k' p. (Monad (HostFrame t), PrimMonad (HostFrame t), Reflex t)
90163 => ((forall a. k' a -> v a -> HostFrame t (v2 a)) -> p k' v -> HostFrame t (p k' v2))
@@ -124,6 +197,7 @@ hostPerformEventT :: forall t m a.
124197 , MonadReflexHost t m
125198 , MonadRef m
126199 , Ref m ~ Ref IO
200+ , PrimMonad (HostFrame t)
127201 )
128202 => PerformEventT t m a
129203 -> m (a, FireCommand t m)
@@ -141,7 +215,9 @@ hostPerformEventT a = do
141215 case mToPerform of
142216 Nothing -> return [result']
143217 Just toPerform -> do
144− responses <- runHostFrame $ traverseRequesterData (fmap Identity) toPerform
218+ responses <- runHostFrame $ traverseRequesterData (Identity <$>) toPerform
219+ let responseLength = case responses of
220+ ResponseData _ m -> TagMap.size m
145221 mrt <- readRef responseTrigger
146222 let followupEventTriggers = case mrt of
147223 Just rt -> [rt :=> Identity responses]
@@ -164,8 +240,6 @@ instance (ReflexHost t, MonadHold t m) => MonadHold t (PerformEventT t m) where
164240 buildDynamic getV0 v' = PerformEventT $ lift $ buildDynamic getV0 v'
165241 {-# INLINABLE headE #-}
166242 headE = PerformEventT . lift . headE
167− {-# INLINABLE now #-}
168− now = PerformEventT . lift $ now
169243
170244instance (MonadRef (HostFrame t), ReflexHost t) => MonadRef (PerformEventT t m) where
171245 type Ref (PerformEventT t m) = Ref (HostFrame t)
src/Reflex/PerformEvent/Class.hs+1−6
@@ -8,6 +8,7 @@
88{-# LANGUAGE RankNTypes #-}
99{-# LANGUAGE ScopedTypeVariables #-}
1010{-# LANGUAGE TypeFamilies #-}
11+{-# LANGUAGE TypeOperators #-}
1112{-# LANGUAGE UndecidableInstances #-}
1213#ifdef USE_REFLEX_OPTIMIZER
1314{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
@@ -21,7 +22,6 @@ import Reflex.Class
2122import Reflex.TriggerEvent.Class
2223
2324import Control.Monad.Reader
24−import Control.Monad.Trans.Maybe (MaybeT (..))
2525
2626-- | 'PerformEvent' represents actions that can trigger other actions based on
2727-- 'Event's.
@@ -61,8 +61,3 @@ instance PerformEvent t m => PerformEvent t (ReaderT r m) where
6161 performEvent e = do
6262 r <- ask
6363 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+1−2
@@ -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 #-}
@@ -83,8 +84,6 @@ instance MonadHold t m => MonadHold t (PostBuildT t m) where
8384 buildDynamic a0 = lift . buildDynamic a0
8485 {-# INLINABLE headE #-}
8586 headE = lift . headE
86− {-# INLINABLE now #-}
87− now = lift now
8887
8988instance PerformEvent t m => PerformEvent t (PostBuildT t m) where
9089 type Performable (PostBuildT t m) = Performable m
src/Reflex/PostBuild/Class.hs+1
@@ -6,6 +6,7 @@
66{-# LANGUAGE FunctionalDependencies #-}
77{-# LANGUAGE ScopedTypeVariables #-}
88{-# LANGUAGE TypeFamilies #-}
9+{-# LANGUAGE TypeOperators #-}
910{-# LANGUAGE UndecidableInstances #-}
1011#ifdef USE_REFLEX_OPTIMIZER
1112{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
src/Reflex/Profiled.hs+5−59
@@ -26,10 +26,8 @@ import Control.Monad.Primitive
2626import Control.Monad.Reader
2727import Control.Monad.Ref
2828import Control.Monad.State.Strict (StateT, execStateT, modify)
29−import Data.Bifunctor
3029import Data.Coerce
31−import Data.Dependent.Map (DMap)
32−import Data.GADT.Compare (GCompare)
30+import Data.Dependent.Map (DMap, GCompare)
3331import Data.FastMutableIntMap
3432import Data.IORef
3533import Data.List
@@ -44,20 +42,12 @@ import Foreign.Ptr
4442import GHC.Foreign
4543import GHC.IO.Encoding
4644import GHC.Stack
47−import Reflex.Adjustable.Class
48−import Reflex.BehaviorWriter.Class
4945import Reflex.Class
50−import Reflex.DynamicWriter.Class
51−import Reflex.EventWriter.Class
5246import Reflex.Host.Class
53−import Reflex.NotReady.Class
5447import Reflex.PerformEvent.Class
55−import Reflex.PostBuild.Class
56−import Reflex.Query.Class
57−import Reflex.Requester.Class
58−import Reflex.TriggerEvent.Class
5948
6049import System.IO.Unsafe
50+import Unsafe.Coerce
6151
6252data ProfiledTimeline t
6353
@@ -147,7 +137,7 @@ instance Reflex t => Reflex (ProfiledTimeline t) where
147137 pushCheap f (Event_Profiled e) = coerce $ pushCheap (coerce f) $ profileEvent e
148138 pull = Behavior_Profiled . pull . coerce
149139 fanG (Event_Profiled e) = EventSelectorG $ coerce $ selectG (fanG $ profileEvent e)
150− mergeG :: forall z (k :: z -> *) q v. GCompare k
140+ mergeG :: forall (k :: z -> *) q v. GCompare k
151141 => (forall a. q a -> Event (ProfiledTimeline t) (v a))
152142 -> DMap k q -> Event (ProfiledTimeline t) (DMap k v)
153143 mergeG nt = Event_Profiled #. mergeG (coerce nt)
@@ -157,8 +147,8 @@ instance Reflex t => Reflex (ProfiledTimeline t) where
157147 updated (Dynamic_Profiled d) = coerce $ profileEvent $ updated d
158148 unsafeBuildDynamic (ProfiledM a0) (Event_Profiled a') = coerce $ unsafeBuildDynamic a0 a'
159149 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)
150+ mergeIncrementalG nt = (Event_Profiled . coerce) #. mergeIncrementalG nt
151+ mergeIncrementalWithMoveG nt = (Event_Profiled . coerce) #. mergeIncrementalWithMoveG nt
162152 currentIncremental (Incremental_Profiled i) = coerce $ currentIncremental i
163153 updatedIncremental (Incremental_Profiled i) = coerce $ profileEvent $ updatedIncremental i
164154 incrementalToDynamic (Incremental_Profiled i) = coerce $ incrementalToDynamic i
@@ -184,21 +174,10 @@ instance MonadHold t m => MonadHold (ProfiledTimeline t) (ProfiledM m) where
184174 holdIncremental v0 (Event_Profiled v') = ProfiledM $ Incremental_Profiled <$> holdIncremental v0 v'
185175 buildDynamic (ProfiledM v0) (Event_Profiled v') = ProfiledM $ Dynamic_Profiled <$> buildDynamic v0 v'
186176 headE (Event_Profiled e) = ProfiledM $ Event_Profiled <$> headE e
187− now = ProfiledM $ Event_Profiled <$> now
188177
189178instance MonadSample t m => MonadSample (ProfiledTimeline t) (ProfiledM m) where
190179 sample (Behavior_Profiled b) = ProfiledM $ sample b
191180
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−
202181instance MonadTrans ProfiledM where
203182 lift = ProfiledM
204183
@@ -210,39 +189,6 @@ instance PerformEvent t m => PerformEvent (ProfiledTimeline t) (ProfiledM m) whe
210189 performEvent_ = lift . performEvent_ . coerce
211190 performEvent = lift . fmap coerce . performEvent . coerce
212191
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−
246192instance MonadRef m => MonadRef (ProfiledM m) where
247193 type Ref (ProfiledM m) = Ref m
248194 newRef = lift . newRef
src/Reflex/Pure.hs+1−6
@@ -32,8 +32,7 @@ module Reflex.Pure
3232 ) where
3333
3434import Control.Monad
35−import Data.Dependent.Map (DMap)
36−import Data.GADT.Compare (GCompare)
35+import Data.Dependent.Map (DMap, GCompare)
3736import qualified Data.Dependent.Map as DMap
3837import Data.IntMap (IntMap)
3938import qualified Data.IntMap as IntMap
@@ -211,7 +210,3 @@ instance (Enum t, HasTrie t, Ord t) => MonadHold (Pure t) ((->) t) where
211210 Just x -> fromMaybe lastValue $ apply x lastValue
212211
213212 headE = slowHeadE
214− now t = Event $ guard . (t ==)
215−
216−
217−
src/Reflex/Query/Base.hs+4−15
@@ -16,25 +16,21 @@ module Reflex.Query.Base
1616 , mapQueryResult
1717 , dynWithQueryT
1818 , withQueryT
19− , mapQueryT
2019 ) where
2120
2221import Control.Applicative (liftA2)
2322import Control.Monad.Exception
2423import Control.Monad.Fix
25−import Control.Monad.Morph
2624import Control.Monad.Primitive
2725import Control.Monad.Reader
2826import Control.Monad.Ref
2927import Control.Monad.State.Strict
3028import Data.Align
31−import Data.Dependent.Map (DMap)
29+import Data.Dependent.Map (DMap, DSum (..))
3230import qualified Data.Dependent.Map as DMap
33−import Data.Dependent.Sum (DSum(..))
3431import Data.Foldable
3532import Data.Functor.Compose
3633import Data.Functor.Misc
37−import Data.GADT.Compare (GCompare)
3834import Data.IntMap (IntMap)
3935import qualified Data.IntMap as IntMap
4036import Data.Map (Map)
@@ -50,7 +46,7 @@ import Reflex.DynamicWriter.Class
5046import Reflex.EventWriter.Base
5147import Reflex.EventWriter.Class
5248import Reflex.Host.Class
53−import qualified Data.Patch.MapWithMove as MapWithMove
49+import qualified Reflex.Patch.MapWithMove as MapWithMove
5450import Reflex.PerformEvent.Class
5551import Reflex.PostBuild.Class
5652import Reflex.Query.Class
@@ -138,7 +134,7 @@ instance (Reflex t, MonadFix m, Group q, Additive q, Query q, Eq q, MonadHold t
138134 tellQueryIncremental $ unsafeBuildIncremental (fold <$> mapM sampleBs liftedBs0) qpatch
139135 return (liftedResult0, liftedResult')
140136
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'))
137+ 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'))
142138 traverseDMapWithKeyWithAdjust f dm0 dm' = do
143139 let f' :: forall a. k a -> v a -> EventWriterT t q (ReaderT (Dynamic t (QueryResult q)) m) (Compose (QueryTLoweredResult t q) v' a)
144140 f' k v = fmap (Compose . QueryTLoweredResult) $ flip runStateT [] $ unQueryT $ f k v
@@ -183,7 +179,7 @@ instance (Reflex t, MonadFix m, Group q, Additive q, Query q, Eq q, MonadHold t
183179 tellQueryIncremental $ unsafeBuildIncremental (fold <$> mapM sampleBs liftedBs0) qpatch
184180 return (liftedResult0, liftedResult')
185181
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'))
182+ 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'))
187183 traverseDMapWithKeyWithAdjustWithMove f dm0 dm' = do
188184 let f' :: forall a. k a -> v a -> EventWriterT t q (ReaderT (Dynamic t (QueryResult q)) m) (Compose (QueryTLoweredResult t q) v' a)
189185 f' k v = fmap (Compose . QueryTLoweredResult) $ flip runStateT [] $ unQueryT $ f k v
@@ -240,9 +236,6 @@ instance (Reflex t, MonadFix m, Group q, Additive q, Query q, Eq q, MonadHold t
240236instance MonadTrans (QueryT t q) where
241237 lift = QueryT . lift . lift . lift
242238
243−instance MFunctor (QueryT t q) where
244− hoist = mapQueryT
245−
246239instance PrimMonad m => PrimMonad (QueryT t q m) where
247240 type PrimState (QueryT t q m) = PrimState m
248241 primitive = lift . primitive
@@ -294,10 +287,6 @@ withQueryT f a = do
294287 (fmapCheap (AdditivePatch . mapQuery f . unAdditivePatch) $ updatedIncremental q)
295288 return result
296289
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−
301290-- | dynWithQueryT's (Dynamic t QueryMorphism) argument needs to be a group homomorphism at all times in order to behave correctly
302291dynWithQueryT :: (MonadFix m, PostBuild t m, Group q, Additive q, Group q', Additive q', Query q')
303292 => Dynamic t (QueryMorphism q q')
src/Reflex/Query/Class.hs+4−44
@@ -1,4 +1,3 @@
1−{-# LANGUAGE CPP #-}
21{-# LANGUAGE DeriveDataTypeable #-}
32{-# LANGUAGE FlexibleContexts #-}
43{-# LANGUAGE FlexibleInstances #-}
@@ -22,7 +21,6 @@ module Reflex.Query.Class
2221 , MonadQuery (..)
2322 , tellQueryDyn
2423 , queryDyn
25− , subQuery
2624 , mapQuery
2725 , mapQueryResult
2826 ) where
@@ -37,9 +35,6 @@ import Data.Map.Monoidal (MonoidalMap)
3735import qualified Data.Map.Monoidal as MonoidalMap
3836import Data.Semigroup (Semigroup(..))
3937import Foreign.Storable
40−import Data.Void
41−import Data.Monoid hiding ((<>))
42−import Control.Applicative
4338
4439import Reflex.Class
4540
@@ -55,37 +50,6 @@ instance (Ord k, Query v) => Query (MonoidalMap k v) where
5550 type QueryResult (MonoidalMap k v) = MonoidalMap k (QueryResult v)
5651 crop q r = MonoidalMap.intersectionWith (flip crop) r q
5752
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−
8953-- | QueryMorphism's must be group homomorphisms when acting on the query type
9054-- and compatible with the query relationship when acting on the query result.
9155data QueryMorphism q q' = QueryMorphism
@@ -125,7 +89,7 @@ instance Group SelectedCount where
12589
12690instance Additive SelectedCount
12791
128−-- | The Semigroup\/Monoid\/Group instances for a Query containing 'SelectedCount's should use
92+-- | The Semigroup/Monoid/Group instances for a Query containing 'SelectedCount's should use
12993-- this function which returns Nothing if the result is 0. This allows the pruning of leaves
13094-- of the 'Query' that are no longer wanted.
13195combineSelectedCounts :: SelectedCount -> SelectedCount -> Maybe SelectedCount
@@ -133,12 +97,12 @@ combineSelectedCounts (SelectedCount i) (SelectedCount j) = if i == negate j the
13397
13498-- | A class that allows sending of 'Query's and retrieval of 'QueryResult's. See 'queryDyn' for a commonly
13599-- used interface.
136−class (Group q, Additive q, Query q, Monad m) => MonadQuery t q m | m -> q t where
100+class (Group q, Additive q, Query q) => MonadQuery t q m | m -> q t where
137101 tellQueryIncremental :: Incremental t (AdditivePatch q) -> m ()
138102 askQueryResult :: m (Dynamic t (QueryResult q))
139103 queryIncremental :: Incremental t (AdditivePatch q) -> m (Dynamic t (QueryResult q))
140104
141−instance MonadQuery t q m => MonadQuery t q (ReaderT r m) where
105+instance (Monad m, MonadQuery t q m) => MonadQuery t q (ReaderT r m) where
142106 tellQueryIncremental = lift . tellQueryIncremental
143107 askQueryResult = lift askQueryResult
144108 queryIncremental = lift . queryIncremental
@@ -148,11 +112,7 @@ tellQueryDyn :: (Reflex t, MonadQuery t q m) => Dynamic t q -> m ()
148112tellQueryDyn d = tellQueryIncremental $ unsafeBuildIncremental (sample (current d)) $ attachWith (\old new -> AdditivePatch $ new ~~ old) (current d) (updated d)
149113
150114-- | 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))
115+queryDyn :: (Reflex t, Monad m, MonadQuery t q m) => Dynamic t q -> m (Dynamic t (QueryResult q))
152116queryDyn q = do
153117 tellQueryDyn q
154118 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)
src/Reflex/Requester/Base.hs+14−599
@@ -1,607 +1,22 @@
11-- | This module provides 'RequesterT', the standard implementation of
22-- 'Requester'.
3−{-# LANGUAGE AllowAmbiguousTypes #-}
4−{-# LANGUAGE ApplicativeDo #-}
5−{-# LANGUAGE CPP #-}
6−{-# LANGUAGE EmptyDataDecls #-}
7−{-# LANGUAGE ExistentialQuantification #-}
8−{-# LANGUAGE FlexibleInstances #-}
9−{-# LANGUAGE GADTs #-}
10−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
11−{-# LANGUAGE MultiParamTypeClasses #-}
12−{-# LANGUAGE Rank2Types #-}
13−{-# LANGUAGE RecursiveDo #-}
14−{-# LANGUAGE ScopedTypeVariables #-}
15−{-# LANGUAGE StandaloneDeriving #-}
16−{-# LANGUAGE TypeFamilies #-}
17−{-# LANGUAGE TypeOperators #-}
18−{-# LANGUAGE UndecidableInstances #-}
19−#ifdef USE_REFLEX_OPTIMIZER
20−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
21−#endif
223module Reflex.Requester.Base
234 ( RequesterT (..)
5+ , RequestData (..)
6+ , ResponseData (..)
7+ , RequestEnvelope (..)
248 , runRequesterT
25− , withRequesterT
26− , runWithReplaceRequesterTWith
27− , traverseIntMapWithKeyWithAdjustRequesterTWith
28− , traverseDMapWithKeyWithAdjustRequesterTWith
29− , RequesterData
30− , RequesterDataKey
9+-- , withRequesterT
10+-- , RequesterData
11+-- , RequesterDataKey
3112 , traverseRequesterData
32− , forRequesterData
33− , requesterDataToList
34− , singletonRequesterData
35− , matchResponsesWithRequests
36− , matchResponseMapWithRequests
37− , multiEntry
38− , unMultiEntry
39− , requesting'
13+-- , forRequesterData
14+-- , requesterDataToList
15+-- , singletonRequesterData
16+-- , matchResponsesWithRequests
17+-- , multiEntry
18+-- , unMultiEntry
19+-- , requesting'
4020 ) where
4121
42−import Reflex.Class
43−import Reflex.Adjustable.Class
44−import Reflex.Dynamic
45−import Reflex.Host.Class
46−import Reflex.PerformEvent.Class
47−import Reflex.PostBuild.Class
48−import Reflex.Requester.Class
49−import Reflex.TriggerEvent.Class
50−
51−import Control.Applicative (liftA2)
52−import Control.Monad.Exception
53−import Control.Monad.Identity
54−import Control.Monad.Morph
55−import Control.Monad.Primitive
56−import Control.Monad.Reader
57−import Control.Monad.Ref
58−import Control.Monad.State.Strict
59−import Data.Bits
60−import Data.Coerce
61−import Data.Constraint
62−import Data.Dependent.Map (DMap)
63−import qualified Data.Dependent.Map as DMap
64−import Data.Dependent.Sum (DSum (..))
65−import Data.Functor.Compose
66−import Data.Functor.Misc
67−import Data.IntMap.Strict (IntMap)
68−import qualified Data.IntMap.Strict as IntMap
69−import Data.Map (Map)
70−import qualified Data.Map as Map
71−import Data.Monoid ((<>))
72−import Data.Proxy
73−import qualified Data.Semigroup as S
74−import Data.Some (Some(Some))
75−import Data.Type.Equality
76−import Data.Unique.Tag
77−
78−import GHC.Exts (Any)
79−import Unsafe.Coerce
80−
81−--TODO: Make this module type-safe
82−
83−newtype TagMap (f :: * -> *) = TagMap (IntMap Any)
84−
85−newtype RequesterData f = RequesterData (TagMap (Entry f))
86−
87−emptyRequesterData :: RequesterData f
88−emptyRequesterData = RequesterData $ TagMap IntMap.empty
89−
90−data RequesterDataKey a where
91− RequesterDataKey_Single :: {-# UNPACK #-} !(MyTag (Single a)) -> RequesterDataKey a
92− 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
94− RequesterDataKey_Multi3 :: {-# UNPACK #-} !(MyTag Multi3) -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> !(RequesterDataKey a) -> RequesterDataKey a
95−
96−singletonRequesterData :: RequesterDataKey a -> f a -> RequesterData f
97−singletonRequesterData rdk v = case rdk of
98− RequesterDataKey_Single k -> RequesterData $ singletonTagMap k $ Entry v
99− 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− }
104− RequesterDataKey_Multi3 k k' k'' k''' -> RequesterData $ singletonTagMap k $ Entry $ IntMap.singleton k' $ IntMap.singleton k'' $ singletonRequesterData k''' v
105−
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−
132−requesterDataToList :: RequesterData f -> [DSum RequesterDataKey f]
133−requesterDataToList (RequesterData m) = do
134− k :=> Entry e <- tagMapToList m
135− case myKeyType k of
136− MyTagType_Single -> return $ RequesterDataKey_Single k :=> e
137− MyTagType_Multi -> do
138− (k', e') <- IntMap.toList e
139− k'' :=> e'' <- requesterDataToList e'
140− 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'''
147− MyTagType_Multi3 -> do
148− (k', e') <- IntMap.toList e
149− (k'', e'') <- IntMap.toList e'
150− k''' :=> e''' <- requesterDataToList e''
151− return $ RequesterDataKey_Multi3 k k' k'' k''' :=> e'''
152−
153−singletonTagMap :: forall f a. MyTag a -> f a -> TagMap f
154−singletonTagMap (MyTag k) v = TagMap $ IntMap.singleton k $ (unsafeCoerce :: f a -> Any) v
155−
156−tagMapToList :: forall f. TagMap f -> [DSum MyTag f]
157−tagMapToList (TagMap m) = f <$> IntMap.toList m
158− where f :: (Int, Any) -> DSum MyTag f
159− f (k, v) = MyTag k :=> (unsafeCoerce :: Any -> f a) v
160−
161−traverseTagMapWithKey :: forall t f g. Applicative t => (forall a. MyTag a -> f a -> t (g a)) -> TagMap f -> t (TagMap g)
162−traverseTagMapWithKey f (TagMap m) = TagMap <$> IntMap.traverseWithKey g m
163− where
164− g :: Int -> Any -> t Any
165− g k v = (unsafeCoerce :: g a -> Any) <$> f (MyTag k) ((unsafeCoerce :: Any -> f a) v)
166−
167−-- | Runs in reverse to accommodate for the fact that we accumulate it in reverse
168−traverseRequesterData :: forall m request response. Applicative m => (forall a. request a -> m (response a)) -> RequesterData request -> m (RequesterData response)
169−traverseRequesterData f (RequesterData m) = RequesterData <$> traverseTagMapWithKey go m --TODO: reverse this, since our tags are in reverse order
170− where go :: forall x. MyTag x -> Entry request x -> m (Entry response x)
171− go k (Entry request) = Entry <$> case myKeyType k of
172− MyTagType_Single -> f request
173− 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− }
181− MyTagType_Multi3 -> traverse (traverse (traverseRequesterData f)) request
182−
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−
187−data MyTagType :: * -> * where
188− MyTagType_Single :: MyTagType (Single a)
189− MyTagType_Multi :: MyTagType Multi
190− MyTagType_Multi2 :: MyTagType (Multi2 k)
191− MyTagType_Multi3 :: MyTagType Multi3
192−
193−myKeyType :: MyTag x -> MyTagType x
194−myKeyType (MyTag k) = case k .&. 0x3 of
195− 0x0 -> unsafeCoerce MyTagType_Single
196− 0x1 -> unsafeCoerce MyTagType_Multi
197− 0x2 -> unsafeCoerce MyTagType_Multi2
198− 0x3 -> unsafeCoerce MyTagType_Multi3
199− t -> error $ "Reflex.Requester.Base.myKeyType: no such key type" <> show t
200−
201−data Single a
202−data Multi
203−data Multi2 (k :: * -> *)
204−data Multi3
205−
206−class MyTagTypeOffset x where
207− myTagTypeOffset :: proxy x -> Int
208−
209−instance MyTagTypeOffset (Single a) where
210− myTagTypeOffset _ = 0x0
211−
212−instance MyTagTypeOffset Multi where
213− myTagTypeOffset _ = 0x1
214−
215−instance MyTagTypeOffset (Multi2 k) where
216− myTagTypeOffset _ = 0x2
217−
218−instance MyTagTypeOffset Multi3 where
219− myTagTypeOffset _ = 0x3
220−
221−type family EntryContents request a where
222− EntryContents request (Single a) = request a
223− EntryContents request Multi = IntMap (RequesterData request)
224− EntryContents request (Multi2 k) = Multi2Contents k request
225− EntryContents request Multi3 = IntMap (IntMap (RequesterData request))
226−
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−
232−newtype Entry request x = Entry { unEntry :: EntryContents request x }
233−
234−{-# INLINE singleEntry #-}
235−singleEntry :: f a -> Entry f (Single a)
236−singleEntry = Entry
237−
238−{-# INLINE multiEntry #-}
239−multiEntry :: IntMap (RequesterData f) -> Entry f Multi
240−multiEntry = Entry
241−
242−{-# INLINE unMultiEntry #-}
243−unMultiEntry :: Entry f Multi -> IntMap (RequesterData f)
244−unMultiEntry = unEntry
245−
246−-- | We use a hack here to pretend we have x ~ request a; we don't want to use a GADT, because GADTs (even with zero-size existential contexts) can't be newtypes
247−-- WARNING: This type should never be exposed. In particular, this is extremely unsound if a MyTag from one run of runRequesterT is ever compared against a MyTag from another
248−newtype MyTag x = MyTag Int deriving (Show, Eq, Ord, Enum)
249−
250−newtype MyTagWrap (f :: * -> *) x = MyTagWrap Int deriving (Show, Eq, Ord, Enum)
251−
252−{-# INLINE castMyTagWrap #-}
253−castMyTagWrap :: MyTagWrap f (Entry f x) -> MyTagWrap g (Entry g x)
254−castMyTagWrap = coerce
255−
256−instance GEq MyTag where
257− (MyTag a) `geq` (MyTag b) =
258− if a == b
259− then Just $ unsafeCoerce Refl
260− else Nothing
261−
262−instance GCompare MyTag where
263− (MyTag a) `gcompare` (MyTag b) =
264− case a `compare` b of
265− LT -> GLT
266− EQ -> unsafeCoerce GEQ
267− GT -> GGT
268−
269−instance GEq (MyTagWrap f) where
270− (MyTagWrap a) `geq` (MyTagWrap b) =
271− if a == b
272− then Just $ unsafeCoerce Refl
273− else Nothing
274−
275−instance GCompare (MyTagWrap f) where
276− (MyTagWrap a) `gcompare` (MyTagWrap b) =
277− case a `compare` b of
278− LT -> GLT
279− EQ -> unsafeCoerce GEQ
280− GT -> GGT
281−
282−data RequesterState t (request :: * -> *) = RequesterState
283− { _requesterState_nextMyTag :: {-# UNPACK #-} !Int -- Starts at -4 and goes down by 4 each time, to accommodate two 'type' bits at the bottom
284− , _requesterState_requests :: ![(Int, Event t Any)]
285− }
286−
287−-- | A basic implementation of 'Requester'.
288−newtype RequesterT t request (response :: * -> *) m a = RequesterT { unRequesterT :: StateT (RequesterState t request) (ReaderT (EventSelectorInt t Any) m) a }
289− deriving (Functor, Applicative, Monad, MonadFix, MonadIO, MonadException
290−-- MonadAsyncException can't be derived on ghc-8.0.1; we use base-4.9.1 as a proxy for ghc-8.0.2
291−#if MIN_VERSION_base(4,9,1)
292− , MonadAsyncException
293−#endif
294− )
295−
296−deriving instance MonadSample t m => MonadSample t (RequesterT t request response m)
297−deriving instance MonadHold t m => MonadHold t (RequesterT t request response m)
298−deriving instance PostBuild t m => PostBuild t (RequesterT t request response m)
299−deriving instance TriggerEvent t m => TriggerEvent t (RequesterT t request response m)
300−
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−
314−-- | Run a 'RequesterT' action. The resulting 'Event' will fire whenever
315−-- requests are made, and responses should be provided in the input 'Event'.
316−-- The 'Tag' keys will be used to return the responses to the same place the
317−-- requests were issued.
318−runRequesterT :: (Reflex t, Monad m)
319− => RequesterT t request response m a
320− -> Event t (RequesterData response) --TODO: This DMap will be in reverse order, so we need to make sure the caller traverses it in reverse
321− -> m (a, Event t (RequesterData request)) --TODO: we need to hide these 'MyTag's here, because they're unsafe to mix in the wild
322−runRequesterT (RequesterT a) responses = do
323− (result, s) <- runReaderT (runStateT a $ RequesterState (-4) []) $ fanInt $
324− coerceEvent responses
325− return (result, fmapCheap (RequesterData . TagMap) $ mergeInt $ IntMap.fromDistinctAscList $ _requesterState_requests s)
326−
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−
341−instance (Reflex t, Monad m) => Requester t (RequesterT t request response m) where
342− type Request (RequesterT t request response m) = request
343− type Response (RequesterT t request response m) = response
344− requesting = fmap coerceEvent . responseFromTag . castMyTagWrap <=< tagRequest . (coerceEvent :: Event t (request a) -> Event t (Entry request (Single a)))
345− requesting_ = void . tagRequest . fmapCheap singleEntry
346−
347−{-# INLINE tagRequest #-}
348−tagRequest :: forall m x t request response. (Monad m, MyTagTypeOffset x) => Event t (Entry request x) -> RequesterT t request response m (MyTagWrap request (Entry request x))
349−tagRequest req = do
350− old <- RequesterT get
351− let n = _requesterState_nextMyTag old .|. myTagTypeOffset (Proxy :: Proxy x)
352− t = MyTagWrap n
353− RequesterT $ put $ RequesterState
354− { _requesterState_nextMyTag = _requesterState_nextMyTag old - 0x4
355− , _requesterState_requests = (n, (unsafeCoerce :: Event t (Entry request x) -> Event t Any) req) : _requesterState_requests old
356− }
357− return t
358−
359−{-# 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))
361−responseFromTag (MyTagWrap t) = do
362− responses :: EventSelectorInt t Any <- RequesterT ask
363− return $ (unsafeCoerce :: Event t Any -> Event t (Entry response x)) $ selectInt responses t
364−
365−instance MonadTrans (RequesterT t request response) where
366− lift = RequesterT . lift . lift
367−
368−instance MFunctor (RequesterT t request response) where
369− hoist f = RequesterT . hoist (hoist f) . unRequesterT
370−
371−instance PerformEvent t m => PerformEvent t (RequesterT t request response m) where
372− type Performable (RequesterT t request response m) = Performable m
373− performEvent_ = lift . performEvent_
374− performEvent = lift . performEvent
375−
376−instance MonadRef m => MonadRef (RequesterT t request response m) where
377− type Ref (RequesterT t request response m) = Ref m
378− newRef = lift . newRef
379− readRef = lift . readRef
380− writeRef r = lift . writeRef r
381−
382−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (RequesterT t request response m) where
383− newEventWithTrigger = lift . newEventWithTrigger
384− newFanEventWithTrigger f = lift $ newFanEventWithTrigger f
385−
386−instance MonadReader r m => MonadReader r (RequesterT t request response m) where
387− ask = lift ask
388− local f (RequesterT a) = RequesterT $ mapStateT (mapReaderT $ local f) a
389− reader = lift . reader
390−
391−instance (Reflex t, Adjustable t m, MonadHold t m, MonadFix m) => Adjustable t (RequesterT t request response m) where
392− runWithReplace = runWithReplaceRequesterTWith $ \dm0 dm' -> lift $ runWithReplace dm0 dm'
393− traverseIntMapWithKeyWithAdjust = traverseIntMapWithKeyWithAdjustRequesterTWith (\f dm0 dm' -> lift $ traverseIntMapWithKeyWithAdjust f dm0 dm') patchIntMapNewElementsMap mergeIntIncremental
394− {-# INLINABLE traverseDMapWithKeyWithAdjust #-}
395− traverseDMapWithKeyWithAdjust = traverseDMapWithKeyWithAdjustRequesterTWith (\f dm0 dm' -> lift $ traverseDMapWithKeyWithAdjust f dm0 dm') mapPatchDMap weakenPatchDMapWith patchMapNewElementsMap mergeMapIncremental
396− traverseDMapWithKeyWithAdjustWithMove = traverseDMapWithKeyWithAdjustRequesterTWith (\f dm0 dm' -> lift $ traverseDMapWithKeyWithAdjustWithMove f dm0 dm') mapPatchDMapWithMove weakenPatchDMapWithMoveWith patchMapWithMoveNewElementsMap mergeMapIncrementalWithMove
397−
398−requesting' :: (MyTagTypeOffset x, Monad m) => Event t (Entry request x) -> RequesterT t request response m (Event t (Entry response x))
399−requesting' = responseFromTag . castMyTagWrap <=< tagRequest
400−
401−{-# INLINABLE runWithReplaceRequesterTWith #-}
402−runWithReplaceRequesterTWith :: forall m t request response a b. (Reflex t, MonadHold t m
403− , MonadFix m
404− )
405− => (forall a' b'. m a' -> Event t (m b') -> RequesterT t request response m (a', Event t b'))
406− -> RequesterT t request response m a
407− -> Event t (RequesterT t request response m b)
408− -> RequesterT t request response m (a, Event t b)
409−runWithReplaceRequesterTWith f a0 a' = do
410− rec na' <- numberOccurrencesFrom 1 a'
411− responses <- fmap (fmapCheap unMultiEntry) $ requesting' $ fmapCheap multiEntry $ switchPromptlyDyn requests --TODO: Investigate whether we can really get rid of the prompt stuff here
412− let responses' = fanInt responses
413− ((result0, requests0), v') <- f (runRequesterT a0 (selectInt responses' 0)) $ fmapCheap (\(n, a) -> fmap ((,) n) $ runRequesterT a $ selectInt responses' n) na'
414− requests <- holdDyn (fmapCheap (IntMap.singleton 0) requests0) $ fmapCheap (\(n, (_, reqs)) -> fmapCheap (IntMap.singleton n) reqs) v'
415− return (result0, fmapCheap (fst . snd) v')
416−
417−{-# INLINE traverseIntMapWithKeyWithAdjustRequesterTWith #-}
418−traverseIntMapWithKeyWithAdjustRequesterTWith :: forall t request response m v v' p.
419− ( Reflex t
420− , MonadHold t m
421− , PatchTarget (p (Event t (IntMap (RequesterData request)))) ~ IntMap (Event t (IntMap (RequesterData request)))
422− , Patch (p (Event t (IntMap (RequesterData request))))
423− , Functor p
424− , MonadFix m
425− )
426− => ( (IntMap.Key -> (IntMap.Key, v) -> m (Event t (IntMap (RequesterData request)), v'))
427− -> IntMap (IntMap.Key, v)
428− -> Event t (p (IntMap.Key, v))
429− -> RequesterT t request response m (IntMap (Event t (IntMap (RequesterData request)), v'), Event t (p (Event t (IntMap (RequesterData request)), v')))
430− )
431− -> (p (Event t (IntMap (RequesterData request))) -> IntMap (Event t (IntMap (RequesterData request))))
432− -> (Incremental t (p (Event t (IntMap (RequesterData request)))) -> Event t (IntMap (IntMap (RequesterData request))))
433− -> (IntMap.Key -> v -> RequesterT t request response m v')
434− -> IntMap v
435− -> Event t (p v)
436− -> RequesterT t request response m (IntMap v', Event t (p v'))
437−traverseIntMapWithKeyWithAdjustRequesterTWith base patchNewElements mergePatchIncremental f dm0 dm' = do
438− rec response <- requesting' $ fmapCheap pack $ promptRequests `mappend` mergePatchIncremental requests --TODO: Investigate whether we can really get rid of the prompt stuff here
439− let responses :: EventSelectorInt t (IntMap (RequesterData response))
440− responses = fanInt $ fmapCheap unpack response
441− unpack :: Entry response Multi3 -> IntMap (IntMap (RequesterData response))
442− unpack = unEntry
443− pack :: IntMap (IntMap (RequesterData request)) -> Entry request Multi3
444− pack = Entry
445− f' :: IntMap.Key -> (Int, v) -> m (Event t (IntMap (RequesterData request)), v')
446− 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?
448− return (fmapCheap (IntMap.singleton n) myRequests, result)
449− 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
451− let result0 = fmap snd children0
452− result' = fforCheap children' $ fmap snd
453− requests0 :: IntMap (Event t (IntMap (RequesterData request)))
454− requests0 = fmap fst children0
455− requests' :: Event t (p (Event t (IntMap (RequesterData request))))
456− requests' = fforCheap children' $ fmap fst
457− promptRequests :: Event t (IntMap (IntMap (RequesterData request)))
458− promptRequests = coincidence $ fmapCheap (mergeInt . patchNewElements) requests' --TODO: Create a mergeIncrementalPromptly, and use that to eliminate this 'coincidence'
459− requests <- holdIncremental requests0 requests'
460− return (result0, result')
461−
462−{-# INLINE traverseDMapWithKeyWithAdjustRequesterTWith #-}
463−traverseDMapWithKeyWithAdjustRequesterTWith :: forall k t request response m v v' p p'.
464− ( GCompare k
465− , Reflex t
466− , MonadHold t m
467− , PatchTarget (p' (Some k) (Event t (IntMap (RequesterData request)))) ~ Map (Some k) (Event t (IntMap (RequesterData request)))
468− , Patch (p' (Some k) (Event t (IntMap (RequesterData request))))
469− , MonadFix m
470− )
471− => (forall k' v1 v2. GCompare k'
472− => (forall a. k' a -> v1 a -> m (v2 a))
473− -> DMap k' v1
474− -> Event t (p k' v1)
475− -> RequesterT t request response m (DMap k' v2, Event t (p k' v2))
476− )
477− -> (forall v1 v2. (forall a. v1 a -> v2 a) -> p k v1 -> p k v2)
478− -> (forall v1 v2. (forall a. v1 a -> v2) -> p k v1 -> p' (Some k) v2)
479− -> (forall v2. p' (Some k) v2 -> Map (Some k) v2)
480− -> (forall a. Incremental t (p' (Some k) (Event t a)) -> Event t (Map (Some k) a))
481− -> (forall a. k a -> v a -> RequesterT t request response m (v' a))
482− -> DMap k v
483− -> Event t (p k v)
484− -> RequesterT t request response m (DMap k v', Event t (p k v'))
485−traverseDMapWithKeyWithAdjustRequesterTWith base mapPatch weakenPatchWith patchNewElements mergePatchIncremental f dm0 dm' = do
486− rec response <- requesting' $ fmapCheap pack $ promptRequests `mappend` mergePatchIncremental requests --TODO: Investigate whether we can really get rid of the prompt stuff here
487− let responses :: EventSelector t (Const2 (Some k) (IntMap (RequesterData response)))
488− responses = fanMap $ fmapCheap unpack response
489− unpack :: Entry response (Multi2 k) -> Map (Some k) (IntMap (RequesterData response))
490− unpack = _multi2Contents_values . unEntry
491− pack :: Map (Some k) (IntMap (RequesterData request)) -> Entry request (Multi2 k)
492− pack m = Entry $ Multi2Contents { _multi2Contents_values = m, _multi2Contents_dict = Dict }
493− f' :: forall a. k a -> Compose ((,) Int) v a -> m (Compose ((,) (Event t (IntMap (RequesterData request)))) v' a)
494− f' k (Compose (n, v)) = do
495− (result, myRequests) <- runRequesterT (f k v) $ mapMaybeCheap (IntMap.lookup n) $ select responses (Const2 (Some k))
496− return $ Compose (fmapCheap (IntMap.singleton n) myRequests, result)
497− ndm' <- numberOccurrencesFrom 1 dm'
498− (children0, children') <- base f' (DMap.map (\v -> Compose (0, v)) dm0) $ fmap (\(n, dm) -> mapPatch (\v -> Compose (n, v)) dm) ndm'
499− let result0 = DMap.map (snd . getCompose) children0
500− result' = fforCheap children' $ mapPatch $ snd . getCompose
501− requests0 :: Map (Some k) (Event t (IntMap (RequesterData request)))
502− requests0 = weakenDMapWith (fst . getCompose) children0
503− requests' :: Event t (p' (Some k) (Event t (IntMap (RequesterData request))))
504− requests' = fforCheap children' $ weakenPatchWith $ fst . getCompose
505− promptRequests :: Event t (Map (Some k) (IntMap (RequesterData request)))
506− promptRequests = coincidence $ fmapCheap (mergeMap . patchNewElements) requests' --TODO: Create a mergeIncrementalPromptly, and use that to eliminate this 'coincidence'
507− requests <- holdIncremental requests0 requests'
508− 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)
22+import Reflex.Requester.Base.Internal
src/Reflex/Requester/Base/Internal.hsnew file+674
@@ -0,0 +1,674 @@
1+{-# LANGUAGE AllowAmbiguousTypes #-}
2+{-# LANGUAGE CPP #-}
3+{-# LANGUAGE EmptyDataDecls #-}
4+{-# LANGUAGE ExistentialQuantification #-}
5+{-# LANGUAGE FlexibleInstances #-}
6+{-# LANGUAGE GADTs #-}
7+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
8+{-# LANGUAGE MultiParamTypeClasses #-}
9+{-# LANGUAGE Rank2Types #-}
10+{-# LANGUAGE RecursiveDo #-}
11+{-# LANGUAGE ScopedTypeVariables #-}
12+{-# LANGUAGE StandaloneDeriving #-}
13+{-# LANGUAGE TypeFamilies #-}
14+{-# LANGUAGE TypeOperators #-}
15+{-# LANGUAGE UndecidableInstances #-}
16+{-# LANGUAGE InstanceSigs #-}
17+#ifdef USE_REFLEX_OPTIMIZER
18+{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
19+#endif
20+module Reflex.Requester.Base.Internal where
21+
22+import Reflex.Class
23+import Reflex.Adjustable.Class
24+import Reflex.Dynamic
25+import Reflex.Host.Class
26+import Reflex.PerformEvent.Class
27+import Reflex.PostBuild.Class
28+import Reflex.Requester.Class
29+import Reflex.TriggerEvent.Class
30+import Reflex.EventWriter.Base
31+import Reflex.EventWriter.Class
32+
33+import Control.Applicative (liftA2)
34+import Control.Monad.Exception
35+import Control.Monad.Identity
36+import Control.Monad.Primitive
37+import Control.Monad.Reader
38+import Control.Monad.Ref
39+import Control.Monad.State.Strict
40+import Data.Bits
41+import Data.Coerce
42+import Data.Dependent.Map (DMap, DSum (..))
43+import qualified Data.Dependent.Map as DMap
44+import Data.Functor.Compose
45+import Data.Functor.Misc
46+import Data.IntMap.Strict (IntMap)
47+import qualified Data.IntMap.Strict as IntMap
48+import qualified Data.List.NonEmpty as NonEmpty
49+import Data.List.NonEmpty.Deferred (NonEmptyDeferred)
50+import qualified Data.List.NonEmpty.Deferred as NonEmptyDeferred
51+import Data.Map (Map)
52+import qualified Data.Map as Map
53+import Data.Monoid ((<>))
54+import Data.Proxy
55+import qualified Data.Semigroup as S
56+import Data.Some (Some(Some))
57+import Data.Type.Equality
58+import Data.Sequence (Seq)
59+import qualified Data.Sequence as Seq
60+import Data.TagMap (TagMap)
61+import qualified Data.TagMap as TagMap
62+import Reflex.FanTag
63+import Data.Unique.Tag.Local
64+import qualified Data.Unique.Tag as Global
65+import Data.GADT.Compare
66+import Data.Witherable
67+import Data.Foldable
68+
69+import Unsafe.Coerce
70+
71+import Debug.Trace
72+
73+data RequestData ps request = forall s. RequestData !(TagGen ps s) !(NonEmptyDeferred (RequestEnvelope s request))
74+data ResponseData ps response = forall s. ResponseData !(TagGen ps s) !(TagMap s response)
75+
76+traverseRequesterData :: forall m request response. Applicative m => (forall a. request a -> m (response a)) -> RequestData (PrimState m) request -> m (ResponseData (PrimState m) response)
77+traverseRequesterData f (RequestData tg es) = ResponseData tg . TagMap.fromList <$> wither g (NonEmpty.toList $ NonEmptyDeferred.toNonEmpty es)
78+ where g (RequestEnvelope mt req) = case mt of
79+ Just t -> Just . (t :=>) <$> f req
80+ Nothing -> Nothing <$ f req
81+
82+runRequesterT :: forall t request response m a
83+ . ( Reflex t
84+ , PrimMonad m
85+ , MonadFix m
86+ )
87+ => RequesterT t request response m a
88+ -> Event t (ResponseData (PrimState m) response)
89+ -> m (a, Event t (RequestData (PrimState m) request))
90+runRequesterT (RequesterT a) wrappedResponses = withRequesterInternalT $ \requests -> do
91+ (_, tg) <- RequesterInternalT ask
92+ result <- a
93+ let responses = fforMaybe wrappedResponses $ \(ResponseData tg' m) -> case tg `geq` tg' of
94+ Nothing -> trace ("runRequesterT: bad TagGen: expected " <> show tg <> " but got " <> show tg') Nothing --TODO: Warn somehow
95+ Just Refl -> Just m
96+ pure (responses, (result, fmapCheap (RequestData tg) requests))
97+
98+instance MonadTrans (RequesterInternalT s t request response) where
99+ lift = RequesterInternalT . lift . lift
100+
101+instance MonadTrans (RequesterT t request response) where
102+ lift a = RequesterT $ RequesterInternalT $ lift $ lift a
103+
104+-- | Run a 'RequesterT' action. The resulting 'Event' will fire whenever
105+-- requests are made, and responses should be provided in the input 'Event'.
106+-- The 'Tag' keys will be used to return the responses to the same place the
107+-- requests were issued.
108+withRequesterInternalT
109+ :: forall t m request response a.
110+ ( Reflex t
111+ , PrimMonad m
112+ , MonadFix m
113+ )
114+ => (Event t (NonEmptyDeferred (RequestEnvelope FakeRequesterStatePhantom request)) -> RequesterInternalT FakeRequesterStatePhantom t request response m (Event t (TagMap FakeRequesterStatePhantom response), a))
115+ -> m a
116+withRequesterInternalT f = do
117+ stg <- newTagGen
118+ let tg = case stg of
119+ Some tg' -> (unsafeCoerce :: TagGen (PrimState m) s -> TagGen (PrimState m) FakeRequesterStatePhantom) tg'
120+ rec let RequesterInternalT a = (unsafeCoerce :: RequesterInternalT s t request response m (Event t (TagMap FakeRequesterStatePhantom response), a) -> RequesterInternalT FakeRequesterStatePhantom t request response m (Event t (TagMap FakeRequesterStatePhantom response), a)) $ f requests
121+ ((responses, result), requests) <- runEventWriterT $ runReaderT a (fanTag responses, tg)
122+ pure result
123+
124+data RequestEnvelope s request = forall a. RequestEnvelope {-# UNPACK #-} !(Maybe (Tag s a)) !(request a)
125+
126+-- This is because using forall ruins inlining
127+data FakeRequesterStatePhantom
128+
129+newtype RequesterT t (request :: * -> *) (response :: * -> *) m a = RequesterT { unRequesterT :: RequesterInternalT FakeRequesterStatePhantom t request response m a }
130+ deriving (Functor, Applicative, Monad, MonadFix, MonadIO, MonadException)
131+
132+newtype RequesterInternalT s t request response m a = RequesterInternalT { unRequesterInternalT :: ReaderT (EventSelectorTag t s response, TagGen (PrimState m) s) (EventWriterT t (NonEmptyDeferred (RequestEnvelope s request)) m) a }
133+ deriving
134+ ( Functor, Applicative, Monad, MonadFix, MonadIO, MonadException
135+#if MIN_VERSION_base(4,9,1)
136+ , MonadAsyncException
137+#endif
138+ )
139+
140+-- I don't think this can actually be supported without an unsafeCoerce
141+-- #if MIN_VERSION_base(4,9,1)
142+-- instance MonadAsyncException m => MonadAsyncException (RequesterT t request response m) where
143+-- mask f = RequesterT $ mask $ \unmask -> unRequesterT $ f $ \x -> RequesterT $ unmask $ unRequesterT x
144+-- #endif
145+
146+instance MonadSample t m => MonadSample t (RequesterT t request response m)
147+instance MonadHold t m => MonadHold t (RequesterT t request response m)
148+instance PostBuild t m => PostBuild t (RequesterT t request response m)
149+instance TriggerEvent t m => TriggerEvent t (RequesterT t request response m)
150+
151+instance MonadSample t m => MonadSample t (RequesterInternalT s t request response m)
152+instance MonadHold t m => MonadHold t (RequesterInternalT s t request response m)
153+instance PostBuild t m => PostBuild t (RequesterInternalT s t request response m)
154+instance TriggerEvent t m => TriggerEvent t (RequesterInternalT s t request response m)
155+
156+instance PrimMonad m => PrimMonad (RequesterT t request response m) where
157+ type PrimState (RequesterT t request response m) = PrimState m
158+ primitive = lift . primitive
159+
160+-- TODO: Monoid and Semigroup can likely be derived once StateT has them.
161+instance (Monoid a, Monad m) => Monoid (RequesterT t request response m a) where
162+ mempty = pure mempty
163+ mappend = liftA2 mappend
164+
165+instance (S.Semigroup a, Monad m) => S.Semigroup (RequesterT t request response m a) where
166+ (<>) = liftA2 (S.<>)
167+
168+instance PerformEvent t m => PerformEvent t (RequesterT t request response m) where
169+ type Performable (RequesterT t request response m) = Performable m
170+ performEvent_ = lift . performEvent_
171+ performEvent = lift . performEvent
172+
173+instance MonadRef m => MonadRef (RequesterT t request response m) where
174+ type Ref (RequesterT t request response m) = Ref m
175+ newRef = lift . newRef
176+ readRef = lift . readRef
177+ writeRef r = lift . writeRef r
178+
179+instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (RequesterT t request response m) where
180+ newEventWithTrigger = lift . newEventWithTrigger
181+ newFanEventWithTrigger f = lift $ newFanEventWithTrigger f
182+
183+instance MonadReader r m => MonadReader r (RequesterT t request response m) where
184+ ask = lift ask
185+ local f (RequesterT a) = RequesterT $ RequesterInternalT $ mapReaderT (mapEventWriterT $ local f) $ unRequesterInternalT a
186+ reader = lift . reader
187+
188+instance (Reflex t, PrimMonad m) => Requester t (RequesterT t request response m) where
189+ type Request (RequesterT t request response m) = request
190+ type Response (RequesterT t request response m) = response
191+ requesting e = RequesterT $ requesting e
192+ requesting_ e = RequesterT $ requesting_ e
193+
194+instance (Reflex t, PrimMonad m) => Requester t (RequesterInternalT s t request response m) where
195+ type Request (RequesterInternalT s t request response m) = request
196+ type Response (RequesterInternalT s t request response m) = response
197+ requesting e = RequesterInternalT $ do
198+ (s, tg) <- ask
199+ t <- lift $ lift $ newTag tg
200+ tellEvent $ fmapCheap (NonEmptyDeferred.singleton . RequestEnvelope (Just t)) e
201+ pure $ selectTag s t
202+ requesting_ e = RequesterInternalT $ do
203+ tellEvent $ fmapCheap (NonEmptyDeferred.singleton . RequestEnvelope Nothing) e
204+
205+instance (Adjustable t m, MonadHold t m) => Adjustable t (RequesterInternalT s t request response m) where
206+ {-# INLINE runWithReplace #-}
207+ runWithReplace (RequesterInternalT a0) a' = RequesterInternalT $ runWithReplace a0 (coerceEvent a')
208+ {-# INLINE traverseIntMapWithKeyWithAdjust #-}
209+ traverseIntMapWithKeyWithAdjust f dm0 dm' = RequesterInternalT $ traverseIntMapWithKeyWithAdjust (coerce . f) dm0 dm'
210+ {-# INLINE traverseDMapWithKeyWithAdjust #-}
211+ traverseDMapWithKeyWithAdjust f dm0 dm' = RequesterInternalT $ traverseDMapWithKeyWithAdjust (coerce . f) dm0 dm'
212+ {-# INLINE traverseDMapWithKeyWithAdjustWithMove #-}
213+ traverseDMapWithKeyWithAdjustWithMove f dm0 dm' = RequesterInternalT $ traverseDMapWithKeyWithAdjustWithMove (coerce . f) dm0 dm'
214+
215+instance (Adjustable t m, MonadHold t m) => Adjustable t (RequesterT t request response m) where
216+ {-# INLINE runWithReplace #-}
217+ runWithReplace (RequesterT a0) a' = RequesterT $ runWithReplace a0 (fmapCheap unRequesterT a')
218+ {-# INLINE traverseIntMapWithKeyWithAdjust #-}
219+ traverseIntMapWithKeyWithAdjust f dm0 dm' = RequesterT $ traverseIntMapWithKeyWithAdjust (\k v -> unRequesterT $ f k v) dm0 dm'
220+ {-# INLINE traverseDMapWithKeyWithAdjust #-}
221+ traverseDMapWithKeyWithAdjust f dm0 dm' = RequesterT $ traverseDMapWithKeyWithAdjust (\k v -> unRequesterT $ f k v) dm0 dm'
222+ {-# INLINE traverseDMapWithKeyWithAdjustWithMove #-}
223+ traverseDMapWithKeyWithAdjustWithMove f dm0 dm' = RequesterT $ traverseDMapWithKeyWithAdjustWithMove (\k v -> unRequesterT $ f k v) dm0 dm'
224+
225+{-
226+import GHC.Exts (Any)
227+import Unsafe.Coerce
228+
229+--TODO: Make this module type-safe
230+
231+newtype TagMap (f :: * -> *) = TagMap (IntMap Any)
232+
233+newtype RequesterData f = RequesterData (TagMap (Entry f))
234+
235+data RequesterDataKey a where
236+ RequesterDataKey_Single :: {-# UNPACK #-} !(MyTag (Single a)) -> RequesterDataKey a
237+ 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
238+ RequesterDataKey_Multi2 :: {-# UNPACK #-} !(MyTag (Multi2 k)) -> !(Some k) -> {-# UNPACK #-} !Int -> !(RequesterDataKey a) -> RequesterDataKey a
239+ RequesterDataKey_Multi3 :: {-# UNPACK #-} !(MyTag Multi3) -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> !(RequesterDataKey a) -> RequesterDataKey a
240+
241+singletonRequesterData :: RequesterDataKey a -> f a -> RequesterData f
242+singletonRequesterData rdk v = case rdk of
243+ RequesterDataKey_Single k -> RequesterData $ singletonTagMap k $ Entry v
244+ RequesterDataKey_Multi k k' k'' -> RequesterData $ singletonTagMap k $ Entry $ IntMap.singleton k' $ singletonRequesterData k'' v
245+ RequesterDataKey_Multi2 k k' k'' k''' -> RequesterData $ singletonTagMap k $ Entry $ Map.singleton k' $ IntMap.singleton k'' $ singletonRequesterData k''' v
246+ RequesterDataKey_Multi3 k k' k'' k''' -> RequesterData $ singletonTagMap k $ Entry $ IntMap.singleton k' $ IntMap.singleton k'' $ singletonRequesterData k''' v
247+
248+requesterDataToList :: RequesterData f -> [DSum RequesterDataKey f]
249+requesterDataToList (RequesterData m) = do
250+ k :=> Entry e <- tagMapToList m
251+ case myKeyType k of
252+ MyTagType_Single -> return $ RequesterDataKey_Single k :=> e
253+ MyTagType_Multi -> do
254+ (k', e') <- IntMap.toList e
255+ k'' :=> e'' <- requesterDataToList e'
256+ return $ RequesterDataKey_Multi k k' k'' :=> e''
257+ MyTagType_Multi2 -> do
258+ (k', e') <- Map.toList e
259+ (k'', e'') <- IntMap.toList e'
260+ k''' :=> e''' <- requesterDataToList e''
261+ return $ RequesterDataKey_Multi2 k k' k'' k''' :=> e'''
262+ MyTagType_Multi3 -> do
263+ (k', e') <- IntMap.toList e
264+ (k'', e'') <- IntMap.toList e'
265+ k''' :=> e''' <- requesterDataToList e''
266+ return $ RequesterDataKey_Multi3 k k' k'' k''' :=> e'''
267+
268+singletonTagMap :: forall f a. MyTag a -> f a -> TagMap f
269+singletonTagMap (MyTag k) v = TagMap $ IntMap.singleton k $ (unsafeCoerce :: f a -> Any) v
270+
271+tagMapToList :: forall f. TagMap f -> [DSum MyTag f]
272+tagMapToList (TagMap m) = f <$> IntMap.toList m
273+ where f :: (Int, Any) -> DSum MyTag f
274+ f (k, v) = MyTag k :=> (unsafeCoerce :: Any -> f a) v
275+
276+traverseTagMapWithKey :: forall t f g. Applicative t => (forall a. MyTag a -> f a -> t (g a)) -> TagMap f -> t (TagMap g)
277+traverseTagMapWithKey f (TagMap m) = TagMap <$> IntMap.traverseWithKey g m
278+ where
279+ g :: Int -> Any -> t Any
280+ g k v = (unsafeCoerce :: g a -> Any) <$> f (MyTag k) ((unsafeCoerce :: Any -> f a) v)
281+
282+-- | Runs in reverse to accommodate for the fact that we accumulate it in reverse
283+traverseRequesterData :: forall m request response. Applicative m => (forall a. request a -> m (response a)) -> RequesterData request -> m (RequesterData response)
284+traverseRequesterData f (RequesterData m) = RequesterData <$> traverseTagMapWithKey go m --TODO: reverse this, since our tags are in reverse order
285+ where go :: forall x. MyTag x -> Entry request x -> m (Entry response x)
286+ go k (Entry request) = Entry <$> case myKeyType k of
287+ MyTagType_Single -> f request
288+ MyTagType_Multi -> traverse (traverseRequesterData f) request
289+ MyTagType_Multi2 -> traverse (traverse (traverseRequesterData f)) request
290+ MyTagType_Multi3 -> traverse (traverse (traverseRequesterData f)) request
291+
292+-- | 'traverseRequesterData' with its arguments flipped
293+forRequesterData :: forall request response m. Applicative m => RequesterData request -> (forall a. request a -> m (response a)) -> m (RequesterData response)
294+forRequesterData r f = traverseRequesterData f r
295+
296+data MyTagType :: * -> * where
297+ MyTagType_Single :: MyTagType (Single a)
298+ MyTagType_Multi :: MyTagType Multi
299+ MyTagType_Multi2 :: MyTagType (Multi2 k)
300+ MyTagType_Multi3 :: MyTagType Multi3
301+
302+myKeyType :: MyTag x -> MyTagType x
303+myKeyType (MyTag k) = case k .&. 0x3 of
304+ 0x0 -> unsafeCoerce MyTagType_Single
305+ 0x1 -> unsafeCoerce MyTagType_Multi
306+ 0x2 -> unsafeCoerce MyTagType_Multi2
307+ 0x3 -> unsafeCoerce MyTagType_Multi3
308+ t -> error $ "Reflex.Requester.Base.myKeyType: no such key type" <> show t
309+
310+data Single a
311+data Multi
312+data Multi2 (k :: * -> *)
313+data Multi3
314+
315+class MyTagTypeOffset x where
316+ myTagTypeOffset :: proxy x -> Int
317+
318+instance MyTagTypeOffset (Single a) where
319+ myTagTypeOffset _ = 0x0
320+
321+instance MyTagTypeOffset Multi where
322+ myTagTypeOffset _ = 0x1
323+
324+instance MyTagTypeOffset (Multi2 k) where
325+ myTagTypeOffset _ = 0x2
326+
327+instance MyTagTypeOffset Multi3 where
328+ myTagTypeOffset _ = 0x3
329+
330+type family EntryContents request a where
331+ EntryContents request (Single a) = request a
332+ EntryContents request Multi = IntMap (RequesterData request)
333+ EntryContents request (Multi2 k) = Map (Some k) (IntMap (RequesterData request))
334+ EntryContents request Multi3 = IntMap (IntMap (RequesterData request))
335+
336+newtype Entry request x = Entry { unEntry :: EntryContents request x }
337+
338+{-# INLINE singleEntry #-}
339+singleEntry :: f a -> Entry f (Single a)
340+singleEntry = Entry
341+
342+{-# INLINE multiEntry #-}
343+multiEntry :: IntMap (RequesterData f) -> Entry f Multi
344+multiEntry = Entry
345+
346+{-# INLINE unMultiEntry #-}
347+unMultiEntry :: Entry f Multi -> IntMap (RequesterData f)
348+unMultiEntry = unEntry
349+
350+-- | We use a hack here to pretend we have x ~ request a; we don't want to use a GADT, because GADTs (even with zero-size existential contexts) can't be newtypes
351+-- WARNING: This type should never be exposed. In particular, this is extremely unsound if a MyTag from one run of runRequesterT is ever compared against a MyTag from another
352+newtype MyTag x = MyTag Int deriving (Show, Eq, Ord, Enum)
353+
354+newtype MyTagWrap (f :: * -> *) x = MyTagWrap Int deriving (Show, Eq, Ord, Enum)
355+
356+{-# INLINE castMyTagWrap #-}
357+castMyTagWrap :: MyTagWrap f (Entry f x) -> MyTagWrap g (Entry g x)
358+castMyTagWrap = coerce
359+
360+instance GEq MyTag where
361+ (MyTag a) `geq` (MyTag b) =
362+ if a == b
363+ then Just $ unsafeCoerce Refl
364+ else Nothing
365+
366+instance GCompare MyTag where
367+ (MyTag a) `gcompare` (MyTag b) =
368+ case a `compare` b of
369+ LT -> GLT
370+ EQ -> unsafeCoerce GEQ
371+ GT -> GGT
372+
373+instance GEq (MyTagWrap f) where
374+ (MyTagWrap a) `geq` (MyTagWrap b) =
375+ if a == b
376+ then Just $ unsafeCoerce Refl
377+ else Nothing
378+
379+instance GCompare (MyTagWrap f) where
380+ (MyTagWrap a) `gcompare` (MyTagWrap b) =
381+ case a `compare` b of
382+ LT -> GLT
383+ EQ -> unsafeCoerce GEQ
384+ GT -> GGT
385+
386+data RequesterState t (request :: * -> *) = RequesterState
387+ { _requesterState_nextMyTag :: {-# UNPACK #-} !Int -- Starts at -4 and goes down by 4 each time, to accommodate two 'type' bits at the bottom
388+ , _requesterState_requests :: ![(Int, Event t Any)]
389+ }
390+
391+-- | A basic implementation of 'Requester'.
392+newtype RequesterT t request (response :: * -> *) m a = RequesterT { unRequesterT :: StateT (RequesterState t request) (ReaderT (EventSelectorInt t Any) m) a }
393+ deriving (Functor, Applicative, Monad, MonadFix, MonadIO, MonadException
394+-- MonadAsyncException can't be derived on ghc-8.0.1; we use base-4.9.1 as a proxy for ghc-8.0.2
395+#if MIN_VERSION_base(4,9,1)
396+ , MonadAsyncException
397+#endif
398+ )
399+
400+
401+-- | Run a 'RequesterT' action. The resulting 'Event' will fire whenever
402+-- requests are made, and responses should be provided in the input 'Event'.
403+-- The 'Tag' keys will be used to return the responses to the same place the
404+-- requests were issued.
405+runRequesterT :: (Reflex t, Monad m)
406+ => RequesterT t request response m a
407+ -> Event t (RequesterData response) --TODO: This DMap will be in reverse order, so we need to make sure the caller traverses it in reverse
408+ -> m (a, Event t (RequesterData request)) --TODO: we need to hide these 'MyTag's here, because they're unsafe to mix in the wild
409+runRequesterT (RequesterT a) responses = do
410+ (result, s) <- runReaderT (runStateT a $ RequesterState (-4) []) $ fanInt $
411+ coerceEvent responses
412+ return (result, fmapCheap (RequesterData . TagMap) $ mergeInt $ IntMap.fromDistinctAscList $ _requesterState_requests s)
413+
414+-- | Map a function over the request and response of a 'RequesterT'
415+withRequesterT
416+ :: (Reflex t, MonadFix m)
417+ => (forall x. req x -> req' x) -- ^ The function to map over the request
418+ -> (forall x. rsp' x -> rsp x) -- ^ The function to map over the response
419+ -> RequesterT t req rsp m a -- ^ The internal 'RequesterT' whose input and output will be transformed
420+ -> RequesterT t req' rsp' m a -- ^ The resulting 'RequesterT'
421+withRequesterT freq frsp child = do
422+ rec let rsp = fmap (runIdentity . traverseRequesterData (Identity . frsp)) rsp'
423+ (a, req) <- lift $ runRequesterT child rsp
424+ rsp' <- fmap (flip selectInt 0 . fanInt . fmapCheap unMultiEntry) $ requesting' $
425+ fmapCheap (multiEntry . IntMap.singleton 0) $ fmap (runIdentity . traverseRequesterData (Identity . freq)) req
426+ return a
427+
428+instance (Reflex t, Monad m) => Requester t (RequesterT t request response m) where
429+ type Request (RequesterT t request response m) = request
430+ type Response (RequesterT t request response m) = response
431+ requesting = fmap coerceEvent . responseFromTag . castMyTagWrap <=< tagRequest . (coerceEvent :: Event t (request a) -> Event t (Entry request (Single a)))
432+ requesting_ = void . tagRequest . fmapCheap singleEntry
433+
434+{-# INLINE tagRequest #-}
435+tagRequest :: forall m x t request response. (Monad m, MyTagTypeOffset x) => Event t (Entry request x) -> RequesterT t request response m (MyTagWrap request (Entry request x))
436+tagRequest req = do
437+ old <- RequesterT get
438+ let n = _requesterState_nextMyTag old .|. myTagTypeOffset (Proxy :: Proxy x)
439+ t = MyTagWrap n
440+ RequesterT $ put $ RequesterState
441+ { _requesterState_nextMyTag = _requesterState_nextMyTag old - 0x4
442+ , _requesterState_requests = (n, (unsafeCoerce :: Event t (Entry request x) -> Event t Any) req) : _requesterState_requests old
443+ }
444+ return t
445+
446+{-# INLINE responseFromTag #-}
447+responseFromTag :: Monad m => MyTagWrap response (Entry response x) -> RequesterT t request response m (Event t (Entry response x))
448+responseFromTag (MyTagWrap t) = do
449+ responses :: EventSelectorInt t Any <- RequesterT ask
450+ return $ (unsafeCoerce :: Event t Any -> Event t (Entry response x)) $ selectInt responses t
451+
452+instance MonadTrans (RequesterT t request response) where
453+ lift = RequesterT . lift . lift
454+
455+instance PerformEvent t m => PerformEvent t (RequesterT t request response m) where
456+ type Performable (RequesterT t request response m) = Performable m
457+ performEvent_ = lift . performEvent_
458+ performEvent = lift . performEvent
459+
460+instance MonadRef m => MonadRef (RequesterT t request response m) where
461+ type Ref (RequesterT t request response m) = Ref m
462+ newRef = lift . newRef
463+ readRef = lift . readRef
464+ writeRef r = lift . writeRef r
465+
466+instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (RequesterT t request response m) where
467+ newEventWithTrigger = lift . newEventWithTrigger
468+ newFanEventWithTrigger f = lift $ newFanEventWithTrigger f
469+
470+instance MonadReader r m => MonadReader r (RequesterT t request response m) where
471+ ask = lift ask
472+ local f (RequesterT a) = RequesterT $ mapStateT (mapReaderT $ local f) a
473+ reader = lift . reader
474+
475+instance (Reflex t, Adjustable t m, MonadHold t m, MonadFix m) => Adjustable t (RequesterT t request response m) where
476+ runWithReplace = runWithReplaceRequesterTWith $ \dm0 dm' -> lift $ runWithReplace dm0 dm'
477+ traverseIntMapWithKeyWithAdjust = traverseIntMapWithKeyWithAdjustRequesterTWith (\f dm0 dm' -> lift $ traverseIntMapWithKeyWithAdjust f dm0 dm') patchIntMapNewElementsMap mergeIntIncremental
478+ {-# INLINABLE traverseDMapWithKeyWithAdjust #-}
479+ traverseDMapWithKeyWithAdjust = traverseDMapWithKeyWithAdjustRequesterTWith (\f dm0 dm' -> lift $ traverseDMapWithKeyWithAdjust f dm0 dm') mapPatchDMap weakenPatchDMapWith patchMapNewElementsMap mergeMapIncremental
480+ traverseDMapWithKeyWithAdjustWithMove = traverseDMapWithKeyWithAdjustRequesterTWith (\f dm0 dm' -> lift $ traverseDMapWithKeyWithAdjustWithMove f dm0 dm') mapPatchDMapWithMove weakenPatchDMapWithMoveWith patchMapWithMoveNewElementsMap mergeMapIncrementalWithMove
481+
482+requesting' :: (MyTagTypeOffset x, Monad m) => Event t (Entry request x) -> RequesterT t request response m (Event t (Entry response x))
483+requesting' = responseFromTag . castMyTagWrap <=< tagRequest
484+
485+{-# INLINABLE runWithReplaceRequesterTWith #-}
486+runWithReplaceRequesterTWith :: forall m t request response a b. (Reflex t, MonadHold t m
487+ , MonadFix m
488+ )
489+ => (forall a' b'. m a' -> Event t (m b') -> RequesterT t request response m (a', Event t b'))
490+ -> RequesterT t request response m a
491+ -> Event t (RequesterT t request response m b)
492+ -> RequesterT t request response m (a, Event t b)
493+runWithReplaceRequesterTWith f a0 a' = do
494+ rec na' <- numberOccurrencesFrom 1 a'
495+ responses <- fmap (fmapCheap unMultiEntry) $ requesting' $ fmapCheap multiEntry $ switchPromptlyDyn requests --TODO: Investigate whether we can really get rid of the prompt stuff here
496+ let responses' = fanInt responses
497+ ((result0, requests0), v') <- f (runRequesterT a0 (selectInt responses' 0)) $ fmapCheap (\(n, a) -> fmap ((,) n) $ runRequesterT a $ selectInt responses' n) na'
498+ requests <- holdDyn (fmapCheap (IntMap.singleton 0) requests0) $ fmapCheap (\(n, (_, reqs)) -> fmapCheap (IntMap.singleton n) reqs) v'
499+ return (result0, fmapCheap (fst . snd) v')
500+
501+{-# INLINE traverseIntMapWithKeyWithAdjustRequesterTWith #-}
502+traverseIntMapWithKeyWithAdjustRequesterTWith :: forall t request response m v v' p.
503+ ( Reflex t
504+ , MonadHold t m
505+ , PatchTarget (p (Event t (IntMap (RequesterData request)))) ~ IntMap (Event t (IntMap (RequesterData request)))
506+ , Patch (p (Event t (IntMap (RequesterData request))))
507+ , Functor p
508+ , MonadFix m
509+ )
510+ => ( (IntMap.Key -> (IntMap.Key, v) -> m (Event t (IntMap (RequesterData request)), v'))
511+ -> IntMap (IntMap.Key, v)
512+ -> Event t (p (IntMap.Key, v))
513+ -> RequesterT t request response m (IntMap (Event t (IntMap (RequesterData request)), v'), Event t (p (Event t (IntMap (RequesterData request)), v')))
514+ )
515+ -> (p (Event t (IntMap (RequesterData request))) -> IntMap (Event t (IntMap (RequesterData request))))
516+ -> (Incremental t (p (Event t (IntMap (RequesterData request)))) -> Event t (IntMap (IntMap (RequesterData request))))
517+ -> (IntMap.Key -> v -> RequesterT t request response m v')
518+ -> IntMap v
519+ -> Event t (p v)
520+ -> RequesterT t request response m (IntMap v', Event t (p v'))
521+traverseIntMapWithKeyWithAdjustRequesterTWith base patchNewElements mergePatchIncremental f dm0 dm' = do
522+ rec response <- requesting' $ fmapCheap pack $ promptRequests `mappend` mergePatchIncremental requests --TODO: Investigate whether we can really get rid of the prompt stuff here
523+ let responses :: EventSelectorInt t (IntMap (RequesterData response))
524+ responses = fanInt $ fmapCheap unpack response
525+ unpack :: Entry response Multi3 -> IntMap (IntMap (RequesterData response))
526+ unpack = unEntry
527+ pack :: IntMap (IntMap (RequesterData request)) -> Entry request Multi3
528+ pack = Entry
529+ f' :: IntMap.Key -> (Int, v) -> m (Event t (IntMap (RequesterData request)), v')
530+ f' k (n, v) = do
531+ (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?
532+ return (fmapCheap (IntMap.singleton n) myRequests, result)
533+ ndm' <- numberOccurrencesFrom 1 dm'
534+ (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
535+ let result0 = fmap snd children0
536+ result' = fforCheap children' $ fmap snd
537+ requests0 :: IntMap (Event t (IntMap (RequesterData request)))
538+ requests0 = fmap fst children0
539+ requests' :: Event t (p (Event t (IntMap (RequesterData request))))
540+ requests' = fforCheap children' $ fmap fst
541+ promptRequests :: Event t (IntMap (IntMap (RequesterData request)))
542+ promptRequests = coincidence $ fmapCheap (mergeInt . patchNewElements) requests' --TODO: Create a mergeIncrementalPromptly, and use that to eliminate this 'coincidence'
543+ requests <- holdIncremental requests0 requests'
544+ return (result0, result')
545+
546+{-# INLINE traverseDMapWithKeyWithAdjustRequesterTWith #-}
547+traverseDMapWithKeyWithAdjustRequesterTWith :: forall k t request response m v v' p p'.
548+ ( GCompare k
549+ , Reflex t
550+ , MonadHold t m
551+ , PatchTarget (p' (Some k) (Event t (IntMap (RequesterData request)))) ~ Map (Some k) (Event t (IntMap (RequesterData request)))
552+ , Patch (p' (Some k) (Event t (IntMap (RequesterData request))))
553+ , MonadFix m
554+ )
555+ => (forall k' v1 v2. GCompare k'
556+ => (forall a. k' a -> v1 a -> m (v2 a))
557+ -> DMap k' v1
558+ -> Event t (p k' v1)
559+ -> RequesterT t request response m (DMap k' v2, Event t (p k' v2))
560+ )
561+ -> (forall v1 v2. (forall a. v1 a -> v2 a) -> p k v1 -> p k v2)
562+ -> (forall v1 v2. (forall a. v1 a -> v2) -> p k v1 -> p' (Some k) v2)
563+ -> (forall v2. p' (Some k) v2 -> Map (Some k) v2)
564+ -> (forall a. Incremental t (p' (Some k) (Event t a)) -> Event t (Map (Some k) a))
565+ -> (forall a. k a -> v a -> RequesterT t request response m (v' a))
566+ -> DMap k v
567+ -> Event t (p k v)
568+ -> RequesterT t request response m (DMap k v', Event t (p k v'))
569+traverseDMapWithKeyWithAdjustRequesterTWith base mapPatch weakenPatchWith patchNewElements mergePatchIncremental f dm0 dm' = do
570+ rec response <- requesting' $ fmapCheap pack $ promptRequests `mappend` mergePatchIncremental requests --TODO: Investigate whether we can really get rid of the prompt stuff here
571+ let responses :: EventSelector t (Const2 (Some k) (IntMap (RequesterData response)))
572+ responses = fanMap $ fmapCheap unpack response
573+ unpack :: Entry response (Multi2 k) -> Map (Some k) (IntMap (RequesterData response))
574+ unpack = unEntry
575+ pack :: Map (Some k) (IntMap (RequesterData request)) -> Entry request (Multi2 k)
576+ pack = Entry
577+ f' :: forall a. k a -> Compose ((,) Int) v a -> m (Compose ((,) (Event t (IntMap (RequesterData request)))) v' a)
578+ f' k (Compose (n, v)) = do
579+ (result, myRequests) <- runRequesterT (f k v) $ mapMaybeCheap (IntMap.lookup n) $ select responses (Const2 (Some k))
580+ return $ Compose (fmapCheap (IntMap.singleton n) myRequests, result)
581+ ndm' <- numberOccurrencesFrom 1 dm'
582+ (children0, children') <- base f' (DMap.map (\v -> Compose (0, v)) dm0) $ fmap (\(n, dm) -> mapPatch (\v -> Compose (n, v)) dm) ndm'
583+ let result0 = DMap.map (snd . getCompose) children0
584+ result' = fforCheap children' $ mapPatch $ snd . getCompose
585+ requests0 :: Map (Some k) (Event t (IntMap (RequesterData request)))
586+ requests0 = weakenDMapWith (fst . getCompose) children0
587+ requests' :: Event t (p' (Some k) (Event t (IntMap (RequesterData request))))
588+ requests' = fforCheap children' $ weakenPatchWith $ fst . getCompose
589+ promptRequests :: Event t (Map (Some k) (IntMap (RequesterData request)))
590+ promptRequests = coincidence $ fmapCheap (mergeMap . patchNewElements) requests' --TODO: Create a mergeIncrementalPromptly, and use that to eliminate this 'coincidence'
591+ requests <- holdIncremental requests0 requests'
592+ return (result0, result')
593+
594+data Decoder rawResponse response =
595+ forall a. Decoder (RequesterDataKey a) (rawResponse -> response a)
596+
597+-- | Matches incoming responses with previously-sent requests
598+-- and uses the provided request "decoder" function to process
599+-- incoming responses.
600+matchResponsesWithRequests
601+ :: forall t rawRequest rawResponse request response m.
602+ ( MonadFix m
603+ , MonadHold t m
604+ , Reflex t
605+ )
606+ => (forall a. request a -> (rawRequest, rawResponse -> response a))
607+ -- ^ Given a request (from 'Requester'), produces the wire format of the
608+ -- request and a function used to process the associated response
609+ -> Event t (RequesterData request)
610+ -- ^ The outgoing requests
611+ -> Event t (Int, rawResponse)
612+ -- ^ The incoming responses, tagged by an identifying key
613+ -> m ( Event t (Map Int rawRequest)
614+ , Event t (RequesterData response)
615+ )
616+ -- ^ A map of outgoing wire-format requests and an event of responses keyed
617+ -- by the 'RequesterData' key of the associated outgoing request
618+matchResponsesWithRequests f send recv = do
619+ rec nextId <- hold 1 $ fmap (\(next, _, _) -> next) outgoing
620+ waitingFor :: Incremental t (PatchMap Int (Decoder rawResponse response)) <-
621+ holdIncremental mempty $ leftmost
622+ [ fmap (\(_, outstanding, _) -> outstanding) outgoing
623+ , snd <$> incoming
624+ ]
625+ let outgoing = processOutgoing nextId send
626+ incoming = processIncoming waitingFor recv
627+ return (fmap (\(_, _, rawReqs) -> rawReqs) outgoing, fst <$> incoming)
628+ where
629+ -- Tags each outgoing request with an identifying integer key
630+ -- and returns the next available key, a map of response decoders
631+ -- for requests for which there are outstanding responses, and the
632+ -- raw requests to be sent out.
633+ processOutgoing
634+ :: Behavior t Int
635+ -- The next available key
636+ -> Event t (RequesterData request)
637+ -- The outgoing request
638+ -> Event t ( Int
639+ , PatchMap Int (Decoder rawResponse response)
640+ , Map Int rawRequest )
641+ -- The new next-available-key, a map of requests expecting responses, and the tagged raw requests
642+ processOutgoing nextId out = flip pushAlways out $ \dm -> do
643+ oldNextId <- sample nextId
644+ let (result, newNextId) = flip runState oldNextId $ forM (requesterDataToList dm) $ \(k :=> v) -> do
645+ n <- get
646+ put $ succ n
647+ let (rawReq, rspF) = f v
648+ return (n, rawReq, Decoder k rspF)
649+ patchWaitingFor = PatchMap $ Map.fromList $
650+ (\(n, _, dec) -> (n, Just dec)) <$> result
651+ toSend = Map.fromList $ (\(n, rawReq, _) -> (n, rawReq)) <$> result
652+ return (newNextId, patchWaitingFor, toSend)
653+ -- Looks up the each incoming raw response in a map of response
654+ -- decoders and returns the decoded response and a patch that can
655+ -- be used to clear the ID of the consumed response out of the queue
656+ -- of expected responses.
657+ processIncoming
658+ :: Incremental t (PatchMap Int (Decoder rawResponse response))
659+ -- A map of outstanding expected responses
660+ -> Event t (Int, rawResponse)
661+ -- A incoming response paired with its identifying key
662+ -> Event t (RequesterData response, PatchMap Int v)
663+ -- The decoded response and a patch that clears the outstanding responses queue
664+ processIncoming waitingFor inc = flip push inc $ \(n, rawRsp) -> do
665+ wf <- sample $ currentIncremental waitingFor
666+ case Map.lookup n wf of
667+ Nothing -> return Nothing -- TODO How should lookup failures be handled here? They shouldn't ever happen..
668+ Just (Decoder k rspF) -> do
669+ let rsp = rspF rawRsp
670+ return $ Just
671+ ( singletonRequesterData k rsp
672+ , PatchMap $ Map.singleton n Nothing
673+ )
674+-}
src/Reflex/Requester/Class.hs+1−1
@@ -40,7 +40,7 @@ class (Reflex t, Monad m) => Requester t m | m -> t where
4040 requesting :: Event t (Request m a) -> m (Event t (Response m a))
4141 -- | Emit a request whenever the given 'Event' fires, and ignore all responses.
4242 requesting_ :: Event t (Request m a) -> m ()
43−
43+--TODO: Make Requester polykinded, where Request m and Response m both take an argument of the same kind
4444
4545instance Requester t m => Requester t (ReaderT r m) where
4646 type Request (ReaderT r m) = Request m
src/Reflex/Spider/Internal.hs+272−501
@@ -9,6 +9,7 @@
99{-# LANGUAGE GADTs #-}
1010{-# LANGUAGE GeneralizedNewtypeDeriving #-}
1111{-# LANGUAGE LambdaCase #-}
12+{-# LANGUAGE MultiWayIf #-}
1213{-# LANGUAGE RankNTypes #-}
1314{-# LANGUAGE RoleAnnotations #-}
1415{-# LANGUAGE ScopedTypeVariables #-}
@@ -19,7 +20,6 @@
1920{-# LANGUAGE DeriveFunctor #-}
2021{-# LANGUAGE StandaloneDeriving #-}
2122{-# LANGUAGE InstanceSigs #-}
22−{-# LANGUAGE MultiWayIf #-}
2323
2424#ifdef USE_REFLEX_OPTIMIZER
2525{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
@@ -38,17 +38,15 @@ import Control.Monad hiding (forM, forM_, mapM, mapM_)
3838import Control.Monad.Exception
3939import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_)
4040import Control.Monad.Primitive
41+--import Control.Monad.Reader hiding (forM, forM_, mapM, mapM_)
4142import Control.Monad.Reader.Class
4243import Control.Monad.IO.Class
4344import Control.Monad.ReaderIO
4445import Control.Monad.Ref
45−import Control.Monad.Fail (MonadFail)
46−import qualified Control.Monad.Fail as MonadFail
4746import Data.Align
4847import Data.Coerce
49−import Data.Dependent.Map (DMap)
48+import Data.Dependent.Map (DMap, DSum (..))
5049import qualified Data.Dependent.Map as DMap
51−import Data.Dependent.Sum (DSum (..))
5250import Data.FastMutableIntMap (FastMutableIntMap, PatchIntMap (..))
5351import qualified Data.FastMutableIntMap as FastMutableIntMap
5452import Data.Foldable hiding (concat, elem, sequence_)
@@ -61,13 +59,12 @@ import qualified Data.IntMap.Strict as IntMap
6159import Data.IORef
6260import Data.Kind (Type)
6361import Data.Maybe hiding (mapMaybe)
64−import Data.Monoid (mempty, (<>))
62+import Data.Monoid ((<>))
6563import Data.Proxy
6664import Data.These
6765import Data.Traversable
68−import Data.Type.Equality ((:~:)(Refl))
6966import Data.Witherable (Filterable, mapMaybe)
70−import GHC.Exts hiding (toList)
67+import GHC.Exts
7168import GHC.IORef (IORef (..))
7269import GHC.Stack
7370import Reflex.FastWeak
@@ -75,27 +72,22 @@ import System.IO.Unsafe
7572import System.Mem.Weak
7673import Unsafe.Coerce
7774
78−#ifdef MIN_VERSION_semialign
75+#if defined(MIN_VERSION_semialign)
7976#if MIN_VERSION_these(0,8,0)
8077import Data.These.Combinators (justThese)
8178#endif
82−#if MIN_VERSION_semialign(1,1,0)
83−import Data.Zip (Zip (..))
84−#endif
8579#endif
8680
8781#ifdef DEBUG_CYCLES
8882import Control.Monad.State hiding (forM, forM_, mapM, mapM_, sequence)
89−#endif
90−
9183import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
9284import qualified Data.List.NonEmpty as NonEmpty
85+import Data.Monoid (mempty)
9386import Data.Tree (Forest, Tree (..), drawForest)
94−import Data.List (isPrefixOf)
87+#endif
9588
96−import Data.FastWeakBag (FastWeakBag, FastWeakBagTicket)
89+import Data.FastWeakBag (FastWeakBag)
9790import qualified Data.FastWeakBag as FastWeakBag
98−
9991import Data.Reflection
10092import Data.Some (Some(Some))
10193import Data.Type.Coercion
@@ -106,26 +98,20 @@ import qualified Reflex.Class
10698import qualified Reflex.Class as R
10799import qualified Reflex.Host.Class
108100import Reflex.NotReady.Class
109−import Data.Patch
110−import qualified Data.Patch.DMapWithMove as PatchDMapWithMove
111−import Reflex.PerformEvent.Base (PerformEventT)
101+import Reflex.Patch
102+import qualified Reflex.Patch.DMapWithMove as PatchDMapWithMove
112103
113104#ifdef DEBUG_TRACE_EVENTS
114105import qualified Data.ByteString.Char8 as BS8
115106import System.IO (stderr)
116−import Data.List (isPrefixOf)
117107#endif
118108
119−-- TODO stdout might not be the best channel for debug output
120−debugStrLn :: String -> IO ()
121−debugStrLn = putStrLn
122−
123109#ifdef DEBUG_TRACE_EVENTS
110+
124111withStackOneLine :: (BS8.ByteString -> a) -> a
125112withStackOneLine expr = unsafePerformIO $ do
126113 stack <- currentCallStack
127− return (expr . BS8.pack . unwords . dropInternal . reverse $ stack)
128− where dropInternal = filterStack "Reflex.Spider.Internal"
114+ return (expr (BS8.pack (unwords (reverse stack))))
129115
130116#endif
131117
@@ -136,42 +122,28 @@ debugInvalidateHeight :: Bool
136122debugInvalidate :: Bool
137123
138124#ifdef DEBUG
125+
139126#define DEBUG_NODEIDS
140127
141−#ifdef DEBUG_TRACE_PROPAGATION
142128debugPropagate = True
143−#else
144−debugPropagate = False
145−#endif
146129
147−#ifdef DEBUG_TRACE_HEIGHT
148−debugInvalidateHeight = True
149−#else
150130debugInvalidateHeight = False
151−#endif
152131
153−#ifdef DEBUG_TRACE_INVALIDATION
154132debugInvalidate = True
155−#else
156−debugInvalidate = False
157−#endif
158133
159134class HasNodeId a where
160135 getNodeId :: a -> Int
161136
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
137+instance HasNodeId (Hold x p a) where
169138 getNodeId = holdNodeId
170139
140+instance HasNodeId (PushSubscribed x a b) where
141+ getNodeId = pushSubscribedNodeId
142+
171143instance HasNodeId (SwitchSubscribed x a) where
172144 getNodeId = switchSubscribedNodeId
173145
174−instance HasNodeId (FanSubscribed x v a) where
146+instance HasNodeId (FanSubscribed x a) where
175147 getNodeId = fanSubscribedNodeId
176148
177149instance HasNodeId (CoincidenceSubscribed x a) where
@@ -185,16 +157,41 @@ instance HasNodeId (Pull x a) where
185157
186158{-# INLINE showNodeId #-}
187159showNodeId :: HasNodeId a => a -> String
188−showNodeId = showNodeId' . getNodeId
189−
190−showNodeId' :: Int -> String
191−showNodeId' = ("#"<>) . show
192−
160+showNodeId = ("#"<>) . show . getNodeId
161+
162+showSubscriberType :: Subscriber x a -> String
163+showSubscriberType = \case
164+ SubscriberPush _ _ -> "SubscriberPush"
165+ SubscriberMerge _ _ -> "SubscriberMerge"
166+ SubscriberFan _ -> "SubscriberFan"
167+ SubscriberMergeChange _ -> "SubscriberMergeChange"
168+ SubscriberHold _ -> "SubscriberHold"
169+ SubscriberHoldIdentity _ -> "SubscriberHoldIdentity"
170+ SubscriberSwitch _ -> "SubscriberSwitch"
171+ SubscriberCoincidenceOuter _ -> "SubscriberCoincidenceOuter"
172+ SubscriberCoincidenceInner _ -> "SubscriberCoincidenceInner"
173+ SubscriberHandle -> "SubscriberHandle"
174+
175+showEventType :: Event x a -> String
176+showEventType = \case
177+ EventRoot _ _ -> "EventRoot"
178+ EventNever -> "EventNever"
179+ EventPush _ -> "EventPush"
180+ EventMerge _ -> "EventMerge"
181+ EventFan _ _ -> "EventFan"
182+ EventSwitch _ -> "EventSwitch"
183+ EventCoincidence _ -> "EventCoincidence"
184+ EventHold _ -> "EventHold"
185+ EventDyn _ -> "EventDyn"
186+ EventHoldIdentity _ -> "EventHoldIdentity"
187+ EventDynIdentity _ -> "EventDynIdentity"
193188
194189#else
195190
196191debugPropagate = False
192+
197193debugInvalidateHeight = False
194+
198195debugInvalidate = False
199196
200197-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
@@ -202,10 +199,6 @@ debugInvalidate = False
202199showNodeId :: a -> String
203200showNodeId _ = ""
204201
205−{-# INLINE showNodeId' #-}
206−showNodeId' :: Int -> String
207−showNodeId' _ = ""
208−
209202#endif
210203
211204#ifdef DEBUG_NODEIDS
@@ -251,9 +244,9 @@ subscribeAndRead = unEvent
251244-- caching; if the computation function is very cheap, this is (much) more
252245-- efficient than 'push'
253246{-# INLINE [1] pushCheap #-}
254−pushCheap :: HasSpiderTimeline x => (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
247+pushCheap :: (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--
@@ -346,23 +321,18 @@ cacheEvent e =
346321 subscribedTicket <- liftIO (readIORef mSubscribedRef >>= getFastWeakTicket) >>= \case
347322 Just subscribedTicket -> return subscribedTicket
348323 Nothing -> do
349−#ifdef DEBUG_NODEIDS
350− nodeId <- liftIO newNodeId
351−#endif
352324 subscribers <- liftIO FastWeakBag.empty
353325 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
357326 (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− }
327+ { subscriberPropagate = \a -> do
328+ liftIO $ writeIORef occRef $ Just a
329+ scheduleClear occRef
330+ propagateFast a subscribers
331+ , subscriberInvalidateHeight = \old -> do
332+ FastWeakBag.traverse subscribers $ invalidateSubscriberHeight old
333+ , subscriberRecalculateHeight = \new -> do
334+ FastWeakBag.traverse subscribers $ recalculateSubscriberHeight new
335+ }
366336 when (isJust occ) $ do
367337 liftIO $ writeIORef occRef occ -- Set the initial value of occRef; we don't need to do this if occ is Nothing
368338 scheduleClear occRef
@@ -370,45 +340,29 @@ cacheEvent e =
370340 { _cacheSubscribed_subscribers = subscribers
371341 , _cacheSubscribed_parent = parentSub
372342 , _cacheSubscribed_occurrence = occRef
373−#ifdef DEBUG_NODEIDS
374− , _cacheSubscribed_nodeId = nodeId
375−#endif
376343 }
377344 subscribedTicket <- liftIO $ mkFastWeakTicket subscribed
378345 liftIO $ writeIORef mSubscribedRef =<< getFastWeakTicketWeak subscribedTicket
379346 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−
347+ liftIO $ do
348+ subscribed <- getFastWeakTicketValue subscribedTicket
349+ ticket <- FastWeakBag.insert sub $ _cacheSubscribed_subscribers subscribed
350+ occ <- readIORef $ _cacheSubscribed_occurrence subscribed
351+ let es = EventSubscription
352+ { _eventSubscription_unsubscribe = do
353+ FastWeakBag.remove ticket
354+ isEmpty <- FastWeakBag.isEmpty $ _cacheSubscribed_subscribers subscribed
355+ when isEmpty $ do
356+ writeIORef mSubscribedRef emptyFastWeak
357+ unsubscribe $ _cacheSubscribed_parent subscribed
358+ touch ticket
359+ touch subscribedTicket
360+ , _eventSubscription_subscribed = EventSubscribed
361+ { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ _cacheSubscribed_parent subscribed
362+ , eventSubscribedRetained = toAny subscribedTicket
363+ }
364+ }
365+ return (es, occ)
412366
413367subscribe :: Event x a -> Subscriber x a -> EventM x (EventSubscription x)
414368subscribe e s = fst <$> subscribeAndRead e s
@@ -420,14 +374,11 @@ wrap tag getSpecificSubscribed sub = do
420374 let es = tag subd
421375 return (EventSubscription (WeakBag.remove sln >> touch sln) es, occ)
422376
423−eventRoot :: (GCompare k, HasSpiderTimeline x) => k a -> Root x k -> Event x a
377+eventRoot :: GCompare k => k a -> Root x k -> Event x a
424378eventRoot !k !r = Event $ wrap eventSubscribedRoot $ liftIO . getRootSubscribed k r
425379
426−subscribeAndReadNever :: EventM x (EventSubscription x, Maybe a)
427−subscribeAndReadNever = return (EventSubscription (return ()) eventSubscribedNever, Nothing)
428−
429380eventNever :: Event x a
430−eventNever = Event $ const subscribeAndReadNever
381+eventNever = Event $ \_ -> return (EventSubscription (return ()) eventSubscribedNever, Nothing)
431382
432383eventFan :: (GCompare k, HasSpiderTimeline x) => k a -> Fan x k v -> Event x (v a)
433384eventFan !k !f = Event $ wrap eventSubscribedFan $ getFanSubscribed k f
@@ -464,6 +415,16 @@ data Subscriber x a = Subscriber
464415 , subscriberRecalculateHeight :: !(Height -> IO ())
465416 }
466417
418+--TODO: Move this comment to WeakBag
419+-- These function are constructor functions that are marked NOINLINE so they are
420+-- opaque to GHC. If we do not do this, then GHC will sometimes fuse the constructor away
421+-- so any weak references that are attached to the constructors will have their
422+-- finalizer run. Using the opaque constructor, does not see the
423+-- constructor application, so it behaves like an IORef and cannot be fused away.
424+--
425+-- The result is also evaluated to WHNF, since forcing a thunk invalidates
426+-- the weak pointer to it in some cases.
427+
467428newSubscriberHold :: (HasSpiderTimeline x, Patch p) => Hold x p -> IO (Subscriber x p)
468429newSubscriberHold h = return $ Subscriber
469430 { subscriberPropagate = {-# SCC "traverseHold" #-} propagateSubscriberHold h
@@ -472,10 +433,10 @@ newSubscriberHold h = return $ Subscriber
472433 }
473434
474435newSubscriberFan :: 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
436+newSubscriberFan subscribed = return $ Subscriber
476437 { subscriberPropagate = \a -> {-# SCC "traverseFan" #-} do
477438 subs <- liftIO $ readIORef $ fanSubscribedSubscribers subscribed
478− tracePropagate (Proxy :: Proxy x) $ show (DMap.size subs) <> " keys subscribed, " <> show (DMap.size a) <> " keys firing"
439+ tracePropagate (Proxy :: Proxy x) $ "SubscriberFan" <> showNodeId subscribed <> ": " ++ show (DMap.size subs) ++ " keys subscribed, " ++ show (DMap.size a) ++ " keys firing"
479440 liftIO $ writeIORef (fanSubscribedOccurrence subscribed) $ Just a
480441 scheduleClear $ fanSubscribedOccurrence subscribed
481442 let f _ (Pair v subsubs) = do
@@ -484,55 +445,72 @@ newSubscriberFan subscribed = debugSubscriber ("SubscriberFan " <> showNodeId su
484445 _ <- DMap.traverseWithKey f $ DMap.intersectionWithKey (\_ -> Pair) a subs --TODO: Would be nice to have DMap.traverse_
485446 return ()
486447 , subscriberInvalidateHeight = \old -> do
448+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
487449 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
488− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
450+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
451+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
489452 , subscriberRecalculateHeight = \new -> do
453+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
490454 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
491− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
455+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
456+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
492457 }
493458
494459newSubscriberSwitch :: forall x a. HasSpiderTimeline x => SwitchSubscribed x a -> IO (Subscriber x a)
495−newSubscriberSwitch subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
460+newSubscriberSwitch subscribed = return $ Subscriber
496461 { subscriberPropagate = \a -> {-# SCC "traverseSwitch" #-} do
462+ tracePropagate (Proxy :: Proxy x) $ "SubscriberSwitch" <> showNodeId subscribed
497463 liftIO $ writeIORef (switchSubscribedOccurrence subscribed) $ Just a
498464 scheduleClear $ switchSubscribedOccurrence subscribed
499465 propagate a $ switchSubscribedSubscribers subscribed
500466 , subscriberInvalidateHeight = \_ -> do
467+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
501468 oldHeight <- readIORef $ switchSubscribedHeight subscribed
502469 when (oldHeight /= invalidHeight) $ do
503470 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
504− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
505− , subscriberRecalculateHeight = (`updateSwitchHeight` subscribed)
506− }
471+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
472+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
473+ , subscriberRecalculateHeight = \new -> do
474+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
475+ updateSwitchHeight new subscribed
476+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
477+ }
507478
508479newSubscriberCoincidenceOuter :: forall x b. HasSpiderTimeline x => CoincidenceSubscribed x b -> IO (Subscriber x (Event x b))
509−newSubscriberCoincidenceOuter subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
480+newSubscriberCoincidenceOuter subscribed = return $ Subscriber
510481 { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceOuter" #-} do
482+ tracePropagate (Proxy :: Proxy x) $ "SubscriberCoincidenceOuter" <> showNodeId subscribed
511483 outerHeight <- liftIO $ readIORef $ coincidenceSubscribedHeight subscribed
512484 tracePropagate (Proxy :: Proxy x) $ " outerHeight = " <> show outerHeight
513485 (occ, innerHeight, innerSubd) <- subscribeCoincidenceInner a outerHeight subscribed
514486 tracePropagate (Proxy :: Proxy x) $ " isJust occ = " <> show (isJust occ)
515487 tracePropagate (Proxy :: Proxy x) $ " innerHeight = " <> show innerHeight
516−
517488 liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
518489 scheduleClear $ coincidenceSubscribedInnerParent subscribed
519490 case occ of
520− Nothing ->
491+ Nothing -> do
521492 when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
522493 writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
523− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
524− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
494+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
495+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
525496 Just o -> do -- Since it's already firing, no need to adjust height
526497 liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
527498 scheduleClear $ coincidenceSubscribedOccurrence subscribed
528499 propagate o $ coincidenceSubscribedSubscribers subscribed
529− , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
530− , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
500+ , subscriberInvalidateHeight = \_ -> do
501+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
502+ invalidateCoincidenceHeight subscribed
503+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
504+ , subscriberRecalculateHeight = \_ -> do
505+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
506+ recalculateCoincidenceHeight subscribed
507+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
531508 }
532509
533510newSubscriberCoincidenceInner :: forall x a. HasSpiderTimeline x => CoincidenceSubscribed x a -> IO (Subscriber x a)
534−newSubscriberCoincidenceInner subscribed = debugSubscriber ("SubscriberCoincidenceInner" <> showNodeId subscribed) $ Subscriber
511+newSubscriberCoincidenceInner subscribed = return $ Subscriber
535512 { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceInner" #-} do
513+ tracePropagate (Proxy :: Proxy x) $ "SubscriberCoincidenceInner" <> showNodeId subscribed
536514 occ <- liftIO $ readIORef $ coincidenceSubscribedOccurrence subscribed
537515 case occ of
538516 Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
@@ -540,8 +518,14 @@ newSubscriberCoincidenceInner subscribed = debugSubscriber ("SubscriberCoinciden
540518 liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $ Just a
541519 scheduleClear $ coincidenceSubscribedOccurrence subscribed
542520 propagate a $ coincidenceSubscribedSubscribers subscribed
543− , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
544− , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
521+ , subscriberInvalidateHeight = \_ -> do
522+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
523+ invalidateCoincidenceHeight subscribed
524+ when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
525+ , subscriberRecalculateHeight = \_ -> do
526+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
527+ recalculateCoincidenceHeight subscribed
528+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
545529 }
546530
547531invalidateSubscriberHeight :: Height -> Subscriber x a -> IO ()
@@ -551,18 +535,18 @@ recalculateSubscriberHeight :: Height -> Subscriber x a -> IO ()
551535recalculateSubscriberHeight = flip subscriberRecalculateHeight
552536
553537-- | 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) $
538+propagate :: a -> WeakBag (Subscriber x a) -> EventM x ()
539+propagate a subscribers = withIncreasedDepth $ do
556540 -- 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
557541 --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
542+ WeakBag.traverse subscribers $ \s -> subscriberPropagate s a
559543
560544-- | 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) $
545+propagateFast :: a -> FastWeakBag (Subscriber x a) -> EventM x ()
546+propagateFast a subscribers = withIncreasedDepth $ do
563547 -- 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
564548 --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
549+ FastWeakBag.traverse subscribers $ \s -> subscriberPropagate s a
566550
567551--------------------------------------------------------------------------------
568552-- EventSubscribed
@@ -580,7 +564,7 @@ data EventSubscribed x = EventSubscribed
580564 { eventSubscribedHeightRef :: {-# UNPACK #-} !(IORef Height)
581565 , eventSubscribedRetained :: {-# NOUNPACK #-} !Any
582566#ifdef DEBUG_CYCLES
583− , eventSubscribedGetParents :: !(IO [EventSubscribed x]) -- For debugging loops
567+ , eventSubscribedGetParents :: !(IO [Some (EventSubscribed x)]) -- For debugging loops
584568 , eventSubscribedHasOwnHeightRef :: !Bool
585569 , eventSubscribedWhoCreated :: !(IO [String])
586570#endif
@@ -607,23 +591,13 @@ eventSubscribedNever = EventSubscribed
607591 , eventSubscribedWhoCreated = return ["never"]
608592#endif
609593 }
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− }
620594
621595eventSubscribedFan :: FanSubscribed x k v -> EventSubscribed x
622596eventSubscribedFan !subscribed = EventSubscribed
623597 { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
624598 , eventSubscribedRetained = toAny subscribed
625599#ifdef DEBUG_CYCLES
626− , eventSubscribedGetParents = return [_eventSubscription_subscribed $ fanSubscribedParent subscribed]
600+ , eventSubscribedGetParents = return [Some $ _eventSubscription_subscribed $ fanSubscribedParent subscribed]
627601 , eventSubscribedHasOwnHeightRef = False
628602 , eventSubscribedWhoCreated = whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
629603#endif
@@ -636,7 +610,7 @@ eventSubscribedSwitch !subscribed = EventSubscribed
636610#ifdef DEBUG_CYCLES
637611 , eventSubscribedGetParents = do
638612 s <- readIORef $ switchSubscribedCurrentParent subscribed
639− return [_eventSubscription_subscribed s]
613+ return [Some $ _eventSubscription_subscribed s]
640614 , eventSubscribedHasOwnHeightRef = True
641615 , eventSubscribedWhoCreated = whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
642616#endif
@@ -649,8 +623,8 @@ eventSubscribedCoincidence !subscribed = EventSubscribed
649623#ifdef DEBUG_CYCLES
650624 , eventSubscribedGetParents = do
651625 innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
652− let outerParent = _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
653− innerParents = maybeToList $ innerSubscription
626+ let outerParent = Some $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
627+ innerParents = maybeToList $ fmap Some innerSubscription
654628 return $ outerParent : innerParents
655629 , eventSubscribedHasOwnHeightRef = True
656630 , eventSubscribedWhoCreated = whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
@@ -664,15 +638,15 @@ getEventSubscribedHeight es = readIORef $ eventSubscribedHeightRef es
664638whoCreatedEventSubscribed :: EventSubscribed x -> IO [String]
665639whoCreatedEventSubscribed = eventSubscribedWhoCreated
666640
667−walkInvalidHeightParents :: EventSubscribed x -> IO [EventSubscribed x]
641+walkInvalidHeightParents :: EventSubscribed x -> IO [Some (EventSubscribed x)]
668642walkInvalidHeightParents s0 = do
669− subscribers <- flip execStateT mempty $ ($ s0) $ fix $ \loop s -> do
643+ subscribers <- flip execStateT mempty $ ($ Some s0) $ fix $ \loop (Some s) -> do
670644 h <- liftIO $ readIORef $ eventSubscribedHeightRef s
671645 when (h == invalidHeight) $ do
672646 when (eventSubscribedHasOwnHeightRef s) $ liftIO $ writeIORef (eventSubscribedHeightRef s) $! invalidHeightBeingTraversed
673− modify (s :)
647+ modify (Some s :)
674648 mapM_ loop =<< liftIO (eventSubscribedGetParents s)
675− forM_ subscribers $ \s -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
649+ forM_ subscribers $ \(Some s) -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
676650 return subscribers
677651#endif
678652
@@ -994,10 +968,8 @@ instance Monad (BehaviorM x) where
994968 BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
995969 {-# INLINE return #-}
996970 return x = BehaviorM $ return x
997−#if !MIN_VERSION_base(4,13,0)
998971 {-# INLINE fail #-}
999972 fail s = BehaviorM $ fail s
1000−#endif
1001973
1002974data BehaviorSubscribed x a
1003975 = forall p. BehaviorSubscribedHold (Hold x p)
@@ -1057,7 +1029,7 @@ data SomeMergeUpdate x = SomeMergeUpdate
10571029newtype SomeMergeInit x = SomeMergeInit { unSomeMergeInit :: EventM x () }
10581030
10591031-- 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)
1032+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
10611033
10621034newtype MergeSubscribedParent x a = MergeSubscribedParent { unMergeSubscribedParent :: EventSubscription x }
10631035
@@ -1082,8 +1054,7 @@ heightBagFromList :: [Height] -> HeightBag
10821054heightBagFromList heights = heightBagVerify $ foldl' (flip heightBagAdd) heightBagEmpty heights
10831055
10841056heightBagAdd :: Height -> HeightBag -> HeightBag
1085−heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $
1086− IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
1057+heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
10871058
10881059heightBagRemove :: Height -> HeightBag -> HeightBag
10891060heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.lookup h c of
@@ -1092,13 +1063,6 @@ heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.loo
10921063 0 -> IntMap.delete h c
10931064 _ -> IntMap.insert h (pred old) c
10941065
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−
11021066heightBagMax :: HeightBag -> Height
11031067heightBagMax (HeightBag _ c) = case IntMap.maxViewWithKey c of
11041068 Just ((h, _), _) -> Height h
@@ -1199,10 +1163,7 @@ instance HasSpiderTimeline x => Semialign (Event x) where
11991163 align ea eb = mapMaybe dmapToThese $ mergeG coerce $ dynamicConst $
12001164 DMap.fromDistinctAscList [LeftTag :=> ea, RightTag :=> eb]
12011165
1202−#ifdef MIN_VERSION_semialign
1203−#if MIN_VERSION_semialign(1,1,0)
1204−instance HasSpiderTimeline x => Zip (Event x) where
1205−#endif
1166+#if defined(MIN_VERSION_semialign)
12061167 zip x y = mapMaybe justThese $ align x y
12071168#endif
12081169
@@ -1346,110 +1307,55 @@ mkWeakPtrWithDebug x debugNote = do
13461307 x' <- evaluate x
13471308 mkWeakPtr x' $
13481309 if debugFinalize
1349− then Just $ debugStrLn $ "finalizing: " ++ debugNote
1310+ then Just $ putStrLn $ "finalizing: " ++ debugNote
13501311 else Nothing
13511312
13521313type WeakList a = [Weak a]
13531314
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−
13811315{-# 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
1316+#ifdef DEBUG
1317+withIncreasedDepth :: CanTrace x m => m a -> m a
1318+withIncreasedDepth a = do
1319+ spiderTimeline <- askSpiderTimelineEnv
1320+ liftIO $ modifyIORef' (_spiderTimeline_depth (unSTE spiderTimeline)) succ
13851321 result <- a
1386− liftIO $ modifyIORef' (_spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)) pred
1322+ liftIO $ modifyIORef' (_spiderTimeline_depth (unSTE spiderTimeline)) pred
13871323 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−
14121324#else
1325+withIncreasedDepth :: m a -> m a
1326+withIncreasedDepth = id
1327+#endif
14131328
1414−{-# INLINE withIncreasedDepth #-}
1415−withIncreasedDepth :: proxy x -> m a -> m a
1416−withIncreasedDepth _ = id
1329+type CanTrace x m = (HasSpiderTimeline x, MonadIO m)
14171330
14181331{-# INLINE tracePropagate #-}
14191332tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1420−tracePropagate _ _ = return ()
1333+tracePropagate p = traceWhen p debugPropagate
14211334
14221335{-# INLINE traceInvalidate #-}
14231336traceInvalidate :: String -> IO ()
1424−traceInvalidate _ = return ()
1425−
1426−{-# INLINE traceInvalidateHeight #-}
1427−traceInvalidateHeight :: String -> IO ()
1428−traceInvalidateHeight _ = return ()
1429−
1430−{-# INLINE debugSubscriber #-}
1431−debugSubscriber :: String -> Subscriber x a -> IO (Subscriber x a)
1432−debugSubscriber _ = return
1433−
1434−{-# INLINE debugSubscriber' #-}
1435−debugSubscriber' :: String -> Subscriber x a -> Subscriber x a
1436−debugSubscriber' _ = id
1437−
1438−
1337+traceInvalidate = when debugInvalidate . liftIO . putStrLn
14391338
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 ()
1339+{-# INLINE traceWhen #-}
1340+traceWhen :: (CanTrace x m) => proxy x -> Bool -> String -> m ()
1341+traceWhen p b message = traceMWhen p b $ return message
14471342
1343+{-# INLINE traceMWhen #-}
1344+traceMWhen :: (CanTrace x m) => proxy x -> Bool -> m String -> m ()
1345+traceMWhen _ b getMessage = when b $ do
1346+ message <- getMessage
1347+#ifdef DEBUG
1348+ spiderTimeline <- askSpiderTimelineEnv
1349+ d <- liftIO $ readIORef $ _spiderTimeline_depth $ unSTE spiderTimeline
1350+#else
1351+ let d = 0
14481352#endif
1353+ liftIO $ putStrLn $ replicate d ' ' <> message
14491354
14501355whoCreatedIORef :: IORef a -> IO [String]
14511356whoCreatedIORef (IORef a) = whoCreated $! a
14521357
1358+#ifdef DEBUG_CYCLES
14531359groupByHead :: Eq a => [NonEmpty a] -> [(a, NonEmpty [a])]
14541360groupByHead = \case
14551361 [] -> []
@@ -1460,54 +1366,20 @@ groupByHead = \case
14601366 | otherwise -> (x, xs :| []) : l
14611367
14621368listsToForest :: 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−
1369+listsToForest l = fmap (\(a, l') -> Node a $ listsToForest $ toList l') $ groupByHead $ catMaybes $ fmap nonEmpty l
14951370#endif
14961371
1497−
14981372{-# INLINE propagateSubscriberHold #-}
14991373propagateSubscriberHold :: forall x p. (HasSpiderTimeline x, Patch p) => Hold x p -> p -> EventM x ()
15001374propagateSubscriberHold h a = do
1501− {-# SCC "trace" #-} when debugPropagate $ traceM (Proxy :: Proxy x) $ liftIO $ do
1375+ {-# SCC "trace" #-} traceMWhen (Proxy :: Proxy x) debugPropagate $ liftIO $ do
15021376 invalidators <- liftIO $ readIORef $ holdInvalidators h
15031377 return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
1504−
15051378 v <- {-# SCC "read" #-} liftIO $ readIORef $ holdValue h
15061379 case {-# SCC "apply" #-} apply a v of
15071380 Nothing -> return ()
15081381 Just v' -> do
1509− {-# SCC "trace2" #-} withIncreasedDepth (Proxy :: Proxy x) $
1510− tracePropagate (Proxy :: Proxy x) ("propagateSubscriberHold: assigning Hold" <> showNodeId h)
1382+ {-# SCC "trace2" #-} withIncreasedDepth $ tracePropagate (Proxy :: Proxy x) $ "propagateSubscriberHold: assigning Hold" <> showNodeId h
15111383 vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
15121384 iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
15131385 defer $ {-# SCC "assignment" #-} SomeAssignment vRef iRef v'
@@ -1561,7 +1433,7 @@ getDynHold d = do
15611433zeroRef :: IORef Height
15621434zeroRef = unsafePerformIO $ newIORef zeroHeight
15631435
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)
1436+getRootSubscribed :: GCompare k => k a -> Root x k -> Subscriber x a -> IO (WeakBagTicket, RootSubscribed x a, Maybe a)
15651437getRootSubscribed k r sub = do
15661438 mSubscribed <- readIORef $ rootSubscribed r
15671439 let getOcc = fmap (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
@@ -1575,9 +1447,7 @@ getRootSubscribed k r sub = do
15751447 let !cached = rootSubscribed r
15761448 uninitRef <- newIORef $ error "getRootsubscribed: uninitRef not initialized"
15771449 (subs, sln) <- WeakBag.singleton sub weakSelf cleanupRootSubscribed
1578−
1579− tracePropagate (Proxy::Proxy x) $ "getRootSubscribed: calling rootInit"
1580−
1450+ when debugPropagate $ putStrLn $ "getRootSubscribed: calling rootInit"
15811451 uninit <- rootInit r k $ RootTrigger (subs, rootOccurrence r, k)
15821452 writeIORef uninitRef $! uninit
15831453#ifdef DEBUG_NODEIDS
@@ -1627,9 +1497,6 @@ data FanInt x a = FanInt
16271497 { _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
16281498 , _fanInt_subscriptionRef :: {-# UNPACK #-} !(IORef (EventSubscription x)) -- This should have a valid subscription iff subscribers is non-empty
16291499 , _fanInt_occRef :: {-# UNPACK #-} !(IORef (IntMap a))
1630−#ifdef DEBUG_NODEIDS
1631− , _fanInt_nodeId :: {-# UNPACK #-} !Int
1632−#endif
16331500 }
16341501
16351502newFanInt :: IO (FanInt x a)
@@ -1637,16 +1504,10 @@ newFanInt = do
16371504 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
16381505 subscriptionRef <- newIORef $ error "fanInt: no subscription"
16391506 occRef <- newIORef $ error "fanInt: no occurrence"
1640−#ifdef DEBUG_NODEIDS
1641− nodeId <- newNodeId
1642−#endif
16431507 return $ FanInt
16441508 { _fanInt_subscribers = subscribers
16451509 , _fanInt_subscriptionRef = subscriptionRef
16461510 , _fanInt_occRef = occRef
1647−#ifdef DEBUG_NODEIDS
1648− , _fanInt_nodeId = nodeId
1649−#endif
16501511 }
16511512
16521513fanInt :: HasSpiderTimeline x => Event x (IntMap a) -> EventSelectorInt x a
@@ -1655,21 +1516,20 @@ fanInt p = unsafePerformIO $ do
16551516 pure $ EventSelectorInt $ \k -> Event $ \sub -> do
16561517 isEmpty <- liftIO $ FastMutableIntMap.isEmpty (_fanInt_subscribers self)
16571518 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
1519+ (subscription, parentOcc) <- subscribeAndRead p $ Subscriber
16601520 { subscriberPropagate = \m -> do
16611521 liftIO $ writeIORef (_fanInt_occRef self) m
16621522 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 ->
1523+ FastMutableIntMap.forIntersectionWithImmutable_ (_fanInt_subscribers self) m $ \b v -> do --TODO: Do we need to know that no subscribers are being added as we traverse?
1524+ FastWeakBag.traverse b $ \s -> do
16651525 subscriberPropagate s v
1666− , subscriberInvalidateHeight = \old ->
1667− FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1668− FastWeakBag.traverse_ b $ \s ->
1526+ , subscriberInvalidateHeight = \old -> do
1527+ FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b -> do
1528+ FastWeakBag.traverse b $ \s -> do
16691529 subscriberInvalidateHeight s old
1670− , subscriberRecalculateHeight = \new ->
1671− FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1672− FastWeakBag.traverse_ b $ \s ->
1530+ , subscriberRecalculateHeight = \new -> do
1531+ FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b -> do
1532+ FastWeakBag.traverse b $ \s -> do
16731533 subscriberRecalculateHeight s new
16741534 }
16751535 liftIO $ do
@@ -1683,25 +1543,10 @@ fanInt p = unsafePerformIO $ do
16831543 FastMutableIntMap.insert (_fanInt_subscribers self) k b
16841544 return b
16851545 Just b -> return b
1686− ticket <- liftIO $ FastWeakBag.insert sub b
1546+ t <- liftIO $ FastWeakBag.insert sub b
16871547 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−
1548+ (EventSubscription _ (EventSubscribed !heightRef _)) <- readIORef (_fanInt_subscriptionRef self)
1549+ return (EventSubscription (FastWeakBag.remove t) $! EventSubscribed heightRef $! toAny (_fanInt_subscriptionRef self, t), IntMap.lookup k currentOcc)
17051550
17061551{-# INLINABLE getFanSubscribed #-}
17071552getFanSubscribed :: (HasSpiderTimeline x, GCompare k) => k a -> Fan x k v -> Subscriber x (v a) -> EventM x (WeakBagTicket, FanSubscribed x k v, Maybe (v a))
@@ -1899,7 +1744,7 @@ mergeCheap
18991744 => (forall a. q a -> Event x (v a))
19001745 -> DynamicS x (PatchDMap k q)
19011746 -> Event x (DMap k v)
1902−mergeCheap nt = mergeGCheap' unMergeSubscribedParent getInitialSubscribers updateMe destroy
1747+mergeCheap nt = mergeGCheap' getInitialSubscribers updateMe destroy
19031748 where
19041749 updateMe :: MergeUpdateFunc k v x (PatchDMap k q) (MergeSubscribedParent x)
19051750 updateMe subscriber heightBagRef oldParents (PatchDMap p) = do
@@ -1914,9 +1759,7 @@ mergeCheap nt = mergeGCheap' unMergeSubscribedParent getInitialSubscribers updat
19141759 liftIO $ modifyIORef' heightBagRef $ heightBagAdd newParentHeight
19151760 return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
19161761 forM_ mOldSubd $ \oldSubd -> do
1917− oldHeight <- liftIO $ getEventSubscribedHeight $
1918− _eventSubscription_subscribed $ unMergeSubscribedParent oldSubd
1919−
1762+ oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $ unMergeSubscribedParent oldSubd
19201763 liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
19211764 return (maybeToList (unMergeSubscribedParent <$> mOldSubd) ++ subscriptionsToKill, newPs)
19221765 foldM f ([], oldParents) $ DMap.toList p
@@ -1941,7 +1784,7 @@ mergeCheapWithMove :: forall k x v q. (HasSpiderTimeline x, GCompare k)
19411784 => (forall a. q a -> Event x (v a))
19421785 -> DynamicS x (PatchDMapWithMove k q)
19431786 -> Event x (DMap k v)
1944−mergeCheapWithMove nt = mergeGCheap' _mergeSubscribedParentWithMove_subscription getInitialSubscribers updateMe destroy
1787+mergeCheapWithMove nt = mergeGCheap' getInitialSubscribers updateMe destroy
19451788 where
19461789 updateMe :: MergeUpdateFunc k v x (PatchDMapWithMove k q) (MergeSubscribedParentWithMove x k)
19471790 updateMe subscriber heightBagRef oldParents p = do
@@ -1960,17 +1803,13 @@ mergeCheapWithMove nt = mergeGCheap' _mergeSubscribedParentWithMove_subscription
19601803 let moveOrDelete :: forall a. k a -> PatchDMapWithMove.NodeInfo k q a -> MergeSubscribedParentWithMove x k a -> Constant (EventM x (Maybe (EventSubscription x))) a
19611804 moveOrDelete _ ni parent = Constant $ case getComposeMaybe $ PatchDMapWithMove._nodeInfo_to ni of
19621805 Nothing -> do
1963− oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $
1964− _mergeSubscribedParentWithMove_subscription parent
1965−
1806+ oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $ _mergeSubscribedParentWithMove_subscription parent
19661807 liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
19671808 return $ Just $ _mergeSubscribedParentWithMove_subscription parent
19681809 Just toKey -> do
19691810 liftIO $ writeIORef (_mergeSubscribedParentWithMove_key parent) $! toKey
19701811 return Nothing
1971− toDelete <- fmap catMaybes $ mapM (\(_ :=> v) -> getConstant v) $ DMap.toList $
1972− DMap.intersectionWithKey moveOrDelete (unPatchDMapWithMove p) oldParents
1973−
1812+ toDelete <- fmap catMaybes $ mapM (\(_ :=> v) -> getConstant v) $ DMap.toList $ DMap.intersectionWithKey moveOrDelete (unPatchDMapWithMove p) oldParents
19741813 return (toDelete, applyAlways p' oldParents)
19751814 getInitialSubscribers :: MergeInitFunc k v q x (MergeSubscribedParentWithMove x k)
19761815 getInitialSubscribers initialParents subscriber = do
@@ -1995,8 +1834,6 @@ type MergeUpdateFunc k v x p s
19951834 -> p
19961835 -> EventM x ([EventSubscription x], DMap k s)
19971836
1998−type MergeGetSubscription x s = forall a. s a -> EventSubscription x
1999−
20001837type MergeInitFunc k v q x s
20011838 = DMap k q
20021839 -> (forall a. EventM x (k a) -> Subscriber x (v a))
@@ -2020,17 +1857,14 @@ invalidateMergeHeight m = invalidateMergeHeight' (_merge_heightRef m) (_merge_su
20201857invalidateMergeHeight' :: IORef Height -> Subscriber x a -> IO ()
20211858invalidateMergeHeight' heightRef sub = do
20221859 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
1860+ 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
20251861 writeIORef heightRef $! invalidHeight
20261862 subscriberInvalidateHeight sub oldHeight
20271863
20281864revalidateMergeHeight :: Merge x k v s -> IO ()
20291865revalidateMergeHeight m = do
20301866 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
1867+ when (currentHeight == invalidHeight) $ do -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
20341868 heights <- readIORef $ _merge_heightBagRef m
20351869 parents <- readIORef $ _merge_parentsRef m
20361870 -- When the number of heights in the bag reaches the number of parents, we should have a valid height
@@ -2038,7 +1872,7 @@ revalidateMergeHeight m = do
20381872 LT -> return ()
20391873 EQ -> do
20401874 let height = succHeight $ heightBagMax heights
2041− traceInvalidateHeight $ "recalculateSubscriberHeight: height: " <> show height
1875+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: height: " <> show height
20421876 writeIORef (_merge_heightRef m) $! height
20431877 subscriberRecalculateHeight (_merge_sub m) height
20441878 GT -> error $ "revalidateMergeHeight: more heights (" <> show (heightBagSize heights) <> ") than parents (" <> show (DMap.size parents) <> ") for Merge"
@@ -2046,45 +1880,36 @@ revalidateMergeHeight m = do
20461880scheduleMergeSelf :: HasSpiderTimeline x => Merge x k v s -> Height -> EventM x ()
20471881scheduleMergeSelf m height = scheduleMerge' height (_merge_heightRef m) $ do
20481882 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
1883+ 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
20521884 --TODO: Assert that m is not empty
20531885 subscriberPropagate (_merge_sub m) vals
20541886
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
1887+mergeSubscriber :: forall x k v s a. (HasSpiderTimeline x, GCompare k) => Merge x k v s -> EventM x (k a) -> Subscriber x (v a)
1888+mergeSubscriber m getKey = Subscriber
20781889 { subscriberPropagate = \a -> do
20791890 oldM <- liftIO $ readIORef $ _merge_accumRef m
20801891 k <- getKey
2081− let newM = DMap.insertWith (error "Same key fired multiple times for Merge") k a oldM
1892+ let newM = DMap.insertWith (error $ "Same key fired multiple times for Merge") k a oldM
20821893 tracePropagate (Proxy :: Proxy x) $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
20831894 liftIO $ writeIORef (_merge_accumRef m) $! newM
20841895 when (DMap.null oldM) $ do -- Only schedule the firing once
20851896 height <- liftIO $ readIORef $ _merge_heightRef m
2086− checkCycle subscribed
2087−
1897+ --TODO: assertions about height
1898+ currentHeight <- getCurrentHeight
1899+ when (height <= currentHeight) $ do
1900+ if height /= invalidHeight
1901+ then do
1902+ myStack <- liftIO $ whoCreatedIORef undefined --TODO
1903+ error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
1904+ else liftIO $ do
1905+#ifdef DEBUG_CYCLES
1906+ nodesInvolvedInCycle <- walkInvalidHeightParents $ eventSubscribedMerge subscribed
1907+ stacks <- forM nodesInvolvedInCycle $ \(Some es) -> whoCreatedEventSubscribed es
1908+ let cycleInfo = ":\n" <> drawForest (listsToForest stacks)
1909+#else
1910+ let cycleInfo = ""
1911+#endif
1912+ error $ "Causality loop found" <> cycleInfo
20881913 scheduleMergeSelf m height
20891914 , subscriberInvalidateHeight = \old -> do --TODO: When removing a parent doesn't actually change the height, maybe we can avoid invalidating
20901915 modifyIORef' (_merge_heightBagRef m) $ heightBagRemove old
@@ -2095,45 +1920,31 @@ mergeSubscriber subscribed m getKey = Subscriber
20951920 }
20961921
20971922--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)
1923+updateMerge :: (HasSpiderTimeline x, GCompare k) => Merge x k v s -> MergeUpdateFunc k v x p s -> p -> SomeMergeUpdate x
1924+updateMerge m updateFunc p = SomeMergeUpdate updateMe (invalidateMergeHeight m) (revalidateMergeHeight m)
21001925 where updateMe = do
21011926 oldParents <- liftIO $ readIORef $ _merge_parentsRef m
2102− (subscriptionsToKill, newParents) <- updateFunc (mergeSubscriber subscribed m) (_merge_heightBagRef m) oldParents p
1927+ (subscriptionsToKill, newParents) <- updateFunc (mergeSubscriber m) (_merge_heightBagRef m) oldParents p
21031928 liftIO $ writeIORef (_merge_parentsRef m) $! newParents
21041929 return subscriptionsToKill
21051930
21061931{-# INLINE mergeGCheap' #-}
21071932mergeGCheap' :: 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
1933+ => MergeInitFunc k v q x s -> MergeUpdateFunc k v x p s -> MergeDestroyFunc k s -> DynamicS x p -> Event x (DMap k v)
1934+mergeGCheap' getInitialSubscribers updateFunc destroy d = Event $ \sub -> do
21101935 initialParents <- readBehaviorUntracked $ dynamicCurrent d
21111936 accumRef <- liftIO $ newIORef $ error "merge: accumRef not yet initialized"
21121937 heightRef <- liftIO $ newIORef $ error "merge: heightRef not yet initialized"
21131938 heightBagRef <- liftIO $ newIORef $ error "merge: heightBagRef not yet initialized"
21141939 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
1940+ let m = Merge
21301941 { _merge_parentsRef = parentsRef
21311942 , _merge_heightBagRef = heightBagRef
21321943 , _merge_heightRef = heightRef
21331944 , _merge_sub = sub
21341945 , _merge_accumRef = accumRef
21351946 }
2136− (dm, heights, initialParentState) <- getInitialSubscribers initialParents $ mergeSubscriber subscribed m
1947+ (dm, heights, initialParentState) <- getInitialSubscribers initialParents $ mergeSubscriber m
21371948 let myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
21381949 myHeight = if invalidHeight `elem` heights
21391950 then invalidHeight
@@ -2142,29 +1953,31 @@ mergeGCheap' getParent getInitialSubscribers updateFunc destroy d = Event $ \sub
21421953 let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
21431954 then (if DMap.null dm then Nothing else Just dm, DMap.empty)
21441955 else (Nothing, dm)
2145− unless (DMap.null accum) $ scheduleMergeSelf m myHeight
1956+ unless (DMap.null accum) $ do
1957+ scheduleMergeSelf m myHeight
21461958 liftIO $ writeIORef accumRef $! accum
21471959 liftIO $ writeIORef heightRef $! myHeight
21481960 liftIO $ writeIORef heightBagRef $! myHeightBag
1961+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
21491962 liftIO $ writeIORef parentsRef $! initialParentState
21501963 defer $ SomeMergeInit $ do
2151− let changeSubscriber = Subscriber
1964+ let s = Subscriber
21521965 { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
2153− tracePropagate (Proxy :: Proxy x) "SubscriberMerge/Change"
2154− defer $ updateMerge subscribed m updateFunc a
1966+ tracePropagate (Proxy :: Proxy x) $ "SubscriberMerge/Change"
1967+ defer $ updateMerge m updateFunc a
21551968 , subscriberInvalidateHeight = \_ -> return ()
21561969 , subscriberRecalculateHeight = \_ -> return ()
21571970 }
2158− (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) changeSubscriber
2159− forM_ change $ \c -> defer $ updateMerge subscribed m updateFunc c
1971+ (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) s
1972+ forM_ change $ \c -> defer $ updateMerge m updateFunc c
21601973 -- We explicitly hold on to the unsubscribe function from subscribing to the update event.
21611974 -- If we don't do this, there are certain cases where mergeCheap will fail to properly retain
21621975 -- its subscription.
2163− liftIO $ writeIORef changeSubdRef (changeSubscriber, changeSubscription)
1976+ liftIO $ writeIORef changeSubdRef (s, changeSubscription)
21641977 let unsubscribeAll = destroy =<< readIORef parentsRef
2165−
2166− return (EventSubscription unsubscribeAll subscribed, occ)
2167−
1978+ return ( EventSubscription unsubscribeAll $ EventSubscribed heightRef $ toAny (parentsRef, changeSubdRef)
1979+ , occ
1980+ )
21681981
21691982mergeInt :: forall x a. (HasSpiderTimeline x) => DynamicS x (PatchIntMap (Event x a)) -> Event x (IntMap a)
21701983mergeInt = cacheEvent . mergeIntCheap
@@ -2177,22 +1990,13 @@ mergeIntCheap d = Event $ \sub -> do
21771990 heightRef <- liftIO $ newIORef zeroHeight
21781991 heightBagRef <- liftIO $ newIORef heightBagEmpty
21791992 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− }
21901993 let scheduleSelf = do
21911994 height <- liftIO $ readIORef $ heightRef
21921995 scheduleMerge' height heightRef $ do
21931996 vals <- liftIO $ FastMutableIntMap.getFrozenAndClear accum
21941997 subscriberPropagate sub vals
2195− invalidateMyHeight = invalidateMergeHeight' heightRef sub
1998+ invalidateMyHeight = do
1999+ invalidateMergeHeight' heightRef sub
21962000 recalculateMyHeight = do
21972001 currentHeight <- readIORef heightRef
21982002 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 +2006,12 @@ mergeIntCheap d = Event $ \sub -> do
22022006 LT -> return ()
22032007 EQ -> do
22042008 let height = succHeight $ heightBagMax heights
2205− traceInvalidateHeight $ "recalculateSubscriberHeight: height: " <> show height
2009+ when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: height: " <> show height
22062010 writeIORef heightRef $! height
22072011 subscriberRecalculateHeight sub height
22082012 GT -> error $ "revalidateMergeHeight: more heights (" <> show (heightBagSize heights) <> ") than parents (" <> show numParents <> ") for Merge"
22092013 mySubscriber k = Subscriber
22102014 { subscriberPropagate = \a -> do
2211− checkCycle subscribed
2212−
22132015 wasEmpty <- liftIO $ FastMutableIntMap.isEmpty accum
22142016 liftIO $ FastMutableIntMap.insert accum k a
22152017 when wasEmpty scheduleSelf
@@ -2243,6 +2045,7 @@ mergeIntCheap d = Event $ \sub -> do
22432045 else liftIO $ Just <$> FastMutableIntMap.getFrozenAndClear accum
22442046 else do when (not isEmpty) scheduleSelf -- We have things accumulated, but we shouldn't have fired them yet
22452047 return Nothing
2048+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
22462049 defer $ SomeMergeInit $ do
22472050 let updateMe a = SomeMergeUpdate u invalidateMyHeight recalculateMyHeight
22482051 where
@@ -2256,27 +2059,25 @@ mergeIntCheap d = Event $ \sub -> do
22562059 oldParents <- liftIO $ FastMutableIntMap.applyPatch parents newSubscriptions
22572060 liftIO $ for_ oldParents $ \oldParent -> do
22582061 oldParentHeight <- getEventSubscribedHeight $ _eventSubscription_subscribed oldParent
2259−
2260− print ("updateMe", oldParentHeight)
22612062 modifyIORef' heightBagRef $ heightBagRemove oldParentHeight
22622063 return $ IntMap.elems oldParents
2263− let changeSubscriber = Subscriber
2064+ let s = Subscriber
22642065 { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
22652066 tracePropagate (Proxy :: Proxy x) $ "SubscriberMergeInt/Change"
22662067 defer $ updateMe a
22672068 , subscriberInvalidateHeight = \_ -> return ()
22682069 , subscriberRecalculateHeight = \_ -> return ()
22692070 }
2270− (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) changeSubscriber
2071+ (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) s
22712072 forM_ change $ \c -> defer $ updateMe c
22722073 -- We explicitly hold on to the unsubscribe function from subscribing to the update event.
22732074 -- If we don't do this, there are certain cases where mergeCheap will fail to properly retain
22742075 -- its subscription.
2275− liftIO $ writeIORef changeSubdRef (changeSubscriber, changeSubscription)
2076+ liftIO $ writeIORef changeSubdRef (s, changeSubscription)
22762077 let unsubscribeAll = traverse_ unsubscribe =<< FastMutableIntMap.getFrozenAndClear parents
2277−
2278−
2279− return (EventSubscription unsubscribeAll subscribed, occ)
2078+ return ( EventSubscription unsubscribeAll $ EventSubscribed heightRef $ toAny (parents, changeSubdRef)
2079+ , occ
2080+ )
22802081
22812082newtype EventSelector x k = EventSelector { select :: forall a. k a -> Event x a }
22822083newtype EventSelectorG x k v = EventSelectorG { selectG :: forall a. k a -> Event x (v a) }
@@ -2359,19 +2160,19 @@ runFrame a = SpiderHost $ do
23592160 coincidenceInfos <- readIORef $ eventEnvResetCoincidences env
23602161 forM_ toAssign $ \(SomeAssignment vRef iRef v) -> {-# SCC "assignment" #-} do
23612162 writeIORef vRef v
2362− traceInvalidate $ "Invalidating Hold"
2163+ when debugInvalidate $ putStrLn $ "Invalidating Hold"
23632164 writeIORef iRef =<< evaluate =<< invalidate toReconnectRef =<< readIORef iRef
23642165 mergeUpdates <- readIORef $ eventEnvMergeUpdates env
23652166 writeIORef (eventEnvMergeUpdates env) []
2366− tracePropagate (Proxy::Proxy x) $ "Updating merges"
2167+ when debugPropagate $ putStrLn "Updating merges"
23672168 mergeSubscriptionsToKill <- runEventM $ concat <$> mapM _someMergeUpdate_update mergeUpdates
2368− tracePropagate (Proxy::Proxy x) $ "Updating merges done"
2169+ when debugPropagate $ putStrLn "Updating merges done"
23692170 toReconnect <- readIORef toReconnectRef
23702171 clearEventEnv env
23712172 switchSubscriptionsToKill <- forM toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
23722173 oldSubscription <- readIORef $ switchSubscribedCurrentParent subscribed
23732174 wi <- readIORef $ switchSubscribedOwnWeakInvalidator subscribed
2374− traceInvalidate $ "Finalizing invalidator for Switch" <> showNodeId subscribed
2175+ when debugInvalidate $ putStrLn $ "Finalizing invalidator for Switch" <> showNodeId subscribed
23752176 finalize wi
23762177 i <- evaluate $ switchSubscribedOwnInvalidator subscribed
23772178 wi' <- mkWeakPtrWithDebug i "wi'"
@@ -2385,7 +2186,7 @@ runFrame a = SpiderHost $ do
23852186 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
23862187 {-
23872188 stackTrace <- liftIO $ fmap renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
2388− liftIO $ debugStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
2189+ liftIO $ putStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
23892190 EventRoot _ -> "EventRoot"
23902191 EventNever -> "EventNever"
23912192 _ -> "something else"
@@ -2400,7 +2201,7 @@ runFrame a = SpiderHost $ do
24002201 myHeight <- readIORef $ switchSubscribedHeight subscribed
24012202 when (parentHeight /= myHeight) $ do
24022203 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
2403− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
2204+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
24042205 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
24052206 forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
24062207 unsubscribe subscription
@@ -2441,7 +2242,7 @@ invalidateCoincidenceHeight subscribed = do
24412242 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
24422243 when (oldHeight /= invalidHeight) $ do
24432244 writeIORef (coincidenceSubscribedHeight subscribed) $! invalidHeight
2444− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
2245+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
24452246
24462247updateSwitchHeight :: Height -> SwitchSubscribed x a -> IO ()
24472248updateSwitchHeight new subscribed = do
@@ -2449,7 +2250,7 @@ updateSwitchHeight new subscribed = do
24492250 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24502251 when (new /= invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24512252 writeIORef (switchSubscribedHeight subscribed) $! new
2452− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
2253+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
24532254
24542255recalculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
24552256recalculateCoincidenceHeight subscribed = do
@@ -2458,7 +2259,7 @@ recalculateCoincidenceHeight subscribed = do
24582259 height <- calculateCoincidenceHeight subscribed
24592260 when (height /= invalidHeight) $ do
24602261 writeIORef (coincidenceSubscribedHeight subscribed) $! height
2461− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
2262+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
24622263
24632264calculateSwitchHeight :: SwitchSubscribed x a -> IO Height
24642265calculateSwitchHeight subscribed = getEventSubscribedHeight . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
@@ -2520,8 +2321,6 @@ instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Event
25202321 {-# INLINABLE headE #-}
25212322 headE = R.slowHeadE
25222323-- headE (SpiderEvent e) = SpiderEvent <$> Reflex.Spider.Internal.headE e
2523− {-# INLINABLE now #-}
2524− now = nowSpiderEventM
25252324
25262325instance Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPullM x) where
25272326 {-# INLINABLE sample #-}
@@ -2543,9 +2342,6 @@ instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Spide
25432342 {-# INLINABLE headE #-}
25442343 headE = R.slowHeadE
25452344-- headE (SpiderEvent e) = SpiderPushM $ SpiderEvent <$> Reflex.Spider.Internal.headE e
2546− {-# INLINABLE now #-}
2547− now = SpiderPushM nowSpiderEventM
2548−
25492345
25502346instance HasSpiderTimeline x => Monad (Reflex.Class.Dynamic (SpiderTimeline x)) where
25512347 {-# INLINE return #-}
@@ -2554,10 +2350,8 @@ instance HasSpiderTimeline x => Monad (Reflex.Class.Dynamic (SpiderTimeline x))
25542350 x >>= f = SpiderDynamic $ dynamicDynIdentity $ newJoinDyn $ newMapDyn (unSpiderDynamic . f) $ unSpiderDynamic x
25552351 {-# INLINE (>>) #-}
25562352 (>>) = (*>)
2557−#if !MIN_VERSION_base(4,13,0)
25582353 {-# INLINE fail #-}
25592354 fail _ = error "Dynamic does not support 'fail'"
2560−#endif
25612355
25622356{-# INLINABLE newJoinDyn #-}
25632357newJoinDyn :: HasSpiderTimeline x => DynamicS x (Identity (DynamicS x (Identity a))) -> Reflex.Spider.Internal.Dyn x (Identity a)
@@ -2609,9 +2403,6 @@ instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Spide
26092403 buildDynamic getV0 e = runFrame . runSpiderHostFrame $ Reflex.Class.buildDynamic getV0 e
26102404 {-# INLINABLE headE #-}
26112405 headE e = runFrame . runSpiderHostFrame $ Reflex.Class.headE e
2612− {-# INLINABLE now #-}
2613− now = runFrame . runSpiderHostFrame $ Reflex.Class.now
2614−
26152406
26162407instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHostFrame x) where
26172408 sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
@@ -2628,8 +2419,6 @@ instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Spide
26282419 {-# INLINABLE headE #-}
26292420 headE = R.slowHeadE
26302421-- headE (SpiderEvent e) = SpiderHostFrame $ SpiderEvent <$> Reflex.Spider.Internal.headE e
2631− {-# INLINABLE now #-}
2632− now = SpiderHostFrame Reflex.Class.now
26332422
26342423instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHost x) where
26352424 {-# INLINABLE sample #-}
@@ -2650,8 +2439,6 @@ instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Refle
26502439 buildDynamic getV0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.buildDynamic getV0 e
26512440 {-# INLINABLE headE #-}
26522441 headE e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.headE e
2653− {-# INLINABLE now #-}
2654− now = Reflex.Spider.Internal.ReadPhase Reflex.Class.now
26552442
26562443--------------------------------------------------------------------------------
26572444-- Deprecated items
@@ -2689,13 +2476,13 @@ instance HasSpiderTimeline x => Reflex.Host.Class.MonadReadEvent (SpiderTimeline
26892476 touch h
26902477 return result
26912478
2692−instance HasSpiderTimeline x => Reflex.Host.Class.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHost x) where
2479+instance Reflex.Host.Class.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHost x) where
26932480 newEventWithTrigger = SpiderHost . fmap SpiderEvent . newEventWithTriggerIO
26942481 newFanEventWithTrigger f = SpiderHost $ do
26952482 es <- newFanEventWithTriggerIO f
26962483 return $ Reflex.Class.EventSelector $ SpiderEvent . Reflex.Spider.Internal.select es
26972484
2698−instance HasSpiderTimeline x => Reflex.Host.Class.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHostFrame x) where
2485+instance Reflex.Host.Class.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHostFrame x) where
26992486 newEventWithTrigger = SpiderHostFrame . EventM . liftIO . fmap SpiderEvent . newEventWithTriggerIO
27002487 newFanEventWithTrigger f = SpiderHostFrame $ EventM $ liftIO $ do
27012488 es <- newFanEventWithTriggerIO f
@@ -2775,7 +2562,7 @@ instance HasSpiderTimeline x => R.Reflex (SpiderTimeline x) where
27752562 fanG e = R.EventSelectorG $ SpiderEvent . selectG (fanG (unSpiderEvent e))
27762563 {-# INLINABLE mergeG #-}
27772564 mergeG
2778− :: forall k2 (k :: k2 -> *) q (v :: k2 -> *). GCompare k
2565+ :: forall (k :: k2 -> *) q (v :: k2 -> *). GCompare k
27792566 => (forall a. q a -> R.Event (SpiderTimeline x) (v a))
27802567 -> DMap k q
27812568 -> R.Event (SpiderTimeline x) (DMap k v)
@@ -2843,14 +2630,8 @@ instance Monad (SpiderHost x) where
28432630 SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
28442631 {-# INLINABLE return #-}
28452632 return x = SpiderHost $ return x
2846−#if !MIN_VERSION_base(4,13,0)
28472633 {-# 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
2634+ fail s = SpiderHost $ fail s
28542635
28552636-- | Run an action affecting the global Spider timeline; this will be guarded by
28562637-- a mutex for that timeline
@@ -2872,21 +2653,19 @@ instance Monad (SpiderHostFrame x) where
28722653 SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
28732654 {-# INLINABLE return #-}
28742655 return x = SpiderHostFrame $ return x
2875−#if !MIN_VERSION_base(4,13,0)
28762656 {-# INLINABLE fail #-}
28772657 fail s = SpiderHostFrame $ fail s
2878−#endif
28792658
28802659instance NotReady (SpiderTimeline x) (SpiderHostFrame x) where
28812660 notReadyUntil _ = pure ()
28822661 notReady = pure ()
28832662
2884−newEventWithTriggerIO :: forall x a. HasSpiderTimeline x => (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
2663+newEventWithTriggerIO :: (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
28852664newEventWithTriggerIO f = do
28862665 es <- newFanEventWithTriggerIO $ \Refl -> f
28872666 return $ select es Refl
28882667
2889−newFanEventWithTriggerIO :: (HasSpiderTimeline x, GCompare k) => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
2668+newFanEventWithTriggerIO :: GCompare k => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
28902669newFanEventWithTriggerIO f = do
28912670 occRef <- newIORef DMap.empty
28922671 subscribedRef <- newIORef DMap.empty
@@ -2920,11 +2699,3 @@ instance MonadAtomicRef (SpiderHostFrame x) where
29202699instance PrimMonad (SpiderHostFrame x) where
29212700 type PrimState (SpiderHostFrame x) = PrimState IO
29222701 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/TriggerEvent/Base.hs−2
@@ -122,8 +122,6 @@ instance MonadHold t m => MonadHold t (TriggerEventT t m) where
122122 buildDynamic a0 = lift . buildDynamic a0
123123 {-# INLINABLE headE #-}
124124 headE = lift . headE
125− {-# INLINABLE now #-}
126− now = lift now
127125
128126instance Adjustable t m => Adjustable t (TriggerEventT t m) where
129127 {-# INLINABLE runWithReplace #-}
src/Reflex/TriggerEvent/Class.hs−6
@@ -12,7 +12,6 @@ import Reflex.Class
1212import Control.Monad.Reader
1313import Control.Monad.State
1414import qualified Control.Monad.State.Strict as Strict
15−import Control.Monad.Trans.Maybe (MaybeT)
1615
1716--TODO: Shouldn't have IO hard-coded
1817-- | 'TriggerEvent' represents actions that can create 'Event's that can be
@@ -48,8 +47,3 @@ instance TriggerEvent t m => TriggerEvent t (Strict.StateT s m) where
4847 newTriggerEvent = lift newTriggerEvent
4948 newTriggerEventWithOnComplete = lift newTriggerEventWithOnComplete
5049 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+1−1
@@ -13,7 +13,7 @@ import Data.Map (Map)
1313
1414import Reflex.Class
1515import Reflex.Adjustable.Class
16−import Data.Patch.MapWithMove
16+import Reflex.Patch.MapWithMove
1717
1818
1919-- | Build sortable content in such a way that re-sorting it can cause minimal
src/Reflex/Workflow.hs+1−1
@@ -34,7 +34,7 @@ workflow w0 = do
3434 rec eResult <- networkHold (unWorkflow w0) $ fmap unWorkflow $ switch $ snd <$> current eResult
3535 return $ fmap fst eResult
3636
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'.
37+-- | Similar to 'workflow', but outputs an 'Event' that fires whenever the current 'Workflow' is replaced by the next 'Workflow'.
3838workflowView :: 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)
3939workflowView w0 = do
4040 rec eResult <- networkView . fmap unWorkflow =<< holdDyn w0 eReplace
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+15−11
@@ -24,26 +24,30 @@ import Test.Run
2424
2525main :: IO ()
2626main = do
27− os1@[[Just [10,9,8,7,6,5,4,3,2,1]]] <- runApp' (unwrapApp testOrdering) $
27+ os1 <- runApp' (unwrapApp testOrdering) $
2828 [ Just ()
2929 ]
3030 print os1
31− os2@[[Just [1,3,5,7,9]],[Nothing,Nothing],[Just [2,4,6,8,10]],[Just [2,4,6,8,10],Nothing]]
32− <- runApp' (unwrapApp testSimultaneous) $ map Just $
33− [ This ()
34− , That ()
35− , This ()
36− , These () ()
37− ]
31+ os2 <- runApp' (unwrapApp testSimultaneous) $ map Just $
32+ [ This ()
33+ , That ()
34+ , This ()
35+ , These () ()
36+ ]
3837 print os2
39− os3@[[Nothing, Just [2]]] <- runApp' (unwrapApp testMoribundTellEvent) [Just ()]
38+ os3 <- runApp' (unwrapApp testMoribundTellEvent) [Just ()]
4039 print os3
41− os4@[[Nothing, Just [2]]] <- runApp' (unwrapApp testMoribundTellEventDMap) [Just ()]
40+ os4 <- runApp' (unwrapApp testMoribundTellEventDMap) [Just ()]
4241 print os4
43− os5@[[Nothing, Just [1, 2]]] <- runApp' (unwrapApp testLiveTellEventDMap) [Just ()]
42+ os5 <- runApp' (unwrapApp testLiveTellEventDMap) [Just ()]
4443 print os5
4544 os6 <- runApp' (unwrapApp delayedPulse) [Just ()]
4645 print os6
46+ let ![[Just [10,9,8,7,6,5,4,3,2,1]]] = os1
47+ let ![[Just [1,3,5,7,9]],[Nothing,Nothing],[Just [2,4,6,8,10]],[Just [2,4,6,8,10],Nothing]] = os2
48+ let ![[Nothing, Just [2]]] = os3
49+ let ![[Nothing, Just [2]]] = os4
50+ let ![[Nothing, Just [1, 2]]] = os5
4751 let ![[Nothing, Nothing]] = os6
4852 return ()
4953
test/GC.hs+2−2
@@ -18,10 +18,9 @@ import Data.GADT.Compare
1818import Data.IORef
1919import Data.Semigroup
2020import Data.These
21−import Data.Type.Equality ((:~:)(Refl))
2221
2322import Data.Functor.Misc
24−import Data.Patch
23+import Reflex.Patch
2524
2625import qualified Reflex.Host.Class as Host
2726import qualified Reflex.Spider.Internal as S
@@ -84,6 +83,7 @@ hostPerf ref = S.runSpiderHost $ do
8483 Nothing -> []
8584 Host.fireEventsAndRead followupEventTriggers $ return ()
8685 return ()
86+ return ()
8787
8888data Tell a where
8989 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+1−1
@@ -24,7 +24,7 @@ import Data.These.Lens
2424#endif
2525
2626import Reflex
27−import Data.Patch.MapWithMove
27+import Reflex.Patch.MapWithMove
2828import Test.Run
2929
3030newtype MyQuery = MyQuery SelectedCount
test/Reflex/Bench/Focused.hs+1−1
@@ -134,7 +134,7 @@ holdDynChain :: (Reflex t, MonadHold t m) => Word -> Dynamic t Word -> m (Dynami
134134holdDynChain = iterM (\d -> sample (current d) >>= flip holdDyn (updated d))
135135
136136buildDynChain :: (Reflex t, MonadHold t m) => Word -> Dynamic t Word -> m (Dynamic t Word)
137−buildDynChain = iterM (\d -> do
137+buildDynChain = iterM (\d -> do
138138 let b = fmap (+1) (current d)
139139 e = fmap (*2) (updated d)
140140 buildDynamic (sample b) e)
test/Reflex/Plan/Pure.hs−1
@@ -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
test/Reflex/Test/CrossImpl.hs+8−13
@@ -21,12 +21,11 @@ import Reflex.Dynamic
2121import Reflex.Host.Class
2222import qualified Reflex.Pure as P
2323import qualified Reflex.Spider.Internal as S
24−import qualified Reflex.Profiled as Prof
2524
2625import Control.Arrow (second, (&&&))
2726import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
2827import Control.Monad.State.Strict hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
29−import Data.Dependent.Sum (DSum (..))
28+import Data.Dependent.Map (DSum (..))
3029import Data.Foldable
3130import Data.Map.Strict (Map)
3231import qualified Data.Map.Strict as Map
@@ -36,6 +35,8 @@ import Data.Traversable
3635import System.Exit
3736import System.Mem
3837
38+import System.IO.Unsafe
39+
3940mapToPureBehavior :: Map Int a -> Behavior PureReflexDomain a
4041mapToPureBehavior m = P.Behavior $ \t -> case Map.lookupLE t m of
4142 Nothing -> error $ "mapToPureBehavior: no value for time " <> show t
@@ -72,14 +73,11 @@ instance MapMSignals (Event t a) (Event t' a) t t' where
7273instance (MapMSignals a a' t t', MapMSignals b b' t t') => MapMSignals (a, b) (a', b') t t' where
7374 mapMSignals fb fe (a, b) = liftM2 (,) (mapMSignals fb fe a) (mapMSignals fb fe b)
7475
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
76+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)
77+testSpider builder (bMap, eMap) = unsafePerformIO $ S.runSpiderHost $ do
8078 (re, reTrigger) <- newEventWithTriggerRef
8179 (rb, rbTrigger) <- newEventWithTriggerRef
82− b <- runHostFrame $ hold (error "testTimeline: No value for input behavior yet") rb
80+ b <- runHostFrame $ hold (error "testSpider: No value for input behavior yet") rb
8381 (b', e') <- runHostFrame $ builder (b, re)
8482 e'Handle <- subscribeEvent e' --TODO: This should be unnecessary
8583 let times = relevantTestingTimes (bMap, eMap)
@@ -104,11 +102,9 @@ testAgreement :: (Eq c, Eq d, Show c, Show d) => (forall m t. TestCaseConstraint
104102testAgreement builder inputs = do
105103 let identityResult = testPure builder inputs
106104 tracePerf "---------" $ return ()
107− spiderResult <- S.runSpiderHost $ testTimeline builder inputs
108− tracePerf "---------" $ return ()
109− profiledResult <- S.runSpiderHost $ Prof.runProfiledM $ testTimeline builder inputs
105+ let spiderResult = testSpider builder inputs
110106 tracePerf "---------" $ return ()
111− let resultsAgree = identityResult == spiderResult && identityResult == profiledResult
107+ let resultsAgree = identityResult == spiderResult
112108 if resultsAgree
113109 then do --putStrLn "Success:"
114110 --print identityResult
@@ -116,7 +112,6 @@ testAgreement builder inputs = do
116112 else do putStrLn "Failure:"
117113 putStrLn $ "Pure result: " <> show identityResult
118114 putStrLn $ "Spider result: " <> show spiderResult
119− putStrLn $ "Profiled result: " <> show profiledResult
120115 return resultsAgree
121116
122117type TestCaseConstraint t m = (Reflex t, MonadSample t m, MonadHold t m, MonadFix m, MonadFix (PushM t))
test/Reflex/Test/Micro.hs+2−8
@@ -322,14 +322,8 @@ testCases =
322322 let e = never <$ switch b
323323 return $ void e
324324 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
325+
326+
333327 ] where
334328
335329 events1, events2, events3 :: TestPlan t m => m (Event t String)
test/RequesterT.hs+33−89
@@ -1,36 +1,22 @@
11{-# LANGUAGE CPP #-}
22{-# LANGUAGE BangPatterns #-}
33{-# LANGUAGE FlexibleContexts #-}
4−{-# LANGUAGE FlexibleInstances #-}
54{-# LANGUAGE GADTs #-}
6−{-# LANGUAGE LambdaCase #-}
7−{-# LANGUAGE MultiParamTypeClasses #-}
5+{-# LANGUAGE RankNTypes #-}
86{-# LANGUAGE RecursiveDo #-}
97{-# LANGUAGE ScopedTypeVariables #-}
10−{-# LANGUAGE TemplateHaskell #-}
11−{-# LANGUAGE TypeApplications #-}
12−{-# LANGUAGE TypeFamilies #-}
138module Main where
149
15−import Control.Lens hiding (has)
10+import Control.Lens
1611import Control.Monad
1712import 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
13+import Control.Monad.Primitive
2214import qualified Data.Dependent.Map as DMap
2315import Data.Dependent.Sum
2416import Data.Functor.Misc
25−import Data.List (words)
26−import Data.Map (Map)
2717import qualified Data.Map as M
28−#if !MIN_VERSION_these(4,11,0)
29−import Data.Semigroup ((<>))
30−#endif
31−import Data.Text (Text)
3218import Data.These
33−import Text.Read (readMaybe)
19+import Data.Foldable
3420
3521#if defined(MIN_VERSION_these_lens) || (MIN_VERSION_these(0,8,0) && !MIN_VERSION_these(0,9,0))
3622import Data.These.Lens
@@ -46,50 +32,46 @@ data RequestInt a where
4632
4733main :: IO ()
4834main = do
49− os1 <- runApp' (unwrapApp testOrdering) $
50− [ Just ()
51− ]
52− print os1
53− os2 <- runApp' (unwrapApp testSimultaneous) $ map Just $
54− [ This ()
55− , That ()
56− , This ()
57− , These () ()
58− ]
59− print os2
60− os3 <- runApp' (unwrapApp testMoribundRequest) [Just ()]
61− print os3
35+-- os1 <- runApp' (unwrapApp testOrdering) $
36+-- [ Just ()
37+-- ]
38+-- print os1
39+-- os2 <- runApp' (unwrapApp testSimultaneous) $ map Just $
40+-- [ This ()
41+-- , That ()
42+-- , This ()
43+-- , These () ()
44+-- ]
45+-- print os2
46+-- os3 <- runApp' (unwrapApp testMoribundRequest) [Just ()]
47+-- print os3
6248 os4 <- runApp' (unwrapApp testMoribundRequestDMap) [Just ()]
6349 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
50+-- os5 <- runApp' (unwrapApp testLiveRequestDMap) [Just ()]
51+-- print os5
52+-- os6 <- runApp' (unwrapApp delayedPulse) [Just ()]
53+-- print os6
54+-- let ![[Just [10,9,8,7,6,5,4,3,2,1]]] = os1
55+-- let ![[Just [1,3,5,7,9]],[Nothing,Nothing],[Just [2,4,6,8,10]],[Just [2,4,6,8,10],Nothing]] = os2
56+-- let ![[Nothing, Just [2]]] = os3
7557 let ![[Nothing, Just [2]]] = os4
76− let ![[Nothing, Just [1, 2]]] = os5
58+-- let ![[Nothing, Just [1, 2]]] = os5
7759 -- 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−
8160 return ()
8261
83−unwrapRequest :: DSum tag RequestInt -> Int
84−unwrapRequest (_ :=> RequestInt i) = i
85−
86−unwrapApp :: ( Reflex t, Monad m )
62+unwrapApp :: forall t m a.
63+ ( Reflex t
64+ , MonadFix m
65+ , PrimMonad m
66+ )
8767 => (a -> RequesterT t RequestInt Identity m ())
8868 -> a
8969 -> m (Event t [Int])
9070unwrapApp x appIn = do
9171 ((), e) <- runRequesterT (x appIn) never
92− return $ fmap (map unwrapRequest . requesterDataToList) e
72+ let unwrapRequests :: forall x. RequestData (PrimState m) RequestInt -> [Int]
73+ unwrapRequests (RequestData _ es) = fmap (\(RequestEnvelope _ (RequestInt i)) -> i) $ toList es
74+ return $ fmap unwrapRequests e
9375
9476testOrdering :: ( Response m ~ Identity
9577 , Request m ~ RequestInt
@@ -195,41 +177,3 @@ delayedPulse pulse = void $ flip runWithReplace (pure () <$ pulse) $ do
195177 -- This has the effect of delaying pulse' from pulse
196178 (_, pulse') <- runWithReplace (pure ()) $ pure (RequestInt 1) <$ pulse
197179 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/hlint.hs+8−2
@@ -1,7 +1,7 @@
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)
77import System.FilePath
@@ -22,7 +22,6 @@ main = do
2222 , "--ignore=Use unless"
2323 , "--ignore=Reduce duplication"
2424 , "--cpp-define=USE_TEMPLATE_HASKELL"
25− , "--cpp-define=DEBUG"
2625 , "--ignore=Use tuple-section"
2726 ]
2827 recurseInto = and <$> sequence
@@ -31,9 +30,16 @@ main = do
3130 ]
3231 matchFile = and <$> sequence
3332 [ extension ==? ".hs"
33+ , let notElem' = liftOp notElem
34+ in filePath `notElem'` filePathExceptions pwd
3435 ]
3536 files <- find recurseInto matchFile (pwd </> "src") --TODO: Someday fix all hints in tests, etc.
3637 ideas <- fmap concat $ forM files $ \f -> do
3738 putStr $ "linting file " ++ drop (length pwd + 1) f ++ "... "
3839 runHlint f
3940 if null ideas then exitSuccess else exitFailure
41+
42+filePathExceptions :: FilePath -> [FilePath]
43+filePathExceptions pwd = map (pwd </>) $
44+ [ "src/Data/AppendMap.hs" -- parse error when hlint runs
45+ ]