on develop help sign in
.github/workflows/haskell.ymlnew file+47
since splitsnapshots
unifiedsplit
@@ -0,0 +1,47 @@
1+name: github-action
2+
3+on: [push, pull_request]
4+
5+jobs:
6+ build:
7+ strategy:
8+ matrix:
9+ ghc: ['8.0.2', '8.2.2', '8.4.4', '8.6.5', '8.8.4', '8.10.2']
10+ os: ['ubuntu-latest', 'macos-latest']
11+ exclude:
12+ # There are some linker warnings in 802 on darwin that
13+ # cause compilation to fail
14+ # See https://github.com/NixOS/nixpkgs/issues/25139
15+ - ghc: '8.0.2'
16+ os: 'macos-latest'
17+ runs-on: ${{ matrix.os }}
18+
19+ name: GHC ${{ matrix.ghc }} on ${{ matrix.os }}
20+ steps:
21+ - uses: actions/checkout@v2
22+ - uses: actions/setup-haskell@v1
23+ with:
24+ ghc-version: ${{ matrix.ghc }}
25+ - name: Cache
26+ uses: actions/cache@v1
27+ env:
28+ cache-name: cache-cabal
29+ with:
30+ path: ~/.cabal
31+ key: ${{ runner.os }}-${{ matrix.ghc }}-build-${{ env.cache-name }}-${{ hashFiles('**/*.cabal') }}-${{ hashFiles('**/cabal.project') }}
32+ restore-keys: |
33+ ${{ runner.os }}-${{ matrix.ghc }}-build-${{ env.cache-name }}-
34+ ${{ runner.os }}-${{ matrix.ghc }}-build-
35+ ${{ runner.os }}-${{ matrix.ghc }}-
36+ ${{ runner.os }}
37+
38+ - name: Install dependencies
39+ run: |
40+ cabal update
41+ cabal build --only-dependencies --enable-tests --enable-benchmarks
42+ - name: Build
43+ run: cabal build --enable-tests --enable-benchmarks all
44+ - name: Run tests
45+ run: cabal test --enable-tests all
46+ - name: Build Docs
47+ run: cabal haddock
.gitignore+4
@@ -1,4 +1,6 @@
1dist
1dist
2+cabal.sandbox.config
3+.cabal-sandbox/
2dist-*
4dist-*
3cabal-dev
5cabal-dev
4*.o
6*.o
@@ -32,3 +34,5 @@ hsenv.log
32.#*
34.#*
33/shell.nix
35/shell.nix
34/ghci-tmp
36/ghci-tmp
37+*.dump-*
38+*.verbose-core2core
.stylish-haskell.yaml+2−3
@@ -149,6 +149,5 @@ columns: 110
149# needs to be aware of these, so it can parse the file correctly.
149# needs to be aware of these, so it can parse the file correctly.
150#
150#
151# No language extensions are enabled by default.
151# No language extensions are enabled by default.
152−# language_extensions:
152+language_extensions:
153− # - TemplateHaskell
153+ - TemplateHaskell
154− # - QuasiQuotes
.travis.ymldeleted−26
@@ -1,26 +0,0 @@
1−sudo: false
2−before_install:
3− - travis_retry cabal-$CABALVER update
4− - export PATH=/opt/ghc/$GHCVER/bin:/opt/happy/1.19.5/bin:/opt/alex/3.1.4/bin:$PATH
5−install:
6− - travis_retry cabal-$CABALVER install --only-dependencies -j --enable-tests
7−script:
8− - cabal-$CABALVER configure -v2 --enable-tests
9− - travis_wait cabal-$CABALVER build
10− - cabal-$CABALVER test
11− - cabal-$CABALVER sdist # tests that a source-distribution can be generated
12−# Check that the resulting source distribution can be built & installed.
13−# If there are no other `.tar.gz` files in `dist`, this can be even simpler:
14−# `cabal install --force-reinstalls dist/*-*.tar.gz`
15− - SRC_TGZ=$(cabal-$CABALVER info . | awk '{print $2;exit}').tar.gz &&
16− (cd dist && cabal-$CABALVER install --force-reinstalls "$SRC_TGZ")
17−
18−matrix:
19− include:
20− - env: CABALVER=1.18 GHCVER=7.8.4
21− addons: {apt: {packages: [cabal-install-1.18, ghc-7.8.4, alex-3.1.4, happy-1.19.5], sources: [hvr-ghc]}}
22− - env: CABALVER=1.22 GHCVER=7.10.1
23− addons: {apt: {packages: [cabal-install-1.22, ghc-7.10.1, alex-3.1.4, happy-1.19.5],sources: [hvr-ghc]}}
24− - env: CABALVER=1.24 GHCVER=8.0.1
25− addons: {apt: {packages: [cabal-install-1.24, ghc-8.0.1, alex-3.1.4, happy-1.19.5],sources: [hvr-ghc]}}
26− fast_finish: true
CONTRIBUTING.mdnew file+66
@@ -0,0 +1,66 @@
1+# Contribution Guide
2+
3+Contributions and issue reports are encouraged and appreciated!
4+
5+- [Opening Issues](#opening-issues)
6+- [Submitting Changes](#submitting-changes)
7+ - [Guidelines for Commit Messages](#guidelines-for-commit-messages)
8+ - [Guidelines for Pull Requests](#guidelines-for-pull-requests)
9+ - [Code Quality](#code-quality)
10+ - [Documentation](#documentation)
11+
12+## Opening Issues
13+
14+Before opening an issue, please check whether your issue has already been reported. Assuming it has not:
15+
16+* Describe the issue you're encountering or the suggestion you're making
17+* Include any relevant steps to reproduce or code samples you can. It's always easier for us to debug if we have something that demonstrates the error.
18+* Let us know what version of patch you were using. If you're using a github checkout, provide the git hash.
19+* Describe how you're building patch (i.e., via reflex-platform, cabal install, stack, obelisk, etc.). If you're using reflex-platform or obelisk, provide the git hash of your checkout.
20+
21+## Submitting Changes
22+
23+### Guidelines for Commit Messages
24+
25+#### Summary Line
26+The summary line of your commit message should summarize the changes being made. Commit messages should be written in the imperative mood and should describe what happens when the commit is applied.
27+
28+One way to think about it is that your commit message should be able to complete the sentence:
29+"When applied, this commit will..."
30+
31+#### Body
32+For breaking changes, new features, refactors, or other major changes, the body of the commit message should describe the motivation behind the change in greater detail and may include references to the issue tracker. The body shouldn't repeat code/comments from the diff.
33+
34+### Guidelines for Pull Requests
35+
36+Wherever possible, pull requests should add a single feature or fix a single bug. Pull requests should not bundle several unrelated changes.
37+
38+### Code Quality
39+
40+#### Warnings
41+
42+Your pull request should add no new warnings to the project. It should also generally not disable any warnings.
43+
44+#### Build and Test
45+
46+Make sure the project builds and that the tests pass! This will generally also be checked by CI before merge, but trying it yourself first means you'll catch problems earlier and your contribution can be merged that much sooner!
47+
48+#### Dependencies
49+
50+Include version bounds whenever adding a dependency to the library stanza of the cabal file. Note that libraries added to patch.cabal also need to be added to default.nix.
51+
52+### Documentation
53+
54+#### In the code
55+We're always striving to improve documentation. Please include [haddock](https://haskell-haddock.readthedocs.io/en/latest/index.html) documentation for any added code, and update the documentation for any code you modify.
56+
57+#### In the [Changelog](ChangeLog.md)
58+Add an entry to the changelog when your PR:
59+* Adds a feature
60+* Deprecates something
61+* Includes a breaking change
62+* Makes any other change that will impact users
63+
64+#### In the [Readme](README.md)
65+The readme is the first place a lot of people look for information about the repository. Update any parts of the readme that are affected by your PR.
66+
ChangeLog.mdnew file+61
@@ -0,0 +1,61 @@
1+# Revision history for patch
2+
3+## Unreleased
4+
5+* New dep of `data-orphans` for old GHC to get instances honestly instead of
6+ via `monoidal-containers`.
7+
8+## 0.0.5.0 - 2021-12-17
9+
10+* `Additive` now lives in `Data.Semigroup.Additive`, but is still reexported
11+ from `Data.Patch` for compatability.
12+
13+* Rewrite `PatchMapWithMove` in terms of `PatchMapWithPatchingMove`.
14+ Care is taken to make this not a breaking change.
15+ In particular, `PatchMapWithMove` is a newtype of `PatchMapWithPatchingMove`, as is the `NodeInfo` and `From` of `PatchMapWithPatchingMove`'s versions of those.
16+ There are complete constructor and field patterns too, and everything is
17+ exported under the newtype as real constructors and fields would be.
18+
19+## 0.0.4.0 - 2021-04-20
20+
21+* Enable PolyKinds
22+
23+## 0.0.3.2 - 2020-11-06
24+
25+* Update version bounds
26+
27+## 0.0.3.1 - 2020-02-05
28+
29+* Replace `fromJust` with something easier to debug.
30+
31+## 0.0.3.0 - 2020-02-05
32+
33+* Create `PatchMapWithPatchingMove` variant which supports moves with a patch.
34+
35+* Create `DecidablyEmpty` subclass of `Monoid`.
36+
37+## 0.0.2.0 - 2020-01-17
38+
39+* Consistently provide:
40+
41+ - `Wrapped` instances
42+
43+ - `*WithIndex` instances
44+
45+ - `un*` newtype unwrappers
46+
47+ for `PatchMap`, `PatchIntMap`, and `PatchMapWithMove`.
48+
49+## 0.0.1.0 - 2020-01-09
50+
51+* Support older GHCs with `split-these` flag.
52+
53+* Additional instances for the `Group` class for basic types.
54+
55+## 0.0.0.1 - 2020-01-08
56+
57+* Remove unneeded dependencies
58+
59+## 0.0.0.0 - 2020-01-08
60+
61+* Extract patching functionality from Reflex.
Quickref.mddeleted−176
@@ -1,176 +0,0 @@
1−# Reflex Quick(ish) Reference
2−
3−## Typeclasses
4−
5−Many Reflex functions operate in monadic context `m a`, where the monad 'm' supports various additional typeclasses such as MonadWidget, MonadHold, or MonadSample in addition to Monad itself. The actual 'm' in use will be determined by the top-level entry point of the FRP host (such as Reflex-Dom -- see the bottom of the Reflex-Dom quick reference for details).
6−
7−The function signatures here have been simplified by removing many typeclass constraints and adding simple annotations to each function. Also the ubiquitous 't' type parameter has been removed.
8−
9−Some of these functions are *pure*: They operate on Events, Behaviors, or Dynamics uniformly without regard to the "current time". Other functions must operate in some monadic context, because they produce a result "as of now" (e.g., any function that takes an "initial" value, or returns a "current" value). Annotations are used to distinguish these cases:
10−
11−```haskell
12−[ ] -- Pure function
13−[S] -- Function runs in any monad supporting MonadSample
14−[H] -- Function runs in any monad supporting MonadHold
15−```
16−
17−Since MonadHold depends on MonadSample, any [S] function also runs in [H] context.
18−
19−## Functions producing Event
20−
21−```haskell
22−-- Trivial Event
23−[ ] never :: Event a
24−
25−-- Extract Event from Dynamic
26−[ ] updated :: Dynamic a -> Event a
27−
28−-- Transform Event to Event using function
29−[ ] fmap :: (a -> b) -> Event a -> Event b
30−[ ] fmapMaybe :: (a -> Maybe b) -> Event a -> Event b
31−[ ] ffilter :: (a -> Bool) -> Event a -> Event a
32−[ ] ffor :: Event a -> (a -> b) -> Event b
33−[ ] fforMaybe :: Event a -> (a -> Maybe b) -> Event b
34−
35−-- Event to identical Event with debug trace. (Only prints if Event is ultimately used.)
36−[ ] traceEvent :: Show a => String -> Event a -> Event a
37−[ ] traceEventWith :: (a -> String) -> Event a -> Event a
38−
39−-- Transform Event to Event by sampling Behavior or Dynamic
40−[ ] gate :: Behavior Bool -> Event a -> Event a
41−[ ] tag :: Behavior a -> Event b -> Event a
42−[ ] tagPromptlyDyn :: Dynamic a -> Event b -> Event a
43−[ ] attach :: Behavior a -> Event b -> Event (a, b)
44−[ ] attachPromptlyDyn :: Dynamic a -> Event b -> Event (a, b)
45−[ ] attachWith :: (a -> b -> c) -> Behavior a -> Event b -> Event c
46−[ ] attachPromptlyDynWith :: (a -> b -> c) -> Dynamic a -> Event b -> Event c
47−[ ] attachWithMaybe :: (a -> b -> Maybe c) -> Behavior a -> Event b -> Event c
48−[ ] attachPromptlyDynWithMaybe :: (a -> b -> Maybe c) -> Dynamic a -> Event b -> Event c
49−
50−-- Combine multiple Events
51−[ ] <> :: Monoid a => Event a -> Event a -> Event a
52−[ ] mergeWith :: (a -> a -> a) -> [Event a] -> Event a
53−[ ] leftmost :: [Event a] -> Event a
54−[ ] mergeList :: [Event a] -> Event (NonEmpty a)
55−[ ] merge :: GCompare k => DMap (WrapArg Event k) -> Event (DMap k)
56−[ ] mergeMap :: Ord k => Map k (Event a) -> Event (Map k a)
57−
58−-- Efficient one-to-many fanout
59−[ ] fanMap :: Ord k => Event (Map k a) -> EventSelector (Const2 k a)
60−[ ] fan :: GCompare k => Event (DMap k) -> EventSelector k
61−[ ] select :: EventSelector k -> k a -> Event a
62−
63−-- Event to Event via function that can sample current values
64−[ ] push :: (a -> m (Maybe b)) -> Event a -> Event b
65−[ ] pushAlways :: (a -> m b ) -> Event a -> Event b
66− -- Note supplied function operates in [H] context
67−
68−-- Split Event into next occurrence and all other future occurrences, as of now.
69−[H] headE :: Event a -> m (Event a)
70−[H] tailE :: Event a -> m (Event a)
71−[H] headTailE :: Event a -> m (Event a, Event a)
72−```
73−
74−## Functions producing Behavior
75−
76−```haskell
77−-- Trivial Behavior
78−[ ] constant :: a -> Behavior a
79−
80−-- Extract Behavior from Dynamic
81−[ ] current :: Dynamic a -> Behavior a
82−
83−-- Create Behavior with given initial value, updated when the Event fires.
84−[H] hold :: a -> Event a -> m (Behavior a)
85−
86−-- Transform Behavior to Behavior using function
87−[ ] fmap :: (a -> b) -> Behavior a -> Behavior b
88−[ ] ffor :: Behavior a -> (a -> b) -> Behavior b
89−[ ] <*> :: Behavior (a -> b) -> Behavior a -> Behavior b
90−[ ] >>= :: Behavior a -> (a -> Behavior b) -> Behavior b
91−[ ] <> :: Monoid a => Behavior a -> Behavior a -> Behavior a
92−-- ... plus many more due to typeclass membership
93−
94−-- Behavior to Behavior by sampling current values
95−[S] sample :: Behavior a -> m a
96−[ ] pull :: m a -> Behavior a
97− -- Note supplied value is in [S] context
98−```
99−
100−## Functions producing Dynamic
101−
102−```haskell
103−-- Trivial Dynamic
104−[ ] constDyn :: a -> Dynamic a
105−
106−-- Create Dynamic with given initial value, updated (various ways) when the Event fires.
107−[H] holdDyn :: a -> Event a -> m (Dynamic a)
108−[H] foldDyn :: (a -> b -> b ) -> b -> Event a -> m (Dynamic b)
109−[H] foldDynMaybe :: (a -> b -> Maybe b ) -> b -> Event a -> m (Dynamic b)
110−[H] foldDynM :: (a -> b -> m' b ) -> b -> Event a -> m (Dynamic b)
111−[H] foldDynMaybeM :: (a -> b -> m' (Maybe b)) -> b -> Event a -> m (Dynamic b)
112− -- Note m' supplies [H] context
113−
114−-- Initial value is 0; counts Event firings from now.
115−[H] count :: Num b => Event a -> m (Dynamic b)
116−-- Initial Bool value is supplied; toggles at each Event firing.
117−[H] toggle :: Bool -> Event a -> m (Dynamic Bool)
118−
119−-- Transform Dynamic to Dynamic using function
120−[ ] ffor :: Dynamic a -> (a -> b) -> Dynamic b
121−[ ] fmap :: (a -> b) -> Dynamic a -> Dynamic b
122−[ ] splitDynPure :: Dynamic (a, b) -> (Dynamic a, Dynamic b)
123−
124−-- Combine multiple Dynamics
125−[ ] mconcat :: Monoid a => [Dynamic a] -> Dynamic a
126−[ ] distributeDMapOverDynPure :: GCompare k => DMap (WrapArg Dynamic k) -> Dynamic (DMap k)
127−[ ] zipDynWith :: (a -> b -> c) -> Dynamic a -> Dynamic b -> Dynamic c
128−
129−-- Efficient one-to-many fanout
130−[ ] demux :: Ord k => Dynamic k -> Demux k
131−[ ] demuxed :: Eq k => Demux k -> k -> Dynamic Bool
132−
133−-- Dynamic to Dynamic, removing updates w/o value change
134−[ ] uniqDyn :: Eq a => Dynamic a -> Dynamic a
135−
136−-- Dynamic to identical Dynamic with debug trace. (Only prints if Dynamic is ultimately used.)
137−[ ] traceDyn :: Show a => String -> Dynamic a -> Dynamic a
138−[ ] traceDynWith :: (a -> String) -> Dynamic a -> Dynamic a
139−```
140−
141−## Flattening functions
142−
143−These functions flatten nested types such as Event-of-Event, Behavior-of-Event, Event-of-Behavior etc, removing the outer wrapper.
144−
145−For Events, the returned Event fires whenever the latest Event supplied by the wrapper fires. There are differences in how the functions handle *coincidences* -- situations where the old or new Event fires at the same instant that we switch from old to new. In some cases, the output Event tracks the old Event at the instant of switchover, while in other cases it tracks the new Event.
146−
147−```haskell
148−-- Flatten Behavior-of-Event to Event. Old Event is used during switchover.
149−[ ] switch :: Behavior (Event a) -> Event a
150−
151−-- Flatten Dyanmic-of-Event to Event. New Event is used immediately.
152−[ ] switchPromptlyDyn :: Dynamic (Event a) -> Event a
153−
154−-- Flatten Event-of-Event to Event that fires when both wrapper AND new Event fire.
155−[ ] coincidence :: Event (Event a) -> Event a
156−
157−-- Flatten Behavior-of-Behavior to Behavior. Behavior is an instance of Monad,
158−-- so the 'join' function from 'Control.Monad' suffices. The output of 'join' is
159−-- a Behavior whose value is equal to the current value of the current value of
160−-- the input.
161−[ ] join :: Behavior (Behavior a) -> Behavior a
162−
163−
164−-- Flatten Dynamic-of-Dynamic to Dynamic. New Dynamic is used immediately.
165−-- Output updated whenever inner OR outer Dynamic updates.
166−[ ] join :: Dynamic (Dynamic a) -> Dynamic a
167−[ ] joinDynThroughMap :: Ord k => Dynamic (Map k (Dynamic a)) -> Dynamic (Map k a)
168−
169−-- Analogous to 'hold': Create a Behavior that is initially identical to the
170−-- supplied Behavior. Updated to track a new Behavior whenever the Event fires.
171−[H] switcher :: Behavior a -> Event (Behavior a) -> m (Behavior a)
172−
173−-- Similar to above, for Events. Created Event initially tracks the first argument.
174−-- At switchover, the output Event immediately tracks the new Event.
175−[H] switchPromptly :: Event a -> Event (Event a) -> m (Event a)
176−```
README.md+44−11
@@ -1,19 +1,52 @@
1−## Reflex
1+# patch
2−### Practical Functional Reactive Programming
3
2
4−Reflex is an fully-deterministic, higher-order Functional Reactive Programming (FRP) interface and an engine that efficiently implements that interface.
3+[![Haskell](https://img.shields.io/badge/language-Haskell-orange.svg)](https://haskell.org) [![Hackage](https://img.shields.io/hackage/v/patch.svg)](https://hackage.haskell.org/package/patch) [![Hackage CI](https://matrix.hackage.haskell.org/api/v2/packages/patch/badge)](https://matrix.hackage.haskell.org/#/package/patch) [![Travis CI](https://api.travis-ci.org/reflex-frp/patch.svg?branch=develop)](https://travis-ci.org/reflex-frp/patch) [![BSD3 License](https://img.shields.io/badge/license-BSD3-blue.svg)](https://github.com/reflex-frp/patch/LICENSE)
5
4
6−[Reflex-DOM](https://github.com/reflex-frp/reflex-dom) is a framework built on Reflex that facilitates the development of web pages, including highly-interactive single-page apps.
5+Data structures for describing changes to other data structures.
7
6
8−Comprehensive documentation is still a work in progress, but a tutorial for Reflex and Reflex-DOM is available at https://github.com/reflex-frp/reflex-platform and an introductory talk given at the New York Haskell Meetup is available here: [Part 1](https://www.youtube.com/watch?v=mYvkcskJbc4) / [Part 2](https://www.youtube.com/watch?v=3qfc9XFVo2c).
7+A `Patch` type represents a kind of change made to a data structure.
9
8
10−A summary of Reflex functions is available in the [quick reference](Quickref.md).
9+```haskell
10+class Patch p where
11+ type PatchTarget p :: *
12+ -- | Apply the patch p a to the value a. If no change is needed, return
13+ -- 'Nothing'.
14+ apply :: p -> PatchTarget p -> Maybe (PatchTarget p)
15+```
11
16
12−### Additional resources
17+## Patching Maps
13−[Get started with Reflex](https://github.com/reflex-frp/reflex-platform)
18+For example, `Data.Patch.Map` defines the `PatchMap` type which can be used to patch `Map`s. A `PatchMap` represents updates to a `Map` that can insert, remove, or replace items in the `Map`. In this example, the `Map` is the `PatchTarget` and the `PatchMap` is the `Patch`. Keep in mind that there are many other possible `Patch`es that can be applied to a `Map` (i.e., `Map` can be the `PatchTarget` for many different `Patch` instances).
14
19
15−[/r/reflexfrp](https://www.reddit.com/r/reflexfrp)
20+`PatchMap` is defined as:
16
21
17−[hackage](https://hackage.haskell.org/package/reflex)
22+```haskell
23+newtype PatchMap k v = PatchMap { unPatchMap :: Map k (Maybe v) }
24+```
18
25
19−[irc.freenode.net #reflex-frp](http://webchat.freenode.net?channels=%23reflex-frp&uio=d4)
26+The `Maybe` around the value is used to represent insertion/updates or deletion of the element at a given key.
27+
28+Its `Patch` instance begins with:
29+
30+```haskell
31+instance Ord k => Patch (PatchMap k v) where
32+ type PatchTarget (PatchMap k v) = Map k v
33+ ...
34+```
35+
36+When a `PatchMap` is applied to its `PatchTarget`, the following changes can occur:
37+
38+- If the key is present in the `Patch` and the `PatchTarget`...
39+
40+ - And the `Patch` value at that key is `Nothing`: delete that key from the `PatchTarget`.
41+
42+ - And the `Patch` value at that key is `Just x`: update the value at that key in the `PatchTarget` to `x`.
43+
44+- If the key is present in the `Patch` and not present in the `PatchTarget`...
45+
46+ - And the `Patch` value at that key is `Nothing`: do nothing because we're trying to delete a key that doesn't exist in the target in the first place.
47+
48+ - And the `Patch` value at that key is `Just x`: insert the key and the value `x` into the `PatchTarget`
49+
50+- If the key is *not* present in the `Patch` but present in the `PatchTarget`: do nothing.
51+
52+There are, of course, more complicated ways of patching maps involving, for example, moving values from one key to another. You can find the code for that in `Data.Patch.PatchMapWithMove`. Note that the `PatchTarget` type associated with the `PatchMapWithMove` patch instance is still `Map k v`!
bench-cbits/checkCapability.c+11−12
@@ -42,7 +42,7 @@ typedef struct Task_ {
42 // or just continue immediately. It's a workaround for the fact
42 // or just continue immediately. It's a workaround for the fact
43 // that signalling a condition variable doesn't do anything if the
43 // that signalling a condition variable doesn't do anything if the
44 // thread is already running, but we want it to be sticky.
44 // thread is already running, but we want it to be sticky.
45− rtsBool wakeup;
45+ HsBool wakeup;
46#endif
46#endif
47
47
48 // This points to the Capability that the Task "belongs" to. If
48 // This points to the Capability that the Task "belongs" to. If
@@ -62,14 +62,14 @@ typedef struct Task_ {
62 // The current top-of-stack InCall
62 // The current top-of-stack InCall
63 struct InCall_ *incall;
63 struct InCall_ *incall;
64
64
65− nat n_spare_incalls;
65+ uint32_t n_spare_incalls;
66 struct InCall_ *spare_incalls;
66 struct InCall_ *spare_incalls;
67
67
68− rtsBool worker; // == rtsTrue if this is a worker Task
68+ HsBool worker; // == rtsTrue if this is a worker Task
69− rtsBool stopped; // this task has stopped or exited Haskell
69+ HsBool stopped; // this task has stopped or exited Haskell
70
70
71 // So that we can detect when a finalizer illegally calls back into Haskell
71 // So that we can detect when a finalizer illegally calls back into Haskell
72− rtsBool running_finalizers;
72+ HsBool running_finalizers;
73
73
74 // Links tasks on the returning_tasks queue of a Capability, and
74 // Links tasks on the returning_tasks queue of a Capability, and
75 // on spare_workers.
75 // on spare_workers.
@@ -88,7 +88,7 @@ struct Capability_ {
88 StgFunTable f;
88 StgFunTable f;
89 StgRegTable r;
89 StgRegTable r;
90
90
91− nat no; // capability number.
91+ uint32_t no; // capability number.
92
92
93 // The Task currently holding this Capability. This task has
93 // The Task currently holding this Capability. This task has
94 // exclusive access to the contents of this Capability (apart from
94 // exclusive access to the contents of this Capability (apart from
@@ -98,12 +98,12 @@ struct Capability_ {
98
98
99 // true if this Capability is running Haskell code, used for
99 // true if this Capability is running Haskell code, used for
100 // catching unsafe call-ins.
100 // catching unsafe call-ins.
101− rtsBool in_haskell;
101+ HsBool in_haskell;
102
102
103 // Has there been any activity on this Capability since the last GC?
103 // Has there been any activity on this Capability since the last GC?
104− nat idle;
104+ uint32_t idle;
105
105
106− rtsBool disabled;
106+ HsBool disabled;
107
107
108 // The run queue. The Task owning this Capability has exclusive
108 // The run queue. The Task owning this Capability has exclusive
109 // access to its run queue, so can wake up threads without
109 // access to its run queue, so can wake up threads without
@@ -159,7 +159,7 @@ struct Capability_ {
159#if defined(THREADED_RTS)
159#if defined(THREADED_RTS)
160 // Worker Tasks waiting in the wings. Singly-linked.
160 // Worker Tasks waiting in the wings. Singly-linked.
161 Task *spare_workers;
161 Task *spare_workers;
162− nat n_spare_workers; // count of above
162+ uint32_t n_spare_workers; // count of above
163
163
164 // This lock protects:
164 // This lock protects:
165 // running_task
165 // running_task
@@ -192,10 +192,9 @@ struct Capability_ {
192
192
193 // Per-capability STM-related data
193 // Per-capability STM-related data
194 StgTVarWatchQueue *free_tvar_watch_queues;
194 StgTVarWatchQueue *free_tvar_watch_queues;
195− StgInvariantCheckQueue *free_invariant_check_queues;
196 StgTRecChunk *free_trec_chunks;
195 StgTRecChunk *free_trec_chunks;
197 StgTRecHeader *free_trec_headers;
196 StgTRecHeader *free_trec_headers;
198− nat transaction_tokens;
197+ uint32_t transaction_tokens;
199} // typedef Capability is defined in RtsAPI.h
198} // typedef Capability is defined in RtsAPI.h
200 // We never want a Capability to overlap a cache line with anything
199 // We never want a Capability to overlap a cache line with anything
201 // else, so round it up to a cache line size:
200 // else, so round it up to a cache line size:
bench/Main.hsdeleted−109
@@ -1,109 +0,0 @@
1−{-# LANGUAGE BangPatterns #-}
2−{-# LANGUAGE CPP #-}
3−{-# LANGUAGE ScopedTypeVariables #-}
4−{-# LANGUAGE TupleSections #-}
5−{-# LANGUAGE TypeFamilies #-}
6−
7−-- The instance for NFData (TVar a) is an orphan, but necessary here
8−{-# OPTIONS_GHC -fno-warn-orphans #-}
9−
10−module Main where
11−
12−import Control.Concurrent.STM
13−import Control.DeepSeq
14−import Control.Exception (evaluate)
15−import Control.Monad.Identity
16−import Control.Monad.IO.Class
17−import Criterion.Main
18−import Data.Dependent.Map (DMap)
19−import qualified Data.Dependent.Map as DMap
20−import Data.Dependent.Sum
21−import Data.Functor.Misc
22−import Data.IORef
23−import Reflex
24−import Reflex.Host.Class
25−
26−main :: IO ()
27−main = defaultMain
28− [ bgroup "micro" micros ]
29−
30−#if !(MIN_VERSION_deepseq(1,4,2))
31−instance NFData (IORef a) where
32− rnf x = seq x ()
33−#endif
34−
35−instance NFData (TVar a) where
36− rnf x = seq x ()
37−
38−newtype WHNF a = WHNF a
39−instance NFData (WHNF a) where
40− rnf (WHNF a) = seq a ()
41−
42−withSetup :: NFData b => String -> SpiderHost Global a -> (a -> SpiderHost Global b) -> Benchmark
43−withSetup name setup action = env (WHNF <$> runSpiderHost setup) $ \ ~(WHNF a) ->
44− bench name . nfIO $ runSpiderHost (action a)
45−
46−withSetupWHNF :: String -> SpiderHost Global a -> (a -> SpiderHost Global b) -> Benchmark
47−withSetupWHNF name setup action = env (WHNF <$> runSpiderHost setup) $ \ ~(WHNF a) ->
48− bench name . whnfIO $ runSpiderHost (action a)
49−
50−micros :: [Benchmark]
51−micros =
52− [ bench "newIORef" $ whnfIO $ void $ newIORef ()
53− , env (newIORef (42 :: Int)) (bench "readIORef" . whnfIO . readIORef)
54− , bench "newTVar" $ whnfIO $ void $ newTVarIO ()
55− , env (newTVarIO (42 :: Int)) (bench "readTVar" . whnfIO . readTVarIO)
56− , bench "newEventWithTrigger" $ whnfIO . void $ runSpiderHost $ newEventWithTrigger $
57− \trigger -> return () <$ evaluate trigger
58− , bench "newEventWithTriggerRef" $ whnfIO . void $ runSpiderHost newEventWithTriggerRef
59− , withSetupWHNF "subscribeEvent" newEventWithTriggerRef $ subscribeEvent . fst
60− , withSetupWHNF "subscribeSwitch"
61− (join $ hold <$> fmap fst newEventWithTriggerRef <*> fmap fst newEventWithTriggerRef)
62− (subscribeEvent . switch)
63− , withSetupWHNF "subscribeMerge(1)" (setupMerge 1) $ \(ev,_) -> subscribeEvent ev
64− , withSetupWHNF "subscribeMerge(100)" (setupMerge 100) (subscribeEvent . fst)
65− , withSetupWHNF "subscribeMerge(10000)" (setupMerge 10000) (subscribeEvent . fst)
66− , bench "runHostFrame" $ whnfIO $ runSpiderHost $ runHostFrame $ return ()
67− , withSetupWHNF "fireEventsAndRead(single/single)"
68− (newEventWithTriggerRef >>= subscribePair)
69− (\(subd, trigger) -> fireAndRead trigger (42 :: Int) subd)
70− , withSetupWHNF "fireEventsOnly"
71− (newEventWithTriggerRef >>= subscribePair)
72− (\(_, trigger) -> do
73− Just key <- liftIO $ readIORef trigger
74− fireEvents [key :=> Identity (42 :: Int)])
75− , withSetupWHNF "fireEventsAndRead(head/merge1)"
76− (setupMerge 1 >>= subscribePair)
77− (\(subd, t:_) -> fireAndRead t (42 :: Int) subd)
78− , withSetupWHNF "fireEventsAndRead(head/merge100)"
79− (setupMerge 100 >>= subscribePair)
80− (\(subd, t:_) -> fireAndRead t (42 :: Int) subd)
81− , withSetupWHNF "fireEventsAndRead(head/merge10000)"
82− (setupMerge 10000 >>= subscribePair)
83− (\(subd, t:_) -> fireAndRead t (42 :: Int) subd)
84− , withSetupWHNF "fireEventsOnly(head/merge100)"
85− (setupMerge 100 >>= subscribePair)
86− (\(_, t:_) -> do
87− Just key <- liftIO $ readIORef t
88− fireEvents [key :=> Identity (42 :: Int)])
89− , withSetupWHNF "hold" newEventWithTriggerRef $ \(ev, _) -> hold (42 :: Int) ev
90− , withSetupWHNF "sample" (newEventWithTriggerRef >>= hold (42 :: Int) . fst) sample
91− ]
92−
93−setupMerge :: Int
94− -> SpiderHost Global ( Event (SpiderEnv Global) (DMap (Const2 Int a) Identity)
95− , [IORef (Maybe (EventTrigger Spider a))]
96− )
97−setupMerge num = do
98− (evs, triggers) <- unzip <$> replicateM num newEventWithTriggerRef
99− let !m = DMap.fromList [Const2 i :=> v | (i,v) <- zip [0..] evs]
100− pure (merge m, triggers)
101−
102−subscribePair :: (Event (SpiderEnv Global) a, b) -> SpiderHost Global (EventHandle (SpiderEnv Global) a, b)
103−subscribePair (ev, b) = (,b) <$> subscribeEvent ev
104−
105−fireAndRead :: IORef (Maybe (EventTrigger (SpiderEnv Global) a)) -> a -> EventHandle (SpiderEnv Global) b
106− -> SpiderHost Global (Maybe b)
107−fireAndRead trigger val subd = do
108− Just key <- liftIO $ readIORef trigger
109− fireEventsAndRead [key :=> Identity val] $ readEvent subd >>= sequence
bench/RunAll.hsdeleted−157
@@ -1,157 +0,0 @@
1−{-# LANGUAGE BangPatterns #-}
2−{-# LANGUAGE ConstraintKinds #-}
3−{-# LANGUAGE FlexibleContexts #-}
4−{-# LANGUAGE FlexibleInstances #-}
5−{-# LANGUAGE ForeignFunctionInterface #-}
6−{-# LANGUAGE GADTs #-}
7−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
8−{-# LANGUAGE MultiParamTypeClasses #-}
9−{-# LANGUAGE PatternSynonyms #-}
10−{-# LANGUAGE RankNTypes #-}
11−{-# LANGUAGE ScopedTypeVariables #-}
12−{-# LANGUAGE TemplateHaskell #-}
13−{-# LANGUAGE TupleSections #-}
14−{-# LANGUAGE TypeSynonymInstances #-}
15−{-# LANGUAGE ViewPatterns #-}
16−{-# OPTIONS_GHC -fno-warn-orphans #-}
17−
18−module Main where
19−
20−import Criterion.Main
21−import Criterion.Types
22−
23−import Reflex
24−import Reflex.Host.Class
25−
26−import Reflex.Plan.Reflex
27−import Reflex.TestPlan
28−
29−import qualified Reflex.Bench.Focused as Focused
30−import Reflex.Spider.Internal (SpiderEventHandle)
31−
32−import Control.Applicative
33−import Control.DeepSeq (NFData (..))
34−
35−import Prelude
36−import System.IO
37−import System.Mem
38−
39−import Control.Arrow
40−import Control.Concurrent
41−import Control.Concurrent.STM
42−import Control.Exception
43−import Control.Monad
44−import Control.Monad.Trans
45−import Data.Bool
46−import Data.Function
47−import Data.Int
48−import Data.IORef
49−import Data.Monoid
50−import Data.Time.Clock
51−import Debug.Trace.LocationTH
52−import GHC.Stats
53−import System.Environment
54−import System.Mem.Weak
55−import System.Process
56−import Text.Read
57−
58−import Unsafe.Coerce
59−
60−import Data.Map (Map)
61−import qualified Data.Map as Map
62−
63−type MonadReflexHost' t m = (MonadReflexHost t m, MonadIORef m, MonadIORef (HostFrame t))
64−
65−
66−setupFiring :: (MonadReflexHost t m, MonadIORef m) => Plan t (Event t a) -> m (EventHandle t a, Schedule t)
67−setupFiring p = do
68− (e, s) <- runPlan p
69− h <- subscribeEvent e
70− return (h, s)
71−
72−-- Hack to avoid the NFData constraint for EventHandle which is a synonym
73−newtype Ignore a = Ignore a
74−instance NFData (Ignore a) where
75− rnf !_ = ()
76−
77−instance NFData (SpiderEventHandle a) where
78− rnf !_ = ()
79−
80−instance NFData (Behavior t a) where
81− rnf !_ = ()
82−
83−instance NFData (Firing t) where
84− rnf !_ = ()
85−
86−-- Measure the running time
87−benchFiring :: forall t m. (MonadReflexHost' t m, MonadSample t m) => (forall a. m a -> IO a) -> TestCase -> Int -> IO ()
88−benchFiring runHost tc n = runHost $ do
89− let runIterations :: m a -> m ()
90− runIterations test = replicateM_ (10*n) $ do
91− result <- test
92− liftIO $ evaluate result
93− case tc of
94− TestE p -> do
95− (h, s) <- setupFiring p
96− runIterations $ readSchedule_ s $ readEvent' h
97− TestB p -> do
98− (b, s) <- runPlan p
99− runIterations $ readSchedule_ (makeDense s) $ sample b
100−
101−waitForFinalizers :: IO ()
102−waitForFinalizers = do
103− performGC
104− x <- getCurrentTime
105− isFinalized <- newIORef False
106− mkWeakPtr x $ Just $ writeIORef isFinalized True
107− performGC
108− fix $ \loop -> do
109− f <- readIORef isFinalized
110− unless f $ do
111− threadDelay 1
112− loop
113−
114−benchmarks :: [(String, Int -> IO ())]
115−benchmarks = implGroup "spider" runSpiderHost cases
116− where
117− implGroup :: (MonadReflexHost' t m, MonadSample t m) => String -> (forall a. m a -> IO a) -> [(String, TestCase)] -> [(String, Int -> IO ())]
118− implGroup name runHost = group name . fmap (second (benchFiring runHost))
119− group name = fmap $ first ((name <> "/") <>)
120− sub n frames = group ("subscribing " ++ show (n, frames)) $ Focused.subscribing n frames
121− firing n = group ("firing " <> show n) $ Focused.firing n
122− merging n = group ("merging " <> show n) $ Focused.merging n
123− dynamics n = group ("dynamics " <> show n) $ Focused.dynamics n
124− cases = concat
125− [ sub 100 40
126− , dynamics 100
127− , dynamics 1000
128− , firing 1000
129− , firing 10000
130− , merging 10
131− , merging 50
132− , merging 100
133− , merging 200
134− ]
135−
136−pattern RunTestCaseFlag = "--run-test-case"
137−
138−spawnBenchmark :: String -> Benchmark
139−spawnBenchmark name = Benchmark name $ Benchmarkable $ \n -> do
140− self <- getExecutablePath
141− callProcess self [RunTestCaseFlag, name, show n, "+RTS", "-N1"]
142−
143−foreign import ccall unsafe "myCapabilityHasOtherRunnableThreads" myCapabilityHasOtherRunnableThreads :: IO Bool
144−
145−main :: IO ()
146−main = do
147− args <- getArgs
148− case args of
149− RunTestCaseFlag : t -> case t of
150− [name, readMaybe -> Just count] -> do
151− case lookup name benchmarks of
152− Just testCase -> testCase count
153− performGC
154− fix $ \loop -> bool (return ()) (yield >> loop) =<< myCapabilityHasOtherRunnableThreads
155− return ()
156− _ -> $failure "--run-test-case: expected test name and iteration count to follow"
157− _ -> defaultMainWith (defaultConfig { timeLimit = 20, csvFile = Just "dmap-original.csv", reportFile = Just "report.html" }) $ fmap (spawnBenchmark . fst) benchmarks
cabal.projectnew file+1
@@ -0,0 +1 @@
1+packages: .
default.nixdeleted−26
@@ -1,26 +0,0 @@
1−{ mkDerivation, base, containers, dependent-map, dependent-sum
2−, exception-transformers, haskell-src-exts, haskell-src-meta
3−, MemoTrie, mtl, primitive, ref-tf, semigroups, stdenv, syb
4−, template-haskell, these, transformers, transformers-compat
5−, criterion, deepseq, split, stm, loch-th, hlint
6−}:
7−mkDerivation {
8− pname = "reflex";
9− version = "0.4.0";
10− src = builtins.filterSource (path: type: baseNameOf path != ".git") ./.;
11− libraryHaskellDepends = [
12− base containers dependent-map dependent-sum exception-transformers
13− haskell-src-exts haskell-src-meta mtl primitive ref-tf semigroups
14− syb template-haskell these transformers transformers-compat
15− ];
16− testHaskellDepends = [
17− base containers dependent-map MemoTrie mtl ref-tf
18− # Benchmark dependencies
19− criterion deepseq split stm loch-th
20− # HLint
21− hlint
22− ];
23− homepage = "https://github.com/reflex-frp/reflex";
24− description = "Higher-order Functional Reactive Programming";
25− license = stdenv.lib.licenses.bsd3;
26−}
dep/reflex-platform/default.nixnew file+8
@@ -0,0 +1,8 @@
1+# DO NOT HAND-EDIT THIS FILE
2+let fetch = { private ? false, fetchSubmodules ? false, owner, repo, rev, sha256, ... }:
3+ if !fetchSubmodules && !private then builtins.fetchTarball {
4+ url = "https://github.com/${owner}/${repo}/archive/${rev}.tar.gz"; inherit sha256;
5+ } else (import <nixpkgs> {}).fetchFromGitHub {
6+ inherit owner repo rev sha256 fetchSubmodules private;
7+ };
8+in import (fetch (builtins.fromJSON (builtins.readFile ./github.json)))
dep/reflex-platform/github.jsonnew file+8
@@ -0,0 +1,8 @@
1+{
2+ "owner": "reflex-frp",
3+ "repo": "reflex-platform",
4+ "branch": "master",
5+ "private": false,
6+ "rev": "c9d11db1b98855fe8ab24a3ff6a5dbe0ad902ad9",
7+ "sha256": "0sfzkqdvyah5mwvmli0wq1nl0b8cvk2cmfgfy4rz57wv42x3099y"
8+}
patch.cabalnew file+100
@@ -0,0 +1,100 @@
1+Name: patch
2+Version: 0.0.5.0
3+Synopsis: Data structures for describing changes to other data structures.
4+Description:
5+ Data structures for describing changes to other data structures.
6+ .
7+ In this library, a patch is something which can be applied, analogous to a
8+ function, and which distinguishes returning the argument it was provided from
9+ returning something else.
10+License: BSD3
11+License-file: LICENSE
12+Author: Ryan Trinkle
13+Maintainer: maintainer@obsidian.systems
14+Stability: Experimental
15+Category: FRP
16+Build-type: Simple
17+Cabal-version: >=1.10
18+homepage: https://obsidian.systems
19+bug-reports: https://github.com/reflex-frp/patch/issues
20+extra-source-files:
21+ README.md
22+ ChangeLog.md
23+
24+tested-with:
25+ GHC ==8.0.2 || ==8.2.2 || ==8.4.4 || ==8.6.5 || ==8.8.1
26+ GHCJS ==8.4
27+
28+flag split-these
29+ description: Use split these/semialign packages
30+ manual: False
31+ default: True
32+
33+library
34+ hs-source-dirs: src
35+ default-language: Haskell2010
36+ build-depends: base >= 4.9 && < 4.15
37+ , constraints-extras >= 0.3 && < 0.4
38+ , containers >= 0.6 && < 0.7
39+ , dependent-map >= 0.3 && < 0.5
40+ , dependent-sum >= 0.6 && < 0.8
41+ , lens >= 4.7 && < 5
42+ , semigroupoids >= 4.0 && < 6
43+ , transformers >= 0.5.6.0 && < 0.6
44+ , witherable >= 0.3 && < 0.5
45+
46+ if impl(ghc < 8.6) -- really, if base < 8.12
47+ build-depends: base-orphans >= 0.8 && < 0.9
48+
49+ exposed-modules: Data.Functor.Misc
50+ , Data.Monoid.DecidablyEmpty
51+ , Data.Patch
52+ , Data.Patch.Class
53+ , Data.Patch.DMap
54+ , Data.Patch.DMapWithMove
55+ , Data.Patch.IntMap
56+ , Data.Patch.Map
57+ , Data.Patch.MapWithMove
58+ , Data.Patch.MapWithPatchingMove
59+ , Data.Semigroup.Additive
60+
61+ ghc-options: -Wall -fwarn-redundant-constraints -fwarn-tabs
62+ default-extensions: PolyKinds
63+
64+ if flag(split-these)
65+ build-depends: these >= 1 && <1.2
66+ , semialign >=1 && <1.2
67+ , monoidal-containers >= 0.6 && < 0.7
68+ else
69+ build-depends: these >= 0.4 && <0.9
70+ , monoidal-containers == 0.4.0.0
71+
72+test-suite tests
73+ default-language: Haskell2010
74+ type: exitcode-stdio-1.0
75+ main-is: tests.hs
76+ hs-source-dirs: test
77+ build-depends: base
78+ , patch
79+ , containers
80+ , hedgehog
81+ , HUnit
82+ if impl(ghcjs)
83+ buildable: False
84+
85+test-suite hlint
86+ default-language: Haskell2010
87+ type: exitcode-stdio-1.0
88+ main-is: hlint.hs
89+ hs-source-dirs: test
90+ build-depends: base
91+ , directory
92+ , filepath
93+ , filemanip
94+ , hlint (< 2.1 || >= 2.2.2) && < 3.3
95+ if impl(ghcjs)
96+ buildable: False
97+
98+source-repository head
99+ type: git
100+ location: https://github.com/reflex-frp/patch
reflex.cabaldeleted−127
@@ -1,127 +0,0 @@
1−Name: reflex
2−Version: 0.4.0
3−Synopsis: Higher-order Functional Reactive Programming
4−Description: Reflex is a high-performance, deterministic, higher-order Functional Reactive Programming system
5−License: BSD3
6−License-file: LICENSE
7−Author: Ryan Trinkle
8−Maintainer: ryan.trinkle@gmail.com
9−Stability: Experimental
10−Category: FRP
11−Build-type: Simple
12−Cabal-version: >=1.9.2
13−homepage: https://github.com/reflex-frp/reflex
14−bug-reports: https://github.com/reflex-frp/reflex/issues
15−
16−library
17− hs-source-dirs: src
18− build-depends:
19− MemoTrie == 0.6.*,
20− base >= 4.7 && < 4.10,
21− bifunctors >= 5.2 && < 5.5,
22− containers == 0.5.*,
23− dependent-map >= 0.2.2 && < 0.3,
24− dependent-sum == 0.3.*,
25− exception-transformers == 0.4.*,
26− haskell-src-exts >= 1.16 && < 1.18,
27− haskell-src-meta == 0.6.*,
28− mtl >= 2.1 && < 2.3,
29− primitive >= 0.5 && < 0.7,
30− ref-tf == 0.4.*,
31− semigroupoids >= 4.0 && < 6,
32− semigroups >= 0.16 && < 0.19,
33− stm == 2.4.*,
34− syb >= 0.5 && < 0.7,
35− template-haskell >= 2.9 && < 2.12,
36− these >= 0.4 && < 0.8,
37− transformers >= 0.2,
38− transformers-compat >= 0.3
39−
40− exposed-modules:
41− Data.Functor.Misc,
42− Data.WeakBag,
43− Reflex,
44− Reflex.Class,
45− Reflex.Dynamic,
46− Reflex.Dynamic.TH,
47− Reflex.Dynamic.Uniq,
48− Reflex.Host.Class,
49− Reflex.Pure,
50− Reflex.Spider,
51− Reflex.Spider.Internal
52−
53− other-extensions: TemplateHaskell
54− ghc-options: -Wall -fwarn-tabs -funbox-strict-fields -O2
55− ghc-prof-options: -auto-all
56−
57−test-suite semantics
58− type: exitcode-stdio-1.0
59− main-is: semantics.hs
60− hs-source-dirs: test
61− ghc-options: -O2 -Wall -rtsopts
62− build-depends:
63− base,
64− bifunctors,
65− containers,
66− deepseq >= 1.3 && < 1.5,
67− dependent-map,
68− dependent-sum,
69− mtl,
70− ref-tf,
71− reflex,
72− split,
73− transformers >= 0.3
74−
75−test-suite hlint
76− type: exitcode-stdio-1.0
77− main-is: hlint.hs
78− hs-source-dirs: test
79− build-depends: base, hlint == 1.9.*
80− if impl(ghcjs)
81− buildable: False
82−
83−benchmark spider-bench
84− type: exitcode-stdio-1.0
85− hs-source-dirs: bench
86− main-is: Main.hs
87− ghc-options: -Wall -O2 -rtsopts
88− build-depends:
89− base,
90− criterion == 1.1.*,
91− deepseq >= 1.3 && < 1.5,
92− dependent-map,
93− dependent-sum,
94− mtl,
95− primitive,
96− reflex,
97− stm,
98− transformers >= 0.3
99−
100−benchmark saulzar-bench
101− type: exitcode-stdio-1.0
102− hs-source-dirs: bench test
103− c-sources: bench-cbits/checkCapability.c
104− main-is: RunAll.hs
105− ghc-options: -Wall -O2 -rtsopts -threaded
106− ghc-prof-options: -auto-all
107− build-depends:
108− base,
109− containers == 0.5.*,
110− criterion == 1.1.*,
111− deepseq >= 1.3 && < 1.5,
112− dependent-map,
113− dependent-sum,
114− loch-th,
115− mtl,
116− primitive,
117− process,
118− ref-tf == 0.4,
119− reflex,
120− split,
121− stm,
122− time,
123− transformers >= 0.3
124−
125−source-repository head
126− type: git
127− location: https://github.com/reflex-frp/reflex
release.nixnew file+49
@@ -0,0 +1,49 @@
1+{ reflex-platform-fun ? import ./dep/reflex-platform
2+}:
3+
4+let
5+ native-reflex-platform = reflex-platform-fun {};
6+ inherit (native-reflex-platform.nixpkgs) lib;
7+ systems = ["x86_64-linux" "x86_64-darwin"];
8+
9+ perPlatform = lib.genAttrs systems (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+ compilerPkgs = lib.genAttrs compilers (ghc: let
21+ reflex-platform = reflex-platform-fun {
22+ inherit system;
23+ haskellOverlays = [
24+ # Use this package's source for reflex
25+ (self: super: {
26+ _dep = super._dep // {
27+ patch = builtins.filterSource (path: type: !(builtins.elem (baseNameOf path) [
28+ "release.nix"
29+ ".git"
30+ "dist"
31+ "dist-newstyle"
32+ "cabal.haskell-ci"
33+ "cabal.project"
34+ ".travis.yml"
35+ ])) ./.;
36+ };
37+ })
38+ ];
39+ };
40+ in reflex-platform.${ghc}.patch);
41+ in compilerPkgs // {
42+ cache = reflex-platform.pinBuildInputs "patch-${system}"
43+ (builtins.attrValues compilerPkgs);
44+ });
45+
46+ metaCache = native-reflex-platform.pinBuildInputs "patch-everywhere"
47+ (map (a: a.cache) (builtins.attrValues perPlatform));
48+
49+in perPlatform // { inherit metaCache; }
src/Data/Functor/Misc.hs+119−57
@@ -1,8 +1,10 @@
1+{-# LANGUAGE CPP #-}
1{-# LANGUAGE DeriveDataTypeable #-}
2{-# LANGUAGE DeriveDataTypeable #-}
3+{-# LANGUAGE DeriveFunctor #-}
2{-# LANGUAGE FlexibleContexts #-}
4{-# LANGUAGE FlexibleContexts #-}
3{-# LANGUAGE FlexibleInstances #-}
5{-# LANGUAGE FlexibleInstances #-}
4{-# LANGUAGE GADTs #-}
6{-# LANGUAGE GADTs #-}
5−{-# LANGUAGE KindSignatures #-}
7+{-# LANGUAGE LambdaCase #-}
6{-# LANGUAGE MultiParamTypeClasses #-}
8{-# LANGUAGE MultiParamTypeClasses #-}
7{-# LANGUAGE PolyKinds #-}
9{-# LANGUAGE PolyKinds #-}
8{-# LANGUAGE RankNTypes #-}
10{-# LANGUAGE RankNTypes #-}
@@ -12,34 +14,42 @@
12-- which are relevant to the use of 'Functor'-based datastructures like
14-- which are relevant to the use of 'Functor'-based datastructures like
13-- 'Data.Dependent.Map.DMap'.
15-- 'Data.Dependent.Map.DMap'.
14module Data.Functor.Misc
16module Data.Functor.Misc
15− ( -- * Const2
17+ ( -- * Const2
16− Const2 (..)
18+ Const2 (..)
19+ , unConst2
17− , dmapToMap
20+ , dmapToMap
21+ , dmapToIntMap
22+ , dmapToMapWith
18− , mapToDMap
23+ , mapToDMap
24+ , weakenDMapWith
19− -- * WrapArg
25+ -- * WrapArg
20− , WrapArg (..)
26+ , WrapArg (..)
21− -- * Convenience functions for DMap
27+ -- * Convenience functions for DMap
22− , mapWithFunctorToDMap
28+ , mapWithFunctorToDMap
29+ , intMapWithFunctorToDMap
30+ , mapKeyValuePairsMonotonic
23− , combineDMapsWithKey
31+ , combineDMapsWithKey
24− -- * Deprecated functions
32+ , EitherTag (..)
25− , sequenceDmap
33+ , dmapToThese
26− , wrapDMap
34+ , eitherToDSum
27− , rewrapDMap
35+ , dsumToEither
28− , unwrapDMap
36+ , ComposeMaybe (..)
29− , unwrapDMapMaybe
30− , extractFunctorDMap
31− ) where
37+ ) where
32−
38+
33−import Control.Applicative (Applicative, (<$>))
39+import Control.Applicative ((<$>))
34−import Control.Monad.Identity
35import Data.Dependent.Map (DMap)
40import Data.Dependent.Map (DMap)
36import qualified Data.Dependent.Map as DMap
41import qualified Data.Dependent.Map as DMap
37import Data.Dependent.Sum
42import Data.Dependent.Sum
43+import Data.Functor.Identity
38import Data.GADT.Compare
44import Data.GADT.Compare
39import Data.GADT.Show
45import Data.GADT.Show
46+import Data.IntMap (IntMap)
47+import qualified Data.IntMap as IntMap
40import Data.Map (Map)
48import Data.Map (Map)
41import qualified Data.Map as Map
49import qualified Data.Map as Map
50+import Data.Some (Some, mkSome)
42import Data.These
51import Data.These
52+import Data.Type.Equality ((:~:)(Refl))
43import Data.Typeable hiding (Refl)
53import Data.Typeable hiding (Refl)
44
54
45--------------------------------------------------------------------------------
55--------------------------------------------------------------------------------
@@ -52,14 +62,18 @@ data Const2 :: * -> x -> x -> * where
52 Const2 :: k -> Const2 k v v
62 Const2 :: k -> Const2 k v v
53 deriving (Typeable)
63 deriving (Typeable)
54
64
65+-- | Extract the value from a Const2
66+unConst2 :: Const2 k v v' -> k
67+unConst2 (Const2 k) = k
68+
69+deriving instance Eq k => Eq (Const2 k v v')
70+deriving instance Ord k => Ord (Const2 k v v')
55−deriving instance Show k => Show (Const2 k v v)
71+deriving instance Show k => Show (Const2 k v v')
72+deriving instance Read k => Read (Const2 k v v)
56
73
57instance Show k => GShow (Const2 k v) where
74instance Show k => GShow (Const2 k v) where
58 gshowsPrec n x@(Const2 _) = showsPrec n x
75 gshowsPrec n x@(Const2 _) = showsPrec n x
59
76
60−instance (Show k, Show (f v)) => ShowTag (Const2 k v) f where
61− showTaggedPrec (Const2 _) = showsPrec
62−
63instance Eq k => GEq (Const2 k v) where
77instance Eq k => GEq (Const2 k v) where
64 geq (Const2 a) (Const2 b) =
78 geq (Const2 a) (Const2 b) =
65 if a == b
79 if a == b
@@ -76,6 +90,15 @@ instance Ord k => GCompare (Const2 k v) where
76dmapToMap :: DMap (Const2 k v) Identity -> Map k v
90dmapToMap :: DMap (Const2 k v) Identity -> Map k v
77dmapToMap = Map.fromDistinctAscList . map (\(Const2 k :=> Identity v) -> (k, v)) . DMap.toAscList
91dmapToMap = Map.fromDistinctAscList . map (\(Const2 k :=> Identity v) -> (k, v)) . DMap.toAscList
78
92
93+-- | Convert a 'DMap' to an 'IntMap'
94+dmapToIntMap :: DMap (Const2 IntMap.Key v) Identity -> IntMap v
95+dmapToIntMap = IntMap.fromDistinctAscList . map (\(Const2 k :=> Identity v) -> (k, v)) . DMap.toAscList
96+
97+-- | Convert a 'DMap' to a regular 'Map', applying the given function to remove
98+-- the wrapping 'Functor'
99+dmapToMapWith :: (f v -> v') -> DMap (Const2 k v) f -> Map k v'
100+dmapToMapWith f = Map.fromDistinctAscList . map (\(Const2 k :=> v) -> (k, f v)) . DMap.toAscList
101+
79-- | Convert a regular 'Map' to a 'DMap'
102-- | Convert a regular 'Map' to a 'DMap'
80mapToDMap :: Map k v -> DMap (Const2 k v) Identity
103mapToDMap :: Map k v -> DMap (Const2 k v) Identity
81mapToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> Identity v) . Map.toAscList
104mapToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> Identity v) . Map.toAscList
@@ -85,6 +108,16 @@ mapToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> Identity v)
85mapWithFunctorToDMap :: Map k (f v) -> DMap (Const2 k v) f
108mapWithFunctorToDMap :: Map k (f v) -> DMap (Const2 k v) f
86mapWithFunctorToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> v) . Map.toAscList
109mapWithFunctorToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> v) . Map.toAscList
87
110
111+-- | Convert a regular 'IntMap', where the values are already wrapped in a
112+-- functor, to a 'DMap'
113+intMapWithFunctorToDMap :: IntMap (f v) -> DMap (Const2 IntMap.Key v) f
114+intMapWithFunctorToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> v) . IntMap.toAscList
115+
116+-- | Convert a 'DMap' to a regular 'Map' by forgetting the types associated with
117+-- the keys, using a function to remove the wrapping 'Functor'
118+weakenDMapWith :: (forall a. v a -> v') -> DMap k v -> Map (Some k) v'
119+weakenDMapWith f = Map.fromDistinctAscList . map (\(k :=> v) -> (mkSome k, f v)) . DMap.toAscList
120+
88--------------------------------------------------------------------------------
121--------------------------------------------------------------------------------
89-- WrapArg
122-- WrapArg
90--------------------------------------------------------------------------------
123--------------------------------------------------------------------------------
@@ -95,6 +128,11 @@ mapWithFunctorToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> v
95data WrapArg :: (k -> *) -> (k -> *) -> * -> * where
128data WrapArg :: (k -> *) -> (k -> *) -> * -> * where
96 WrapArg :: f a -> WrapArg g f (g a)
129 WrapArg :: f a -> WrapArg g f (g a)
97
130
131+deriving instance Eq (f a) => Eq (WrapArg g f (g' a))
132+deriving instance Ord (f a) => Ord (WrapArg g f (g' a))
133+deriving instance Show (f a) => Show (WrapArg g f (g' a))
134+deriving instance Read (f a) => Read (WrapArg g f (g a))
135+
98instance GEq f => GEq (WrapArg g f) where
136instance GEq f => GEq (WrapArg g f) where
99 geq (WrapArg a) (WrapArg b) = (\Refl -> Refl) <$> geq a b
137 geq (WrapArg a) (WrapArg b) = (\Refl -> Refl) <$> geq a b
100
138
@@ -132,38 +170,62 @@ combineDMapsWithKey f mg mh = DMap.fromList $ go (DMap.toList mg) (DMap.toList m
132 GEQ -> (gk :=> f gk (These gv hv)) : go gs' hs'
170 GEQ -> (gk :=> f gk (These gv hv)) : go gs' hs'
133 GGT -> (hk :=> f hk (That hv)) : go gs hs'
171 GGT -> (hk :=> f hk (That hv)) : go gs hs'
134
172
173+-- | Extract the values of a 'DMap' of 'EitherTag's.
174+dmapToThese :: DMap (EitherTag a b) Identity -> Maybe (These a b)
175+dmapToThese m = case (DMap.lookup LeftTag m, DMap.lookup RightTag m) of
176+ (Nothing, Nothing) -> Nothing
177+ (Just (Identity a), Nothing) -> Just $ This a
178+ (Nothing, Just (Identity b)) -> Just $ That b
179+ (Just (Identity a), Just (Identity b)) -> Just $ These a b
180+
181+-- | Tag type for 'Either' to use it as a 'DSum'.
182+data EitherTag l r a where
183+ LeftTag :: EitherTag l r l
184+ RightTag :: EitherTag l r r
185+ deriving (Typeable)
186+
187+deriving instance Show (EitherTag l r a)
188+deriving instance Eq (EitherTag l r a)
189+deriving instance Ord (EitherTag l r a)
190+
191+instance GEq (EitherTag l r) where
192+ geq a b = case (a, b) of
193+ (LeftTag, LeftTag) -> Just Refl
194+ (RightTag, RightTag) -> Just Refl
195+ _ -> Nothing
196+
197+instance GCompare (EitherTag l r) where
198+ gcompare a b = case (a, b) of
199+ (LeftTag, LeftTag) -> GEQ
200+ (LeftTag, RightTag) -> GLT
201+ (RightTag, LeftTag) -> GGT
202+ (RightTag, RightTag) -> GEQ
203+
204+instance GShow (EitherTag l r) where
205+ gshowsPrec _ a = case a of
206+ LeftTag -> showString "LeftTag"
207+ RightTag -> showString "RightTag"
208+
209+-- | Convert 'Either' to a 'DSum'. Inverse of 'dsumToEither'.
210+eitherToDSum :: Either a b -> DSum (EitherTag a b) Identity
211+eitherToDSum = \case
212+ Left a -> (LeftTag :=> Identity a)
213+ Right b -> (RightTag :=> Identity b)
214+
215+-- | Convert 'DSum' to 'Either'. Inverse of 'eitherToDSum'.
216+dsumToEither :: DSum (EitherTag a b) Identity -> Either a b
217+dsumToEither = \case
218+ (LeftTag :=> Identity a) -> Left a
219+ (RightTag :=> Identity b) -> Right b
220+
135--------------------------------------------------------------------------------
221--------------------------------------------------------------------------------
136−-- Deprecated functions
222+-- ComposeMaybe
137--------------------------------------------------------------------------------
223--------------------------------------------------------------------------------
138
224
139−{-# INLINE sequenceDmap #-}
225+-- | We can't use @Compose Maybe@ instead of 'ComposeMaybe', because that would
140−{-# DEPRECATED sequenceDmap "Use 'Data.Dependent.Map.traverseWithKey (\\_ t -> fmap Identity t)' instead" #-}
226+-- make the 'f' parameter have a nominal type role. We need f to be
141−-- | Run the actions contained in the 'DMap'
227+-- representational so that we can use safe 'coerce'.
142−sequenceDmap :: Applicative t => DMap f t -> t (DMap f Identity)
228+newtype ComposeMaybe f a =
143−sequenceDmap = DMap.traverseWithKey $ \_ t -> Identity <$> t
229+ ComposeMaybe { getComposeMaybe :: Maybe (f a) } deriving (Show, Eq, Ord)
144−
230+
145−{-# DEPRECATED wrapDMap "Use 'Data.Dependent.Map.map (f . runIdentity)' instead" #-}
231+deriving instance Functor f => Functor (ComposeMaybe f)
146−-- | Replace the 'Identity' functor for a 'DMap''s values with a different functor
147−wrapDMap :: (forall a. a -> f a) -> DMap k Identity -> DMap k f
148−wrapDMap f = DMap.map $ f . runIdentity
149−
150−{-# DEPRECATED rewrapDMap "Use 'Data.Dependent.Map.map' instead" #-}
151−-- | Replace one functor for a 'DMap''s values with a different functor
152−rewrapDMap :: (forall (a :: *). f a -> g a) -> DMap k f -> DMap k g
153−rewrapDMap = DMap.map
154−
155−{-# DEPRECATED unwrapDMap "Use 'Data.Dependent.Map.map (Identity . f)' instead" #-}
156−-- | Replace one functor for a 'DMap''s values with the 'Identity' functor
157−unwrapDMap :: (forall a. f a -> a) -> DMap k f -> DMap k Identity
158−unwrapDMap f = DMap.map $ Identity . f
159−
160−{-# DEPRECATED unwrapDMapMaybe "Use 'Data.Dependent.Map.mapMaybeWithKey (\\_ a -> fmap Identity $ f a)' instead" #-}
161−-- | Like 'unwrapDMap', but possibly delete some values from the DMap
162−unwrapDMapMaybe :: GCompare k => (forall a. f a -> Maybe a) -> DMap k f -> DMap k Identity
163−unwrapDMapMaybe f = DMap.mapMaybeWithKey $ \_ a -> Identity <$> f a
164−
165−{-# DEPRECATED extractFunctorDMap "Use 'mapKeyValuePairsMonotonic (\\(Const2 k :=> Identity v) -> Const2 k :=> v)' instead" #-}
166−-- | Eliminate the 'Identity' functor in a 'DMap' and replace it with the
167−-- underlying functor
168−extractFunctorDMap :: DMap (Const2 k (f v)) Identity -> DMap (Const2 k v) f
169−extractFunctorDMap = mapKeyValuePairsMonotonic $ \(Const2 k :=> Identity v) -> Const2 k :=> v
src/Data/Monoid/DecidablyEmpty.hsnew file+115
@@ -0,0 +1,115 @@
1+{-# LANGUAGE CPP #-}
2+{-# LANGUAGE DefaultSignatures #-}
3+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
4+{-# LANGUAGE StandaloneDeriving #-}
5+{-# LANGUAGE TypeOperators #-}
6+
7+-- TODO upstream somwhere else?
8+module Data.Monoid.DecidablyEmpty where
9+
10+import Data.Functor.Identity
11+import Data.Functor.Const
12+import Data.Monoid
13+import Data.Maybe (isNothing)
14+#if MIN_VERSION_base(4,11,0)
15+import Data.Ord
16+#endif
17+import Data.Proxy
18+import Data.Semigroup hiding (First, Last)
19+#if MIN_VERSION_base(4,12,0)
20+import GHC.Generics
21+#endif
22+
23+import qualified Data.IntSet as IntSet
24+import qualified Data.IntMap as IntMap
25+import qualified Data.Map as Map
26+import qualified Data.Sequence as Seq
27+import qualified Data.Set as Set
28+
29+import Data.GADT.Compare
30+import qualified Data.Dependent.Map as DMap
31+
32+-- | A 'DecidablyEmpty' is one where it can be computed whether or not an
33+-- arbitrary value is 'mempty'.
34+--
35+-- By using this class rather than 'Eq', we avoid unnecessary constraining the
36+-- contents of 'Functor's. This makes it possible to efficiently combine and/or
37+-- nest patch maps with 'Eq'-lacking values (e.g. functions) at the leaves.
38+class Monoid a => DecidablyEmpty a where
39+ isEmpty :: a -> Bool
40+ default isEmpty :: Eq a => a -> Bool
41+ isEmpty = (==) mempty
42+
43+-- base
44+
45+instance DecidablyEmpty Ordering
46+instance DecidablyEmpty ()
47+instance DecidablyEmpty Any
48+instance DecidablyEmpty All
49+-- instance DecidablyEmpty Lifetime
50+-- instance DecidablyEmpty Event
51+instance DecidablyEmpty [a] where
52+ isEmpty = null
53+instance
54+#if MIN_VERSION_base(4,11,0)
55+ Semigroup a
56+#else
57+ Monoid a
58+#endif
59+ => DecidablyEmpty (Maybe a) where
60+ isEmpty = isNothing
61+deriving instance (Num a, DecidablyEmpty a) => DecidablyEmpty (Product a)
62+deriving instance (DecidablyEmpty a, Num a) => DecidablyEmpty (Sum a)
63+deriving instance DecidablyEmpty a => DecidablyEmpty (Dual a)
64+instance DecidablyEmpty (First a) where
65+ isEmpty (First a) = isNothing a
66+instance DecidablyEmpty (Last a) where
67+ isEmpty (Last a) = isNothing a
68+deriving instance DecidablyEmpty a => DecidablyEmpty (Identity a)
69+instance Semigroup a => DecidablyEmpty (Option a) where
70+ isEmpty (Option a) = isNothing a
71+deriving instance DecidablyEmpty m => DecidablyEmpty (WrappedMonoid m)
72+instance (Ord a, Bounded a) => DecidablyEmpty (Max a)
73+instance (Ord a, Bounded a) => DecidablyEmpty (Min a)
74+instance DecidablyEmpty (Proxy s)
75+deriving instance DecidablyEmpty a => DecidablyEmpty (Const a b)
76+#if MIN_VERSION_base(4,11,0)
77+deriving instance DecidablyEmpty a => DecidablyEmpty (Down a)
78+#endif
79+#if MIN_VERSION_base(4,12,0)
80+deriving instance DecidablyEmpty p => DecidablyEmpty (Par1 p)
81+instance DecidablyEmpty (U1 p)
82+deriving instance DecidablyEmpty (f p) => DecidablyEmpty (Rec1 f p)
83+deriving instance DecidablyEmpty (f p) => DecidablyEmpty (M1 i c f p)
84+deriving instance DecidablyEmpty c => DecidablyEmpty (K1 i c p)
85+instance (DecidablyEmpty (f p), DecidablyEmpty (g p)) => DecidablyEmpty ((f :*: g) p) where
86+ isEmpty (x :*: y) = isEmpty x && isEmpty y
87+deriving instance DecidablyEmpty (f (g p)) => DecidablyEmpty ((f :.: g) p)
88+#endif
89+
90+instance (DecidablyEmpty a, DecidablyEmpty b) => DecidablyEmpty (a, b) where
91+ isEmpty (a, b) = isEmpty a && isEmpty b
92+instance (DecidablyEmpty a, DecidablyEmpty b, DecidablyEmpty c) => DecidablyEmpty (a, b, c) where
93+ isEmpty (a, b, c) = isEmpty a && isEmpty b && isEmpty c
94+instance (DecidablyEmpty a, DecidablyEmpty b, DecidablyEmpty c, DecidablyEmpty d) => DecidablyEmpty (a, b, c, d) where
95+ isEmpty (a, b, c, d) = isEmpty a && isEmpty b && isEmpty c && isEmpty d
96+instance (DecidablyEmpty a, DecidablyEmpty b, DecidablyEmpty c, DecidablyEmpty d, DecidablyEmpty e) => DecidablyEmpty (a, b, c, d, e) where
97+ isEmpty (a, b, c, d, e) = isEmpty a && isEmpty b && isEmpty c && isEmpty d && isEmpty e
98+
99+-- containers
100+
101+instance DecidablyEmpty IntSet.IntSet where
102+ isEmpty = IntSet.null
103+instance DecidablyEmpty (IntMap.IntMap v) where
104+ isEmpty = IntMap.null
105+instance Ord k => DecidablyEmpty (Map.Map k v) where
106+ isEmpty = Map.null
107+instance DecidablyEmpty (Seq.Seq v) where
108+ isEmpty = Seq.null
109+instance Ord k => DecidablyEmpty (Set.Set k) where
110+ isEmpty = Set.null
111+
112+-- dependent-map
113+
114+instance GCompare k => DecidablyEmpty (DMap.DMap k v) where
115+ isEmpty = DMap.null
src/Data/Patch.hsnew file+95
@@ -0,0 +1,95 @@
1+{-# LANGUAGE CPP #-}
2+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
3+{-# LANGUAGE StandaloneDeriving #-}
4+{-# LANGUAGE TypeFamilies #-}
5+{-# LANGUAGE TypeOperators #-}
6+-- |
7+-- Module:
8+-- Data.Patch
9+-- Description:
10+-- This module defines the 'Patch' class.
11+module Data.Patch
12+ ( module Data.Patch
13+ , module X
14+ ) where
15+
16+import Control.Applicative
17+import Data.Functor.Const (Const (..))
18+import Data.Functor.Identity
19+import Data.Map.Monoidal (MonoidalMap)
20+import Data.Proxy
21+#if !MIN_VERSION_base(4,11,0)
22+import Data.Semigroup (Semigroup (..))
23+#endif
24+import GHC.Generics
25+
26+import Data.Semigroup.Additive as X
27+import Data.Patch.Class as X
28+import Data.Patch.DMap as X hiding (getDeletions)
29+import Data.Patch.DMapWithMove as X
30+ ( PatchDMapWithMove, const2PatchDMapWithMoveWith, mapPatchDMapWithMove
31+ , patchDMapWithMoveToPatchMapWithMoveWith
32+ , traversePatchDMapWithMoveWithKey, unPatchDMapWithMove
33+ , unsafePatchDMapWithMove, weakenPatchDMapWithMoveWith
34+ )
35+import Data.Patch.IntMap as X hiding (getDeletions)
36+import Data.Patch.Map as X
37+import Data.Patch.MapWithMove as X
38+ ( PatchMapWithMove, patchMapWithMoveNewElements
39+ , patchMapWithMoveNewElementsMap, unPatchMapWithMove
40+ , unsafePatchMapWithMove
41+ )
42+
43+-- | A 'Group' is a 'Monoid' where every element has an inverse.
44+class (Semigroup q, Monoid q) => Group q where
45+ negateG :: q -> q
46+ (~~) :: q -> q -> q
47+ r ~~ s = r <> negateG s
48+
49+-- | The elements of an 'Additive' 'Semigroup' can be considered as patches of their own type.
50+newtype AdditivePatch p = AdditivePatch { unAdditivePatch :: p }
51+
52+instance Additive p => Patch (AdditivePatch p) where
53+ type PatchTarget (AdditivePatch p) = p
54+ apply (AdditivePatch p) q = Just $ p <> q
55+
56+instance (Ord k, Group q) => Group (MonoidalMap k q) where
57+ negateG = fmap negateG
58+
59+-- | Trivial group.
60+instance Group () where
61+ negateG _ = ()
62+ _ ~~ _ = ()
63+
64+-- | Product group. A Pair of groups gives rise to a group
65+instance (Group a, Group b) => Group (a, b) where
66+ negateG (a, b) = (negateG a, negateG b)
67+ (a, b) ~~ (c, d) = (a ~~ c, b ~~ d)
68+
69+-- See https://gitlab.haskell.org/ghc/ghc/issues/11135#note_111802 for the reason Compose is not also provided.
70+-- Base does not define Monoid (Compose f g a) so this is the best we can
71+-- really do for functor composition.
72+instance Group (f (g a)) => Group ((f :.: g) a) where
73+ negateG (Comp1 xs) = Comp1 (negateG xs)
74+ Comp1 xs ~~ Comp1 ys = Comp1 (xs ~~ ys)
75+
76+-- | Product of groups, Functor style.
77+instance (Group (f a), Group (g a)) => Group ((f :*: g) a) where
78+ negateG (a :*: b) = negateG a :*: negateG b
79+ (a :*: b) ~~ (c :*: d) = (a ~~ c) :*: (b ~~ d)
80+
81+-- | Trivial group, Functor style
82+instance Group (Proxy x) where
83+ negateG _ = Proxy
84+ _ ~~ _ = Proxy
85+
86+-- | Const lifts groups into a functor.
87+deriving instance Group a => Group (Const a x)
88+
89+-- | Identity lifts groups pointwise (at only one point)
90+deriving instance Group a => Group (Identity a)
91+
92+-- | Functions lift groups pointwise.
93+instance Group b => Group (a -> b) where
94+ negateG f = negateG . f
95+ (~~) = liftA2 (~~)
src/Data/Patch/Class.hsnew file+45
@@ -0,0 +1,45 @@
1+{-# LANGUAGE CPP #-}
2+{-# LANGUAGE ScopedTypeVariables #-}
3+{-# LANGUAGE TypeFamilies #-}
4+-- | The interface for types which represent changes made to other types
5+module Data.Patch.Class where
6+
7+import Data.Functor.Identity
8+import Data.Kind (Type)
9+import Data.Maybe
10+#if !MIN_VERSION_base(4,11,0)
11+import Data.Semigroup (Semigroup(..))
12+#endif
13+import Data.Proxy
14+
15+-- | A 'Patch' type represents a kind of change made to a datastructure.
16+--
17+-- If an instance of 'Patch' is also an instance of 'Semigroup', it should obey
18+-- the law that @applyAlways (f <> g) == applyAlways f . applyAlways g@.
19+class Patch p where
20+ type PatchTarget p :: Type
21+ -- | Apply the patch @p a@ to the value @a@. If no change is needed, return
22+ -- 'Nothing'.
23+ apply :: p -> PatchTarget p -> Maybe (PatchTarget p)
24+
25+-- | Apply a 'Patch'; if it does nothing, return the original value
26+applyAlways :: Patch p => p -> PatchTarget p -> PatchTarget p
27+applyAlways p t = fromMaybe t $ apply p t
28+
29+-- | 'Identity' can be used as a 'Patch' that always fully replaces the value
30+instance Patch (Identity a) where
31+ type PatchTarget (Identity a) = a
32+ apply (Identity a) _ = Just a
33+
34+-- | 'Proxy' can be used as a 'Patch' that does nothing.
35+instance forall (a :: Type). Patch (Proxy a) where
36+ type PatchTarget (Proxy a) = a
37+ apply ~Proxy _ = Nothing
38+
39+-- | Like '(.)', but composes functions that return patches rather than
40+-- functions that return new values. The Semigroup instance for patches must
41+-- apply patches right-to-left, like '(.)'.
42+composePatchFunctions :: (Patch p, Semigroup p) => (PatchTarget p -> p) -> (PatchTarget p -> p) -> PatchTarget p -> p
43+composePatchFunctions g f a =
44+ let fp = f a
45+ in g (applyAlways fp a) <> fp
src/Data/Patch/DMap.hsnew file+93
@@ -0,0 +1,93 @@
1+{-# LANGUAGE CPP #-}
2+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
3+{-# LANGUAGE LambdaCase #-}
4+{-# LANGUAGE PolyKinds #-}
5+{-# LANGUAGE Rank2Types #-}
6+{-# LANGUAGE ScopedTypeVariables #-}
7+{-# LANGUAGE StandaloneDeriving #-}
8+{-# LANGUAGE TypeFamilies #-}
9+
10+-- | 'Patch'es on 'DMap' that consist only of insertions (or overwrites) and deletions.
11+module Data.Patch.DMap where
12+
13+import Data.Patch.Class
14+import Data.Patch.IntMap
15+import Data.Patch.Map
16+
17+import Data.Dependent.Map (DMap)
18+import Data.Dependent.Sum (DSum (..))
19+import Data.GADT.Compare (GCompare (..))
20+import qualified Data.Dependent.Map as DMap
21+import Data.Functor.Constant
22+import Data.Functor.Misc
23+import qualified Data.IntMap as IntMap
24+import qualified Data.Map as Map
25+import Data.Monoid.DecidablyEmpty
26+#if !MIN_VERSION_base(4,11,0)
27+import Data.Semigroup (Semigroup (..))
28+#endif
29+import Data.Some (Some)
30+
31+-- | A set of changes to a 'DMap'. Any element may be inserted/updated or deleted.
32+-- Insertions are represented as @'ComposeMaybe' (Just value)@,
33+-- while deletions are represented as @'ComposeMaybe' Nothing@.
34+newtype PatchDMap k v = PatchDMap { unPatchDMap :: DMap k (ComposeMaybe v) }
35+
36+deriving instance GCompare k => Semigroup (PatchDMap k v)
37+
38+deriving instance GCompare k => Monoid (PatchDMap k v)
39+
40+-- It won't let me derive for some reason
41+instance GCompare k => DecidablyEmpty (PatchDMap k v) where
42+ isEmpty (PatchDMap m) = DMap.null m
43+
44+-- | Apply the insertions or deletions to a given 'DMap'.
45+instance GCompare k => Patch (PatchDMap k v) where
46+ type PatchTarget (PatchDMap k v) = DMap k v
47+ 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?
48+ where insertions = DMap.mapMaybeWithKey (const $ getComposeMaybe) diff
49+ deletions = DMap.mapMaybeWithKey (const $ nothingToJust . getComposeMaybe) diff
50+ nothingToJust = \case
51+ Nothing -> Just $ Constant ()
52+ Just _ -> Nothing
53+
54+-- | Map a function @v a -> v' a@ over any inserts/updates in the given
55+-- @'PatchDMap' k v@ to produce a @'PatchDMap' k v'@.
56+mapPatchDMap :: (forall a. v a -> v' a) -> PatchDMap k v -> PatchDMap k v'
57+mapPatchDMap f (PatchDMap p) = PatchDMap $ DMap.map (ComposeMaybe . fmap f . getComposeMaybe) p
58+
59+-- | Map an effectful function @v a -> f (v' a)@ over any inserts/updates in the given
60+-- @'PatchDMap' k v@ to produce a @'PatchDMap' k v'@.
61+traversePatchDMap :: Applicative f => (forall a. v a -> f (v' a)) -> PatchDMap k v -> f (PatchDMap k v')
62+traversePatchDMap f = traversePatchDMapWithKey $ const f
63+
64+-- | Map an effectful function @k a -> v a -> f (v' a)@ over any inserts/updates
65+-- in the given @'PatchDMap' k v@ to produce a @'PatchDMap' k v'@.
66+traversePatchDMapWithKey :: Applicative m => (forall a. k a -> v a -> m (v' a)) -> PatchDMap k v -> m (PatchDMap k v')
67+traversePatchDMapWithKey f (PatchDMap p) = PatchDMap <$> DMap.traverseWithKey (\k (ComposeMaybe v) -> ComposeMaybe <$> traverse (f k) v) p
68+
69+-- | Weaken a @'PatchDMap' k v@ to a @'PatchMap' (Some k) v'@ using a function
70+-- @v a -> v'@ to weaken each value contained in the patch.
71+weakenPatchDMapWith :: (forall a. v a -> v') -> PatchDMap k v -> PatchMap (Some k) v'
72+weakenPatchDMapWith f (PatchDMap p) = PatchMap $ weakenDMapWith (fmap f . getComposeMaybe) p
73+
74+-- | Convert a weak @'PatchDMap' ('Const2' k a) v@ where the @a@ is known by way of
75+-- the @Const2@ into a @'PatchMap' k v'@ using a rank 1 function @v a -> v'@.
76+patchDMapToPatchMapWith :: (v a -> v') -> PatchDMap (Const2 k a) v -> PatchMap k v'
77+patchDMapToPatchMapWith f (PatchDMap p) = PatchMap $ dmapToMapWith (fmap f . getComposeMaybe) p
78+
79+-- | Convert a @'PatchMap' k v@ into a @'PatchDMap' ('Const2' k a) v'@ using a function @v -> v' a@.
80+const2PatchDMapWith :: forall k v v' a. (v -> v' a) -> PatchMap k v -> PatchDMap (Const2 k a) v'
81+const2PatchDMapWith f (PatchMap p) = PatchDMap $ DMap.fromDistinctAscList $ g <$> Map.toAscList p
82+ where g :: (k, Maybe v) -> DSum (Const2 k a) (ComposeMaybe v')
83+ g (k, e) = Const2 k :=> ComposeMaybe (f <$> e)
84+
85+-- | Convert a @'PatchIntMap' v@ into a @'PatchDMap' ('Const2' Int a) v'@ using a function @v -> v' a@.
86+const2IntPatchDMapWith :: forall v f a. (v -> f a) -> PatchIntMap v -> PatchDMap (Const2 IntMap.Key a) f
87+const2IntPatchDMapWith f (PatchIntMap p) = PatchDMap $ DMap.fromDistinctAscList $ g <$> IntMap.toAscList p
88+ where g :: (IntMap.Key, Maybe v) -> DSum (Const2 IntMap.Key a) (ComposeMaybe f)
89+ g (k, e) = Const2 k :=> ComposeMaybe (f <$> e)
90+
91+-- | Get the values that will be replaced or deleted if the given patch is applied to the given 'DMap'.
92+getDeletions :: GCompare k => PatchDMap k v -> DMap k v' -> DMap k v'
93+getDeletions (PatchDMap p) m = DMap.intersectionWithKey (\_ v _ -> v) m p
src/Data/Patch/DMapWithMove.hsnew file+371
@@ -0,0 +1,371 @@
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 Data.Patch.DMapWithMove where
17+
18+import Data.Patch.Class
19+import Data.Patch.MapWithMove (PatchMapWithMove (..))
20+import qualified Data.Patch.MapWithMove as MapWithMove
21+
22+import Data.Constraint.Extras
23+import Data.Dependent.Map (DMap)
24+import Data.Dependent.Sum (DSum (..))
25+import qualified Data.Dependent.Map as DMap
26+import Data.Functor.Constant
27+import Data.Functor.Misc
28+import Data.Functor.Product
29+import Data.GADT.Compare (GEq (..), GCompare (..))
30+import Data.GADT.Show (GShow, gshow)
31+import qualified Data.Map as Map
32+import Data.Maybe
33+import Data.Monoid.DecidablyEmpty
34+#if !MIN_VERSION_base(4,11,0)
35+import Data.Semigroup (Semigroup (..))
36+#endif
37+import Data.Some (Some, mkSome)
38+import Data.These
39+
40+-- | 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
41+-- destinations.
42+--
43+-- Invariants:
44+--
45+-- * A key should not move to itself.
46+-- * A move should always be represented with both the destination key (as a 'From_Move') and the source key (as a @'ComposeMaybe' ('Just' destination)@)
47+newtype PatchDMapWithMove k v = PatchDMapWithMove (DMap k (NodeInfo k v))
48+
49+-- It won't let me derive for some reason
50+instance GCompare k => DecidablyEmpty (PatchDMapWithMove k v) where
51+ isEmpty (PatchDMapWithMove m) = DMap.null m
52+
53+-- |Structure which represents what changes apply to a particular key. @_nodeInfo_from@ specifies what happens to this key, and in particular what other key
54+-- the current key is moving from, while @_nodeInfo_to@ specifies what key the current key is moving to if involved in a move.
55+data NodeInfo k v a = NodeInfo
56+ { _nodeInfo_from :: !(From k v a)
57+ -- ^Change applying to the current key, be it an insert, move, or delete.
58+ , _nodeInfo_to :: !(To k a)
59+ -- ^Where this key is moving to, if involved in a move. Should only be @ComposeMaybe (Just k)@ when there is a corresponding 'From_Move'.
60+ }
61+ deriving (Show)
62+
63+-- |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
64+-- key (@From_Delete@), or moving a key (@From_Move@).
65+data From (k :: a -> *) (v :: a -> *) :: a -> * where
66+ -- |Insert a new or update an existing key with the given value @v a@
67+ From_Insert :: v a -> From k v a
68+ -- |Delete the existing key
69+ From_Delete :: From k v a
70+ -- |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@,
71+ -- usually but not necessarily with @From_Delete@.
72+ From_Move :: !(k a) -> From k v a
73+ deriving (Show, Read, Eq, Ord)
74+
75+-- |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
76+-- operation.
77+type To = ComposeMaybe
78+
79+-- |Test whether a 'PatchDMapWithMove' satisfies its invariants.
80+validPatchDMapWithMove :: forall k v. (GCompare k, GShow k) => DMap k (NodeInfo k v) -> Bool
81+validPatchDMapWithMove = not . null . validationErrorsForPatchDMapWithMove
82+
83+-- |Enumerate what reasons a 'PatchDMapWithMove' doesn't satisfy its invariants, returning @[]@ if it's valid.
84+validationErrorsForPatchDMapWithMove :: forall k v. (GCompare k, GShow k) => DMap k (NodeInfo k v) -> [String]
85+validationErrorsForPatchDMapWithMove m =
86+ noSelfMoves <> movesBalanced
87+ where
88+ noSelfMoves = mapMaybe selfMove . DMap.toAscList $ m
89+ selfMove (dst :=> NodeInfo (From_Move src) _) | Just _ <- dst `geq` src = Just $ "self move of key " <> gshow src <> " at destination side"
90+ selfMove (src :=> NodeInfo _ (ComposeMaybe (Just dst))) | Just _ <- src `geq` dst = Just $ "self move of key " <> gshow dst <> " at source side"
91+ selfMove _ = Nothing
92+ movesBalanced = mapMaybe unbalancedMove . DMap.toAscList $ m
93+ unbalancedMove (dst :=> NodeInfo (From_Move src) _) =
94+ case DMap.lookup src m of
95+ Nothing -> Just $ "unbalanced move at destination key " <> gshow dst <> " supposedly from " <> gshow src <> " but source key is not in the patch"
96+ Just (NodeInfo _ (ComposeMaybe (Just dst'))) ->
97+ if isNothing (dst' `geq` dst)
98+ then Just $ "unbalanced move at destination key " <> gshow dst <> " from " <> gshow src <> " is going to " <> gshow dst' <> " instead"
99+ else Nothing
100+ _ ->
101+ Just $ "unbalanced move at destination key " <> gshow dst <> " supposedly from " <> gshow src <> " but source key has no move to key"
102+ unbalancedMove (src :=> NodeInfo _ (ComposeMaybe (Just dst))) =
103+ case DMap.lookup dst m of
104+ Nothing -> Just $ " unbalanced move at source key " <> gshow src <> " supposedly going to " <> gshow dst <> " but destination key is not in the patch"
105+ Just (NodeInfo (From_Move src') _) ->
106+ if isNothing (src' `geq` src)
107+ then Just $ "unbalanced move at source key " <> gshow src <> " to " <> gshow dst <> " is coming from " <> gshow src' <> " instead"
108+ else Nothing
109+
110+ _ ->
111+ Just $ "unbalanced move at source key " <> gshow src <> " supposedly going to " <> gshow dst <> " but destination key is not moving"
112+ unbalancedMove _ = Nothing
113+
114+-- |Test whether two @'PatchDMapWithMove' k v@ contain the same patch operations.
115+instance (GEq k, Has' Eq k (NodeInfo k v)) => Eq (PatchDMapWithMove k v) where
116+ PatchDMapWithMove a == PatchDMapWithMove b = a == b
117+
118+-- |Higher kinded 2-tuple, identical to @Data.Functor.Product@ from base ≥ 4.9
119+data Pair1 f g a = Pair1 (f a) (g a)
120+
121+-- |Helper data structure used for composing patches using the monoid instance.
122+data Fixup k v a
123+ = Fixup_Delete
124+ | Fixup_Update (These (From k v a) (To k a))
125+
126+-- |Compose patches having the same effect as applying the patches in turn: @'applyAlways' (p <> q) == 'applyAlways' p . 'applyAlways' q@
127+instance GCompare k => Semigroup (PatchDMapWithMove k v) where
128+ PatchDMapWithMove ma <> PatchDMapWithMove mb = PatchDMapWithMove m
129+ where
130+ connections = DMap.toList $ DMap.intersectionWithKey (\_ a b -> Pair1 (_nodeInfo_to a) (_nodeInfo_from b)) ma mb
131+ h :: DSum k (Pair1 (ComposeMaybe k) (From k v)) -> [DSum k (Fixup k v)]
132+ h (_ :=> Pair1 (ComposeMaybe mToAfter) editBefore) = case (mToAfter, editBefore) of
133+ (Just toAfter, From_Move fromBefore)
134+ | isJust $ fromBefore `geq` toAfter
135+ -> [toAfter :=> Fixup_Delete]
136+ | otherwise
137+ -> [ toAfter :=> Fixup_Update (This editBefore)
138+ , fromBefore :=> Fixup_Update (That (ComposeMaybe mToAfter))
139+ ]
140+ (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
141+ (Just toAfter, _) -> [toAfter :=> Fixup_Update (This editBefore)]
142+ (Nothing, _) -> []
143+ mergeFixups _ Fixup_Delete Fixup_Delete = Fixup_Delete
144+ mergeFixups _ (Fixup_Update a) (Fixup_Update b)
145+ | This x <- a, That y <- b
146+ = Fixup_Update $ These x y
147+ | That y <- a, This x <- b
148+ = Fixup_Update $ These x y
149+ mergeFixups _ _ _ = error "PatchDMapWithMove: incompatible fixups"
150+ fixups = DMap.fromListWithKey mergeFixups $ concatMap h connections
151+ combineNodeInfos _ nia nib = NodeInfo
152+ { _nodeInfo_from = _nodeInfo_from nia
153+ , _nodeInfo_to = _nodeInfo_to nib
154+ }
155+ applyFixup _ ni = \case
156+ Fixup_Delete -> Nothing
157+ Fixup_Update u -> Just $ NodeInfo
158+ { _nodeInfo_from = fromMaybe (_nodeInfo_from ni) $ getHere u
159+ , _nodeInfo_to = fromMaybe (_nodeInfo_to ni) $ getThere u
160+ }
161+ m = DMap.differenceWithKey applyFixup (DMap.unionWithKey combineNodeInfos ma mb) fixups
162+ getHere :: These a b -> Maybe a
163+ getHere = \case
164+ This a -> Just a
165+ These a _ -> Just a
166+ That _ -> Nothing
167+ getThere :: These a b -> Maybe b
168+ getThere = \case
169+ This _ -> Nothing
170+ These _ b -> Just b
171+ That b -> Just b
172+
173+-- |Compose patches having the same effect as applying the patches in turn: @'applyAlways' (p <> q) == 'applyAlways' p . 'applyAlways' q@
174+instance GCompare k => Monoid (PatchDMapWithMove k v) where
175+ mempty = PatchDMapWithMove mempty
176+ mappend = (<>)
177+
178+{-
179+mappendPatchDMapWithMoveSlow :: forall k v. (ShowTag k v, GCompare k) => PatchDMapWithMove k v -> PatchDMapWithMove k v -> PatchDMapWithMove k v
180+PatchDMapWithMove dstAfter srcAfter `mappendPatchDMapWithMoveSlow` PatchDMapWithMove dstBefore srcBefore = PatchDMapWithMove dst src
181+ where
182+ 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
183+ removeRedundantDst toKey (From_Move fromKey) | isJust (toKey `geq` fromKey) = Nothing
184+ removeRedundantDst _ a = Just a
185+ f :: forall a. k a -> From k v a -> Maybe (From k v a)
186+ f toKey _ = removeRedundantDst toKey $ case getDstAction toKey dstAfter of
187+ From_Move fromKey -> getDstAction fromKey dstBefore
188+ nonMove -> nonMove
189+ dst = DMap.mapMaybeWithKey f $ DMap.union dstAfter dstBefore
190+ getSrcAction k m = fromMaybe (ComposeMaybe $ Just k) $ DMap.lookup k m
191+ removeRedundantSrc fromKey (ComposeMaybe (Just toKey)) | isJust (fromKey `geq` toKey) = Nothing
192+ removeRedundantSrc _ a = Just a
193+ g :: forall a. k a -> ComposeMaybe k a -> Maybe (ComposeMaybe k a)
194+ g fromKey _ = removeRedundantSrc fromKey $ case getSrcAction fromKey srcBefore of
195+ ComposeMaybe Nothing -> ComposeMaybe Nothing
196+ ComposeMaybe (Just toKeyBefore) -> getSrcAction toKeyBefore srcAfter
197+ src = DMap.mapMaybeWithKey g $ DMap.union srcAfter srcBefore
198+-}
199+
200+-- |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'.
201+insertDMapKey :: k a -> v a -> PatchDMapWithMove k v
202+insertDMapKey k v =
203+ PatchDMapWithMove . DMap.singleton k $ NodeInfo (From_Insert v) (ComposeMaybe Nothing)
204+
205+-- |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:
206+--
207+-- @
208+-- 'DMap.delete' src (maybe dmap ('DMap.insert' dst) (DMap.lookup src dmap))
209+-- @
210+moveDMapKey :: GCompare k => k a -> k a -> PatchDMapWithMove k v
211+moveDMapKey src dst = case src `geq` dst of
212+ Nothing -> PatchDMapWithMove $ DMap.fromList
213+ [ dst :=> NodeInfo (From_Move src) (ComposeMaybe Nothing)
214+ , src :=> NodeInfo From_Delete (ComposeMaybe $ Just dst)
215+ ]
216+ Just _ -> mempty
217+
218+-- |Make a @'PatchDMapWithMove' k v@ which has the effect of swapping two keys in the mapping, equivalent to:
219+--
220+-- @
221+-- let aMay = DMap.lookup a dmap
222+-- bMay = DMap.lookup b dmap
223+-- in maybe id (DMap.insert a) (bMay <> aMay)
224+-- . maybe id (DMap.insert b) (aMay <> bMay)
225+-- . DMap.delete a . DMap.delete b $ dmap
226+-- @
227+swapDMapKey :: GCompare k => k a -> k a -> PatchDMapWithMove k v
228+swapDMapKey src dst = case src `geq` dst of
229+ Nothing -> PatchDMapWithMove $ DMap.fromList
230+ [ dst :=> NodeInfo (From_Move src) (ComposeMaybe $ Just src)
231+ , src :=> NodeInfo (From_Move dst) (ComposeMaybe $ Just dst)
232+ ]
233+ Just _ -> mempty
234+
235+-- |Make a @'PatchDMapWithMove' k v@ which has the effect of deleting a key in the mapping, equivalent to 'DMap.delete'.
236+deleteDMapKey :: k a -> PatchDMapWithMove k v
237+deleteDMapKey k = PatchDMapWithMove $ DMap.singleton k $ NodeInfo From_Delete $ ComposeMaybe Nothing
238+
239+{-
240+k1, k2 :: Const2 Int () ()
241+k1 = Const2 1
242+k2 = Const2 2
243+p1, p2 :: PatchDMapWithMove (Const2 Int ()) Identity
244+p1 = moveDMapKey k1 k2
245+p2 = moveDMapKey k2 k1
246+p12 = p1 <> p2
247+p21 = p2 <> p1
248+p12Slow = p1 `mappendPatchDMapWithMoveSlow` p2
249+p21Slow = p2 `mappendPatchDMapWithMoveSlow` p1
250+
251+testPatchDMapWithMove = do
252+ print p1
253+ print p2
254+ print $ p12 == deleteDMapKey k1
255+ print $ p21 == deleteDMapKey k2
256+ print $ p12Slow == deleteDMapKey k1
257+ print $ p21Slow == deleteDMapKey k2
258+
259+dst (PatchDMapWithMove x _) = x
260+src (PatchDMapWithMove _ x) = x
261+-}
262+
263+-- |Extract the 'DMap' representing the patch changes from the 'PatchDMapWithMove'.
264+unPatchDMapWithMove :: PatchDMapWithMove k v -> DMap k (NodeInfo k v)
265+unPatchDMapWithMove (PatchDMapWithMove p) = p
266+
267+-- |Wrap a 'DMap' representing patch changes into a 'PatchDMapWithMove', without checking any invariants.
268+--
269+-- __Warning:__ when using this function, you must ensure that the invariants of 'PatchDMapWithMove' are preserved; they will not be checked.
270+unsafePatchDMapWithMove :: DMap k (NodeInfo k v) -> PatchDMapWithMove k v
271+unsafePatchDMapWithMove = PatchDMapWithMove
272+
273+-- |Wrap a 'DMap' representing patch changes into a 'PatchDMapWithMove' while checking invariants. If the invariants are satisfied, @Right p@ is returned
274+-- otherwise @Left errors@.
275+patchDMapWithMove :: (GCompare k, GShow k) => DMap k (NodeInfo k v) -> Either [String] (PatchDMapWithMove k v)
276+patchDMapWithMove dm =
277+ case validationErrorsForPatchDMapWithMove dm of
278+ [] -> Right $ unsafePatchDMapWithMove dm
279+ errs -> Left errs
280+
281+-- |Map a natural transform @v -> v'@ over the given patch, transforming @'PatchDMapWithMove' k v@ into @'PatchDMapWithMove' k v'@.
282+mapPatchDMapWithMove :: forall k v v'. (forall a. v a -> v' a) -> PatchDMapWithMove k v -> PatchDMapWithMove k v'
283+mapPatchDMapWithMove f (PatchDMapWithMove p) = PatchDMapWithMove $
284+ DMap.map (\ni -> ni { _nodeInfo_from = g $ _nodeInfo_from ni }) p
285+ where g :: forall a. From k v a -> From k v' a
286+ g = \case
287+ From_Insert v -> From_Insert $ f v
288+ From_Delete -> From_Delete
289+ From_Move k -> From_Move k
290+
291+-- |Traverse an effectful function @forall a. v a -> m (v ' a)@ over the given patch, transforming @'PatchDMapWithMove' k v@ into @m ('PatchDMapWithMove' k v')@.
292+traversePatchDMapWithMove :: forall m k v v'. Applicative m => (forall a. v a -> m (v' a)) -> PatchDMapWithMove k v -> m (PatchDMapWithMove k v')
293+traversePatchDMapWithMove f = traversePatchDMapWithMoveWithKey $ const f
294+
295+-- |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')@.
296+traversePatchDMapWithMoveWithKey :: forall m k v v'. Applicative m => (forall a. k a -> v a -> m (v' a)) -> PatchDMapWithMove k v -> m (PatchDMapWithMove k v')
297+traversePatchDMapWithMoveWithKey f (PatchDMapWithMove p) = PatchDMapWithMove <$> DMap.traverseWithKey (nodeInfoMapFromM . g) p
298+ where g :: forall a. k a -> From k v a -> m (From k v' a)
299+ g k = \case
300+ From_Insert v -> From_Insert <$> f k v
301+ From_Delete -> pure From_Delete
302+ From_Move fromKey -> pure $ From_Move fromKey
303+
304+-- |Map a function which transforms @'From' k v a@ into a @'From' k v' a@ over a @'NodeInfo' k v a@.
305+nodeInfoMapFrom :: (From k v a -> From k v' a) -> NodeInfo k v a -> NodeInfo k v' a
306+nodeInfoMapFrom f ni = ni { _nodeInfo_from = f $ _nodeInfo_from ni }
307+
308+-- |Map an effectful function which transforms @'From' k v a@ into a @f ('From' k v' a)@ over a @'NodeInfo' k v a@.
309+nodeInfoMapFromM :: Functor f => (From k v a -> f (From k v' a)) -> NodeInfo k v a -> f (NodeInfo k v' a)
310+nodeInfoMapFromM f ni = fmap (\result -> ni { _nodeInfo_from = result }) $ f $ _nodeInfo_from ni
311+
312+-- |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
313+-- values.
314+weakenPatchDMapWithMoveWith :: forall k v v'. (forall a. v a -> v') -> PatchDMapWithMove k v -> PatchMapWithMove (Some k) v'
315+weakenPatchDMapWithMoveWith f (PatchDMapWithMove p) = PatchMapWithMove $ weakenDMapWith g p
316+ where g :: forall a. NodeInfo k v a -> MapWithMove.NodeInfo (Some k) v'
317+ g ni = MapWithMove.NodeInfo
318+ { MapWithMove._nodeInfo_from = case _nodeInfo_from ni of
319+ From_Insert v -> MapWithMove.From_Insert $ f v
320+ From_Delete -> MapWithMove.From_Delete
321+ From_Move k -> MapWithMove.From_Move $ mkSome k
322+ , MapWithMove._nodeInfo_to = mkSome <$> getComposeMaybe (_nodeInfo_to ni)
323+ }
324+
325+-- |"Weaken" a @'PatchDMapWithMove' (Const2 k a) v@ to a @'PatchMapWithMove' k v'@. Weaken is in scare quotes because the 'Const2' has already disabled any
326+-- dependency in the typing and all points are already @a@, hence the function to map each value to @v'@ is not higher rank.
327+patchDMapWithMoveToPatchMapWithMoveWith :: forall k v v' a. (v a -> v') -> PatchDMapWithMove (Const2 k a) v -> PatchMapWithMove k v'
328+patchDMapWithMoveToPatchMapWithMoveWith f (PatchDMapWithMove p) = PatchMapWithMove $ dmapToMapWith g p
329+ where g :: NodeInfo (Const2 k a) v a -> MapWithMove.NodeInfo k v'
330+ g ni = MapWithMove.NodeInfo
331+ { MapWithMove._nodeInfo_from = case _nodeInfo_from ni of
332+ From_Insert v -> MapWithMove.From_Insert $ f v
333+ From_Delete -> MapWithMove.From_Delete
334+ From_Move (Const2 k) -> MapWithMove.From_Move k
335+ , MapWithMove._nodeInfo_to = unConst2 <$> getComposeMaybe (_nodeInfo_to ni)
336+ }
337+
338+-- |"Strengthen" a @'PatchMapWithMove' k v@ into a @'PatchDMapWithMove ('Const2' k a)@; that is, turn a non-dependently-typed patch into a dependently typed
339+-- one but which always has a constant key type represented by 'Const2'. Apply the given function to each @v@ to produce a @v' a@.
340+-- Completemented by 'patchDMapWithMoveToPatchMapWithMoveWith'
341+const2PatchDMapWithMoveWith :: forall k v v' a. (v -> v' a) -> PatchMapWithMove k v -> PatchDMapWithMove (Const2 k a) v'
342+const2PatchDMapWithMoveWith f (PatchMapWithMove p) = PatchDMapWithMove $ DMap.fromDistinctAscList $ g <$> Map.toAscList p
343+ where g :: (k, MapWithMove.NodeInfo k v) -> DSum (Const2 k a) (NodeInfo (Const2 k a) v')
344+ g (k, ni) = Const2 k :=> NodeInfo
345+ { _nodeInfo_from = case MapWithMove._nodeInfo_from ni of
346+ MapWithMove.From_Insert v -> From_Insert $ f v
347+ MapWithMove.From_Delete -> From_Delete
348+ MapWithMove.From_Move fromKey -> From_Move $ Const2 fromKey
349+ , _nodeInfo_to = ComposeMaybe $ Const2 <$> MapWithMove._nodeInfo_to ni
350+ }
351+
352+-- | Apply the insertions, deletions, and moves to a given 'DMap'.
353+instance GCompare k => Patch (PatchDMapWithMove k v) where
354+ type PatchTarget (PatchDMapWithMove k v) = DMap k v
355+ 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?
356+ where insertions = DMap.mapMaybeWithKey insertFunc p
357+ insertFunc :: forall a. k a -> NodeInfo k v a -> Maybe (v a)
358+ insertFunc _ ni = case _nodeInfo_from ni of
359+ From_Insert v -> Just v
360+ From_Move k -> DMap.lookup k old
361+ From_Delete -> Nothing
362+ deletions = DMap.mapMaybeWithKey deleteFunc p
363+ deleteFunc :: forall a. k a -> NodeInfo k v a -> Maybe (Constant () a)
364+ deleteFunc _ ni = case _nodeInfo_from ni of
365+ From_Delete -> Just $ Constant ()
366+ _ -> Nothing
367+
368+-- | Get the values that will be replaced, deleted, or moved if the given patch is applied to the given 'DMap'.
369+getDeletionsAndMoves :: GCompare k => PatchDMapWithMove k v -> DMap k v' -> DMap k (Product v' (ComposeMaybe k))
370+getDeletionsAndMoves (PatchDMapWithMove p) m = DMap.intersectionWithKey f m p
371+ where f _ v ni = Pair v $ _nodeInfo_to ni
src/Data/Patch/IntMap.hsnew file+76
@@ -0,0 +1,76 @@
1+{-# LANGUAGE CPP #-}
2+{-# LANGUAGE DeriveTraversable #-}
3+{-# LANGUAGE FlexibleInstances #-}
4+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
5+{-# LANGUAGE MultiParamTypeClasses #-}
6+{-# LANGUAGE StandaloneDeriving #-}
7+{-# LANGUAGE TemplateHaskell #-}
8+{-# LANGUAGE TypeFamilies #-}
9+
10+-- | Module containing 'PatchIntMap', a 'Patch' for 'IntMap' which allows for
11+-- insert/update or delete of associations.
12+module Data.Patch.IntMap where
13+
14+import Control.Lens
15+import Data.IntMap.Strict (IntMap)
16+import qualified Data.IntMap.Strict as IntMap
17+import Data.Maybe
18+import Data.Monoid.DecidablyEmpty
19+#if !MIN_VERSION_base(4,11,0)
20+import Data.Semigroup (Semigroup (..))
21+#endif
22+import Data.Patch.Class
23+
24+-- | 'Patch' for 'IntMap' which represents insertion or deletion of keys in the mapping.
25+-- Internally represented by 'IntMap (Maybe a)', where @Just@ means insert/update
26+-- and @Nothing@ means delete.
27+newtype PatchIntMap a = PatchIntMap { unPatchIntMap :: IntMap (Maybe a) }
28+ deriving ( Show, Read, Eq, Ord
29+ , Functor, Foldable, Traversable
30+ , Monoid, DecidablyEmpty
31+ )
32+
33+-- | @a <> b@ will apply the changes of @b@ and then apply the changes of @a@.
34+-- If the same key is modified by both patches, the one on the left will take
35+-- precedence.
36+deriving instance Semigroup (PatchIntMap v)
37+
38+makeWrapped ''PatchIntMap
39+
40+-- | Apply the insertions or deletions to a given 'IntMap'.
41+instance Patch (PatchIntMap a) where
42+ type PatchTarget (PatchIntMap a) = IntMap a
43+ apply (PatchIntMap p) v = if IntMap.null p then Nothing else Just $
44+ let removes = IntMap.filter isNothing p
45+ adds = IntMap.mapMaybe id p
46+ in IntMap.union adds $ v `IntMap.difference` removes
47+
48+instance FunctorWithIndex Int PatchIntMap
49+instance FoldableWithIndex Int PatchIntMap
50+instance TraversableWithIndex Int PatchIntMap where
51+ itraverse = itraversed . Indexed
52+ itraversed = _Wrapped .> itraversed <. traversed
53+
54+-- | Map a function @Int -> a -> b@ over all @a@s in the given @'PatchIntMap' a@
55+-- (that is, all inserts/updates), producing a @PatchIntMap b@.
56+mapIntMapPatchWithKey :: (Int -> a -> b) -> PatchIntMap a -> PatchIntMap b
57+mapIntMapPatchWithKey f (PatchIntMap m) = PatchIntMap $ IntMap.mapWithKey (\ k mv -> f k <$> mv) m
58+
59+-- | Map an effectful function @Int -> a -> f b@ over all @a@s in the given @'PatchIntMap' a@
60+-- (that is, all inserts/updates), producing a @f (PatchIntMap b)@.
61+traverseIntMapPatchWithKey :: Applicative f => (Int -> a -> f b) -> PatchIntMap a -> f (PatchIntMap b)
62+traverseIntMapPatchWithKey f (PatchIntMap m) = PatchIntMap <$> IntMap.traverseWithKey (traverse . f) m
63+
64+-- | Extract all @a@s inserted/updated by the given @'PatchIntMap' a@.
65+patchIntMapNewElements :: PatchIntMap a -> [a]
66+patchIntMapNewElements (PatchIntMap m) = catMaybes $ IntMap.elems m
67+
68+-- | Convert the given @'PatchIntMap' a@ into an @'IntMap' a@ with all
69+-- the inserts/updates in the given patch.
70+patchIntMapNewElementsMap :: PatchIntMap a -> IntMap a
71+patchIntMapNewElementsMap (PatchIntMap m) = IntMap.mapMaybe id m
72+
73+-- | Subset the given @'IntMap' a@ to contain only the keys that would be
74+-- deleted by the given @'PatchIntMap' a@.
75+getDeletions :: PatchIntMap v -> IntMap v' -> IntMap v'
76+getDeletions (PatchIntMap m) v = IntMap.intersection v m
src/Data/Patch/Map.hsnew file+72
@@ -0,0 +1,72 @@
1+{-# LANGUAGE CPP #-}
2+{-# LANGUAGE DeriveTraversable #-}
3+{-# LANGUAGE FlexibleInstances #-}
4+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
5+{-# LANGUAGE LambdaCase #-}
6+{-# LANGUAGE MultiParamTypeClasses #-}
7+{-# LANGUAGE StandaloneDeriving #-}
8+{-# LANGUAGE TemplateHaskell #-}
9+{-# LANGUAGE TypeFamilies #-}
10+
11+-- | 'Patch'es on 'Map' that consist only of insertions (including overwrites)
12+-- and deletions
13+module Data.Patch.Map where
14+
15+import Data.Patch.Class
16+
17+import Control.Lens
18+import Data.Map (Map)
19+import qualified Data.Map as Map
20+import Data.Maybe
21+import Data.Monoid.DecidablyEmpty
22+import Data.Semigroup (Semigroup (..), stimesIdempotentMonoid)
23+
24+-- | A set of changes to a 'Map'. Any element may be inserted/updated or
25+-- deleted. Insertions are represented as values wrapped in 'Just', while
26+-- deletions are represented as 'Nothing's
27+newtype PatchMap k v = PatchMap { unPatchMap :: Map k (Maybe v) }
28+ deriving ( Show, Read, Eq, Ord
29+ , Foldable, Traversable
30+ , DecidablyEmpty
31+ )
32+
33+-- | 'fmap'ping a 'PatchMap' will alter all of the values it will insert.
34+-- Deletions are unaffected.
35+deriving instance Functor (PatchMap k)
36+-- | The empty 'PatchMap' contains no insertions or deletions
37+deriving instance Ord k => Monoid (PatchMap k v)
38+
39+-- | @a <> b@ will apply the changes of @b@ and then apply the changes of @a@.
40+-- If the same key is modified by both patches, the one on the left will take
41+-- precedence.
42+instance Ord k => Semigroup (PatchMap k v) where
43+ PatchMap a <> PatchMap b = PatchMap $ a `mappend` b --TODO: Add a semigroup instance for Map
44+ -- PatchMap is idempotent, so stimes n is id for every n
45+ stimes = stimesIdempotentMonoid
46+
47+-- | Apply the insertions or deletions to a given 'Map'.
48+instance Ord k => Patch (PatchMap k v) where
49+ type PatchTarget (PatchMap k v) = Map k v
50+ {-# INLINABLE apply #-}
51+ 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?
52+ where insertions = Map.mapMaybeWithKey (const id) p
53+ deletions = Map.mapMaybeWithKey (const nothingToJust) p
54+ nothingToJust = \case
55+ Nothing -> Just ()
56+ Just _ -> Nothing
57+
58+instance FunctorWithIndex k (PatchMap k)
59+instance FoldableWithIndex k (PatchMap k)
60+instance TraversableWithIndex k (PatchMap k) where
61+ itraverse = itraversed . Indexed
62+ itraversed = _Wrapped .> itraversed <. traversed
63+
64+-- | Returns all the new elements that will be added to the 'Map'
65+patchMapNewElements :: PatchMap k v -> [v]
66+patchMapNewElements (PatchMap p) = catMaybes $ Map.elems p
67+
68+-- | Returns all the new elements that will be added to the 'Map'
69+patchMapNewElementsMap :: PatchMap k v -> Map k v
70+patchMapNewElementsMap (PatchMap p) = Map.mapMaybe id p
71+
72+makeWrapped ''PatchMap
src/Data/Patch/MapWithMove.hsnew file+312
@@ -0,0 +1,312 @@
1+{-# LANGUAGE CPP #-}
2+{-# LANGUAGE DeriveTraversable #-}
3+{-# LANGUAGE FlexibleContexts #-}
4+{-# LANGUAGE FlexibleInstances #-}
5+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
6+{-# LANGUAGE LambdaCase #-}
7+{-# LANGUAGE MultiParamTypeClasses #-}
8+{-# LANGUAGE PatternGuards #-}
9+{-# LANGUAGE PatternSynonyms #-}
10+{-# LANGUAGE ScopedTypeVariables #-}
11+{-# LANGUAGE StandaloneDeriving #-}
12+{-# LANGUAGE TemplateHaskell #-}
13+{-# LANGUAGE TypeApplications #-}
14+{-# LANGUAGE TypeFamilies #-}
15+{-# LANGUAGE ViewPatterns #-}
16+
17+-- | 'Patch'es on 'Map' that can insert, delete, and move values from one key to
18+-- another
19+module Data.Patch.MapWithMove
20+ ( PatchMapWithMove
21+ ( PatchMapWithMove
22+ , unPatchMapWithMove
23+ , ..
24+ )
25+ , patchMapWithMove
26+ , patchMapWithMoveInsertAll
27+ , insertMapKey
28+ , moveMapKey
29+ , swapMapKey
30+ , deleteMapKey
31+ , unsafePatchMapWithMove
32+ , patchMapWithMoveNewElements
33+ , patchMapWithMoveNewElementsMap
34+ , patchThatSortsMapWith
35+ , patchThatChangesAndSortsMapWith
36+ , patchThatChangesMap
37+
38+ -- * Node Info
39+ , NodeInfo
40+ ( NodeInfo
41+ , _nodeInfo_to
42+ , _nodeInfo_from
43+ , ..
44+ )
45+ , bitraverseNodeInfo
46+ , nodeInfoMapFrom
47+ , nodeInfoMapMFrom
48+ , nodeInfoSetTo
49+
50+ -- * From
51+ , From
52+ ( From_Insert
53+ , From_Delete
54+ , From_Move
55+ , ..
56+ )
57+ , bitraverseFrom
58+
59+ -- * To
60+ , To
61+ ) where
62+
63+import Data.Coerce
64+import Data.Kind (Type)
65+import Data.Patch.Class
66+import Data.Patch.MapWithPatchingMove (PatchMapWithPatchingMove(..), To)
67+import qualified Data.Patch.MapWithPatchingMove as PM -- already a transparent synonym
68+
69+import Control.Lens
70+import Data.List
71+import Data.Map (Map)
72+import qualified Data.Map as Map
73+import Data.Proxy
74+#if !MIN_VERSION_base(4,11,0)
75+import Data.Semigroup (Semigroup (..))
76+#endif
77+import Data.Traversable (foldMapDefault)
78+
79+-- | Patch a Map with additions, deletions, and moves. Invariant: If key @k1@
80+-- is coming from @From_Move k2@, then key @k2@ should be going to @Just k1@,
81+-- and vice versa. There should never be any unpaired From/To keys.
82+newtype PatchMapWithMove k (v :: Type) = PatchMapWithMove'
83+ { -- | Extract the underlying 'PatchMapWithPatchingMove k (Proxy v)'
84+ unPatchMapWithMove' :: PatchMapWithPatchingMove k (Proxy v)
85+ }
86+ deriving ( Show, Read, Eq, Ord
87+-- Haddock cannot handle documentation here before GHC 8.6
88+ ,
89+#if __GLASGOW_HASKELL__ >= 806
90+ -- | Compose patches having the same effect as applying the
91+ -- patches in turn: @'applyAlways' (p <> q) == 'applyAlways' p .
92+ -- 'applyAlways' q@
93+#endif
94+ Semigroup
95+ , Monoid
96+ )
97+
98+pattern Coerce :: Coercible a b => a -> b
99+pattern Coerce x <- (coerce -> x)
100+ where Coerce x = coerce x
101+
102+{-# COMPLETE PatchMapWithMove #-}
103+pattern PatchMapWithMove :: Map k (NodeInfo k v) -> PatchMapWithMove k v
104+-- | Extract the representation of the 'PatchMapWithMove' as a map of
105+-- 'NodeInfo'.
106+unPatchMapWithMove :: PatchMapWithMove k v -> Map k (NodeInfo k v)
107+pattern PatchMapWithMove { unPatchMapWithMove } = PatchMapWithMove' (PatchMapWithPatchingMove (Coerce unPatchMapWithMove))
108+
109+_PatchMapWithMove
110+ :: Iso
111+ (PatchMapWithMove k0 v0)
112+ (PatchMapWithMove k1 v1)
113+ (Map k0 (NodeInfo k0 v0))
114+ (Map k1 (NodeInfo k1 v1))
115+_PatchMapWithMove = iso unPatchMapWithMove PatchMapWithMove
116+
117+instance Functor (PatchMapWithMove k) where
118+ fmap f = runIdentity . traverse (Identity . f)
119+
120+instance Foldable (PatchMapWithMove k) where
121+ foldMap = foldMapDefault
122+
123+instance Traversable (PatchMapWithMove k) where
124+ traverse =
125+ _PatchMapWithMove .
126+ traverse .
127+ traverse
128+
129+instance FunctorWithIndex k (PatchMapWithMove k)
130+instance FoldableWithIndex k (PatchMapWithMove k)
131+instance TraversableWithIndex k (PatchMapWithMove k) where
132+ itraverse = itraversed . Indexed
133+ itraversed =
134+ _PatchMapWithMove .>
135+ itraversed <.
136+ traverse
137+
138+-- | Create a 'PatchMapWithMove', validating it
139+patchMapWithMove :: Ord k => Map k (NodeInfo k v) -> Maybe (PatchMapWithMove k v)
140+patchMapWithMove = fmap PatchMapWithMove' . PM.patchMapWithPatchingMove . coerce
141+
142+-- | Create a 'PatchMapWithMove' that inserts everything in the given 'Map'
143+patchMapWithMoveInsertAll :: Map k v -> PatchMapWithMove k v
144+patchMapWithMoveInsertAll = PatchMapWithMove' . PM.patchMapWithPatchingMoveInsertAll
145+
146+-- | Make a @'PatchMapWithMove' k v@ which has the effect of inserting or updating a value @v@ to the given key @k@, like 'Map.insert'.
147+insertMapKey :: k -> v -> PatchMapWithMove k v
148+insertMapKey k v = PatchMapWithMove' $ PM.insertMapKey k v
149+
150+-- |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:
151+--
152+-- @
153+-- 'Map.delete' src (maybe map ('Map.insert' dst) (Map.lookup src map))
154+-- @
155+moveMapKey :: Ord k => k -> k -> PatchMapWithMove k v
156+moveMapKey src dst = PatchMapWithMove' $ PM.moveMapKey src dst
157+
158+-- |Make a @'PatchMapWithMove' k v@ which has the effect of swapping two keys in the mapping, equivalent to:
159+--
160+-- @
161+-- let aMay = Map.lookup a map
162+-- bMay = Map.lookup b map
163+-- in maybe id (Map.insert a) (bMay <> aMay)
164+-- . maybe id (Map.insert b) (aMay <> bMay)
165+-- . Map.delete a . Map.delete b $ map
166+-- @
167+swapMapKey :: Ord k => k -> k -> PatchMapWithMove k v
168+swapMapKey src dst = PatchMapWithMove' $ PM.swapMapKey src dst
169+
170+-- |Make a @'PatchMapWithMove' k v@ which has the effect of deleting a key in the mapping, equivalent to 'Map.delete'.
171+deleteMapKey :: k -> PatchMapWithMove k v
172+deleteMapKey = PatchMapWithMove' . PM.deleteMapKey
173+
174+-- | Wrap a @'Map' k (NodeInfo k v)@ representing patch changes into a @'PatchMapWithMove' k v@, without checking any invariants.
175+--
176+-- __Warning:__ when using this function, you must ensure that the invariants of 'PatchMapWithMove' are preserved; they will not be checked.
177+unsafePatchMapWithMove :: Map k (NodeInfo k v) -> PatchMapWithMove k v
178+unsafePatchMapWithMove = coerce PM.unsafePatchMapWithPatchingMove
179+
180+-- | Apply the insertions, deletions, and moves to a given 'Map'
181+instance Ord k => Patch (PatchMapWithMove k v) where
182+ type PatchTarget (PatchMapWithMove k v) = Map k v
183+ apply (PatchMapWithMove' p) = apply p
184+
185+-- | Returns all the new elements that will be added to the 'Map'.
186+patchMapWithMoveNewElements :: PatchMapWithMove k v -> [v]
187+patchMapWithMoveNewElements = PM.patchMapWithPatchingMoveNewElements . unPatchMapWithMove'
188+
189+-- | Return a @'Map' k v@ with all the inserts/updates from the given @'PatchMapWithMove' k v@.
190+patchMapWithMoveNewElementsMap :: PatchMapWithMove k v -> Map k v
191+patchMapWithMoveNewElementsMap = PM.patchMapWithPatchingMoveNewElementsMap . unPatchMapWithMove'
192+
193+-- | Create a 'PatchMapWithMove' that, if applied to the given 'Map', will sort
194+-- its values using the given ordering function. The set keys of the 'Map' is
195+-- not changed.
196+patchThatSortsMapWith :: Ord k => (v -> v -> Ordering) -> Map k v -> PatchMapWithMove k v
197+patchThatSortsMapWith cmp = PatchMapWithMove' . PM.patchThatSortsMapWith cmp
198+
199+-- | Create a 'PatchMapWithMove' that, if applied to the first 'Map' provided,
200+-- will produce a 'Map' with the same values as the second 'Map' but with the
201+-- values sorted with the given ordering function.
202+patchThatChangesAndSortsMapWith :: (Ord k, Ord v) => (v -> v -> Ordering) -> Map k v -> Map k v -> PatchMapWithMove k v
203+patchThatChangesAndSortsMapWith cmp oldByIndex newByIndexUnsorted = patchThatChangesMap oldByIndex newByIndex
204+ where newList = Map.toList newByIndexUnsorted
205+ newByIndex = Map.fromList $ zip (fst <$> newList) $ sortBy cmp $ snd <$> newList
206+
207+-- | Create a 'PatchMapWithMove' that, if applied to the first 'Map' provided,
208+-- will produce the second 'Map'.
209+patchThatChangesMap :: (Ord k, Ord v) => Map k v -> Map k v -> PatchMapWithMove k v
210+patchThatChangesMap oldByIndex newByIndex = PatchMapWithMove' $
211+ PM.patchThatChangesMap oldByIndex newByIndex
212+
213+--
214+-- NodeInfo
215+--
216+
217+-- | Holds the information about each key: where its new value should come from,
218+-- and where its old value should go to
219+newtype NodeInfo k (v :: Type) = NodeInfo' { unNodeInfo' :: PM.NodeInfo k (Proxy v) }
220+
221+deriving instance (Show k, Show p) => Show (NodeInfo k p)
222+deriving instance (Read k, Read p) => Read (NodeInfo k p)
223+deriving instance (Eq k, Eq p) => Eq (NodeInfo k p)
224+deriving instance (Ord k, Ord p) => Ord (NodeInfo k p)
225+
226+{-# COMPLETE NodeInfo #-}
227+pattern NodeInfo :: To k -> From k v -> NodeInfo k v
228+_nodeInfo_to :: NodeInfo k v -> To k
229+_nodeInfo_from :: NodeInfo k v -> From k v
230+pattern NodeInfo { _nodeInfo_to, _nodeInfo_from } = NodeInfo'
231+ PM.NodeInfo
232+ { PM._nodeInfo_to = _nodeInfo_to
233+ , PM._nodeInfo_from = Coerce _nodeInfo_from
234+ }
235+
236+_NodeInfo
237+ :: Iso
238+ (NodeInfo k0 v0)
239+ (NodeInfo k1 v1)
240+ (PM.NodeInfo k0 (Proxy v0))
241+ (PM.NodeInfo k1 (Proxy v1))
242+_NodeInfo = iso unNodeInfo' NodeInfo'
243+
244+instance Functor (NodeInfo k) where
245+ fmap f = runIdentity . traverse (Identity . f)
246+
247+instance Foldable (NodeInfo k) where
248+ foldMap = foldMapDefault
249+
250+instance Traversable (NodeInfo k) where
251+ traverse = bitraverseNodeInfo pure
252+
253+bitraverseNodeInfo
254+ :: Applicative f
255+ => (k0 -> f k1)
256+ -> (v0 -> f v1)
257+ -> NodeInfo k0 v0 -> f (NodeInfo k1 v1)
258+bitraverseNodeInfo fk fv = fmap NodeInfo'
259+ . PM.bitraverseNodeInfo fk (\ ~Proxy -> pure Proxy) fv
260+ . coerce
261+
262+-- | Change the 'From' value of a 'NodeInfo'
263+nodeInfoMapFrom :: (From k v -> From k v) -> NodeInfo k v -> NodeInfo k v
264+nodeInfoMapFrom f = coerce $ PM.nodeInfoMapFrom (unFrom' . f . From')
265+
266+-- | Change the 'From' value of a 'NodeInfo', using a 'Functor' (or
267+-- 'Applicative', 'Monad', etc.) action to get the new value
268+nodeInfoMapMFrom
269+ :: Functor f
270+ => (From k v -> f (From k v))
271+ -> NodeInfo k v -> f (NodeInfo k v)
272+nodeInfoMapMFrom f = fmap NodeInfo'
273+ . PM.nodeInfoMapMFrom (fmap unFrom' . f . From')
274+ . coerce
275+
276+-- | Set the 'To' field of a 'NodeInfo'
277+nodeInfoSetTo :: To k -> NodeInfo k v -> NodeInfo k v
278+nodeInfoSetTo = coerce . PM.nodeInfoSetTo
279+
280+--
281+-- From
282+--
283+
284+-- | Describe how a key's new value should be produced
285+newtype From k (v :: Type) = From' { unFrom' :: PM.From k (Proxy v) }
286+
287+{-# COMPLETE From_Insert, From_Delete, From_Move #-}
288+
289+-- | Insert the given value here
290+pattern From_Insert :: v -> From k v
291+pattern From_Insert v = From' (PM.From_Insert v)
292+
293+-- | Delete the existing value, if any, from here
294+pattern From_Delete :: From k v
295+pattern From_Delete = From' PM.From_Delete
296+
297+-- | Move the value here from the given key
298+pattern From_Move :: k -> From k v
299+pattern From_Move k = From' (PM.From_Move k Proxy)
300+
301+bitraverseFrom
302+ :: Applicative f
303+ => (k0 -> f k1)
304+ -> (v0 -> f v1)
305+ -> From k0 v0 -> f (From k1 v1)
306+bitraverseFrom fk fv = fmap From'
307+ . PM.bitraverseFrom fk (\ ~Proxy -> pure Proxy) fv
308+ . coerce
309+
310+makeWrapped ''PatchMapWithMove
311+makeWrapped ''NodeInfo
312+makeWrapped ''From
src/Data/Patch/MapWithPatchingMove.hsnew file+432
@@ -0,0 +1,432 @@
1+{-# LANGUAGE CPP #-}
2+{-# LANGUAGE GeneralizedNewtypeDeriving #-}
3+{-# LANGUAGE FlexibleContexts #-}
4+{-# LANGUAGE FlexibleInstances #-}
5+{-# LANGUAGE LambdaCase #-}
6+{-# LANGUAGE MultiParamTypeClasses #-}
7+{-# LANGUAGE PatternGuards #-}
8+{-# LANGUAGE ScopedTypeVariables #-}
9+{-# LANGUAGE StandaloneDeriving #-}
10+{-# LANGUAGE TemplateHaskell #-}
11+{-# LANGUAGE TypeFamilies #-}
12+{-# LANGUAGE UndecidableInstances #-}
13+
14+-- | 'Patch'es on 'Map' that can insert, delete, and move values from one key to
15+-- another
16+module Data.Patch.MapWithPatchingMove
17+ ( PatchMapWithPatchingMove (..)
18+ , patchMapWithPatchingMove
19+ , patchMapWithPatchingMoveInsertAll
20+ , insertMapKey
21+ , moveMapKey
22+ , swapMapKey
23+ , deleteMapKey
24+ , unsafePatchMapWithPatchingMove
25+ , patchMapWithPatchingMoveNewElements
26+ , patchMapWithPatchingMoveNewElementsMap
27+ , patchThatSortsMapWith
28+ , patchThatChangesAndSortsMapWith
29+ , patchThatChangesMap
30+
31+ -- * Node Info
32+ , NodeInfo (..)
33+ , bitraverseNodeInfo
34+ , nodeInfoMapFrom
35+ , nodeInfoMapMFrom
36+ , nodeInfoSetTo
37+
38+ -- * From
39+ , From(..)
40+ , bitraverseFrom
41+
42+ -- * To
43+ , To
44+
45+ -- TODO internals module
46+ , Fixup (..)
47+ ) where
48+
49+import Data.Patch.Class
50+
51+import Control.Lens hiding (from, to)
52+import Control.Lens.TH (makeWrapped)
53+import Data.Align (align)
54+import Data.Foldable (toList)
55+import Data.Function
56+import Data.List
57+import Data.Map (Map)
58+import qualified Data.Map as Map
59+import Data.Maybe
60+#if !MIN_VERSION_base(4,11,0)
61+import Data.Semigroup (Semigroup (..))
62+#endif
63+import Data.Monoid.DecidablyEmpty
64+import Data.Set (Set)
65+import qualified Data.Set as Set
66+import Data.These (These (..))
67+
68+-- | Patch a Map with additions, deletions, and moves. Invariant: If key @k1@
69+-- is coming from @From_Move k2@, then key @k2@ should be going to @Just k1@,
70+-- and vice versa. There should never be any unpaired From/To keys.
71+newtype PatchMapWithPatchingMove k p = PatchMapWithPatchingMove
72+ { -- | Extract the internal representation of the 'PatchMapWithPatchingMove'
73+ unPatchMapWithPatchingMove :: Map k (NodeInfo k p)
74+ }
75+
76+deriving instance (Show k, Show p, Show (PatchTarget p)) => Show (PatchMapWithPatchingMove k p)
77+deriving instance (Ord k, Read k, Read p, Read (PatchTarget p)) => Read (PatchMapWithPatchingMove k p)
78+deriving instance (Eq k, Eq p, Eq (PatchTarget p)) => Eq (PatchMapWithPatchingMove k p)
79+deriving instance (Ord k, Ord p, Ord (PatchTarget p)) => Ord (PatchMapWithPatchingMove k p)
80+
81+deriving instance ( Ord k
82+#if !MIN_VERSION_base(4,11,0)
83+ , Semigroup p
84+#endif
85+ , DecidablyEmpty p
86+ , Patch p
87+ ) => DecidablyEmpty (PatchMapWithPatchingMove k p)
88+
89+-- | Create a 'PatchMapWithPatchingMove', validating it
90+patchMapWithPatchingMove
91+ :: Ord k => Map k (NodeInfo k p) -> Maybe (PatchMapWithPatchingMove k p)
92+patchMapWithPatchingMove m = if valid then Just $ PatchMapWithPatchingMove m else Nothing
93+ where valid = forwardLinks == backwardLinks
94+ forwardLinks = Map.mapMaybe _nodeInfo_to m
95+ backwardLinks = Map.fromList $ catMaybes $ flip fmap (Map.toList m) $ \(to, p) ->
96+ case _nodeInfo_from p of
97+ From_Move from _ -> Just (from, to)
98+ _ -> Nothing
99+
100+-- | Create a 'PatchMapWithPatchingMove' that inserts everything in the given 'Map'
101+patchMapWithPatchingMoveInsertAll
102+ :: Map k (PatchTarget p) -> PatchMapWithPatchingMove k p
103+patchMapWithPatchingMoveInsertAll m = PatchMapWithPatchingMove $ flip fmap m $ \v -> NodeInfo
104+ { _nodeInfo_from = From_Insert v
105+ , _nodeInfo_to = Nothing
106+ }
107+
108+-- | Make a @'PatchMapWithPatchingMove' k p@ which has the effect of inserting or replacing a value @v@ at the given key @k@, like 'Map.insert'.
109+insertMapKey
110+ :: k -> PatchTarget p -> PatchMapWithPatchingMove k p
111+insertMapKey k v = PatchMapWithPatchingMove . Map.singleton k $ NodeInfo (From_Insert v) Nothing
112+
113+-- |Make a @'PatchMapWithPatchingMove' k p@ which has the effect of moving the value from the first key @k@ to the second key @k@, equivalent to:
114+--
115+-- @
116+-- 'Map.delete' src (maybe map ('Map.insert' dst) (Map.lookup src map))
117+-- @
118+moveMapKey
119+ :: ( DecidablyEmpty p
120+#if !MIN_VERSION_base(4,11,0)
121+ , Semigroup p
122+#endif
123+ , Patch p
124+ )
125+ => Ord k => k -> k -> PatchMapWithPatchingMove k p
126+moveMapKey src dst
127+ | src == dst = mempty
128+ | otherwise =
129+ PatchMapWithPatchingMove $ Map.fromList
130+ [ (dst, NodeInfo (From_Move src mempty) Nothing)
131+ , (src, NodeInfo From_Delete (Just dst))
132+ ]
133+
134+-- |Make a @'PatchMapWithPatchingMove' k p@ which has the effect of swapping two keys in the mapping, equivalent to:
135+--
136+-- @
137+-- let aMay = Map.lookup a map
138+-- bMay = Map.lookup b map
139+-- in maybe id (Map.insert a) (bMay <> aMay)
140+-- . maybe id (Map.insert b) (aMay <> bMay)
141+-- . Map.delete a . Map.delete b $ map
142+-- @
143+swapMapKey
144+ :: ( DecidablyEmpty p
145+#if !MIN_VERSION_base(4,11,0)
146+ , Semigroup p
147+#endif
148+ , Patch p
149+ )
150+ => Ord k => k -> k -> PatchMapWithPatchingMove k p
151+swapMapKey src dst
152+ | src == dst = mempty
153+ | otherwise =
154+ PatchMapWithPatchingMove $ Map.fromList
155+ [ (dst, NodeInfo (From_Move src mempty) (Just src))
156+ , (src, NodeInfo (From_Move dst mempty) (Just dst))
157+ ]
158+
159+-- | Make a @'PatchMapWithPatchingMove' k v@ which has the effect of deleting a key in
160+-- the mapping, equivalent to 'Map.delete'.
161+deleteMapKey
162+ :: k -> PatchMapWithPatchingMove k v
163+deleteMapKey k = PatchMapWithPatchingMove . Map.singleton k $ NodeInfo From_Delete Nothing
164+
165+-- | Wrap a @'Map' k (NodeInfo k v)@ representing patch changes into a @'PatchMapWithPatchingMove' k v@, without checking any invariants.
166+--
167+-- __Warning:__ when using this function, you must ensure that the invariants of 'PatchMapWithPatchingMove' are preserved; they will not be checked.
168+unsafePatchMapWithPatchingMove
169+ :: Map k (NodeInfo k p) -> PatchMapWithPatchingMove k p
170+unsafePatchMapWithPatchingMove = PatchMapWithPatchingMove
171+
172+-- | Apply the insertions, deletions, and moves to a given 'Map'
173+instance (Ord k, Patch p) => Patch (PatchMapWithPatchingMove k p) where
174+ type PatchTarget (PatchMapWithPatchingMove k p) = Map k (PatchTarget p)
175+ -- TODO: return Nothing sometimes
176+ -- Note: the strict application here is critical to ensuring that incremental
177+ -- merges don't hold onto all their prerequisite events forever; can we make
178+ -- this more robust?
179+ apply (PatchMapWithPatchingMove m) old = Just $! insertions `Map.union` (old `Map.difference` deletions)
180+ where insertions = flip Map.mapMaybeWithKey m $ \_ ni -> case _nodeInfo_from ni of
181+ From_Insert v -> Just v
182+ From_Move k p -> applyAlways p <$> Map.lookup k old
183+ From_Delete -> Nothing
184+ deletions = flip Map.mapMaybeWithKey m $ \_ ni -> case _nodeInfo_from ni of
185+ From_Delete -> Just ()
186+ _ -> Nothing
187+
188+-- | Returns all the new elements that will be added to the 'Map'
189+patchMapWithPatchingMoveNewElements
190+ :: PatchMapWithPatchingMove k p -> [PatchTarget p]
191+patchMapWithPatchingMoveNewElements = Map.elems . patchMapWithPatchingMoveNewElementsMap
192+
193+-- | Return a @'Map' k v@ with all the inserts/updates from the given @'PatchMapWithPatchingMove' k v@.
194+patchMapWithPatchingMoveNewElementsMap
195+ :: PatchMapWithPatchingMove k p -> Map k (PatchTarget p)
196+patchMapWithPatchingMoveNewElementsMap (PatchMapWithPatchingMove p) = Map.mapMaybe f p
197+ where f ni = case _nodeInfo_from ni of
198+ From_Insert v -> Just v
199+ From_Move _ _ -> Nothing
200+ From_Delete -> Nothing
201+
202+-- | Create a 'PatchMapWithPatchingMove' that, if applied to the given 'Map', will sort
203+-- its values using the given ordering function. The set keys of the 'Map' is
204+-- not changed.
205+patchThatSortsMapWith
206+ :: (Ord k, Monoid p)
207+ => (PatchTarget p -> PatchTarget p -> Ordering)
208+ -> Map k (PatchTarget p) -> PatchMapWithPatchingMove k p
209+patchThatSortsMapWith cmp m = PatchMapWithPatchingMove $ Map.fromList $ catMaybes $ zipWith g unsorted sorted
210+ where unsorted = Map.toList m
211+ sorted = sortBy (cmp `on` snd) unsorted
212+ f (to, _) (from, _) = if to == from then Nothing else
213+ Just (from, to)
214+ reverseMapping = Map.fromList $ catMaybes $ zipWith f unsorted sorted
215+ g (to, _) (from, _) = if to == from then Nothing else
216+ let Just movingTo = Map.lookup from reverseMapping
217+ in Just (to, NodeInfo (From_Move from mempty) $ Just movingTo)
218+
219+-- | Create a 'PatchMapWithPatchingMove' that, if applied to the first 'Map' provided,
220+-- will produce a 'Map' with the same values as the second 'Map' but with the
221+-- values sorted with the given ordering function.
222+patchThatChangesAndSortsMapWith
223+ :: forall k p. (Ord k, Ord (PatchTarget p), Monoid p)
224+ => (PatchTarget p -> PatchTarget p -> Ordering)
225+ -> Map k (PatchTarget p) -> Map k (PatchTarget p) -> PatchMapWithPatchingMove k p
226+patchThatChangesAndSortsMapWith cmp oldByIndex newByIndexUnsorted = patchThatChangesMap oldByIndex newByIndex
227+ where newList = Map.toList newByIndexUnsorted
228+ newByIndex = Map.fromList $ zip (fst <$> newList) $ sortBy cmp $ snd <$> newList
229+
230+-- | Create a 'PatchMapWithPatchingMove' that, if applied to the first 'Map' provided,
231+-- will produce the second 'Map'.
232+-- Note: this will never produce a patch on a value.
233+patchThatChangesMap
234+ :: forall k p
235+ . (Ord k, Ord (PatchTarget p), Monoid p)
236+ => Map k (PatchTarget p) -> Map k (PatchTarget p) -> PatchMapWithPatchingMove k p
237+patchThatChangesMap oldByIndex newByIndex = patch
238+ where invert :: Map k (PatchTarget p) -> Map (PatchTarget p) (Set k)
239+ invert = Map.fromListWith (<>) . fmap (\(k, v) -> (v, Set.singleton k)) . Map.toList
240+ -- In the places where we use unionDistinct, a non-distinct key indicates a bug in this function
241+ unionDistinct :: forall k' v'. Ord k' => Map k' v' -> Map k' v' -> Map k' v'
242+ unionDistinct = Map.unionWith (error "patchThatChangesMap: non-distinct keys")
243+ unionPairDistinct :: (Map k (From k v), Map k (To k)) -> (Map k (From k v), Map k (To k)) -> (Map k (From k v), Map k (To k))
244+ unionPairDistinct (oldFroms, oldTos) (newFroms, newTos) = (unionDistinct oldFroms newFroms, unionDistinct oldTos newTos)
245+ -- Generate patch info for a single value
246+ -- Keys that are found in both the old and new sets will not be patched
247+ -- Keys that are found in only the old set will be moved to a new position if any are available; otherwise they will be deleted
248+ -- Keys that are found in only the new set will be populated by moving an old key if any are available; otherwise they will be inserted
249+ patchSingleValue :: PatchTarget p -> Set k -> Set k -> (Map k (From k p), Map k (To k))
250+ patchSingleValue v oldKeys newKeys = foldl' unionPairDistinct mempty $ align (toList $ oldKeys `Set.difference` newKeys) (toList $ newKeys `Set.difference` oldKeys) <&> \case
251+ This oldK -> (mempty, Map.singleton oldK Nothing) -- There's nowhere for this value to go, so we know we are deleting it
252+ That newK -> (Map.singleton newK $ From_Insert v, mempty) -- There's nowhere fo this value to come from, so we know we are inserting it
253+ These oldK newK -> (Map.singleton newK $ From_Move oldK mempty, Map.singleton oldK $ Just newK)
254+ -- Run patchSingleValue on a These. Missing old or new sets are considered empty
255+ patchSingleValueThese :: PatchTarget p -> These (Set k) (Set k) -> (Map k (From k p), Map k (To k))
256+ patchSingleValueThese v = \case
257+ This oldKeys -> patchSingleValue v oldKeys mempty
258+ That newKeys -> patchSingleValue v mempty newKeys
259+ These oldKeys newKeys -> patchSingleValue v oldKeys newKeys
260+ -- Generate froms and tos for all values, then merge them together
261+ (froms, tos) = foldl' unionPairDistinct mempty $ Map.mapWithKey patchSingleValueThese $ align (invert oldByIndex) (invert newByIndex)
262+ patch = unsafePatchMapWithPatchingMove $ align froms tos <&> \case
263+ This from -> NodeInfo from Nothing -- Since we don't have a 'to' record for this key, that must mean it isn't being moved anywhere, so it should be deleted.
264+ That to -> NodeInfo From_Delete to -- Since we don't have a 'from' record for this key, it must be getting deleted
265+ These from to -> NodeInfo from to
266+
267+--
268+-- NodeInfo
269+--
270+
271+-- | Holds the information about each key: where its new value should come from,
272+-- and where its old value should go to
273+data NodeInfo k p = NodeInfo
274+ { _nodeInfo_from :: !(From k p)
275+ -- ^ Where do we get the new value for this key?
276+ , _nodeInfo_to :: !(To k)
277+ -- ^ If the old value is being kept (i.e. moved rather than deleted or
278+ -- replaced), where is it going?
279+ }
280+deriving instance (Show k, Show p, Show (PatchTarget p)) => Show (NodeInfo k p)
281+deriving instance (Read k, Read p, Read (PatchTarget p)) => Read (NodeInfo k p)
282+deriving instance (Eq k, Eq p, Eq (PatchTarget p)) => Eq (NodeInfo k p)
283+deriving instance (Ord k, Ord p, Ord (PatchTarget p)) => Ord (NodeInfo k p)
284+
285+-- | Traverse the 'NodeInfo' over the key, patch, and patch target. Because of
286+-- the type families here, this doesn't it any bi- or tri-traversal class.
287+bitraverseNodeInfo
288+ :: Applicative f
289+ => (k0 -> f k1)
290+ -> (p0 -> f p1)
291+ -> (PatchTarget p0 -> f (PatchTarget p1))
292+ -> NodeInfo k0 p0 -> f (NodeInfo k1 p1)
293+bitraverseNodeInfo fk fp fpt (NodeInfo from to) = NodeInfo
294+ <$> bitraverseFrom fk fp fpt from
295+ <*> traverse fk to
296+
297+-- | Change the 'From' value of a 'NodeInfo'
298+nodeInfoMapFrom
299+ :: (From k v -> From k v) -> NodeInfo k v -> NodeInfo k v
300+nodeInfoMapFrom f ni = ni { _nodeInfo_from = f $ _nodeInfo_from ni }
301+
302+-- | Change the 'From' value of a 'NodeInfo', using a 'Functor' (or
303+-- 'Applicative', 'Monad', etc.) action to get the new value
304+nodeInfoMapMFrom
305+ :: Functor f => (From k v -> f (From k v)) -> NodeInfo k v -> f (NodeInfo k v)
306+nodeInfoMapMFrom f ni = fmap (\result -> ni { _nodeInfo_from = result }) $ f $ _nodeInfo_from ni
307+
308+-- | Set the 'To' field of a 'NodeInfo'
309+nodeInfoSetTo
310+ :: To k -> NodeInfo k v -> NodeInfo k v
311+nodeInfoSetTo to ni = ni { _nodeInfo_to = to }
312+
313+--
314+-- From
315+--
316+
317+-- | Describe how a key's new value should be produced
318+data From k p
319+ = From_Insert (PatchTarget p) -- ^ Insert the given value here
320+ | From_Delete -- ^ Delete the existing value, if any, from here
321+ | From_Move !k !p -- ^ Move the value here from the given key, and apply the given patch
322+
323+deriving instance (Show k, Show p, Show (PatchTarget p)) => Show (From k p)
324+deriving instance (Read k, Read p, Read (PatchTarget p)) => Read (From k p)
325+deriving instance (Eq k, Eq p, Eq (PatchTarget p)) => Eq (From k p)
326+deriving instance (Ord k, Ord p, Ord (PatchTarget p)) => Ord (From k p)
327+
328+-- | Traverse the 'From' over the key, patch, and patch target. Because of
329+-- the type families here, this doesn't it any bi- or tri-traversal class.
330+bitraverseFrom
331+ :: Applicative f
332+ => (k0 -> f k1)
333+ -> (p0 -> f p1)
334+ -> (PatchTarget p0 -> f (PatchTarget p1))
335+ -> From k0 p0 -> f (From k1 p1)
336+bitraverseFrom fk fp fpt = \case
337+ From_Insert pt -> From_Insert <$> fpt pt
338+ From_Delete -> pure From_Delete
339+ From_Move k p -> From_Move <$> fk k <*> fp p
340+
341+--
342+-- To
343+--
344+
345+-- | Describe where a key's old value will go. If this is 'Just', that means
346+-- the key's old value will be moved to the given other key; if it is 'Nothing',
347+-- that means it will be deleted.
348+type To = Maybe
349+
350+--
351+-- Fixup
352+--
353+
354+-- | Helper data structure used for composing patches using the monoid instance.
355+data Fixup k v
356+ = Fixup_Delete
357+ | Fixup_Update (These (From k v) (To k))
358+
359+-- | Compose patches having the same effect as applying the patches in turn:
360+-- @'applyAlways' (p <> q) == 'applyAlways' p . 'applyAlways' q@
361+instance ( Ord k
362+#if !MIN_VERSION_base(4,11,0)
363+ , Semigroup p
364+#endif
365+ , DecidablyEmpty p
366+ , Patch p
367+ ) => Semigroup (PatchMapWithPatchingMove k p) where
368+ PatchMapWithPatchingMove ma <> PatchMapWithPatchingMove mb = PatchMapWithPatchingMove m
369+ where
370+ connections = Map.toList $ Map.intersectionWithKey (\_ a b -> (_nodeInfo_to a, _nodeInfo_from b)) ma mb
371+ h :: (k, (Maybe k, From k p)) -> [(k, Fixup k p)]
372+ h (_, (mToAfter, editBefore)) = case (mToAfter, editBefore) of
373+ (Just toAfter, From_Move fromBefore p)
374+ | fromBefore == toAfter && isEmpty p
375+ -> [(toAfter, Fixup_Delete)]
376+ | otherwise
377+ -> [ (toAfter, Fixup_Update (This editBefore))
378+ , (fromBefore, Fixup_Update (That mToAfter))
379+ ]
380+ (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
381+ (Just toAfter, _) -> [(toAfter, Fixup_Update (This editBefore))]
382+ (Nothing, _) -> []
383+ mergeFixups _ Fixup_Delete Fixup_Delete = Fixup_Delete
384+ mergeFixups _ (Fixup_Update a) (Fixup_Update b)
385+ | This x <- a, That y <- b
386+ = Fixup_Update $ These x y
387+ | That y <- a, This x <- b
388+ = Fixup_Update $ These x y
389+ mergeFixups _ _ _ = error "PatchMapWithPatchingMove: incompatible fixups"
390+ fixups = Map.fromListWithKey mergeFixups $ concatMap h connections
391+ combineNodeInfos _ nia nib = NodeInfo
392+ { _nodeInfo_from = _nodeInfo_from nia
393+ , _nodeInfo_to = _nodeInfo_to nib
394+ }
395+ applyFixup _ ni = \case
396+ Fixup_Delete -> Nothing
397+ Fixup_Update u -> Just $ NodeInfo
398+ { _nodeInfo_from = case _nodeInfo_from ni of
399+ f@(From_Move _ p') -> case getHere u of -- The `from` fixup comes from the "old" patch
400+ Nothing -> f -- If there's no `from` fixup, just use the "new" `from`
401+ Just (From_Insert v) -> From_Insert $ applyAlways p' v
402+ Just From_Delete -> From_Delete
403+ Just (From_Move oldKey p) -> From_Move oldKey $ p' <> p
404+ _ -> error "PatchMapWithPatchingMove: fixup for non-move From"
405+ , _nodeInfo_to = fromMaybe (_nodeInfo_to ni) $ getThere u
406+ }
407+ m = Map.differenceWithKey applyFixup (Map.unionWithKey combineNodeInfos ma mb) fixups
408+ getHere :: These a b -> Maybe a
409+ getHere = \case
410+ This a -> Just a
411+ These a _ -> Just a
412+ That _ -> Nothing
413+ getThere :: These a b -> Maybe b
414+ getThere = \case
415+ This _ -> Nothing
416+ These _ b -> Just b
417+ That b -> Just b
418+
419+--TODO: Figure out how to implement this in terms of PatchDMapWithPatchingMove rather than duplicating it here
420+-- | Compose patches having the same effect as applying the patches in turn:
421+-- @'applyAlways' (p <> q) == 'applyAlways' p . 'applyAlways' q@
422+instance ( Ord k
423+#if !MIN_VERSION_base(4,11,0)
424+ , Semigroup p
425+#endif
426+ , DecidablyEmpty p
427+ , Patch p
428+ ) => Monoid (PatchMapWithPatchingMove k p) where
429+ mempty = PatchMapWithPatchingMove mempty
430+ mappend = (<>)
431+
432+makeWrapped ''PatchMapWithPatchingMove
src/Data/Semigroup/Additive.hsnew file+54
@@ -0,0 +1,54 @@
1+{-# LANGUAGE CPP #-}
2+{-# LANGUAGE TypeOperators #-}
3+{-# LANGUAGE TypeFamilies #-}
4+-- |
5+-- Module:
6+-- Data.Semigroup.Additive
7+-- Description:
8+-- This module defines a class for commutative semigroups, until it is moved
9+-- to another library.
10+module Data.Semigroup.Additive
11+ ( Additive
12+ ) where
13+
14+import Data.Functor.Const (Const (..))
15+import Data.Functor.Identity
16+import Data.Proxy
17+#if !MIN_VERSION_base(4,12,0)
18+-- for :*: and :.: semigroup instances
19+import Data.Orphans ()
20+#endif
21+#if !MIN_VERSION_base(4,11,0)
22+import Data.Semigroup (Semigroup (..))
23+#endif
24+import GHC.Generics
25+
26+-- | An 'Additive' 'Semigroup' is one where (<>) is commutative
27+class Semigroup q => Additive q where
28+
29+-- | Trivial additive semigroup.
30+instance Additive ()
31+
32+-- | Product additive semigroup.
33+-- A Pair of additive semigroups gives rise to a additive semigroup
34+instance (Additive a, Additive b) => Additive (a, b)
35+
36+-- See https://gitlab.haskell.org/ghc/ghc/issues/11135#note_111802 for the reason Compose is not also provided.
37+-- Base does not define Monoid (Compose f g a) so this is the best we can
38+-- really do for functor composition.
39+instance Additive (f (g a)) => Additive ((f :.: g) a)
40+
41+-- | Product of additive semigroups, Functor style.
42+instance (Additive (f a), Additive (g a)) => Additive ((f :*: g) a)
43+
44+-- | Trivial additive semigroup, Functor style
45+instance Additive (Proxy x)
46+
47+-- | Const lifts additive semigroups into a functor.
48+instance Additive a => Additive (Const a x)
49+
50+-- | Identity lifts additive semigroups pointwise (at only one point)
51+instance Additive a => Additive (Identity a)
52+
53+-- | Functions lift additive semigroups pointwise.
54+instance Additive b => Additive (a -> b)
src/Data/WeakBag.hsdeleted−120
@@ -1,120 +0,0 @@
1−-- | This module defines the 'WeakBag' type, which represents a mutable
2−-- collection of items that does not cause the items to be retained in memory.
3−-- This is useful for situations where a value needs to be inspected or modified
4−-- if it is still alive, but can be ignored if it is dead.
5−module Data.WeakBag
6− ( WeakBag
7− , WeakBagTicket
8− , empty
9− , singleton
10− , insert
11− , traverse
12− , remove
13− ) where
14−
15−import Control.Concurrent.STM
16−import Control.Exception
17−import Control.Monad hiding (forM_, mapM_)
18−import Control.Monad.IO.Class
19−import Data.Foldable (forM_, mapM_)
20−import Data.IntMap.Strict (IntMap)
21−import qualified Data.IntMap.Strict as IntMap
22−import Data.IORef
23−import System.Mem.Weak
24−
25−import Prelude hiding (mapM_, traverse)
26−
27−-- | A @WeakBag a@ holds a set of values of type @a@, but does not retain them -
28−-- that is, they can still be garbage-collected. As long as the @a@s remain
29−-- alive, the 'WeakBag' will continue to refer to them.
30−data WeakBag a = WeakBag
31− { _weakBag_nextId :: {-# UNPACK #-} !(TVar Int) --TODO: what if this wraps around?
32− , _weakBag_children :: {-# UNPACK #-} !(TVar (IntMap (Weak a)))
33− }
34−
35−-- | When inserting an item into a 'WeakBag', a 'WeakBagTicket' is returned. If
36−-- the caller retains the ticket, the item is guranteed to stay in memory (and
37−-- thus in the 'WeakBag'). The ticket can also be used to remove the item from
38−-- the 'WeakBag' prematurely (i.e. while it is still alive), using 'remove'.
39−data WeakBagTicket a = WeakBagTicket
40− { _weakBagTicket_weakItem :: {-# UNPACK #-} !(Weak a)
41− , _weakBagTicket_item :: {-# NOUNPACK #-} !a
42− }
43−
44−-- | Insert an item into a 'WeakBag'.
45−{-# INLINE insert #-}
46−insert :: a -- ^ The item
47− -> WeakBag a -- ^ The 'WeakBag' to insert into
48− -> IORef (Weak b) -- ^ An arbitrary value to be used in the following
49− -- callback
50− -> (b -> IO ()) -- ^ A callback to be invoked when the item is removed
51− -- (whether automatically by the item being garbage
52− -- collected or manually via 'remove')
53− -> IO (WeakBagTicket a) -- ^ Returns a 'WeakBagTicket' that ensures the
54− -- item is retained and allows the item to be
55− -- removed.
56−insert a (WeakBag nextId children) wbRef finalizer = {-# SCC "insert" #-} do
57− a' <- evaluate a
58− wbRef' <- evaluate wbRef
59− myId <- atomically $ do
60− myId <- readTVar nextId
61− writeTVar nextId $! succ myId
62− return myId
63− let cleanup = do
64− wb <- readIORef wbRef'
65− mb <- deRefWeak wb
66− forM_ mb $ \b -> do
67− isLastNode <- atomically $ do --TODO: Should this run even when mb is Nothing?
68− cs <- readTVar children
69− let csWithoutMe = IntMap.delete myId cs
70− writeTVar children $! csWithoutMe
71− return $ IntMap.size csWithoutMe == 0
72− when isLastNode $ finalizer b
73− return ()
74− return ()
75− wa <- mkWeakPtr a' $ Just cleanup
76− atomically $ modifyTVar' children $ IntMap.insert myId wa
77− return $ WeakBagTicket
78− { _weakBagTicket_weakItem = wa
79− , _weakBagTicket_item = a'
80− }
81−
82−-- | Create an empty 'WeakBag'.
83−{-# INLINE empty #-}
84−empty :: IO (WeakBag a)
85−empty = {-# SCC "empty" #-} do
86− nextId <- newTVarIO 1
87− children <- newTVarIO IntMap.empty
88− let bag = WeakBag
89− { _weakBag_nextId = nextId
90− , _weakBag_children = children
91− }
92− return bag
93−
94−-- | Create a 'WeakBag' with one item; equivalent to creating the 'WeakBag' with
95−-- 'empty', then using 'insert'.
96−{-# INLINE singleton #-}
97−singleton :: a -> IORef (Weak b) -> (b -> IO ()) -> IO (WeakBag a, WeakBagTicket a)
98−singleton a wbRef finalizer = {-# SCC "singleton" #-} do
99− bag <- empty
100− ticket <- insert a bag wbRef finalizer
101− return (bag, ticket)
102−
103−{-# INLINE traverse #-}
104−-- | Visit every node in the given list. If new nodes are appended during the
105−-- traversal, they will not be visited. Every live node that was in the list
106−-- when the traversal began will be visited exactly once; however, no guarantee
107−-- is made about the order of the traversal.
108−traverse :: MonadIO m => WeakBag a -> (a -> m ()) -> m ()
109−traverse (WeakBag _ children) f = {-# SCC "traverse" #-} do
110− cs <- liftIO $ readTVarIO children
111− forM_ cs $ \c -> do
112− ma <- liftIO $ deRefWeak c
113− mapM_ f ma
114−
115−-- | Remove an item from the 'WeakBag'; does nothing if invoked multiple times
116−-- on the same 'WeakBagTicket'.
117−{-# INLINE remove #-}
118−remove :: WeakBagTicket a -> IO ()
119−remove = {-# SCC "remove" #-} finalize . _weakBagTicket_weakItem
120−--TODO: Should 'remove' also drop the reference to the item?
src/Reflex.hsdeleted−9
@@ -1,9 +0,0 @@
1−-- | This module exports all of the commonly-used functionality of Reflex; if
2−-- you are just getting started with Reflex, this is probably what you want.
3−module Reflex (module X) where
4−
5−import Reflex.Class as X
6−import Reflex.Dynamic as X
7−import Reflex.Dynamic.TH as X
8−import Reflex.Dynamic.Uniq as X
9−import Reflex.Spider as X
src/Reflex/Class.hsdeleted−780
@@ -1,780 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−{-# LANGUAGE FlexibleContexts #-}
3−{-# LANGUAGE FlexibleInstances #-}
4−{-# LANGUAGE FunctionalDependencies #-}
5−{-# LANGUAGE GADTs #-}
6−{-# LANGUAGE LambdaCase #-}
7−{-# LANGUAGE MultiParamTypeClasses #-}
8−{-# LANGUAGE NoMonomorphismRestriction #-}
9−{-# LANGUAGE RankNTypes #-}
10−{-# LANGUAGE RecursiveDo #-}
11−{-# LANGUAGE ScopedTypeVariables #-}
12−{-# LANGUAGE TypeFamilies #-}
13−{-# LANGUAGE TypeOperators #-}
14−{-# LANGUAGE UndecidableInstances #-}
15−
16−-- | This module contains the Reflex interface, as well as a variety of
17−-- convenience functions for working with 'Event's, 'Behavior's, and other
18−-- signals.
19−module Reflex.Class
20− ( -- * Primitives
21− Reflex (..)
22− , MonadSample (..)
23− , MonadHold (..)
24− -- ** 'fan'-related types
25− , EventSelector (..)
26− -- ** 'Incremental'-related types
27− , Patch (..)
28− , PatchDMap (..)
29− -- * Convenience functions
30− , constDyn
31− , pushAlways
32− -- ** Combining 'Event's
33− , leftmost
34− , mergeMap
35− , mergeList
36− , mergeWith
37− -- ** Breaking up 'Event's
38− , splitE
39− , fanMap
40− , dmapToThese
41− , EitherTag (..)
42− , eitherToDSum
43− , dsumToEither
44− -- ** Switching between 'Event's
45− , switchPromptly
46− -- ** Using 'Event's to sample 'Behavior's
47− , tag
48− , attach
49− , attachWith
50− , attachWithMaybe
51− -- ** Blocking an 'Event' based on a 'Behavior'
52− , gate
53− -- ** Combining 'Dynamic's
54− , distributeDMapOverDynPure
55− , zipDyn
56− , zipDynWith
57− -- ** Accumulating state
58− , Accumulator (..)
59− , mapAccum_
60− , mapAccumM_
61− , mapAccumMaybe_
62− , mapAccumMaybeM_
63− , zipListWithEvent
64− , headE
65− , tailE
66− , switcher
67− -- * Debugging functions
68− , traceEvent
69− , traceEventWith
70− -- * Unsafe functions
71− , unsafeDynamic
72− -- * 'FunctorMaybe'
73− , FunctorMaybe (..)
74− , fforMaybe
75− , ffilter
76− -- * Miscellaneous convenience functions
77− , ffor
78− -- * Deprecated functions
79− , appendEvents
80− , onceE
81− , sequenceThese
82− ) where
83−
84−import Control.Applicative
85−import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
86−import Control.Monad.Reader hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
87−import Control.Monad.State.Strict hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
88−import Control.Monad.Trans.Cont (ContT ())
89−import Control.Monad.Trans.Except (ExceptT ())
90−import Control.Monad.Trans.RWS (RWST ())
91−import Control.Monad.Trans.Writer (WriterT ())
92−import Data.Align
93−import Data.Bifunctor
94−import Data.Dependent.Map (DMap, DSum (..), GCompare (..), GOrdering (..))
95−import qualified Data.Dependent.Map as DMap
96−import Data.Dependent.Sum (ShowTag (..))
97−import Data.Foldable
98−import Data.Functor.Bind hiding (join)
99−import qualified Data.Functor.Bind as Bind
100−import Data.Functor.Compose
101−import Data.Functor.Constant
102−import Data.Functor.Misc
103−import Data.Functor.Plus
104−import Data.GADT.Compare ((:~:) (..), GEq (..))
105−import Data.GADT.Show (GShow (..))
106−import Data.List.NonEmpty (NonEmpty (..))
107−import Data.Map (Map)
108−import Data.Maybe
109−import Data.Monoid hiding (Alt, (<>))
110−import Data.Semigroup (Semigroup, sconcat, stimes, stimesIdempotentMonoid, (<>))
111−import Data.String
112−import Data.These
113−import Data.Traversable
114−
115−-- Note: must come last to silence warnings due to AMP on GHC < 7.10
116−import Prelude hiding (foldl, mapM, mapM_, sequence, sequence_)
117−
118−import Debug.Trace (trace)
119−
120−-- | The 'Reflex' class contains all the primitive functionality needed for
121−-- Functional Reactive Programming (FRP). The @t@ type parameter indicates
122−-- which "timeline" is in use. Timelines are fully-independent FRP contexts,
123−-- and the type of the timeline determines the FRP engine to be used. For most
124−-- purposes, the 'Reflex.Spider' implementation is recommended.
125−class ( MonadHold t (PushM t)
126− , MonadSample t (PullM t)
127− , MonadFix (PushM t)
128− , Functor (Event t)
129− , Functor (Behavior t)
130− , Functor (Dynamic t)
131− , Applicative (Dynamic t) -- Necessary for GHC <= 7.8
132− , Monad (Dynamic t)
133− ) => Reflex t where
134− -- | A container for a value that can change over time. 'Behavior's can be
135− -- sampled at will, but it is not possible to be notified when they change
136− data Behavior t :: * -> *
137− -- | A stream of occurrences. During any given frame, an 'Event' is either
138− -- occurring or not occurring; if it is occurring, it will contain a value of
139− -- the given type (its "occurrence type")
140− data Event t :: * -> *
141− -- | A container for a value that can change over time and allows
142− -- notifications on changes. Basically a combination of a 'Behavior' and an
143− -- 'Event', with a rule that the 'Behavior' will change if and only if the
144− -- 'Event' fires.
145− data Dynamic t :: * -> *
146− -- | A container for a value that can change over time and allows
147− -- notifications on changes. Basically a combination of a 'Behavior' and an
148− -- 'Event', with a rule that the 'Behavior' will change if and only if the
149− -- 'Event' fires.
150− data Incremental t :: (* -> *) -> * -> *
151− -- | An 'Event' with no occurrences
152− never :: Event t a
153− -- | Create a 'Behavior' that always has the given value
154− constant :: a -> Behavior t a --TODO: Refactor to use 'pure' from Applicative instead; however, we need to make sure that encouraging Applicative-style use of 'Behavior's doesn't have a negative performance impact
155− -- | Create an 'Event' from another 'Event'; the provided function can sample
156− -- 'Behavior's and hold 'Event's, and use the results to produce a occurring
157− -- (Just) or non-occurring (Nothing) result
158− push :: (a -> PushM t (Maybe b)) -> Event t a -> Event t b
159− -- | A monad for doing complex push-based calculations efficiently
160− type PushM t :: * -> *
161− -- | Create a 'Behavior' by reading from other 'Behavior's; the result will be
162− -- recomputed whenever any of the read 'Behavior's changes
163− pull :: PullM t a -> Behavior t a
164− -- | A monad for doing complex pull-based calculations efficiently
165− type PullM t :: * -> *
166− -- | Merge a collection of events; the resulting 'Event' will only occur if at
167− -- least one input event is occuring, and will contain all of the input keys
168− -- that are occurring simultaneously
169− merge :: GCompare k => DMap k (Event t) -> Event t (DMap k Identity) --TODO: Generalize to get rid of DMap use --TODO: Provide a type-level guarantee that the result is not empty
170− -- | Efficiently fan-out an event to many destinations. This function should
171− -- be partially applied, and then the result applied repeatedly to create
172− -- child events
173− fan :: GCompare k => Event t (DMap k Identity) -> EventSelector t k --TODO: Can we help enforce the partial application discipline here? The combinator is worthless without it
174− -- | Create an 'Event' that will occur whenever the currently-selected input
175− -- 'Event' occurs
176− switch :: Behavior t (Event t a) -> Event t a
177− -- | Create an 'Event' that will occur whenever the input event is occurring
178− -- and its occurrence value, another 'Event', is also occurring
179− coincidence :: Event t (Event t a) -> Event t a
180− -- | Extract the 'Behavior' of a 'Dynamic'.
181− current :: Dynamic t a -> Behavior t a
182− -- | Extract the 'Event' of the 'Dynamic'.
183− updated :: Dynamic t a -> Event t a
184− -- | Create a new 'Dynamic'. The given 'PullM' must always return the most
185− -- recent firing of the given 'Event', if any.
186− unsafeBuildDynamic :: PullM t a -> Event t a -> Dynamic t a
187− -- | Create a new 'Incremental'. The given 'PullM''s value must always change
188− -- in the same way that the accumulated application of patches would change
189− -- that value.
190− unsafeBuildIncremental :: Patch p => PullM t a -> Event t (p a) -> Incremental t p a
191− -- | Create a merge whose parents can change over time
192− mergeIncremental :: GCompare k => Incremental t PatchDMap (DMap k (Event t)) -> Event t (DMap k Identity)
193− -- | Extract the 'Behavior' component of an 'Incremental'
194− currentIncremental :: Patch p => Incremental t p a -> Behavior t a
195− -- | Extract the 'Event' component of an 'Incremental'
196− updatedIncremental :: Patch p => Incremental t p a -> Event t (p a)
197− -- | Convert an 'Incremental' to a 'Dynamic'
198− incrementalToDynamic :: Patch p => Incremental t p a -> Dynamic t a
199−
200−-- | A 'Patch' type represents a kind of change made to a datastructure.
201−class Patch p where
202− -- | Apply the patch @p a@ to the value @a@. If no change is needed, return
203− -- 'Nothing'.
204− apply :: p a -> a -> Maybe a
205−
206−instance Patch Identity where
207− apply (Identity a) _ = Just a
208−
209−-- | A set of changes to a 'DMap'. Only DMap types are allowed for @a@.
210−data PatchDMap a where
211− PatchDMap :: GCompare k => DMap k (Compose Maybe v) -> PatchDMap (DMap k v)
212−
213−instance GCompare k => Semigroup (PatchDMap (DMap k v)) where
214− PatchDMap a <> PatchDMap b = PatchDMap $ a `mappend` b --TODO: Add a semigroup instance for DMap
215− -- PatchDMap is idempotent, so stimes n is id for every n
216−#if MIN_VERSION_semigroups(0,17,0)
217− stimes = stimesIdempotentMonoid
218−#else
219− times1p n x = case compare n 0 of
220− LT -> error "stimesIdempotentMonoid: negative multiplier"
221− EQ -> mempty
222− GT -> x
223−#endif
224−
225−instance GCompare k => Monoid (PatchDMap (DMap k v)) where
226− mempty = PatchDMap mempty
227− mappend = (<>)
228−
229−instance Patch PatchDMap where
230− 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?
231− where insertions = DMap.mapMaybeWithKey (const $ getCompose) diff
232− deletions = DMap.mapMaybeWithKey (const $ nothingToJust . getCompose) diff
233− nothingToJust = \case
234− Nothing -> Just $ Constant ()
235− Just _ -> Nothing
236−
237−-- | Construct a 'Dynamic' from a 'Behavior' and an 'Event'. The 'Behavior'
238−-- _must_ change when and only when the 'Event' fires, such that the
239−-- 'Behavior''s value is always equal to the most recent firing of the 'Event';
240−-- if this is not the case, the resulting 'Dynamic' will behave
241−-- nondeterministically.
242−unsafeDynamic :: Reflex t => Behavior t a -> Event t a -> Dynamic t a
243−unsafeDynamic = unsafeBuildDynamic . sample
244−
245−-- | Construct a 'Dynamic' value that never changes
246−constDyn :: Reflex t => a -> Dynamic t a
247−constDyn = pure
248−
249−-- | 'MonadSample' designates monads that can read the current value of a
250−-- 'Behavior'. This includes both 'PullM' and 'PushM'.
251−class (Applicative m, Monad m) => MonadSample t m | m -> t where
252− -- | Get the current value in the 'Behavior'
253− sample :: Behavior t a -> m a
254−
255−-- | 'MonadHold' designates monads that can create new 'Behavior's based on
256−-- 'Event's; usually this will be 'PushM' or a monad based on it. 'MonadHold'
257−-- is required to create any stateful computations with Reflex.
258−class MonadSample t m => MonadHold t m where
259− -- | Create a new 'Behavior' whose value will initially be equal to the given
260− -- value and will be updated whenever the given 'Event' occurs. The update
261− -- takes effect immediately after the 'Event' occurs; if the occurrence that
262− -- sets the 'Behavior' (or one that is simultaneous with it) is used to sample
263− -- the 'Behavior', it will see the _old_ value of the 'Behavior', not the new
264− -- one.
265− hold :: a -> Event t a -> m (Behavior t a)
266− -- | Create a 'Dynamic' value using the given initial value that changes every
267− -- time the 'Event' occurs.
268− holdDyn :: a -> Event t a -> m (Dynamic t a)
269− -- | Create an 'Incremental' value using the given initial value that changes
270− -- every time the 'Event' occurs.
271− holdIncremental :: Patch p => a -> Event t (p a) -> m (Incremental t p a)
272−
273−-- | An 'EventSelector' allows you to efficiently 'select' an 'Event' based on a
274−-- key. This is much more efficient than filtering for each key with
275−-- 'fmapMaybe'.
276−newtype EventSelector t k = EventSelector
277− { -- | Retrieve the 'Event' for the given key. The type of the 'Event' is
278− -- determined by the type of the key, so this can be used to fan-out
279− -- 'Event's whose sub-'Event's have different types.
280− --
281− -- Using 'EventSelector's and the 'fan' primitive is far more efficient than
282− -- (but equivalent to) using 'fmapMaybe' to select only the relevant
283− -- occurrences of an 'Event'.
284− select :: forall a. k a -> Event t a
285− }
286−
287−--------------------------------------------------------------------------------
288−-- Instances
289−--------------------------------------------------------------------------------
290−
291−instance MonadSample t m => MonadSample t (ReaderT r m) where
292− sample = lift . sample
293−
294−instance MonadHold t m => MonadHold t (ReaderT r m) where
295− hold a0 = lift . hold a0
296− holdDyn a0 = lift . holdDyn a0
297− holdIncremental a0 = lift . holdIncremental a0
298−
299−instance (MonadSample t m, Monoid r) => MonadSample t (WriterT r m) where
300− sample = lift . sample
301−
302−instance (MonadHold t m, Monoid r) => MonadHold t (WriterT r m) where
303− hold a0 = lift . hold a0
304− holdDyn a0 = lift . holdDyn a0
305− holdIncremental a0 = lift . holdIncremental a0
306−
307−instance MonadSample t m => MonadSample t (StateT s m) where
308− sample = lift . sample
309−
310−instance MonadHold t m => MonadHold t (StateT s m) where
311− hold a0 = lift . hold a0
312− holdDyn a0 = lift . holdDyn a0
313− holdIncremental a0 = lift . holdIncremental a0
314−
315−instance MonadSample t m => MonadSample t (ExceptT e m) where
316− sample = lift . sample
317−
318−instance MonadHold t m => MonadHold t (ExceptT e m) where
319− hold a0 = lift . hold a0
320− holdDyn a0 = lift . holdDyn a0
321− holdIncremental a0 = lift . holdIncremental a0
322−
323−instance (MonadSample t m, Monoid w) => MonadSample t (RWST r w s m) where
324− sample = lift . sample
325−
326−instance (MonadHold t m, Monoid w) => MonadHold t (RWST r w s m) where
327− hold a0 = lift . hold a0
328− holdDyn a0 = lift . holdDyn a0
329− holdIncremental a0 = lift . holdIncremental a0
330−
331−instance MonadSample t m => MonadSample t (ContT r m) where
332− sample = lift . sample
333−
334−instance MonadHold t m => MonadHold t (ContT r m) where
335− hold a0 = lift . hold a0
336− holdDyn a0 = lift . holdDyn a0
337− holdIncremental a0 = lift . holdIncremental a0
338−
339−--------------------------------------------------------------------------------
340−-- Convenience functions
341−--------------------------------------------------------------------------------
342−
343−-- | Create an 'Event' from another 'Event'. The provided function can sample
344−-- 'Behavior's and hold 'Event's.
345−pushAlways :: Reflex t => (a -> PushM t b) -> Event t a -> Event t b
346−pushAlways f = push (fmap Just . f)
347−
348−-- | Flipped version of 'fmap'.
349−ffor :: Functor f => f a -> (a -> b) -> f b
350−ffor = flip fmap
351−
352−instance Reflex t => Applicative (Behavior t) where
353− pure = constant
354− f <*> x = pull $ sample f `ap` sample x
355− _ *> b = b
356− a <* _ = a
357−
358−instance Reflex t => Apply (Behavior t) where
359− (<.>) = (<*>)
360−
361−instance Reflex t => Bind (Behavior t) where
362− (>>-) = (>>=)
363−
364−instance (Reflex t, Fractional a) => Fractional (Behavior t a) where
365− (/) = liftA2 (/)
366− fromRational = pure . fromRational
367− recip = fmap recip
368−
369−instance Reflex t => Functor (Behavior t) where
370− fmap f = pull . fmap f . sample
371−
372−instance (Reflex t, IsString a) => IsString (Behavior t a) where
373− fromString = pure . fromString
374−
375−instance Reflex t => Monad (Behavior t) where
376− a >>= f = pull $ sample a >>= sample . f
377− -- 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.
378− return = constant
379− fail = error "Monad (Behavior t) does not support fail"
380−
381−instance (Reflex t, Monoid a) => Monoid (Behavior t a) where
382− mempty = constant mempty
383− mappend a b = pull $ liftM2 mappend (sample a) (sample b)
384− mconcat = pull . fmap mconcat . mapM sample
385−
386−instance (Reflex t, Num a) => Num (Behavior t a) where
387− (+) = liftA2 (+)
388− (-) = liftA2 (-)
389− (*) = liftA2 (*)
390− abs = fmap abs
391− fromInteger = pure . fromInteger
392− negate = fmap negate
393− signum = fmap signum
394−
395−instance (Reflex t, Semigroup a) => Semigroup (Behavior t a) where
396− a <> b = pull $ liftM2 (<>) (sample a) (sample b)
397− sconcat = pull . fmap sconcat . mapM sample
398−#if MIN_VERSION_semigroups(0,17,0)
399− stimes n = fmap $ stimes n
400−#else
401− times1p n = fmap $ times1p n
402−#endif
403−
404−--TODO: See if there's a better class in the standard libraries already
405−-- | A class for values that combines filtering and mapping using 'Maybe'.
406−class FunctorMaybe f where
407− -- | Combined mapping and filtering function.
408− fmapMaybe :: (a -> Maybe b) -> f a -> f b
409−
410−instance FunctorMaybe [] where
411− fmapMaybe f = catMaybes . fmap f
412−
413−-- | Flipped version of 'fmapMaybe'.
414−fforMaybe :: FunctorMaybe f => f a -> (a -> Maybe b) -> f b
415−fforMaybe = flip fmapMaybe
416−
417−-- | Filter 'f a' using the provided predicate.
418−-- Relies on 'fforMaybe'.
419−ffilter :: FunctorMaybe f => (a -> Bool) -> f a -> f a
420−ffilter f = fmapMaybe $ \x -> if f x then Just x else Nothing
421−
422−-- | Left-biased event union (prefers left event on simultaneous
423−-- occurrence).
424−instance Reflex t => Alt (Event t) where
425− ev1 <!> ev2 = leftmost [ev1, ev2]
426−
427−-- | 'Event' intersection (convenient interface to 'coincidence').
428−instance Reflex t => Apply (Event t) where
429− evf <.> evx = coincidence (fmap (<$> evx) evf)
430−
431−-- | 'Event' intersection (convenient interface to 'coincidence').
432−instance Reflex t => Bind (Event t) where
433− evx >>- f = coincidence (f <$> evx)
434− join = coincidence
435−
436−instance Reflex t => Functor (Event t) where
437− fmap f = fmapMaybe $ Just . f
438−
439−instance Reflex t => FunctorMaybe (Event t) where
440− fmapMaybe f = push $ return . f
441−
442−-- | Never: @'zero' = 'never'@.
443−instance Reflex t => Plus (Event t) where
444− zero = never
445−
446−-- | Replace each occurrence value of the 'Event' with the value of the
447−-- 'Behavior' at the time of that occurrence.
448−tag :: Reflex t => Behavior t b -> Event t a -> Event t b
449−tag b = pushAlways $ \_ -> sample b
450−
451−-- | Create a new 'Event' that combines occurences of supplied 'Event' with the
452−-- current value of the 'Behavior'.
453−attach :: Reflex t => Behavior t a -> Event t b -> Event t (a, b)
454−attach = attachWith (,)
455−
456−-- | Create a new 'Event' that occurs when the supplied 'Event' occurs by
457−-- combining it with the current value of the 'Behavior'.
458−attachWith :: Reflex t => (a -> b -> c) -> Behavior t a -> Event t b -> Event t c
459−attachWith f = attachWithMaybe $ \a b -> Just $ f a b
460−
461−-- | Create a new 'Event' by combining each occurence with the current value of
462−-- the 'Behavior'. The occurrence is discarded if the combining function returns
463−-- Nothing
464−attachWithMaybe :: Reflex t => (a -> b -> Maybe c) -> Behavior t a -> Event t b -> Event t c
465−attachWithMaybe f b e = flip push e $ \o -> (`f` o) <$> sample b
466−
467−-- | Create a new 'Event' that only occurs only once, on the first occurence of
468−-- the supplied 'Event'.
469−headE :: (Reflex t, MonadHold t m, MonadFix m) => Event t a -> m (Event t a)
470−headE e = do
471− rec be <- hold e $ fmap (const never) e'
472− let e' = switch be
473− e' `seq` return ()
474− return e'
475−
476−-- | Create a new 'Event' that occurs on all but the first occurence of the
477−-- supplied 'Event'.
478−tailE :: (Reflex t, MonadHold t m, MonadFix m) => Event t a -> m (Event t a)
479−tailE e = snd <$> headTailE e
480−
481−-- | Create a tuple of two 'Event's with the first one occuring only the first
482−-- time the supplied 'Event' occurs and the second occuring on all but the first
483−-- occurence.
484−headTailE :: (Reflex t, MonadHold t m, MonadFix m) => Event t a -> m (Event t a, Event t a)
485−headTailE e = do
486− eHead <- headE e
487− be <- hold never $ fmap (const e) eHead
488− return (eHead, switch be)
489−
490−-- | Split the supplied 'Event' into two individual 'Event's occuring at the
491−-- same time with the respective values from the tuple.
492−splitE :: Reflex t => Event t (a, b) -> (Event t a, Event t b)
493−splitE e = (fmap fst e, fmap snd e)
494−
495−-- | Print the supplied 'String' and the value of the 'Event' on each
496−-- occurence. This should /only/ be used for debugging.
497−--
498−-- Note: As with Debug.Trace.trace, the message will only be printed if the
499−-- 'Event' is actually used.
500−traceEvent :: (Reflex t, Show a) => String -> Event t a -> Event t a
501−traceEvent s = traceEventWith $ \x -> s <> ": " <> show x
502−
503−-- | Print the output of the supplied function on each occurence of the
504−-- 'Event'. This should /only/ be used for debugging.
505−--
506−-- Note: As with Debug.Trace.trace, the message will only be printed if the
507−-- 'Event' is actually used.
508−traceEventWith :: Reflex t => (a -> String) -> Event t a -> Event t a
509−traceEventWith f = push $ \x -> trace (f x) $ return $ Just x
510−
511−-- | Tag type for 'Either' to use it as a 'DSum'.
512−data EitherTag l r a where
513− LeftTag :: EitherTag l r l
514− RightTag :: EitherTag l r r
515−
516−instance GEq (EitherTag l r) where
517− geq a b = case (a, b) of
518− (LeftTag, LeftTag) -> Just Refl
519− (RightTag, RightTag) -> Just Refl
520− _ -> Nothing
521−
522−instance GCompare (EitherTag l r) where
523− gcompare a b = case (a, b) of
524− (LeftTag, LeftTag) -> GEQ
525− (LeftTag, RightTag) -> GLT
526− (RightTag, LeftTag) -> GGT
527− (RightTag, RightTag) -> GEQ
528−
529−instance GShow (EitherTag l r) where
530− gshowsPrec _ a = case a of
531− LeftTag -> showString "LeftTag"
532− RightTag -> showString "RightTag"
533−
534−instance (Show l, Show r) => ShowTag (EitherTag l r) Identity where
535− showTaggedPrec t n (Identity a) = case t of
536− LeftTag -> showsPrec n a
537− RightTag -> showsPrec n a
538−
539−-- | Convert 'Either' to a 'DSum'. Inverse of 'dsumToEither'.
540−eitherToDSum :: Either a b -> DSum (EitherTag a b) Identity
541−eitherToDSum = \case
542− Left a -> (LeftTag :=> Identity a)
543− Right b -> (RightTag :=> Identity b)
544−
545−-- | Convert 'DSum' to 'Either'. Inverse of 'eitherToDSum'.
546−dsumToEither :: DSum (EitherTag a b) Identity -> Either a b
547−dsumToEither = \case
548− (LeftTag :=> Identity a) -> Left a
549− (RightTag :=> Identity b) -> Right b
550−
551−-- | Extract the values of a 'DMap' of 'EitherTag's.
552−dmapToThese :: DMap (EitherTag a b) Identity -> Maybe (These a b)
553−dmapToThese m = case (DMap.lookup LeftTag m, DMap.lookup RightTag m) of
554− (Nothing, Nothing) -> Nothing
555− (Just (Identity a), Nothing) -> Just $ This a
556− (Nothing, Just (Identity b)) -> Just $ That b
557− (Just (Identity a), Just (Identity b)) -> Just $ These a b
558−
559−instance (Semigroup a, Reflex t) => Semigroup (Event t a) where
560− (<>) = alignWith (mergeThese (<>))
561− sconcat = fmap sconcat . mergeList . toList
562−#if MIN_VERSION_semigroups(0,17,0)
563− stimes n = fmap $ stimes n
564−#else
565− times1p n = fmap $ times1p n
566−#endif
567−
568−instance (Semigroup a, Reflex t) => Monoid (Event t a) where
569− mempty = never
570− mappend = (<>)
571− mconcat = fmap sconcat . mergeList
572−
573−-- | Create a new 'Event' that occurs if at least one of the 'Event's in the
574−-- list occurs. If multiple occur at the same time they are folded from the left
575−-- with the given function.
576−mergeWith :: Reflex t => (a -> a -> a) -> [Event t a] -> Event t a
577−mergeWith f es = fmap (Prelude.foldl1 f . map (\(Const2 _ :=> Identity v) -> v) . DMap.toList)
578− . merge
579− . DMap.fromDistinctAscList
580− . map (\(k, v) -> Const2 k :=> v)
581− $ zip [0 :: Int ..] es
582−
583−-- | Create a new 'Event' that occurs if at least one of the 'Event's in the
584−-- list occurs. If multiple occur at the same time the value is the value of the
585−-- leftmost event.
586−leftmost :: Reflex t => [Event t a] -> Event t a
587−leftmost = mergeWith const
588−
589−-- | Create a new 'Event' that occurs if at least one of the 'Event's in the
590−-- list occurs and has a list of the values of all 'Event's occuring at that
591−-- time.
592−mergeList :: Reflex t => [Event t a] -> Event t (NonEmpty a)
593−mergeList [] = never
594−mergeList es = mergeWith (<>) $ map (fmap (:|[])) es
595−
596−-- | Create a new 'Event' combining the map of 'Event's into an 'Event' that
597−-- occurs if at least one of them occurs and has a map of values of all 'Event's
598−-- occuring at that time.
599−mergeMap :: (Reflex t, Ord k) => Map k (Event t a) -> Event t (Map k a)
600−mergeMap = fmap dmapToMap . merge . mapWithFunctorToDMap
601−
602−-- | Split the event into an 'EventSelector' that allows efficient selection of
603−-- the individual 'Event's.
604−fanMap :: (Reflex t, Ord k) => Event t (Map k a) -> EventSelector t (Const2 k a)
605−fanMap = fan . fmap mapToDMap
606−
607−-- | Switches to the new event whenever it receives one; the new event is used
608−-- immediately, on the same frame that it is switched to
609−switchPromptly :: forall t m a. (Reflex t, MonadHold t m) => Event t a -> Event t (Event t a) -> m (Event t a)
610−switchPromptly ea0 eea = do
611− bea <- hold ea0 eea
612− let eLag = switch bea
613− eCoincidences = coincidence eea
614− return $ leftmost [eCoincidences, eLag]
615−
616−instance Reflex t => Align (Event t) where
617− nil = never
618− align ea eb = fmapMaybe dmapToThese $ merge $ DMap.fromList [LeftTag :=> ea, RightTag :=> eb]
619−
620−-- | Create a new 'Event' that only occurs if the supplied 'Event' occurs and
621−-- the 'Behavior' is true at the time of occurence.
622−gate :: Reflex t => Behavior t Bool -> Event t a -> Event t a
623−gate = attachWithMaybe $ \allow a -> if allow then Just a else Nothing
624−
625−-- | Create a new behavior given a starting behavior and switch to a the behvior
626−-- carried by the event when it fires.
627−switcher :: (Reflex t, MonadHold t m)
628− => Behavior t a -> Event t (Behavior t a) -> m (Behavior t a)
629−switcher b eb = pull . (sample <=< sample) <$> hold b eb
630−
631−-- | Combine two 'Dynamic's. The result will change whenever either (or both)
632−-- input 'Dynamic' changes. Equivalent to @zipDynWith (,)@.
633−zipDyn :: Reflex t => Dynamic t a -> Dynamic t b -> Dynamic t (a, b)
634−zipDyn = zipDynWith (,)
635−
636−-- | Combine two 'Dynamic's with a combining function. The result will change
637−-- whenever either (or both) input 'Dynamic' changes.
638−zipDynWith :: Reflex t => (a -> b -> c) -> Dynamic t a -> Dynamic t b -> Dynamic t c
639−zipDynWith f da db =
640− let eab = align (updated da) (updated db)
641− ec = flip push eab $ \o -> do
642− (a, b) <- case o of
643− This a -> do
644− b <- sample $ current db
645− return (a, b)
646− That b -> do
647− a <- sample $ current da
648− return (a, b)
649− These a b -> return (a, b)
650− return $ Just $ f a b
651− in unsafeBuildDynamic (f <$> sample (current da) <*> sample (current db)) ec
652−
653−instance (Reflex t, Monoid a) => Monoid (Dynamic t a) where
654− mconcat = fmap (mconcat . map (\(Const2 _ :=> Identity v) -> v) . DMap.toList) . distributeDMapOverDynPure . DMap.fromList . map (\(k, v) -> Const2 k :=> v) . zip [0 :: Int ..]
655− mempty = constDyn mempty
656− mappend = zipDynWith mappend
657−
658−-- | This function converts a 'DMap' whose elements are 'Dynamic's into a
659−-- 'Dynamic' 'DMap'. Its implementation is more efficient than doing the same
660−-- through the use of multiple uses of 'zipWithDyn' or 'Applicative' operators.
661−distributeDMapOverDynPure :: forall t k. (Reflex t, GCompare k) => DMap k (Dynamic t) -> Dynamic t (DMap k Identity)
662−distributeDMapOverDynPure dm = case DMap.toList dm of
663− [] -> constDyn DMap.empty
664− [k :=> v] -> fmap (DMap.singleton k . Identity) v
665− _ ->
666− let getInitial = DMap.traverseWithKey (\_ -> fmap Identity . sample . current) dm
667− edmPre = merge $ DMap.map updated dm
668− result = unsafeBuildDynamic getInitial $ flip pushAlways edmPre $ \news -> do
669− olds <- sample $ current result
670− return $ DMap.unionWithKey (\_ _ new -> new) olds news
671− in result
672−
673−--------------------------------------------------------------------------------
674−-- Accumulator
675−--------------------------------------------------------------------------------
676−
677−-- | An 'Accumulator' type can be built by accumulating occurrences of an
678−-- 'Event'.
679−class Reflex t => Accumulator t f | f -> t where
680− accum :: (MonadHold t m, MonadFix m) => (a -> b -> a) -> a -> Event t b -> m (f a)
681− accum f = accumMaybe $ \v o -> Just $ f v o
682− accumM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t a) -> a -> Event t b -> m (f a)
683− accumM f = accumMaybeM $ \v o -> Just <$> f v o
684− accumMaybe :: (MonadHold t m, MonadFix m) => (a -> b -> Maybe a) -> a -> Event t b -> m (f a)
685− accumMaybe f = accumMaybeM $ \v o -> return $ f v o
686− accumMaybeM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a)) -> a -> Event t b -> m (f a)
687− mapAccum :: (MonadHold t m, MonadFix m) => (a -> b -> (a, c)) -> a -> Event t b -> m (f a, Event t c)
688− mapAccum f = mapAccumMaybe $ \v o -> bimap Just Just $ f v o
689− mapAccumM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t (a, c)) -> a -> Event t b -> m (f a, Event t c)
690− mapAccumM f = mapAccumMaybeM $ \v o -> bimap Just Just <$> f v o
691− mapAccumMaybe :: (MonadHold t m, MonadFix m) => (a -> b -> (Maybe a, Maybe c)) -> a -> Event t b -> m (f a, Event t c)
692− mapAccumMaybe f = mapAccumMaybeM $ \v o -> return $ f v o
693− mapAccumMaybeM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a, Maybe c)) -> a -> Event t b -> m (f a, Event t c)
694−
695−-- | Accumulate occurrences of an 'Event', producing an output occurrence each
696−-- time. Discard the underlying 'Accumulator'.
697−mapAccum_ :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> (a, c)) -> a -> Event t b -> m (Event t c)
698−mapAccum_ f z e = do
699− (_ :: Behavior t a, result) <- mapAccum f z e
700− return result
701−
702−-- | Accumulate occurrences of an 'Event', possibly producing an output
703−-- occurrence each time. Discard the underlying 'Accumulator'.
704−mapAccumMaybe_ :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> (Maybe a, Maybe c)) -> a -> Event t b -> m (Event t c)
705−mapAccumMaybe_ f z e = do
706− (_ :: Behavior t a, result) <- mapAccumMaybe f z e
707− return result
708−
709−-- | Accumulate occurrences of an 'Event', using a 'PushM' action and producing
710−-- an output occurrence each time. Discard the underlying 'Accumulator'.
711−mapAccumM_ :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t (a, c)) -> a -> Event t b -> m (Event t c)
712−mapAccumM_ f z e = do
713− (_ :: Behavior t a, result) <- mapAccumM f z e
714− return result
715−
716−-- | Accumulate occurrences of an 'Event', using a 'PushM' action and possibly
717−-- producing an output occurrence each time. Discard the underlying
718−-- 'Accumulator'.
719−mapAccumMaybeM_ :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a, Maybe c)) -> a -> Event t b -> m (Event t c)
720−mapAccumMaybeM_ f z e = do
721− (_ :: Behavior t a, result) <- mapAccumMaybeM f z e
722− return result
723−
724−instance Reflex t => Accumulator t (Dynamic t) where
725− accumMaybeM f z e = do
726− rec let e' = flip push e $ \o -> do
727− v <- sample $ current d'
728− f v o
729− d' <- holdDyn z e'
730− return d'
731− mapAccumMaybeM f z e = do
732− rec let e' = flip push e $ \o -> do
733− v <- sample $ current d'
734− result <- f v o
735− return $ case result of
736− (Nothing, Nothing) -> Nothing
737− _ -> Just result
738− d' <- holdDyn z $ fmapMaybe fst e'
739− return (d', fmapMaybe snd e')
740−
741−instance Reflex t => Accumulator t (Behavior t) where
742− accumMaybeM f z e = current <$> accumMaybeM f z e
743− mapAccumMaybeM f z e = first current <$> mapAccumMaybeM f z e
744−
745−instance Reflex t => Accumulator t (Event t) where
746− accumMaybeM f z e = updated <$> accumMaybeM f z e
747− mapAccumMaybeM f z e = first updated <$> mapAccumMaybeM f z e
748−
749−-- | Create a new 'Event' by combining each occurence with the next value of the
750−-- list using the supplied function. If the list runs out of items, all
751−-- subsequent 'Event' occurrences will be ignored.
752−zipListWithEvent :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> c) -> [a] -> Event t b -> m (Event t c)
753−zipListWithEvent f l e = do
754− let f' a b = case a of
755− h:t -> (Just t, Just $ f h b)
756− _ -> (Nothing, Nothing) --TODO: Unsubscribe the event?
757− mapAccumMaybe_ f' l e
758−
759−--------------------------------------------------------------------------------
760−-- Deprecated functions
761−--------------------------------------------------------------------------------
762−
763−-- | Create a new 'Event' that occurs if at least one of the supplied 'Event's
764−-- occurs. If both occur at the same time they are combined using 'mappend'.
765−{-# DEPRECATED appendEvents "If a 'Semigroup a' instance is available, use 'mappend'; otherwise, use 'alignWith (mergeThese mappend)' instead" #-}
766−appendEvents :: (Reflex t, Monoid a) => Event t a -> Event t a -> Event t a
767−appendEvents = alignWith $ mergeThese mappend
768−
769−-- | Alias for 'headE'
770−{-# DEPRECATED onceE "Use 'headE' instead" #-}
771−onceE :: (Reflex t, MonadHold t m, MonadFix m) => Event t a -> m (Event t a)
772−onceE = headE
773−
774−{-# DEPRECATED sequenceThese "Use bisequenceA or bisequence from the bifunctors package instead" #-}
775−{-# ANN sequenceThese "HLint: ignore Use fmap" #-}
776−sequenceThese :: Monad m => These (m a) (m b) -> m (These a b)
777−sequenceThese t = case t of
778− This ma -> liftM This ma
779− These ma mb -> liftM2 These ma mb
780− That mb -> liftM That mb
src/Reflex/Dynamic.hsdeleted−543
@@ -1,543 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−{-# LANGUAGE DataKinds #-}
3−{-# LANGUAGE FlexibleContexts #-}
4−{-# LANGUAGE FlexibleInstances #-}
5−{-# LANGUAGE GADTs #-}
6−{-# LANGUAGE LambdaCase #-}
7−{-# LANGUAGE MultiParamTypeClasses #-}
8−{-# LANGUAGE NoMonomorphismRestriction #-}
9−{-# LANGUAGE PolyKinds #-}
10−{-# LANGUAGE RankNTypes #-}
11−{-# LANGUAGE ScopedTypeVariables #-}
12−{-# LANGUAGE TypeFamilies #-}
13−{-# LANGUAGE TypeOperators #-}
14−{-# LANGUAGE UndecidableInstances #-}
15−-- | This module contains various functions for working with 'Dynamic' values.
16−-- 'Dynamic' and its primitives have been moved to the 'Reflex' class.
17−module Reflex.Dynamic
18− ( -- * Basics
19− Dynamic -- Abstract so we can preserve the law that the current value is always equal to the most recent update
20− , current
21− , updated
22− , holdDyn
23− , constDyn
24− , uniqDyn
25− , uniqDynBy
26− , count
27− , toggle
28− , switchPromptlyDyn
29− , tagPromptlyDyn
30− , attachPromptlyDyn
31− , attachPromptlyDynWith
32− , attachPromptlyDynWithMaybe
33− , foldDyn
34− , foldDynM
35− , foldDynMaybe
36− , foldDynMaybeM
37− , joinDynThroughMap
38− , traceDyn
39− , traceDynWith
40− , splitDynPure
41− , distributeDMapOverDynPure
42− , Demux
43− , demux
44− , demuxed
45− -- Things that probably aren't very useful:
46− , HList (..)
47− , FHList (..)
48− , collectDynPure
49− , distributeFHListOverDynPure
50− -- Unsafe
51− , unsafeDynamic
52− -- * Deprecated functions
53− , apDyn
54− , attachDyn
55− , attachDynWith
56− , attachDynWithMaybe
57− , collectDyn
58− , combineDyn
59− , distributeDMapOverDyn
60− , distributeFHListOverDyn
61− , forDyn
62− , getDemuxed
63− , joinDyn
64− , mapDyn
65− , mconcatDyn
66− , nubDyn
67− , splitDyn
68− , tagDyn
69− ) where
70−
71−import Prelude hiding (mapM, mapM_)
72−
73−import Data.Functor.Misc
74−import Reflex.Class
75−
76−import Control.Applicative ((<*>))
77−import Control.Monad hiding (forM, forM_, mapM, mapM_)
78−import Control.Monad.Fix
79−import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_)
80−import Data.Align
81−import Data.Dependent.Map (DMap)
82−import qualified Data.Dependent.Map as DMap
83−import Data.Dependent.Sum (DSum (..))
84−import Data.GADT.Compare ((:~:) (..), GCompare (..), GEq (..), GOrdering (..))
85−import Data.Map (Map)
86−import Data.Monoid
87−import Data.These
88−
89−import Debug.Trace
90−
91−-- | Create a new 'Dynamic' that only signals changes if the values actually
92−-- changed.
93−uniqDyn :: (Reflex t, Eq a) => Dynamic t a -> Dynamic t a
94−uniqDyn = uniqDynBy (==)
95−
96−-- | Create a new 'Dynamic' that changes only when the underlying 'Dynamic'
97−-- changes and the given function returns 'False' when given both the old and
98−-- the new values.
99−uniqDynBy :: Reflex t => (a -> a -> Bool) -> Dynamic t a -> Dynamic t a
100−uniqDynBy eq d =
101− let e' = attachWithMaybe (\x x' -> if x' `eq` x then Nothing else Just x') (current d) (updated d)
102− in unsafeDynamic (current d) e'
103−
104−-- | Create a 'Dynamic' using the initial value and change it each time the
105−-- 'Event' occurs using a folding function on the previous value and the value
106−-- of the 'Event'.
107−foldDyn :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> b) -> b -> Event t a -> m (Dynamic t b)
108−foldDyn = accum . flip
109−
110−-- | Like 'foldDyn', but the combining function is a 'PushM' action, so it
111−-- can 'sample' existing 'Behaviors' and 'hold' new ones.
112−foldDynM :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t b) -> b -> Event t a -> m (Dynamic t b)
113−foldDynM = accumM . flip
114−
115−-- | Create a 'Dynamic' using the provided initial value and change it each time
116−-- the provided 'Event' occurs, using a function to combine the old value with
117−-- the 'Event''s value. If the function returns 'Nothing', the value is not
118−-- changed; this is distinct from returning 'Just' the old value, since the
119−-- 'Dynamic''s 'updated' 'Event' will fire in the 'Just' case, and will not fire
120−-- in the 'Nothing' case.
121−foldDynMaybe :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> Maybe b) -> b -> Event t a -> m (Dynamic t b)
122−foldDynMaybe = accumMaybe . flip
123−
124−-- | Like 'foldDynMaybe', but the combining function is a 'PushM' action, so it
125−-- can 'sample' existing 'Behaviors' and 'hold' new ones.
126−foldDynMaybeM :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe b)) -> b -> Event t a -> m (Dynamic t b)
127−foldDynMaybeM = accumMaybeM . flip
128−
129−-- | Create a new 'Dynamic' that counts the occurences of the 'Event'.
130−count :: (Reflex t, MonadHold t m, MonadFix m, Num b) => Event t a -> m (Dynamic t b)
131−count e = holdDyn 0 =<< zipListWithEvent const (iterate (+1) 1) e
132−
133−-- | Create a new 'Dynamic' using the initial value that flips its
134−-- value every time the 'Event' occurs.
135−toggle :: (Reflex t, MonadHold t m, MonadFix m) => Bool -> Event t a -> m (Dynamic t Bool)
136−toggle = foldDyn (const not)
137−
138−-- | Switches to the new 'Event' whenever it receives one. Switching occurs
139−-- *before* the inner 'Event' fires - so if the 'Dynamic' changes and both the
140−-- old and new inner Events fire simultaneously, the output will fire with the
141−-- value of the *new* 'Event'.
142−switchPromptlyDyn :: forall t a. Reflex t => Dynamic t (Event t a) -> Event t a
143−switchPromptlyDyn de =
144− let eLag = switch $ current de
145− eCoincidences = coincidence $ updated de
146− in leftmost [eCoincidences, eLag]
147−
148−-- | Split a 'Dynamic' pair into a pair of 'Dynamic's
149−splitDynPure :: Reflex t => Dynamic t (a, b) -> (Dynamic t a, Dynamic t b)
150−splitDynPure d = (fmap fst d, fmap snd d)
151−
152−-- | Create a 'Dynamic' with a 'DMap' of values out of a 'DMap' of 'Dynamic'
153−-- values. The resulting 'Dynamic' will change whenever one of the input
154−-- 'Dynamic's changes.
155−--
156−-- This function's implementation is more efficient than simply using
157−-- 'zipDynWith' or applicative syntax to achieve the same result, especially for
158−-- maps with many elements.
159−distributeMapOverDynPure :: (Reflex t, Ord k) => Map k (Dynamic t v) -> Dynamic t (Map k v)
160−distributeMapOverDynPure = fmap dmapToMap . distributeDMapOverDynPure . mapWithFunctorToDMap
161−
162−--TODO: Generalize this to functors other than Maps
163−-- | Combine a 'Dynamic' of a 'Map' of 'Dynamic's into a 'Dynamic'
164−-- with the current values of the 'Dynamic's in a map.
165−joinDynThroughMap :: forall t k a. (Reflex t, Ord k) => Dynamic t (Map k (Dynamic t a)) -> Dynamic t (Map k a)
166−joinDynThroughMap = joinDyn . fmap distributeMapOverDynPure
167−
168−-- | Print the value of the 'Dynamic' on each change and prefix it
169−-- with the provided string. This should /only/ be used for debugging.
170−--
171−-- Note: Just like Debug.Trace.trace, the value will only be shown if something
172−-- else in the system is depending on it.
173−traceDyn :: (Reflex t, Show a) => String -> Dynamic t a -> Dynamic t a
174−traceDyn s = traceDynWith $ \x -> s <> ": " <> show x
175−
176−-- | Print the result of applying the provided function to the value
177−-- of the 'Dynamic' on each change. This should /only/ be used for
178−-- debugging.
179−--
180−-- Note: Just like Debug.Trace.trace, the value will only be shown if something
181−-- else in the system is depending on it.
182−traceDynWith :: Reflex t => (a -> String) -> Dynamic t a -> Dynamic t a
183−traceDynWith f d =
184− let e' = traceEventWith f $ updated d
185− getV0 = do
186− x <- sample $ current d
187− trace (f x) $ return x
188− in unsafeBuildDynamic getV0 e'
189−
190−-- | Replace the value of the 'Event' with the current value of the 'Dynamic'
191−-- each time the 'Event' occurs.
192−--
193−-- Note: `tagPromptlyDyn d e` differs from `tag (current d) e` in the case that `e` is firing
194−-- at the same time that `d` is changing. With `tagPromptlyDyn d e`, the *new* value of `d`
195−-- will replace the value of `e`, whereas with `tag (current d) e`, the *old* value
196−-- will be used, since the 'Behavior' won't be updated until the end of the frame.
197−-- Additionally, this means that the output 'Event' may not be used to directly change
198−-- the input 'Dynamic', because that would mean its value depends on itself. When creating
199−-- cyclic data flows, generally `tag (current d) e` is preferred.
200−tagPromptlyDyn :: Reflex t => Dynamic t a -> Event t b -> Event t a
201−tagPromptlyDyn = attachPromptlyDynWith const
202−
203−-- | Attach the current value of the 'Dynamic' to the value of the
204−-- 'Event' each time it occurs.
205−--
206−-- Note: `attachPromptlyDyn d` is not the same as `attach (current d)`. See 'tagPromptlyDyn' for details.
207−attachPromptlyDyn :: Reflex t => Dynamic t a -> Event t b -> Event t (a, b)
208−attachPromptlyDyn = attachPromptlyDynWith (,)
209−
210−-- | Combine the current value of the 'Dynamic' with the value of the
211−-- 'Event' each time it occurs.
212−--
213−-- Note: `attachPromptlyDynWith f d` is not the same as `attachWith f (current d)`. See 'tagPromptlyDyn' for details.
214−attachPromptlyDynWith :: Reflex t => (a -> b -> c) -> Dynamic t a -> Event t b -> Event t c
215−attachPromptlyDynWith f = attachPromptlyDynWithMaybe $ \a b -> Just $ f a b
216−
217−-- | Create a new 'Event' by combining the value at each occurence with the
218−-- current value of the 'Dynamic' value and possibly filtering if the combining
219−-- function returns 'Nothing'.
220−--
221−-- Note: `attachPromptlyDynWithMaybe f d` is not the same as `attachWithMaybe f
222−-- (current d)`. See 'tagPromptlyDyn' for details.
223−attachPromptlyDynWithMaybe :: Reflex t => (a -> b -> Maybe c) -> Dynamic t a -> Event t b -> Event t c
224−attachPromptlyDynWithMaybe f d e =
225− let e' = attach (current d) e
226− in fforMaybe (align e' $ updated d) $ \case
227− This (a, b) -> f a b -- Only the tagging event is firing, so use that
228− These (_, b) a -> f a b -- Both events are firing, so use the newer value
229− That _ -> Nothing -- The tagging event isn't firing, so don't fire
230−
231−--------------------------------------------------------------------------------
232−-- Demux
233−--------------------------------------------------------------------------------
234−
235−-- | Represents a time changing value together with an 'EventSelector' that can
236−-- efficiently detect when the underlying 'Dynamic' has a particular value.
237−-- This is useful for representing data like the current selection of a long
238−-- list.
239−--
240−-- Semantically,
241−--
242−-- > demuxed (demux d) k === fmap (== k) d
243−--
244−-- However, the when getDemuxed is used multiple times, the complexity is only
245−-- /O(log(n))/, rather than /O(n)/ for fmap.
246−data Demux t k = Demux { demuxValue :: Behavior t k
247− , demuxSelector :: EventSelector t (Const2 k Bool)
248− }
249−
250−-- | Demultiplex an input value to a 'Demux' with many outputs. At any given
251−-- time, whichever output is indicated by the given 'Dynamic' will be 'True'.
252−demux :: (Reflex t, Ord k) => Dynamic t k -> Demux t k
253−demux k = Demux (current k)
254− (fan $ attachWith (\k0 k1 -> if k0 == k1
255− then DMap.empty
256− else DMap.fromList [Const2 k0 :=> Identity False,
257− Const2 k1 :=> Identity True])
258− (current k) (updated k))
259−
260−-- | Select a particular output of the 'Demux'; this is equivalent to (but much
261−-- faster than) mapping over the original 'Dynamic' and checking whether it is
262−-- equal to the given key.
263−demuxed :: (Reflex t, Eq k) => Demux t k -> k -> Dynamic t Bool
264−demuxed d k =
265− let e = select (demuxSelector d) (Const2 k)
266− in unsafeBuildDynamic (fmap (==k) $ sample $ demuxValue d) e
267−
268−--------------------------------------------------------------------------------
269−-- collectDyn
270−--------------------------------------------------------------------------------
271−
272−--TODO: This whole section is badly in need of cleanup
273−
274−-- | A heterogeneous list whose type and length are fixed statically. This is
275−-- reproduced from the 'HList' package due to integration issues, and because
276−-- very little other functionality from that library is needed.
277−data HList (l::[*]) where
278− HNil :: HList '[]
279− HCons :: e -> HList l -> HList (e ': l)
280−
281−infixr 2 `HCons`
282−
283−type family HRevApp (l1 :: [k]) (l2 :: [k]) :: [k]
284−type instance HRevApp '[] l = l
285−type instance HRevApp (e ': l) l' = HRevApp l (e ': l')
286−
287−hRevApp :: HList l1 -> HList l2 -> HList (HRevApp l1 l2)
288−hRevApp HNil l = l
289−hRevApp (HCons x l) l' = hRevApp l (HCons x l')
290−
291−hReverse :: HList l -> HList (HRevApp l '[])
292−hReverse l = hRevApp l HNil
293−
294−hBuild :: (HBuild' '[] r) => r
295−hBuild = hBuild' HNil
296−
297−class HBuild' l r where
298− hBuild' :: HList l -> r
299−
300−instance (l' ~ HRevApp l '[])
301− => HBuild' l (HList l') where
302− hBuild' = hReverse
303−
304−instance HBuild' (a ': l) r
305− => HBuild' l (a->r) where
306− hBuild' l x = hBuild' (HCons x l)
307−
308−-- | Like 'HList', but with a functor wrapping each element.
309−data FHList f l where
310− FHNil :: FHList f '[]
311− FHCons :: f e -> FHList f l -> FHList f (e ': l)
312−
313−instance GEq (HListPtr l) where
314− HHeadPtr `geq` HHeadPtr = Just Refl
315− HHeadPtr `geq` HTailPtr _ = Nothing
316− HTailPtr _ `geq` HHeadPtr = Nothing
317− HTailPtr a `geq` HTailPtr b = a `geq` b
318−
319−instance GCompare (HListPtr l) where -- Warning: This ordering can't change, dmapTo*HList will break
320− HHeadPtr `gcompare` HHeadPtr = GEQ
321− HHeadPtr `gcompare` HTailPtr _ = GLT
322− HTailPtr _ `gcompare` HHeadPtr = GGT
323− HTailPtr a `gcompare` HTailPtr b = a `gcompare` b
324−
325−data HListPtr l a where
326− HHeadPtr :: HListPtr (h ': t) h
327− HTailPtr :: HListPtr t a -> HListPtr (h ': t) a
328−
329−fhlistToDMap :: forall (f :: * -> *) l. FHList f l -> DMap (HListPtr l) f
330−fhlistToDMap = DMap.fromList . go
331− where go :: forall l'. FHList f l' -> [DSum (HListPtr l') f]
332− go = \case
333− FHNil -> []
334− FHCons h t -> (HHeadPtr :=> h) : map (\(p :=> v) -> HTailPtr p :=> v) (go t)
335−
336−class RebuildSortedHList l where
337− rebuildSortedFHList :: [DSum (HListPtr l) f] -> FHList f l
338− rebuildSortedHList :: [DSum (HListPtr l) Identity] -> HList l
339−
340−instance RebuildSortedHList '[] where
341− rebuildSortedFHList l = case l of
342− [] -> FHNil
343− _ : _ -> error "rebuildSortedFHList{'[]}: empty list expected"
344− rebuildSortedHList l = case l of
345− [] -> HNil
346− _ : _ -> error "rebuildSortedHList{'[]}: empty list expected"
347−
348−instance RebuildSortedHList t => RebuildSortedHList (h ': t) where
349− rebuildSortedFHList l = case l of
350− ((HHeadPtr :=> h) : t) -> FHCons h . rebuildSortedFHList . map (\(HTailPtr p :=> v) -> p :=> v) $ t
351− _ -> error "rebuildSortedFHList{h':t}: non-empty list with HHeadPtr expected"
352− rebuildSortedHList l = case l of
353− ((HHeadPtr :=> Identity h) : t) -> HCons h . rebuildSortedHList . map (\(HTailPtr p :=> v) -> p :=> v) $ t
354− _ -> error "rebuildSortedHList{h':t}: non-empty list with HHeadPtr expected"
355−
356−dmapToHList :: forall l. RebuildSortedHList l => DMap (HListPtr l) Identity -> HList l
357−dmapToHList = rebuildSortedHList . DMap.toList
358−
359−-- | Collect a hetereogeneous list whose elements are all 'Dynamic's into a
360−-- single 'Dynamic' whose value represents the current values of all of the
361−-- input 'Dynamic's.
362−distributeFHListOverDynPure :: (Reflex t, RebuildSortedHList l) => FHList (Dynamic t) l -> Dynamic t (HList l)
363−distributeFHListOverDynPure l = fmap dmapToHList $ distributeDMapOverDynPure $ fhlistToDMap l
364−
365−class AllAreFunctors (f :: a -> *) (l :: [a]) where
366− type FunctorList f l :: [*]
367− toFHList :: HList (FunctorList f l) -> FHList f l
368− fromFHList :: FHList f l -> HList (FunctorList f l)
369−
370−instance AllAreFunctors f '[] where
371− type FunctorList f '[] = '[]
372− toFHList l = case l of
373− HNil -> FHNil
374−#if !defined(__GLASGOW_HASKELL__) || __GLASGOW_HASKELL__ < 800
375− _ -> error "toFHList: impossible" -- Otherwise, GHC complains of a non-exhaustive pattern match; see https://ghc.haskell.org/trac/ghc/ticket/4139
376−#endif
377− fromFHList FHNil = HNil
378−
379−instance AllAreFunctors f t => AllAreFunctors f (h ': t) where
380− type FunctorList f (h ': t) = f h ': FunctorList f t
381− toFHList l = case l of
382− a `HCons` b -> a `FHCons` toFHList b
383−#if !defined(__GLASGOW_HASKELL__) || __GLASGOW_HASKELL__ < 800
384− _ -> error "toFHList: impossible" -- Otherwise, GHC complains of a non-exhaustive pattern match; see https://ghc.haskell.org/trac/ghc/ticket/4139
385−#endif
386− fromFHList (a `FHCons` b) = a `HCons` fromFHList b
387−
388−-- | Convert a datastructure whose constituent parts are all 'Dynamic's into a
389−-- single 'Dynamic' whose value represents all the current values of the input's
390−-- consitutent 'Dynamic's.
391−collectDynPure :: ( RebuildSortedHList (HListElems b)
392− , IsHList a, IsHList b
393− , AllAreFunctors (Dynamic t) (HListElems b)
394− , Reflex t
395− , HListElems a ~ FunctorList (Dynamic t) (HListElems b)
396− ) => a -> Dynamic t b
397−collectDynPure ds = fmap fromHList $ distributeFHListOverDynPure $ toFHList $ toHList ds
398−
399−-- Poor man's Generic
400−class IsHList a where
401− type HListElems a :: [*]
402− toHList :: a -> HList (HListElems a)
403− fromHList :: HList (HListElems a) -> a
404−
405−instance IsHList (a, b) where
406− type HListElems (a, b) = [a, b]
407− toHList (a, b) = hBuild a b
408− fromHList l = case l of
409− a `HCons` b `HCons` HNil -> (a, b)
410−#if !defined(__GLASGOW_HASKELL__) || __GLASGOW_HASKELL__ < 800
411− _ -> error "fromHList: impossible" -- Otherwise, GHC complains of a non-exhaustive pattern match; see https://ghc.haskell.org/trac/ghc/ticket/4139
412−#endif
413−
414−instance IsHList (a, b, c, d) where
415− type HListElems (a, b, c, d) = [a, b, c, d]
416− toHList (a, b, c, d) = hBuild a b c d
417− fromHList l = case l of
418− a `HCons` b `HCons` c `HCons` d `HCons` HNil -> (a, b, c, d)
419−#if !defined(__GLASGOW_HASKELL__) || __GLASGOW_HASKELL__ < 800
420− _ -> error "fromHList: impossible" -- Otherwise, GHC complains of a non-exhaustive pattern match; see https://ghc.haskell.org/trac/ghc/ticket/4139
421−#endif
422−
423−instance IsHList (a, b, c, d, e, f) where
424− type HListElems (a, b, c, d, e, f) = [a, b, c, d, e, f]
425− toHList (a, b, c, d, e, f) = hBuild a b c d e f
426− fromHList l = case l of
427− a `HCons` b `HCons` c `HCons` d `HCons` e `HCons` f `HCons` HNil -> (a, b, c, d, e, f)
428−#if !defined(__GLASGOW_HASKELL__) || __GLASGOW_HASKELL__ < 800
429− _ -> error "fromHList: impossible" -- Otherwise, GHC complains of a non-exhaustive pattern match; see https://ghc.haskell.org/trac/ghc/ticket/4139
430−#endif
431−
432−--------------------------------------------------------------------------------
433−-- Deprecated functions
434−--------------------------------------------------------------------------------
435−
436−-- | Map a function over a 'Dynamic'.
437−{-# DEPRECATED mapDyn "Use 'return . fmap f' instead of 'mapDyn f'; consider eliminating monadic style" #-}
438−mapDyn :: (Reflex t, Monad m) => (a -> b) -> Dynamic t a -> m (Dynamic t b)
439−mapDyn f = return . fmap f
440−
441−-- | Flipped version of 'mapDyn'.
442−{-# DEPRECATED forDyn "Use 'return . ffor a' instead of 'forDyn a'; consider eliminating monadic style" #-}
443−forDyn :: (Reflex t, Monad m) => Dynamic t a -> (a -> b) -> m (Dynamic t b)
444−forDyn a = return . ffor a
445−
446−-- | Split the 'Dynamic' into two 'Dynamic's, each taking the respective value
447−-- of the tuple.
448−{-# DEPRECATED splitDyn "Use 'return . splitDynPure' instead; consider eliminating monadic style" #-}
449−splitDyn :: (Reflex t, Monad m) => Dynamic t (a, b) -> m (Dynamic t a, Dynamic t b)
450−splitDyn = return . splitDynPure
451−
452−-- | Merge the 'Dynamic' values using their 'Monoid' instance.
453−{-# DEPRECATED mconcatDyn "Use 'return . mconcat' instead; consider eliminating monadic style" #-}
454−mconcatDyn :: forall t m a. (Reflex t, Monad m, Monoid a) => [Dynamic t a] -> m (Dynamic t a)
455−mconcatDyn = return . mconcat
456−
457−-- | This function no longer needs to be monadic; see 'distributeMapOverDynPure'.
458−{-# DEPRECATED distributeDMapOverDyn "Use 'return . distributeDMapOverDynPure' instead; consider eliminating monadic style" #-}
459−distributeDMapOverDyn :: (Reflex t, Monad m, GCompare k) => DMap k (Dynamic t) -> m (Dynamic t (DMap k Identity))
460−distributeDMapOverDyn = return . distributeDMapOverDynPure
461−
462−-- | Merge two 'Dynamic's into a new one using the provided function. The new
463−-- 'Dynamic' changes its value each time one of the original 'Dynamic's changes
464−-- its value.
465−{-# DEPRECATED combineDyn "Use 'return (zipDynWith f a b)' instead of 'combineDyn f a b'; consider eliminating monadic style" #-}
466−combineDyn :: forall t m a b c. (Reflex t, Monad m) => (a -> b -> c) -> Dynamic t a -> Dynamic t b -> m (Dynamic t c)
467−combineDyn f a b = return $ zipDynWith f a b
468−
469−-- | A psuedo applicative version of ap for 'Dynamic'. Example useage:
470−--
471−-- > do
472−-- > person <- Person `mapDyn` dynFirstName
473−-- > `apDyn` dynListName
474−-- > `apDyn` dynAge
475−-- > `apDyn` dynAddress
476−{-# DEPRECATED apDyn "Use 'ffor m (<*> a)' instead of 'apDyn m a'; consider eliminating monadic style, since Dynamics are now Applicative and can be used with applicative style directly" #-}
477−{-# ANN apDyn "HLint: ignore Use fmap" #-}
478−apDyn :: forall t m a b. (Reflex t, Monad m)
479− => m (Dynamic t (a -> b))
480− -> Dynamic t a
481− -> m (Dynamic t b)
482−apDyn m a = liftM (<*> a) m
483−
484−--TODO: The pattern of using hold (sample b0) can be reused in various places as a safe way of building certain kinds of Dynamics; see if we can factor this out
485−-- | This function no longer needs to be monadic, so it has been replaced by
486−-- 'demuxed', which is pure.
487−{-# DEPRECATED getDemuxed "Use 'return . demuxed d' instead of 'getDemuxed d'; consider eliminating monadic style" #-}
488−getDemuxed :: (Reflex t, Monad m, Eq k) => Demux t k -> k -> m (Dynamic t Bool)
489−getDemuxed d = return . demuxed d
490−
491−-- | This function no longer needs to be monadic, so it has been replaced by
492−-- 'distributeFHListOverDynPure', which is pure.
493−{-# DEPRECATED distributeFHListOverDyn "Use 'return . distributeFHListOverDynPure' instead; consider eliminating monadic style" #-}
494−distributeFHListOverDyn :: forall t m l. (Reflex t, Monad m, RebuildSortedHList l) => FHList (Dynamic t) l -> m (Dynamic t (HList l))
495−distributeFHListOverDyn = return . distributeFHListOverDynPure
496−
497−-- | This function no longer needs to be monadic, so it has been replaced by
498−-- 'collectDynPure', which is pure.
499−{-# DEPRECATED collectDyn "Use 'return . collectDynPure' instead; consider eliminating monadic style" #-}
500−collectDyn :: ( RebuildSortedHList (HListElems b)
501− , IsHList a, IsHList b
502− , AllAreFunctors (Dynamic t) (HListElems b)
503− , Reflex t, Monad m
504− , HListElems a ~ FunctorList (Dynamic t) (HListElems b)
505− ) => a -> m (Dynamic t b)
506−collectDyn = return . collectDynPure
507−
508−-- | This function has been renamed to 'tagPromptlyDyn' to clarify its
509−-- semantics.
510−{-# DEPRECATED tagDyn "Use 'tagPromptlyDyn' instead" #-}
511−tagDyn :: Reflex t => Dynamic t a -> Event t b -> Event t a
512−tagDyn = tagPromptlyDyn
513−
514−-- | This function has been renamed to 'attachPromptlyDyn' to clarify its
515−-- semantics.
516−{-# DEPRECATED attachDyn "Use 'attachPromptlyDyn' instead" #-}
517−attachDyn :: Reflex t => Dynamic t a -> Event t b -> Event t (a, b)
518−attachDyn = attachPromptlyDyn
519−
520−-- | This function has been renamed to 'attachPromptlyDynWith' to clarify its
521−-- semantics.
522−{-# DEPRECATED attachDynWith "Use 'attachPromptlyDynWith' instead" #-}
523−attachDynWith :: Reflex t => (a -> b -> c) -> Dynamic t a -> Event t b -> Event t c
524−attachDynWith = attachPromptlyDynWith
525−
526−-- | This function has been renamed to 'attachPromptlyDynWithMaybe' to clarify
527−-- its semantics.
528−{-# DEPRECATED attachDynWithMaybe "Use 'attachPromptlyDynWithMaybe' instead" #-}
529−attachDynWithMaybe :: Reflex t => (a -> b -> Maybe c) -> Dynamic t a -> Event t b -> Event t c
530−attachDynWithMaybe = attachPromptlyDynWithMaybe
531−
532−-- | Combine an inner and outer 'Dynamic' such that the resulting 'Dynamic''s
533−-- current value will always be equal to the current value's current value, and
534−-- will change whenever either the inner or the outer (or both) values change.
535−{-# DEPRECATED joinDyn "Use 'join' instead" #-}
536−joinDyn :: Reflex t => Dynamic t (Dynamic t a) -> Dynamic t a
537−joinDyn = join
538−
539−-- | 'nubDyn''s behavior is not quite analogous to 'nub''s behavior, so it has
540−-- been renamed to 'uniqDyn'
541−{-# DEPRECATED nubDyn "Use 'uniqDyn' instead" #-}
542−nubDyn :: (Reflex t, Eq a) => Dynamic t a -> Dynamic t a
543−nubDyn = uniqDyn
src/Reflex/Dynamic/TH.hsdeleted−88
@@ -1,88 +0,0 @@
1−{-# LANGUAGE EmptyDataDecls #-}
2−{-# LANGUAGE GADTs #-}
3−{-# LANGUAGE PatternGuards #-}
4−{-# LANGUAGE ScopedTypeVariables #-}
5−{-# LANGUAGE TemplateHaskell #-}
6−{-# LANGUAGE TypeOperators #-}
7−-- | Template Haskell helper functions for building complex 'Dynamic' values.
8−module Reflex.Dynamic.TH (qDyn, unqDyn, mkDyn) where
9−
10−import Reflex.Dynamic
11−
12−import Control.Monad.State
13−import Data.Data
14−import Data.Generics
15−import Data.Monoid
16−import qualified Language.Haskell.Exts as Hs
17−import qualified Language.Haskell.Meta.Syntax.Translate as Hs
18−import Language.Haskell.TH
19−import Language.Haskell.TH.Quote
20−import qualified Language.Haskell.TH.Syntax as TH
21−
22−-- | Quote a 'Dynamic' expression. Within the quoted expression, you can use
23−-- @$(unqDyn [| x |])@ to refer to any expression @x@ of type @Dynamic t a@; the
24−-- unquoted result will be of type @a@
25−qDyn :: Q Exp -> Q Exp
26−qDyn qe = do
27− e <- qe
28− let f :: forall d. Data d => d -> StateT [(Name, Exp)] Q d
29− f d = case eqT of
30− Just (Refl :: d :~: Exp)
31− | AppE (VarE m) eInner <- d
32− , m == 'unqMarker
33− -> do n <- lift $ newName "dynamicQuotedExpressionVariable"
34− modify ((n, eInner):)
35− return $ VarE n
36− _ -> gmapM f d
37− (e', exprsReversed) <- runStateT (gmapM f e) []
38− let exprs = reverse exprsReversed
39− arg = foldr (\a b -> ConE 'FHCons `AppE` a `AppE` b) (ConE 'FHNil) $ map snd exprs
40− param = foldr (\a b -> ConP 'HCons [VarP a, b]) (ConP 'HNil []) $ map fst exprs
41− [| return $ $(return $ LamE [param] e') $ distributeFHListOverDynPure $(return arg) |]
42−
43−-- | Antiquote a 'Dynamic' expression. This can /only/ be used inside of a
44−-- 'qDyn' quotation.
45−unqDyn :: Q Exp -> Q Exp
46−unqDyn e = [| unqMarker $e |]
47−
48−-- | This type represents an occurrence of unqDyn before it has been processed
49−-- by qDyn. If you see it in a type error, it probably means that unqDyn has
50−-- been used outside of a qDyn context.
51−data UnqDyn
52−
53−-- unqMarker must not be exported; it is used only as a way of smuggling data
54−-- from unqDyn to qDyn
55−
56−--TODO: It would be much nicer if the TH AST was extensible to support this kind of thing without trickery
57−unqMarker :: a -> UnqDyn
58−unqMarker = error "An unqDyn expression was used outside of a qDyn expression"
59−
60−-- | Create a 'Dynamic' value using other 'Dynamic's as inputs. The result is
61−-- sometimes more concise and readable than the equivalent 'Applicative'-based
62−-- expression. For example:
63−--
64−-- > [mkDyn| $x + $v * $t + 1/2 * $a * $t ^ 2 |]
65−--
66−-- would have a very cumbersome 'Applicative' encoding.
67−mkDyn :: QuasiQuoter
68−mkDyn = QuasiQuoter
69− { quoteExp = mkDynExp
70− , quotePat = error "mkDyn: pattern splices are not supported"
71− , quoteType = error "mkDyn: type splices are not supported"
72− , quoteDec = error "mkDyn: declaration splices are not supported"
73− }
74−
75−mkDynExp :: String -> Q Exp
76−mkDynExp s = case Hs.parseExpWithMode (Hs.defaultParseMode { Hs.extensions = [ Hs.EnableExtension Hs.TemplateHaskell ] }) s of
77− Hs.ParseFailed (Hs.SrcLoc _ l c) err -> fail $ "mkDyn:" <> show l <> ":" <> show c <> ": " <> err
78− Hs.ParseOk e -> qDyn $ return $ everywhere (id `extT` reinstateUnqDyn) $ Hs.toExp $ everywhere (id `extT` antiE) e
79− where TH.Name (TH.OccName occName) (TH.NameG _ _ (TH.ModName modName)) = 'unqMarker
80− antiE x = case x of
81− Hs.SpliceExp se ->
82− Hs.App (Hs.Var $ Hs.Qual (Hs.ModuleName modName) (Hs.Ident occName)) $ case se of
83− Hs.IdSplice v -> Hs.Var $ Hs.UnQual $ Hs.Ident v
84− Hs.ParenSplice ps -> ps
85− _ -> x
86− reinstateUnqDyn (TH.Name (TH.OccName occName') (TH.NameQ (TH.ModName modName')))
87− | modName == modName' && occName == occName' = 'unqMarker
88− reinstateUnqDyn x = x
src/Reflex/Dynamic/Uniq.hsdeleted−101
@@ -1,101 +0,0 @@
1−{-# LANGUAGE FlexibleInstances #-}
2−{-# LANGUAGE MagicHash #-}
3−{-# LANGUAGE MultiParamTypeClasses #-}
4−-- | This module provides a variation of 'Dynamic' values that uses cheap
5−-- pointer equality checks to reduce the amount of signal propagation needed.
6−module Reflex.Dynamic.Uniq
7− ( UniqDynamic
8− , uniqDynamic
9− , fromUniqDynamic
10− , alreadyUniqDynamic
11− ) where
12−
13−import Control.Applicative (Applicative (..))
14−import GHC.Exts
15−import Reflex.Class
16−import Reflex.Dynamic
17−
18−-- | A 'Dynamic' whose 'updated' 'Event' will never fire with the same value as
19−-- the 'current' 'Behavior''s contents. In order to maintain this constraint,
20−-- the value inside a 'UniqDynamic' is always evaluated to
21−-- <https://wiki.haskell.org/Weak_head_normal_form weak head normal form>.
22−--
23−-- Internally, 'UniqDynamic' uses pointer equality as a heuristic to avoid
24−-- unnecessary update propagation; this is much more efficient than performing
25−-- full comparisons. However, when the 'UniqDynamic' is converted back into a
26−-- regular 'Dynamic', a full comparison is performed.
27−newtype UniqDynamic t a = UniqDynamic { unUniqDynamic :: Dynamic t a }
28−
29−-- | Construct a 'UniqDynamic' by eliminating redundant updates from a 'Dynamic'.
30−uniqDynamic :: Reflex t => Dynamic t a -> UniqDynamic t a
31−uniqDynamic d = UniqDynamic $ unsafeBuildDynamic (sample $ current d) $ flip push (updated d) $ \new -> do --TODO: It would be very nice if we had an uncached push here
32− old <- sample $ current d --TODO: Is it better to sample ourselves here?
33− return $ unsafeJustChanged old new
34−
35−-- | Retrieve a normal 'Dynamic' from a 'UniqDynamic'. This will perform a
36−-- final check using the output type's 'Eq' instance to ensure deterministic
37−-- behavior.
38−--
39−-- WARNING: If used with a type whose 'Eq' instance is not law-abiding -
40−-- specifically, if there are cases where @x /= x@, 'fromUniqDynamic' may
41−-- eliminate more 'updated' occurrences than it should. For example, NaN values
42−-- of 'Double' and 'Float' are considered unequal to themselves by the 'Eq'
43−-- instance, but can be equal by pointer equality. This may cause 'UniqDynamic'
44−-- to lose changes from NaN to NaN.
45−fromUniqDynamic :: (Reflex t, Eq a) => UniqDynamic t a -> Dynamic t a
46−fromUniqDynamic (UniqDynamic d) = uniqDynBy superEq d
47− where
48− -- Only consider values different if they fail both pointer equality /and/
49− -- 'Eq' equality. This is to make things a bit more deterministic in the
50− -- case of unlawful 'Eq' instances. However, it is still possible to
51− -- achieve nondeterminism by constructing elements that are identical in
52− -- value, unequal according to 'Eq', and nondeterministically equal or
53− -- nonequal by pointer quality. I suspect that it is impossible to make the
54− -- behavior deterministic in this case.
55− superEq a b = a `unsafePtrEq` b || a == b
56−
57−-- | Create a UniqDynamic without uniqing it on creation. This will be slightly
58−-- faster than uniqDynamic when used with a Dynamic whose values are always (or
59−-- nearly always) different from its previous values; if used with a Dynamic
60−-- whose values do not change frequently, it may be much slower than uniqDynamic
61−alreadyUniqDynamic :: Dynamic t a -> UniqDynamic t a
62−alreadyUniqDynamic = UniqDynamic
63−
64−unsafePtrEq :: a -> a -> Bool
65−unsafePtrEq a b = case a `seq` b `seq` reallyUnsafePtrEquality# a b of
66− 0# -> False
67− _ -> True
68−
69−unsafeJustChanged :: a -> a -> Maybe a
70−unsafeJustChanged old new =
71− if old `unsafePtrEq` new
72− then Nothing
73− else Just new
74−
75−instance Reflex t => Accumulator t (UniqDynamic t) where
76− accumMaybeM f z e = do
77− let f' old change = do
78− mNew <- f old change
79− return $ unsafeJustChanged old =<< mNew
80− d <- accumMaybeM f' z e
81− return $ UniqDynamic d
82− mapAccumMaybeM f z e = do
83− let f' old change = do
84− (mNew, output) <- f old change
85− return (unsafeJustChanged old =<< mNew, output)
86− (d, out) <- mapAccumMaybeM f' z e
87− return (UniqDynamic d, out)
88−
89−instance Reflex t => Functor (UniqDynamic t) where
90− fmap f (UniqDynamic d) = uniqDynamic $ fmap f d
91−
92−instance Reflex t => Applicative (UniqDynamic t) where
93− pure = UniqDynamic . constDyn
94− UniqDynamic a <*> UniqDynamic b = uniqDynamic $ a <*> b
95− _ *> b = b
96− a <* _ = a
97−
98−instance Reflex t => Monad (UniqDynamic t) where
99− UniqDynamic x >>= f = uniqDynamic $ x >>= unUniqDynamic . f
100− _ >> b = b
101− return = pure
src/Reflex/Host/Class.hsdeleted−282
@@ -1,282 +0,0 @@
1−{-# LANGUAGE ExistentialQuantification #-}
2−{-# LANGUAGE FlexibleContexts #-}
3−{-# LANGUAGE FlexibleInstances #-}
4−{-# LANGUAGE FunctionalDependencies #-}
5−{-# LANGUAGE GADTs #-}
6−{-# LANGUAGE MultiParamTypeClasses #-}
7−{-# LANGUAGE RankNTypes #-}
8−{-# LANGUAGE RoleAnnotations #-}
9−{-# LANGUAGE ScopedTypeVariables #-}
10−{-# LANGUAGE TypeFamilies #-}
11−{-# LANGUAGE UndecidableInstances #-}
12−-- | This module provides the interface for hosting 'Reflex' engines. This
13−-- should only be necessary if you're writing a binding or some other library
14−-- that provides a core event loop.
15−module Reflex.Host.Class
16− ( ReflexHost (..)
17− , MonadSubscribeEvent (..)
18− , MonadReadEvent (..)
19− , MonadReflexCreateTrigger (..)
20− , MonadReflexHost (..)
21− , fireEvents
22− , newEventWithTriggerRef
23− , fireEventRef
24− , fireEventRefAndRead
25− ) where
26−
27−import Reflex.Class
28−
29−import Control.Applicative
30−import Control.Monad
31−import Control.Monad.Fix
32−import Control.Monad.Identity
33−import Control.Monad.Ref
34−import Control.Monad.Trans
35−import Control.Monad.Trans.Cont (ContT ())
36−import Control.Monad.Trans.Except (ExceptT ())
37−import Control.Monad.Trans.Reader (ReaderT ())
38−import Control.Monad.Trans.RWS (RWST ())
39−import Control.Monad.Trans.State (StateT ())
40−import qualified Control.Monad.Trans.State.Strict as Strict
41−import Control.Monad.Trans.Writer (WriterT ())
42−import Data.Dependent.Sum (DSum (..))
43−import Data.GADT.Compare
44−import Data.Monoid
45−
46−-- Note: this import must come last to silence warnings from AMP
47−import Prelude hiding (foldl, mapM, mapM_, sequence, sequence_)
48−
49−-- | Framework implementation support class for the reflex implementation
50−-- represented by @t@.
51−class ( Reflex t
52− , MonadReflexCreateTrigger t (HostFrame t)
53− , MonadSample t (HostFrame t)
54− , MonadHold t (HostFrame t)
55− , MonadFix (HostFrame t)
56− , MonadSubscribeEvent t (HostFrame t)
57− ) => ReflexHost t where
58− type EventTrigger t :: * -> *
59− type EventHandle t :: * -> *
60− type HostFrame t :: * -> *
61−
62−-- | Monad in which Events can be 'subscribed'. This forces all underlying
63−-- event sources to be initialized, so that the event will fire whenever it
64−-- ought to. Events must be subscribed before they are read using readEvent
65−class (Reflex t, Monad m) => MonadSubscribeEvent t m | m -> t where
66− -- | Subscribe to an event and set it up if needed.
67− --
68− -- This function will create a new 'EventHandle' from an 'Event'. This handle
69− -- may then be used via 'readEvent' in the read callback of
70− -- 'fireEventsAndRead'.
71− --
72− -- If the event wasn't subscribed to before (either manually or through a
73− -- dependent event or behavior) then this function will cause the event and
74− -- all dependencies of this event to be set up. For example, if the event was
75− -- created by 'newEventWithTrigger', then it's callback will be executed.
76− --
77− -- It's safe to call this function multiple times.
78− subscribeEvent :: Event t a -> m (EventHandle t a)
79−
80−-- | Monad that allows to read events' values.
81−class (ReflexHost t, Applicative m, Monad m) => MonadReadEvent t m | m -> t where
82− -- | Read the value of an 'Event' from an 'EventHandle' (created by calling
83− -- 'subscribeEvent').
84− --
85− -- After event propagation is done, all events can be in two states: either
86− -- they are firing with some value or they are not firing. In the former
87− -- case, this function returns @Just act@, where @act@ in an action to read
88− -- the current value of the event. In the latter case, the function returns
89− -- @Nothing@.
90− --
91− -- This function is normally used in the calllback for 'fireEventsAndRead'.
92− readEvent :: EventHandle t a -> m (Maybe (m a))
93−
94−-- | A monad where new events feed from external sources can be created.
95−class (Applicative m, Monad m) => MonadReflexCreateTrigger t m | m -> t where
96− -- | Creates a root 'Event' (one that is not based on any other event).
97− --
98− -- When a subscriber first subscribes to an event (building another event that
99− -- depends on the subscription) the given callback function is run and passed
100− -- a trigger. The callback function can then set up the event source in IO.
101− -- After this is done, the callback function must return an accompanying
102− -- teardown action.
103− --
104− -- Any time between setup and teardown the trigger can be used to fire the
105− -- event, by passing it to 'fireEventsAndRead'.
106− --
107− -- Note: An event may be set up multiple times. So after the teardown action
108− -- is executed, the event may still be set up again in the future.
109− newEventWithTrigger :: (EventTrigger t a -> IO (IO ())) -> m (Event t a)
110− newFanEventWithTrigger :: GCompare k => (forall a. k a -> EventTrigger t a -> IO (IO ())) -> m (EventSelector t k)
111−
112−-- | 'MonadReflexHost' designates monads that can run reflex frames.
113−class ( ReflexHost t
114− , MonadReflexCreateTrigger t m
115− , MonadSubscribeEvent t m
116− , MonadReadEvent t (ReadPhase m)
117− , MonadSample t (ReadPhase m)
118− , MonadHold t (ReadPhase m)
119− ) => MonadReflexHost t m | m -> t where
120− type ReadPhase m :: * -> *
121− -- | Propagate some events firings and read the values of events afterwards.
122− --
123− -- This function will create a new frame to fire the given events. It will
124− -- then update all dependent events and behaviors. After that is done, the
125− -- given callback is executed which allows to read the final values of events
126− -- and check whether they have fired in this frame or not.
127− --
128− -- All events that are given are fired at the same time.
129− --
130− -- This function is typically used in the main loop of a reflex framework
131− -- implementation. The main loop waits for external events to happen (such as
132− -- keyboard input or a mouse click) and then fires the corresponding events
133− -- using this function. The read callback can be used to read output events
134− -- and perform a corresponding response action to the external event.
135− fireEventsAndRead :: [DSum (EventTrigger t) Identity] -> ReadPhase m a -> m a
136−
137− -- | Run a frame without any events firing.
138− --
139− -- This function should be used when you want to use 'sample' and 'hold' when
140− -- no events are currently firing. Using this function in that case can
141− -- improve performance, since the implementation can assume that no events are
142− -- firing when 'sample' or 'hold' are called.
143− --
144− -- This function is commonly used to set up the basic event network when the
145− -- application starts up.
146− runHostFrame :: HostFrame t a -> m a
147−
148−-- | Like 'fireEventsAndRead', but without reading any events.
149−fireEvents :: MonadReflexHost t m => [DSum (EventTrigger t) Identity] -> m ()
150−fireEvents dm = fireEventsAndRead dm $ return ()
151−{-# INLINE fireEvents #-}
152−
153−-- | Create a new event and store its trigger in an 'IORef' while it's active.
154−--
155−-- An event is only active between the set up (when it's first subscribed to)
156−-- and the teardown phases (when noboby is subscribing the event anymore). This
157−-- function returns an Event and an 'IORef'. As long as the event is active, the
158−-- 'IORef' will contain 'Just' the event trigger to trigger this event. When the
159−-- event is not active, the 'IORef' will contain 'Nothing'. This allows event
160−-- sources to be more efficient, since they don't need to produce events when
161−-- nobody is listening.
162−newEventWithTriggerRef :: (MonadReflexCreateTrigger t m, MonadRef m, Ref m ~ Ref IO) => m (Event t a, Ref m (Maybe (EventTrigger t a)))
163−newEventWithTriggerRef = do
164− rt <- newRef Nothing
165− e <- newEventWithTrigger $ \t -> do
166− writeRef rt $ Just t
167− return $ writeRef rt Nothing
168− return (e, rt)
169−{-# INLINE newEventWithTriggerRef #-}
170−
171−-- | Fire the given trigger if it is not 'Nothing'.
172−fireEventRef :: (MonadReflexHost t m, MonadRef m, Ref m ~ Ref IO) => Ref m (Maybe (EventTrigger t a)) -> a -> m ()
173−fireEventRef mtRef input = do
174− mt <- readRef mtRef
175− case mt of
176− Nothing -> return ()
177− Just trigger -> fireEvents [trigger :=> Identity input]
178−
179−-- | Fire the given trigger if it is not 'Nothing', and read from the given
180−-- 'EventHandle'.
181−fireEventRefAndRead :: (MonadReflexHost t m, MonadRef m, Ref m ~ Ref IO) => Ref m (Maybe (EventTrigger t a)) -> a -> EventHandle t b -> m (Maybe b)
182−fireEventRefAndRead mtRef input e = do
183− mt <- readRef mtRef
184− case mt of
185− Nothing -> return Nothing -- Since we aren't firing the input, the output can't fire
186− Just trigger -> fireEventsAndRead [trigger :=> Identity input] $ do
187− mGetValue <- readEvent e
188− case mGetValue of
189− Nothing -> return Nothing
190− Just getValue -> fmap Just getValue
191−
192−
193−--------------------------------------------------------------------------------
194−-- Instances
195−--------------------------------------------------------------------------------
196−
197−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (ReaderT r m) where
198− newEventWithTrigger = lift . newEventWithTrigger
199− newFanEventWithTrigger initializer = lift $ newFanEventWithTrigger initializer
200−
201−instance MonadSubscribeEvent t m => MonadSubscribeEvent t (ReaderT r m) where
202− subscribeEvent = lift . subscribeEvent
203−
204−instance MonadReflexHost t m => MonadReflexHost t (ReaderT r m) where
205− type ReadPhase (ReaderT r m) = ReadPhase m
206− fireEventsAndRead dm a = lift $ fireEventsAndRead dm a
207− runHostFrame = lift . runHostFrame
208−
209−instance (MonadReflexCreateTrigger t m, Monoid w) => MonadReflexCreateTrigger t (WriterT w m) where
210− newEventWithTrigger = lift . newEventWithTrigger
211− newFanEventWithTrigger initializer = lift $ newFanEventWithTrigger initializer
212−
213−instance (MonadSubscribeEvent t m, Monoid w) => MonadSubscribeEvent t (WriterT w m) where
214− subscribeEvent = lift . subscribeEvent
215−
216−instance (MonadReflexHost t m, Monoid w) => MonadReflexHost t (WriterT w m) where
217− type ReadPhase (WriterT w m) = ReadPhase m
218− fireEventsAndRead dm a = lift $ fireEventsAndRead dm a
219− runHostFrame = lift . runHostFrame
220−
221−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (StateT s m) where
222− newEventWithTrigger = lift . newEventWithTrigger
223− newFanEventWithTrigger initializer = lift $ newFanEventWithTrigger initializer
224−
225−instance MonadSubscribeEvent t m => MonadSubscribeEvent t (StateT r m) where
226− subscribeEvent = lift . subscribeEvent
227−
228−instance MonadReflexHost t m => MonadReflexHost t (StateT s m) where
229− type ReadPhase (StateT s m) = ReadPhase m
230− fireEventsAndRead dm a = lift $ fireEventsAndRead dm a
231− runHostFrame = lift . runHostFrame
232−
233−
234−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (Strict.StateT s m) where
235− newEventWithTrigger = lift . newEventWithTrigger
236− newFanEventWithTrigger initializer = lift $ newFanEventWithTrigger initializer
237−
238−instance MonadSubscribeEvent t m => MonadSubscribeEvent t (Strict.StateT r m) where
239− subscribeEvent = lift . subscribeEvent
240−
241−instance MonadReflexHost t m => MonadReflexHost t (Strict.StateT s m) where
242− type ReadPhase (Strict.StateT s m) = ReadPhase m
243− fireEventsAndRead dm a = lift $ fireEventsAndRead dm a
244− runHostFrame = lift . runHostFrame
245−
246−
247−
248−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (ContT r m) where
249− newEventWithTrigger = lift . newEventWithTrigger
250− newFanEventWithTrigger initializer = lift $ newFanEventWithTrigger initializer
251−
252−instance MonadSubscribeEvent t m => MonadSubscribeEvent t (ContT r m) where
253− subscribeEvent = lift . subscribeEvent
254−
255−instance MonadReflexHost t m => MonadReflexHost t (ContT r m) where
256− type ReadPhase (ContT r m) = ReadPhase m
257− fireEventsAndRead dm a = lift $ fireEventsAndRead dm a
258− runHostFrame = lift . runHostFrame
259−
260−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (ExceptT e m) where
261− newEventWithTrigger = lift . newEventWithTrigger
262− newFanEventWithTrigger initializer = lift $ newFanEventWithTrigger initializer
263−
264−instance MonadSubscribeEvent t m => MonadSubscribeEvent t (ExceptT r m) where
265− subscribeEvent = lift . subscribeEvent
266−
267−instance MonadReflexHost t m => MonadReflexHost t (ExceptT e m) where
268− type ReadPhase (ExceptT e m) = ReadPhase m
269− fireEventsAndRead dm a = lift $ fireEventsAndRead dm a
270− runHostFrame = lift . runHostFrame
271−
272−instance (MonadReflexCreateTrigger t m, Monoid w) => MonadReflexCreateTrigger t (RWST r w s m) where
273− newEventWithTrigger = lift . newEventWithTrigger
274− newFanEventWithTrigger initializer = lift $ newFanEventWithTrigger initializer
275−
276−instance (MonadSubscribeEvent t m, Monoid w) => MonadSubscribeEvent t (RWST r w s m) where
277− subscribeEvent = lift . subscribeEvent
278−
279−instance (MonadReflexHost t m, Monoid w) => MonadReflexHost t (RWST r w s m) where
280− type ReadPhase (RWST r w s m) = ReadPhase m
281− fireEventsAndRead dm a = lift $ fireEventsAndRead dm a
282− runHostFrame = lift . runHostFrame
src/Reflex/Pure.hsdeleted−167
@@ -1,167 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−{-# LANGUAGE EmptyDataDecls #-}
3−{-# LANGUAGE FlexibleInstances #-}
4−{-# LANGUAGE InstanceSigs #-}
5−{-# LANGUAGE MultiParamTypeClasses #-}
6−{-# LANGUAGE ScopedTypeVariables #-}
7−{-# LANGUAGE TypeFamilies #-}
8−
9−-- There are two expected orphan instances in this module:
10−-- * MonadSample (Pure t) ((->) t)
11−-- * MonadHold (Pure t) ((->) t)
12−{-# OPTIONS_GHC -fno-warn-orphans #-}
13−
14−-- | This module provides a pure implementation of Reflex, which is intended to
15−-- serve as a reference for the semantics of the Reflex class. All
16−-- implementations of Reflex should produce the same results as this
17−-- implementation, although performance and laziness/strictness may differ.
18−module Reflex.Pure where
19−
20−#if !MIN_VERSION_base(4,8,0)
21−import Control.Applicative -- Necessary for GHC 7.8
22−#endif
23−
24−import Control.Monad
25−import Data.Dependent.Map (DMap, GCompare)
26−import qualified Data.Dependent.Map as DMap
27−import Data.Functor.Identity
28−import Data.Maybe
29−import Data.MemoTrie
30−import Data.Monoid
31−import Reflex.Class
32−
33−data Pure t
34−
35−-- | The Enum instance of t must be dense: for all x :: t, there must not exist
36−-- any y :: t such that pred x < y < x. The HasTrie instance will be used
37−-- exclusively to memoize functions of t, not for any of its other capabilities.
38−instance (Enum t, HasTrie t, Ord t) => Reflex (Pure t) where
39−
40− newtype Behavior (Pure t) a = Behavior { unBehavior :: t -> a }
41− newtype Event (Pure t) a = Event { unEvent :: t -> Maybe a }
42− newtype Dynamic (Pure t) a = Dynamic { unDynamic :: t -> (a, Maybe a) }
43− newtype Incremental (Pure t) p a = Incremental { unIncremental :: t -> (a, Maybe (p a)) }
44−
45− type PushM (Pure t) = (->) t
46− type PullM (Pure t) = (->) t
47−
48− never :: Event (Pure t) a
49− never = Event $ \_ -> Nothing
50−
51− constant :: a -> Behavior (Pure t) a
52− constant x = Behavior $ \_ -> x
53−
54− push :: (a -> PushM (Pure t) (Maybe b)) -> Event (Pure t) a -> Event (Pure t) b
55− push f e = Event $ memo $ \t -> unEvent e t >>= \o -> f o t
56−
57− pull :: PullM (Pure t) a -> Behavior (Pure t) a
58− pull = Behavior . memo
59−
60− -- [UNUSED_CONSTRAINT]: The following type signature for merge will produce a
61− -- warning because the GCompare instance is not used; however, removing the
62− -- GCompare instance produces a different warning, due to that constraint
63− -- being present in the original class definition
64−
65− --merge :: GCompare k => DMap k (Event (Pure t)) -> Event (Pure t) (DMap k Identity)
66− merge events = Event $ memo $ \t ->
67− let currentOccurrences = DMap.mapMaybeWithKey (\_ (Event a) -> Identity <$> a t) events
68− in if DMap.null currentOccurrences
69− then Nothing
70− else Just currentOccurrences
71−
72− fan :: GCompare k => Event (Pure t) (DMap k Identity) -> EventSelector (Pure t) k
73− fan e = EventSelector $ \k -> Event $ \t -> unEvent e t >>= fmap runIdentity . DMap.lookup k
74−
75− switch :: Behavior (Pure t) (Event (Pure t) a) -> Event (Pure t) a
76− switch b = Event $ memo $ \t -> unEvent (unBehavior b t) t
77−
78− coincidence :: Event (Pure t) (Event (Pure t) a) -> Event (Pure t) a
79− coincidence e = Event $ memo $ \t -> unEvent e t >>= \o -> unEvent o t
80−
81− current :: Dynamic (Pure t) a -> Behavior (Pure t) a
82− current d = Behavior $ \t -> fst $ unDynamic d t
83−
84− updated :: Dynamic (Pure t) a -> Event (Pure t) a
85− updated d = Event $ \t -> snd $ unDynamic d t
86−
87− unsafeBuildDynamic :: PullM (Pure t) a -> Event (Pure t) a -> Dynamic (Pure t) a
88− unsafeBuildDynamic readV0 v' = Dynamic $ \t -> (readV0 t, unEvent v' t)
89−
90− -- See UNUSED_CONSTRAINT, above.
91−
92− --unsafeBuildIncremental :: Patch p => PullM (Pure t) a -> Event (Pure t) (p
93− --a) -> Incremental (Pure t) p a
94− unsafeBuildIncremental readV0 p = Incremental $ \t -> (readV0 t, unEvent p t)
95−
96− mergeIncremental (Incremental f) = Event $ \t ->
97− let results = DMap.mapMaybeWithKey (\_ (Event e) -> Identity <$> e t) $ fst $ f t
98− in if DMap.null results
99− then Nothing
100− else Just results
101−
102− currentIncremental (Incremental f) = Behavior $ \t -> fst $ f t
103−
104− updatedIncremental (Incremental f) = Event $ \t -> snd $ f t
105−
106− incrementalToDynamic (Incremental f) = Dynamic $ \t ->
107− let (old, mPatch) = f t
108− e = case mPatch of
109− Nothing -> Nothing
110− Just patch -> apply patch old
111− in (old, e)
112−
113−instance Functor (Dynamic (Pure t)) where
114− fmap f d = Dynamic $ \t -> let (cur, upd) = unDynamic d t
115− in (f cur, fmap f upd)
116−
117−instance Applicative (Dynamic (Pure t)) where
118− pure a = Dynamic $ \_ -> (a, Nothing)
119− (<*>) = ap
120−
121−instance Monad (Dynamic (Pure t)) where
122− return = pure
123− (x :: Dynamic (Pure t) a) >>= (f :: a -> Dynamic (Pure t) b) = Dynamic $ \t ->
124− let (curX :: a, updX :: Maybe a) = unDynamic x t
125− (cur :: b, updOuter :: Maybe b) = unDynamic (f curX) t
126− (updInner :: Maybe b, updBoth :: Maybe b) = case updX of
127− Nothing -> (Nothing, Nothing)
128− Just nextX -> let (c, u) = unDynamic (f nextX) t
129− in (Just c, u)
130− in (cur, getFirst $ mconcat $ map First [updBoth, updOuter, updInner])
131−
132−instance MonadSample (Pure t) ((->) t) where
133−
134− sample :: Behavior (Pure t) a -> (t -> a)
135− sample = unBehavior
136−
137−instance (Enum t, HasTrie t, Ord t) => MonadHold (Pure t) ((->) t) where
138−
139− hold :: a -> Event (Pure t) a -> t -> Behavior (Pure t) a
140− hold initialValue e initialTime = Behavior f
141− where f = memo $ \sampleTime ->
142− -- Really, the sampleTime should never be prior to the initialTime,
143− -- because that would mean the Behavior is being sampled before
144− -- being created.
145− if sampleTime <= initialTime
146− then initialValue
147− else let lastTime = pred sampleTime
148− in fromMaybe (f lastTime) $ unEvent e lastTime
149−
150− holdDyn :: a -> Event (Pure t) a -> t -> Dynamic (Pure t) a
151− holdDyn initialValue e initialTime =
152− let Behavior f = hold initialValue e initialTime
153− in Dynamic $ \t -> (f t, unEvent e t)
154−
155− holdIncremental :: Patch p => a -> Event (Pure t) (p a) -> t -> Incremental (Pure t) p a
156− holdIncremental initialValue e initialTime = Incremental $ \t -> (f t, unEvent e t)
157− where f = memo $ \sampleTime ->
158− -- Really, the sampleTime should never be prior to the initialTime,
159− -- because that would mean the Behavior is being sampled before
160− -- being created.
161− if sampleTime <= initialTime
162− then initialValue
163− else let lastTime = pred sampleTime
164− lastValue = f lastTime
165− in case unEvent e lastTime of
166− Nothing -> lastValue
167− Just x -> fromMaybe lastValue $ apply x lastValue
src/Reflex/Spider.hsdeleted−10
@@ -1,10 +0,0 @@
1−-- | This module exports all of the user-facing functionality of the 'Spider'
2−-- 'Reflex' engine
3−module Reflex.Spider ( Spider
4− , SpiderEnv
5− , Global
6− , SpiderHost
7− , runSpiderHost
8− ) where
9−
10−import Reflex.Spider.Internal
src/Reflex/Spider/Internal.hsdeleted−2297
@@ -1,2297 +0,0 @@
1−{-# LANGUAGE BangPatterns #-}
2−{-# LANGUAGE CPP #-}
3−{-# LANGUAGE ConstraintKinds #-}
4−{-# LANGUAGE EmptyDataDecls #-}
5−{-# LANGUAGE ExistentialQuantification #-}
6−{-# LANGUAGE FlexibleContexts #-}
7−{-# LANGUAGE FlexibleInstances #-}
8−{-# LANGUAGE FunctionalDependencies #-}
9−{-# LANGUAGE GADTs #-}
10−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
11−{-# LANGUAGE LambdaCase #-}
12−{-# LANGUAGE MagicHash #-}
13−{-# LANGUAGE MultiParamTypeClasses #-}
14−{-# LANGUAGE MultiWayIf #-}
15−{-# LANGUAGE RankNTypes #-}
16−{-# LANGUAGE RoleAnnotations #-}
17−{-# LANGUAGE ScopedTypeVariables #-}
18−{-# LANGUAGE TypeFamilies #-}
19−{-# LANGUAGE TypeOperators #-}
20−{-# LANGUAGE UndecidableInstances #-}
21−-- | This module is the implementation of the 'Spider' 'Reflex' engine. It uses
22−-- a graph traversal algorithm to propagate 'Event's and 'Behavior's.
23−module Reflex.Spider.Internal
24− ( Spider
25− , SpiderEnv (..)
26− , Global
27− , SpiderHost
28− , runSpiderHost
29− , newSpiderEnv
30− , askSpiderEnv
31− ) where
32−
33−import Control.Applicative
34−import Control.Concurrent
35−import Control.Exception
36−import Control.Monad hiding (forM, forM_, mapM, mapM_, sequence)
37−import Control.Monad.Exception
38−import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_, sequence)
39−import Control.Monad.Primitive
40−import Control.Monad.Reader hiding (forM, forM_, mapM, mapM_, sequence)
41−import Control.Monad.Ref
42−import Data.Align
43−import Data.Coerce
44−import Data.Dependent.Map (DMap, DSum (..))
45−import qualified Data.Dependent.Map as DMap
46−import Data.Foldable hiding (concat, elem, sequence_)
47−import Data.Function
48−import Data.Functor.Compose
49−import Data.Functor.Constant
50−import Data.Functor.Product
51−import Data.GADT.Compare
52−import Data.IntMap.Strict (IntMap)
53−import qualified Data.IntMap.Strict as IntMap
54−import Data.IORef
55−import Data.List hiding (foldl')
56−import Data.Maybe
57−import Data.Monoid ((<>))
58−import Data.Some (Some)
59−import qualified Data.Some as Some
60−import Data.These
61−import Data.Traversable
62−import Data.Word
63−import GHC.IORef (IORef (..))
64−import GHC.Stack
65−import System.IO.Unsafe
66−import System.Mem.Weak
67−import Unsafe.Coerce
68−
69−#ifdef DEBUG_CYCLES
70−import Control.Monad.State hiding (forM, forM_, mapM, mapM_, sequence)
71−import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
72−import qualified Data.List.NonEmpty as NonEmpty
73−import Data.Monoid (mempty)
74−import Data.Tree (Forest, Tree (..), drawForest)
75−#endif
76−
77−import Data.WeakBag (WeakBag, WeakBagTicket)
78−import qualified Data.WeakBag as WeakBag
79−import qualified Reflex.Class as R
80−import qualified Reflex.Host.Class as R
81−
82−-- Note: must come last to silence warnings due to AMP on GHC < 7.10
83−import Prelude hiding (any, concat, mapM, mapM_, sequence)
84−
85−debugPropagate :: Bool
86−
87−debugInvalidateHeight :: Bool
88−
89−debugInvalidate :: Bool
90−
91−#ifdef DEBUG
92−
93−#define DEBUG_NODEIDS
94−
95−debugPropagate = True
96−
97−debugInvalidateHeight = False
98−
99−debugInvalidate = True
100−
101−class HasNodeId a where
102− getNodeId :: a -> Int
103−
104−instance HasNodeId (Hold x p a) where
105− getNodeId = holdNodeId
106−
107−instance HasNodeId (PushSubscribed x a b) where
108− getNodeId = pushSubscribedNodeId
109−
110−instance HasNodeId (SwitchSubscribed x a) where
111− getNodeId = switchSubscribedNodeId
112−
113−instance HasNodeId (MergeSubscribed x a) where
114− getNodeId = mergeSubscribedNodeId
115−
116−instance HasNodeId (FanSubscribed x a) where
117− getNodeId = fanSubscribedNodeId
118−
119−instance HasNodeId (CoincidenceSubscribed x a) where
120− getNodeId = coincidenceSubscribedNodeId
121−
122−instance HasNodeId (RootSubscribed x a) where
123− getNodeId = rootSubscribedNodeId
124−
125−instance HasNodeId (Pull x a) where
126− getNodeId = pullNodeId
127−
128−{-# INLINE showNodeId #-}
129−showNodeId :: HasNodeId a => a -> String
130−showNodeId = ("#"<>) . show . getNodeId
131−
132−showSubscriberType :: Subscriber x a -> String
133−showSubscriberType = \case
134− SubscriberPush _ _ -> "SubscriberPush"
135− SubscriberMerge _ _ -> "SubscriberMerge"
136− SubscriberFan _ -> "SubscriberFan"
137− SubscriberMergeChange _ -> "SubscriberMergeChange"
138− SubscriberHold _ -> "SubscriberHold"
139− SubscriberHoldIdentity _ -> "SubscriberHoldIdentity"
140− SubscriberSwitch _ -> "SubscriberSwitch"
141− SubscriberCoincidenceOuter _ -> "SubscriberCoincidenceOuter"
142− SubscriberCoincidenceInner _ -> "SubscriberCoincidenceInner"
143− SubscriberHandle -> "SubscriberHandle"
144−
145−showEventType :: Event x a -> String
146−showEventType = \case
147− EventRoot _ _ -> "EventRoot"
148− EventNever -> "EventNever"
149− EventPush _ -> "EventPush"
150− EventMerge _ -> "EventMerge"
151− EventFan _ _ -> "EventFan"
152− EventSwitch _ -> "EventSwitch"
153− EventCoincidence _ -> "EventCoincidence"
154− EventHold _ -> "EventHold"
155− EventDyn _ -> "EventDyn"
156− EventHoldIdentity _ -> "EventHoldIdentity"
157− EventDynIdentity _ -> "EventDynIdentity"
158−
159−#else
160−
161−debugPropagate = False
162−
163−debugInvalidateHeight = False
164−
165−debugInvalidate = False
166−
167−-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
168−{-# INLINE showNodeId #-}
169−showNodeId :: a -> String
170−showNodeId _ = ""
171−
172−#endif
173−
174−#ifdef DEBUG_NODEIDS
175−{-# NOINLINE nextNodeIdRef #-}
176−nextNodeIdRef :: IORef Int
177−nextNodeIdRef = unsafePerformIO $ newIORef 1
178−
179−newNodeId :: IO Int
180−newNodeId = atomicModifyIORef' nextNodeIdRef $ \n -> (succ n, n)
181−
182−{-# NOINLINE unsafeNodeId #-}
183−unsafeNodeId :: a -> Int
184−unsafeNodeId a = unsafePerformIO $ do
185− touch a
186− newNodeId
187−#endif
188−
189−--------------------------------------------------------------------------------
190−-- Event
191−--------------------------------------------------------------------------------
192−
193−newtype Event x a = Event { subscribe :: Subscriber x a -> EventM x (EventSubscription x a) }
194−
195−subscribeAndRead :: Event x a -> Subscriber x a -> EventM x (EventSubscription x a, Maybe a)
196−subscribeAndRead e sub = do
197− subscription@(EventSubscription _ subd) <- subscribe e sub
198− occ <- liftIO $ eventSubscribedRead subd
199− return (subscription, occ)
200−
201−wrap :: Monad m => (t -> EventSubscribed x a) -> (Subscriber x a -> m (WeakBagTicket (Subscriber x a), t)) -> Subscriber x a -> m (EventSubscription x a)
202−wrap tag getSpecificSubscribed sub = do
203− (sln, subd) <- getSpecificSubscribed sub
204− return $ EventSubscription (Just sln) $ tag subd
205−
206−eventRoot :: GCompare k => k a -> Root x k -> Event x a
207−eventRoot !k !r = Event $ wrap eventSubscribedRoot $ liftIO . getRootSubscribed k r
208−
209−eventNever :: Event x a
210−eventNever = Event $ \_ -> return $ EventSubscription Nothing eventSubscribedNever
211−
212−eventPush :: Push x b a -> Event x a
213−eventPush !p = Event $ wrap eventSubscribedPush $ getPushSubscribed p
214−
215−eventMerge :: (GCompare k, a ~ DMap k Identity) => Merge x k -> Event x a
216−eventMerge !m = Event $ wrap eventSubscribedMerge $ getMergeSubscribed m
217−
218−eventFan :: GCompare k => k a -> Fan x k -> Event x a
219−eventFan !k !f = Event $ wrap (eventSubscribedFan k) $ getFanSubscribed k f
220−
221−eventSwitch :: Switch x a -> Event x a
222−eventSwitch !s = Event $ wrap eventSubscribedSwitch $ getSwitchSubscribed s
223−
224−eventCoincidence :: Coincidence x a -> Event x a
225−eventCoincidence !c = Event $ wrap eventSubscribedCoincidence $ getCoincidenceSubscribed c
226−
227−eventHold :: (a ~ p b, R.Patch p) => Hold x p b -> Event x a
228−eventHold !h = Event $ subscribeHoldEvent h
229−
230−eventDyn :: (a ~ p b, R.Patch p) => Dyn x p b -> Event x a
231−eventDyn !j = Event $ \sub -> getDynHold j >>= \h -> subscribeHoldEvent h sub
232−
233−eventHoldIdentity :: (a ~ Identity b) => Hold x Identity b -> Event x a
234−eventHoldIdentity !h = Event $ subscribeHoldEvent h
235−
236−eventDynIdentity :: (a ~ Identity b) => Dyn x Identity b -> Event x a
237−eventDynIdentity !j = Event $ \sub -> getDynHold j >>= \h -> subscribeHoldEvent h sub
238−
239−{-# INLINE subscribeCoincidenceInner #-}
240−subscribeCoincidenceInner :: CanSubscribe x m => Event x a -> Height -> CoincidenceSubscribed x a -> m (Maybe a, Height, EventSubscribed x a)
241−subscribeCoincidenceInner inner outerHeight subscribedUnsafe = do
242− subInner <- liftIO $ newSubscriberCoincidenceInner subscribedUnsafe
243− (subscription@(EventSubscription _ innerSubd), innerOcc) <- subscribeAndRead inner subInner
244− innerHeight <- liftIO $ getEventSubscribedHeight innerSubd
245− let height = max innerHeight outerHeight
246− defer $ SomeResetCoincidence subscription $ if height > outerHeight then Just subscribedUnsafe else Nothing
247− return (innerOcc, height, innerSubd)
248−
249−--------------------------------------------------------------------------------
250−-- Subscriber
251−--------------------------------------------------------------------------------
252−
253−data Subscriber x a = Subscriber
254− { subscriberPropagate :: !(a -> EventM x ())
255− , subscriberInvalidateHeight :: !(Height -> IO ())
256− , subscriberRecalculateHeight :: !(Height -> IO ())
257− }
258−
259−--TODO: Move this comment to WeakBag
260−-- These function are constructor functions that are marked NOINLINE so they are
261−-- opaque to GHC. If we do not do this, then GHC will sometimes fuse the constructor away
262−-- so any weak references that are attached to the constructors will have their
263−-- finalizer run. Using the opaque constructor, does not see the
264−-- constructor application, so it behaves like an IORef and cannot be fused away.
265−--
266−-- The result is also evaluated to WHNF, since forcing a thunk invalidates
267−-- the weak pointer to it in some cases.
268−
269−newSubscriberPush :: (a -> ComputeM x (Maybe b)) -> PushSubscribed x a b -> IO (Subscriber x a)
270−newSubscriberPush compute subscribed = return $ Subscriber
271− { subscriberPropagate = \a -> {-# SCC "traversePush" #-} do
272− tracePropagate $ "SubscriberPush" <> showNodeId subscribed
273− occ <- runComputeM $ compute a
274− case occ of
275− Nothing -> return () -- No need to write a Nothing back into the Ref
276− Just o -> do
277− liftIO $ writeIORef (pushSubscribedOccurrence subscribed) occ
278− scheduleClear $ pushSubscribedOccurrence subscribed
279− propagate o $ pushSubscribedSubscribers subscribed
280− , subscriberInvalidateHeight = \old -> do
281− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
282− WeakBag.traverse (pushSubscribedSubscribers subscribed) $ invalidateSubscriberHeight old
283− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
284− , subscriberRecalculateHeight = \new -> do
285− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed
286− WeakBag.traverse (pushSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
287− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberPush" <> showNodeId subscribed <> " done"
288− }
289−
290−newSubscriberHold :: R.Patch p => Hold x p a -> IO (Subscriber x (p a))
291−newSubscriberHold h = return $ Subscriber
292− { subscriberPropagate = {-# SCC "traverseHold" #-} propagateSubscriberHold h
293− , subscriberInvalidateHeight = \_ -> return ()
294− , subscriberRecalculateHeight = \_ -> return ()
295− }
296−
297−newSubscriberMerge :: GCompare k => k a -> MergeSubscribed x k -> IO (Subscriber x a)
298−newSubscriberMerge k subscribed = return $ Subscriber
299− { subscriberPropagate = \a -> {-# SCC "traverseMerge" #-} do
300− tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
301− oldM <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
302− let newM = DMap.insertWith (error $ "Same key fired multiple times for Merge" <> showNodeId subscribed) k (Identity a) oldM
303− tracePropagate $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
304− liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! newM
305− when (DMap.null oldM) $ do -- Only schedule the firing once
306− height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
307− --TODO: assertions about height
308− currentHeight <- getCurrentHeight
309− when (height <= currentHeight) $ do
310− if height /= invalidHeight
311− then do
312− myStack <- liftIO $ whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
313− error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
314− else liftIO $ do
315−#ifdef DEBUG_CYCLES
316− nodesInvolvedInCycle <- walkInvalidHeightParents $ eventSubscribedMerge subscribed
317− stacks <- forM nodesInvolvedInCycle $ \(Some.This es) -> whoCreatedEventSubscribed es
318− let cycleInfo = ":\n" <> drawForest (listsToForest stacks)
319−#else
320− let cycleInfo = ""
321−#endif
322− error $ "Causality loop found" <> cycleInfo
323− scheduleMerge height subscribed
324− , subscriberInvalidateHeight = \old -> do
325− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
326− removeMergeHeight old subscribed
327− invalidateMergeHeight subscribed
328− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
329− , subscriberRecalculateHeight = \new -> do
330− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed
331− addMergeHeight new subscribed
332− revalidateMergeHeight subscribed
333− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberMerge" <> showNodeId subscribed <> " done"
334− }
335−
336−newSubscriberMergeChange :: GCompare k => MergeSubscribed x k -> IO (Subscriber x (R.PatchDMap (DMap k (Event x))))
337−newSubscriberMergeChange subscribed = return $ Subscriber
338− { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
339− tracePropagate $ "SubscriberMerge" <> showNodeId subscribed
340− defer $ SomeMergeUpdate a subscribed
341− , subscriberInvalidateHeight = \_ -> return ()
342− , subscriberRecalculateHeight = \_ -> return ()
343− }
344−
345−newSubscriberFan :: GCompare k => FanSubscribed x k -> IO (Subscriber x (DMap k Identity))
346−newSubscriberFan subscribed = return $ Subscriber
347− { subscriberPropagate = \a -> {-# SCC "traverseFan" #-} do
348− subs <- liftIO $ readIORef $ fanSubscribedSubscribers subscribed
349− tracePropagate $ "SubscriberFan" <> showNodeId subscribed <> ": " ++ show (DMap.size subs) ++ " keys subscribed, " ++ show (DMap.size a) ++ " keys firing"
350− let f _ (Pair (Identity v) subsubs) = do
351− propagate v $ _fanSubscribedChildren_list subsubs
352− return $ Constant ()
353− _ <- DMap.traverseWithKey f $ DMap.intersectionWithKey (\_ -> Pair) a subs --TODO: Would be nice to have DMap.traverse_
354− return ()
355− , subscriberInvalidateHeight = \old -> do
356− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
357− subscribers <- readIORef $ fanSubscribedSubscribers subscribed
358− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
359− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
360− , subscriberRecalculateHeight = \new -> do
361− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
362− subscribers <- readIORef $ fanSubscribedSubscribers subscribed
363− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
364− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
365− }
366−
367−newSubscriberSwitch :: SwitchSubscribed x a -> IO (Subscriber x a)
368−newSubscriberSwitch subscribed = return $ Subscriber
369− { subscriberPropagate = \a -> {-# SCC "traverseSwitch" #-} do
370− tracePropagate $ "SubscriberSwitch" <> showNodeId subscribed
371− liftIO $ writeIORef (switchSubscribedOccurrence subscribed) $ Just a
372− scheduleClear $ switchSubscribedOccurrence subscribed
373− propagate a $ switchSubscribedSubscribers subscribed
374− , subscriberInvalidateHeight = \_ -> do
375− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
376− oldHeight <- readIORef $ switchSubscribedHeight subscribed
377− when (oldHeight /= invalidHeight) $ do
378− writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
379− WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
380− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
381− , subscriberRecalculateHeight = \new -> do
382− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
383− updateSwitchHeight new subscribed
384− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
385− }
386−
387−newSubscriberCoincidenceOuter :: CoincidenceSubscribed x b -> IO (Subscriber x (Event x b))
388−newSubscriberCoincidenceOuter subscribed = return $ Subscriber
389− { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceOuter" #-} do
390− tracePropagate $ "SubscriberCoincidenceOuter" <> showNodeId subscribed
391− outerHeight <- liftIO $ readIORef $ coincidenceSubscribedHeight subscribed
392− tracePropagate $ " outerHeight = " <> show outerHeight
393− (occ, innerHeight, innerSubd) <- subscribeCoincidenceInner a outerHeight subscribed
394− tracePropagate $ " isJust occ = " <> show (isJust occ)
395− tracePropagate $ " innerHeight = " <> show innerHeight
396− liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
397− scheduleClear $ coincidenceSubscribedInnerParent subscribed
398− case occ of
399− Nothing -> do
400− when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
401− writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
402− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
403− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
404− Just o -> do -- Since it's already firing, no need to adjust height
405− liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
406− scheduleClear $ coincidenceSubscribedOccurrence subscribed
407− propagate o $ coincidenceSubscribedSubscribers subscribed
408− , subscriberInvalidateHeight = \_ -> do
409− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
410− invalidateCoincidenceHeight subscribed
411− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
412− , subscriberRecalculateHeight = \_ -> do
413− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
414− recalculateCoincidenceHeight subscribed
415− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
416− }
417−
418−newSubscriberCoincidenceInner :: CoincidenceSubscribed x a -> IO (Subscriber x a)
419−newSubscriberCoincidenceInner subscribed = return $ Subscriber
420− { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceInner" #-} do
421− tracePropagate $ "SubscriberCoincidenceInner" <> showNodeId subscribed
422− occ <- liftIO $ readIORef $ coincidenceSubscribedOccurrence subscribed
423− case occ of
424− Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
425− Nothing -> do
426− liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $ Just a
427− scheduleClear $ coincidenceSubscribedOccurrence subscribed
428− propagate a $ coincidenceSubscribedSubscribers subscribed
429− , subscriberInvalidateHeight = \_ -> do
430− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
431− invalidateCoincidenceHeight subscribed
432− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
433− , subscriberRecalculateHeight = \_ -> do
434− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
435− recalculateCoincidenceHeight subscribed
436− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
437− }
438−
439−invalidateSubscriberHeight :: Height -> Subscriber x a -> IO ()
440−invalidateSubscriberHeight = flip subscriberInvalidateHeight
441−
442−recalculateSubscriberHeight :: Height -> Subscriber x a -> IO ()
443−recalculateSubscriberHeight = flip subscriberRecalculateHeight
444−
445−-- | Propagate everything at the current height
446−propagate :: a -> WeakBag (Subscriber x a) -> EventM x ()
447−propagate a subscribers = withIncreasedDepth $ do
448− -- 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
449− --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
450− WeakBag.traverse subscribers $ \s -> subscriberPropagate s a
451−
452−--------------------------------------------------------------------------------
453−-- EventSubscribed
454−--------------------------------------------------------------------------------
455−
456−data EventSubscribed x a = EventSubscribed
457− { eventSubscribedSubscribe :: !(Subscriber x a -> IO (Maybe (WeakBagTicket (Subscriber x a))))
458− , eventSubscribedRead :: !(IO (Maybe a))
459− , eventSubscribedHeightRef :: {-# UNPACK #-} !(IORef Height)
460−#ifdef DEBUG_CYCLES
461− , eventSubscribedGetParents :: !(IO [Some (EventSubscribed x)]) -- For debugging loops
462− , eventSubscribedHasOwnHeightRef :: !Bool
463− , eventSubscribedWhoCreated :: !(IO [String])
464−#endif
465− }
466−
467−readEventSubscribed :: EventSubscribed x a -> IO (Maybe a)
468−readEventSubscribed = eventSubscribedRead
469−
470−subscribeEventSubscribed :: EventSubscribed x a -> Subscriber x a -> IO (Maybe (WeakBagTicket (Subscriber x a)))
471−subscribeEventSubscribed = eventSubscribedSubscribe
472−
473−eventSubscribedRoot :: RootSubscribed x a -> EventSubscribed x a
474−eventSubscribedRoot !r = EventSubscribed
475− { eventSubscribedSubscribe = \sub -> Just <$> subscribeRootSubscribed r sub
476− , eventSubscribedRead = readRootSubscribed r
477− , eventSubscribedHeightRef = zeroRef
478−#ifdef DEBUG_CYCLES
479− , eventSubscribedGetParents = return []
480− , eventSubscribedHasOwnHeightRef = False
481− , eventSubscribedWhoCreated = return ["root"]
482−#endif
483− }
484−
485−eventSubscribedNever :: EventSubscribed x a
486−eventSubscribedNever = EventSubscribed
487− { eventSubscribedSubscribe = \_ -> return Nothing
488− , eventSubscribedRead = return Nothing
489− , eventSubscribedHeightRef = zeroRef
490−#ifdef DEBUG_CYCLES
491− , eventSubscribedGetParents = return []
492− , eventSubscribedHasOwnHeightRef = False
493− , eventSubscribedWhoCreated = return ["never"]
494−#endif
495− }
496−
497−eventSubscribedPush :: PushSubscribed x b a -> EventSubscribed x a
498−eventSubscribedPush !subscribed = EventSubscribed
499− { eventSubscribedSubscribe = \sub -> Just <$> subscribePushSubscribed subscribed sub
500− , eventSubscribedRead = readPushSubscribed subscribed
501− , eventSubscribedHeightRef = pushSubscribedHeight subscribed
502−#ifdef DEBUG_CYCLES
503− , eventSubscribedGetParents = return [Some.This $ _eventSubscription_subscribed $ pushSubscribedParent subscribed]
504− , eventSubscribedHasOwnHeightRef = False
505− , eventSubscribedWhoCreated = whoCreatedIORef $ pushSubscribedCachedSubscribed subscribed
506−#endif
507− }
508−
509−eventSubscribedMerge :: a ~ DMap k Identity => MergeSubscribed x k -> EventSubscribed x a
510−eventSubscribedMerge !subscribed = EventSubscribed
511− { eventSubscribedSubscribe = \sub -> Just <$> subscribeMergeSubscribed subscribed sub
512− , eventSubscribedRead = readMergeSubscribed subscribed
513− , eventSubscribedHeightRef = mergeSubscribedHeight subscribed
514−#ifdef DEBUG_CYCLES
515− , eventSubscribedGetParents = do
516− ps <- readIORef $ mergeSubscribedParents subscribed
517− return $ R.ffor (DMap.toList ps) $ \(_ :=> v) -> Some.This $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription v
518− , eventSubscribedHasOwnHeightRef = True
519− , eventSubscribedWhoCreated = whoCreatedIORef $ mergeSubscribedCachedSubscribed subscribed
520−#endif
521− }
522−
523−eventSubscribedFan :: GCompare k => k a -> FanSubscribed x k -> EventSubscribed x a
524−eventSubscribedFan !k !subscribed = EventSubscribed
525− { eventSubscribedSubscribe = \sub -> Just <$> subscribeFanSubscribed k subscribed sub
526− , eventSubscribedRead = readFanSubscribed k subscribed
527− , eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
528−#ifdef DEBUG_CYCLES
529− , eventSubscribedGetParents = return [Some.This $ _eventSubscription_subscribed $ fanSubscribedParent subscribed]
530− , eventSubscribedHasOwnHeightRef = False
531− , eventSubscribedWhoCreated = whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
532−#endif
533− }
534−
535−eventSubscribedSwitch :: SwitchSubscribed x a -> EventSubscribed x a
536−eventSubscribedSwitch !subscribed = EventSubscribed
537− { eventSubscribedSubscribe = \sub -> Just <$> subscribeSwitchSubscribed subscribed sub
538− , eventSubscribedRead = readSwitchSubscribed subscribed
539− , eventSubscribedHeightRef = switchSubscribedHeight subscribed
540−#ifdef DEBUG_CYCLES
541− , eventSubscribedGetParents = do
542− s <- readIORef $ switchSubscribedCurrentParent subscribed
543− return [Some.This $ _eventSubscription_subscribed s]
544− , eventSubscribedHasOwnHeightRef = True
545− , eventSubscribedWhoCreated = whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
546−#endif
547− }
548−
549−eventSubscribedCoincidence :: CoincidenceSubscribed x a -> EventSubscribed x a
550−eventSubscribedCoincidence !subscribed = EventSubscribed
551− { eventSubscribedSubscribe = \sub -> Just <$> subscribeCoincidenceSubscribed subscribed sub
552− , eventSubscribedRead = readCoincidenceSubscribed subscribed
553− , eventSubscribedHeightRef = coincidenceSubscribedHeight subscribed
554−#ifdef DEBUG_CYCLES
555− , eventSubscribedGetParents = do
556− innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
557− let outerParent = Some.This $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
558− innerParents = maybeToList $ fmap Some.This innerSubscription
559− return $ outerParent : innerParents
560− , eventSubscribedHasOwnHeightRef = True
561− , eventSubscribedWhoCreated = whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
562−#endif
563− }
564−
565−getEventSubscribedHeight :: EventSubscribed x a -> IO Height
566−getEventSubscribedHeight es = readIORef $ eventSubscribedHeightRef es
567−
568−#ifdef DEBUG_CYCLES
569−whoCreatedEventSubscribed :: EventSubscribed x a -> IO [String]
570−whoCreatedEventSubscribed = eventSubscribedWhoCreated
571−
572−walkInvalidHeightParents :: EventSubscribed x a -> IO [Some (EventSubscribed x)]
573−walkInvalidHeightParents s0 = do
574− subscribers <- flip execStateT mempty $ ($ Some.This s0) $ fix $ \loop (Some.This s) -> do
575− h <- liftIO $ readIORef $ eventSubscribedHeightRef s
576− when (h == invalidHeight) $ do
577− when (eventSubscribedHasOwnHeightRef s) $ liftIO $ writeIORef (eventSubscribedHeightRef s) $! invalidHeightBeingTraversed
578− modify (Some.This s :)
579− mapM_ loop =<< liftIO (eventSubscribedGetParents s)
580− forM_ subscribers $ \(Some.This s) -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
581− return subscribers
582−#endif
583−
584−{-# INLINE subscribeHoldEvent #-}
585−subscribeHoldEvent :: (CanSubscribe x m, R.Patch p) => Hold x p a -> Subscriber x (p a) -> m (EventSubscription x (p a))
586−subscribeHoldEvent h sub = do
587− EventSubscription _ subd <- getHoldEventSubscription h
588− sln <- liftIO $ subscribeEventSubscribed subd sub
589− return $ EventSubscription sln subd
590−
591−--------------------------------------------------------------------------------
592−-- EventSubscription
593−--------------------------------------------------------------------------------
594−
595−data EventSubscription x a = EventSubscription
596− { _eventSubscription_ticket :: !(Maybe (WeakBagTicket (Subscriber x a)))
597− , _eventSubscription_subscribed :: !(EventSubscribed x a)
598− }
599−
600−unsubscribe :: EventSubscription x a -> IO ()
601−unsubscribe (EventSubscription msln _) = forM_ msln $ \sln -> WeakBag.remove sln
602−
603−--------------------------------------------------------------------------------
604−-- Combinators
605−--------------------------------------------------------------------------------
606−
607−--TODO: Figure out why certain things are not 'representational', then make them
608−--representational so we can use coerce
609−
610−--type role Hold representational
611−data Hold x p a
612− = Hold { holdValue :: !(IORef a)
613− , holdInvalidators :: !(IORef [Weak (Invalidator x)])
614− , holdParent :: !(IORef (Either (Event x (p a)) (EventSubscription x (p a)))) -- Keeps its parent alive (will be undefined until the hold is initialized) --TODO: Probably shouldn't be an IORef
615−#ifdef DEBUG_NODEIDS
616− , holdNodeId :: Int
617−#endif
618− }
619−
620−data EventEnv x
621− = EventEnv { eventEnvSpiderEnv :: !(SpiderEnv x)
622− , eventEnvAssignments :: !(IORef [SomeAssignment x]) -- Needed for Subscribe
623− , eventEnvHoldInits :: !(IORef [SomeHoldInit x]) -- Needed for Subscribe
624− , eventEnvMergeUpdates :: !(IORef [SomeMergeUpdate x])
625− , eventEnvMergeInits :: !(IORef [SomeMergeInit x]) -- Needed for Subscribe
626− , eventEnvClears :: !(IORef [SomeClear]) -- Needed for Subscribe
627− , eventEnvRootClears :: !(IORef [SomeRootClear])
628− , eventEnvCurrentHeight :: !(IORef Height) -- Needed for Subscribe
629− , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence x]) -- Needed for Subscribe
630− , eventEnvDelayedMerges :: !(IORef (IntMap [DelayedMerge x]))
631− }
632−
633−{-# INLINE runEventM #-}
634−runEventM :: EventM x a -> EventEnv x -> IO a
635−runEventM = runReaderT . unEventM
636−
637−class MonadIO m => Defer a m where
638− getDeferralQueue :: m (IORef [a])
639−
640−{-# INLINE defer #-}
641−defer :: Defer a m => a -> m ()
642−defer a = do
643− q <- getDeferralQueue
644− liftIO $ modifyIORef' q (a:)
645−
646−instance Defer (SomeAssignment x) (EventM x) where
647− {-# INLINE getDeferralQueue #-}
648− getDeferralQueue = EventM $ asks eventEnvAssignments
649−
650−instance Defer (SomeHoldInit x) (EventM x) where
651− {-# INLINE getDeferralQueue #-}
652− getDeferralQueue = EventM $ asks eventEnvHoldInits
653−
654−instance Defer (SomeHoldInit x) (BehaviorM x) where
655− {-# INLINE getDeferralQueue #-}
656− getDeferralQueue = BehaviorM $ asks snd
657−
658−instance Defer (SomeMergeUpdate x) (EventM x) where
659− {-# INLINE getDeferralQueue #-}
660− getDeferralQueue = EventM $ asks eventEnvMergeUpdates
661−
662−instance Defer (SomeMergeInit x) (EventM x) where
663− {-# INLINE getDeferralQueue #-}
664− getDeferralQueue = EventM $ asks eventEnvMergeInits
665−
666−class HasCurrentHeight x m | m -> x where
667− getCurrentHeight :: m Height
668− scheduleMerge :: Height -> MergeSubscribed x a -> m ()
669−
670−instance HasCurrentHeight x (EventM x) where
671− {-# INLINE getCurrentHeight #-}
672− getCurrentHeight = EventM $ do
673− heightRef <- asks eventEnvCurrentHeight
674− liftIO $ readIORef heightRef
675− {-# INLINE scheduleMerge #-}
676− scheduleMerge height subscribed = EventM $ do
677− delayedRef <- asks eventEnvDelayedMerges
678− liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [DelayedMerge subscribed]
679−
680−class HasSpiderEnv x m | m -> x where
681− -- | Retrieve the current SpiderEnv
682− askSpiderEnv :: m (SpiderEnv x)
683−
684−instance HasSpiderEnv x (EventM x) where
685− {-# INLINE askSpiderEnv #-}
686− askSpiderEnv = EventM $ asks eventEnvSpiderEnv
687−
688−instance HasSpiderEnv x (SpiderHost x) where
689− {-# INLINE askSpiderEnv #-}
690− askSpiderEnv = SpiderHost ask
691−
692−putCurrentHeight :: Height -> EventM x ()
693−putCurrentHeight h = EventM $ do
694− heightRef <- asks eventEnvCurrentHeight
695− liftIO $ writeIORef heightRef $! h
696−
697−instance Defer SomeClear (EventM x) where
698− {-# INLINE getDeferralQueue #-}
699− getDeferralQueue = EventM $ asks eventEnvClears
700−
701−{-# INLINE scheduleClear #-}
702−scheduleClear :: Defer SomeClear m => IORef (Maybe a) -> m ()
703−scheduleClear r = defer $ SomeClear r
704−
705−instance Defer SomeRootClear (EventM x) where
706− {-# INLINE getDeferralQueue #-}
707− getDeferralQueue = EventM $ asks eventEnvRootClears
708−
709−{-# INLINE scheduleRootClear #-}
710−scheduleRootClear :: Defer SomeRootClear m => IORef (DMap k Identity) -> m ()
711−scheduleRootClear r = defer $ SomeRootClear r
712−
713−instance Defer (SomeResetCoincidence x) (EventM x) where
714− {-# INLINE getDeferralQueue #-}
715− getDeferralQueue = EventM $ asks eventEnvResetCoincidences
716−
717−-- Note: hold cannot examine its event until after the phase is over
718−{-# SPECIALIZE hold :: R.Patch p => a -> Event x (p a) -> EventM x (Hold x p a) #-}
719−{-# SPECIALIZE hold :: R.Patch p => a -> Event x (p a) -> ComputeM x (Hold x p a) #-}
720−hold :: (R.Patch p, Defer (SomeHoldInit x) m) => a -> Event x (p a) -> m (Hold x p a)
721−hold v0 e = do
722− valRef <- liftIO $ newIORef v0
723− invsRef <- liftIO $ newIORef []
724− parentRef <- liftIO $ newIORef $ Left e
725−#ifdef DEBUG_NODEIDS
726− nodeId <- liftIO newNodeId
727−#endif
728− let h = Hold
729− { holdValue = valRef
730− , holdInvalidators = invsRef
731− , holdParent = parentRef
732−#ifdef DEBUG_NODEIDS
733− , holdNodeId = nodeId
734−#endif
735− }
736− defer $ SomeHoldInit h
737− return h
738−
739−{-# INLINE getHoldEventSubscription #-}
740−getHoldEventSubscription :: forall m p a x. (Defer (SomeAssignment x) m, Defer (SomeHoldInit x) m, Defer SomeClear m, R.Patch p, HasCurrentHeight x m, Defer (SomeMergeInit x) m, Defer (SomeResetCoincidence x) m, HasSpiderEnv x m, m ~ EventM x) => Hold x p a -> m (EventSubscription x (p a))
741−getHoldEventSubscription h = do
742− ep <- liftIO $ readIORef $ holdParent h
743− case ep of
744− Right subd -> return subd
745− Left e -> do
746− subscriptionRef <- liftIO $ newIORef $ error "getHoldEventSubscription: subdRef uninitialized"
747− (subscription@(EventSubscription _ _), occ) <- subscribeAndRead e =<< liftIO (newSubscriberHold h)
748− liftIO $ writeIORef subscriptionRef $! subscription
749− case occ of
750− Nothing -> return ()
751− Just o -> do
752− old <- liftIO $ readIORef $ holdValue h
753− case R.apply o old of
754− Nothing -> return ()
755− Just new -> do
756− -- Need to evaluate these so that we don't retain the Hold itself
757− v <- liftIO $ evaluate $ holdValue h
758− i <- liftIO $ evaluate $ holdInvalidators h
759− defer $ SomeAssignment v i new
760− liftIO $ writeIORef (holdParent h) $ Right subscription
761− return subscription
762−
763−type BehaviorEnv x = (Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]), IORef [SomeHoldInit x])
764−
765−--type role BehaviorM representational
766−-- BehaviorM can sample behaviors
767−newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderT (BehaviorEnv x) IO a } deriving (Functor, Applicative, MonadIO, MonadFix)
768−
769−instance Monad (BehaviorM x) where
770− {-# INLINE (>>=) #-}
771− BehaviorM x >>= f = BehaviorM $ x >>= unBehaviorM . f
772− {-# INLINE (>>) #-}
773− BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
774− {-# INLINE return #-}
775− return x = BehaviorM $ return x
776− {-# INLINE fail #-}
777− fail s = BehaviorM $ fail s
778−
779−data BehaviorSubscribed x a
780− = forall p. BehaviorSubscribedHold (Hold x p a)
781− | BehaviorSubscribedPull (PullSubscribed x a)
782−
783−data SomeBehaviorSubscribed x = forall a. SomeBehaviorSubscribed (BehaviorSubscribed x a)
784−
785−--type role PullSubscribed representational
786−data PullSubscribed x a
787− = PullSubscribed { pullSubscribedValue :: !a
788− , pullSubscribedInvalidators :: !(IORef [Weak (Invalidator x)])
789− , pullSubscribedOwnInvalidator :: !(Invalidator x)
790− , pullSubscribedParents :: ![SomeBehaviorSubscribed x] -- Need to keep parent behaviors alive, or they won't let us know when they're invalidated
791− }
792−
793−--type role Pull representational
794−data Pull x a
795− = Pull { pullValue :: !(IORef (Maybe (PullSubscribed x a)))
796− , pullCompute :: !(BehaviorM x a)
797−#ifdef DEBUG_NODEIDS
798− , pullNodeId :: Int
799−#endif
800− }
801−
802−data Invalidator x
803− = forall a. InvalidatorPull (Pull x a)
804− | forall a. InvalidatorSwitch (SwitchSubscribed x a)
805−
806−data RootSubscribed x a = forall k. GCompare k => RootSubscribed
807− { rootSubscribedKey :: !(k a)
808− , rootSubscribedCachedSubscribed :: !(IORef (DMap k (RootSubscribed x))) -- From the original Root
809− , rootSubscribedSubscribers :: !(WeakBag (Subscriber x a))
810− , rootSubscribedOccurrence :: !(IO (Maybe a)) -- Lookup from rootOccurrence
811− , rootSubscribedUninit :: IO ()
812− , rootSubscribedWeakSelf :: !(IORef (Weak (RootSubscribed x a))) --TODO: Can we make this a lazy non-IORef and then force it manually to avoid an indirection each time we use it?
813−#ifdef DEBUG_NODEIDS
814− , rootSubscribedNodeId :: Int
815−#endif
816− }
817−
818−data Root x (k :: * -> *)
819− = Root { rootOccurrence :: !(IORef (DMap k Identity)) -- The currently-firing occurrence of this event
820− , rootSubscribed :: !(IORef (DMap k (RootSubscribed x)))
821− , rootInit :: !(forall a. k a -> RootTrigger x a -> IO (IO ()))
822− }
823−
824−data SomeHoldInit x = forall p a. R.Patch p => SomeHoldInit !(Hold x p a)
825−
826−data SomeMergeUpdate x = forall k. GCompare k => SomeMergeUpdate (R.PatchDMap (DMap k (Event x))) (MergeSubscribed x k)
827−
828−data SomeMergeInit x = forall k. GCompare k => SomeMergeInit !(MergeSubscribed x k) !(Event x (R.PatchDMap (DMap k (Event x))))
829−
830−data SomeEventSubscription x = forall a. SomeEventSubscription (EventSubscription x a)
831−
832−-- EventM can do everything BehaviorM can, plus create holds
833−newtype EventM x (a :: *) = EventM { unEventM :: ReaderT (EventEnv x) IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadException, MonadAsyncException) -- The environment should be Nothing if we are not in a frame, and Just if we are - in which case it is a list of assignments to be done after the frame is over
834−
835−data PushSubscribed x a b
836− = PushSubscribed { pushSubscribedCachedSubscribed :: !(IORef (Maybe (PushSubscribed x a b)))
837− , pushSubscribedOccurrence :: !(IORef (Maybe b)) -- If the current height is less than our height, this should always be Nothing; during our height, this will get filled in at some point, always before our children are notified; after our height, this will be filled in with the correct value (Nothing if we are not firing, Just if we are)
838− , pushSubscribedHeight :: !(IORef Height)
839− , pushSubscribedSubscribers :: !(WeakBag (Subscriber x b))
840− , pushSubscribedSelf :: !(Subscriber x a) -- Hold this in memory to ensure our WeakReferences don't die --TODO: Probably unneeded now
841− , pushSubscribedWeakSelf :: !(IORef (Weak (PushSubscribed x a b)))
842− , pushSubscribedParent :: !(EventSubscription x a)
843−#ifdef DEBUG_NODEIDS
844− , pushSubscribedNodeId :: Int
845−#endif
846− }
847−
848−newtype ComputeM x a = ComputeM (ReaderT (IORef [SomeHoldInit x]) IO a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
849−
850−instance Defer (SomeHoldInit x) (ComputeM x) where
851− getDeferralQueue = ComputeM ask
852−
853−{-# SPECIALIZE runComputeM :: ComputeM x a -> EventM x a #-}
854−runComputeM :: Defer (SomeHoldInit x) m => ComputeM x a -> m a
855−runComputeM (ComputeM a) = liftIO . runReaderT a =<< getDeferralQueue
856−
857−data Push x a b
858− = Push { pushCompute :: !(a -> ComputeM x (Maybe b)) -- Compute the current firing value; assumes that its parent has been computed --TODO: This only uses Defer SomeHoldInit EventM; perhaps only the hold init queue should be passed in (also, perhaps those hold inits can be accelerated - can there be a loop we would need to worry about?)
859− , pushParent :: !(Event x a)
860− , pushSubscribed :: !(IORef (Maybe (PushSubscribed x a b))) --TODO: Can we replace this with an unsafePerformIO thunk?
861− }
862−
863−data MergeSubscribedParent (x :: *) k a = MergeSubscribedParent !(EventSubscription x a) !(Subscriber x a)
864−
865−mergeSubscribedParentSubscription :: MergeSubscribedParent x k a -> EventSubscription x a
866−mergeSubscribedParentSubscription (MergeSubscribedParent es _) = es
867−
868−data HeightBag = HeightBag
869− { _heightBag_size :: {-# UNPACK #-} !Int
870− , _heightBag_contents :: !(IntMap Word) -- Number of excess in each bucket
871− }
872− deriving (Show, Read, Eq, Ord)
873−
874−heightBagEmpty :: HeightBag
875−heightBagEmpty = heightBagVerify $ HeightBag 0 IntMap.empty
876−
877−heightBagSize :: HeightBag -> Int
878−heightBagSize = _heightBag_size
879−
880−heightBagFromList :: [Height] -> HeightBag
881−heightBagFromList heights = heightBagVerify $ foldl' (flip heightBagAdd) heightBagEmpty heights
882−
883−heightBagAdd :: Height -> HeightBag -> HeightBag
884−heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
885−
886−heightBagRemove :: Height -> HeightBag -> HeightBag
887−heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.lookup h c of
888− Nothing -> error $ "heightBagRemove: Height " <> show h <> " not present in bag " <> show b
889− Just old -> HeightBag (pred s) $ case old of
890− 0 -> IntMap.delete h c
891− _ -> IntMap.insert h (pred old) c
892−
893−heightBagMax :: HeightBag -> Height
894−heightBagMax (HeightBag _ c) = case IntMap.maxViewWithKey c of
895− Just ((h, _), _) -> Height h
896− Nothing -> zeroHeight
897−
898−heightBagVerify :: HeightBag -> HeightBag
899−#ifdef DEBUG
900−heightBagVerify b@(HeightBag s c) = if
901− | s /= IntMap.size c + fromIntegral (sum (IntMap.elems c))
902− -> error $ "heightBagVerify: size doesn't match: " <> show b
903− | unHeight invalidHeight `IntMap.member` c
904− -> error $ "heightBagVerify: contains invalid height: " <> show b
905− | otherwise -> b
906−#else
907−heightBagVerify = id
908−#endif
909−
910−data MergeSubscribed x k
911− = MergeSubscribed { mergeSubscribedCachedSubscribed :: !(IORef (Maybe (MergeSubscribed x k))) -- From the original merge
912− , mergeSubscribedOccurrence :: !(IORef (Maybe (DMap k Identity)))
913− , mergeSubscribedAccum :: !(IORef (DMap k Identity)) -- This will accumulate occurrences until our height is reached, at which point it will be transferred to mergeSubscribedOccurrence
914− , mergeSubscribedHeight :: !(IORef Height)
915− , mergeSubscribedHeightBag :: !(IORef HeightBag)
916− , mergeSubscribedSubscribers :: !(WeakBag (Subscriber x (DMap k Identity)))
917− , mergeSubscribedChange :: !(IORef (Subscriber x (R.PatchDMap (DMap k (Event x))), EventSubscribed x (R.PatchDMap (DMap k (Event x)))))
918− , mergeSubscribedParents :: !(IORef (DMap k (MergeSubscribedParent x k)))
919− , mergeSubscribedWeakSelf :: !(IORef (Weak (MergeSubscribed x k)))
920−#ifdef DEBUG_NODEIDS
921− , mergeSubscribedNodeId :: Int
922−#endif
923− }
924−
925−--TODO: DMap sucks; we should really write something better (with a functor for the value as well as the key)
926−data Merge x k
927− = Merge { mergeParents :: !(Dynamic x R.PatchDMap (DMap k (Event x)))
928− , mergeSubscribed :: !(IORef (Maybe (MergeSubscribed x k)))
929− }
930−
931−data FanSubscribedChildren (x :: *) k a = FanSubscribedChildren
932− { _fanSubscribedChildren_list :: !(WeakBag (Subscriber x a))
933− , _fanSubscribedChildren_self :: {-# NOUNPACK #-} !(k a, FanSubscribed x k)
934− , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed x k)))
935− }
936−
937−data FanSubscribed (x :: *) k
938− = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed x k)))
939− , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren x k))) -- This DMap should never be empty
940− , fanSubscribedParent :: !(EventSubscription x (DMap k Identity))
941−#ifdef DEBUG_NODEIDS
942− , fanSubscribedNodeId :: Int
943−#endif
944− }
945−
946−data Fan x k
947− = Fan { fanParent :: !(Event x (DMap k Identity))
948− , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k)))
949− }
950−
951−data SwitchSubscribed x a
952− = SwitchSubscribed { switchSubscribedCachedSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
953− , switchSubscribedOccurrence :: !(IORef (Maybe a))
954− , switchSubscribedHeight :: !(IORef Height)
955− , switchSubscribedSubscribers :: !(WeakBag (Subscriber x a))
956− , switchSubscribedOwnInvalidator :: {-# NOUNPACK #-} !(Invalidator x)
957− , switchSubscribedOwnWeakInvalidator :: !(IORef (Weak (Invalidator x)))
958− , switchSubscribedBehaviorParents :: !(IORef [SomeBehaviorSubscribed x])
959− , switchSubscribedParent :: !(Behavior x (Event x a))
960− , switchSubscribedCurrentParent :: !(IORef (EventSubscription x a))
961− , switchSubscribedWeakSelf :: !(IORef (Weak (SwitchSubscribed x a)))
962−#ifdef DEBUG_NODEIDS
963− , switchSubscribedNodeId :: Int
964−#endif
965− }
966−
967−data Switch x a
968− = Switch { switchParent :: !(Behavior x (Event x a))
969− , switchSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
970− }
971−
972−{-# ANN CoincidenceSubscribed "HLint: ignore Redundant bracket" #-}
973−data CoincidenceSubscribed x a
974− = CoincidenceSubscribed { coincidenceSubscribedCachedSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
975− , coincidenceSubscribedOccurrence :: !(IORef (Maybe a))
976− , coincidenceSubscribedSubscribers :: !(WeakBag (Subscriber x a))
977− , coincidenceSubscribedHeight :: !(IORef Height)
978− , coincidenceSubscribedOuter :: {-# NOUNPACK #-} (Subscriber x (Event x a))
979− , coincidenceSubscribedOuterParent :: !(EventSubscription x (Event x a))
980− , coincidenceSubscribedInnerParent :: !(IORef (Maybe (EventSubscribed x a)))
981− , coincidenceSubscribedWeakSelf :: !(IORef (Weak (CoincidenceSubscribed x a)))
982−#ifdef DEBUG_NODEIDS
983− , coincidenceSubscribedNodeId :: Int
984−#endif
985− }
986−
987−data Coincidence x a
988− = Coincidence { coincidenceParent :: !(Event x (Event x a))
989− , coincidenceSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
990− }
991−
992−{-# NOINLINE newInvalidatorSwitch #-}
993−newInvalidatorSwitch :: SwitchSubscribed x a -> IO (Invalidator x)
994−newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
995−
996−{-# NOINLINE newInvalidatorPull #-}
997−newInvalidatorPull :: Pull x a -> IO (Invalidator x)
998−newInvalidatorPull p = return $! InvalidatorPull p
999−
1000−data Dynamic x p a
1001− = DynamicHold !(Hold x p a)
1002− | p ~ Identity => DynamicHoldIdentity !(Hold x Identity a)
1003− | DynamicConst !a
1004− | DynamicDyn !(Dyn x p a)
1005− | p ~ Identity => DynamicDynIdentity !(Dyn x Identity a)
1006−
1007−{-# INLINE current #-}
1008−current :: R.Patch p => Dynamic x p a -> Behavior x a
1009−current = \case
1010− DynamicHold h -> BehaviorHold h
1011− DynamicHoldIdentity h -> BehaviorHoldIdentity h
1012− DynamicConst a -> BehaviorConst a
1013− DynamicDyn d -> BehaviorDyn d
1014− DynamicDynIdentity d -> BehaviorDynIdentity d
1015−
1016−--TODO: If you only need updated, not current, can we avoid actually constructing the Hold?
1017−{-# INLINE updated #-}
1018−updated :: R.Patch p => Dynamic x p a -> Event x (p a)
1019−updated = \case
1020− DynamicHold h -> eventHold h
1021− DynamicHoldIdentity h -> eventHoldIdentity h
1022− DynamicConst _ -> eventNever
1023− DynamicDyn d -> eventDyn d
1024− DynamicDynIdentity d -> eventDynIdentity d
1025−
1026−newMapDyn :: (a -> b) -> Dynamic x Identity a -> Dynamic x Identity b
1027−newMapDyn f d = DynamicDynIdentity $ unsafeDyn (fmap f $ readBehaviorTracked $ current d) (Identity . f . runIdentity <$> updated d)
1028−
1029−instance Functor (Dynamic x Identity) where
1030− fmap = newMapDyn
1031−
1032−instance Applicative (Dynamic x Identity) where
1033− pure = DynamicConst
1034− (<*>) = zipDynWith ($)
1035− _ *> b = b
1036− a <* _ = a
1037−
1038−instance R.FunctorMaybe (Event x) where
1039− fmapMaybe f = push $ return . f
1040−
1041−instance Align (Event x) where
1042− nil = eventNever
1043− align ea eb = R.fmapMaybe R.dmapToThese $ merge $ DynamicConst $ DMap.fromList [R.LeftTag :=> ea, R.RightTag :=> eb]
1044−
1045−--TODO: Avoid the duplication between this and R.zipDynWith
1046−zipDynWith :: (a -> b -> c) -> Dynamic x Identity a -> Dynamic x Identity b -> Dynamic x Identity c
1047−zipDynWith f da db =
1048− let eab = align (updated da) (updated db)
1049− ec = flip push eab $ \o -> do
1050− (a, b) <- case o of
1051− This (Identity a) -> do
1052− b <- readBehaviorUntracked $ current db
1053− return (a, b)
1054− That (Identity b) -> do
1055− a <- readBehaviorUntracked $ current da
1056− return (a, b)
1057− These (Identity a) (Identity b) -> return (a, b)
1058− return $ Just $ Identity $ f a b
1059− in DynamicDynIdentity $ unsafeDyn (f <$> readBehaviorUntracked (current da) <*> readBehaviorUntracked (current db)) ec
1060−
1061−instance Monad (Dynamic x Identity) where
1062− {-# INLINE return #-}
1063− return = pure
1064− {-# INLINE (>>=) #-}
1065− x >>= f = DynamicDynIdentity $ newJoinDyn $ newMapDyn f x --TODO: (>>), fail
1066− {-# INLINE (>>) #-}
1067− _ >> y = y
1068− {-# INLINE fail #-}
1069− fail _ = error "Dynamic does not support 'fail'"
1070−
1071−newtype Dyn x p a = Dyn { unDyn :: IORef (Either (BehaviorM x a, Event x (p a)) (Hold x p a)) }
1072−
1073−unsafeDyn :: BehaviorM x a -> Event x (p a) -> Dyn x p a
1074−unsafeDyn readV0 v' = Dyn $ unsafeNewIORef x $ Left x
1075− where x = (readV0, v')
1076−
1077−newJoinDyn :: Dynamic x Identity (Dynamic x Identity a) -> Dyn x Identity a
1078−newJoinDyn d =
1079− let readV0 = readBehaviorTracked . current =<< readBehaviorTracked (current d)
1080− eOuter = push (fmap (Just . Identity) . readBehaviorUntracked . current . runIdentity) $ updated d
1081− eInner = switch $ updated <$> current d
1082− eBoth = coincidence $ updated . runIdentity <$> updated d
1083− v' = unSpiderEvent $ R.leftmost $ map SpiderEvent [eBoth, eOuter, eInner]
1084− in unsafeDyn readV0 v'
1085−
1086−--type role Behavior representational
1087−data Behavior x a
1088− = forall p. BehaviorHold !(Hold x p a)
1089− | BehaviorHoldIdentity !(Hold x Identity a)
1090− | BehaviorConst !a
1091− | BehaviorPull !(Pull x a)
1092− | BehaviorDynIdentity !(Dyn x Identity a)
1093− | forall p. R.Patch p => BehaviorDyn !(Dyn x p a)
1094−
1095−-- ResultM can read behaviors and events
1096−type ResultM = EventM
1097−
1098−{-# NOINLINE unsafeNewIORef #-}
1099−unsafeNewIORef :: a -> b -> IORef b
1100−unsafeNewIORef _ b = unsafePerformIO $ newIORef b
1101−
1102−instance Functor (Event x) where
1103− fmap f = push $ return . Just . f
1104−
1105−instance Functor (Behavior x) where
1106− fmap f = pull . fmap f . readBehaviorTracked
1107−
1108−{-# NOINLINE push #-} --TODO: If this is helpful, we can get rid of the unsafeNewIORef and use unsafePerformIO directly
1109−push :: (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
1110−push f e = eventPush $ Push
1111− { pushCompute = f
1112− , pushParent = e
1113− , pushSubscribed = unsafeNewIORef (f, e) Nothing --TODO: Does the use of the tuple here create unnecessary overhead?
1114− }
1115−-- DISABLED: {- RULES "push/push" forall f g e. push f (push g e) = push (maybe (return Nothing) f <=< g) e #-}
1116−
1117−{-# NOINLINE pull #-}
1118−pull :: BehaviorM x a -> Behavior x a
1119−pull a = BehaviorPull $ Pull
1120− { pullCompute = a
1121− , pullValue = unsafeNewIORef a Nothing
1122−#ifdef DEBUG_NODEIDS
1123− , pullNodeId = unsafeNodeId a
1124−#endif
1125− }
1126−
1127−{-# NOINLINE switch #-}
1128−switch :: Behavior x (Event x a) -> Event x a
1129−switch a = eventSwitch $ Switch
1130− { switchParent = a
1131− , switchSubscribed = unsafeNewIORef a Nothing
1132− }
1133−
1134−coincidence :: Event x (Event x a) -> Event x a
1135−coincidence a = eventCoincidence $ Coincidence
1136− { coincidenceParent = a
1137− , coincidenceSubscribed = unsafeNewIORef a Nothing
1138− }
1139−
1140−-- Propagate the given event occurrence; before cleaning up, run the given action, which may read the state of events and behaviors
1141−run :: [DSum (RootTrigger x) Identity] -> ResultM x b -> SpiderHost x b
1142−run roots after = do
1143− tracePropagate $ "Running an event frame with " <> show (length roots) <> " events"
1144− spiderEnv <- SpiderHost ask
1145− result <- SpiderHost $ lift $ withMVar (_spiderEnv_lock spiderEnv) $ \_ -> flip runReaderT spiderEnv $ unSpiderHost $ runFrame $ do
1146− rootsToPropagate <- forM roots $ \r@(RootTrigger (_, occRef, k) :=> a) -> do
1147− occBefore <- liftIO $ do
1148− occBefore <- readIORef occRef
1149− writeIORef occRef $! DMap.insert k a occBefore
1150− return occBefore
1151− if DMap.null occBefore
1152− then do scheduleRootClear occRef
1153− return $ Just r
1154− else return Nothing
1155− forM_ (catMaybes rootsToPropagate) $ \(RootTrigger (subscribersRef, _, _) :=> Identity a) -> do
1156− propagate a subscribersRef
1157− delayedRef <- EventM $ asks eventEnvDelayedMerges
1158− let go = do
1159− delayed <- liftIO $ readIORef delayedRef
1160− case IntMap.minViewWithKey delayed of
1161− Nothing -> return ()
1162− Just ((currentHeight, cur), future) -> do
1163− tracePropagate $ "Running height " ++ show currentHeight
1164− putCurrentHeight $ Height currentHeight
1165− liftIO $ writeIORef delayedRef $! future
1166− forM_ cur $ \d -> case d of
1167− DelayedMerge subscribed -> do
1168− height <- liftIO $ readIORef $ mergeSubscribedHeight subscribed
1169− case height `compare` Height currentHeight of
1170− LT -> error "Somehow a merge's height has been decreased after it was scheduled"
1171− GT -> scheduleMerge height subscribed -- The height has been increased (by a coincidence event; TODO: is this the only way?)
1172− EQ -> do
1173− m <- liftIO $ readIORef $ mergeSubscribedAccum subscribed
1174− liftIO $ writeIORef (mergeSubscribedAccum subscribed) $! DMap.empty
1175− --TODO: Assert that m is not empty
1176− liftIO $ writeIORef (mergeSubscribedOccurrence subscribed) $ Just m
1177− scheduleClear $ mergeSubscribedOccurrence subscribed
1178− propagate m $ mergeSubscribedSubscribers subscribed
1179− go
1180− go
1181− putCurrentHeight maxBound
1182− after
1183− tracePropagate "Done running an event frame"
1184− return result
1185−
1186−data SomeClear = forall a. SomeClear (IORef (Maybe a))
1187−
1188−data SomeRootClear = forall k. SomeRootClear (IORef (DMap k Identity))
1189−
1190−data SomeAssignment x = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak (Invalidator x)]) a
1191−
1192−data DelayedMerge x = forall k. DelayedMerge (MergeSubscribed x k)
1193−
1194−debugFinalize :: Bool
1195−debugFinalize = False
1196−
1197−mkWeakPtrWithDebug :: a -> String -> IO (Weak a)
1198−mkWeakPtrWithDebug x debugNote = do
1199− x' <- evaluate x
1200− mkWeakPtr x' $
1201− if debugFinalize
1202− then Just $ putStrLn $ "finalizing: " ++ debugNote
1203− else Nothing
1204−
1205−type WeakList a = [Weak a]
1206−
1207−{-# INLINE withIncreasedDepth #-}
1208−#ifdef DEBUG
1209−withIncreasedDepth :: CanTrace x m => m a -> m a
1210−withIncreasedDepth a = do
1211− spiderEnv <- askSpiderEnv
1212− liftIO $ modifyIORef' (_spiderEnv_depth spiderEnv) succ
1213− result <- a
1214− liftIO $ modifyIORef' (_spiderEnv_depth spiderEnv) pred
1215− return result
1216−#else
1217−withIncreasedDepth :: m a -> m a
1218−withIncreasedDepth = id
1219−#endif
1220−
1221−type CanTrace x m = (HasSpiderEnv x m, MonadIO m)
1222−
1223−{-# INLINE tracePropagate #-}
1224−tracePropagate :: (CanTrace x m) => String -> m ()
1225−tracePropagate = traceWhen debugPropagate
1226−
1227−{-# INLINE traceInvalidate #-}
1228−traceInvalidate :: String -> IO ()
1229−traceInvalidate = when debugInvalidate . liftIO . putStrLn
1230−
1231−{-# INLINE traceWhen #-}
1232−traceWhen :: (CanTrace x m) => Bool -> String -> m ()
1233−traceWhen b message = traceMWhen b $ return message
1234−
1235−{-# INLINE traceMWhen #-}
1236−traceMWhen :: (CanTrace x m) => Bool -> m String -> m ()
1237−traceMWhen b getMessage = when b $ do
1238− message <- getMessage
1239−#ifdef DEBUG
1240− spiderEnv <- askSpiderEnv
1241− d <- liftIO $ readIORef $ _spiderEnv_depth spiderEnv
1242−#else
1243− let d = 0
1244−#endif
1245− liftIO $ putStrLn $ replicate d ' ' <> message
1246−
1247−whoCreatedIORef :: IORef a -> IO [String]
1248−whoCreatedIORef (IORef a) = whoCreated $! a
1249−
1250−#ifdef DEBUG_CYCLES
1251−groupByHead :: Eq a => [NonEmpty a] -> [(a, NonEmpty [a])]
1252−groupByHead = \case
1253− [] -> []
1254− (x :| xs) : t -> case groupByHead t of
1255− [] -> [(x, xs :| [])]
1256− l@((y, yss) : t')
1257− | x == y -> (x, xs `NonEmpty.cons` yss) : t'
1258− | otherwise -> (x, xs :| []) : l
1259−
1260−listsToForest :: Eq a => [[a]] -> Forest a
1261−listsToForest l = fmap (\(a, l') -> Node a $ listsToForest $ toList l') $ groupByHead $ catMaybes $ fmap nonEmpty l
1262−#endif
1263−
1264−{-# INLINE propagateSubscriberHold #-}
1265−propagateSubscriberHold :: R.Patch p => Hold x p a -> p a -> EventM x ()
1266−propagateSubscriberHold h a = do
1267− {-# SCC "trace" #-} traceMWhen debugPropagate $ liftIO $ do
1268− invalidators <- liftIO $ readIORef $ holdInvalidators h
1269− return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
1270− v <- {-# SCC "read" #-} liftIO $ readIORef $ holdValue h
1271− case {-# SCC "apply" #-} R.apply a v of
1272− Nothing -> return ()
1273− Just v' -> do
1274− {-# SCC "trace2" #-} withIncreasedDepth $ tracePropagate $ "propagateSubscriberHold: assigning Hold" <> showNodeId h
1275− vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
1276− iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
1277− defer $ {-# SCC "assignment" #-} SomeAssignment vRef iRef v'
1278−
1279−data SomeResetCoincidence x = forall a. SomeResetCoincidence !(EventSubscription x a) !(Maybe (CoincidenceSubscribed x a)) -- The CoincidenceSubscriber will be present only if heights need to be reset
1280−
1281−{-# SPECIALIZE readBehaviorUntracked :: Behavior x a -> BehaviorM x a #-}
1282−{-# SPECIALIZE readBehaviorUntracked :: Behavior x a -> EventM x a #-}
1283−readBehaviorUntracked :: Defer (SomeHoldInit x) m => Behavior x a -> m a
1284−readBehaviorUntracked b = do
1285− holdInits <- getDeferralQueue
1286− liftIO $ runBehaviorM (readBehaviorTracked b) Nothing holdInits --TODO: Specialize readBehaviorTracked to the Nothing and Just cases
1287−
1288−runBehaviorM :: BehaviorM x a -> Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]) -> IORef [SomeHoldInit x] -> IO a
1289−runBehaviorM a mwi holdInits = runReaderT (unBehaviorM a) (mwi, holdInits)
1290−
1291−askInvalidator :: BehaviorM x (Maybe (Weak (Invalidator x)))
1292−askInvalidator = do
1293− (!m, _) <- BehaviorM ask
1294− case m of
1295− Nothing -> return Nothing
1296− Just (!wi, _) -> return $ Just wi
1297−
1298−askParentsRef :: BehaviorM x (Maybe (IORef [SomeBehaviorSubscribed x]))
1299−askParentsRef = do
1300− (!m, _) <- BehaviorM ask
1301− case m of
1302− Nothing -> return Nothing
1303− Just (_, !p) -> return $ Just p
1304−
1305−askBehaviorHoldInits :: BehaviorM x (IORef [SomeHoldInit x])
1306−askBehaviorHoldInits = do
1307− (_, !his) <- BehaviorM ask
1308− return his
1309−
1310−readBehaviorTracked :: Behavior x a -> BehaviorM x a
1311−readBehaviorTracked b = case b of
1312− BehaviorHold h -> readHoldTracked h
1313− BehaviorHoldIdentity h -> readHoldTracked h
1314− BehaviorConst a -> return a
1315− BehaviorPull p -> do
1316− val <- liftIO $ readIORef $ pullValue p
1317− case val of
1318− Just subscribed -> do
1319− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
1320− askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (pullSubscribedInvalidators subscribed) (wi:))
1321− liftIO $ touch $ pullSubscribedOwnInvalidator subscribed
1322− return $ pullSubscribedValue subscribed
1323− Nothing -> do
1324− i <- liftIO $ newInvalidatorPull p
1325− wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorPull"
1326− parentsRef <- liftIO $ newIORef []
1327− holdInits <- askBehaviorHoldInits
1328− a <- liftIO $ runReaderT (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
1329− invsRef <- liftIO . newIORef . maybeToList =<< askInvalidator
1330− parents <- liftIO $ readIORef parentsRef
1331− let subscribed = PullSubscribed
1332− { pullSubscribedValue = a
1333− , pullSubscribedInvalidators = invsRef
1334− , pullSubscribedOwnInvalidator = i
1335− , pullSubscribedParents = parents
1336− }
1337− liftIO $ writeIORef (pullValue p) $ Just subscribed
1338− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
1339− return a
1340− BehaviorDyn d -> readHoldTracked =<< getDynHold d
1341− BehaviorDynIdentity d -> readHoldTracked =<< getDynHold d
1342−
1343−{-# INLINE readHoldTracked #-}
1344−readHoldTracked :: Hold x p a -> BehaviorM x a
1345−readHoldTracked h = do
1346− result <- liftIO $ readIORef $ holdValue h
1347− askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (holdInvalidators h) (wi:))
1348− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedHold h) :))
1349− return result
1350−
1351−{-# INLINE getDynHold #-}
1352−getDynHold :: (Defer (SomeHoldInit x) m, R.Patch p) => Dyn x p a -> m (Hold x p a)
1353−getDynHold d = do
1354− mh <- liftIO $ readIORef $ unDyn d
1355− case mh of
1356− Right h -> return h
1357− Left (readV0, v') -> do
1358− holdInits <- getDeferralQueue
1359− v0 <- liftIO $ runBehaviorM readV0 Nothing holdInits
1360− h <- hold v0 v'
1361− liftIO $ writeIORef (unDyn d) $ Right h
1362− return h
1363−
1364−readRootSubscribed :: RootSubscribed x a -> IO (Maybe a)
1365−readRootSubscribed = rootSubscribedOccurrence
1366−
1367−readPushSubscribed :: PushSubscribed x b a -> IO (Maybe a)
1368−readPushSubscribed subscribed = do
1369− result <- readIORef $ pushSubscribedOccurrence subscribed -- Since ResultM is always called after the final height is reached, this will always be valid
1370− touch $ pushSubscribedSelf subscribed
1371− return result
1372−
1373−readMergeSubscribed :: MergeSubscribed x k -> IO (Maybe (DMap k Identity))
1374−readMergeSubscribed subscribed = do
1375− result <- readIORef $ mergeSubscribedOccurrence subscribed
1376− touch $ mergeSubscribedParents subscribed
1377− return result
1378−
1379−readFanSubscribed :: GCompare k => k a -> FanSubscribed x k -> IO (Maybe a)
1380−readFanSubscribed k fs = do
1381− parentOcc <- readEventSubscribed $ _eventSubscription_subscribed $ fanSubscribedParent fs
1382− return $ coerce $ DMap.lookup k =<< parentOcc
1383−
1384−readSwitchSubscribed :: SwitchSubscribed x a -> IO (Maybe a)
1385−readSwitchSubscribed subscribed = do
1386− result <- readIORef $ switchSubscribedOccurrence subscribed
1387− touch $ switchSubscribedOwnInvalidator subscribed
1388− return result
1389−
1390−readCoincidenceSubscribed :: CoincidenceSubscribed x a -> IO (Maybe a)
1391−readCoincidenceSubscribed subscribed = do
1392− result <- readIORef $ coincidenceSubscribedOccurrence subscribed
1393− touch $ coincidenceSubscribedOuter subscribed
1394− --TODO: do we need to touch the inner subscriber?
1395− return result
1396−
1397−-- Always refers to 0
1398−{-# NOINLINE zeroRef #-}
1399−zeroRef :: IORef Height
1400−zeroRef = unsafePerformIO $ newIORef zeroHeight
1401−
1402−type CanSubscribe x m =
1403− ( HasSpiderEnv x m
1404− , HasCurrentHeight x m
1405− , Defer (SomeHoldInit x) m, Defer (SomeMergeInit x) m -- The things we need to lazily initialize state
1406− , Defer SomeClear m -- Wiping out event firings
1407− , Defer (SomeAssignment x) m -- Updating state
1408− , Defer (SomeResetCoincidence x) m
1409− , m ~ EventM x
1410− )
1411−
1412−getRootSubscribed :: GCompare k => k a -> Root x k -> Subscriber x a -> IO (WeakBagTicket (Subscriber x a), RootSubscribed x a)
1413−getRootSubscribed k r sub = do
1414− mSubscribed <- readIORef $ rootSubscribed r
1415− case DMap.lookup k mSubscribed of
1416− Just subscribed -> {-# SCC "hitRoot" #-} do
1417− sln <- subscribeRootSubscribed subscribed sub
1418− return (sln, subscribed)
1419− Nothing -> {-# SCC "missRoot" #-} do
1420− weakSelf <- newIORef $ error "getRootSubscribed: weakSelfRef not initialized"
1421− let !cached = rootSubscribed r
1422− uninitRef <- newIORef $ error "getRootsubscribed: uninitRef not initialized"
1423− (subs, sln) <- WeakBag.singleton sub weakSelf cleanupRootSubscribed
1424− when debugPropagate $ putStrLn $ "getRootSubscribed: calling rootInit"
1425− uninit <- rootInit r k $ RootTrigger (subs, rootOccurrence r, k)
1426− writeIORef uninitRef $! uninit
1427− let subscribed = RootSubscribed
1428− { rootSubscribedKey = k
1429− , rootSubscribedCachedSubscribed = cached
1430− , rootSubscribedOccurrence = fmap (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
1431− , rootSubscribedSubscribers = subs
1432− , rootSubscribedUninit = uninit
1433− , rootSubscribedWeakSelf = weakSelf
1434−#ifdef DEBUG_NODEIDS
1435− , rootSubscribedNodeId = unsafeNodeId (k, r, subs)
1436−#endif
1437− }
1438− writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "RootSubscribed"
1439− modifyIORef' (rootSubscribed r) $ DMap.insertWith (error $ "getRootSubscribed: duplicate key inserted into Root") k subscribed --TODO: I think we can just write back mSubscribed rather than re-reading it
1440− return (sln, subscribed)
1441−
1442−{-# ANN cleanupRootSubscribed "HLint: ignore Redundant bracket" #-}
1443−cleanupRootSubscribed :: RootSubscribed x a -> IO ()
1444−cleanupRootSubscribed self@(RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached }) = do
1445− rootSubscribedUninit self
1446− modifyIORef' cached $ DMap.delete k
1447−
1448−{-# INLINE subscribeRootSubscribed #-}
1449−subscribeRootSubscribed :: RootSubscribed x a -> Subscriber x a -> IO (WeakBagTicket (Subscriber x a))
1450−subscribeRootSubscribed subscribed sub = WeakBag.insert sub (rootSubscribedSubscribers subscribed) (rootSubscribedWeakSelf subscribed) cleanupRootSubscribed
1451−
1452−-- When getPushSubscribed returns, the PushSubscribed returned will have a fully filled-in
1453−{-# SPECIALIZE getPushSubscribed :: Push x a b -> Subscriber x b -> EventM x (WeakBagTicket (Subscriber x b), PushSubscribed x a b) #-}
1454−getPushSubscribed :: CanSubscribe x m => Push x a b -> Subscriber x b -> m (WeakBagTicket (Subscriber x b), PushSubscribed x a b)
1455−getPushSubscribed p sub = do
1456− mSubscribed <- liftIO $ readIORef $ pushSubscribed p
1457− case mSubscribed of
1458− Just subscribed -> {-# SCC "hitPush" #-} do
1459− sln <- liftIO $ subscribePushSubscribed subscribed sub
1460− return (sln, subscribed)
1461− Nothing -> {-# SCC "missPush" #-} do -- Not yet subscribed
1462− subscribedRef <- liftIO $ newIORef $ error "getPushSubscribed: subscribed not yet intialized"
1463− subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1464− s <- liftIO $ newSubscriberPush (pushCompute p) subscribedUnsafe
1465− (subscription@(EventSubscription _ subd), parentOcc) <- subscribeAndRead (pushParent p) s
1466− occ <- runComputeM $ join <$> mapM (pushCompute p) parentOcc
1467− occRef <- liftIO $ newIORef occ
1468− when (isJust occ) $ scheduleClear occRef
1469− weakSelf <- liftIO $ newIORef $ error "getPushSubscribed: weakSelf not initialized"
1470− let !cached = pushSubscribed p
1471− (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupPushSubscribed
1472− let subscribed = PushSubscribed
1473− { pushSubscribedCachedSubscribed = cached
1474− , pushSubscribedOccurrence = occRef
1475− , pushSubscribedHeight = eventSubscribedHeightRef subd -- Since pushes have the same height as their parents, share the ref
1476− , pushSubscribedSubscribers = subs
1477− , pushSubscribedSelf = s
1478− , pushSubscribedWeakSelf = weakSelf
1479− , pushSubscribedParent = subscription
1480−#ifdef DEBUG_NODEIDS
1481− , pushSubscribedNodeId = unsafeNodeId p
1482−#endif
1483− }
1484− liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "PushSubscribed"
1485− liftIO $ writeIORef subscribedRef $! subscribed
1486− liftIO $ writeIORef (pushSubscribed p) $ Just subscribed
1487− return (sln, subscribed)
1488−
1489−cleanupPushSubscribed :: PushSubscribed x a b -> IO ()
1490−cleanupPushSubscribed self = do
1491− unsubscribe $ pushSubscribedParent self
1492− writeIORef (pushSubscribedCachedSubscribed self) $ Nothing
1493−
1494−{-# INLINE subscribePushSubscribed #-}
1495−subscribePushSubscribed :: PushSubscribed x a b -> Subscriber x b -> IO (WeakBagTicket (Subscriber x b))
1496−subscribePushSubscribed subscribed sub = WeakBag.insert sub (pushSubscribedSubscribers subscribed) (pushSubscribedWeakSelf subscribed) cleanupPushSubscribed
1497−
1498−{-# SPECIALIZE getMergeSubscribed :: GCompare k => Merge x k -> Subscriber x (DMap k Identity) -> EventM x (WeakBagTicket (Subscriber x (DMap k Identity)), MergeSubscribed x k) #-}
1499−getMergeSubscribed :: forall x k m. (CanSubscribe x m, GCompare k) => Merge x k -> Subscriber x (DMap k Identity) -> m (WeakBagTicket (Subscriber x (DMap k Identity)), MergeSubscribed x k)
1500−getMergeSubscribed m sub = do
1501− mSubscribed <- liftIO $ readIORef $ mergeSubscribed m
1502− case mSubscribed of
1503− Just subscribed -> {-# SCC "hitMerge" #-} do
1504− sln <- liftIO $ subscribeMergeSubscribed subscribed sub
1505− return (sln, subscribed)
1506− Nothing -> {-# SCC "missMerge" #-} do
1507− subscribedRef <- liftIO $ newIORef $ error "getMergeSubscribed: subscribedRef not yet initialized"
1508− subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1509− initialParents <- readBehaviorUntracked $ current $ mergeParents m
1510− subscribers :: [(Maybe (DSum k Identity), Height, DSum k (MergeSubscribedParent x k))] <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
1511− s <- liftIO $ newSubscriberMerge k subscribedUnsafe
1512− (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead e s
1513− height <- liftIO $ getEventSubscribedHeight parentSubd
1514− return $ (fmap (\x -> k :=> Identity x) parentOcc, height, k :=> MergeSubscribedParent subscription s)
1515− let dm = DMap.fromDistinctAscList $ mapMaybe (\(x, _, _) -> x) subscribers
1516− heights = fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
1517− myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
1518− myHeight = if invalidHeight `elem` heights
1519− then invalidHeight
1520− else succHeight $ heightBagMax myHeightBag
1521− currentHeight <- getCurrentHeight
1522− let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
1523− then (if DMap.null dm then Nothing else Just dm, DMap.empty)
1524− else (Nothing, dm)
1525− unless (DMap.null accum) $ do
1526− scheduleMerge myHeight subscribedUnsafe
1527− occRef <- liftIO $ newIORef occ
1528− when (isJust occ) $ scheduleClear occRef
1529− accumRef <- liftIO $ newIORef accum
1530− heightRef <- liftIO $ newIORef myHeight
1531− heightMapRef <- liftIO $ newIORef myHeightBag
1532− weakSelf <- liftIO $ newIORef $ error "getMergeSubscribed: weakSelf not yet initialized"
1533− (subs, sln) <- liftIO $ WeakBag.singleton sub weakSelf cleanupMergeSubscribed
1534− changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
1535− parentsRef <- liftIO $ newIORef $ DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1536− let !subscribed = MergeSubscribed
1537− { mergeSubscribedCachedSubscribed = mergeSubscribed m
1538− , mergeSubscribedOccurrence = occRef
1539− , mergeSubscribedAccum = accumRef
1540− , mergeSubscribedHeight = heightRef
1541− , mergeSubscribedHeightBag = heightMapRef
1542− , mergeSubscribedSubscribers = subs
1543− , mergeSubscribedChange = changeSubdRef
1544− , mergeSubscribedParents = parentsRef
1545− , mergeSubscribedWeakSelf = weakSelf
1546−#ifdef DEBUG_NODEIDS
1547− , mergeSubscribedNodeId = unsafeNodeId m
1548−#endif
1549− }
1550− defer $ SomeMergeInit subscribed $ updated $ mergeParents m
1551− liftIO $ writeIORef subscribedRef $! subscribed
1552− liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "MergeSubscribed"
1553− liftIO $ writeIORef (mergeSubscribed m) $ Just subscribed
1554− return (sln, subscribed)
1555−
1556−cleanupMergeSubscribed :: MergeSubscribed x k -> IO ()
1557−cleanupMergeSubscribed subscribed = do
1558− parents <- readIORef $ mergeSubscribedParents subscribed
1559− forM_ (DMap.toList parents) $ \(_ :=> msp) -> unsubscribe $ mergeSubscribedParentSubscription msp
1560− -- Not necessary, because this whole MergeSubscribed is dead: writeIORef (mergeSubscribedParents subscribed) DMap.empty
1561− writeIORef (mergeSubscribedCachedSubscribed subscribed) $ Nothing -- Get rid of the cached subscribed
1562−
1563−{-# INLINE subscribeMergeSubscribed #-}
1564−subscribeMergeSubscribed :: MergeSubscribed x k -> Subscriber x (DMap k Identity) -> IO (WeakBagTicket (Subscriber x (DMap k Identity)))
1565−subscribeMergeSubscribed subscribed sub = WeakBag.insert sub (mergeSubscribedSubscribers subscribed) (mergeSubscribedWeakSelf subscribed) cleanupMergeSubscribed
1566−
1567−{-# SPECIALIZE getFanSubscribed :: GCompare k => k a -> Fan x k -> Subscriber x a -> EventM x (WeakBagTicket (Subscriber x a), FanSubscribed x k) #-}
1568−getFanSubscribed :: (Defer (SomeAssignment x) m, Defer (SomeHoldInit x) m, Defer (SomeMergeInit x) m, Defer SomeClear m, HasCurrentHeight x m, Defer (SomeResetCoincidence x) m, HasSpiderEnv x m, m ~ EventM x, GCompare k) => k a -> Fan x k -> Subscriber x a -> m (WeakBagTicket (Subscriber x a), FanSubscribed x k)
1569−getFanSubscribed k f sub = do
1570− mSubscribed <- liftIO $ readIORef $ fanSubscribed f
1571− case mSubscribed of
1572− Just subscribed -> {-# SCC "hitFan" #-} do
1573− sln <- liftIO $ subscribeFanSubscribed k subscribed sub
1574− return (sln, subscribed)
1575− Nothing -> {-# SCC "missFan" #-} do
1576− subscribedRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribedRef not yet initialized"
1577− subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1578− s <- liftIO $ newSubscriberFan subscribedUnsafe
1579− subscription <- subscribe (fanParent f) s
1580− weakSelf <- liftIO $ newIORef $ error "getFanSubscribed: weakSelf not yet initialized"
1581− (subsForK, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupFanSubscribed
1582− subscribersRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribersRef not yet initialized"
1583− let subscribed = FanSubscribed
1584− { fanSubscribedCachedSubscribed = fanSubscribed f
1585− , fanSubscribedParent = subscription
1586− , fanSubscribedSubscribers = subscribersRef
1587−#ifdef DEBUG_NODEIDS
1588− , fanSubscribedNodeId = unsafeNodeId f
1589−#endif
1590− }
1591− let !self = (k, subscribed)
1592− liftIO $ writeIORef subscribersRef $! DMap.singleton k $ FanSubscribedChildren subsForK self weakSelf
1593− liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug self "FanSubscribed"
1594− liftIO $ writeIORef subscribedRef $! subscribed
1595− liftIO $ writeIORef (fanSubscribed f) $ Just subscribed
1596− return (slnForSub, subscribed)
1597−
1598−cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k) -> IO ()
1599−cleanupFanSubscribed (k, subscribed) = do
1600− subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1601− let reducedSubscribers = DMap.delete k subscribers
1602− if DMap.null reducedSubscribers
1603− then do
1604− unsubscribe $ fanSubscribedParent subscribed
1605− -- Not necessary in this case, because this whole FanSubscribed is dead: writeIORef (fanSubscribedSubscribers subscribed) reducedSubscribers
1606− writeIORef (fanSubscribedCachedSubscribed subscribed) Nothing
1607− else writeIORef (fanSubscribedSubscribers subscribed) $! reducedSubscribers
1608−
1609−{-# INLINE subscribeFanSubscribed #-}
1610−subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k -> Subscriber x a -> IO (WeakBagTicket (Subscriber x a))
1611−subscribeFanSubscribed k subscribed sub = do
1612− subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1613− case DMap.lookup k subscribers of
1614− Nothing -> {-# SCC "missSubscribeFanSubscribed" #-} do
1615− let !self = (k, subscribed)
1616− weakSelf <- newIORef =<< mkWeakPtrWithDebug self "FanSubscribed"
1617− (list, sln) <- WeakBag.singleton sub weakSelf cleanupFanSubscribed
1618− writeIORef (fanSubscribedSubscribers subscribed) $! DMap.insertWith (error "subscribeEventSubscribed: key that we just failed to find is present - should be impossible") k (FanSubscribedChildren list self weakSelf) subscribers
1619− return sln
1620− Just (FanSubscribedChildren list _ weakSelf) -> {-# SCC "hitSubscribeFanSubscribed" #-} WeakBag.insert sub list weakSelf cleanupFanSubscribed
1621−
1622−{-# SPECIALIZE getSwitchSubscribed :: Switch x a -> Subscriber x a -> EventM x (WeakBagTicket (Subscriber x a), SwitchSubscribed x a) #-}
1623−getSwitchSubscribed :: (Defer (SomeHoldInit x) m, Defer (SomeAssignment x) m, Defer (SomeMergeInit x) m, Defer SomeClear m, Defer (SomeResetCoincidence x) m, HasCurrentHeight x m, HasSpiderEnv x m, m ~ EventM x) => Switch x a -> Subscriber x a -> m (WeakBagTicket (Subscriber x a), SwitchSubscribed x a)
1624−getSwitchSubscribed s sub = do
1625− mSubscribed <- liftIO $ readIORef $ switchSubscribed s
1626− case mSubscribed of
1627− Just subscribed -> {-# SCC "hitSwitch" #-} do
1628− sln <- liftIO $ subscribeSwitchSubscribed subscribed sub
1629− return (sln, subscribed)
1630− Nothing -> {-# SCC "missSwitch" #-} do
1631− subscribedRef <- liftIO $ newIORef $ error "getSwitchSubscribed: subscribed has not yet been created"
1632− subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1633− i <- liftIO $ newInvalidatorSwitch subscribedUnsafe
1634− mySub <- liftIO $ newSubscriberSwitch subscribedUnsafe
1635− wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorSwitch"
1636− wiRef <- liftIO $ newIORef wi
1637− parentsRef <- liftIO $ newIORef [] --TODO: This should be unnecessary, because it will always be filled with just the single parent behavior
1638− holdInits <- getDeferralQueue
1639− e <- liftIO $ runBehaviorM (readBehaviorTracked (switchParent s)) (Just (wi, parentsRef)) holdInits
1640− (subscription@(EventSubscription _ subd), parentOcc) <- subscribeAndRead e mySub
1641− heightRef <- liftIO $ newIORef =<< getEventSubscribedHeight subd
1642− subscriptionRef <- liftIO $ newIORef subscription
1643− occRef <- liftIO $ newIORef parentOcc
1644− when (isJust parentOcc) $ scheduleClear occRef
1645− weakSelf <- liftIO $ newIORef $ error "getSwitchSubscribed: weakSelf not yet initialized"
1646− (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupSwitchSubscribed
1647− let !subscribed = SwitchSubscribed
1648− { switchSubscribedCachedSubscribed = switchSubscribed s
1649− , switchSubscribedOccurrence = occRef
1650− , switchSubscribedHeight = heightRef
1651− , switchSubscribedSubscribers = subs
1652− , switchSubscribedOwnInvalidator = i
1653− , switchSubscribedOwnWeakInvalidator = wiRef
1654− , switchSubscribedBehaviorParents = parentsRef
1655− , switchSubscribedParent = switchParent s
1656− , switchSubscribedCurrentParent = subscriptionRef
1657− , switchSubscribedWeakSelf = weakSelf
1658−#ifdef DEBUG_NODEIDS
1659− , switchSubscribedNodeId = unsafeNodeId s
1660−#endif
1661− }
1662− liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "switchSubscribedWeakSelf"
1663− liftIO $ writeIORef subscribedRef $! subscribed
1664− liftIO $ writeIORef (switchSubscribed s) $ Just subscribed
1665− return (slnForSub, subscribed)
1666−
1667−cleanupSwitchSubscribed :: SwitchSubscribed x a -> IO ()
1668−cleanupSwitchSubscribed subscribed = do
1669− unsubscribe =<< readIORef (switchSubscribedCurrentParent subscribed)
1670− finalize =<< readIORef (switchSubscribedOwnWeakInvalidator subscribed) -- We don't need to get invalidated if we're dead
1671− writeIORef (switchSubscribedCachedSubscribed subscribed) Nothing
1672−
1673−{-# INLINE subscribeSwitchSubscribed #-}
1674−subscribeSwitchSubscribed :: SwitchSubscribed x a -> Subscriber x a -> IO (WeakBagTicket (Subscriber x a))
1675−subscribeSwitchSubscribed subscribed sub = WeakBag.insert sub (switchSubscribedSubscribers subscribed) (switchSubscribedWeakSelf subscribed) cleanupSwitchSubscribed
1676−
1677−{-# SPECIALIZE getCoincidenceSubscribed :: Coincidence x a -> Subscriber x a -> EventM x (WeakBagTicket (Subscriber x a), CoincidenceSubscribed x a) #-}
1678−getCoincidenceSubscribed :: forall x a m. (Defer (SomeAssignment x) m, Defer (SomeHoldInit x) m, Defer (SomeMergeInit x) m, Defer SomeClear m, HasCurrentHeight x m, Defer (SomeResetCoincidence x) m, HasSpiderEnv x m, m ~ EventM x) => Coincidence x a -> Subscriber x a -> m (WeakBagTicket (Subscriber x a), CoincidenceSubscribed x a)
1679−getCoincidenceSubscribed c sub = do
1680− mSubscribed <- liftIO $ readIORef $ coincidenceSubscribed c
1681− case mSubscribed of
1682− Just subscribed -> {-# SCC "hitCoincidence" #-} do
1683− sln <- liftIO $ subscribeCoincidenceSubscribed subscribed sub
1684− return (sln, subscribed)
1685− Nothing -> {-# SCC "missCoincidence" #-} do
1686− subscribedRef <- liftIO $ newIORef $ error "getCoincidenceSubscribed: subscribed has not yet been created"
1687− subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1688− subOuter <- liftIO $ newSubscriberCoincidenceOuter subscribedUnsafe
1689− (outerSubscription@(EventSubscription _ outerSubd), outerOcc) <- subscribeAndRead (coincidenceParent c) subOuter
1690− outerHeight <- liftIO $ getEventSubscribedHeight outerSubd
1691− (occ, height, mInnerSubd) <- case outerOcc of
1692− Nothing -> return (Nothing, outerHeight, Nothing)
1693− Just o -> do
1694− (occ, height, innerSubd) <- subscribeCoincidenceInner o outerHeight subscribedUnsafe
1695− return (occ, height, Just innerSubd)
1696− occRef <- liftIO $ newIORef occ
1697− when (isJust occ) $ scheduleClear occRef
1698− heightRef <- liftIO $ newIORef height
1699− innerSubdRef <- liftIO $ newIORef mInnerSubd
1700− scheduleClear innerSubdRef
1701− weakSelf <- liftIO $ newIORef $ error "getCoincidenceSubscribed: weakSelf not yet implemented"
1702− (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupCoincidenceSubscribed
1703− let subscribed = CoincidenceSubscribed
1704− { coincidenceSubscribedCachedSubscribed = coincidenceSubscribed c
1705− , coincidenceSubscribedOccurrence = occRef
1706− , coincidenceSubscribedHeight = heightRef
1707− , coincidenceSubscribedSubscribers = subs
1708− , coincidenceSubscribedOuter = subOuter
1709− , coincidenceSubscribedOuterParent = outerSubscription
1710− , coincidenceSubscribedInnerParent = innerSubdRef
1711− , coincidenceSubscribedWeakSelf = weakSelf
1712−#ifdef DEBUG_NODEIDS
1713− , coincidenceSubscribedNodeId = unsafeNodeId c
1714−#endif
1715− }
1716− liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "CoincidenceSubscribed"
1717− liftIO $ writeIORef subscribedRef $! subscribed
1718− liftIO $ writeIORef (coincidenceSubscribed c) $ Just subscribed
1719− return (slnForSub, subscribed)
1720−
1721−cleanupCoincidenceSubscribed :: CoincidenceSubscribed x a -> IO ()
1722−cleanupCoincidenceSubscribed subscribed = do
1723− unsubscribe $ coincidenceSubscribedOuterParent subscribed
1724− writeIORef (coincidenceSubscribedCachedSubscribed subscribed) Nothing
1725−
1726−{-# INLINE subscribeCoincidenceSubscribed #-}
1727−subscribeCoincidenceSubscribed :: CoincidenceSubscribed x a -> Subscriber x a -> IO (WeakBagTicket (Subscriber x a))
1728−subscribeCoincidenceSubscribed subscribed sub = WeakBag.insert sub (coincidenceSubscribedSubscribers subscribed) (coincidenceSubscribedWeakSelf subscribed) cleanupCoincidenceSubscribed
1729−
1730−{-# INLINE merge #-}
1731−merge :: GCompare k => Dynamic x R.PatchDMap (DMap k (Event x)) -> Event x (DMap k Identity)
1732−merge m = eventMerge $ Merge
1733− { mergeParents = m
1734− , mergeSubscribed = unsafeNewIORef m Nothing
1735− }
1736−
1737−newtype EventSelector x k = EventSelector { select :: forall a. k a -> Event x a }
1738−
1739−fan :: GCompare k => Event x (DMap k Identity) -> EventSelector x k
1740−fan e =
1741− let f = Fan
1742− { fanParent = e
1743− , fanSubscribed = unsafeNewIORef e Nothing
1744− }
1745− in EventSelector $ \k -> eventFan k f
1746−
1747−runHoldInits :: IORef [SomeHoldInit x] -> IORef [SomeMergeInit x] -> EventM x ()
1748−runHoldInits holdInitRef mergeInitRef = do
1749− holdInits <- liftIO $ readIORef holdInitRef
1750− mergeInits <- liftIO $ readIORef mergeInitRef
1751− unless (null holdInits && null mergeInits) $ do
1752− liftIO $ writeIORef holdInitRef []
1753− liftIO $ writeIORef mergeInitRef []
1754− mapM_ initHold holdInits
1755− mapM_ initMerge mergeInits
1756− runHoldInits holdInitRef mergeInitRef
1757−
1758−initHold :: SomeHoldInit x -> EventM x ()
1759−initHold (SomeHoldInit h) = void $ getHoldEventSubscription h
1760−
1761−initMerge :: SomeMergeInit x -> EventM x ()
1762−initMerge (SomeMergeInit subscribed changed) = do
1763− changeSub <- liftIO $ newSubscriberMergeChange subscribed
1764− (EventSubscription _ changeSubd, change) <- subscribeAndRead changed changeSub
1765− forM_ change $ \c -> defer $ SomeMergeUpdate c subscribed
1766− liftIO $ writeIORef (mergeSubscribedChange subscribed) (changeSub, changeSubd)
1767−
1768−-- | Run an event action outside of a frame
1769−runFrame :: forall x a. EventM x a -> SpiderHost x a --TODO: This function also needs to hold the mutex
1770−runFrame a = SpiderHost $ ask >>= \spiderEnv -> lift $ do
1771− -- Clear out pending unsubscriptions; these will need to happen eventually anyway, and might cause us a lot of extra work during the frame, so get rid of them now
1772− pendingCleanups <- atomicModifyIORef (_spiderEnv_cleanups spiderEnv) $ \x -> ([], x)
1773− {-# SCC "cleanups" #-} sequence_ pendingCleanups
1774− toAssignRef <- newIORef [] -- This should only actually get used when events are firing
1775− holdInitRef <- newIORef []
1776− mergeUpdateRef <- newIORef []
1777− mergeInitRef <- newIORef []
1778− heightRef <- newIORef zeroHeight
1779− toClearRef <- newIORef []
1780− toClearRootRef <- newIORef []
1781− coincidenceInfosRef <- newIORef []
1782− delayedRef <- liftIO $ newIORef IntMap.empty
1783− let env = EventEnv spiderEnv toAssignRef holdInitRef mergeUpdateRef mergeInitRef toClearRef toClearRootRef heightRef coincidenceInfosRef delayedRef
1784− let go = do
1785− result <- a
1786− runHoldInits holdInitRef mergeInitRef -- This must happen before doing the assignments, in case subscribing a Hold causes existing Holds to be read by the newly-propagated events
1787− return result
1788− result <- runEventM go env
1789− toClear <- readIORef toClearRef
1790− forM_ toClear $ \(SomeClear ref) -> {-# SCC "clear" #-} writeIORef ref Nothing
1791− toClearRoot <- readIORef toClearRootRef
1792− forM_ toClearRoot $ \(SomeRootClear ref) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
1793− toAssign <- readIORef toAssignRef
1794− toReconnectRef <- newIORef []
1795− coincidenceInfos <- readIORef coincidenceInfosRef
1796− forM_ toAssign $ \(SomeAssignment vRef iRef v) -> {-# SCC "assignment" #-} do
1797− writeIORef vRef v
1798− when debugInvalidate $ putStrLn $ "Invalidating Hold"
1799− writeIORef iRef =<< evaluate =<< invalidate toReconnectRef =<< readIORef iRef
1800− mergeUpdates <- readIORef mergeUpdateRef
1801− writeIORef mergeUpdateRef []
1802− let updateMerge :: SomeMergeUpdate x -> IO [SomeEventSubscription x]
1803− updateMerge (SomeMergeUpdate (R.PatchDMap p :: R.PatchDMap (DMap k (Event x))) m) = do
1804− oldParents <- readIORef $ mergeSubscribedParents m
1805− let f (subscriptionsToKill, ps) (k :=> Compose me) = do
1806− (mOldSubd, newPs) <- case me of
1807− Nothing -> return $ DMap.updateLookupWithKey (\_ _ -> Nothing) k ps
1808− Just e -> do
1809− s <- liftIO $ newSubscriberMerge k m
1810− subscription@(EventSubscription _ subd) <- subscribe e s
1811− newParentHeight <- liftIO $ getEventSubscribedHeight subd
1812− let newParent = MergeSubscribedParent subscription s
1813− liftIO $ addMergeHeight newParentHeight m
1814− return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
1815− forM_ mOldSubd $ \oldSubd -> do
1816− oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $ mergeSubscribedParentSubscription oldSubd
1817− liftIO $ removeMergeHeight oldHeight m
1818− return (maybeToList (SomeEventSubscription . mergeSubscribedParentSubscription <$> mOldSubd) ++ subscriptionsToKill, newPs)
1819− (subscriptionsToKill, newParents) <- flip runEventM env $ foldM f ([], oldParents) $ DMap.toList p --TODO: I think this runEventM is OK, since no events are firing at this time, but it might not be
1820− writeIORef (mergeSubscribedParents m) $! newParents
1821− return subscriptionsToKill
1822− when debugPropagate $ putStrLn "Updating merges"
1823− mergeSubscriptionsToKill <- concat <$> mapM updateMerge mergeUpdates
1824− when debugPropagate $ putStrLn "Updating merges done"
1825− toReconnect <- readIORef toReconnectRef
1826− switchSubscriptionsToKill <- forM toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
1827− oldSubscription <- readIORef $ switchSubscribedCurrentParent subscribed
1828− wi <- readIORef $ switchSubscribedOwnWeakInvalidator subscribed
1829− when debugInvalidate $ putStrLn $ "Finalizing invalidator for Switch" <> showNodeId subscribed
1830− finalize wi
1831− i <- evaluate $ switchSubscribedOwnInvalidator subscribed
1832− wi' <- mkWeakPtrWithDebug i "wi'"
1833− writeIORef (switchSubscribedOwnWeakInvalidator subscribed) $! wi'
1834− writeIORef (switchSubscribedBehaviorParents subscribed) []
1835− writeIORef holdInitRef [] --TODO: Should we reuse this?
1836− e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) holdInitRef
1837− runEventM (runHoldInits holdInitRef mergeInitRef) env --TODO: Is this actually OK? It seems like it should be, since we know that no events are firing at this point, but it still seems inelegant
1838− --TODO: Make sure we touch the pieces of the SwitchSubscribed at the appropriate times
1839− sub <- newSubscriberSwitch subscribed
1840− subscription <- runReaderT (unSpiderHost (runFrame ({-# SCC "subscribeSwitch" #-} subscribe e sub))) spiderEnv --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
1841− {-
1842− stackTrace <- liftIO $ fmap renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
1843− liftIO $ putStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
1844− EventRoot _ -> "EventRoot"
1845− EventNever -> "EventNever"
1846− _ -> "something else"
1847− -}
1848− writeIORef (switchSubscribedCurrentParent subscribed) $! subscription
1849− return $ SomeEventSubscription oldSubscription
1850− forM_ mergeSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
1851− forM_ switchSubscriptionsToKill $ \(SomeEventSubscription oldSubscription) -> liftIO $ unsubscribe oldSubscription
1852− forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
1853− EventSubscription _ subd' <- readIORef $ switchSubscribedCurrentParent subscribed
1854− parentHeight <- getEventSubscribedHeight subd'
1855− myHeight <- readIORef $ switchSubscribedHeight subscribed
1856− when (parentHeight /= myHeight) $ do
1857− writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
1858− WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
1859− forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> do
1860− invalidateMergeHeight m --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
1861− forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
1862− unsubscribe subscription
1863− mapM_ invalidateCoincidenceHeight mcs
1864− forM_ coincidenceInfos $ \(SomeResetCoincidence _ mcs) -> mapM_ recalculateCoincidenceHeight mcs
1865− forM_ mergeUpdates $ \(SomeMergeUpdate _ m) -> revalidateMergeHeight m
1866− forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> do
1867− height <- calculateSwitchHeight subscribed
1868− updateSwitchHeight height subscribed
1869− return result
1870−
1871−newtype Height = Height { unHeight :: Int } deriving (Show, Read, Eq, Ord, Bounded)
1872−
1873−{-# INLINE zeroHeight #-}
1874−zeroHeight :: Height
1875−zeroHeight = Height 0
1876−
1877−{-# INLINE invalidHeight #-}
1878−invalidHeight :: Height
1879−invalidHeight = Height (-1000)
1880−
1881−#ifdef DEBUG_CYCLES
1882−-- | An invalid height that is currently being traversed, e.g. by walkInvalidHeightParents
1883−{-# INLINE invalidHeightBeingTraversed #-}
1884−invalidHeightBeingTraversed :: Height
1885−invalidHeightBeingTraversed = Height (-1001)
1886−#endif
1887−
1888−{-# INLINE succHeight #-}
1889−succHeight :: Height -> Height
1890−succHeight h@(Height a) =
1891− if h == invalidHeight
1892− then invalidHeight
1893− else Height $ succ a
1894−
1895−removeMergeHeight :: Height -> MergeSubscribed x k -> IO ()
1896−removeMergeHeight oldParentHeight subscribed = do
1897− when debugInvalidateHeight $ putStrLn $ "removeMergeHeight: " <> show oldParentHeight <> " Merge" <> showNodeId subscribed
1898− oldHeights <- readIORef $ mergeSubscribedHeightBag subscribed
1899− let newHeights = heightBagRemove oldParentHeight oldHeights
1900− writeIORef (mergeSubscribedHeightBag subscribed) $! newHeights
1901−
1902−invalidateMergeHeight :: MergeSubscribed x k -> IO ()
1903−invalidateMergeHeight subscribed = do
1904− oldHeight <- readIORef $ mergeSubscribedHeight subscribed
1905− -- If the height used to be valid, it must be invalid now; we should never have *more* heights than we have parents
1906− when (oldHeight /= invalidHeight) $ do
1907− writeIORef (mergeSubscribedHeight subscribed) $! invalidHeight
1908− WeakBag.traverse (mergeSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1909−
1910−addMergeHeight :: Height -> MergeSubscribed x k -> IO ()
1911−addMergeHeight newParentHeight subscribed = do
1912− when debugInvalidateHeight $ putStrLn $ "addMergeHeight: " <> show newParentHeight <> " Merge" <> showNodeId subscribed
1913− oldHeights <- readIORef $ mergeSubscribedHeightBag subscribed
1914− let newHeights = heightBagAdd newParentHeight oldHeights
1915− writeIORef (mergeSubscribedHeightBag subscribed) $! newHeights
1916−
1917−revalidateMergeHeight :: MergeSubscribed x k -> IO ()
1918−revalidateMergeHeight subscribed = do
1919− currentHeight <- readIORef $ mergeSubscribedHeight subscribed
1920− when (currentHeight == invalidHeight) $ do -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
1921− heights <- readIORef $ mergeSubscribedHeightBag subscribed
1922− parents <- readIORef $ mergeSubscribedParents subscribed
1923− -- When the number of heights in the bag reaches the number of parents, we should have a valid height
1924− case heightBagSize heights `compare` DMap.size parents of
1925− LT -> return ()
1926− EQ -> do
1927− let height = succHeight $ heightBagMax heights
1928− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: height: " <> show height
1929− writeIORef (mergeSubscribedHeight subscribed) $! height
1930− WeakBag.traverse (mergeSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1931− GT -> error $ "revalidateMergeHeight: more heights than parents for Merge" <> showNodeId subscribed
1932−
1933−invalidateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
1934−invalidateCoincidenceHeight subscribed = do
1935− oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
1936− when (oldHeight /= invalidHeight) $ do
1937− writeIORef (coincidenceSubscribedHeight subscribed) $! invalidHeight
1938− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1939−
1940−updateSwitchHeight :: Height -> SwitchSubscribed x a -> IO ()
1941−updateSwitchHeight new subscribed = do
1942− oldHeight <- readIORef $ switchSubscribedHeight subscribed
1943− when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
1944− when (new /= invalidHeight) $ do --TODO: This 'when' should probably be an assertion
1945− writeIORef (switchSubscribedHeight subscribed) $! new
1946− WeakBag.traverse (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
1947−
1948−recalculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
1949−recalculateCoincidenceHeight subscribed = do
1950− oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
1951− when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
1952− height <- calculateCoincidenceHeight subscribed
1953− when (height /= invalidHeight) $ do
1954− writeIORef (coincidenceSubscribedHeight subscribed) $! height
1955− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1956−
1957−calculateSwitchHeight :: SwitchSubscribed x a -> IO Height
1958−calculateSwitchHeight subscribed = getEventSubscribedHeight . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
1959−
1960−calculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO Height
1961−calculateCoincidenceHeight subscribed = do
1962− outerHeight <- getEventSubscribedHeight $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
1963− innerHeight <- maybe (return zeroHeight) getEventSubscribedHeight =<< readIORef (coincidenceSubscribedInnerParent subscribed)
1964− return $ if outerHeight == invalidHeight || innerHeight == invalidHeight then invalidHeight else max outerHeight innerHeight
1965−
1966−data SomeSwitchSubscribed x = forall a. SomeSwitchSubscribed {-# NOUNPACK #-} (SwitchSubscribed x a)
1967−
1968−invalidate :: IORef [SomeSwitchSubscribed x] -> WeakList (Invalidator x) -> IO (WeakList (Invalidator x))
1969−invalidate toReconnectRef wis = do
1970− forM_ wis $ \wi -> do
1971− mi <- deRefWeak wi
1972− case mi of
1973− Nothing -> do
1974− traceInvalidate "invalidate Dead"
1975− return () --TODO: Should we clean this up here?
1976− Just i -> do
1977− finalize wi -- Once something's invalidated, it doesn't need to hang around; this will change when some things are strict
1978− case i of
1979− InvalidatorPull p -> do
1980− traceInvalidate $ "invalidate: Pull" <> showNodeId p
1981− mVal <- readIORef $ pullValue p
1982− forM_ mVal $ \val -> do
1983− writeIORef (pullValue p) Nothing
1984− writeIORef (pullSubscribedInvalidators val) =<< evaluate =<< invalidate toReconnectRef =<< readIORef (pullSubscribedInvalidators val)
1985− InvalidatorSwitch subscribed -> do
1986− traceInvalidate $ "invalidate: Switch" <> showNodeId subscribed
1987− modifyIORef' toReconnectRef (SomeSwitchSubscribed subscribed :)
1988− return [] -- Since we always finalize everything, always return an empty list --TODO: There are some things that will need to be re-subscribed every time; we should try to avoid finalizing them
1989−
1990−--------------------------------------------------------------------------------
1991−-- Reflex integration
1992−--------------------------------------------------------------------------------
1993−
1994−-- | The default, global Spider environment
1995−type Spider = SpiderEnv Global
1996−
1997−-- | Designates the default, global Spider timeline
1998−data Global
1999−
2000−{-# NOINLINE globalSpiderEnv #-}
2001−globalSpiderEnv :: SpiderEnv Global
2002−globalSpiderEnv = unsafePerformIO unsafeNewSpiderEnv
2003−
2004−-- | Stores all global data relevant to a particular Spider timeline; only one
2005−-- value should exist for each type @x@
2006−data SpiderEnv x = SpiderEnv
2007− { _spiderEnv_toUnsubscribe :: !(IORef [SomeEventSubscription x])
2008− , _spiderEnv_lock :: !(MVar ())
2009− , _spiderEnv_cleanups :: !(IORef [IO ()])
2010−#ifdef DEBUG
2011− , _spiderEnv_depth :: !(IORef Int)
2012−#endif
2013− }
2014−type role SpiderEnv nominal
2015−
2016−instance GEq SpiderEnv where
2017− a `geq` b = if _spiderEnv_lock a == _spiderEnv_lock b
2018− then Just $ unsafeCoerce Refl -- This unsafeCoerce is safe because the same SpiderEnv can't have two different 'x' arguments
2019− else Nothing
2020−
2021−unsafeNewSpiderEnv :: forall x. IO (SpiderEnv x)
2022−unsafeNewSpiderEnv = do
2023− toUnsubscribe <- newIORef []
2024− lock <- newMVar ()
2025− cleanups <- newIORef []
2026−#ifdef DEBUG
2027− depthRef <- newIORef 0
2028−#endif
2029− return $ SpiderEnv
2030− { _spiderEnv_toUnsubscribe = toUnsubscribe
2031− , _spiderEnv_lock = lock
2032− , _spiderEnv_cleanups = cleanups
2033−#ifdef DEBUG
2034− , _spiderEnv_depth = depthRef
2035−#endif
2036− }
2037−
2038−-- | Create a new SpiderEnv
2039−newSpiderEnv :: IO (Some SpiderEnv)
2040−newSpiderEnv = Some.This <$> unsafeNewSpiderEnv
2041−
2042−newtype SpiderPullM x a = SpiderPullM (BehaviorM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2043−
2044−newtype SpiderPushM x a = SpiderPushM (ComputeM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
2045−
2046−instance R.Reflex (SpiderEnv x) where
2047− newtype Behavior (SpiderEnv x) a = SpiderBehavior { unSpiderBehavior :: Behavior x a }
2048− newtype Event (SpiderEnv x) a = SpiderEvent { unSpiderEvent :: Event x a }
2049− newtype Dynamic (SpiderEnv x) a = SpiderDynamic { unSpiderDynamic :: Dynamic x Identity a } deriving (Functor, Applicative, Monad)
2050− newtype Incremental (SpiderEnv x) p a = SpiderIncremental { unSpiderIncremental :: Dynamic x p a }
2051− type PullM (SpiderEnv x) = SpiderPullM x
2052− type PushM (SpiderEnv x) = SpiderPushM x
2053− {-# INLINABLE never #-}
2054− never = SpiderEvent eventNever
2055− {-# INLINABLE constant #-}
2056− constant = SpiderBehavior . BehaviorConst
2057− {-# INLINABLE push #-}
2058− push f = SpiderEvent . push (coerce f) . unSpiderEvent
2059− {-# INLINABLE pull #-}
2060− pull = SpiderBehavior . pull . coerce
2061− {-# INLINABLE merge #-}
2062− merge = SpiderEvent . merge . DynamicConst . (unsafeCoerce :: DMap k (R.Event (SpiderEnv x)) -> DMap k (Event x))
2063− {-# INLINABLE fan #-}
2064− fan e = R.EventSelector $ SpiderEvent . select (fan (unSpiderEvent e))
2065− {-# INLINABLE switch #-}
2066− switch = SpiderEvent . switch . (unsafeCoerce :: Behavior x (R.Event (SpiderEnv x) a) -> Behavior x (Event x a)) . unSpiderBehavior
2067− {-# INLINABLE coincidence #-}
2068− coincidence = SpiderEvent . coincidence . (unsafeCoerce :: Event x (R.Event (SpiderEnv x) a) -> Event x (Event x a)) . unSpiderEvent
2069− {-# INLINABLE current #-}
2070− current = SpiderBehavior . current . unSpiderDynamic
2071− {-# INLINABLE updated #-}
2072− updated = SpiderEvent . fmap runIdentity . updated . unSpiderDynamic
2073− {-# INLINABLE unsafeBuildDynamic #-}
2074− unsafeBuildDynamic readV0 v' = SpiderDynamic $ DynamicDynIdentity $ unsafeDyn (coerce readV0) $ addIdentity $ unSpiderEvent v'
2075− {-# INLINABLE unsafeBuildIncremental #-}
2076− unsafeBuildIncremental readV0 dv = SpiderIncremental $ DynamicDyn $ unsafeDyn (coerce readV0) $ unSpiderEvent dv
2077− {-# INLINABLE mergeIncremental #-}
2078− mergeIncremental = SpiderEvent . merge . (unsafeCoerce :: Dynamic x R.PatchDMap (DMap k (R.Event (SpiderEnv x))) -> Dynamic x R.PatchDMap (DMap k (Event x))) . unSpiderIncremental
2079− {-# INLINABLE currentIncremental #-}
2080− currentIncremental = SpiderBehavior . current . unSpiderIncremental
2081− {-# INLINABLE updatedIncremental #-}
2082− updatedIncremental = SpiderEvent . updated . unSpiderIncremental
2083− {-# INLINABLE incrementalToDynamic #-}
2084− incrementalToDynamic (SpiderIncremental i) = SpiderDynamic $ DynamicDynIdentity $ unsafeDyn (readBehaviorUntracked $ current i) $ flip push (updated i) $ \p -> do
2085− c <- readBehaviorUntracked $ current i
2086− return $ Identity <$> R.apply p c --TODO: Avoid the redundant 'apply'
2087−
2088−instance R.MonadSample (SpiderEnv x) (EventM x) where
2089− {-# INLINABLE sample #-}
2090− sample (SpiderBehavior b) = readBehaviorUntracked b
2091−
2092−instance R.MonadHold (SpiderEnv x) (EventM x) where
2093− {-# INLINABLE hold #-}
2094− hold = holdSpiderEventM
2095− {-# INLINABLE holdDyn #-}
2096− holdDyn = holdDynSpiderEventM
2097− {-# INLINABLE holdIncremental #-}
2098− holdIncremental = holdIncrementalSpiderEventM
2099−
2100−holdSpiderEventM :: a -> R.Event (SpiderEnv x) a -> EventM x (R.Behavior (SpiderEnv x) a)
2101−holdSpiderEventM v0 e = fmap (SpiderBehavior . BehaviorHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2102−
2103−holdDynSpiderEventM :: a -> R.Event (SpiderEnv x) a -> EventM x (R.Dynamic (SpiderEnv x) a)
2104−holdDynSpiderEventM v0 e = fmap (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2105−
2106−holdIncrementalSpiderEventM :: R.Patch p => a -> R.Event (SpiderEnv x) (p a) -> EventM x (R.Incremental (SpiderEnv x) p a)
2107−holdIncrementalSpiderEventM v0 e = fmap (SpiderIncremental . DynamicHold) $ hold v0 $ unSpiderEvent e
2108−
2109−instance R.MonadHold (SpiderEnv x) (SpiderHost x) where
2110− {-# INLINABLE hold #-}
2111− hold v0 e = R.runHostFrame $ R.hold v0 e
2112− {-# INLINABLE holdDyn #-}
2113− holdDyn v0 e = R.runHostFrame $ R.holdDyn v0 e
2114− {-# INLINABLE holdIncremental #-}
2115− holdIncremental v0 e = R.runHostFrame $ R.holdIncremental v0 e
2116−
2117−instance R.MonadSample (SpiderEnv x) (SpiderHost x) where
2118− {-# INLINABLE sample #-}
2119− sample = runFrame . readBehaviorUntracked . unSpiderBehavior
2120−
2121−instance R.MonadSample (SpiderEnv x) (SpiderPullM x) where
2122− {-# INLINABLE sample #-}
2123− sample = coerce . readBehaviorTracked . unSpiderBehavior
2124−
2125−instance R.MonadSample (SpiderEnv x) (SpiderPushM x) where
2126− {-# INLINABLE sample #-}
2127− sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
2128−
2129−instance R.MonadHold (SpiderEnv x) (SpiderPushM x) where
2130− {-# INLINABLE hold #-}
2131− hold v0 e = R.current <$> R.holdDyn v0 e
2132− {-# INLINABLE holdDyn #-}
2133− holdDyn v0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity e
2134− {-# INLINABLE holdIncremental #-}
2135− holdIncremental v0 (SpiderEvent e) = SpiderPushM $ SpiderIncremental . DynamicHold <$> hold v0 e
2136−
2137−data RootTrigger x a = forall k. GCompare k => RootTrigger (WeakBag (Subscriber x a), IORef (DMap k Identity), k a)
2138−
2139−data SpiderEventHandle x a = SpiderEventHandle
2140− { spiderEventHandleSubscription :: EventSubscription x a
2141− , spiderEventHandleValue :: IORef (Maybe a)
2142− }
2143−
2144−instance R.MonadSubscribeEvent (SpiderEnv x) (SpiderHostFrame x) where
2145− {-# INLINABLE subscribeEvent #-}
2146− subscribeEvent e = SpiderHostFrame $ do
2147− --TODO: Unsubscribe eventually (manually and/or with weak ref)
2148− val <- liftIO $ newIORef Nothing
2149− subscription <- subscribe (unSpiderEvent e) $ Subscriber
2150− { subscriberPropagate = \a -> do
2151− liftIO $ writeIORef val $ Just a
2152− scheduleClear val
2153− , subscriberInvalidateHeight = \_ -> return ()
2154− , subscriberRecalculateHeight = \_ -> return ()
2155− }
2156− return $ SpiderEventHandle
2157− { spiderEventHandleSubscription = subscription
2158− , spiderEventHandleValue = val
2159− }
2160−
2161−instance R.ReflexHost (SpiderEnv x) where
2162− type EventTrigger (SpiderEnv x) = RootTrigger x
2163− type EventHandle (SpiderEnv x) = SpiderEventHandle x
2164− type HostFrame (SpiderEnv x) = SpiderHostFrame x
2165−
2166−instance R.MonadReadEvent (SpiderEnv x) (ReadPhase x) where
2167− {-# INLINABLE readEvent #-}
2168− readEvent h = ReadPhase $ fmap (fmap return) $ liftIO $ do
2169− touch h
2170− readIORef $ spiderEventHandleValue h
2171−
2172−instance MonadRef (EventM x) where
2173− type Ref (EventM x) = Ref IO
2174− {-# INLINABLE newRef #-}
2175− {-# INLINABLE readRef #-}
2176− {-# INLINABLE writeRef #-}
2177− newRef = liftIO . newRef
2178− readRef = liftIO . readRef
2179− writeRef r a = liftIO $ writeRef r a
2180−
2181−instance MonadAtomicRef (EventM x) where
2182− {-# INLINABLE atomicModifyRef #-}
2183− atomicModifyRef r f = liftIO $ atomicModifyRef r f
2184−
2185−-- | The monad for actions that manipulate a Spider timeline identified by @x@
2186−newtype SpiderHost x a = SpiderHost { unSpiderHost :: ReaderT (SpiderEnv x) IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2187−
2188−instance Monad (SpiderHost x) where
2189− {-# INLINABLE (>>=) #-}
2190− SpiderHost x >>= f = SpiderHost $ x >>= unSpiderHost . f
2191− {-# INLINABLE (>>) #-}
2192− SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
2193− {-# INLINABLE return #-}
2194− return x = SpiderHost $ return x
2195− {-# INLINABLE fail #-}
2196− fail s = SpiderHost $ fail s
2197−
2198−-- | Run an action affecting the global Spider timeline; this will be guarded by
2199−-- a mutex for that timeline
2200−runSpiderHost :: SpiderHost Global a -> IO a
2201−runSpiderHost (SpiderHost a) = runReaderT a globalSpiderEnv
2202−
2203−newtype SpiderHostFrame x a = SpiderHostFrame { runSpiderHostFrame :: EventM x a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2204−
2205−instance Monad (SpiderHostFrame x) where
2206− {-# INLINABLE (>>=) #-}
2207− SpiderHostFrame x >>= f = SpiderHostFrame $ x >>= runSpiderHostFrame . f
2208− {-# INLINABLE (>>) #-}
2209− SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
2210− {-# INLINABLE return #-}
2211− return x = SpiderHostFrame $ return x
2212− {-# INLINABLE fail #-}
2213− fail s = SpiderHostFrame $ fail s
2214−
2215−instance R.MonadSample (SpiderEnv x) (SpiderHostFrame x) where
2216− sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
2217−
2218−addIdentity :: Event x a -> Event x (Identity a)
2219−--addIdentity = fmap Identity
2220−addIdentity = unsafeCoerce
2221−
2222−instance R.MonadHold (SpiderEnv x) (SpiderHostFrame x) where
2223− {-# INLINABLE hold #-}
2224− hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . BehaviorHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2225− {-# INLINABLE holdDyn #-}
2226− holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . DynamicHoldIdentity) $ hold v0 $ addIdentity $ unSpiderEvent e
2227− {-# INLINABLE holdIncremental #-}
2228− holdIncremental v0 e = SpiderHostFrame $ fmap (SpiderIncremental . DynamicHold) $ hold v0 $ unSpiderEvent e
2229−
2230−newEventWithTriggerIO :: (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
2231−newEventWithTriggerIO f = do
2232− es <- newFanEventWithTriggerIO $ \Refl -> f
2233− return $ select es Refl
2234−
2235−newFanEventWithTriggerIO :: GCompare k => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
2236−newFanEventWithTriggerIO f = do
2237− occRef <- newIORef DMap.empty
2238− subscribedRef <- newIORef DMap.empty
2239− let !r = Root
2240− { rootOccurrence = occRef
2241− , rootSubscribed = subscribedRef
2242− , rootInit = f
2243− }
2244− return $ EventSelector $ \k -> eventRoot k r
2245−
2246−instance R.MonadReflexCreateTrigger (SpiderEnv x) (SpiderHost x) where
2247− newEventWithTrigger = SpiderHost . lift . fmap SpiderEvent . newEventWithTriggerIO
2248− newFanEventWithTrigger f = SpiderHost $ lift $ do
2249− es <- newFanEventWithTriggerIO f
2250− return $ R.EventSelector $ SpiderEvent . select es
2251−
2252−instance R.MonadReflexCreateTrigger (SpiderEnv x) (SpiderHostFrame x) where
2253− newEventWithTrigger = SpiderHostFrame . EventM . liftIO . fmap SpiderEvent . newEventWithTriggerIO
2254− newFanEventWithTrigger f = SpiderHostFrame $ EventM $ liftIO $ do
2255− es <- newFanEventWithTriggerIO f
2256− return $ R.EventSelector $ SpiderEvent . select es
2257−
2258−instance R.MonadSubscribeEvent (SpiderEnv x) (SpiderHost x) where
2259− {-# INLINABLE subscribeEvent #-}
2260− subscribeEvent = runFrame . runSpiderHostFrame . R.subscribeEvent
2261−
2262−newtype ReadPhase x a = ReadPhase (ResultM x a) deriving (Functor, Applicative, Monad, MonadFix)
2263−
2264−instance R.MonadSample (SpiderEnv x) (ReadPhase x) where
2265− {-# INLINABLE sample #-}
2266− sample = ReadPhase . R.sample
2267−
2268−instance R.MonadHold (SpiderEnv x) (ReadPhase x) where
2269− {-# INLINABLE hold #-}
2270− hold v0 e = ReadPhase $ R.hold v0 e
2271− {-# INLINABLE holdDyn #-}
2272− holdDyn v0 e = ReadPhase $ R.holdDyn v0 e
2273− {-# INLINABLE holdIncremental #-}
2274− holdIncremental v0 e = ReadPhase $ R.holdIncremental v0 e
2275−
2276−instance R.MonadReflexHost (SpiderEnv x) (SpiderHost x) where
2277− type ReadPhase (SpiderHost x) = ReadPhase x
2278− fireEventsAndRead es (ReadPhase a) = run es a
2279− runHostFrame = runFrame . runSpiderHostFrame
2280−
2281−instance MonadRef (SpiderHost x) where
2282− type Ref (SpiderHost x) = Ref IO
2283− newRef = SpiderHost . newRef
2284− readRef = SpiderHost . readRef
2285− writeRef r = SpiderHost . writeRef r
2286−
2287−instance MonadAtomicRef (SpiderHost x) where
2288− atomicModifyRef r = SpiderHost . atomicModifyRef r
2289−
2290−instance MonadRef (SpiderHostFrame x) where
2291− type Ref (SpiderHostFrame x) = Ref IO
2292− newRef = SpiderHostFrame . newRef
2293− readRef = SpiderHostFrame . readRef
2294− writeRef r = SpiderHostFrame . writeRef r
2295−
2296−instance MonadAtomicRef (SpiderHostFrame x) where
2297− atomicModifyRef r = SpiderHostFrame . atomicModifyRef r
stylizenew file+4
@@ -0,0 +1,4 @@
1+#!/usr/bin/env bash
2+set -euo pipefail
3+
4+for x in **/*.hs ; do stylish-haskell -i "$x" ; done
test/Reflex/Bench/Focused.hsdeleted−369
@@ -1,369 +0,0 @@
1−{-# LANGUAGE ConstraintKinds #-}
2−{-# LANGUAGE FlexibleContexts #-}
3−{-# LANGUAGE FlexibleInstances #-}
4−{-# LANGUAGE GADTs #-}
5−{-# LANGUAGE MultiParamTypeClasses #-}
6−{-# LANGUAGE RankNTypes #-}
7−{-# LANGUAGE RecursiveDo #-}
8−{-# LANGUAGE ScopedTypeVariables #-}
9−{-# LANGUAGE TupleSections #-}
10−{-# LANGUAGE TypeSynonymInstances #-}
11−
12−module Reflex.Bench.Focused where
13−
14−import Reflex
15−import Reflex.TestPlan
16−
17−import Control.Applicative
18−import Control.Monad
19−import Control.Monad.Fix
20−import Control.Monad.Identity
21−import Data.Traversable (for, traverse)
22−
23−import qualified Data.Dependent.Map as DMap
24−import Data.Map (Map)
25−import qualified Data.Map as Map
26−import Data.Maybe
27−
28−import Data.Functor.Misc
29−
30−import Data.List
31−import Data.List.Split
32−import Data.Tuple
33−
34−import Data.Monoid
35−import Data.Word
36−
37−import Control.DeepSeq
38−
39−import Prelude hiding (concat, sum)
40−
41−
42−mergeTree :: Num a => (Monoid (f [a]), Functor f) => Int -> [f a] -> f a
43−mergeTree n es | length es <= n = sum' es
44− | otherwise = mergeTree n subTrees
45− where
46− merges = chunksOf n es
47− subTrees = map sum' merges
48− sum' = fmap sum . mconcat . fmap (fmap (:[]) )
49−
50−mergeListDyn :: Reflex t => [Dynamic t a] -> Dynamic t [a]
51−mergeListDyn = mconcat . fmap (fmap pure)
52−
53−mergeTreeDyn :: (Num a, Reflex t) => Int -> [Dynamic t a] -> Dynamic t a
54−mergeTreeDyn n dyns | length dyns <= n = sumDyns dyns
55− | otherwise = mergeTreeDyn n $ fmap sumDyns merges
56− where
57− merges = chunksOf n dyns
58− sumDyns = fmap sum . mergeListDyn
59−
60−
61−
62−-- N events all firing for N frames
63−continuous :: TestPlan t m => Word -> Word -> m [Event t Word]
64−continuous n frames = for [1..n] $ \i -> plan $ (, i) <$> [1..frames]
65−
66−-- Fire N events once every P frames for total N frames (interspersed evenly)
67−occasional :: TestPlan t m => Word -> Word -> Word -> m [Event t Word]
68−occasional n period frames = traverse plan $ zipWith occs [1..] phases
69− where
70− phases = take (fromIntegral n) $ concat (repeat [1..period])
71− occs i phase = (, i) <$> [1, phase+1..frames]
72−
73−
74−
75−-- Event which never fires (but isn't 'never')
76−never' :: TestPlan t m => m (Event t Word)
77−never' = plan []
78−
79−
80−-- Event which fires once on first frame
81−event :: TestPlan t m => m (Event t Word)
82−event = plan [(1, 0)]
83−
84−-- Event which fires constantly over N frames
85−events :: TestPlan t m => Word -> m (Event t Word)
86−events n = plan $ (\i -> (i, i)) <$> [1..n]
87−
88−
89−-- N events all originating from one event
90−fmapFan :: Reflex t => Word -> Event t Word -> [Event t Word]
91−fmapFan n e = (\i -> (+i) <$> e) <$> [1..n]
92−
93−
94−-- Make a fan using the value in the event converting it to a singleton Map
95−-- use a fan of size n (key is the value mod n)
96−fanMerge :: Reflex t => Word -> Event t Word -> Event t Word
97−fanMerge n e = leftmost $ s <$> [0..n - 1] where
98− s k = select f (Const2 k)
99− f = fan (toMap <$> e)
100− toMap k = DMap.singleton (Const2 $ k `mod` n) (Identity k)
101−
102−-- Dumb version of the above using simple fmapMaybe to filter
103−fmapFanMerge :: Reflex t => Word -> Event t Word -> Event t Word
104−fmapFanMerge n e = leftmost $ s <$> [0..n - 1] where
105− s k = flip fmapMaybe e $ \j -> if k == j `mod` n
106− then Just k
107− else Nothing
108−
109−
110−
111−-- Create an Event with a Map which is dense to size N
112−denseMap :: TestPlan t m => Word -> m (Event t (Map Word Word))
113−denseMap n = plan [(1, m)] where
114− m = Map.fromList $ zip [1..n] [1..n]
115−
116−iter :: (a -> a) -> Word -> a -> a
117−iter _ 0 a = a
118−iter f n a = iter f (n - 1) (f a)
119−
120−iterM :: Monad m => (a -> m a) -> Word -> a -> m a
121−iterM _ 0 a = return a
122−iterM f n a = iterM f (n - 1) =<< f a
123−
124−fmapChain :: (Functor f) => Word -> f Word -> f Word
125−fmapChain = iter (fmap (+1))
126−
127−mapDynChain :: (Reflex t, MonadHold t m) => Word -> Dynamic t Word -> m (Dynamic t Word)
128−mapDynChain = iterM (return . fmap (+1))
129−
130−joinDynChain :: (Reflex t, MonadHold t m) => Word -> Dynamic t Word -> m (Dynamic t Word)
131−joinDynChain = iterM (\d -> return $ join $ fmap (const d) d)
132−
133−combineDynChain :: (Reflex t, MonadHold t m) => Word -> Dynamic t Word -> m (Dynamic t Word)
134−combineDynChain = iterM (\d -> return $ zipDynWith (+) d d)
135−
136−pingPong :: (Reflex t, MonadHold t m, MonadFix m) => Event t a -> Event t a -> m (Event t a)
137−pingPong e1 e2 = do
138− rec
139− d <- foldDyn (const swap) (e1, e2) e
140− let e = switch (fst <$> current d)
141− return e
142−
143−switchFactors :: (Reflex t, MonadHold t m) => Word -> Event t Word -> m (Event t Word)
144−switchFactors 0 e = return e
145−switchFactors i e = do
146− b <- hold ((+1) <$> e) (e <$ ffilter ((== 0) . (i `mod`)) e)
147− switchFactors (i - 1) (switch b)
148−
149−
150−switchChain :: (Reflex t, MonadHold t m, MonadFix m) => Word -> Event t Word -> m (Event t Word)
151−switchChain = iterM (\e -> pingPong e ((+1) <$> e))
152−
153−
154−switchChain2 :: (Reflex t, MonadHold t m, MonadFix m) => Word -> Event t Word -> m (Event t Word)
155−switchChain2 = iterM (\e -> pingPong e ((+1) <$> leftmost [e, e]))
156−
157−switchPromptlyChain :: (Reflex t, MonadHold t m) => Word -> Event t Word -> m (Event t Word)
158−switchPromptlyChain = iterM $ \e ->
159− switchPromptlyDyn <$> holdDyn e (e <$ e)
160−
161−
162−coinChain :: Reflex t => Word -> Event t Word -> Event t Word
163−coinChain = iter $ \e -> coincidence (e <$ e)
164−
165−fanMergeChain :: Reflex t => Word -> Word -> Event t Word -> Event t Word
166−fanMergeChain width = iter $ fanMerge width
167−
168−fmapFanMergeChain :: Reflex t => Word -> Word -> Event t Word -> Event t Word
169−fmapFanMergeChain width = iter $ fmapFanMerge width
170−
171−-- | Data type for a collection (a map) which is updated by providing differences
172−data UpdatedMap t k a = UpdatedMap (Map k a) (Event t (Map k (Maybe a)))
173−
174−-- This will hopefully become a primitive (faster!)
175−switchMergeEvents :: (MonadFix m, MonadHold t m, Reflex t, Ord k) => UpdatedMap t k (Event t a) -> m (Event t (Map k a))
176−switchMergeEvents mapChanges = switch . fmap mergeMap <$> holdMap mapChanges
177−
178−-- switchMergeMaybe :: (MonadFix m, MonadHold t m, Reflex t, Ord k) => UpdatedMap t k (Event t a) -> m (Event t (Map k a))
179−-- switchMergeMaybe (UpdatedMap initial changes) = switchMergeMap initial (fmap (fromMaybe never) <$> changes)
180−
181−switchMergeBehaviors :: forall a t m k. (MonadFix m, MonadHold t m, Reflex t, Ord k) => UpdatedMap t k (Behavior t a) -> m (Behavior t (Map k a))
182−switchMergeBehaviors mapChanges = pull . joinMap <$> holdMap mapChanges
183− where joinMap m = traverse sample =<< sample m
184−
185−-- | Turn an UpdatedMap into a Dynamic by applying the differences to the initial value
186−holdMapDyn :: (Reflex t, MonadHold t m, MonadFix m, Ord k) => UpdatedMap t k a -> m (Dynamic t (Map k a))
187−holdMapDyn (UpdatedMap initial changes) = foldDyn (flip (Map.foldWithKey modify)) initial changes
188−
189− where
190− modify k Nothing items = Map.delete k items
191− modify k (Just item) items = Map.insert k item items
192−
193−
194−-- | Hold an UpdatedMap as a behavior by applying differences to the initial value
195−holdMap :: (Reflex t, MonadHold t m, MonadFix m, Ord k) => UpdatedMap t k a -> m (Behavior t (Map k a))
196−holdMap = (current <$>) . holdMapDyn
197−
198−
199−increasingMerge :: TestPlan t m => [a] -> m (UpdatedMap t Int a)
200−increasingMerge xs = do
201− e <- planList (zipWith Map.singleton [1..] (Just <$> xs) ++ [reset])
202− return (UpdatedMap Map.empty e)
203− where
204− reset = Map.fromList $ zip [1..] (const Nothing <$> xs)
205−
206−decreasingMerge :: (TestPlan t m) => [a] -> m (UpdatedMap t Int a)
207−decreasingMerge xs = do
208− e <- planList (zipWith Map.singleton [1..] (const Nothing <$> xs) ++ [reset])
209− return (UpdatedMap initial e)
210− where
211− initial = Map.fromList $ zip [1..] xs
212− reset = Just <$> initial
213−
214−modifyMerge :: (TestPlan t m) => [a] -> m (UpdatedMap t Int a)
215−modifyMerge xs = do
216− e <- planList $ zipWith Map.singleton [1..] (Just <$> xs)
217− return (UpdatedMap initial e)
218− where
219− initial = Map.fromList $ zip [1..] xs
220−
221−
222−countMany :: (Reflex t, MonadHold t m, MonadFix m) => [Event t a] -> m [Behavior t Int]
223−countMany = traverse (fmap current . count)
224−
225−countManyDyn :: (Reflex t, MonadHold t m, MonadFix m) => [Event t a] -> m [Dynamic t Int]
226−countManyDyn = traverse count
227−
228−
229−-- Given a function which creates a sub-network (from a single event)
230−-- Create a plan which uses a switch to substitute it
231−switches :: TestPlan t m => Word -> (forall n. (MonadHold t n, MonadFix n) => Event t Word -> n (Event t a)) -> m (Event t a)
232−switches numFrames f = do
233− es <- events numFrames
234− switch <$> hold never (makeEvents es)
235−
236− where
237− makeEvents es = pushAlways (\n -> f (fmap (+n) es)) es
238−
239−
240−
241−-- Two sets of benchmarks, one which we're interested in testing subscribe time (as well as time to fire frames)
242−-- the other, which we're only interested in time for running frames
243−subscribing :: Word -> Word -> [(String, TestCase)]
244−subscribing n frames =
245− [ testSub "fmapFanMerge" $ return . mergeList . fmapFan n
246− , testSub "fanMerge" $ return . fanMerge n
247− , testSub "fmapFan/mergeTree" $ return . mergeTree 8 . fmapFan n
248− , testSub "fmapChain" $ return . fmapChain n
249− , testSub "switchChain" $ switchChain n
250− , testSub "switchPromptlyChain" $ switchPromptlyChain n
251− , testSub "switchFactors" $ switchFactors n
252− , testSub "coincidenceChain" $ return . coinChain n
253− ]
254−
255− where
256− testSub :: (Eq a, Show a, NFData a) => String -> (forall t n. (Reflex t, MonadHold t n, MonadFix n) => Event t Word -> n (Event t a)) -> (String, TestCase)
257− testSub name test = testE name (switches frames test)
258−
259−-- Set of benchmark to test specifically merging dynamic collections
260−-- a pattern which occurs frequently in reflex-dom collections
261−merging :: Word -> [(String, TestCase)]
262−merging n =
263− [ testE "static events" $ mergeList <$> sparse
264− , testE "increasing events" $ switchMergeEvents =<< increasingMerge =<< sparse
265− , testE "decreasing events" $ switchMergeEvents =<< decreasingMerge =<< sparse
266− , testE "modify events" $ switchMergeEvents =<< modifyMerge =<< sparse
267−
268− , testB "static behaviors" $ pull . traverse sample <$> counters
269− , testB "increasing behaviors" $ switchMergeBehaviors =<< increasingMerge =<< counters
270− , testB "decreasing behaviors" $ switchMergeBehaviors =<< decreasingMerge =<< counters
271− , testB "modify behaviors" $ switchMergeBehaviors =<< modifyMerge =<< counters
272−
273−
274− -- , testE "increasing events/switchMerge" $ switchMergeMaybe =<< increasingMerge =<< sparse
275− -- , testE "decreasing events/switchMerge" $ switchMergeMaybe =<< decreasingMerge =<< sparse
276− -- , testE "modify events/switchMerge" $ switchMergeMaybe =<< modifyMerge =<< sparse
277− ]
278−
279− where
280− sparse :: TestPlan t m => m [Event t Word]
281− sparse = fmap (fmap (+1)) <$> occasional n 8 n
282−
283− counters :: TestPlan t m => m [Behavior t Int]
284− counters = countMany =<< sparse
285−
286−
287−
288−fans :: Word -> [(String, TestCase)]
289−fans n =
290− [ testE "fanMapChain" $ fanMergeChain n 10 <$> e
291− , testE "fmapFanMapChain" $ fmapFanMergeChain n 10 <$> e
292−
293− , testE "fanMerge " $ fanMerge n <$> events n
294−
295− , testE "fmapFanMerge " $ fmapFanMerge n <$> events n
296− , testE "triggerMerge" $ leftmost <$> for [1..n] (\i -> plan [(i, i)])
297−
298− ]
299− where
300−
301− e :: TestPlan t m => m (Event t Word)
302− e = events 100
303−
304−
305−
306−
307−dynamics :: Word -> [(String, TestCase)]
308−dynamics n =
309− [ testE "mapDynChain" $ fmap updated $ mapDynChain n =<< d
310− , testE "joinDynChain" $ fmap updated $ joinDynChain n =<< d
311− , testE "combineDynChain" $ fmap updated $ combineDynChain n =<< d
312− , testE "dense mergeTree" $ fmap (updated . mergeTreeDyn 8) dense
313− , testE "sparse mergeTree" $ fmap (updated . mergeTreeDyn 8) sparse
314− , testE "mergeDyn" $ fmap (updated . fmap sum . mergeListDyn) sparse
315− ] where
316−
317− d :: TestPlan t m => m (Dynamic t Word)
318− d = count =<< events 10
319−
320− sparse, dense :: TestPlan t m => m [Dynamic t Int]
321− sparse = countManyDyn =<< occasional n 8 16
322− dense = countManyDyn =<< continuous n 2
323−
324−
325−firing :: Word -> [(String, TestCase)]
326−firing n =
327− [ testE "fmapChain" $ fmapChain n <$> e
328− , testE "switchChain2" $ switchChain2 n =<< e
329− , testE "switchPromptlyChain" $ switchPromptlyChain n =<< e
330− , testE "switchFactors" $ switchFactors n =<< e
331− , testE "coincidenceChain" $ coinChain n <$> e
332−
333− , testE "dense mergeTree" $ mergeTree 8 <$> dense
334− , testE "sparse mergeTree" $ mergeTree 8 <$> sparse
335−
336− -- Triggers test failure in Spider
337− --, testE "runFrame" $ events n
338−
339− , testB "sum counters" $ do
340− counts <- counters
341− return $ pull $ sum <$> traverse sample counts
342−
343− , testB "pullChain" $ fmapChain n . current <$> (count =<< events 4)
344− , testB "pullChain2" $ do
345− es <- events 4
346− e' <- plan [(0, ())]
347−
348− b <- hold (constant 0) $
349− pushAlways (const $ fmapChain n <$> hold 0 es) e'
350−
351− return (join b)
352− , testB "counters/pullTree" $ mergeTree 8 <$> counters
353−
354− ]
355− where
356− e :: TestPlan t m => m (Event t Word)
357− e = events 10
358−
359− dense, sparse :: TestPlan t m => m [Event t Word]
360− dense = continuous n 2
361− sparse = occasional n 8 16
362−
363− counters :: TestPlan t m => m [Behavior t Int]
364− counters = countMany =<< sparse
365−
366−
367−
368−
369−
test/Reflex/Plan/Pure.hsdeleted−70
@@ -1,70 +0,0 @@
1−{-# LANGUAGE FlexibleContexts #-}
2−{-# LANGUAGE FlexibleInstances #-}
3−{-# LANGUAGE GADTs #-}
4−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
5−{-# LANGUAGE MultiParamTypeClasses #-}
6−{-# LANGUAGE RankNTypes #-}
7−{-# LANGUAGE ScopedTypeVariables #-}
8−
9−module Reflex.Plan.Pure where
10−
11−import Reflex
12−import Reflex.Pure
13−import Reflex.TestPlan
14−
15−import Control.Applicative
16−import Control.Monad.Fix
17−import Control.Monad.State
18−import Data.IntMap (IntMap)
19−import qualified Data.IntMap as IntMap
20−import Data.IntSet (IntSet)
21−import qualified Data.IntSet as IntSet
22−
23−import Data.Bifunctor
24−import Data.Maybe
25−import Data.Monoid
26−import Prelude
27−
28−
29−mapToPureEvent :: IntMap a -> Event (Pure Int) a
30−mapToPureEvent m = Event $ flip IntMap.lookup m
31−
32−type TimeM = (->) Int
33−newtype PurePlan a = PurePlan { unPlan :: StateT IntSet TimeM a } deriving (Functor, Applicative, Monad, MonadFix)
34−
35−liftPlan :: TimeM a -> PurePlan a
36−liftPlan = PurePlan . lift
37−
38−instance MonadHold (Pure Int) PurePlan where
39− hold initial = liftPlan . hold initial
40− holdDyn initial = liftPlan . holdDyn initial
41− holdIncremental initial = liftPlan . holdIncremental initial
42−
43−instance MonadSample (Pure Int) PurePlan where
44− sample = liftPlan . sample
45−
46−
47−instance TestPlan (Pure Int) PurePlan where
48− plan occs = do
49− PurePlan . modify $ IntSet.union (IntMap.keysSet m)
50− return $ mapToPureEvent m
51− where m = IntMap.fromList (first fromIntegral <$> occs)
52−
53−runPure :: PurePlan a -> (a, IntSet)
54−runPure (PurePlan p) = runStateT p mempty $ 0
55−
56−relavantTimes :: IntSet -> IntSet
57−relavantTimes occs = IntSet.fromList [0..l + 1]
58− where l = fromMaybe 0 (fst <$> IntSet.maxView occs)
59−
60−testBehavior :: (Behavior (Pure Int) a, IntSet) -> IntMap a
61−testBehavior (b, occs) = IntMap.fromSet (sample b) (relavantTimes occs)
62−
63−testEvent :: (Event (Pure Int) a, IntSet) -> IntMap (Maybe a)
64−testEvent (Event readEvent, occs) = IntMap.fromSet readEvent (relavantTimes occs)
65−
66−
67−
68−
69−
70−
test/Reflex/Plan/Reflex.hsdeleted−135
@@ -1,135 +0,0 @@
1−{-# LANGUAGE ConstraintKinds #-}
2−{-# LANGUAGE FlexibleContexts #-}
3−{-# LANGUAGE FlexibleInstances #-}
4−{-# LANGUAGE GADTs #-}
5−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
6−{-# LANGUAGE MultiParamTypeClasses #-}
7−{-# LANGUAGE RankNTypes #-}
8−{-# LANGUAGE ScopedTypeVariables #-}
9−{-# LANGUAGE StandaloneDeriving #-}
10−{-# LANGUAGE UndecidableInstances #-}
11−module Reflex.Plan.Reflex
12− ( TestPlan(..)
13− , runPlan
14− , Plan (..)
15− , Schedule
16− , Firing (..)
17− , MonadIORef
18−
19−
20− , readSchedule
21− , readSchedule_
22− , testSchedule
23− , readEvent'
24− , makeDense
25−
26− , runTestE
27− , runTestB
28−
29− ) where
30−
31−import Reflex.Class
32−import Reflex.Host.Class
33−import Reflex.TestPlan
34−
35−import Control.Applicative
36−import Control.Monad
37−import Control.Monad.Identity
38−import Control.Monad.State.Strict
39−
40−import Control.Monad.Ref
41−import Data.Dependent.Sum (DSum (..))
42−import qualified Data.IntMap.Strict as IntMap
43−import Data.Maybe
44−import Data.Monoid
45−import Data.Traversable (sequenceA, traverse)
46−
47−import Control.DeepSeq
48−import Control.Exception
49−import Data.IntMap.Strict (IntMap)
50−import Data.IORef
51−import System.Mem
52−
53−-- Note: this import must come last to silence warnings from AMP
54−import Prelude
55−
56−type MonadIORef m = (MonadIO m, MonadRef m, Ref m ~ Ref IO)
57−
58−data Firing t where
59− Firing :: IORef (Maybe (EventTrigger t a)) -> a -> Firing t
60−
61−
62−type Schedule t = IntMap [Firing t]
63−
64−-- Implementation of a TestPlan in terms of ReflexHost
65−newtype Plan t a = Plan (StateT (Schedule t) (HostFrame t) a)
66−
67−deriving instance ReflexHost t => Functor (Plan t)
68−deriving instance ReflexHost t => Applicative (Plan t)
69−deriving instance ReflexHost t => Monad (Plan t)
70−
71−deriving instance ReflexHost t => MonadSample t (Plan t)
72−deriving instance ReflexHost t => MonadHold t (Plan t)
73−deriving instance ReflexHost t => MonadFix (Plan t)
74−
75−
76−instance (ReflexHost t, MonadRef (HostFrame t), Ref (HostFrame t) ~ Ref IO) => TestPlan t (Plan t) where
77− plan occurances = Plan $ do
78− (e, ref) <- newEventWithTriggerRef
79− modify (IntMap.unionWith mappend (firings ref))
80− return e
81−
82− where
83− firings ref = IntMap.fromList (makeFiring ref <$> occurances)
84− makeFiring ref (t, a) = (fromIntegral t, [Firing ref a])
85−
86−
87−firingTrigger :: (MonadReflexHost t m, MonadIORef m) => Firing t -> m (Maybe (DSum (EventTrigger t) Identity))
88−firingTrigger (Firing ref a) = fmap (:=> Identity a) <$> readRef ref
89−
90−runPlan :: (MonadReflexHost t m) => Plan t a -> m (a, Schedule t)
91−runPlan (Plan p) = runHostFrame $ runStateT p mempty
92−
93−
94−makeDense :: Schedule t -> Schedule t
95−makeDense s = fromMaybe (emptyRange 0) $ do
96− (end, _) <- fst <$> IntMap.maxViewWithKey s
97− return $ IntMap.union s (emptyRange end)
98− where
99− emptyRange end = IntMap.fromList (zip [0..end + 1] (repeat []))
100−
101−
102−-- For the purposes of testing, we add in a zero frame and extend one frame (to observe changes to behaviors
103−-- after the last event)
104−-- performGC is called at each frame to test for GC issues
105−testSchedule :: (MonadReflexHost t m, MonadIORef m, NFData a) => Schedule t -> ReadPhase m a -> m (IntMap a)
106−testSchedule schedule readResult = IntMap.traverseWithKey (\t occs -> liftIO performGC *> triggerFrame readResult t occs) (makeDense schedule)
107−
108−readSchedule :: (MonadReflexHost t m, MonadIORef m, NFData a) => Schedule t -> ReadPhase m a -> m (IntMap a)
109−readSchedule schedule readResult = IntMap.traverseWithKey (triggerFrame readResult) schedule
110−
111−readSchedule_ :: (MonadReflexHost t m, MonadIORef m, NFData a) => Schedule t -> ReadPhase m a -> m ()
112−readSchedule_ schedule readResult = mapM_ (uncurry $ triggerFrame readResult) $ IntMap.toList schedule
113−
114−triggerFrame :: (MonadReflexHost t m, MonadIORef m, NFData a) => ReadPhase m a -> Int -> [Firing t] -> m a
115−triggerFrame readResult _ occs = do
116− triggers <- catMaybes <$> traverse firingTrigger occs
117− liftIO . evaluate . force =<< fireEventsAndRead triggers readResult
118−
119−readEvent' :: MonadReadEvent t m => EventHandle t a -> m (Maybe a)
120−readEvent' = readEvent >=> sequenceA
121−
122−
123−-- Convenience functions for running tests producing Events/Behaviors
124−runTestB :: (MonadReflexHost t m, MonadIORef m, NFData a) => Plan t (Behavior t a) -> m (IntMap a)
125−runTestB p = do
126− (b, s) <- runPlan p
127− testSchedule s $ sample b
128−
129−runTestE :: (MonadReflexHost t m, MonadIORef m, NFData a) => Plan t (Event t a) -> m (IntMap (Maybe a))
130−runTestE p = do
131− (e, s) <- runPlan p
132− h <- subscribeEvent e
133− testSchedule s (readEvent' h)
134−
135−
test/Reflex/Test.hsdeleted−66
@@ -1,66 +0,0 @@
1−{-# LANGUAGE ConstraintKinds #-}
2−{-# LANGUAGE FlexibleContexts #-}
3−{-# LANGUAGE FlexibleInstances #-}
4−{-# LANGUAGE GADTs #-}
5−{-# LANGUAGE MultiParamTypeClasses #-}
6−{-# LANGUAGE RankNTypes #-}
7−
8−module Reflex.Test
9− ( testAgreement
10− , compareResult
11− , runTests
12−
13− , module Reflex.TestPlan
14−
15− ) where
16−
17−import Reflex.Spider
18−
19−import Reflex.TestPlan
20−
21−import Reflex.Plan.Pure
22−import Reflex.Plan.Reflex
23−
24−import Control.Monad
25−import Data.Monoid
26−
27−import Data.IntMap (IntMap)
28−
29−--import Data.Foldable
30−import System.Exit
31−
32−import Prelude
33−
34−
35−testAgreement :: TestCase -> IO Bool
36−testAgreement (TestE p) = do
37− spider <- runSpiderHost $ runTestE p
38− let results = [("spider", spider)]
39−
40− compareResult results (testEvent $ runPure p)
41−
42−testAgreement (TestB p) = do
43− spider <- runSpiderHost $ runTestB p
44− let results = [("spider", spider)]
45−
46− compareResult results (testBehavior $ runPure p)
47−
48−
49−compareResult :: (Show a, Eq a) => [(String, IntMap a)] -> IntMap a -> IO Bool
50−compareResult results expected = fmap and $ forM results $ \(name, r) -> do
51−
52− when (r /= expected) $ do
53− putStrLn ("Got: " ++ show (name, r))
54− putStrLn ("Expected: " ++ show expected)
55− return (r == expected)
56−
57−
58−runTests :: [(String, TestCase)] -> IO ()
59−runTests testCases = do
60− results <- forM testCases $ \(name, test) -> do
61− putStrLn $ "Test: " <> name
62− testAgreement test
63− exitWith $ if and results
64− then ExitSuccess
65− else ExitFailure 1
66−
test/Reflex/Test/CrossImpl.hsdeleted−244
@@ -1,244 +0,0 @@
1−{-# LANGUAGE ConstraintKinds #-}
2−{-# LANGUAGE ExistentialQuantification #-}
3−{-# LANGUAGE FlexibleContexts #-}
4−{-# LANGUAGE FlexibleInstances #-}
5−{-# LANGUAGE FunctionalDependencies #-}
6−{-# LANGUAGE GADTs #-}
7−{-# LANGUAGE LambdaCase #-}
8−{-# LANGUAGE MultiParamTypeClasses #-}
9−{-# LANGUAGE NoMonomorphismRestriction #-}
10−{-# LANGUAGE RankNTypes #-}
11−{-# LANGUAGE ScopedTypeVariables #-}
12−{-# LANGUAGE TypeFamilies #-}
13−{-# LANGUAGE TypeOperators #-}
14−{-# LANGUAGE UndecidableInstances #-}
15−module Reflex.Test.CrossImpl (test) where
16−
17−import Prelude hiding (and, foldl, mapM, mapM_, sequence, sequence_)
18−
19−import Control.Monad.Ref
20−import Reflex.Class
21−import Reflex.Dynamic
22−import Reflex.Host.Class
23−import qualified Reflex.Pure as P
24−import qualified Reflex.Spider.Internal as S
25−
26−import Control.Arrow (second, (&&&))
27−import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
28−import Control.Monad.State.Strict hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
29−import Control.Monad.Writer hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
30−import Data.Dependent.Map (DSum (..))
31−import Data.Foldable
32−import Data.Map.Strict (Map)
33−import qualified Data.Map.Strict as Map
34−import qualified Data.Set as Set
35−import Data.Traversable
36−import System.Exit
37−import System.Mem
38−
39−import System.IO.Unsafe
40−
41−mapToPureBehavior :: Map Int a -> Behavior PureReflexDomain a
42−mapToPureBehavior m = P.Behavior $ \t -> case Map.lookupLE t m of
43− Nothing -> error $ "mapToPureBehavior: no value for time " <> show t
44− Just (_, v) -> v
45−
46−mapToPureEvent :: Map Int a -> Event PureReflexDomain a
47−mapToPureEvent m = P.Event $ flip Map.lookup m
48−
49−relevantTestingTimes :: (Map Int a, Map Int b) -> [Int]
50−relevantTestingTimes (b, e) = case Set.minView &&& Set.maxView $ Map.keysSet b `Set.union` Map.keysSet e of
51− (Just (t0, _), Just (t1, _)) -> [t0..t1+1] -- We need to go to b+1 to see the result of the final event
52− _ -> [] -- Doesn't actually make much sense
53−
54−type PureReflexDomain = P.Pure Int
55−type TimeM = (->) Int
56−
57−testPure :: (t ~ PureReflexDomain, m ~ TimeM) => ((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)
58−testPure builder (b, e) =
59− let (P.Behavior b', P.Event e') = ($ 0) $ builder (mapToPureBehavior b, mapToPureEvent e)
60− relevantTimes = relevantTestingTimes (b, e)
61− e'' = Map.mapMaybe id $ Map.fromList $ map (id &&& e') relevantTimes
62− b'' = Map.fromList $ map (id &&& b') relevantTimes
63− in (b'', e'')
64−
65−class MapMSignals a a' t t' | a -> t, a' -> t', a t' -> a', a' t -> a where
66− mapMSignals :: Monad m => (forall b. Behavior t b -> m (Behavior t' b)) -> (forall b. Event t b -> m (Event t' b)) -> a -> m a'
67−
68−instance MapMSignals (Behavior t a) (Behavior t' a) t t' where
69− mapMSignals fb _ = fb
70−
71−instance MapMSignals (Event t a) (Event t' a) t t' where
72− mapMSignals _ fe = fe
73−
74−instance (MapMSignals a a' t t', MapMSignals b b' t t') => MapMSignals (a, b) (a', b') t t' where
75− mapMSignals fb fe (a, b) = liftM2 (,) (mapMSignals fb fe a) (mapMSignals fb fe b)
76−
77−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)
78−testSpider builder (bMap, eMap) = unsafePerformIO $ S.runSpiderHost $ do
79− (re, reTrigger) <- newEventWithTriggerRef
80− (rb, rbTrigger) <- newEventWithTriggerRef
81− b <- runHostFrame $ hold (error "testSpider: No value for input behavior yet") rb
82− (b', e') <- runHostFrame $ builder (b, re)
83− e'Handle <- subscribeEvent e' --TODO: This should be unnecessary
84− let times = relevantTestingTimes (bMap, eMap)
85− liftIO performGC
86− outputs <- forM times $ \t -> do
87− forM_ (Map.lookup t bMap) $ \val -> mapM_ (\ rbt -> fireEvents [rbt :=> Identity val]) =<< readRef rbTrigger
88− bOutput <- sample b'
89− eOutput <- fmap join $ forM (Map.lookup t eMap) $ \val -> do
90− mret <- readRef reTrigger
91− let firing = case mret of
92− Just ret -> [ret :=> Identity val]
93− Nothing -> []
94− fireEventsAndRead firing $ sequence =<< readEvent e'Handle
95− liftIO performGC
96− return (t, (bOutput, eOutput))
97− return (Map.fromList $ map (second fst) outputs, Map.mapMaybe id $ Map.fromList $ map (second snd) outputs)
98−
99−tracePerf :: Show a => a -> b -> b
100−tracePerf = flip const
101−
102−testAgreement :: (Eq c, Eq d, Show c, Show d) => (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) -> IO Bool
103−testAgreement builder inputs = do
104− let identityResult = testPure builder inputs
105− tracePerf "---------" $ return ()
106− let spiderResult = testSpider builder inputs
107− tracePerf "---------" $ return ()
108− let resultsAgree = identityResult == spiderResult
109− if resultsAgree
110− then do putStrLn "Success:"
111− print identityResult
112− else do putStrLn "Failure:"
113− putStrLn $ "Pure result: " <> show identityResult
114− putStrLn $ "Spider result: " <> show spiderResult
115− return resultsAgree
116−
117−type TestCaseConstraint t m = (Reflex t, MonadSample t m, MonadHold t m, MonadFix m, MonadFix (PushM t))
118−
119−data TestCase = forall a b c d. (Eq c, Eq d, Show c, Show d) => TestCase (Map Int a, Map Int b) (forall m t. TestCaseConstraint t m => (Behavior t a, Event t b) -> m (Behavior t c, Event t d))
120−
121−testCases :: [(String, TestCase)]
122−testCases =
123− [ (,) "hold" $ TestCase (Map.singleton 0 "asdf", Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(_, e) -> do
124− b' <- hold "123" e
125− return (b', e)
126− , (,) "count" $ TestCase (Map.singleton 0 (), Map.fromList [(1, ()), (2, ()), (3, ())]) $ \(_, e) -> do
127− e' <- updated <$> count e
128− b' <- hold (0 :: Int) e'
129− return (b', e')
130− , (,) "onceE-1" $ TestCase (Map.singleton 0 "asdf", Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
131− e' <- onceE $ leftmost [e, e]
132− return (b, e')
133− , (,) "switch-1" $ TestCase (Map.singleton 0 "asdf", Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
134− let e' = fmap (const e) e
135− b' <- hold never e'
136− let e'' = switch b'
137− return (b, e'')
138− , (,) "switch-2" $ TestCase (Map.singleton 0 "asdf", Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
139− let e' = flip pushAlways e $ const $ do
140− let eab = splitRecombineEvent e
141− switch <$> hold eab never
142− e'' = coincidence e'
143− return (b, e'')
144− , (,) "switch-3" $ TestCase (Map.singleton 0 "asdf", Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
145− let e' = flip pushAlways e $ const $ do
146− let eab = splitRecombineEvent e
147− switch <$> hold eab (fmap (const e) e)
148− e'' = coincidence e'
149− return (b, e'')
150− , (,) "switch-4" $ TestCase (Map.singleton 0 "asdf", Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
151− let e' = leftmost [e, e]
152− e'' <- switch <$> hold e' (fmap (const e) e)
153− return (b, e'')
154− , (,) "switchPromptly-1" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
155− let e' = fmap (const e) e
156− e'' <- switchPromptly never e'
157− return (b, e'')
158− , (,) "switchPromptly-2" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
159− let e' = fmap (const e) e
160− e'' <- switchPromptly never $ leftmost [e', e']
161− return (b, e'')
162− , (,) "switchPromptly-3" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
163− let e' = leftmost [e, e]
164− e'' <- switchPromptly never (fmap (const e) e')
165− return (b, e'')
166− , (,) "switchPromptly-4" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj"), (3, "asdf")]) $ \(b, e) -> do
167− let e' = leftmost [e, e]
168− e'' <- switchPromptly never (fmap (const e') e)
169− return (b, e'')
170− , (,) "switch-5" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
171− let e' = leftmost [e, e]
172− e'' <- switch <$> hold never (fmap (const e') e)
173− return (b, e'')
174− , (,) "switchPromptly-5" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
175− let e' = flip push e $ \_ -> do
176− Just <$> onceE e
177− e'' <- switchPromptly never e'
178− return (b, e'')
179− , (,) "switchPromptly-6" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
180− let e' = flip pushAlways e $ \_ -> do
181− switchPromptly e never
182− e'' <- switchPromptly never e'
183− return (b, e'')
184− , (,) "coincidence-1" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
185− let e' = flip pushAlways e $ \_ -> return e
186− e'' = coincidence e'
187− return (b, e'')
188− , (,) "coincidence-2" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
189− let e' = flip pushAlways e $ \_ -> return $ leftmost [e, e]
190− e'' = coincidence e'
191− return (b, e'')
192− , (,) "coincidence-3" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
193− let e' = flip pushAlways e $ \_ -> return $ coincidence $ fmap (const e) e
194− e'' = coincidence e'
195− return (b, e'')
196− , (,) "coincidence-4" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj"), (3, "asdf")]) $ \(b, e) -> do
197− let e' = flip pushAlways e $ \_ -> onceE e
198− e'' = coincidence e'
199− return (b, e'')
200− , (,) "coincidence-5" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer")]) $ \(b, e) -> do
201− let eChild = flip pushAlways e $ const $ do
202− let eNewValues = leftmost [e, e]
203− return $ coincidence $ fmap (const eNewValues) eNewValues
204− e' = coincidence eChild
205− return (b, e')
206− , (,) "coincidence-6" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer")]) $ \(b, e) -> do
207− let eChild = flip pushAlways e $ const $ do
208− let e' = coincidence $ fmap (const e) e
209− return $ leftmost [e', e']
210− e'' = coincidence eChild
211− return (b, e'')
212− , (,) "coincidence-7" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj"), (3, "asdf")]) $ \(b, e) -> do
213− let e' = leftmost [e, e]
214− eCoincidences = coincidence $ fmap (const e') e
215− return (b, eCoincidences)
216− , (,) "holdWhileFiring" $ TestCase (Map.singleton 0 "zxc", Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
217− eo <- onceE e
218− bb <- hold b $ pushAlways (const $ hold "asdf" eo) eo
219− let b' = pull $ sample =<< sample bb
220− return (b', e)
221− , (,) "joinDyn" $ TestCase (Map.singleton 0 (0 :: Int), Map.fromList [(1, "qwer"), (2, "lkj")]) $ \(b, e) -> do
222− bb <- hold "b" e
223− bd <- hold never . fmap (const e) =<< onceE e
224− eOuter <- pushAlways sample . fmap (const bb) <$> onceE e
225− let eInner = switch bd
226− e' = leftmost [eOuter, eInner]
227− return (b, e')
228− ]
229−
230−splitRecombineEvent :: Reflex t => Event t a -> Event t String
231−splitRecombineEvent e =
232− let ea = "a" <$ e
233− eb = "b" <$ e
234− in leftmost [ea, eb]
235−
236−
237−test :: IO ()
238−test = do
239− results <- forM testCases $ \(name, TestCase inputs builder) -> do
240− putStrLn $ "Test: " <> name
241− testAgreement builder inputs
242− exitWith $ if and results
243− then ExitSuccess
244− else ExitFailure 1
test/Reflex/Test/Micro.hsdeleted−263
@@ -1,263 +0,0 @@
1−{-# LANGUAGE ConstraintKinds #-}
2−{-# LANGUAGE FlexibleContexts #-}
3−{-# LANGUAGE FlexibleInstances #-}
4−{-# LANGUAGE GADTs #-}
5−{-# LANGUAGE MultiParamTypeClasses #-}
6−{-# LANGUAGE RankNTypes #-}
7−
8−module Reflex.Test.Micro (testCases) where
9−
10−import Reflex
11−import Reflex.TestPlan
12−
13−import Control.Applicative
14−import Control.Monad
15−import Data.Char
16−import Data.Functor.Misc
17−import Data.Monoid
18−
19−import Data.Foldable
20−
21−import qualified Data.Map as Map
22−
23−import Prelude
24−
25−testCases :: [(String, TestCase)]
26−testCases =
27− [ testB "hold" $ hold "0" =<< events1
28−
29− , testB "count" $ do
30− b <- current <$> (count =<< events2)
31− return $ (+ (0::Int)) <$> b
32−
33− , testB "pull-1" $ do
34− b <- hold "0" =<< events1
35− return (pull $ sample $ pull $ sample b)
36−
37− , testB "pull-2" $ do
38− b1 <- behavior1
39− return (pull $ liftA2 (<>) (sample b1) (sample b1))
40−
41− , testB "pull-3" $ do
42− b1 <- behavior1
43− b2 <- behavior2
44− return (pull $ liftA2 (<>) (sample b1) (sample b2))
45−
46− , testB "pull-4" $ do
47− es <- planList ["a", "b", "c"]
48− e <- plan [(0, ())]
49− b <- hold (constant "") $
50− pushAlways (const $ hold "z" es) e
51− return (join b)
52−
53− , testE "tag-1" $ do
54− b1 <- behavior1
55− e <- events2
56− return (tag b1 e)
57−
58− , testE "tag-2" $ do
59− b1 <- behavior1
60− e <- events2
61− return (tag (map toUpper <$> b1) e)
62−
63− , testE "attach-1" $ do
64− b1 <- behavior1
65− e <- events2
66− return (attachWith (++) (map toUpper <$> b1) e)
67−
68− , testE "leftmost" $ liftA2 leftmost2 events1 events2
69−
70− , testE "appendEvents-1" $ liftA2 mappend events1 events2
71−
72− , testE "appendEvents-2" $ liftA2 mappend events3 events2
73−
74− , testE "merge-1" $ do
75− e <- events1
76− return $ leftmost ["x" <$ e, "y" <$ e]
77−
78− , testE "merge-2" $ do
79− e <- events1
80− let m = mergeMap $ Map.fromList [(1::Int, "y" <$ e), (2, "z" <$ e)]
81− let ee = flip pushAlways e $ const $ return m
82− return $ coincidence ee
83−
84− , testE "headE-1" $ do
85− e <- events1
86− headE $ leftmost [e, e]
87−
88− , testE "headE-2" $ do
89− e <- events1
90− b <- hold never (e <$ e)
91− headE $ switch b
92−
93− , testE "switch-1" $ do
94− e <- events1
95− b <- hold never (e <$ e)
96− return $ switch b
97−
98− , testE "switch-2" $ do
99− e <- events1
100− return $ coincidence $ flip pushAlways e $ const $ do
101− switch <$> hold (leftmost ["x" <$ e, "y" <$ e, "z" <$ e]) (e <$ e)
102−
103− , testE "switch-3" $ do
104− e <- events1
105− return $ coincidence $ flip pushAlways e $ const $ do
106− switch <$> hold (leftmost ["x" <$ e, "y" <$ e, "z" <$ e]) never
107−
108− , testE "switch-4" $ do
109− e <- events1
110− switch <$> hold (deep e) (e <$ e)
111−
112− , testE "switch-5" $ do
113− e <- events1
114− return $ coincidence $ flip pushAlways e $ const $
115− return $ leftmost ["x" <$ e, "y" <$ e, "z" <$ e]
116−
117− , testE "switch-6" $ do
118− e <- events1
119− return $ coincidence $ flip pushAlways e $ const $ do
120− switch <$> hold ("x" <$ e) (e <$ e)
121−
122− , testE "switchPromptly-1" $ do
123− e <- events1
124− let e' = e <$ e
125− switchPromptly never $ e <$ e'
126−
127− , testE "switchPromptly-2" $ do
128− e <- events1
129− switchPromptly never $ deep (e <$ e)
130−
131− , testE "switchPromptly-3" $ do
132− e <- events1
133− switchPromptly never $ (e <$ deep e)
134−
135− , testE "switchPromptly-4" $ do
136− e <- events1
137− switchPromptly never $ (deep e <$ e)
138−
139− , testE "switch-5" $ do
140− e <- events1
141− switch <$> hold never (deep e <$ e)
142−
143− , testE "switchPromptly-5" $ do
144− e <- events1
145− switchPromptly never $ flip push e $
146− const (Just <$> headE e)
147−
148− , testE "switchPromptly-6" $ do
149− e <- events1
150− switchPromptly never $ flip pushAlways e $
151− const (switchPromptly e never)
152−
153− , testE "coincidence-1" $ do
154− e <- events1
155− return $ coincidence $ flip pushAlways e $
156− const $ return e
157−
158− , testE "coincidence-2" $ do
159− e <- events1
160− return $ coincidence $ flip pushAlways e $
161− const $ return (deep e)
162−
163− , testE "coincidence-3" $ do
164− e <- events1
165− return $ coincidence $ flip pushAlways e $
166− const $ return (coincidence (e <$ e))
167−
168− , testE "coincidence-4" $ do
169− e <- events1
170− return $ coincidence $ flip pushAlways e $
171− const (headE e)
172−
173− , testE "coincidence-5" $ do
174− e <- events1
175− return $ coincidence $ flip pushAlways e $ const $ do
176− let e' = deep e
177− return (coincidence (e' <$ e'))
178−
179− , testE "coincidence-6" $ do
180− e <- events1
181− return $ coincidence $ flip pushAlways e $ const $ do
182− let e' = coincidence (e <$ e)
183− return $ deep e'
184−
185− , testE "coincidence-7" $ do
186− e <- events1
187− return $ coincidence (deep e <$ e)
188−
189− , testB "holdWhileFiring" $ do
190− e <- events1
191− eo <- headE e
192− bb <- hold (constant "x") $ pushAlways (const $ hold "a" eo) eo
193− return $ pull $ sample =<< sample bb
194−
195− , testE "joinDyn" $ do
196− e <- events1
197− bb <- hold "b" e
198− bd <- hold never . fmap (const e) =<< headE e
199−
200− eOuter <- pushAlways sample . fmap (const bb) <$> headE e
201− let eInner = switch bd
202− return $ leftmost [eOuter, eInner]
203−
204− , testB "foldDyn" $ do
205− d <- foldDyn (++) "0" =<< events1
206− return (current d)
207−
208− , testB "mapDyn" $ do
209− d <- foldDyn (++) "0" =<< events1
210− return $ current $ fmap (map toUpper) d
211−
212− , testB "combineDyn" $ do
213− d1 <- foldDyn (++) "0" =<< events1
214− d2 <- fmap (fmap (map toUpper)) $ foldDyn (++) "0" =<< events2
215−
216− return $ current $ zipDynWith (<>) d1 d2
217− , testE "fan-1" $ do
218− e <- fmap toMap <$> events1
219− let es = select (fanMap e) . Const2 <$> values
220−
221− return (mergeList es)
222−
223− , testE "fan-2" $ do
224− e <- fmap toMap <$> events3
225− let es = select (fanMap e) . Const2 <$> values
226−
227− return (mergeList es)
228−
229− , testE "fan-3" $ do
230− f <- fanMap . fmap toMap <$> events3
231− return $ select f (Const2 'c')
232−
233− , testE "fan-4" $ do
234− e <- fmap toMap <$> events1
235− return $ toUpper <$> select (fanMap e) (Const2 'a')
236−
237− , testE "fan-5" $ do
238− e <- fmap toMap <$> events2
239− return $ toUpper <$> select (fanMap e) (Const2 'c')
240−
241− , testE "fan-6" $ do
242− f <- fanMap . fmap toMap <$> events1
243− return $ toList <$> mergeList [ select f (Const2 'b'), select f (Const2 'b'), select f (Const2 'e'), select f (Const2 'e') ]
244−
245− ] where
246−
247− events1, events2, events3 :: TestPlan t m => m (Event t String)
248− events1 = plan [(1, "a"), (2, "b"), (5, "c"), (7, "d"), (8, "e")]
249− events2 = plan [(1, "e"), (3, "d"), (4, "c"), (6, "b"), (7, "a")]
250−
251− events3 = liftA2 mappend events1 events2
252−
253− values = "abcde"
254− toMap str = Map.fromList $ map (\c -> (c, c)) str
255−
256− behavior1, behavior2 :: forall t m. TestPlan t m => m (Behavior t String)
257− behavior1 = hold "1" =<< events1
258− behavior2 = hold "2" =<< events2
259−
260− deep e = leftmost [e, e]
261− leftmost2 e1 e2 = leftmost [e1, e2]
262−
263−
test/Reflex/TestPlan.hsdeleted−52
@@ -1,52 +0,0 @@
1−{-# LANGUAGE ConstraintKinds #-}
2−{-# LANGUAGE FlexibleContexts #-}
3−{-# LANGUAGE FlexibleInstances #-}
4−{-# LANGUAGE GADTs #-}
5−{-# LANGUAGE MultiParamTypeClasses #-}
6−{-# LANGUAGE RankNTypes #-}
7−{-# LANGUAGE ScopedTypeVariables #-}
8−{-# LANGUAGE UndecidableInstances #-}
9−module Reflex.TestPlan
10− ( TestPlan(..)
11−
12− , TestCase (..)
13− , testE, testB
14− , TestE, TestB
15−
16− , planList
17−
18− ) where
19−
20−import Control.DeepSeq
21−import Control.Monad.Fix
22−import Data.Word
23−import Reflex.Class
24−
25−
26−import Prelude
27−
28−class (Reflex t, MonadHold t m, MonadFix m) => TestPlan t m where
29− -- | Speicify a plan of an input Event firing
30− -- Occurances must be in the future (i.e. Time > 0)
31− -- Initial specification is
32−
33− plan :: [(Word, a)] -> m (Event t a)
34−
35−
36−planList :: TestPlan t m => [a] -> m (Event t a)
37−planList xs = plan $ zip [1..] xs
38−
39−type TestE a = forall t m. TestPlan t m => m (Event t a)
40−type TestB a = forall t m. TestPlan t m => m (Behavior t a)
41−
42−data TestCase where
43− TestE :: (Show a, Eq a, NFData a) => TestE a -> TestCase
44− TestB :: (Show a, Eq a, NFData a) => TestB a -> TestCase
45−
46−-- Helpers to declare test cases
47−testE :: (Eq a, Show a, NFData a) => String -> TestE a -> (String, TestCase)
48−testE name test = (name, TestE test)
49−
50−testB :: (Eq a, Show a, NFData a) => String -> TestB a -> (String, TestCase)
51−testB name test = (name, TestB test)
52−
test/hlint.hs+34−11
@@ -1,16 +1,39 @@
1+module Main where
2+
3+import Control.Monad
1−import Language.Haskell.HLint3 (hlint)
4+import Language.Haskell.HLint (hlint)
5+import System.Directory
2import System.Exit (exitFailure, exitSuccess)
6import System.Exit (exitFailure, exitSuccess)
7+import System.FilePath
8+import System.FilePath.Find
3
9
4main :: IO ()
10main :: IO ()
5main = do
11main = do
6− ideas <- hlint
12+ pwd <- getCurrentDirectory
7− [ "."
13+ let runHlint f = hlint $ f:
8− , "--ignore=Redundant do"
14+ [ "--ignore=Redundant do"
9− , "--ignore=Use camelCase"
15+ , "--ignore=Use camelCase"
10− , "--ignore=Redundant $"
16+ , "--ignore=Redundant $"
17+ , "--ignore=Use &&"
11− , "--ignore=Use &&&"
18+ , "--ignore=Use &&&"
12− , "--ignore=Use const"
19+ , "--ignore=Use const"
13− , "--ignore=Use >=>"
20+ , "--ignore=Use >=>"
14− , "--ignore=Use ."
21+ , "--ignore=Use ."
22+ , "--ignore=Use unless"
23+ , "--ignore=Reduce duplication"
24+ , "--cpp-define=USE_TEMPLATE_HASKELL"
25+ , "--ignore=Use tuple-section"
26+ , "--ignore=Unused LANGUAGE pragma" -- hlint3 falsely believes that TypeOperators is not needed
27+ ]
28+ recurseInto = and <$> sequence
29+ [ fileType ==? Directory
30+ , fileName /=? ".git"
31+ ]
32+ matchFile = and <$> sequence
33+ [ extension ==? ".hs"
15− ]
34+ ]
35+ files <- find recurseInto matchFile (pwd </> "src") --TODO: Someday fix all hints in tests, etc.
36+ ideas <- fmap concat $ forM files $ \f -> do
37+ putStr $ "linting file " ++ drop (length pwd + 1) f ++ "... "
38+ runHlint f
16 if null ideas then exitSuccess else exitFailure
39 if null ideas then exitSuccess else exitFailure
test/semantics.hsdeleted−49
@@ -1,49 +0,0 @@
1−{-# LANGUAGE ConstraintKinds #-}
2−{-# LANGUAGE FlexibleContexts #-}
3−{-# LANGUAGE FlexibleInstances #-}
4−{-# LANGUAGE GADTs #-}
5−{-# LANGUAGE MultiParamTypeClasses #-}
6−{-# LANGUAGE RankNTypes #-}
7−
8−module Main (main) where
9−
10−import Reflex.Test
11−
12−import Data.Bifunctor
13−import Data.Functor
14−import Data.List
15−import qualified Reflex.Bench.Focused as Focused
16−import qualified Reflex.Test.Micro as Micro
17−
18−import System.Environment
19−import System.Exit
20−
21−import Prelude
22−
23−matchPrefixes :: [String] -> (String -> Bool)
24−matchPrefixes [] = const True
25−matchPrefixes args = \name -> any (`isPrefixOf` name) args
26−
27−
28−main :: IO ()
29−main = do
30− args <- getArgs
31−
32− case args of
33− ["--list"] -> mapM_ putStrLn (fst <$> allTests) >> exitWith (ExitFailure 1)
34− _ -> case filter (matchPrefixes args . fst) allTests of
35− [] -> putStrLn "filter did not match any tests" >> exitWith (ExitFailure 1)
36− tests -> runTests tests
37−
38− where
39− allTests = concat
40− [ makeGroup "micro" Micro.testCases
41− , makeGroup "subscribing (100,40)" (Focused.subscribing 100 40)
42− , makeGroup "firing 1000" (Focused.firing 1000)
43− , makeGroup "merge 100" (Focused.merging 100)
44− , makeGroup "fan 50" (Focused.fans 50)
45− ]
46−
47− makeGroup name tests = first (\test -> intercalate "/" [name, test]) <$> tests
48−
49−
test/tests.hsnew file+43
@@ -0,0 +1,43 @@
1+{-# LANGUAGE TemplateHaskell #-}
2+module Main where
3+
4+import Test.HUnit (runTestTT, (~:), assertEqual, errors, failures, test)
5+import Data.Patch ( Patch(apply) )
6+import Data.Patch.MapWithMove ( patchThatChangesMap )
7+import Data.Map as Map ( Map, fromList, singleton )
8+import Hedgehog (checkParallel, discover, Property, property, forAll, PropertyT, (===))
9+import Hedgehog.Gen as Gen ( int )
10+import Hedgehog.Range as Range ( linear )
11+import Control.Monad (replicateM)
12+import System.Exit (exitFailure, exitSuccess)
13+import Data.Sequence as Seq ( foldMapWithIndex, replicateM )
14+
15+main :: IO ()
16+main = do
17+ counts <- runTestTT $ test [
18+ "Simple Move" ~: (do
19+ let mapBefore = Map.fromList [(0,1)]
20+ mapAfter = Map.fromList [(0,0),(1,1)]
21+ patch = patchThatChangesMap mapBefore mapAfter
22+ afterPatch = apply patch mapBefore
23+ assertEqual "Patch creates the same Map" (Just mapAfter) afterPatch),
24+ "Property Checks" ~: propertyChecks
25+ ]
26+ if errors counts + failures counts == 0 then exitSuccess else exitFailure
27+
28+propertyChecks :: IO Bool
29+propertyChecks = checkParallel $$(discover)
30+
31+prop_patchThatChangesMap :: Property
32+prop_patchThatChangesMap = property $ do
33+ mapBefore <- makeRandomIntMap
34+ mapAfter <- makeRandomIntMap
35+ let patch = patchThatChangesMap mapBefore mapAfter
36+ Just mapAfter === apply patch mapBefore
37+
38+makeRandomIntMap :: Monad m => PropertyT m (Map Int Int)
39+makeRandomIntMap = do
40+ let genNum = Gen.int (Range.linear 0 100)
41+ length <- forAll genNum
42+ listOfNumbers <- forAll $ Seq.replicateM length genNum
43+ pure $ Seq.foldMapWithIndex Map.singleton listOfNumbers