on 6d12ec3 help sign in
65 files changed+1905−1469
since splitsnapshots
unifiedsplit
.github/workflows/haskell.yml−41 .travis.yml+175 ChangeLog.md+4−106 Quickref.md+11−15 README.md+17−15 cabal.haskell-ci−1 default.nix+43 dep/reflex-platform/default.nix−7 dep/reflex-platform/github.json−7 hydra.json+29 jobsets.nix+70 reflex-platform.nix+8 reflex.cabal+40−98 release.nix+7−56 src/Control/Monad/ReaderIO.hs+1−1 src/Data/AppendMap.hs+3−5 src/Data/FastMutableIntMap.hs+3−3 src/Data/FastWeakBag.hs+4−9 src/Data/Functor/Misc.hs+234 src/Data/Map/Misc.hs+1−1 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+9−39 src/Reflex/Collection.hs+2−5 src/Reflex/Dynamic.hs+2−17 src/Reflex/DynamicWriter/Base.hs+5−14 src/Reflex/DynamicWriter/Class.hs+1 src/Reflex/EventWriter/Base.hs+5−16 src/Reflex/FastWeak.hs−10 src/Reflex/Host/Headless.hs−128 src/Reflex/Network.hs+1−1 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+59 src/Reflex/Patch/Map.hs+55 src/Reflex/Patch/MapWithMove.hs+270 src/Reflex/PerformEvent/Base.hs+1−3 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+27−97 src/Reflex/Spider/Internal.hs+169−340 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+64−91 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+2−63 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+175
@@ -0,0 +1,175 @@
1+# This Travis job script has been generated by a script via
2+#
3+# haskell-ci 'reflex.cabal' '--config' 'cabal.haskell-ci'
4+#
5+# For more information, see https://github.com/haskell-CI/haskell-ci
6+#
7+# version: 0.3.20190815
8+#
9+language: c
10+dist: xenial
11+git:
12+ # whether to recursively clone submodules
13+ submodules: false
14+cache:
15+ directories:
16+ - $HOME/.cabal/packages
17+ - $HOME/.cabal/store
18+before_cache:
19+ - rm -fv $CABALHOME/packages/hackage.haskell.org/build-reports.log
20+ # remove files that are regenerated by 'cabal update'
21+ - rm -fv $CABALHOME/packages/hackage.haskell.org/00-index.*
22+ - rm -fv $CABALHOME/packages/hackage.haskell.org/*.json
23+ - rm -fv $CABALHOME/packages/hackage.haskell.org/01-index.cache
24+ - rm -fv $CABALHOME/packages/hackage.haskell.org/01-index.tar
25+ - rm -fv $CABALHOME/packages/hackage.haskell.org/01-index.tar.idx
26+ - rm -rfv $CABALHOME/packages/head.hackage
27+matrix:
28+ include:
29+ - compiler: ghcjs-8.4
30+ addons: {"apt":{"sources":["hvr-ghc"],"packages":["cabal-install-3.0"]}}
31+ - compiler: ghc-8.6.5
32+ addons: {"apt":{"sources":["hvr-ghc"],"packages":["ghc-8.6.5","cabal-install-2.4"]}}
33+ - compiler: ghc-8.4.4
34+ addons: {"apt":{"sources":["hvr-ghc"],"packages":["ghc-8.4.4","cabal-install-2.4"]}}
35+ - compiler: ghc-8.2.2
36+ addons: {"apt":{"sources":["hvr-ghc"],"packages":["ghc-8.2.2","cabal-install-2.4"]}}
37+ - compiler: ghc-8.0.2
38+ addons: {"apt":{"sources":["hvr-ghc"],"packages":["ghc-8.0.2","cabal-install-2.4"]}}
39+before_install:
40+ - |
41+ if echo $CC | grep -q ghcjs; then
42+ GHCJS=true;
43+ else
44+ GHCJS=false;
45+ fi
46+ - |
47+ if [ "$TRAVIS_OS_NAME" = "linux" ]; then
48+ if $GHCJS ; then sudo add-apt-repository -y ppa:hvr/ghcjs ; fi;
49+ if $GHCJS ; then curl -s https://deb.nodesource.com/gpgkey/nodesource.gpg.key | sudo apt-key add - ; fi;
50+ if $GHCJS ; then sudo apt-add-repository 'https://deb.nodesource.com/node_8.x xenial main' ; fi;
51+ if $GHCJS ; then sudo apt-get update ; fi;
52+ sudo apt-get install $CC;
53+ if $GHCJS ; then sudo apt-get install -y nodejs cabal-install-3.0 ; fi;
54+ fi
55+ - HC=$(echo "/opt/$CC/bin/ghc" | sed 's/-/\//')
56+ - WITHCOMPILER="-w $HC"
57+ - if $GHCJS ; then HC=${HC}js ; fi
58+ - if $GHCJS ; then WITHCOMPILER="--ghcjs ${WITHCOMPILER}js" ; 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+ # Constraint set debug-propagation
170+ - ${CABAL} v2-build $WITHCOMPILER --disable-tests --disable-benchmarks --constraint='reflex +debug-propagation' all | color_cabal_output
171+ # Constraint set debug-cycles
172+ - ${CABAL} v2-build $WITHCOMPILER --disable-tests --disable-benchmarks --constraint='reflex +debug-cycles' all | color_cabal_output
173+
174+# REGENDATA ["reflex.cabal","--config","cabal.haskell-ci"]
175+# EOF
ChangeLog.md+4−106
@@ -1,101 +1,9 @@
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−
85−## 0.6.2.4
86−
87−* Update to monoidal-containers 0.6
88−
89−## 0.6.2.3
90−
91−* Add an upper-bound to witherable
92−
933## 0.6.2.2
944
955* Support these >= 1. Add `split-these` flag to control whether to use new these/semialign combination or not.
96−
976* Update version bounds to fix some CI failures
98−
997* Add travis CI configuration
1008
1019## 0.6.2.1
@@ -110,42 +18,32 @@ Changes do not carry forward to 0.7.2.0.
11018 * Add incrementalCoercion/coerceIncremental to go with dynamicCoercion/coerceDynamic
11119
11220* Generalize merging functions:
113− `merge` to `mergeG`,
114− `mergeIncremental` to `mergeIncrementalG`,
115− `mergeIncrementalWithMove` to `mergeIncrementalWithMoveG`.
21+ `merge` to `mergeG`,
22+ `mergeIncremental` to `mergeIncrementalG`,
23+ `mergeIncrementalWithMove` to `mergeIncrementalWithMoveG`.
11624
11725* Generalize distribute function:
11826 `distributeDMapOverDynPure` to `distributeDMapOverDynPureG`,
11927
12028## 0.6.2.0
12129
122−* Fix `holdDyn` so that it is lazy in its event argument
30+* Fix `holdDyn` so that it is lazy in its event argument
12331 These produce `DMap`s whose values needn't be `Identity`.
124−
12532* Stop using the now-deprecated `*Tag` classes (e.g., `ShowTag`).
126−
12733* Fix `holdDyn` so that it is lazy in its event argument.
12834
12935## 0.6.1.0
13036
13137* Re-export all of `Data.Map.Monoidal`
132−
13338* Fix `QueryT` and `RequesterT` tests
13439
13540## 0.6.0.0 -- 2019-03-20
13641
13742* Deprecate `FunctorMaybe` in favor of `Data.Witherable.Filterable`. We still export `fmapMaybe`, `ffilter`, etc., but they all rely on `Filterable` now.
138−
13943* Rename `MonadDynamicWriter` to `DynamicWriter` and add a deprecation for the old name.
140−
14144* Remove many deprecated functions.
142−
14345* Add a `Num` instance for `Dynamic`.
144−
14546* Add `matchRequestsWithResponses` to make it easier to use `Requester` with protocols that don't do this matching for you.
146−
14747* Add `withRequesterT` to map functions over the request and response of a `RequesterT`.
148−
14948* Suppress nil patches in `QueryT` as an optimization. The `Query` type must now have an `Eq` instance.
150−
15149* 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−1
@@ -10,7 +10,6 @@ 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
default.nixnew file+43
@@ -0,0 +1,43 @@
1+{ mkDerivation, ghc, base, bifunctors, containers, deepseq
2+, dependent-map, dependent-sum, exception-transformers
3+, haskell-src-exts, haskell-src-meta, hlint, lens, MemoTrie
4+, monad-control, mtl, primitive, random, ref-tf
5+, semigroupoids , semigroups, split, stdenv, stm, syb
6+, template-haskell , these, time, transformers
7+, transformers-compat, unbounded-delays, prim-uniq
8+, data-default, filepath, directory, filemanip, ghcjs-base
9+, monoidal-containers, witherable, profunctors
10+, semialign ? null, splitThese ? (semialign != null)
11+, useTemplateHaskell ? true
12+}:
13+mkDerivation {
14+ pname = "reflex";
15+ version = "0.6.2.2";
16+ src = builtins.filterSource (path: type: !(builtins.elem (baseNameOf path) [ ".git" "dist" ])) ./.;
17+ libraryHaskellDepends = [
18+ base bifunctors containers dependent-map dependent-sum
19+ exception-transformers lens
20+ MemoTrie monad-control mtl primitive ref-tf semigroupoids
21+ semigroups stm syb template-haskell these transformers
22+ transformers-compat prim-uniq
23+ base bifunctors containers deepseq dependent-map dependent-sum
24+ mtl ref-tf split transformers data-default
25+ random time unbounded-delays monoidal-containers witherable
26+ profunctors
27+ ] ++ (if ghc.isGhcjs or false then [
28+ ghcjs-base
29+ ] else []) ++ (if !useTemplateHaskell then [] else [
30+ haskell-src-exts haskell-src-meta
31+ ]) ++ (if splitThese then [
32+ semialign
33+ ] else []);
34+ testHaskellDepends = if ghc.isGhcjs or false then [] else [
35+ hlint filepath directory filemanip
36+ ];
37+ configureFlags =
38+ stdenv.lib.optional (!useTemplateHaskell) [ "-f-use-template-haskell" ] ++
39+ stdenv.lib.optional (!splitThese) [ "-f-split-these" ];
40+ homepage = "https://github.com/reflex-frp/reflex";
41+ description = "Higher-order Functional Reactive Programming";
42+ license = stdenv.lib.licenses.bsd3;
43+}
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+40−98
@@ -1,17 +1,7 @@
11Name: reflex
2−Version: 0.8.2.0
2+Version: 0.6.2.2
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.
@@ -61,57 +51,56 @@ flag debug-cycles
6151 default: False
6252 manual: True
6353
54+
6455flag split-these
6556 description: Use split these/semialign packages
6657 manual: False
67− default: True
58+ default: False
6859
6960library
70− default-language: Haskell2010
7161 hs-source-dirs: src
7262 build-depends:
7363 MemoTrie == 0.6.*,
74− base >= 4.11 && < 4.15,
64+ base >= 4.9 && < 4.13,
7565 bifunctors >= 5.2 && < 5.6,
7666 comonad >= 5.0.4 && < 5.1,
77− constraints >= 0.10 && <0.14,
7867 constraints-extras >= 0.3 && < 0.4,
7968 containers >= 0.6 && < 0.7,
8069 data-default >= 0.5 && < 0.8,
81− dependent-map >= 0.3 && < 0.5,
70+ dependent-map >= 0.3 && < 0.4,
8271 exception-transformers == 0.4.*,
72+ profunctors >= 5.0 && < 5.5,
8373 lens >= 4.7 && < 5,
84− mmorph >= 1.0 && < 1.2,
8574 monad-control >= 1.0.1 && < 1.1,
8675 mtl >= 2.1 && < 2.3,
87− patch >= 0.0.1 && < 0.1,
88− prim-uniq >= 0.1.0.1 && < 0.3,
76+ prim-uniq >= 0.1.0.1 && < 0.2,
8977 primitive >= 0.5 && < 0.8,
90− profunctors >= 5.3 && < 5.7,
78+ profunctors,
9179 random == 1.1.*,
9280 ref-tf == 0.4.*,
9381 reflection == 2.1.*,
9482 semigroupoids >= 4.0 && < 6,
9583 stm >= 2.4 && < 2.6,
9684 syb >= 0.5 && < 0.8,
97− time >= 1.4 && < 1.10,
85+ time >= 1.4 && < 1.9,
9886 transformers >= 0.5.6.0 && < 0.6,
9987 unbounded-delays >= 0.1.0.0 && < 0.2,
100− witherable >= 0.3 && < 0.5
88+ witherable >= 0.2 && < 0.4
10189
10290 if flag(split-these)
103− build-depends: these >= 1 && <1.2,
104− semialign >=1 && <1.2,
105− monoidal-containers >= 0.6 && < 0.7
91+ build-depends: these >= 1 && <1.1,
92+ semialign >=1 && <1.1,
93+ monoidal-containers >= 0.5.0.1 && < 0.6
10694 else
10795 build-depends: these >= 0.4 && <0.9,
108− monoidal-containers == 0.4.0.0
96+ monoidal-containers == 0.5.0.0
10997
11098 exposed-modules:
11199 Control.Monad.ReaderIO
112100 Data.AppendMap,
113101 Data.FastMutableIntMap,
114102 Data.FastWeakBag,
103+ Data.Functor.Misc,
115104 Data.Map.Misc,
116105 Data.WeakBag,
117106 Reflex,
@@ -131,9 +120,15 @@ library
131120 Reflex.FastWeak,
132121 Reflex.FunctorMaybe,
133122 Reflex.Host.Class,
134− Reflex.Host.Headless,
135123 Reflex.Network,
136124 Reflex.NotReady.Class,
125+ Reflex.Patch,
126+ Reflex.Patch.Class,
127+ Reflex.Patch.DMap,
128+ Reflex.Patch.DMapWithMove,
129+ Reflex.Patch.IntMap,
130+ Reflex.Patch.Map,
131+ Reflex.Patch.MapWithMove,
137132 Reflex.PerformEvent.Base,
138133 Reflex.PerformEvent.Class,
139134 Reflex.PostBuild.Base,
@@ -152,22 +147,11 @@ library
152147 Reflex.Widget.Basic,
153148 Reflex.Workflow
154149
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−
165150 ghc-options: -Wall -fwarn-redundant-constraints -fwarn-tabs -funbox-strict-fields -O2 -fspecialise-aggressively
166151
167152 if flag(debug-trace-events)
168153 cpp-options: -DDEBUG_TRACE_EVENTS
169− build-depends:
170− bytestring >= 0.10.8 && < 0.11
154+ build-depends: bytestring
171155
172156 if flag(use-reflex-optimizer)
173157 cpp-options: -DUSE_REFLEX_OPTIMIZER
@@ -175,7 +159,7 @@ library
175159 exposed-modules: Reflex.Optimizer
176160
177161 if flag(debug-propagation)
178− cpp-options: -DDEBUG -DDEBUG_TRACE_PROPAGATION -DDEBUG_TRACE_INVALIDATION
162+ cpp-options: -DDEBUG
179163
180164 if flag(debug-cycles)
181165 cpp-options: -DDEBUG_CYCLES
@@ -183,26 +167,26 @@ library
183167 if flag(use-template-haskell)
184168 cpp-options: -DUSE_TEMPLATE_HASKELL
185169 build-depends:
186− dependent-sum >= 0.6 && < 0.8,
187− haskell-src-exts >= 1.16 && < 1.24,
170+ dependent-sum >= 0.6 && < 0.7,
171+ haskell-src-exts >= 1.16 && < 1.22,
188172 haskell-src-meta >= 0.6 && < 0.9,
189− template-haskell >= 2.9 && < 2.17
173+ template-haskell >= 2.9 && < 2.15
190174 exposed-modules:
191175 Reflex.Dynamic.TH
192176 other-extensions: TemplateHaskell
193177 else
194178 build-depends:
195− dependent-sum >= 0.6 && < 0.8
179+ dependent-sum >= 0.6 && < 0.7
196180
197181 if flag(fast-weak) && impl(ghcjs)
198182 cpp-options: -DGHCJS_FAST_WEAK
199183
200184 if impl(ghcjs)
201− build-depends:
202− ghcjs-base == 0.2.*
185+ build-depends: ghcjs-base
186+
187+
203188
204189test-suite semantics
205− default-language: Haskell2010
206190 type: exitcode-stdio-1.0
207191 main-is: semantics.hs
208192 hs-source-dirs: test
@@ -228,7 +212,6 @@ test-suite semantics
228212 Reflex.TestPlan
229213
230214test-suite CrossImpl
231− default-language: Haskell2010
232215 type: exitcode-stdio-1.0
233216 main-is: Reflex/Test/CrossImpl.hs
234217 hs-source-dirs: test
@@ -250,7 +233,6 @@ test-suite CrossImpl
250233 Reflex.Plan.Pure
251234
252235test-suite hlint
253− default-language: Haskell2010
254236 type: exitcode-stdio-1.0
255237 main-is: hlint.hs
256238 hs-source-dirs: test
@@ -258,15 +240,11 @@ test-suite hlint
258240 , directory
259241 , filepath
260242 , 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
243+ , hlint < 2.1 || >= 2.2.2
265244 if impl(ghcjs)
266245 buildable: False
267246
268247test-suite EventWriterT
269− default-language: Haskell2010
270248 type: exitcode-stdio-1.0
271249 main-is: EventWriterT.hs
272250 hs-source-dirs: test
@@ -290,7 +268,6 @@ test-suite EventWriterT
290268
291269
292270test-suite DebugCycles
293− default-language: Haskell2010
294271 type: exitcode-stdio-1.0
295272 main-is: DebugCycles.hs
296273 hs-source-dirs: test
@@ -300,7 +277,6 @@ test-suite DebugCycles
300277 , deepseq
301278 , dependent-map
302279 , dependent-sum
303− , hspec
304280 , lens
305281 , mtl
306282 , these
@@ -315,28 +291,24 @@ test-suite DebugCycles
315291 build-depends: these-lens, semialign
316292
317293 other-modules:
318− Test.Run
294+ Test.Run
319295
320296
321297test-suite RequesterT
322− default-language: Haskell2010
323298 type: exitcode-stdio-1.0
324299 main-is: RequesterT.hs
325300 hs-source-dirs: test
326301 build-depends: base
327− , constraints
328− , constraints-extras
329302 , containers
330303 , deepseq
331− , dependent-map
332304 , dependent-sum
305+ , dependent-map
333306 , lens
334307 , mtl
335− , ref-tf
336− , reflex
337− , text
338308 , these
339309 , transformers
310+ , reflex
311+ , ref-tf
340312
341313 if flag(split-these)
342314 build-depends: these-lens
@@ -346,31 +318,7 @@ test-suite RequesterT
346318 Reflex.Plan.Pure
347319 Test.Run
348320
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−
372321test-suite QueryT
373− default-language: Haskell2010
374322 type: exitcode-stdio-1.0
375323 main-is: QueryT.hs
376324 hs-source-dirs: test
@@ -382,7 +330,6 @@ test-suite QueryT
382330 , lens
383331 , monoidal-containers
384332 , mtl
385− , patch
386333 , ref-tf
387334 , reflex
388335 , these
@@ -398,7 +345,6 @@ test-suite QueryT
398345 Reflex.Plan.Pure
399346
400347test-suite GC-Semantics
401− default-language: Haskell2010
402348 type: exitcode-stdio-1.0
403349 main-is: GC.hs
404350 hs-source-dirs: test
@@ -408,7 +354,6 @@ test-suite GC-Semantics
408354 , dependent-map
409355 , deepseq
410356 , mtl
411− , patch
412357 , these
413358 , transformers
414359 , reflex
@@ -424,7 +369,6 @@ test-suite GC-Semantics
424369 Test.Run
425370
426371test-suite rootCleanup
427− default-language: Haskell2010
428372 type: exitcode-stdio-1.0
429373 main-is: rootCleanup.hs
430374 hs-source-dirs: test
@@ -442,7 +386,6 @@ test-suite rootCleanup
442386 Test.Run
443387
444388benchmark spider-bench
445− default-language: Haskell2010
446389 type: exitcode-stdio-1.0
447390 hs-source-dirs: bench test
448391 main-is: Main.hs
@@ -467,7 +410,6 @@ benchmark spider-bench
467410 Reflex.Bench.Focused
468411
469412benchmark saulzar-bench
470− default-language: Haskell2010
471413 type: exitcode-stdio-1.0
472414 hs-source-dirs: bench test
473415 c-sources: bench-cbits/checkCapability.c
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+3−5
@@ -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
@@ -32,8 +32,6 @@ import qualified Data.Map as Map (showTree, showTreeWith)
3232#endif
3333import qualified Data.Witherable as W
3434import Data.Map.Monoidal
35−import qualified Data.Map.Monoidal as MonoidalMap
36−
3735
3836{-# DEPRECATED AppendMap "Use 'MonoidalMap' instead" #-}
3937-- | AppendMap is a synonym for 'Data.Map.Monoidal.MonoidalMap'
@@ -50,7 +48,7 @@ pattern AppendMap m = MonoidalMap m
5048
5149#if !MIN_VERSION_witherable(0,3,2)
5250instance W.Filterable (MonoidalMap k) where
53− mapMaybe = MonoidalMap.mapMaybe
51+ mapMaybe = mapMaybe
5452#endif
5553
5654-- | Deletes a key, returning 'Nothing' if the result is empty.
@@ -71,7 +69,7 @@ mapMaybeNoNull f as =
7169 then Nothing
7270 else Just bs
7371
74−-- TODO: Move instances to `Data.Patch`
72+-- TODO: Move instances to `Reflex.Patch`
7573-- | Displays a 'MonoidalMap' as a tree. See 'Data.Map.Lazy.showTree' for details.
7674showTree :: forall k a. (Show k, Show a) => MonoidalMap k a -> String
7775showTree = coerce (Map.showTree :: Map k a -> String)
src/Data/FastMutableIntMap.hs+3−3
@@ -35,8 +35,8 @@ import Data.Foldable (traverse_)
3535import Data.IntMap.Strict (IntMap)
3636import qualified Data.IntMap.Strict as IntMap
3737import Data.IORef
38−import Data.Patch.Class
39−import Data.Patch.IntMap
38+import Reflex.Patch.Class
39+import Reflex.Patch.IntMap
4040
4141-- | A 'FastMutableIntMap' holds a map of values of type @a@ and allows low-overhead modifications via IO.
4242-- Operations on 'FastMutableIntMap' run in IO.
@@ -85,7 +85,7 @@ getFrozenAndClear (FastMutableIntMap r) = do
8585 writeIORef r IntMap.empty
8686 return result
8787
88−-- | Updates the value of a 'FastMutableIntMap' with the given patch (see 'Data.Patch.IntMap'),
88+-- | Updates the value of a 'FastMutableIntMap' with the given patch (see 'Reflex.Patch.IntMap'),
8989-- and returns an 'IntMap' with the modified keys and values.
9090applyPatch :: FastMutableIntMap a -> PatchIntMap a -> IO (IntMap a)
9191applyPatch (FastMutableIntMap r) p@(PatchIntMap m) = do
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/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/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+9−39
@@ -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
@@ -173,15 +173,12 @@ module Reflex.Class
173173 , slowHeadE
174174 ) where
175175
176−#ifdef MIN_VERSION_semialign
176+#if defined(MIN_VERSION_semialign)
177177import Prelude hiding (zip, zipWith)
178178
179179#if MIN_VERSION_these(0,8,0)
180180import Data.These.Combinators (justThese)
181181#endif
182−#if MIN_VERSION_semialign(1,1,0)
183−import Data.Zip (Zip (..), Unzip (..))
184−#endif
185182#endif
186183
187184import Control.Applicative
@@ -196,12 +193,11 @@ import Data.Align
196193import Data.Bifunctor
197194import Data.Coerce
198195import Data.Default
199−import Data.Dependent.Map (DMap)
200−import Data.Dependent.Sum (DSum (..))
196+import Data.Dependent.Map (DMap, DSum (..))
201197import qualified Data.Dependent.Map as DMap
202198import Data.Functor.Compose
203199import Data.Functor.Product
204−import Data.GADT.Compare (GEq (..), GCompare (..))
200+import Data.GADT.Compare (GEq (..), GCompare (..), (:~:) (..))
205201import Data.FastMutableIntMap (PatchIntMap)
206202import Data.Foldable
207203import Data.Functor.Bind
@@ -211,18 +207,17 @@ import Data.IntMap.Strict (IntMap)
211207import qualified Data.IntMap.Strict as IntMap
212208import Data.List.NonEmpty (NonEmpty (..))
213209import Data.Map (Map)
214−import Data.Semigroup (Semigroup (..))
210+import Data.Semigroup (Semigroup, sconcat, stimes, (<>))
215211import Data.Some (Some(Some))
216212import Data.String
217213import Data.These
218214import Data.Type.Coercion
219−import Data.Type.Equality ((:~:) (..))
220215import Data.Witherable (Filterable(..))
221216import qualified Data.Witherable as W
222217import Reflex.FunctorMaybe (FunctorMaybe)
223218import qualified Reflex.FunctorMaybe
224−import Data.Patch
225−import qualified Data.Patch.MapWithMove as PatchMapWithMove
219+import Reflex.Patch
220+import qualified Reflex.Patch.MapWithMove as PatchMapWithMove
226221
227222import Debug.Trace (trace)
228223
@@ -288,8 +283,7 @@ class ( MonadHold t (PushM t)
288283 -- | Create an 'Event' that will occur whenever the currently-selected input
289284 -- 'Event' occurs
290285 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.
286+ -- | Create an 'Event' that will occur whenever the input event is occurring -- and its occurrence value, another 'Event', is also occurring
293287 coincidence :: Event t (Event t a) -> Event t a
294288 -- | Extract the 'Behavior' of a 'Dynamic'.
295289 current :: Dynamic t a -> Behavior t a
@@ -421,13 +415,6 @@ class MonadSample t m => MonadHold t m where
421415 -- | Create a new 'Event' that only occurs only once, on the first occurrence of
422416 -- the supplied 'Event'.
423417 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
431418
432419-- | Accumulate an 'Incremental' with the supplied initial value and the firings of the provided 'Event',
433420-- using the combining function to produce a patch.
@@ -573,7 +560,6 @@ instance MonadHold t m => MonadHold t (ReaderT r m) where
573560 holdIncremental a0 = lift . holdIncremental a0
574561 buildDynamic a0 = lift . buildDynamic a0
575562 headE = lift . headE
576− now = lift now
577563
578564instance (MonadSample t m, Monoid r) => MonadSample t (WriterT r m) where
579565 sample = lift . sample
@@ -584,7 +570,6 @@ instance (MonadHold t m, Monoid r) => MonadHold t (WriterT r m) where
584570 holdIncremental a0 = lift . holdIncremental a0
585571 buildDynamic a0 = lift . buildDynamic a0
586572 headE = lift . headE
587− now = lift now
588573
589574instance MonadSample t m => MonadSample t (StateT s m) where
590575 sample = lift . sample
@@ -595,7 +580,6 @@ instance MonadHold t m => MonadHold t (StateT s m) where
595580 holdIncremental a0 = lift . holdIncremental a0
596581 buildDynamic a0 = lift . buildDynamic a0
597582 headE = lift . headE
598− now = lift now
599583
600584instance MonadSample t m => MonadSample t (ExceptT e m) where
601585 sample = lift . sample
@@ -606,7 +590,6 @@ instance MonadHold t m => MonadHold t (ExceptT e m) where
606590 holdIncremental a0 = lift . holdIncremental a0
607591 buildDynamic a0 = lift . buildDynamic a0
608592 headE = lift . headE
609− now = lift now
610593
611594instance (MonadSample t m, Monoid w) => MonadSample t (RWST r w s m) where
612595 sample = lift . sample
@@ -617,7 +600,6 @@ instance (MonadHold t m, Monoid w) => MonadHold t (RWST r w s m) where
617600 holdIncremental a0 = lift . holdIncremental a0
618601 buildDynamic a0 = lift . buildDynamic a0
619602 headE = lift . headE
620− now = lift now
621603
622604instance MonadSample t m => MonadSample t (ContT r m) where
623605 sample = lift . sample
@@ -628,7 +610,6 @@ instance MonadHold t m => MonadHold t (ContT r m) where
628610 holdIncremental a0 = lift . holdIncremental a0
629611 buildDynamic a0 = lift . buildDynamic a0
630612 headE = lift . headE
631− now = lift now
632613
633614--------------------------------------------------------------------------------
634615-- Convenience functions
@@ -678,9 +659,7 @@ instance Reflex t => Monad (Behavior t) where
678659 a >>= f = pull $ sample a >>= sample . f
679660 -- 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.
680661 return = constant
681−#if !MIN_VERSION_base(4,13,0)
682662 fail = error "Monad (Behavior t) does not support fail"
683−#endif
684663
685664instance (Reflex t, Monoid a) => Monoid (Behavior t a) where
686665 mempty = constant mempty
@@ -1098,19 +1077,10 @@ instance Reflex t => Semialign (Event t) where
10981077#endif
10991078 align = alignEventWithMaybe Just
11001079
1101−#ifdef MIN_VERSION_semialign
1102−#if MIN_VERSION_semialign(1,1,0)
1103−instance Reflex t => Zip (Event t) where
1104−#endif
1080+#if defined(MIN_VERSION_semialign)
11051081 zip x y = mapMaybe justThese $ align x y
11061082#endif
11071083
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
11141084
11151085-- | Create a new 'Event' that only occurs if the supplied 'Event' occurs and
11161086-- the 'Behavior' is true at the time of occurrence.
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+2−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
@@ -206,11 +201,6 @@ splitDynPure d = (fmap fst d, fmap snd d)
206201distributeMapOverDynPure :: (Reflex t, Ord k) => Map k (Dynamic t v) -> Dynamic t (Map k v)
207202distributeMapOverDynPure = fmap dmapToMap . distributeDMapOverDynPure . mapWithFunctorToDMap
208203
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−
214204-- | Convert a list with 'Dynamic' elements into a 'Dynamic' of a list with
215205-- non-'Dynamic' elements, preserving the order of the elements.
216206{-# DEPRECATED distributeListOverDynPure "Use 'distributeListOverDyn' instead" #-}
@@ -223,11 +213,6 @@ distributeListOverDynPure = distributeListOverDyn
223213joinDynThroughMap :: forall t k a. (Reflex t, Ord k) => Dynamic t (Map k (Dynamic t a)) -> Dynamic t (Map k a)
224214joinDynThroughMap = (distributeMapOverDynPure =<<)
225215
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−
231216-- | Print the value of the 'Dynamic' when it is first read and on each
232217-- subsequent change that is observed (as 'traceEvent'), prefixed with the
233218-- provided string. This should /only/ be used for debugging.
@@ -348,7 +333,7 @@ factorDyn d = buildDynamic (sample (current d) >>= holdKey) update where
348333--
349334-- > demuxed (demux d) k === fmap (== k) d
350335--
351−-- However, when 'demuxed' is used multiple times, the complexity is only
336+-- However, when getDemuxed is used multiple times, the complexity is only
352337-- /O(log(n))/, rather than /O(n)/ for fmap.
353338data Demux t k = Demux { demuxValue :: Behavior t k
354339 , 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+5−16
@@ -35,14 +35,12 @@ 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 (..))
@@ -98,17 +96,7 @@ data EventWriterState t w = EventWriterState
9896
9997-- | A basic implementation of 'EventWriter'.
10098newtype 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− )
99+ deriving (Functor, Applicative, Monad, MonadFix, MonadIO, MonadException, MonadAsyncException)
112100
113101-- | Run a 'EventWriterT' action.
114102runEventWriterT :: forall t m w a. (Reflex t, Monad m, Semigroup w) => EventWriterT t w m a -> m (a, Event t w)
@@ -128,6 +116,9 @@ instance (Reflex t, Monad m, Semigroup w) => EventWriter t w (EventWriterT t w m
128116 , _eventWriterState_told = (tellId myId :=> w) : _eventWriterState_told old
129117 }
130118
119+instance MonadTrans (EventWriterT t w) where
120+ lift = EventWriterT . lift
121+
131122instance MonadSample t m => MonadSample t (EventWriterT t w m) where
132123 sample = lift . sample
133124
@@ -142,8 +133,6 @@ instance MonadHold t m => MonadHold t (EventWriterT t w m) where
142133 buildDynamic a0 = lift . buildDynamic a0
143134 {-# INLINABLE headE #-}
144135 headE = lift . headE
145− {-# INLINABLE now #-}
146− now = lift now
147136
148137instance (Reflex t, Adjustable t m, MonadHold t m, Semigroup w) => Adjustable t (EventWriterT t w m) where
149138 runWithReplace = runWithReplaceEventWriterTWith $ \dm0 dm' -> lift $ runWithReplace dm0 dm'
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/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+59
@@ -0,0 +1,59 @@
1+{-# LANGUAGE DeriveFoldable #-}
2+{-# LANGUAGE DeriveFunctor #-}
3+{-# LANGUAGE DeriveTraversable #-}
4+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
5+{-# LANGUAGE TypeFamilies #-}
6+-- | Module containing 'PatchIntMap', a 'Patch' for 'IntMap' which allows for
7+-- insert/update or delete of associations.
8+module Reflex.Patch.IntMap where
9+
10+import Data.IntMap.Strict (IntMap)
11+import qualified Data.IntMap.Strict as IntMap
12+import Data.Maybe
13+import Data.Semigroup
14+import Reflex.Patch.Class
15+
16+-- | 'Patch' for 'IntMap' which represents insertion or deletion of keys in the mapping.
17+-- Internally represented by 'IntMap (Maybe a)', where @Just@ means insert/update
18+-- and @Nothing@ means delete.
19+newtype PatchIntMap a = PatchIntMap (IntMap (Maybe a)) deriving (Functor, Foldable, Traversable, Monoid)
20+
21+-- | Apply the insertions or deletions to a given 'IntMap'.
22+instance Patch (PatchIntMap a) where
23+ type PatchTarget (PatchIntMap a) = IntMap a
24+ apply (PatchIntMap p) v = if IntMap.null p then Nothing else Just $
25+ let removes = IntMap.filter isNothing p
26+ adds = IntMap.mapMaybe id p
27+ in IntMap.union adds $ v `IntMap.difference` removes
28+
29+-- | @a <> b@ will apply the changes of @b@ and then apply the changes of @a@.
30+-- If the same key is modified by both patches, the one on the left will take
31+-- precedence.
32+instance Semigroup (PatchIntMap v) where
33+ PatchIntMap a <> PatchIntMap b = PatchIntMap $ a `mappend` b --TODO: Add a semigroup instance for Map
34+ -- PatchMap is idempotent, so stimes n is id for every n
35+ stimes = stimesIdempotentMonoid
36+
37+-- | Map a function @Int -> a -> b@ over all @a@s in the given @'PatchIntMap' a@
38+-- (that is, all inserts/updates), producing a @PatchIntMap b@.
39+mapIntMapPatchWithKey :: (Int -> a -> b) -> PatchIntMap a -> PatchIntMap b
40+mapIntMapPatchWithKey f (PatchIntMap m) = PatchIntMap $ IntMap.mapWithKey (\ k mv -> f k <$> mv) m
41+
42+-- | Map an effectful function @Int -> a -> f b@ over all @a@s in the given @'PatchIntMap' a@
43+-- (that is, all inserts/updates), producing a @f (PatchIntMap b)@.
44+traverseIntMapPatchWithKey :: Applicative f => (Int -> a -> f b) -> PatchIntMap a -> f (PatchIntMap b)
45+traverseIntMapPatchWithKey f (PatchIntMap m) = PatchIntMap <$> IntMap.traverseWithKey (\k mv -> traverse (f k) mv) m
46+
47+-- | Extract all @a@s inserted/updated by the given @'PatchIntMap' a@.
48+patchIntMapNewElements :: PatchIntMap a -> [a]
49+patchIntMapNewElements (PatchIntMap m) = catMaybes $ IntMap.elems m
50+
51+-- | Convert the given @'PatchIntMap' a@ into an @'IntMap' a@ with all
52+-- the inserts/updates in the given patch.
53+patchIntMapNewElementsMap :: PatchIntMap a -> IntMap a
54+patchIntMapNewElementsMap (PatchIntMap m) = IntMap.mapMaybe id m
55+
56+-- | Subset the given @'IntMap' a@ to contain only the keys that would be
57+-- deleted by the given @'PatchIntMap' a@.
58+getDeletions :: PatchIntMap v -> IntMap v' -> IntMap v'
59+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+1−3
@@ -141,7 +141,7 @@ hostPerformEventT a = do
141141 case mToPerform of
142142 Nothing -> return [result']
143143 Just toPerform -> do
144− responses <- runHostFrame $ traverseRequesterData (fmap Identity) toPerform
144+ responses <- runHostFrame $ traverseRequesterData (Identity <$>) toPerform
145145 mrt <- readRef responseTrigger
146146 let followupEventTriggers = case mrt of
147147 Just rt -> [rt :=> Identity responses]
@@ -164,8 +164,6 @@ instance (ReflexHost t, MonadHold t m) => MonadHold t (PerformEventT t m) where
164164 buildDynamic getV0 v' = PerformEventT $ lift $ buildDynamic getV0 v'
165165 {-# INLINABLE headE #-}
166166 headE = PerformEventT . lift . headE
167− {-# INLINABLE now #-}
168− now = PerformEventT . lift $ now
169167
170168instance (MonadRef (HostFrame t), ReflexHost t) => MonadRef (PerformEventT t m) where
171169 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+27−97
@@ -1,7 +1,6 @@
11-- | This module provides 'RequesterT', the standard implementation of
22-- 'Requester'.
33{-# LANGUAGE AllowAmbiguousTypes #-}
4−{-# LANGUAGE ApplicativeDo #-}
54{-# LANGUAGE CPP #-}
65{-# LANGUAGE EmptyDataDecls #-}
76{-# LANGUAGE ExistentialQuantification #-}
@@ -33,7 +32,6 @@ module Reflex.Requester.Base
3332 , requesterDataToList
3433 , singletonRequesterData
3534 , matchResponsesWithRequests
36− , matchResponseMapWithRequests
3735 , multiEntry
3836 , unMultiEntry
3937 , requesting'
@@ -51,17 +49,14 @@ import Reflex.TriggerEvent.Class
5149import Control.Applicative (liftA2)
5250import Control.Monad.Exception
5351import Control.Monad.Identity
54−import Control.Monad.Morph
5552import Control.Monad.Primitive
5653import Control.Monad.Reader
5754import Control.Monad.Ref
5855import Control.Monad.State.Strict
5956import Data.Bits
6057import Data.Coerce
61−import Data.Constraint
62−import Data.Dependent.Map (DMap)
58+import Data.Dependent.Map (DMap, DSum (..))
6359import qualified Data.Dependent.Map as DMap
64−import Data.Dependent.Sum (DSum (..))
6560import Data.Functor.Compose
6661import Data.Functor.Misc
6762import Data.IntMap.Strict (IntMap)
@@ -84,51 +79,19 @@ newtype TagMap (f :: * -> *) = TagMap (IntMap Any)
8479
8580newtype RequesterData f = RequesterData (TagMap (Entry f))
8681
87−emptyRequesterData :: RequesterData f
88−emptyRequesterData = RequesterData $ TagMap IntMap.empty
89−
9082data RequesterDataKey a where
9183 RequesterDataKey_Single :: {-# UNPACK #-} !(MyTag (Single a)) -> RequesterDataKey a
9284 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
85+ RequesterDataKey_Multi2 :: {-# UNPACK #-} !(MyTag (Multi2 k)) -> !(Some k) -> {-# UNPACK #-} !Int -> !(RequesterDataKey a) -> RequesterDataKey a
9486 RequesterDataKey_Multi3 :: {-# UNPACK #-} !(MyTag Multi3) -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> !(RequesterDataKey a) -> RequesterDataKey a
9587
9688singletonRequesterData :: RequesterDataKey a -> f a -> RequesterData f
9789singletonRequesterData rdk v = case rdk of
9890 RequesterDataKey_Single k -> RequesterData $ singletonTagMap k $ Entry v
9991 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− }
92+ RequesterDataKey_Multi2 k k' k'' k''' -> RequesterData $ singletonTagMap k $ Entry $ Map.singleton k' $ IntMap.singleton k'' $ singletonRequesterData k''' v
10493 RequesterDataKey_Multi3 k k' k'' k''' -> RequesterData $ singletonTagMap k $ Entry $ IntMap.singleton k' $ IntMap.singleton k'' $ singletonRequesterData k''' v
10594
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−
13295requesterDataToList :: RequesterData f -> [DSum RequesterDataKey f]
13396requesterDataToList (RequesterData m) = do
13497 k :=> Entry e <- tagMapToList m
@@ -138,12 +101,11 @@ requesterDataToList (RequesterData m) = do
138101 (k', e') <- IntMap.toList e
139102 k'' :=> e'' <- requesterDataToList e'
140103 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'''
104+ MyTagType_Multi2 -> do
105+ (k', e') <- Map.toList e
106+ (k'', e'') <- IntMap.toList e'
107+ k''' :=> e''' <- requesterDataToList e''
108+ return $ RequesterDataKey_Multi2 k k' k'' k''' :=> e'''
147109 MyTagType_Multi3 -> do
148110 (k', e') <- IntMap.toList e
149111 (k'', e'') <- IntMap.toList e'
@@ -171,13 +133,7 @@ traverseRequesterData f (RequesterData m) = RequesterData <$> traverseTagMapWith
171133 go k (Entry request) = Entry <$> case myKeyType k of
172134 MyTagType_Single -> f request
173135 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− }
136+ MyTagType_Multi2 -> traverse (traverse (traverseRequesterData f)) request
181137 MyTagType_Multi3 -> traverse (traverse (traverseRequesterData f)) request
182138
183139-- | 'traverseRequesterData' with its arguments flipped
@@ -221,14 +177,9 @@ instance MyTagTypeOffset Multi3 where
221177type family EntryContents request a where
222178 EntryContents request (Single a) = request a
223179 EntryContents request Multi = IntMap (RequesterData request)
224− EntryContents request (Multi2 k) = Multi2Contents k request
180+ EntryContents request (Multi2 k) = Map (Some k) (IntMap (RequesterData request))
225181 EntryContents request Multi3 = IntMap (IntMap (RequesterData request))
226182
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−
232183newtype Entry request x = Entry { unEntry :: EntryContents request x }
233184
234185{-# INLINE singleEntry #-}
@@ -357,7 +308,7 @@ tagRequest req = do
357308 return t
358309
359310{-# 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))
311+responseFromTag :: Monad m => MyTagWrap response (Entry response x) -> RequesterT t request response m (Event t (Entry response x))
361312responseFromTag (MyTagWrap t) = do
362313 responses :: EventSelectorInt t Any <- RequesterT ask
363314 return $ (unsafeCoerce :: Event t Any -> Event t (Entry response x)) $ selectInt responses t
@@ -365,9 +316,6 @@ responseFromTag (MyTagWrap t) = do
365316instance MonadTrans (RequesterT t request response) where
366317 lift = RequesterT . lift . lift
367318
368−instance MFunctor (RequesterT t request response) where
369− hoist f = RequesterT . hoist (hoist f) . unRequesterT
370−
371319instance PerformEvent t m => PerformEvent t (RequesterT t request response m) where
372320 type Performable (RequesterT t request response m) = Performable m
373321 performEvent_ = lift . performEvent_
@@ -487,9 +435,9 @@ traverseDMapWithKeyWithAdjustRequesterTWith base mapPatch weakenPatchWith patchN
487435 let responses :: EventSelector t (Const2 (Some k) (IntMap (RequesterData response)))
488436 responses = fanMap $ fmapCheap unpack response
489437 unpack :: Entry response (Multi2 k) -> Map (Some k) (IntMap (RequesterData response))
490− unpack = _multi2Contents_values . unEntry
438+ unpack = unEntry
491439 pack :: Map (Some k) (IntMap (RequesterData request)) -> Entry request (Multi2 k)
492− pack m = Entry $ Multi2Contents { _multi2Contents_values = m, _multi2Contents_dict = Dict }
440+ pack = Entry
493441 f' :: forall a. k a -> Compose ((,) Int) v a -> m (Compose ((,) (Event t (IntMap (RequesterData request)))) v' a)
494442 f' k (Compose (n, v)) = do
495443 (result, myRequests) <- runRequesterT (f k v) $ mapMaybeCheap (IntMap.lookup n) $ select responses (Const2 (Some k))
@@ -510,30 +458,10 @@ traverseDMapWithKeyWithAdjustRequesterTWith base mapPatch weakenPatchWith patchN
510458data Decoder rawResponse response =
511459 forall a. Decoder (RequesterDataKey a) (rawResponse -> response a)
512460
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−
533461-- | Matches incoming responses with previously-sent requests
534462-- and uses the provided request "decoder" function to process
535463-- incoming responses.
536−matchResponseMapWithRequests
464+matchResponsesWithRequests
537465 :: forall t rawRequest rawResponse request response m.
538466 ( MonadFix m
539467 , MonadHold t m
@@ -544,14 +472,14 @@ matchResponseMapWithRequests
544472 -- request and a function used to process the associated response
545473 -> Event t (RequesterData request)
546474 -- ^ The outgoing requests
547− -> Event t (Map Int rawResponse)
548− -- ^ A map of incoming responses, tagged by an identifying key
475+ -> Event t (Int, rawResponse)
476+ -- ^ The incoming responses, tagged by an identifying key
549477 -> m ( Event t (Map Int rawRequest)
550478 , Event t (RequesterData response)
551479 )
552480 -- ^ A map of outgoing wire-format requests and an event of responses keyed
553481 -- by the 'RequesterData' key of the associated outgoing request
554−matchResponseMapWithRequests f send recv = do
482+matchResponsesWithRequests f send recv = do
555483 rec nextId <- hold 1 $ fmap (\(next, _, _) -> next) outgoing
556484 waitingFor :: Incremental t (PatchMap Int (Decoder rawResponse response)) <-
557485 holdIncremental mempty $ leftmost
@@ -593,15 +521,17 @@ matchResponseMapWithRequests f send recv = do
593521 processIncoming
594522 :: Incremental t (PatchMap Int (Decoder rawResponse response))
595523 -- A map of outstanding expected responses
596− -> Event t (Map Int rawResponse)
524+ -> Event t (Int, rawResponse)
597525 -- A incoming response paired with its identifying key
598526 -> Event t (RequesterData response, PatchMap Int v)
599527 -- The decoded response and a patch that clears the outstanding responses queue
600− processIncoming waitingFor inc = flip push inc $ \rspMap -> do
528+ processIncoming waitingFor inc = flip push inc $ \(n, rawRsp) -> do
601529 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)
530+ case Map.lookup n wf of
531+ Nothing -> return Nothing -- TODO How should lookup failures be handled here? They shouldn't ever happen..
532+ Just (Decoder k rspF) -> do
533+ let rsp = rspF rawRsp
534+ return $ Just
535+ ( singletonRequesterData k rsp
536+ , PatchMap $ Map.singleton n Nothing
537+ )
src/Reflex/Spider/Internal.hs+169−340
@@ -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,11 +59,10 @@ 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)
7067import GHC.Exts hiding (toList)
7168import GHC.IORef (IORef (..))
@@ -75,23 +72,19 @@ 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
9689import Data.FastWeakBag (FastWeakBag, FastWeakBagTicket)
9790import qualified Data.FastWeakBag as FastWeakBag
@@ -106,65 +99,28 @@ import qualified Reflex.Class
10699import qualified Reflex.Class as R
107100import qualified Reflex.Host.Class
108101import Reflex.NotReady.Class
109−import Data.Patch
110−import qualified Data.Patch.DMapWithMove as PatchDMapWithMove
111−import Reflex.PerformEvent.Base (PerformEventT)
102+import Reflex.Patch
103+import qualified Reflex.Patch.DMapWithMove as PatchDMapWithMove
112104
113105#ifdef DEBUG_TRACE_EVENTS
114106import qualified Data.ByteString.Char8 as BS8
115107import System.IO (stderr)
116108import Data.List (isPrefixOf)
117−#endif
118−
119−-- TODO stdout might not be the best channel for debug output
120−debugStrLn :: String -> IO ()
121−debugStrLn = putStrLn
122109
123−#ifdef DEBUG_TRACE_EVENTS
124110withStackOneLine :: (BS8.ByteString -> a) -> a
125111withStackOneLine expr = unsafePerformIO $ do
126112 stack <- currentCallStack
127113 return (expr . BS8.pack . unwords . dropInternal . reverse $ stack)
128− where dropInternal = filterStack "Reflex.Spider.Internal"
114+ where dropInternal = filter (not . isPrefixOf "Reflex.Spider.Internal")
129115
130116#endif
131117
132−debugPropagate :: Bool
133−
134−debugInvalidateHeight :: Bool
135−
136−debugInvalidate :: Bool
137−
138118#ifdef DEBUG
139119#define DEBUG_NODEIDS
140120
141−#ifdef DEBUG_TRACE_PROPAGATION
142−debugPropagate = True
143−#else
144−debugPropagate = False
145−#endif
146−
147−#ifdef DEBUG_TRACE_HEIGHT
148−debugInvalidateHeight = True
149−#else
150−debugInvalidateHeight = False
151−#endif
152−
153−#ifdef DEBUG_TRACE_INVALIDATION
154−debugInvalidate = True
155−#else
156−debugInvalidate = False
157−#endif
158−
159121class HasNodeId a where
160122 getNodeId :: a -> Int
161123
162−instance HasNodeId (CacheSubscribed x a) where
163− getNodeId = _cacheSubscribed_nodeId
164−
165−instance HasNodeId (FanInt x a) where
166− getNodeId = _fanInt_nodeId
167−
168124instance HasNodeId (Hold x p) where
169125 getNodeId = holdNodeId
170126
@@ -185,27 +141,16 @@ instance HasNodeId (Pull x a) where
185141
186142{-# INLINE showNodeId #-}
187143showNodeId :: HasNodeId a => a -> String
188−showNodeId = showNodeId' . getNodeId
189−
190−showNodeId' :: Int -> String
191−showNodeId' = ("#"<>) . show
144+showNodeId = ("#"<>) . show . getNodeId
192145
193146
194147#else
195148
196−debugPropagate = False
197−debugInvalidateHeight = False
198−debugInvalidate = False
199−
200149-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
201150{-# INLINE showNodeId #-}
202151showNodeId :: a -> String
203152showNodeId _ = ""
204153
205−{-# INLINE showNodeId' #-}
206−showNodeId' :: Int -> String
207−showNodeId' _ = ""
208−
209154#endif
210155
211156#ifdef DEBUG_NODEIDS
@@ -251,9 +196,9 @@ subscribeAndRead = unEvent
251196-- caching; if the computation function is very cheap, this is (much) more
252197-- efficient than 'push'
253198{-# INLINE [1] pushCheap #-}
254−pushCheap :: HasSpiderTimeline x => (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
199+pushCheap :: (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
255200pushCheap !f e = Event $ \sub -> do
256− (subscription, occ) <- subscribeAndRead e $ debugSubscriber' "push" $ sub
201+ (subscription, occ) <- subscribeAndRead e $ sub
257202 { subscriberPropagate = \a -> do
258203 mb <- f a
259204 mapM_ (subscriberPropagate sub) mb
@@ -272,10 +217,10 @@ terminalSubscriber p = Subscriber
272217
273218-- | Subscribe to an Event only for the duration of one occurrence
274219{-# INLINE subscribeAndReadHead #-}
275−subscribeAndReadHead :: HasSpiderTimeline x => Event x a -> Subscriber x a -> EventM x (EventSubscription x, Maybe a)
220+subscribeAndReadHead :: Event x a -> Subscriber x a -> EventM x (EventSubscription x, Maybe a)
276221subscribeAndReadHead e sub = do
277222 subscriptionRef <- liftIO $ newIORef $ error "subscribeAndReadHead: not initialized"
278− (subscription, occ) <- subscribeAndRead e $ debugSubscriber' "head" $ sub
223+ (subscription, occ) <- subscribeAndRead e $ sub
279224 { subscriberPropagate = \a -> do
280225 liftIO $ unsubscribe =<< readIORef subscriptionRef
281226 subscriberPropagate sub a
@@ -286,42 +231,24 @@ subscribeAndReadHead e sub = do
286231 return (subscription, occ)
287232
288233--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)
234+headE :: (MonadIO m, Defer (SomeMergeInit x) m) => Event x a -> m (Event x a)
290235headE originalE = do
291236 parent <- liftIO $ newIORef $ Just originalE
292237 defer $ SomeMergeInit $ do --TODO: Rename SomeMergeInit appropriately
293238 let clearParent = liftIO $ writeIORef parent Nothing
294− (_, occ) <- subscribeAndReadHead originalE $ terminalSubscriber $ const clearParent
239+ (_, occ) <- subscribeAndReadHead originalE $ terminalSubscriber $ \_ -> clearParent
295240 when (isJust occ) clearParent
296− return $ Event $ \sub ->
241+ return $ Event $ \sub -> do
297242 liftIO (readIORef parent) >>= \case
298− Nothing -> subscribeAndReadNever
243+ Nothing -> subscribeAndReadNever
299244 Just e -> subscribeAndReadHead e sub
300245
301246data CacheSubscribed x a
302247 = CacheSubscribed { _cacheSubscribed_subscribers :: {-# UNPACK #-} !(FastWeakBag (Subscriber x a))
303248 , _cacheSubscribed_parent :: {-# UNPACK #-} !(EventSubscription x)
304249 , _cacheSubscribed_occurrence :: {-# UNPACK #-} !(IORef (Maybe a))
305−#ifdef DEBUG_NODEIDS
306− , _cacheSubscribed_nodeId :: {-# UNPACK #-} !Int
307−#endif
308250 }
309251
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−
325252-- | Construct an 'Event' whose value is guaranteed not to be recomputed
326253-- repeatedly
327254--
@@ -346,23 +273,16 @@ cacheEvent e =
346273 subscribedTicket <- liftIO (readIORef mSubscribedRef >>= getFastWeakTicket) >>= \case
347274 Just subscribedTicket -> return subscribedTicket
348275 Nothing -> do
349−#ifdef DEBUG_NODEIDS
350− nodeId <- liftIO newNodeId
351−#endif
352276 subscribers <- liftIO FastWeakBag.empty
353277 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
357278 (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− }
279+ { subscriberPropagate = \a -> do
280+ liftIO $ writeIORef occRef (Just a)
281+ scheduleClear occRef
282+ propagateFast a subscribers
283+ , subscriberInvalidateHeight = FastWeakBag.traverse subscribers . invalidateSubscriberHeight
284+ , subscriberRecalculateHeight = FastWeakBag.traverse subscribers . recalculateSubscriberHeight
285+ }
366286 when (isJust occ) $ do
367287 liftIO $ writeIORef occRef occ -- Set the initial value of occRef; we don't need to do this if occ is Nothing
368288 scheduleClear occRef
@@ -370,22 +290,19 @@ cacheEvent e =
370290 { _cacheSubscribed_subscribers = subscribers
371291 , _cacheSubscribed_parent = parentSub
372292 , _cacheSubscribed_occurrence = occRef
373−#ifdef DEBUG_NODEIDS
374− , _cacheSubscribed_nodeId = nodeId
375−#endif
376293 }
377294 subscribedTicket <- liftIO $ mkFastWeakTicket subscribed
378295 liftIO $ writeIORef mSubscribedRef =<< getFastWeakTicketWeak subscribedTicket
379296 return subscribedTicket
380297 liftIO $ cacheSubscription sub mSubscribedRef subscribedTicket
381298
382−cacheSubscription :: Subscriber x a -> IORef (FastWeak (CacheSubscribed x a))
299+cacheSubscription :: Subscriber x a -> IORef (FastWeak (CacheSubscribed x a))
383300 -> FastWeakTicket (CacheSubscribed x a) -> IO (EventSubscription x, Maybe a)
384−cacheSubscription sub mSubscribedRef subscribedTicket = do
301+cacheSubscription sub mSubscribedRef subscribedTicket = do
385302 subscribed <- getFastWeakTicketValue subscribedTicket
386303 ticket <- FastWeakBag.insert sub $ _cacheSubscribed_subscribers subscribed
387304 occ <- readIORef $ _cacheSubscribed_occurrence subscribed
388−
305+
389306 let parentSub = _cacheSubscribed_parent subscribed
390307 es = EventSubscription
391308 { _eventSubscription_unsubscribe = do
@@ -404,9 +321,9 @@ cacheSubscription sub mSubscribedRef subscribedTicket = do
404321 , eventSubscribedGetParents = return [_eventSubscription_subscribed parentSub]
405322 , eventSubscribedHasOwnHeightRef = False
406323 , eventSubscribedWhoCreated = whoCreatedIORef mSubscribedRef
407−#endif
408324 }
409− }
325+#endif
326+ }
410327 return (es, occ)
411328
412329
@@ -464,6 +381,16 @@ data Subscriber x a = Subscriber
464381 , subscriberRecalculateHeight :: !(Height -> IO ())
465382 }
466383
384+--TODO: Move this comment to WeakBag
385+-- These function are constructor functions that are marked NOINLINE so they are
386+-- opaque to GHC. If we do not do this, then GHC will sometimes fuse the constructor away
387+-- so any weak references that are attached to the constructors will have their
388+-- finalizer run. Using the opaque constructor, does not see the
389+-- constructor application, so it behaves like an IORef and cannot be fused away.
390+--
391+-- The result is also evaluated to WHNF, since forcing a thunk invalidates
392+-- the weak pointer to it in some cases.
393+
467394newSubscriberHold :: (HasSpiderTimeline x, Patch p) => Hold x p -> IO (Subscriber x p)
468395newSubscriberHold h = return $ Subscriber
469396 { subscriberPropagate = {-# SCC "traverseHold" #-} propagateSubscriberHold h
@@ -485,12 +412,14 @@ newSubscriberFan subscribed = debugSubscriber ("SubscriberFan " <> showNodeId su
485412 return ()
486413 , subscriberInvalidateHeight = \old -> do
487414 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
488− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
415+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
416+
489417 , subscriberRecalculateHeight = \new -> do
490418 subscribers <- readIORef $ fanSubscribedSubscribers subscribed
491− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse_ (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
419+ forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
492420 }
493421
422+
494423newSubscriberSwitch :: forall x a. HasSpiderTimeline x => SwitchSubscribed x a -> IO (Subscriber x a)
495424newSubscriberSwitch subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <> showNodeId subscribed) $ Subscriber
496425 { subscriberPropagate = \a -> {-# SCC "traverseSwitch" #-} do
@@ -501,7 +430,7 @@ newSubscriberSwitch subscribed = debugSubscriber ("SubscriberCoincidenceOuter" <
501430 oldHeight <- readIORef $ switchSubscribedHeight subscribed
502431 when (oldHeight /= invalidHeight) $ do
503432 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
504− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
433+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
505434 , subscriberRecalculateHeight = (`updateSwitchHeight` subscribed)
506435 }
507436
@@ -517,17 +446,17 @@ newSubscriberCoincidenceOuter subscribed = debugSubscriber ("SubscriberCoinciden
517446 liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
518447 scheduleClear $ coincidenceSubscribedInnerParent subscribed
519448 case occ of
520− Nothing ->
449+ Nothing -> do
521450 when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
522451 writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
523− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
524− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
452+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
453+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
525454 Just o -> do -- Since it's already firing, no need to adjust height
526455 liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
527456 scheduleClear $ coincidenceSubscribedOccurrence subscribed
528457 propagate o $ coincidenceSubscribedSubscribers subscribed
529458 , subscriberInvalidateHeight = \_ -> invalidateCoincidenceHeight subscribed
530− , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
459+ , subscriberRecalculateHeight = \_ -> recalculateCoincidenceHeight subscribed
531460 }
532461
533462newSubscriberCoincidenceInner :: forall x a. HasSpiderTimeline x => CoincidenceSubscribed x a -> IO (Subscriber x a)
@@ -551,18 +480,18 @@ recalculateSubscriberHeight :: Height -> Subscriber x a -> IO ()
551480recalculateSubscriberHeight = flip subscriberRecalculateHeight
552481
553482-- | 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) $
483+propagate :: a -> WeakBag (Subscriber x a) -> EventM x ()
484+propagate a subscribers = withIncreasedDepth (Proxy::Proxy x) $ do
556485 -- 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
557486 --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
487+ WeakBag.traverse subscribers $ \s -> subscriberPropagate s a
559488
560489-- | 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) $
490+propagateFast :: a -> FastWeakBag (Subscriber x a) -> EventM x ()
491+propagateFast a subscribers = withIncreasedDepth (Proxy::Proxy x) $ do
563492 -- 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
564493 --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
494+ FastWeakBag.traverse subscribers $ \s -> subscriberPropagate s a
566495
567496--------------------------------------------------------------------------------
568497-- EventSubscribed
@@ -607,16 +536,6 @@ eventSubscribedNever = EventSubscribed
607536 , eventSubscribedWhoCreated = return ["never"]
608537#endif
609538 }
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− }
620539
621540eventSubscribedFan :: FanSubscribed x k v -> EventSubscribed x
622541eventSubscribedFan !subscribed = EventSubscribed
@@ -994,10 +913,8 @@ instance Monad (BehaviorM x) where
994913 BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
995914 {-# INLINE return #-}
996915 return x = BehaviorM $ return x
997−#if !MIN_VERSION_base(4,13,0)
998916 {-# INLINE fail #-}
999917 fail s = BehaviorM $ fail s
1000−#endif
1001918
1002919data BehaviorSubscribed x a
1003920 = forall p. BehaviorSubscribedHold (Hold x p)
@@ -1057,7 +974,7 @@ data SomeMergeUpdate x = SomeMergeUpdate
1057974newtype SomeMergeInit x = SomeMergeInit { unSomeMergeInit :: EventM x () }
1058975
1059976-- 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)
977+newtype EventM x a = EventM { unEventM :: IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadException, MonadAsyncException)
1061978
1062979newtype MergeSubscribedParent x a = MergeSubscribedParent { unMergeSubscribedParent :: EventSubscription x }
1063980
@@ -1082,8 +999,7 @@ heightBagFromList :: [Height] -> HeightBag
1082999heightBagFromList heights = heightBagVerify $ foldl' (flip heightBagAdd) heightBagEmpty heights
10831000
10841001heightBagAdd :: Height -> HeightBag -> HeightBag
1085−heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $
1086− IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
1002+heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
10871003
10881004heightBagRemove :: Height -> HeightBag -> HeightBag
10891005heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.lookup h c of
@@ -1092,13 +1008,6 @@ heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.loo
10921008 0 -> IntMap.delete h c
10931009 _ -> IntMap.insert h (pred old) c
10941010
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−
11021011heightBagMax :: HeightBag -> Height
11031012heightBagMax (HeightBag _ c) = case IntMap.maxViewWithKey c of
11041013 Just ((h, _), _) -> Height h
@@ -1199,10 +1108,7 @@ instance HasSpiderTimeline x => Semialign (Event x) where
11991108 align ea eb = mapMaybe dmapToThese $ mergeG coerce $ dynamicConst $
12001109 DMap.fromDistinctAscList [LeftTag :=> ea, RightTag :=> eb]
12011110
1202−#ifdef MIN_VERSION_semialign
1203−#if MIN_VERSION_semialign(1,1,0)
1204−instance HasSpiderTimeline x => Zip (Event x) where
1205−#endif
1111+#if defined(MIN_VERSION_semialign)
12061112 zip x y = mapMaybe justThese $ align x y
12071113#endif
12081114
@@ -1346,7 +1252,7 @@ mkWeakPtrWithDebug x debugNote = do
13461252 x' <- evaluate x
13471253 mkWeakPtr x' $
13481254 if debugFinalize
1349− then Just $ debugStrLn $ "finalizing: " ++ debugNote
1255+ then Just $ putStrLn $ "finalizing: " ++ debugNote
13501256 else Nothing
13511257
13521258type WeakList a = [Weak a]
@@ -1359,22 +1265,19 @@ type CanTrace x m = (HasSpiderTimeline x, MonadIO m)
13591265#ifdef DEBUG
13601266
13611267debugSubscriber :: 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
1268+debugSubscriber description subscribed = return $ Subscriber
13661269 {
13671270 subscriberPropagate = \m -> do
13681271 tracePropagate (Proxy :: Proxy x) ("subscriberPropagate: " <> description)
13691272 subscriberPropagate subscribed m
13701273 , subscriberInvalidateHeight = \old -> do
1371− traceInvalidateHeight $ "invalidateSubscriberHeight: " <> description <> ", old = " <> show (unHeight old)
1274+ putStrLn $ "invalidateSubscriberHeight: " <> description
13721275 subscriberInvalidateHeight subscribed old
1373− traceInvalidateHeight $ "invalidateSubscriberHeight: " <> description <> ", done"
1276+ putStrLn $ "invalidateSubscriberHeight: " <> description <> ", done"
13741277 , subscriberRecalculateHeight = \new -> do
1375− traceInvalidateHeight $ "subscriberRecalculateHeight: " <> description <> ", new = " <> show (unHeight new)
1278+ putStrLn $ "subscriberRecalculateHeight: " <> description
13761279 subscriberRecalculateHeight subscribed new
1377− traceInvalidateHeight $ "subscriberRecalculateHeight: " <> description <> ", done"
1280+ putStrLn $ "subscriberRecalculateHeight: " <> description <> ", done"
13781281 }
13791282
13801283
@@ -1388,15 +1291,11 @@ withIncreasedDepth _ a = do
13881291
13891292{-# INLINE tracePropagate #-}
13901293tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1391−tracePropagate p = when debugPropagate . trace p
1294+tracePropagate p = trace p
13921295
13931296{-# INLINE traceInvalidate #-}
13941297traceInvalidate :: String -> IO ()
1395−traceInvalidate = when debugInvalidate . liftIO . debugStrLn
1396−
1397−{-# INLINE traceInvalidateHeight #-}
1398−traceInvalidateHeight :: String -> IO ()
1399−traceInvalidateHeight = when debugInvalidateHeight . liftIO . debugStrLn
1298+traceInvalidate = liftIO . putStrLn
14001299
14011300{-# INLINE trace #-}
14021301trace :: (CanTrace x m) => proxy x -> String -> m ()
@@ -1407,7 +1306,7 @@ traceM :: forall x proxy m. (CanTrace x m) => proxy x -> m String -> m ()
14071306traceM _ getMessage = do
14081307 message <- getMessage
14091308 d <- liftIO $ readIORef $ _spiderTimeline_depth $ unSTE (spiderTimeline :: SpiderTimelineEnv x)
1410− liftIO $ debugStrLn $ replicate d ' ' <> message
1309+ liftIO $ putStrLn $ replicate d ' ' <> message
14111310
14121311#else
14131312
@@ -1423,20 +1322,10 @@ tracePropagate _ _ = return ()
14231322traceInvalidate :: String -> IO ()
14241323traceInvalidate _ = return ()
14251324
1426−{-# INLINE traceInvalidateHeight #-}
1427−traceInvalidateHeight :: String -> IO ()
1428−traceInvalidateHeight _ = return ()
1429−
14301325{-# INLINE debugSubscriber #-}
14311326debugSubscriber :: String -> Subscriber x a -> IO (Subscriber x a)
14321327debugSubscriber _ = return
14331328
1434−{-# INLINE debugSubscriber' #-}
1435−debugSubscriber' :: String -> Subscriber x a -> Subscriber x a
1436−debugSubscriber' _ = id
1437−
1438−
1439−
14401329{-# INLINE trace #-}
14411330trace :: (CanTrace x m) => proxy x -> String -> m ()
14421331trace _ _ = return ()
@@ -1447,9 +1336,18 @@ traceM _ _ = return ()
14471336
14481337#endif
14491338
1339+
14501340whoCreatedIORef :: IORef a -> IO [String]
14511341whoCreatedIORef (IORef a) = whoCreated $! a
14521342
1343+#ifdef DEBUG_CYCLES
1344+
1345+data EventLoopException = EventLoopException (Forest String)
1346+instance Exception EventLoopException
1347+
1348+instance Show EventLoopException where
1349+ show (EventLoopException stacks) = "Causality loop detected:\n" <> drawForest stacks
1350+
14531351groupByHead :: Eq a => [NonEmpty a] -> [(a, NonEmpty [a])]
14541352groupByHead = \case
14551353 [] -> []
@@ -1460,28 +1358,7 @@ groupByHead = \case
14601358 | otherwise -> (x, xs :| []) : l
14611359
14621360listsToForest :: 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
1361+listsToForest l = fmap (\(a, l') -> Node a $ listsToForest $ toList l') $ groupByHead $ catMaybes $ fmap nonEmpty l
14851362
14861363#else
14871364
@@ -1489,8 +1366,8 @@ data EventLoopException = EventLoopException
14891366instance Exception EventLoopException
14901367
14911368instance 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"
1369+ show EventLoopException = "Causality loop detected: \n" <>
1370+ "no location information, compile with --enable-profiling and reflex with flag 'debug-cycles'"
14941371
14951372#endif
14961373
@@ -1498,7 +1375,7 @@ instance Show EventLoopException where
14981375{-# INLINE propagateSubscriberHold #-}
14991376propagateSubscriberHold :: forall x p. (HasSpiderTimeline x, Patch p) => Hold x p -> p -> EventM x ()
15001377propagateSubscriberHold h a = do
1501− {-# SCC "trace" #-} when debugPropagate $ traceM (Proxy :: Proxy x) $ liftIO $ do
1378+ traceM (Proxy :: Proxy x) $ liftIO $ do
15021379 invalidators <- liftIO $ readIORef $ holdInvalidators h
15031380 return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
15041381
@@ -1506,7 +1383,7 @@ propagateSubscriberHold h a = do
15061383 case {-# SCC "apply" #-} apply a v of
15071384 Nothing -> return ()
15081385 Just v' -> do
1509− {-# SCC "trace2" #-} withIncreasedDepth (Proxy :: Proxy x) $
1386+ withIncreasedDepth (Proxy :: Proxy x) $
15101387 tracePropagate (Proxy :: Proxy x) ("propagateSubscriberHold: assigning Hold" <> showNodeId h)
15111388 vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
15121389 iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
@@ -1627,9 +1504,6 @@ data FanInt x a = FanInt
16271504 { _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
16281505 , _fanInt_subscriptionRef :: {-# UNPACK #-} !(IORef (EventSubscription x)) -- This should have a valid subscription iff subscribers is non-empty
16291506 , _fanInt_occRef :: {-# UNPACK #-} !(IORef (IntMap a))
1630−#ifdef DEBUG_NODEIDS
1631− , _fanInt_nodeId :: {-# UNPACK #-} !Int
1632−#endif
16331507 }
16341508
16351509newFanInt :: IO (FanInt x a)
@@ -1637,16 +1511,10 @@ newFanInt = do
16371511 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
16381512 subscriptionRef <- newIORef $ error "fanInt: no subscription"
16391513 occRef <- newIORef $ error "fanInt: no occurrence"
1640−#ifdef DEBUG_NODEIDS
1641− nodeId <- newNodeId
1642−#endif
16431514 return $ FanInt
16441515 { _fanInt_subscribers = subscribers
16451516 , _fanInt_subscriptionRef = subscriptionRef
16461517 , _fanInt_occRef = occRef
1647−#ifdef DEBUG_NODEIDS
1648− , _fanInt_nodeId = nodeId
1649−#endif
16501518 }
16511519
16521520fanInt :: HasSpiderTimeline x => Event x (IntMap a) -> EventSelectorInt x a
@@ -1655,21 +1523,20 @@ fanInt p = unsafePerformIO $ do
16551523 pure $ EventSelectorInt $ \k -> Event $ \sub -> do
16561524 isEmpty <- liftIO $ FastMutableIntMap.isEmpty (_fanInt_subscribers self)
16571525 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
1526+ (subscription, parentOcc) <- subscribeAndRead p $ Subscriber
16601527 { subscriberPropagate = \m -> do
16611528 liftIO $ writeIORef (_fanInt_occRef self) m
16621529 scheduleIntClear $ _fanInt_occRef self
16631530 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 ->
1531+ FastWeakBag.traverse b $ \s ->
16651532 subscriberPropagate s v
1666− , subscriberInvalidateHeight = \old ->
1667− FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1668− FastWeakBag.traverse_ b $ \s ->
1533+ , subscriberInvalidateHeight = \old ->
1534+ FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1535+ FastWeakBag.traverse b $ \s ->
16691536 subscriberInvalidateHeight s old
16701537 , subscriberRecalculateHeight = \new ->
1671− FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1672− FastWeakBag.traverse_ b $ \s ->
1538+ FastMutableIntMap.for_ (_fanInt_subscribers self) $ \b ->
1539+ FastWeakBag.traverse b $ \s ->
16731540 subscriberRecalculateHeight s new
16741541 }
16751542 liftIO $ do
@@ -1685,14 +1552,14 @@ fanInt p = unsafePerformIO $ do
16851552 Just b -> return b
16861553 ticket <- liftIO $ FastWeakBag.insert sub b
16871554 currentOcc <- readIORef (_fanInt_occRef self)
1688−
1555+
16891556 subscribed <- fanIntSubscribed ticket self
16901557 return (EventSubscription (FastWeakBag.remove ticket) subscribed, IntMap.lookup k currentOcc)
16911558
16921559fanIntSubscribed :: FastWeakBagTicket k -> FanInt x a -> IO (EventSubscribed x)
1693−fanIntSubscribed ticket self = do
1560+fanIntSubscribed ticket self = do
16941561 subscribedParent <- _eventSubscription_subscribed <$> readIORef (_fanInt_subscriptionRef self)
1695− return $ EventSubscribed
1562+ return $ EventSubscribed
16961563 { eventSubscribedHeightRef = eventSubscribedHeightRef subscribedParent
16971564 , eventSubscribedRetained = toAny (_fanInt_subscriptionRef self, ticket)
16981565#ifdef DEBUG_CYCLES
@@ -1701,7 +1568,7 @@ fanIntSubscribed ticket self = do
17011568 , eventSubscribedWhoCreated = whoCreatedIORef $ _fanInt_subscriptionRef self
17021569#endif
17031570 }
1704−
1571+
17051572
17061573{-# INLINABLE getFanSubscribed #-}
17071574getFanSubscribed :: (HasSpiderTimeline x, GCompare k) => k a -> Fan x k v -> Subscriber x (v a) -> EventM x (WeakBagTicket, FanSubscribed x k v, Maybe (v a))
@@ -1914,7 +1781,7 @@ mergeCheap nt = mergeGCheap' unMergeSubscribedParent getInitialSubscribers updat
19141781 liftIO $ modifyIORef' heightBagRef $ heightBagAdd newParentHeight
19151782 return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
19161783 forM_ mOldSubd $ \oldSubd -> do
1917− oldHeight <- liftIO $ getEventSubscribedHeight $
1784+ oldHeight <- liftIO $ getEventSubscribedHeight $
19181785 _eventSubscription_subscribed $ unMergeSubscribedParent oldSubd
19191786
19201787 liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
@@ -1960,7 +1827,7 @@ mergeCheapWithMove nt = mergeGCheap' _mergeSubscribedParentWithMove_subscription
19601827 let moveOrDelete :: forall a. k a -> PatchDMapWithMove.NodeInfo k q a -> MergeSubscribedParentWithMove x k a -> Constant (EventM x (Maybe (EventSubscription x))) a
19611828 moveOrDelete _ ni parent = Constant $ case getComposeMaybe $ PatchDMapWithMove._nodeInfo_to ni of
19621829 Nothing -> do
1963− oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $
1830+ oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $
19641831 _mergeSubscribedParentWithMove_subscription parent
19651832
19661833 liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
@@ -1968,7 +1835,7 @@ mergeCheapWithMove nt = mergeGCheap' _mergeSubscribedParentWithMove_subscription
19681835 Just toKey -> do
19691836 liftIO $ writeIORef (_mergeSubscribedParentWithMove_key parent) $! toKey
19701837 return Nothing
1971− toDelete <- fmap catMaybes $ mapM (\(_ :=> v) -> getConstant v) $ DMap.toList $
1838+ toDelete <- fmap catMaybes $ mapM (\(_ :=> v) -> getConstant v) $ DMap.toList $
19721839 DMap.intersectionWithKey moveOrDelete (unPatchDMapWithMove p) oldParents
19731840
19741841 return (toDelete, applyAlways p' oldParents)
@@ -2021,16 +1888,16 @@ invalidateMergeHeight' :: IORef Height -> Subscriber x a -> IO ()
20211888invalidateMergeHeight' heightRef sub = do
20221889 oldHeight <- readIORef heightRef
20231890 -- 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
1891+ when (oldHeight /= invalidHeight) $ do
20251892 writeIORef heightRef $! invalidHeight
20261893 subscriberInvalidateHeight sub oldHeight
20271894
20281895revalidateMergeHeight :: Merge x k v s -> IO ()
20291896revalidateMergeHeight m = do
20301897 currentHeight <- readIORef $ _merge_heightRef m
2031−
1898+
20321899 -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
2033− when (currentHeight == invalidHeight) $ do
1900+ when (currentHeight == invalidHeight) $ do
20341901 heights <- readIORef $ _merge_heightBagRef m
20351902 parents <- readIORef $ _merge_parentsRef m
20361903 -- When the number of heights in the bag reaches the number of parents, we should have a valid height
@@ -2038,7 +1905,7 @@ revalidateMergeHeight m = do
20381905 LT -> return ()
20391906 EQ -> do
20401907 let height = succHeight $ heightBagMax heights
2041− traceInvalidateHeight $ "recalculateSubscriberHeight: height: " <> show height
1908+ traceInvalidate $ "recalculateSubscriberHeight: height: " <> show height
20421909 writeIORef (_merge_heightRef m) $! height
20431910 subscriberRecalculateHeight (_merge_sub m) height
20441911 GT -> error $ "revalidateMergeHeight: more heights (" <> show (heightBagSize heights) <> ") than parents (" <> show (DMap.size parents) <> ") for Merge"
@@ -2046,35 +1913,32 @@ revalidateMergeHeight m = do
20461913scheduleMergeSelf :: HasSpiderTimeline x => Merge x k v s -> Height -> EventM x ()
20471914scheduleMergeSelf m height = scheduleMerge' height (_merge_heightRef m) $ do
20481915 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,
1916+ -- Once we're done with this, we can clear it immediately, because if there's a cacheEvent in front of us,
20501917 -- it'll handle subsequent subscribers, and if not, we won't get subsequent subscribers
2051− liftIO $ writeIORef (_merge_accumRef m) $! DMap.empty
1918+ liftIO $ writeIORef (_merge_accumRef m) $! DMap.empty
20521919 --TODO: Assert that m is not empty
20531920 subscriberPropagate (_merge_sub m) vals
20541921
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) $
1922+checkCycle :: HasSpiderTimeline x => EventSubscribed x -> Height -> EventM x ()
1923+checkCycle subscribed height = do
1924+ currentHeight <- getCurrentHeight
1925+ when (height <= currentHeight) $ if height /= invalidHeight
1926+ then do
1927+ myStack <- liftIO $ whoCreatedIORef undefined --TODO
1928+ error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
1929+ else liftIO $
20661930#ifdef DEBUG_CYCLES
2067− do
2068− nodesInvolvedInCycle <- walkInvalidHeightParents subscribed
2069− stacks <- forM nodesInvolvedInCycle whoCreatedEventSubscribed
2070− throwIO (EventLoopException stacks)
1931+ do
1932+ nodesInvolvedInCycle <- walkInvalidHeightParents subscribed
1933+ stacks <- forM nodesInvolvedInCycle whoCreatedEventSubscribed
1934+ throwIO (EventLoopException (listsToForest stacks))
20711935#else
2072− throwIO EventLoopException
1936+ throwIO EventLoopException
20731937#endif
1938+
20741939
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
1940+mergeSubscriber :: forall x k v s a. (HasSpiderTimeline x, GCompare k) => Merge x k v s -> EventM x (k a) -> Subscriber x (v a)
1941+mergeSubscriber m getKey = Subscriber
20781942 { subscriberPropagate = \a -> do
20791943 oldM <- liftIO $ readIORef $ _merge_accumRef m
20801944 k <- getKey
@@ -2083,7 +1947,7 @@ mergeSubscriber subscribed m getKey = Subscriber
20831947 liftIO $ writeIORef (_merge_accumRef m) $! newM
20841948 when (DMap.null oldM) $ do -- Only schedule the firing once
20851949 height <- liftIO $ readIORef $ _merge_heightRef m
2086− checkCycle subscribed
1950+ -- checkCycle (_merge_sub m) height --TODO: assertions about height
20871951
20881952 scheduleMergeSelf m height
20891953 , subscriberInvalidateHeight = \old -> do --TODO: When removing a parent doesn't actually change the height, maybe we can avoid invalidating
@@ -2095,11 +1959,11 @@ mergeSubscriber subscribed m getKey = Subscriber
20951959 }
20961960
20971961--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)
1962+updateMerge :: (HasSpiderTimeline x, GCompare k) => Merge x k v s -> MergeUpdateFunc k v x p s -> p -> SomeMergeUpdate x
1963+updateMerge m updateFunc p = SomeMergeUpdate updateMe (invalidateMergeHeight m) (revalidateMergeHeight m)
21001964 where updateMe = do
21011965 oldParents <- liftIO $ readIORef $ _merge_parentsRef m
2102− (subscriptionsToKill, newParents) <- updateFunc (mergeSubscriber subscribed m) (_merge_heightBagRef m) oldParents p
1966+ (subscriptionsToKill, newParents) <- updateFunc (mergeSubscriber m) (_merge_heightBagRef m) oldParents p
21031967 liftIO $ writeIORef (_merge_parentsRef m) $! newParents
21041968 return subscriptionsToKill
21051969
@@ -2112,28 +1976,14 @@ mergeGCheap' getParent getInitialSubscribers updateFunc destroy d = Event $ \sub
21121976 heightRef <- liftIO $ newIORef $ error "merge: heightRef not yet initialized"
21131977 heightBagRef <- liftIO $ newIORef $ error "merge: heightBagRef not yet initialized"
21141978 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
1979+ let m = Merge
21301980 { _merge_parentsRef = parentsRef
21311981 , _merge_heightBagRef = heightBagRef
21321982 , _merge_heightRef = heightRef
21331983 , _merge_sub = sub
21341984 , _merge_accumRef = accumRef
21351985 }
2136− (dm, heights, initialParentState) <- getInitialSubscribers initialParents $ mergeSubscriber subscribed m
1986+ (dm, heights, initialParentState) <- getInitialSubscribers initialParents $ mergeSubscriber m
21371987 let myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
21381988 myHeight = if invalidHeight `elem` heights
21391989 then invalidHeight
@@ -2142,29 +1992,40 @@ mergeGCheap' getParent getInitialSubscribers updateFunc destroy d = Event $ \sub
21421992 let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
21431993 then (if DMap.null dm then Nothing else Just dm, DMap.empty)
21441994 else (Nothing, dm)
2145− unless (DMap.null accum) $ scheduleMergeSelf m myHeight
1995+ unless (DMap.null accum) $ do
1996+ scheduleMergeSelf m myHeight
21461997 liftIO $ writeIORef accumRef $! accum
21471998 liftIO $ writeIORef heightRef $! myHeight
21481999 liftIO $ writeIORef heightBagRef $! myHeightBag
2000+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
21492001 liftIO $ writeIORef parentsRef $! initialParentState
21502002 defer $ SomeMergeInit $ do
2151− let changeSubscriber = Subscriber
2003+ let s = Subscriber
21522004 { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
2153− tracePropagate (Proxy :: Proxy x) "SubscriberMerge/Change"
2154− defer $ updateMerge subscribed m updateFunc a
2005+ tracePropagate (Proxy :: Proxy x) $ "SubscriberMerge/Change"
2006+ defer $ updateMerge m updateFunc a
21552007 , subscriberInvalidateHeight = \_ -> return ()
21562008 , subscriberRecalculateHeight = \_ -> return ()
21572009 }
2158− (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) changeSubscriber
2159− forM_ change $ \c -> defer $ updateMerge subscribed m updateFunc c
2010+ (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) s
2011+ forM_ change $ \c -> defer $ updateMerge m updateFunc c
21602012 -- We explicitly hold on to the unsubscribe function from subscribing to the update event.
21612013 -- If we don't do this, there are certain cases where mergeCheap will fail to properly retain
21622014 -- its subscription.
2163− liftIO $ writeIORef changeSubdRef (changeSubscriber, changeSubscription)
2015+ liftIO $ writeIORef changeSubdRef (s, changeSubscription)
21642016 let unsubscribeAll = destroy =<< readIORef parentsRef
2165−
2017+ getParent' = \(_ :=> v) -> _eventSubscription_subscribed (getParent v)
2018+ subscribed = EventSubscribed
2019+ { eventSubscribedHeightRef = heightRef
2020+ , eventSubscribedRetained = toAny (parentsRef, changeSubdRef)
2021+#ifdef DEBUG_CYCLES
2022+ , eventSubscribedGetParents = fmap getParent' . DMap.toList <$> readIORef parentsRef
2023+ , eventSubscribedHasOwnHeightRef = False
2024+ , eventSubscribedWhoCreated = whoCreatedIORef heightRef
2025+ }
2026+#endif
21662027 return (EventSubscription unsubscribeAll subscribed, occ)
2167−
2028+
21682029
21692030mergeInt :: forall x a. (HasSpiderTimeline x) => DynamicS x (PatchIntMap (Event x a)) -> Event x (IntMap a)
21702031mergeInt = cacheEvent . mergeIntCheap
@@ -2177,22 +2038,13 @@ mergeIntCheap d = Event $ \sub -> do
21772038 heightRef <- liftIO $ newIORef zeroHeight
21782039 heightBagRef <- liftIO $ newIORef heightBagEmpty
21792040 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− }
21902041 let scheduleSelf = do
21912042 height <- liftIO $ readIORef $ heightRef
21922043 scheduleMerge' height heightRef $ do
21932044 vals <- liftIO $ FastMutableIntMap.getFrozenAndClear accum
21942045 subscriberPropagate sub vals
2195− invalidateMyHeight = invalidateMergeHeight' heightRef sub
2046+ invalidateMyHeight = do
2047+ invalidateMergeHeight' heightRef sub
21962048 recalculateMyHeight = do
21972049 currentHeight <- readIORef heightRef
21982050 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 +2054,14 @@ mergeIntCheap d = Event $ \sub -> do
22022054 LT -> return ()
22032055 EQ -> do
22042056 let height = succHeight $ heightBagMax heights
2205− traceInvalidateHeight $ "recalculateSubscriberHeight: height: " <> show height
2057+ traceInvalidate $ "recalculateSubscriberHeight: height: " <> show height
22062058 writeIORef heightRef $! height
22072059 subscriberRecalculateHeight sub height
22082060 GT -> error $ "revalidateMergeHeight: more heights (" <> show (heightBagSize heights) <> ") than parents (" <> show numParents <> ") for Merge"
22092061 mySubscriber k = Subscriber
22102062 { subscriberPropagate = \a -> do
2211− checkCycle subscribed
2212−
2063+ -- liftIO (readIORef heightRef) >>= checkCycle
2064+
22132065 wasEmpty <- liftIO $ FastMutableIntMap.isEmpty accum
22142066 liftIO $ FastMutableIntMap.insert accum k a
22152067 when wasEmpty scheduleSelf
@@ -2243,6 +2095,7 @@ mergeIntCheap d = Event $ \sub -> do
22432095 else liftIO $ Just <$> FastMutableIntMap.getFrozenAndClear accum
22442096 else do when (not isEmpty) scheduleSelf -- We have things accumulated, but we shouldn't have fired them yet
22452097 return Nothing
2098+ changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
22462099 defer $ SomeMergeInit $ do
22472100 let updateMe a = SomeMergeUpdate u invalidateMyHeight recalculateMyHeight
22482101 where
@@ -2256,25 +2109,31 @@ mergeIntCheap d = Event $ \sub -> do
22562109 oldParents <- liftIO $ FastMutableIntMap.applyPatch parents newSubscriptions
22572110 liftIO $ for_ oldParents $ \oldParent -> do
22582111 oldParentHeight <- getEventSubscribedHeight $ _eventSubscription_subscribed oldParent
2259−
2260− print ("updateMe", oldParentHeight)
22612112 modifyIORef' heightBagRef $ heightBagRemove oldParentHeight
22622113 return $ IntMap.elems oldParents
2263− let changeSubscriber = Subscriber
2114+ let s = Subscriber
22642115 { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
22652116 tracePropagate (Proxy :: Proxy x) $ "SubscriberMergeInt/Change"
22662117 defer $ updateMe a
22672118 , subscriberInvalidateHeight = \_ -> return ()
22682119 , subscriberRecalculateHeight = \_ -> return ()
22692120 }
2270− (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) changeSubscriber
2121+ (changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) s
22712122 forM_ change $ \c -> defer $ updateMe c
22722123 -- We explicitly hold on to the unsubscribe function from subscribing to the update event.
22732124 -- If we don't do this, there are certain cases where mergeCheap will fail to properly retain
22742125 -- its subscription.
2275− liftIO $ writeIORef changeSubdRef (changeSubscriber, changeSubscription)
2126+ liftIO $ writeIORef changeSubdRef (s, changeSubscription)
22762127 let unsubscribeAll = traverse_ unsubscribe =<< FastMutableIntMap.getFrozenAndClear parents
2277−
2128+ subscribed = EventSubscribed
2129+ { eventSubscribedHeightRef = heightRef
2130+ , eventSubscribedRetained = toAny (parents, changeSubdRef)
2131+#ifdef DEBUG_CYCLES
2132+ , eventSubscribedGetParents = fmap (_eventSubscription_subscribed . snd) <$> FastMutableIntMap.toList parents
2133+ , eventSubscribedHasOwnHeightRef = False
2134+ , eventSubscribedWhoCreated = whoCreatedIORef heightRef
2135+ }
2136+#endif
22782137
22792138 return (EventSubscription unsubscribeAll subscribed, occ)
22802139
@@ -2385,7 +2244,7 @@ runFrame a = SpiderHost $ do
23852244 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
23862245 {-
23872246 stackTrace <- liftIO $ fmap renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
2388− liftIO $ debugStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
2247+ liftIO $ putStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
23892248 EventRoot _ -> "EventRoot"
23902249 EventNever -> "EventNever"
23912250 _ -> "something else"
@@ -2400,7 +2259,7 @@ runFrame a = SpiderHost $ do
24002259 myHeight <- readIORef $ switchSubscribedHeight subscribed
24012260 when (parentHeight /= myHeight) $ do
24022261 writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
2403− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
2262+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
24042263 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
24052264 forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
24062265 unsubscribe subscription
@@ -2441,7 +2300,7 @@ invalidateCoincidenceHeight subscribed = do
24412300 oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
24422301 when (oldHeight /= invalidHeight) $ do
24432302 writeIORef (coincidenceSubscribedHeight subscribed) $! invalidHeight
2444− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
2303+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
24452304
24462305updateSwitchHeight :: Height -> SwitchSubscribed x a -> IO ()
24472306updateSwitchHeight new subscribed = do
@@ -2449,7 +2308,7 @@ updateSwitchHeight new subscribed = do
24492308 when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24502309 when (new /= invalidHeight) $ do --TODO: This 'when' should probably be an assertion
24512310 writeIORef (switchSubscribedHeight subscribed) $! new
2452− WeakBag.traverse_ (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
2311+ WeakBag.traverse (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
24532312
24542313recalculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
24552314recalculateCoincidenceHeight subscribed = do
@@ -2458,7 +2317,7 @@ recalculateCoincidenceHeight subscribed = do
24582317 height <- calculateCoincidenceHeight subscribed
24592318 when (height /= invalidHeight) $ do
24602319 writeIORef (coincidenceSubscribedHeight subscribed) $! height
2461− WeakBag.traverse_ (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
2320+ WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
24622321
24632322calculateSwitchHeight :: SwitchSubscribed x a -> IO Height
24642323calculateSwitchHeight subscribed = getEventSubscribedHeight . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
@@ -2520,8 +2379,6 @@ instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Event
25202379 {-# INLINABLE headE #-}
25212380 headE = R.slowHeadE
25222381-- headE (SpiderEvent e) = SpiderEvent <$> Reflex.Spider.Internal.headE e
2523− {-# INLINABLE now #-}
2524− now = nowSpiderEventM
25252382
25262383instance Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPullM x) where
25272384 {-# INLINABLE sample #-}
@@ -2543,9 +2400,6 @@ instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Spide
25432400 {-# INLINABLE headE #-}
25442401 headE = R.slowHeadE
25452402-- headE (SpiderEvent e) = SpiderPushM $ SpiderEvent <$> Reflex.Spider.Internal.headE e
2546− {-# INLINABLE now #-}
2547− now = SpiderPushM nowSpiderEventM
2548−
25492403
25502404instance HasSpiderTimeline x => Monad (Reflex.Class.Dynamic (SpiderTimeline x)) where
25512405 {-# INLINE return #-}
@@ -2554,10 +2408,8 @@ instance HasSpiderTimeline x => Monad (Reflex.Class.Dynamic (SpiderTimeline x))
25542408 x >>= f = SpiderDynamic $ dynamicDynIdentity $ newJoinDyn $ newMapDyn (unSpiderDynamic . f) $ unSpiderDynamic x
25552409 {-# INLINE (>>) #-}
25562410 (>>) = (*>)
2557−#if !MIN_VERSION_base(4,13,0)
25582411 {-# INLINE fail #-}
25592412 fail _ = error "Dynamic does not support 'fail'"
2560−#endif
25612413
25622414{-# INLINABLE newJoinDyn #-}
25632415newJoinDyn :: HasSpiderTimeline x => DynamicS x (Identity (DynamicS x (Identity a))) -> Reflex.Spider.Internal.Dyn x (Identity a)
@@ -2609,9 +2461,6 @@ instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Spide
26092461 buildDynamic getV0 e = runFrame . runSpiderHostFrame $ Reflex.Class.buildDynamic getV0 e
26102462 {-# INLINABLE headE #-}
26112463 headE e = runFrame . runSpiderHostFrame $ Reflex.Class.headE e
2612− {-# INLINABLE now #-}
2613− now = runFrame . runSpiderHostFrame $ Reflex.Class.now
2614−
26152464
26162465instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHostFrame x) where
26172466 sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
@@ -2628,8 +2477,6 @@ instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Spide
26282477 {-# INLINABLE headE #-}
26292478 headE = R.slowHeadE
26302479-- headE (SpiderEvent e) = SpiderHostFrame $ SpiderEvent <$> Reflex.Spider.Internal.headE e
2631− {-# INLINABLE now #-}
2632− now = SpiderHostFrame Reflex.Class.now
26332480
26342481instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHost x) where
26352482 {-# INLINABLE sample #-}
@@ -2650,8 +2497,6 @@ instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Refle
26502497 buildDynamic getV0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.buildDynamic getV0 e
26512498 {-# INLINABLE headE #-}
26522499 headE e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.headE e
2653− {-# INLINABLE now #-}
2654− now = Reflex.Spider.Internal.ReadPhase Reflex.Class.now
26552500
26562501--------------------------------------------------------------------------------
26572502-- Deprecated items
@@ -2775,7 +2620,7 @@ instance HasSpiderTimeline x => R.Reflex (SpiderTimeline x) where
27752620 fanG e = R.EventSelectorG $ SpiderEvent . selectG (fanG (unSpiderEvent e))
27762621 {-# INLINABLE mergeG #-}
27772622 mergeG
2778− :: forall k2 (k :: k2 -> *) q (v :: k2 -> *). GCompare k
2623+ :: forall (k :: k2 -> *) q (v :: k2 -> *). GCompare k
27792624 => (forall a. q a -> R.Event (SpiderTimeline x) (v a))
27802625 -> DMap k q
27812626 -> R.Event (SpiderTimeline x) (DMap k v)
@@ -2843,14 +2688,8 @@ instance Monad (SpiderHost x) where
28432688 SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
28442689 {-# INLINABLE return #-}
28452690 return x = SpiderHost $ return x
2846−#if !MIN_VERSION_base(4,13,0)
2847− {-# INLINABLE fail #-}
2848− fail = MonadFail.fail
2849−#endif
2850−
2851−instance MonadFail (SpiderHost x) where
28522691 {-# INLINABLE fail #-}
2853− fail s = SpiderHost $ MonadFail.fail s
2692+ fail s = SpiderHost $ fail s
28542693
28552694-- | Run an action affecting the global Spider timeline; this will be guarded by
28562695-- a mutex for that timeline
@@ -2872,10 +2711,8 @@ instance Monad (SpiderHostFrame x) where
28722711 SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
28732712 {-# INLINABLE return #-}
28742713 return x = SpiderHostFrame $ return x
2875−#if !MIN_VERSION_base(4,13,0)
28762714 {-# INLINABLE fail #-}
28772715 fail s = SpiderHostFrame $ fail s
2878−#endif
28792716
28802717instance NotReady (SpiderTimeline x) (SpiderHostFrame x) where
28812718 notReadyUntil _ = pure ()
@@ -2920,11 +2757,3 @@ instance MonadAtomicRef (SpiderHostFrame x) where
29202757instance PrimMonad (SpiderHostFrame x) where
29212758 type PrimState (SpiderHostFrame x) = PrimState IO
29222759 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.hs+64−91
@@ -15,33 +15,38 @@ import Control.Applicative
1515import Control.Monad
1616import Control.Monad.Fix
1717import Control.Exception
18+
1819import System.Timeout
20+
1921import Data.Maybe (isJust)
2022import Data.Functor.Misc
2123import qualified Data.Map as Map
2224import Data.Map (Map)
23−import qualified Data.IntMap as IntMap
24−import Data.IntMap (IntMap)
25+
2526import Data.These
2627import Data.Align
28+
2729import Reflex
2830import Reflex.EventWriter.Base
2931import Test.Run
30−import Test.Hspec
32+
3133import Reflex.Spider.Internal (EventLoopException)
34+
35+
3236import Data.Witherable (Filterable)
3337
3438#if defined(MIN_VERSION_these_lens) || (MIN_VERSION_these(0,8,0) && !MIN_VERSION_these(0,9,0))
3539import Data.These.Lens
3640#endif
3741
38−type Widget t m = (MonadHold t m, Reflex t, MonadFix m)
42+type Widget t m = (MonadHold t m, Reflex t, MonadFix m)
3943
40−connectDyn :: Widget t m => Event t () -> (Dynamic t a, Dynamic t a) -> m (Dynamic t a)
41−connectDyn e (d, d') = do
44+connectDyn ::Widget t m => Event t () -> (Dynamic t a, Dynamic t a) -> m (Dynamic t a)
45+connectDyn e (d, d') = do
4246 dd <- holdDyn d (d' <$ e)
4347 return $ join dd
4448
49+
4550dynLoop :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
4651dynLoop (e1, e2) = do
4752 -- "heightBagRemove: Height 2 not present in bag HeightBag {_heightBag_size = 2, _heightBag_contents = fromList [(0,1)]}"
@@ -50,31 +55,6 @@ dynLoop (e1, e2) = do
5055 d' <- connectDyn e2 (d, liftA2 (+) d d')
5156 return $ updated d'
5257
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
7858
7959connectButtonPromptly :: Widget t m => Event t () -> Event t a -> m (Event t a)
8060connectButtonPromptly click e = do
@@ -86,86 +66,79 @@ connectButton click e = do
8666 d <- hold never (e <$ click)
8767 return (switch d)
8868
89−switchLoop01 :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
90−switchLoop01 (e1, e2) = do
69+
70+switchLoop :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
71+switchLoop (e1, e2) = do
9172 rec
9273 e' <- connectButton e2 (updated d)
9374 d <- count (align e' e1)
9475 return $ updated d
9576
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
77+switchLoop' :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
78+switchLoop' (e1, e2) = do
10979 rec
11080 e' <- connectButton e2 (updated d)
11181 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
82+ return $ updated d
12083
121−staticLoop01 :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
122−staticLoop01 (e1, e2) = do
84+staticLoop :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
85+staticLoop (e1, e2) = do
12386 rec
12487 d <- foldDyn (+) (0 :: Int) (1 <$ align e1 (updated d))
12588 return $ updated d
12689
127−staticLoop02 :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
128−staticLoop02 (e1, e2) = do
90+staticLoop' :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
91+staticLoop' (e1, e2) = do
12992 rec
13093 d <- foldDyn (+) (0 :: Int) (leftmost [e1, updated d])
131− return $ updated d
94+ return $ updated d
95+
13296
13397buildStaticLoop :: Widget t m => (Event t Int, Event t ()) -> m (Event t Int)
13498buildStaticLoop (e1, e2) = switchHold never buildLoop
135− where buildLoop = pushAlways (const $ staticLoop01 (e1, e2)) e2
99+ where buildLoop = pushAlways (const $ staticLoop (e1, e2)) e2
136100
137101splitThese :: Filterable f => f (These a b) -> (f a, f b)
138102splitThese f = (mapMaybe (preview here) f, mapMaybe (preview there) f)
139103
104+pattern RunTestCaseFlag = "--run-test"
105+
106+runTest :: (String, TestCase) -> IO ()
107+runTest (name, TestCase test) = do
108+ mError <- timeout (milliseconds 5) $
109+ run `catch` \(e :: EventLoopException) -> pure (show e)
110+
111+ unless (isJust mError) $
112+ error $ name <> ": timed out (loop not detected)"
113+
114+ where
115+
116+ run = runApp' (test . splitThese) (Just <$> occs)
117+ >> error (name <> ": unexpected success")
118+
119+ occs = [ This 1, This 2, That (), This 3 ]
120+
121+ milliseconds = (*1000)
122+
123+
124+newtype TestCase = TestCase { unTest :: forall t m. Widget t m => (Event t Int, Event t ()) -> m (Event t Int) }
125+
126+tests :: [(String, TestCase)]
127+tests =
128+ [
129+ -- ("switchLoop'", TestCase switchLoop')
130+ -- , ("switchLoop", TestCase switchLoop)
131+ -- ("staticLoop'", TestCase staticLoop')
132+ -- ("staticLoop", TestCase staticLoop)
133+ ("buildStaticLoop", TestCase buildStaticLoop)
134+ -- , ("dynLoop", TestCase dynLoop)
135+ ]
136+
140137main :: 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)
138+main = traverse_ runTest tests
139+
140+
141+
142+
143+
144+
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+2−63
@@ -1,36 +1,20 @@
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
2213import qualified Data.Dependent.Map as DMap
2314import Data.Dependent.Sum
2415import Data.Functor.Misc
25−import Data.List (words)
26−import Data.Map (Map)
2716import qualified Data.Map as M
28−#if !MIN_VERSION_these(4,11,0)
29−import Data.Semigroup ((<>))
30−#endif
31−import Data.Text (Text)
3217import Data.These
33−import Text.Read (readMaybe)
3418
3519#if defined(MIN_VERSION_these_lens) || (MIN_VERSION_these(0,8,0) && !MIN_VERSION_these(0,9,0))
3620import Data.These.Lens
@@ -65,19 +49,12 @@ main = do
6549 print os5
6650 os6 <- runApp' (unwrapApp delayedPulse) [Just ()]
6751 print os6
68− os7 <- runApp' testMatchRequestsWithResponses [ Just $ TestRequest_Increment 1 ]
69− print os7
70− os8 <- runApp' testMatchRequestsWithResponses [ Just $ TestRequest_Reverse "yoyo" ]
71− print os8
7252 let ![[Just [1,2,3,4,5,6,7,8,9,10]]] = os1 -- The order is reversed here: see the documentation for 'runRequesterT'
7353 let ![[Just [9,7,5,3,1]],[Nothing,Nothing],[Just [10,8,6,4,2]],[Just [10,8,6,4,2],Nothing]] = os2
7454 let ![[Nothing, Just [2]]] = os3
7555 let ![[Nothing, Just [2]]] = os4
7656 let ![[Nothing, Just [1, 2]]] = os5
7757 -- 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−
8158 return ()
8259
8360unwrapRequest :: DSum tag RequestInt -> Int
@@ -195,41 +172,3 @@ delayedPulse pulse = void $ flip runWithReplace (pure () <$ pulse) $ do
195172 -- This has the effect of delaying pulse' from pulse
196173 (_, pulse') <- runWithReplace (pure ()) $ pure (RequestInt 1) <$ pulse
197174 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+ ]