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
.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−15
@@ -1,15 +0,0 @@
1−# Cache Buster: 0
2−language: nix
3−cache:
4− directories:
5− - /nix
6−matrix:
7− include:
8− - env: COMPILER=ghc7103
9− - env: COMPILER=ghc801
10− - env: COMPILER=ghcjs
11−script:
12− - set -e
13− - nix-build -E "with (import <nixpkgs> {}); pkgs.haskell.packages.$COMPILER.callPackage ./default.nix { }"
14− - nix-collect-garbage -d # This is important to do right before 'script' ends so the cache gets GCed
15−
CONTRIBUTING.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−183
@@ -1,183 +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−[ ] <> :: Semigroup a => Event a -> Event a -> Event a
52−[ ] difference :: Event a -> Event b -> Event a
53−[ ] align :: Event a -> Event b -> Event (These a b)
54−[ ] alignWith :: (These a b -> c) -> Event a -> Event b -> Event c
55−[ ] mergeWith :: (a -> a -> a) -> [Event a] -> Event a
56−[ ] leftmost :: [Event a] -> Event a
57−[ ] mergeList :: [Event a] -> Event (NonEmpty a)
58−[ ] merge :: GCompare k => DMap (WrapArg Event k) -> Event (DMap k)
59−[ ] mergeMap :: Ord k => Map k (Event a) -> Event (Map k a)
60−
61−-- Efficient one-to-many fanout
62−[ ] fanMap :: Ord k => Event (Map k a) -> EventSelector (Const2 k a)
63−[ ] fan :: GCompare k => Event (DMap k) -> EventSelector k
64−[ ] select :: EventSelector k -> k a -> Event a
65−[ ] fanEither :: Event (Either a b) -> (Event a, Event b)
66−[ ] fanThese :: Event (These a b) -> (Event a, Event b)
67−
68−-- Event to Event via function that can sample current values
69−[ ] push :: (a -> m (Maybe b)) -> Event a -> Event b
70−[ ] pushAlways :: (a -> m b ) -> Event a -> Event b
71− -- Note supplied function operates in [H] context
72−
73−-- Split Event into next occurrence and all other future occurrences, as of now.
74−[H] headE :: Event a -> m (Event a)
75−[H] tailE :: Event a -> m (Event a)
76−[H] headTailE :: Event a -> m (Event a, Event a)
77−```
78−
79−## Functions producing Behavior
80−
81−```haskell
82−-- Trivial Behavior
83−[ ] constant :: a -> Behavior a
84−
85−-- Extract Behavior from Dynamic
86−[ ] current :: Dynamic a -> Behavior a
87−
88−-- Create Behavior with given initial value, updated when the Event fires.
89−[H] hold :: a -> Event a -> m (Behavior a)
90−
91−-- Transform Behavior to Behavior using function
92−[ ] fmap :: (a -> b) -> Behavior a -> Behavior b
93−[ ] ffor :: Behavior a -> (a -> b) -> Behavior b
94−[ ] <*> :: Behavior (a -> b) -> Behavior a -> Behavior b
95−[ ] >>= :: Behavior a -> (a -> Behavior b) -> Behavior b
96−[ ] <> :: Monoid a => Behavior a -> Behavior a -> Behavior a
97−-- ... plus many more due to typeclass membership
98−
99−-- Behavior to Behavior by sampling current values
100−[S] sample :: Behavior a -> m a
101−[ ] pull :: m a -> Behavior a
102− -- Note supplied value is in [S] context
103−```
104−
105−## Functions producing Dynamic
106−
107−```haskell
108−-- Trivial Dynamic
109−[ ] constDyn :: a -> Dynamic a
110−
111−-- Create Dynamic with given initial value, updated (various ways) when the Event fires.
112−[H] holdDyn :: a -> Event a -> m (Dynamic a)
113−[H] foldDyn :: (a -> b -> b ) -> b -> Event a -> m (Dynamic b)
114−[H] foldDynMaybe :: (a -> b -> Maybe b ) -> b -> Event a -> m (Dynamic b)
115−[H] foldDynM :: (a -> b -> m' b ) -> b -> Event a -> m (Dynamic b)
116−[H] foldDynMaybeM :: (a -> b -> m' (Maybe b)) -> b -> Event a -> m (Dynamic b)
117− -- Note m' supplies [H] context
118−
119−-- Initial value is 0; counts Event firings from now.
120−[H] count :: Num b => Event a -> m (Dynamic b)
121−-- Initial Bool value is supplied; toggles at each Event firing.
122−[H] toggle :: Bool -> Event a -> m (Dynamic Bool)
123−
124−-- Transform Dynamic to Dynamic using function
125−[ ] ffor :: Dynamic a -> (a -> b) -> Dynamic b
126−[ ] fmap :: (a -> b) -> Dynamic a -> Dynamic b
127−[ ] splitDynPure :: Dynamic (a, b) -> (Dynamic a, Dynamic b)
128−
129−-- Combine multiple Dynamics
130−[ ] mconcat :: Monoid a => [Dynamic a] -> Dynamic a
131−[ ] distributeDMapOverDynPure :: GCompare k => DMap (WrapArg Dynamic k) -> Dynamic (DMap k)
132−[ ] <*> :: Dynamic (a -> b) -> Dynamic a -> Dynamic b
133−[ ] >>= :: Dynamic a -> (a -> Dynamic b) -> Dynamic b
134−[ ] zipDynWith :: (a -> b -> c) -> Dynamic a -> Dynamic b -> Dynamic c
135−
136−-- Efficient one-to-many fanout
137−[ ] demux :: Ord k => Dynamic k -> Demux k
138−[ ] demuxed :: Eq k => Demux k -> k -> Dynamic Bool
139−
140−-- Dynamic to Dynamic, removing updates w/o value change
141−[ ] uniqDyn :: Eq a => Dynamic a -> Dynamic a
142−
143−-- Dynamic to identical Dynamic with debug trace. (Only prints if Dynamic is ultimately used.)
144−[ ] traceDyn :: Show a => String -> Dynamic a -> Dynamic a
145−[ ] traceDynWith :: (a -> String) -> Dynamic a -> Dynamic a
146−```
147−
148−## Flattening functions
149−
150−These functions flatten nested types such as Event-of-Event, Behavior-of-Event, Event-of-Behavior etc, removing the outer wrapper.
151−
152−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.
153−
154−```haskell
155−-- Flatten Behavior-of-Event to Event. Old Event is used during switchover.
156−[ ] switch :: Behavior (Event a) -> Event a
157−
158−-- Flatten Dyanmic-of-Event to Event. New Event is used immediately.
159−[ ] switchPromptlyDyn :: Dynamic (Event a) -> Event a
160−
161−-- Flatten Event-of-Event to Event that fires when both wrapper AND new Event fire.
162−[ ] coincidence :: Event (Event a) -> Event a
163−
164−-- Flatten Behavior-of-Behavior to Behavior. Behavior is an instance of Monad,
165−-- so the 'join' function from 'Control.Monad' suffices. The output of 'join' is
166−-- a Behavior whose value is equal to the current value of the current value of
167−-- the input.
168−[ ] join :: Behavior (Behavior a) -> Behavior a
169−
170−
171−-- Flatten Dynamic-of-Dynamic to Dynamic. New Dynamic is used immediately.
172−-- Output updated whenever inner OR outer Dynamic updates.
173−[ ] join :: Dynamic (Dynamic a) -> Dynamic a
174−[ ] joinDynThroughMap :: Ord k => Dynamic (Map k (Dynamic a)) -> Dynamic (Map k a)
175−
176−-- Analogous to 'hold': Create a Behavior that is initially identical to the
177−-- supplied Behavior. Updated to track a new Behavior whenever the Event fires.
178−[H] switcher :: Behavior a -> Event (Behavior a) -> m (Behavior a)
179−
180−-- Similar to above, for Events. Created Event initially tracks the first argument.
181−-- At switchover, the output Event immediately tracks the new Event.
182−[H] switchPromptly :: Event a -> Event (Event a) -> m (Event a)
183−```
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 x 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−34
@@ -1,34 +0,0 @@
1−{ mkDerivation, ghc, base, bifunctors, containers, deepseq
2−, dependent-map, dependent-sum, exception-transformers
3−, haskell-src-exts, haskell-src-meta, hlint, lens, MemoTrie
4−, monad-control, mtl, primitive, ref-tf, semigroupoids
5−, semigroups, split, stdenv, stm, syb, template-haskell
6−, these, transformers, transformers-compat, prim-uniq
7−, data-default
8−, useTemplateHaskell ? true
9−}:
10−mkDerivation {
11− pname = "reflex";
12− version = "0.5.0";
13− src = builtins.filterSource (path: type: baseNameOf path != ".git") ./.;
14− libraryHaskellDepends = [
15− base bifunctors containers dependent-map dependent-sum
16− exception-transformers lens
17− MemoTrie monad-control mtl primitive ref-tf semigroupoids
18− semigroups stm syb template-haskell these transformers
19− transformers-compat prim-uniq
20− base bifunctors containers deepseq dependent-map dependent-sum
21− mtl ref-tf split transformers data-default
22− ] ++ (if !useTemplateHaskell then [] else [
23− haskell-src-exts haskell-src-meta
24− ]);
25− testHaskellDepends = if ghc.isGhcjs or false then [] else [
26− hlint
27− ];
28− configureFlags = if useTemplateHaskell then [] else [
29− "-f-use-template-haskell"
30− ];
31− homepage = "https://github.com/reflex-frp/reflex";
32− description = "Higher-order Functional Reactive Programming";
33− license = stdenv.lib.licenses.bsd3;
34−}
dep/reflex-platform/default.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−230
@@ -1,230 +0,0 @@
1−Name: reflex
2−Version: 0.5.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−flag specialize-to-spidertimeline-global
17− description: Specialize all Reflex functions to the SpiderTimeline Global implementation. This may improve performance, but will disable all other implementations.
18− default: False
19− manual: True
20−
21−flag use-reflex-optimizer
22− description: Use the GHC plugin Reflex.Optimizer on some of the modules in the package. This is still experimental.
23− default: False
24− manual: True
25−
26−flag use-template-haskell
27− description: Use template haskell to generate lenses
28− default: True
29− manual: True
30−
31−flag expose-all-unfoldings
32− description: Build the library with -fexpose-all-unfoldings which can help client code specialize better
33− default: False
34− manual: True
35−
36−flag debug-trace-events
37− description: add instrumentation that outputs the stack trace of the definition of an event whenever it is subscribed to. Warning: It is very slow!
38− default: False
39− manual: True
40−
41−library
42− hs-source-dirs: src
43− build-depends:
44− MemoTrie == 0.6.*,
45− base >= 4.7 && < 4.11,
46− bifunctors >= 5.2 && < 5.5,
47− containers == 0.5.*,
48− data-default >= 0.5 && < 0.8,
49− dependent-map >= 0.2.4 && < 0.3,
50− exception-transformers == 0.4.*,
51− lens >= 4.7 && < 5,
52− monad-control >= 1.0.1 && < 1.1,
53− mtl >= 2.1 && < 2.3,
54− prim-uniq >= 0.1.0.1 && < 0.2,
55− primitive >= 0.5 && < 0.7,
56− ref-tf == 0.4.*,
57− reflection == 2.1.*,
58− semigroupoids >= 4.0 && < 6,
59− semigroups >= 0.16 && < 0.19,
60− stm == 2.4.*,
61− syb >= 0.5 && < 0.7,
62− these >= 0.4 && < 0.8,
63− transformers >= 0.2,
64− transformers-compat >= 0.3
65−
66− exposed-modules:
67− Data.Functor.Misc,
68− Data.WeakBag,
69− Reflex,
70− Reflex.Class,
71− Reflex.EventWriter,
72− Reflex.Dynamic,
73− Reflex.Dynamic.Uniq,
74− Reflex.DynamicWriter,
75− Reflex.FunctorMaybe,
76− Reflex.Host.Class,
77− Reflex.Patch,
78− Reflex.TriggerEvent.Base,
79− Reflex.TriggerEvent.Class,
80− Reflex.PerformEvent.Base,
81− Reflex.PerformEvent.Class,
82− Reflex.PostBuild.Base,
83− Reflex.PostBuild.Class,
84− Reflex.Requester.Base,
85− Reflex.Requester.Class,
86− Reflex.Spider,
87− Reflex.Spider.Internal
88−
89− ghc-options: -Wall -fwarn-tabs -funbox-strict-fields -O2
90− ghc-prof-options: -auto-all
91−
92− if flag(specialize-to-spidertimeline-global)
93− cpp-options: -DSPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
94− else
95− exposed-modules: Reflex.Pure
96−
97− if flag(debug-trace-events)
98− cpp-options: -DDEBUG_TRACE_EVENTS
99− build-depends: bytestring
100−
101− if flag(use-reflex-optimizer)
102− cpp-options: -DUSE_REFLEX_OPTIMIZER
103− build-depends: ghc
104− exposed-modules: Reflex.Optimizer
105−
106− if flag(use-template-haskell)
107− cpp-options: -DUSE_TEMPLATE_HASKELL
108− build-depends:
109− dependent-sum >= 0.3 && < 0.5,
110− haskell-src-exts >= 1.16 && < 1.18,
111− haskell-src-meta == 0.6.*,
112− template-haskell >= 2.9 && < 2.12
113− exposed-modules:
114− Reflex.Dynamic.TH
115− other-extensions: TemplateHaskell
116− else
117− build-depends:
118− dependent-sum == 0.4.*
119−
120− if flag(expose-all-unfoldings)
121− ghc-options: -fexpose-all-unfoldings
122−
123−test-suite semantics
124− type: exitcode-stdio-1.0
125− main-is: semantics.hs
126− hs-source-dirs: test
127− ghc-options: -O2 -Wall -rtsopts
128− build-depends:
129− base,
130− bifunctors,
131− containers,
132− deepseq >= 1.3 && < 1.5,
133− dependent-map,
134− dependent-sum,
135− mtl,
136− ref-tf,
137− reflex,
138− split,
139− transformers >= 0.3
140− if flag(specialize-to-spidertimeline-global)
141− buildable: False
142−
143−test-suite hlint
144− type: exitcode-stdio-1.0
145− main-is: hlint.hs
146− hs-source-dirs: test
147− build-depends: base, hlint == 1.9.*
148− if impl(ghcjs)
149− buildable: False
150−
151−test-suite EventWriterT
152− type: exitcode-stdio-1.0
153− main-is: EventWriterT.hs
154− hs-source-dirs: test
155− build-depends: base
156− , dependent-sum
157− , transformers
158− , reflex
159− , ref-tf
160−
161−test-suite RequesterT
162− type: exitcode-stdio-1.0
163− main-is: RequesterT.hs
164− hs-source-dirs: test
165− build-depends: base
166− , dependent-sum
167− , dependent-map
168− , transformers
169− , reflex
170− , ref-tf
171−
172−test-suite GC-Semantics
173− type: exitcode-stdio-1.0
174− main-is: GC.hs
175− hs-source-dirs: test
176− if flag(specialize-to-spidertimeline-global)
177− buildable: False
178− build-depends: base
179− , dependent-sum
180− , dependent-map
181− , these
182− , transformers
183− , reflex
184− , ref-tf
185−
186−benchmark spider-bench
187− type: exitcode-stdio-1.0
188− hs-source-dirs: bench
189− main-is: Main.hs
190− ghc-options: -Wall -O2 -rtsopts
191− build-depends:
192− base,
193− criterion == 1.1.*,
194− deepseq >= 1.3 && < 1.5,
195− dependent-map,
196− dependent-sum,
197− mtl,
198− primitive,
199− reflex,
200− stm,
201− transformers >= 0.3
202−
203−benchmark saulzar-bench
204− type: exitcode-stdio-1.0
205− hs-source-dirs: bench test
206− c-sources: bench-cbits/checkCapability.c
207− main-is: RunAll.hs
208− ghc-options: -Wall -O2 -rtsopts -threaded
209− ghc-prof-options: -auto-all
210− build-depends:
211− base,
212− containers == 0.5.*,
213− criterion == 1.1.*,
214− deepseq >= 1.3 && < 1.5,
215− dependent-map,
216− dependent-sum,
217− loch-th,
218− mtl,
219− primitive,
220− process,
221− ref-tf,
222− reflex,
223− split,
224− stm,
225− time,
226− transformers >= 0.3
227−
228−source-repository head
229− type: git
230− 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+58−54
@@ -1,55 +1,55 @@
1{-# LANGUAGE CPP #-}
1{-# LANGUAGE CPP #-}
2{-# LANGUAGE DeriveDataTypeable #-}
2{-# LANGUAGE DeriveDataTypeable #-}
3+{-# LANGUAGE DeriveFunctor #-}
3{-# LANGUAGE FlexibleContexts #-}
4{-# LANGUAGE FlexibleContexts #-}
4{-# LANGUAGE FlexibleInstances #-}
5{-# LANGUAGE FlexibleInstances #-}
5{-# LANGUAGE GADTs #-}
6{-# LANGUAGE GADTs #-}
6−{-# LANGUAGE KindSignatures #-}
7{-# LANGUAGE LambdaCase #-}
7{-# LANGUAGE LambdaCase #-}
8{-# LANGUAGE MultiParamTypeClasses #-}
8{-# LANGUAGE MultiParamTypeClasses #-}
9{-# LANGUAGE PolyKinds #-}
9{-# LANGUAGE PolyKinds #-}
10{-# LANGUAGE RankNTypes #-}
10{-# LANGUAGE RankNTypes #-}
11{-# LANGUAGE ScopedTypeVariables #-}
11{-# LANGUAGE ScopedTypeVariables #-}
12{-# LANGUAGE StandaloneDeriving #-}
12{-# LANGUAGE StandaloneDeriving #-}
13−#ifdef USE_REFLEX_OPTIMIZER
14−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
15−#endif
16-- | This module provides types and functions with no particular theme, but
13-- | This module provides types and functions with no particular theme, but
17-- which are relevant to the use of 'Functor'-based datastructures like
14-- which are relevant to the use of 'Functor'-based datastructures like
18-- 'Data.Dependent.Map.DMap'.
15-- 'Data.Dependent.Map.DMap'.
19module Data.Functor.Misc
16module Data.Functor.Misc
20 ( -- * Const2
17 ( -- * Const2
21 Const2 (..)
18 Const2 (..)
19+ , unConst2
22 , dmapToMap
20 , dmapToMap
21+ , dmapToIntMap
22+ , dmapToMapWith
23 , mapToDMap
23 , mapToDMap
24+ , weakenDMapWith
24 -- * WrapArg
25 -- * WrapArg
25 , WrapArg (..)
26 , WrapArg (..)
26 -- * Convenience functions for DMap
27 -- * Convenience functions for DMap
27 , mapWithFunctorToDMap
28 , mapWithFunctorToDMap
29+ , intMapWithFunctorToDMap
28 , mapKeyValuePairsMonotonic
30 , mapKeyValuePairsMonotonic
29 , combineDMapsWithKey
31 , combineDMapsWithKey
30 , EitherTag (..)
32 , EitherTag (..)
31 , dmapToThese
33 , dmapToThese
32 , eitherToDSum
34 , eitherToDSum
33 , dsumToEither
35 , dsumToEither
34− -- * Deprecated functions
36+ , ComposeMaybe (..)
35− , sequenceDmap
36− , wrapDMap
37− , rewrapDMap
38− , unwrapDMap
39− , unwrapDMapMaybe
40− , extractFunctorDMap
41 ) where
37 ) where
42
38
43−import Control.Applicative (Applicative, (<$>))
39+import Control.Applicative ((<$>))
44−import Control.Monad.Identity
45import Data.Dependent.Map (DMap)
40import Data.Dependent.Map (DMap)
46import qualified Data.Dependent.Map as DMap
41import qualified Data.Dependent.Map as DMap
47import Data.Dependent.Sum
42import Data.Dependent.Sum
43+import Data.Functor.Identity
48import Data.GADT.Compare
44import Data.GADT.Compare
49import Data.GADT.Show
45import Data.GADT.Show
46+import Data.IntMap (IntMap)
47+import qualified Data.IntMap as IntMap
50import Data.Map (Map)
48import Data.Map (Map)
51import qualified Data.Map as Map
49import qualified Data.Map as Map
50+import Data.Some (Some, mkSome)
52import Data.These
51import Data.These
52+import Data.Type.Equality ((:~:)(Refl))
53import Data.Typeable hiding (Refl)
53import Data.Typeable hiding (Refl)
54
54
55--------------------------------------------------------------------------------
55--------------------------------------------------------------------------------
@@ -62,14 +62,18 @@ data Const2 :: * -> x -> x -> * where
62 Const2 :: k -> Const2 k v v
62 Const2 :: k -> Const2 k v v
63 deriving (Typeable)
63 deriving (Typeable)
64
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')
65−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)
66
73
67instance Show k => GShow (Const2 k v) where
74instance Show k => GShow (Const2 k v) where
68 gshowsPrec n x@(Const2 _) = showsPrec n x
75 gshowsPrec n x@(Const2 _) = showsPrec n x
69
76
70−instance (Show k, Show (f v)) => ShowTag (Const2 k v) f where
71− showTaggedPrec (Const2 _) = showsPrec
72−
73instance Eq k => GEq (Const2 k v) where
77instance Eq k => GEq (Const2 k v) where
74 geq (Const2 a) (Const2 b) =
78 geq (Const2 a) (Const2 b) =
75 if a == b
79 if a == b
@@ -86,6 +90,15 @@ instance Ord k => GCompare (Const2 k v) where
86dmapToMap :: DMap (Const2 k v) Identity -> Map k v
90dmapToMap :: DMap (Const2 k v) Identity -> Map k v
87dmapToMap = Map.fromDistinctAscList . map (\(Const2 k :=> Identity v) -> (k, v)) . DMap.toAscList
91dmapToMap = Map.fromDistinctAscList . map (\(Const2 k :=> Identity v) -> (k, v)) . DMap.toAscList
88
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+
89-- | Convert a regular 'Map' to a 'DMap'
102-- | Convert a regular 'Map' to a 'DMap'
90mapToDMap :: Map k v -> DMap (Const2 k v) Identity
103mapToDMap :: Map k v -> DMap (Const2 k v) Identity
91mapToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> Identity v) . Map.toAscList
104mapToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> Identity v) . Map.toAscList
@@ -95,6 +108,16 @@ mapToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> Identity v)
95mapWithFunctorToDMap :: Map k (f v) -> DMap (Const2 k v) f
108mapWithFunctorToDMap :: Map k (f v) -> DMap (Const2 k v) f
96mapWithFunctorToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> v) . Map.toAscList
109mapWithFunctorToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> v) . Map.toAscList
97
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+
98--------------------------------------------------------------------------------
121--------------------------------------------------------------------------------
99-- WrapArg
122-- WrapArg
100--------------------------------------------------------------------------------
123--------------------------------------------------------------------------------
@@ -105,6 +128,11 @@ mapWithFunctorToDMap = DMap.fromDistinctAscList . map (\(k, v) -> Const2 k :=> v
105data WrapArg :: (k -> *) -> (k -> *) -> * -> * where
128data WrapArg :: (k -> *) -> (k -> *) -> * -> * where
106 WrapArg :: f a -> WrapArg g f (g a)
129 WrapArg :: f a -> WrapArg g f (g a)
107
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+
108instance GEq f => GEq (WrapArg g f) where
136instance GEq f => GEq (WrapArg g f) where
109 geq (WrapArg a) (WrapArg b) = (\Refl -> Refl) <$> geq a b
137 geq (WrapArg a) (WrapArg b) = (\Refl -> Refl) <$> geq a b
110
138
@@ -154,6 +182,11 @@ dmapToThese m = case (DMap.lookup LeftTag m, DMap.lookup RightTag m) of
154data EitherTag l r a where
182data EitherTag l r a where
155 LeftTag :: EitherTag l r l
183 LeftTag :: EitherTag l r l
156 RightTag :: EitherTag l r r
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)
157
190
158instance GEq (EitherTag l r) where
191instance GEq (EitherTag l r) where
159 geq a b = case (a, b) of
192 geq a b = case (a, b) of
@@ -173,11 +206,6 @@ instance GShow (EitherTag l r) where
173 LeftTag -> showString "LeftTag"
206 LeftTag -> showString "LeftTag"
174 RightTag -> showString "RightTag"
207 RightTag -> showString "RightTag"
175
208
176−instance (Show l, Show r) => ShowTag (EitherTag l r) Identity where
177− showTaggedPrec t n (Identity a) = case t of
178− LeftTag -> showsPrec n a
179− RightTag -> showsPrec n a
180−
181-- | Convert 'Either' to a 'DSum'. Inverse of 'dsumToEither'.
209-- | Convert 'Either' to a 'DSum'. Inverse of 'dsumToEither'.
182eitherToDSum :: Either a b -> DSum (EitherTag a b) Identity
210eitherToDSum :: Either a b -> DSum (EitherTag a b) Identity
183eitherToDSum = \case
211eitherToDSum = \case
@@ -191,37 +219,13 @@ dsumToEither = \case
191 (RightTag :=> Identity b) -> Right b
219 (RightTag :=> Identity b) -> Right b
192
220
193--------------------------------------------------------------------------------
221--------------------------------------------------------------------------------
194−-- Deprecated functions
222+-- ComposeMaybe
195--------------------------------------------------------------------------------
223--------------------------------------------------------------------------------
196
224
197−{-# INLINE sequenceDmap #-}
225+-- | We can't use @Compose Maybe@ instead of 'ComposeMaybe', because that would
198−{-# 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
199−-- | Run the actions contained in the 'DMap'
227+-- representational so that we can use safe 'coerce'.
200−sequenceDmap :: Applicative t => DMap f t -> t (DMap f Identity)
228+newtype ComposeMaybe f a =
201−sequenceDmap = DMap.traverseWithKey $ \_ t -> Identity <$> t
229+ ComposeMaybe { getComposeMaybe :: Maybe (f a) } deriving (Show, Eq, Ord)
202−
230+
203−{-# DEPRECATED wrapDMap "Use 'Data.Dependent.Map.map (f . runIdentity)' instead" #-}
231+deriving instance Functor f => Functor (ComposeMaybe f)
204−-- | Replace the 'Identity' functor for a 'DMap''s values with a different functor
205−wrapDMap :: (forall a. a -> f a) -> DMap k Identity -> DMap k f
206−wrapDMap f = DMap.map $ f . runIdentity
207−
208−{-# DEPRECATED rewrapDMap "Use 'Data.Dependent.Map.map' instead" #-}
209−-- | Replace one functor for a 'DMap''s values with a different functor
210−rewrapDMap :: (forall (a :: *). f a -> g a) -> DMap k f -> DMap k g
211−rewrapDMap = DMap.map
212−
213−{-# DEPRECATED unwrapDMap "Use 'Data.Dependent.Map.map (Identity . f)' instead" #-}
214−-- | Replace one functor for a 'DMap''s values with the 'Identity' functor
215−unwrapDMap :: (forall a. f a -> a) -> DMap k f -> DMap k Identity
216−unwrapDMap f = DMap.map $ Identity . f
217−
218−{-# DEPRECATED unwrapDMapMaybe "Use 'Data.Dependent.Map.mapMaybeWithKey (\\_ a -> fmap Identity $ f a)' instead" #-}
219−-- | Like 'unwrapDMap', but possibly delete some values from the DMap
220−unwrapDMapMaybe :: GCompare k => (forall a. f a -> Maybe a) -> DMap k f -> DMap k Identity
221−unwrapDMapMaybe f = DMap.mapMaybeWithKey $ \_ a -> Identity <$> f a
222−
223−{-# DEPRECATED extractFunctorDMap "Use 'mapKeyValuePairsMonotonic (\\(Const2 k :=> Identity v) -> Const2 k :=> v)' instead" #-}
224−-- | Eliminate the 'Identity' functor in a 'DMap' and replace it with the
225−-- underlying functor
226−extractFunctorDMap :: DMap (Const2 k (f v)) Identity -> DMap (Const2 k v) f
227−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−121
@@ -1,121 +0,0 @@
1−{-# LANGUAGE BangPatterns #-}
2−{-# LANGUAGE CPP #-}
3−{-# LANGUAGE ExistentialQuantification #-}
4−#ifdef USE_REFLEX_OPTIMIZER
5−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
6−#endif
7−-- | This module defines the 'WeakBag' type, which represents a mutable
8−-- collection of items that does not cause the items to be retained in memory.
9−-- This is useful for situations where a value needs to be inspected or modified
10−-- if it is still alive, but can be ignored if it is dead.
11−module Data.WeakBag
12− ( WeakBag
13− , WeakBagTicket
14− , empty
15− , singleton
16− , insert
17− , traverse
18− , remove
19− ) where
20−
21−import Control.Exception
22−import Control.Monad hiding (forM_, mapM_)
23−import Control.Monad.IO.Class
24−import Data.Foldable (forM_, mapM_)
25−import Data.IntMap.Strict (IntMap)
26−import qualified Data.IntMap.Strict as IntMap
27−import Data.IORef
28−import System.Mem.Weak
29−
30−import Prelude hiding (mapM_, traverse)
31−
32−-- | A @WeakBag a@ holds a set of values of type @a@, but does not retain them -
33−-- that is, they can still be garbage-collected. As long as the @a@s remain
34−-- alive, the 'WeakBag' will continue to refer to them.
35−data WeakBag a = WeakBag
36− { _weakBag_nextId :: {-# UNPACK #-} !(IORef Int) --TODO: what if this wraps around?
37− , _weakBag_children :: {-# UNPACK #-} !(IORef (IntMap (Weak a)))
38− }
39−
40−-- | When inserting an item into a 'WeakBag', a 'WeakBagTicket' is returned. If
41−-- the caller retains the ticket, the item is guranteed to stay in memory (and
42−-- thus in the 'WeakBag'). The ticket can also be used to remove the item from
43−-- the 'WeakBag' prematurely (i.e. while it is still alive), using 'remove'.
44−data WeakBagTicket = forall a. WeakBagTicket
45− { _weakBagTicket_weakItem :: {-# UNPACK #-} !(Weak a)
46− , _weakBagTicket_item :: {-# NOUNPACK #-} !a
47− }
48−
49−-- | Insert an item into a 'WeakBag'.
50−{-# INLINE insert #-}
51−insert :: a -- ^ The item
52− -> WeakBag a -- ^ The 'WeakBag' to insert into
53− -> IORef (Weak b) -- ^ An arbitrary value to be used in the following
54− -- callback
55− -> (b -> IO ()) -- ^ A callback to be invoked when the item is removed
56− -- (whether automatically by the item being garbage
57− -- collected or manually via 'remove')
58− -> IO WeakBagTicket -- ^ Returns a 'WeakBagTicket' that ensures the item
59− -- is retained and allows the item to be removed.
60−insert a (WeakBag nextId children) wbRef finalizer = {-# SCC "insert" #-} do
61− a' <- evaluate a
62− wbRef' <- evaluate wbRef
63− myId <- atomicModifyIORef' nextId $ \n -> (succ n, n)
64− let cleanup = do
65− wb <- readIORef wbRef'
66− mb <- deRefWeak wb
67− forM_ mb $ \b -> do
68− csWithoutMe <- atomicModifyIORef children $ \cs ->
69− let !csWithoutMe = IntMap.delete myId cs
70− in (csWithoutMe, csWithoutMe)
71− when (IntMap.null csWithoutMe) $ finalizer b
72− return ()
73− return ()
74− wa <- mkWeakPtr a' $ Just cleanup
75− atomicModifyIORef' children $ \cs -> (IntMap.insert myId wa cs, ())
76− return $ WeakBagTicket
77− { _weakBagTicket_weakItem = wa
78− , _weakBagTicket_item = a'
79− }
80−
81−-- | Create an empty 'WeakBag'.
82−{-# INLINE empty #-}
83−empty :: IO (WeakBag a)
84−empty = {-# SCC "empty" #-} do
85− nextId <- newIORef 1
86− children <- newIORef IntMap.empty
87− let bag = WeakBag
88− { _weakBag_nextId = nextId
89− , _weakBag_children = children
90− }
91− return bag
92−
93−-- | Create a 'WeakBag' with one item; equivalent to creating the 'WeakBag' with
94−-- 'empty', then using 'insert'.
95−{-# INLINE singleton #-}
96−singleton :: a -> IORef (Weak b) -> (b -> IO ()) -> IO (WeakBag a, WeakBagTicket)
97−singleton a wbRef finalizer = {-# SCC "singleton" #-} do
98− bag <- empty
99− ticket <- insert a bag wbRef finalizer
100− return (bag, ticket)
101−
102−{-# INLINE traverse #-}
103−-- | Visit every node in the given list. If new nodes are appended during the
104−-- traversal, they will not be visited. Every live node that was in the list
105−-- when the traversal began will be visited exactly once; however, no guarantee
106−-- is made about the order of the traversal.
107−traverse :: MonadIO m => WeakBag a -> (a -> m ()) -> m ()
108−traverse (WeakBag _ children) f = {-# SCC "traverse" #-} do
109− cs <- liftIO $ readIORef children
110− forM_ cs $ \c -> do
111− ma <- liftIO $ deRefWeak c
112− mapM_ f ma
113−
114−-- | Remove an item from the 'WeakBag'; does nothing if invoked multiple times
115−-- on the same 'WeakBagTicket'.
116−{-# INLINE remove #-}
117−remove :: WeakBagTicket -> IO ()
118−remove (WeakBagTicket w _) = {-# SCC "remove" #-} finalize w
119−--TODO: Should 'remove' also drop the reference to the item?
120−
121−--TODO: can/should we provide a null WeakBagTicket?
src/Reflex.hsdeleted−24
@@ -1,24 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−-- | This module exports all of the commonly-used functionality of Reflex; if
3−-- you are just getting started with Reflex, this is probably what you want.
4−module Reflex
5− ( module X
6− ) where
7−
8−import Reflex.Class as X
9−import Reflex.EventWriter as X
10−import Reflex.Dynamic as X
11−#ifdef USE_TEMPLATE_HASKELL
12−import Reflex.Dynamic.TH as X
13−#endif
14−import Reflex.Dynamic.Uniq as X
15−import Reflex.DynamicWriter as X
16−import Reflex.PerformEvent.Base as X
17−import Reflex.PerformEvent.Class as X
18−import Reflex.PostBuild.Base as X
19−import Reflex.PostBuild.Class as X
20−import Reflex.Requester.Base as X
21−import Reflex.Requester.Class as X
22−import Reflex.Spider as X
23−import Reflex.TriggerEvent.Base as X
24−import Reflex.TriggerEvent.Class as X
src/Reflex/Class.hsdeleted−981
@@ -1,981 +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 RoleAnnotations #-}
12−{-# LANGUAGE ScopedTypeVariables #-}
13−{-# LANGUAGE TypeFamilies #-}
14−{-# LANGUAGE TypeOperators #-}
15−{-# LANGUAGE UndecidableInstances #-}
16−#ifdef USE_REFLEX_OPTIMIZER
17−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
18−#endif
19−#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
20−{-# LANGUAGE EmptyDataDecls #-}
21−{-# OPTIONS_GHC -Wno-redundant-constraints #-}
22−#endif
23−
24−-- | This module contains the Reflex interface, as well as a variety of
25−-- convenience functions for working with 'Event's, 'Behavior's, and other
26−-- signals.
27−module Reflex.Class
28− ( module Reflex.Patch
29− -- * Primitives
30− , Reflex (..)
31− , coerceBehavior
32− , coerceEvent
33− , coerceDynamic
34− , MonadSample (..)
35− , MonadHold (..)
36− -- ** 'fan'-related types
37− , EventSelector (..)
38− -- ** 'Incremental'-related types
39− -- * Convenience functions
40− , constDyn
41− , pushAlways
42− -- ** Combining 'Event's
43− , leftmost
44− , mergeMap
45− , mergeList
46− , mergeWith
47− , difference
48− -- ** Breaking up 'Event's
49− , splitE
50− , fanEither
51− , fanThese
52− , fanMap
53− , dmapToThese
54− , EitherTag (..)
55− , eitherToDSum
56− , dsumToEither
57− -- ** Switching between 'Event's
58− , switchPromptly
59− , switchPromptOnly
60− -- ** Using 'Event's to sample 'Behavior's
61− , tag
62− , attach
63− , attachWith
64− , attachWithMaybe
65− -- ** Blocking an 'Event' based on a 'Behavior'
66− , gate
67− -- ** Combining 'Dynamic's
68− , distributeDMapOverDynPure
69− , distributeListOverDyn
70− , distributeListOverDynWith
71− , zipDyn
72− , zipDynWith
73− -- ** Accumulating state
74− , Accumulator (..)
75− , mapAccum_
76− , mapAccumM_
77− , mapAccumMaybe_
78− , mapAccumMaybeM_
79− , zipListWithEvent
80− , headE
81− , tailE
82− , headTailE
83− , switcher
84− -- * Debugging functions
85− , traceEvent
86− , traceEventWith
87− -- * Unsafe functions
88− , unsafeDynamic
89− -- * 'FunctorMaybe'
90− , FunctorMaybe (..)
91− , fforMaybe
92− , ffilter
93− -- * Miscellaneous convenience functions
94− , ffor
95− , MonadAdjust (..)
96− -- * Deprecated functions
97− , appendEvents
98− , onceE
99− , sequenceThese
100− , fmapMaybeCheap
101− , fmapCheap
102− , fforCheap
103− , fforMaybeCheap
104− , pushAlwaysCheap
105− , tagCheap
106− , mergeWithCheap
107− , mergeWithCheap'
108−#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
109− , Spider
110− , SpiderEnv
111− , SpiderTimeline
112− , Global
113− , Behavior (..)
114− , Event (..)
115− , Dynamic (..)
116− , Incremental (..)
117− , never
118− , constant
119− , push
120− , pushCheap
121− , pull
122− , merge
123− , fan
124− , switch
125− , coincidence
126− , current
127− , updated
128− , unsafeBuildDynamic
129− , unsafeBuildIncremental
130− , mergeIncremental
131− , currentIncremental
132− , updatedIncremental
133− , incrementalToDynamic
134− , behaviorCoercion
135− , eventCoercion
136− , dynamicCoercion
137−#endif
138− ) where
139−
140−import Control.Applicative
141−import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
142−import Control.Monad.Reader hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
143−import Control.Monad.State.Strict hiding (forM, forM_, mapM, mapM_, sequence, sequence_)
144−import Control.Monad.Trans.Cont (ContT ())
145−import Control.Monad.Trans.Except (ExceptT ())
146−import Control.Monad.Trans.RWS (RWST ())
147−import Control.Monad.Trans.Writer (WriterT ())
148−import Data.Align
149−import Data.Bifunctor
150−import Data.Coerce
151−import Data.Default
152−import Data.Dependent.Map (DMap, DSum (..), GCompare (..))
153−import qualified Data.Dependent.Map as DMap
154−import Data.Either
155−import Data.Foldable
156−import Data.Functor.Bind hiding (join)
157−import qualified Data.Functor.Bind as Bind
158−import Data.Functor.Misc
159−import Data.Functor.Plus
160−import Data.List.NonEmpty (NonEmpty (..))
161−import Data.Map (Map)
162−import Data.Maybe
163−import Data.Monoid hiding (Alt, (<>))
164−import Data.Semigroup (Semigroup, sconcat, stimes, (<>))
165−import Data.String
166−import Data.These
167−import Data.Traversable
168−import Data.Type.Coercion
169−import Reflex.FunctorMaybe
170−import Reflex.Patch
171−
172−#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
173−import Reflex.Spider.Internal (EventM, Global, HasSpiderTimeline, SpiderHost (..), SpiderHostFrame (..),
174− SpiderPullM, SpiderPushM (..), behaviorHoldIdentity, dynamicConst,
175− dynamicCurrent, dynamicDynIdentity, dynamicHold, dynamicHoldIdentity,
176− dynamicUpdated, newMapDyn, readBehaviorTracked, readBehaviorUntracked,
177− runFrame, runSpiderHostFrame, unsafeDyn)
178−import qualified Reflex.Spider.Internal
179−import qualified Reflex.Spider.Internal as S
180−import Unsafe.Coerce
181−#endif
182−
183−-- Note: must come last to silence warnings due to AMP on GHC < 7.10
184−import Prelude hiding (foldl, mapM, mapM_, sequence, sequence_)
185−
186−import Debug.Trace (trace)
187−
188−#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
189−#include "Spider/SpiderTimeline.include.hs"
190−#endif
191−
192−-- | The 'Reflex' class contains all the primitive functionality needed for
193−-- Functional Reactive Programming (FRP). The @t@ type parameter indicates
194−-- which "timeline" is in use. Timelines are fully-independent FRP contexts,
195−-- and the type of the timeline determines the FRP engine to be used. For most
196−-- purposes, the 'Reflex.Spider' implementation is recommended.
197−class ( MonadHold t (PushM t)
198− , MonadSample t (PullM t)
199− , MonadFix (PushM t)
200− , Functor (Dynamic t)
201− , Applicative (Dynamic t) -- Necessary for GHC <= 7.8
202− , Monad (Dynamic t)
203−#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
204− , t ~ SpiderTimeline Global
205−#endif
206− ) => Reflex t where
207− -- | A container for a value that can change over time. 'Behavior's can be
208− -- sampled at will, but it is not possible to be notified when they change
209− data Behavior t :: * -> *
210− -- | A stream of occurrences. During any given frame, an 'Event' is either
211− -- occurring or not occurring; if it is occurring, it will contain a value of
212− -- the given type (its "occurrence type")
213− data Event t :: * -> *
214− -- | A container for a value that can change over time and allows
215− -- notifications on changes. Basically a combination of a 'Behavior' and an
216− -- 'Event', with a rule that the 'Behavior' will change if and only if the
217− -- 'Event' fires.
218− data Dynamic t :: * -> *
219− -- | A container for a value that can change over time and allows
220− -- notifications on changes. Basically a combination of a 'Behavior' and an
221− -- 'Event', with a rule that the 'Behavior' will change if and only if the
222− -- 'Event' fires.
223− data Incremental t :: * -> *
224− -- | A monad for doing complex push-based calculations efficiently
225− type PushM t :: * -> *
226− -- | A monad for doing complex pull-based calculations efficiently
227− type PullM t :: * -> *
228−#ifndef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
229− -- | An 'Event' with no occurrences
230− never :: Event t a
231− -- | Create a 'Behavior' that always has the given value
232− 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
233− -- | Create an 'Event' from another 'Event'; the provided function can sample
234− -- 'Behavior's and hold 'Event's, and use the results to produce a occurring
235− -- (Just) or non-occurring (Nothing) result
236− push :: (a -> PushM t (Maybe b)) -> Event t a -> Event t b
237− -- | Like 'push' but intended for functions that the implementation can consider cheap to compute for performance considerations.
238− pushCheap :: (a -> PushM t (Maybe b)) -> Event t a -> Event t b
239− -- | Create a 'Behavior' by reading from other 'Behavior's; the result will be
240− -- recomputed whenever any of the read 'Behavior's changes
241− pull :: PullM t a -> Behavior t a
242− -- | Merge a collection of events; the resulting 'Event' will only occur if at
243− -- least one input event is occuring, and will contain all of the input keys
244− -- that are occurring simultaneously
245− 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
246− -- | Efficiently fan-out an event to many destinations. This function should
247− -- be partially applied, and then the result applied repeatedly to create
248− -- child events
249− 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
250− -- | Create an 'Event' that will occur whenever the currently-selected input
251− -- 'Event' occurs
252− switch :: Behavior t (Event t a) -> Event t a
253− -- | Create an 'Event' that will occur whenever the input event is occurring
254− -- and its occurrence value, another 'Event', is also occurring
255− coincidence :: Event t (Event t a) -> Event t a
256− -- | Extract the 'Behavior' of a 'Dynamic'.
257− current :: Dynamic t a -> Behavior t a
258− -- | Extract the 'Event' of the 'Dynamic'.
259− updated :: Dynamic t a -> Event t a
260− -- | Create a new 'Dynamic'. The given 'PullM' must always return the most
261− -- recent firing of the given 'Event', if any.
262− unsafeBuildDynamic :: PullM t a -> Event t a -> Dynamic t a
263− -- | Create a new 'Incremental'. The given 'PullM''s value must always change
264− -- in the same way that the accumulated application of patches would change
265− -- that value.
266− unsafeBuildIncremental :: Patch p => PullM t (PatchTarget p) -> Event t p -> Incremental t p
267− -- | Create a merge whose parents can change over time
268− mergeIncremental :: GCompare k => Incremental t (PatchDMap k (Event t)) -> Event t (DMap k Identity)
269− -- | Extract the 'Behavior' component of an 'Incremental'
270− currentIncremental :: Patch p => Incremental t p -> Behavior t (PatchTarget p)
271− -- | Extract the 'Event' component of an 'Incremental'
272− updatedIncremental :: Patch p => Incremental t p -> Event t p
273− -- | Convert an 'Incremental' to a 'Dynamic'
274− incrementalToDynamic :: Patch p => Incremental t p -> Dynamic t (PatchTarget p)
275− -- | Construct a 'Coercion' for a 'Behavior' given an 'Coercion' for its
276− -- occurrence type
277− behaviorCoercion :: Coercion a b -> Coercion (Behavior t a) (Behavior t b)
278− -- | Construct a 'Coercion' for an 'Event' given an 'Coercion' for its
279− -- occurrence type
280− eventCoercion :: Coercion a b -> Coercion (Event t a) (Event t b)
281− -- | Construct a 'Coercion' for a 'Dynamic' given an 'Coercion' for its
282− -- occurrence type
283− dynamicCoercion :: Coercion a b -> Coercion (Dynamic t a) (Dynamic t b)
284−#endif
285−
286−#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
287−instance t ~ SpiderTimeline Global => Reflex t where
288− newtype Behavior t a = SpiderBehavior { unSpiderBehavior :: Reflex.Spider.Internal.Behavior Global a }
289− newtype Event t a = SpiderEvent { unSpiderEvent :: Reflex.Spider.Internal.Event Global a }
290− newtype Dynamic t a = SpiderDynamic { unSpiderDynamic :: Reflex.Spider.Internal.Dynamic Global (Identity a) } -- deriving (Functor, Applicative, Monad)
291− newtype Incremental t p = SpiderIncremental { unSpiderIncremental :: Reflex.Spider.Internal.Dynamic Global p }
292− type PullM t = SpiderPullM Global
293− type PushM t = SpiderPushM Global
294−never :: Reflex t => Event t a
295−constant :: Reflex t => a -> Behavior t a
296−push :: Reflex t => (a -> PushM t (Maybe b)) -> Event t a -> Event t b
297−pushCheap :: Reflex t => (a -> PushM t (Maybe b)) -> Event t a -> Event t b
298−pull :: Reflex t => PullM t a -> Behavior t a
299−merge :: (Reflex t, GCompare k) => DMap k (Event t) -> Event t (DMap k Identity)
300−fan :: (Reflex t, GCompare k) => Event t (DMap k Identity) -> EventSelector t k
301−switch :: Reflex t => Behavior t (Event t a) -> Event t a
302−coincidence :: Reflex t => Event t (Event t a) -> Event t a
303−current :: Reflex t => Dynamic t a -> Behavior t a
304−updated :: Reflex t => Dynamic t a -> Event t a
305−unsafeBuildDynamic :: Reflex t => PullM t a -> Event t a -> Dynamic t a
306−unsafeBuildIncremental :: (Reflex t, Patch p) => PullM t (PatchTarget p) -> Event t p -> Incremental t p
307−mergeIncremental :: (Reflex t, GCompare k) => Incremental t (PatchDMap k (Event t)) -> Event t (DMap k Identity)
308−currentIncremental :: (Reflex t, Patch p) => Incremental t p -> Behavior t (PatchTarget p)
309−updatedIncremental :: (Reflex t, Patch p) => Incremental t p -> Event t p
310−incrementalToDynamic :: (Reflex t, Patch p) => Incremental t p -> Dynamic t (PatchTarget p)
311−behaviorCoercion :: Reflex t => Coercion a b -> Coercion (Behavior t a) (Behavior t b)
312−eventCoercion :: Reflex t => Coercion a b -> Coercion (Event t a) (Event t b)
313−dynamicCoercion :: Reflex t => Coercion a b -> Coercion (Dynamic t a) (Dynamic t b)
314−{-# INLINE never #-}
315−never = SpiderEvent S.eventNever
316−{-# INLINE constant #-}
317−constant = SpiderBehavior . S.behaviorConst
318−{-# INLINE push #-}
319−push f = SpiderEvent . S.push (coerce f) . unSpiderEvent
320−{-# INLINE pushCheap #-}
321−pushCheap f = SpiderEvent . S.pushCheap (coerce f) . unSpiderEvent
322−{-# INLINE pull #-}
323−pull = SpiderBehavior . S.pull . coerce
324−{-# INLINE merge #-}
325−merge = SpiderEvent . S.merge . S.dynamicConst . (coerce :: DMap k (Event (SpiderTimeline x)) -> DMap k (S.Event x))
326−{-# INLINE fan #-}
327−fan e = EventSelector $ SpiderEvent . S.select (S.fan (unSpiderEvent e))
328−{-# INLINE switch #-}
329−switch = SpiderEvent . S.switch . (coerce :: S.Behavior x (Event (SpiderTimeline x) a) -> S.Behavior x (S.Event x a)) . unSpiderBehavior
330−{-# INLINE coincidence #-}
331−coincidence = SpiderEvent . S.coincidence . (coerce :: S.Event x (Event (SpiderTimeline x) a) -> S.Event x (S.Event x a)) . unSpiderEvent
332−{-# INLINE current #-}
333−current = SpiderBehavior . S.dynamicCurrent . unSpiderDynamic
334−{-# INLINE updated #-}
335−updated = coerceEvent . SpiderEvent . dynamicUpdated . unSpiderDynamic
336−{-# INLINE unsafeBuildDynamic #-}
337−unsafeBuildDynamic readV0 v' = SpiderDynamic $ dynamicDynIdentity $ unsafeDyn (coerce readV0) $ coerce $ unSpiderEvent v'
338−{-# INLINE unsafeBuildIncremental #-}
339−unsafeBuildIncremental readV0 dv = SpiderIncremental $ S.dynamicDyn $ unsafeDyn (coerce readV0) $ unSpiderEvent dv
340−{-# INLINE mergeIncremental #-}
341−mergeIncremental = SpiderEvent . S.merge . (unsafeCoerce :: S.Dynamic x (PatchDMap k (Event (SpiderTimeline x))) -> S.Dynamic x (PatchDMap k (S.Event x))) . unSpiderIncremental
342−{-# INLINE currentIncremental #-}
343−currentIncremental = SpiderBehavior . dynamicCurrent . unSpiderIncremental
344−{-# INLINE updatedIncremental #-}
345−updatedIncremental = SpiderEvent . dynamicUpdated . unSpiderIncremental
346−{-# INLINE incrementalToDynamic #-}
347−incrementalToDynamic (SpiderIncremental i) = SpiderDynamic $ dynamicDynIdentity $ unsafeDyn (readBehaviorUntracked $ dynamicCurrent i) $ flip S.push (dynamicUpdated i) $ \p -> do
348− c <- readBehaviorUntracked $ dynamicCurrent i
349− return $ Identity <$> apply p c
350−eventCoercion Coercion = Coercion
351−behaviorCoercion Coercion = Coercion
352−dynamicCoercion = unsafeCoerce
353−#endif
354−
355−-- | Coerce a 'Behavior' between representationally-equivalent value types
356−coerceBehavior :: (Reflex t, Coercible a b) => Behavior t a -> Behavior t b
357−coerceBehavior = coerceWith $ behaviorCoercion Coercion
358−
359−-- | Coerce an 'Event' between representationally-equivalent occurrence types
360−coerceEvent :: (Reflex t, Coercible a b) => Event t a -> Event t b
361−coerceEvent = coerceWith $ eventCoercion Coercion
362−
363−-- | Coerce a 'Dynamic' between representationally-equivalent value types
364−coerceDynamic :: (Reflex t, Coercible a b) => Dynamic t a -> Dynamic t b
365−coerceDynamic = coerceWith $ dynamicCoercion Coercion
366−
367−-- | Construct a 'Dynamic' from a 'Behavior' and an 'Event'. The 'Behavior'
368−-- _must_ change when and only when the 'Event' fires, such that the
369−-- 'Behavior''s value is always equal to the most recent firing of the 'Event';
370−-- if this is not the case, the resulting 'Dynamic' will behave
371−-- nondeterministically.
372−unsafeDynamic :: Reflex t => Behavior t a -> Event t a -> Dynamic t a
373−unsafeDynamic = unsafeBuildDynamic . sample
374−
375−-- | Construct a 'Dynamic' value that never changes
376−constDyn :: Reflex t => a -> Dynamic t a
377−constDyn = pure
378−
379−instance (Reflex t, Default a) => Default (Dynamic t a) where
380− def = pure def
381−
382−-- | 'MonadSample' designates monads that can read the current value of a
383−-- 'Behavior'. This includes both 'PullM' and 'PushM'.
384−class (Applicative m, Monad m) => MonadSample t m | m -> t where
385− -- | Get the current value in the 'Behavior'
386− sample :: Behavior t a -> m a
387−
388−-- | 'MonadHold' designates monads that can create new 'Behavior's based on
389−-- 'Event's; usually this will be 'PushM' or a monad based on it. 'MonadHold'
390−-- is required to create any stateful computations with Reflex.
391−class MonadSample t m => MonadHold t m where
392− -- | Create a new 'Behavior' whose value will initially be equal to the given
393− -- value and will be updated whenever the given 'Event' occurs. The update
394− -- takes effect immediately after the 'Event' occurs; if the occurrence that
395− -- sets the 'Behavior' (or one that is simultaneous with it) is used to sample
396− -- the 'Behavior', it will see the _old_ value of the 'Behavior', not the new
397− -- one.
398− hold :: a -> Event t a -> m (Behavior t a)
399− -- | Create a 'Dynamic' value using the given initial value that changes every
400− -- time the 'Event' occurs.
401− holdDyn :: a -> Event t a -> m (Dynamic t a)
402− -- | Create an 'Incremental' value using the given initial value that changes
403− -- every time the 'Event' occurs.
404− holdIncremental :: Patch p => PatchTarget p -> Event t p -> m (Incremental t p)
405−
406−-- | An 'EventSelector' allows you to efficiently 'select' an 'Event' based on a
407−-- key. This is much more efficient than filtering for each key with
408−-- 'fmapMaybe'.
409−newtype EventSelector t k = EventSelector
410− { -- | Retrieve the 'Event' for the given key. The type of the 'Event' is
411− -- determined by the type of the key, so this can be used to fan-out
412− -- 'Event's whose sub-'Event's have different types.
413− --
414− -- Using 'EventSelector's and the 'fan' primitive is far more efficient than
415− -- (but equivalent to) using 'fmapMaybe' to select only the relevant
416− -- occurrences of an 'Event'.
417− select :: forall a. k a -> Event t a
418− }
419−
420−--------------------------------------------------------------------------------
421−-- Instances
422−--------------------------------------------------------------------------------
423−
424−instance MonadSample t m => MonadSample t (ReaderT r m) where
425− sample = lift . sample
426−
427−instance MonadHold t m => MonadHold t (ReaderT r m) where
428− hold a0 = lift . hold a0
429− holdDyn a0 = lift . holdDyn a0
430− holdIncremental a0 = lift . holdIncremental a0
431−
432−instance (MonadSample t m, Monoid r) => MonadSample t (WriterT r m) where
433− sample = lift . sample
434−
435−instance (MonadHold t m, Monoid r) => MonadHold t (WriterT r m) where
436− hold a0 = lift . hold a0
437− holdDyn a0 = lift . holdDyn a0
438− holdIncremental a0 = lift . holdIncremental a0
439−
440−instance MonadSample t m => MonadSample t (StateT s m) where
441− sample = lift . sample
442−
443−instance MonadHold t m => MonadHold t (StateT s m) where
444− hold a0 = lift . hold a0
445− holdDyn a0 = lift . holdDyn a0
446− holdIncremental a0 = lift . holdIncremental a0
447−
448−instance MonadSample t m => MonadSample t (ExceptT e m) where
449− sample = lift . sample
450−
451−instance MonadHold t m => MonadHold t (ExceptT e m) where
452− hold a0 = lift . hold a0
453− holdDyn a0 = lift . holdDyn a0
454− holdIncremental a0 = lift . holdIncremental a0
455−
456−instance (MonadSample t m, Monoid w) => MonadSample t (RWST r w s m) where
457− sample = lift . sample
458−
459−instance (MonadHold t m, Monoid w) => MonadHold t (RWST r w s m) where
460− hold a0 = lift . hold a0
461− holdDyn a0 = lift . holdDyn a0
462− holdIncremental a0 = lift . holdIncremental a0
463−
464−instance MonadSample t m => MonadSample t (ContT r m) where
465− sample = lift . sample
466−
467−instance MonadHold t m => MonadHold t (ContT r m) where
468− hold a0 = lift . hold a0
469− holdDyn a0 = lift . holdDyn a0
470− holdIncremental a0 = lift . holdIncremental a0
471−
472−--------------------------------------------------------------------------------
473−-- Convenience functions
474−--------------------------------------------------------------------------------
475−
476−-- | Create an 'Event' from another 'Event'. The provided function can sample
477−-- 'Behavior's and hold 'Event's.
478−pushAlways :: Reflex t => (a -> PushM t b) -> Event t a -> Event t b
479−pushAlways f = push (fmap Just . f)
480−
481−-- | Flipped version of 'fmap'.
482−ffor :: Functor f => f a -> (a -> b) -> f b
483−ffor = flip fmap
484−
485−instance Reflex t => Applicative (Behavior t) where
486− pure = constant
487− f <*> x = pull $ sample f `ap` sample x
488− _ *> b = b
489− a <* _ = a
490−
491−instance Reflex t => Apply (Behavior t) where
492− (<.>) = (<*>)
493−
494−instance Reflex t => Bind (Behavior t) where
495− (>>-) = (>>=)
496−
497−instance (Reflex t, Fractional a) => Fractional (Behavior t a) where
498− (/) = liftA2 (/)
499− fromRational = pure . fromRational
500− recip = fmap recip
501−
502−instance Reflex t => Functor (Behavior t) where
503− fmap f = pull . fmap f . sample
504−
505−instance (Reflex t, IsString a) => IsString (Behavior t a) where
506− fromString = pure . fromString
507−
508−instance Reflex t => Monad (Behavior t) where
509− a >>= f = pull $ sample a >>= sample . f
510− -- 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.
511− return = constant
512− fail = error "Monad (Behavior t) does not support fail"
513−
514−instance (Reflex t, Monoid a) => Monoid (Behavior t a) where
515− mempty = constant mempty
516− mappend a b = pull $ liftM2 mappend (sample a) (sample b)
517− mconcat = pull . fmap mconcat . mapM sample
518−
519−instance (Reflex t, Num a) => Num (Behavior t a) where
520− (+) = liftA2 (+)
521− (-) = liftA2 (-)
522− (*) = liftA2 (*)
523− abs = fmap abs
524− fromInteger = pure . fromInteger
525− negate = fmap negate
526− signum = fmap signum
527−
528−instance (Reflex t, Semigroup a) => Semigroup (Behavior t a) where
529− a <> b = pull $ liftM2 (<>) (sample a) (sample b)
530− sconcat = pull . fmap sconcat . mapM sample
531−#if MIN_VERSION_semigroups(0,17,0)
532− stimes n = fmap $ stimes n
533−#else
534− times1p n = fmap $ times1p n
535−#endif
536−
537−-- | Flipped version of 'fmapMaybe'.
538−fforMaybe :: FunctorMaybe f => f a -> (a -> Maybe b) -> f b
539−fforMaybe = flip fmapMaybe
540−
541−-- | Filter 'f a' using the provided predicate.
542−-- Relies on 'fforMaybe'.
543−ffilter :: FunctorMaybe f => (a -> Bool) -> f a -> f a
544−ffilter f = fmapMaybe $ \x -> if f x then Just x else Nothing
545−
546−-- | Left-biased event union (prefers left event on simultaneous
547−-- occurrence).
548−instance Reflex t => Alt (Event t) where
549− ev1 <!> ev2 = leftmost [ev1, ev2]
550−
551−-- | 'Event' intersection (convenient interface to 'coincidence').
552−instance Reflex t => Apply (Event t) where
553− evf <.> evx = coincidence (fmap (<$> evx) evf)
554−
555−-- | 'Event' intersection (convenient interface to 'coincidence').
556−instance Reflex t => Bind (Event t) where
557− evx >>- f = coincidence (f <$> evx)
558− join = coincidence
559−
560−instance Reflex t => Functor (Event t) where
561− {-# INLINE fmap #-}
562− fmap f = fmapMaybe $ Just . f
563−
564−instance Reflex t => FunctorMaybe (Event t) where
565− {-# INLINE fmapMaybe #-}
566− fmapMaybe f = push $ return . f
567−
568−-- | Never: @'zero' = 'never'@.
569−instance Reflex t => Plus (Event t) where
570− zero = never
571−
572−-- | Replace each occurrence value of the 'Event' with the value of the
573−-- 'Behavior' at the time of that occurrence.
574−tag :: Reflex t => Behavior t b -> Event t a -> Event t b
575−tag b = pushAlways $ \_ -> sample b
576−
577−-- | Create a new 'Event' that combines occurences of supplied 'Event' with the
578−-- current value of the 'Behavior'.
579−attach :: Reflex t => Behavior t a -> Event t b -> Event t (a, b)
580−attach = attachWith (,)
581−
582−-- | Create a new 'Event' that occurs when the supplied 'Event' occurs by
583−-- combining it with the current value of the 'Behavior'.
584−attachWith :: Reflex t => (a -> b -> c) -> Behavior t a -> Event t b -> Event t c
585−attachWith f = attachWithMaybe $ \a b -> Just $ f a b
586−
587−-- | Create a new 'Event' by combining each occurence with the current value of
588−-- the 'Behavior'. The occurrence is discarded if the combining function returns
589−-- Nothing
590−attachWithMaybe :: Reflex t => (a -> b -> Maybe c) -> Behavior t a -> Event t b -> Event t c
591−attachWithMaybe f b e = flip push e $ \o -> (`f` o) <$> sample b
592−
593−-- | Create a new 'Event' that only occurs only once, on the first occurence of
594−-- the supplied 'Event'.
595−headE :: (Reflex t, MonadHold t m, MonadFix m) => Event t a -> m (Event t a)
596−headE e = do
597− rec be <- hold e $ fmap (const never) e'
598− let e' = switch be
599− return e'
600−
601−-- | Create a new 'Event' that occurs on all but the first occurence of the
602−-- supplied 'Event'.
603−tailE :: (Reflex t, MonadHold t m, MonadFix m) => Event t a -> m (Event t a)
604−tailE e = snd <$> headTailE e
605−
606−-- | Create a tuple of two 'Event's with the first one occuring only the first
607−-- time the supplied 'Event' occurs and the second occuring on all but the first
608−-- occurence.
609−headTailE :: (Reflex t, MonadHold t m, MonadFix m) => Event t a -> m (Event t a, Event t a)
610−headTailE e = do
611− eHead <- headE e
612− be <- hold never $ fmap (const e) eHead
613− return (eHead, switch be)
614−
615−-- | Split the supplied 'Event' into two individual 'Event's occuring at the
616−-- same time with the respective values from the tuple.
617−splitE :: Reflex t => Event t (a, b) -> (Event t a, Event t b)
618−splitE e = (fmap fst e, fmap snd e)
619−
620−-- | Print the supplied 'String' and the value of the 'Event' on each
621−-- occurence. This should /only/ be used for debugging.
622−--
623−-- Note: As with Debug.Trace.trace, the message will only be printed if the
624−-- 'Event' is actually used.
625−traceEvent :: (Reflex t, Show a) => String -> Event t a -> Event t a
626−traceEvent s = traceEventWith $ \x -> s <> ": " <> show x
627−
628−-- | Print the output of the supplied function on each occurence of the
629−-- 'Event'. This should /only/ be used for debugging.
630−--
631−-- Note: As with Debug.Trace.trace, the message will only be printed if the
632−-- 'Event' is actually used.
633−traceEventWith :: Reflex t => (a -> String) -> Event t a -> Event t a
634−traceEventWith f = push $ \x -> trace (f x) $ return $ Just x
635−
636−instance (Semigroup a, Reflex t) => Semigroup (Event t a) where
637− (<>) = alignWith (mergeThese (<>))
638− sconcat = fmap sconcat . mergeList . toList
639−#if MIN_VERSION_semigroups(0,17,0)
640− stimes n = fmap $ stimes n
641−#else
642− times1p n = fmap $ times1p n
643−#endif
644−
645−instance (Semigroup a, Reflex t) => Monoid (Event t a) where
646− mempty = never
647− mappend = (<>)
648− mconcat = fmap sconcat . mergeList
649−
650−-- | Create a new 'Event' that occurs if at least one of the 'Event's in the
651−-- list occurs. If multiple occur at the same time they are folded from the left
652−-- with the given function.
653−{-# INLINE mergeWith #-}
654−mergeWith :: Reflex t => (a -> a -> a) -> [Event t a] -> Event t a
655−mergeWith = mergeWith' id
656−
657−{-# INLINE mergeWith' #-}
658−mergeWith' :: Reflex t => (a -> b) -> (b -> b -> b) -> [Event t a] -> Event t b
659−mergeWith' f g es = fmap (Prelude.foldl1 g . map (\(Const2 _ :=> Identity v) -> f v) . DMap.toList)
660− . merge
661− . DMap.fromDistinctAscList
662− . map (\(k, v) -> Const2 k :=> v)
663− $ zip [0 :: Int ..] es
664−
665−-- | Create a new 'Event' that occurs if at least one of the 'Event's in the
666−-- list occurs. If multiple occur at the same time the value is the value of the
667−-- leftmost event.
668−{-# INLINE leftmost #-}
669−leftmost :: Reflex t => [Event t a] -> Event t a
670−leftmost = mergeWith const
671−
672−-- | Create a new 'Event' that occurs if at least one of the 'Event's in the
673−-- list occurs and has a list of the values of all 'Event's occuring at that
674−-- time.
675−mergeList :: Reflex t => [Event t a] -> Event t (NonEmpty a)
676−mergeList [] = never
677−mergeList es = mergeWithCheap' (:|[]) (<>) es
678−
679−-- | Create a new 'Event' combining the map of 'Event's into an 'Event' that
680−-- occurs if at least one of them occurs and has a map of values of all 'Event's
681−-- occuring at that time.
682−mergeMap :: (Reflex t, Ord k) => Map k (Event t a) -> Event t (Map k a)
683−mergeMap = fmap dmapToMap . merge . mapWithFunctorToDMap
684−
685−-- | Split the event into separate events for 'Left' and 'Right' values.
686−fanEither :: Reflex t => Event t (Either a b) -> (Event t a, Event t b)
687−fanEither e =
688− let justLeft = either Just (const Nothing)
689− justRight = either (const Nothing) Just
690− in (fmapMaybe justLeft e, fmapMaybe justRight e)
691−
692−-- | Split the event into separate events for 'This' and 'That' values,
693−-- allowing them to fire simultaneously when the input value is 'These'.
694−fanThese :: Reflex t => Event t (These a b) -> (Event t a, Event t b)
695−fanThese e =
696− let this (This x) = Just x
697− this (These x _) = Just x
698− this _ = Nothing
699− that (That y) = Just y
700− that (These _ y) = Just y
701− that _ = Nothing
702− in (fmapMaybe this e, fmapMaybe that e)
703−
704−-- | Split the event into an 'EventSelector' that allows efficient selection of
705−-- the individual 'Event's.
706−fanMap :: (Reflex t, Ord k) => Event t (Map k a) -> EventSelector t (Const2 k a)
707−fanMap = fan . fmap mapToDMap
708−
709−-- | Switches to the new event whenever it receives one. Whenever a new event
710−-- is provided, if it is firing, its value will be the resulting event's value;
711−-- if it is not firing, but the old one is, the old one's value will be used.
712−switchPromptly :: (Reflex t, MonadHold t m) => Event t a -> Event t (Event t a) -> m (Event t a)
713−switchPromptly ea0 eea = do
714− bea <- hold ea0 eea
715− let eLag = switch bea
716− eCoincidences = coincidence eea
717− return $ leftmost [eCoincidences, eLag]
718−
719−-- | 'switch'es to a new event whenever it receives one. At the moment of
720−-- switching, the old event will be ignored if it fires, and the new one will be
721−-- used if it fires; this is the opposite of 'switch', which will use only the
722−-- old value.
723−switchPromptOnly :: (Reflex t, MonadHold t m) => Event t a -> Event t (Event t a) -> m (Event t a)
724−switchPromptOnly e0 e' = do
725− eLag <- switch <$> hold e0 e'
726− return $ coincidence $ leftmost [e', eLag <$ eLag]
727−
728−instance Reflex t => Align (Event t) where
729− nil = never
730− align = alignWithMaybe Just
731−
732−-- | Create a new 'Event' that only occurs if the supplied 'Event' occurs and
733−-- the 'Behavior' is true at the time of occurence.
734−gate :: Reflex t => Behavior t Bool -> Event t a -> Event t a
735−gate = attachWithMaybe $ \allow a -> if allow then Just a else Nothing
736−
737−-- | Create a new behavior given a starting behavior and switch to a the behvior
738−-- carried by the event when it fires.
739−switcher :: (Reflex t, MonadHold t m)
740− => Behavior t a -> Event t (Behavior t a) -> m (Behavior t a)
741−switcher b eb = pull . (sample <=< sample) <$> hold b eb
742−
743−-- | Combine two 'Dynamic's. The result will change whenever either (or both)
744−-- input 'Dynamic' changes. Equivalent to @zipDynWith (,)@.
745−zipDyn :: Reflex t => Dynamic t a -> Dynamic t b -> Dynamic t (a, b)
746−zipDyn = zipDynWith (,)
747−
748−-- | Combine two 'Dynamic's with a combining function. The result will change
749−-- whenever either (or both) input 'Dynamic' changes.
750−-- More efficient than liftA2.
751−zipDynWith :: Reflex t => (a -> b -> c) -> Dynamic t a -> Dynamic t b -> Dynamic t c
752−zipDynWith f da db =
753− let eab = align (updated da) (updated db)
754− ec = flip push eab $ \o -> do
755− (a, b) <- case o of
756− This a -> do
757− b <- sample $ current db
758− return (a, b)
759− That b -> do
760− a <- sample $ current da
761− return (a, b)
762− These a b -> return (a, b)
763− return $ Just $ f a b
764− in unsafeBuildDynamic (f <$> sample (current da) <*> sample (current db)) ec
765−
766−instance (Reflex t, Monoid a) => Monoid (Dynamic t a) where
767− mconcat = distributeListOverDynWith mconcat
768− mempty = constDyn mempty
769− mappend = zipDynWith mappend
770−
771−-- | This function converts a 'DMap' whose elements are 'Dynamic's into a
772−-- 'Dynamic' 'DMap'. Its implementation is more efficient than doing the same
773−-- through the use of multiple uses of 'zipWithDyn' or 'Applicative' operators.
774−distributeDMapOverDynPure :: forall t k. (Reflex t, GCompare k) => DMap k (Dynamic t) -> Dynamic t (DMap k Identity)
775−distributeDMapOverDynPure dm = case DMap.toList dm of
776− [] -> constDyn DMap.empty
777− [k :=> v] -> fmap (DMap.singleton k . Identity) v
778− _ ->
779− let getInitial = DMap.traverseWithKey (\_ -> fmap Identity . sample . current) dm
780− edmPre = merge $ DMap.map updated dm
781− result = unsafeBuildDynamic getInitial $ flip pushAlways edmPre $ \news -> do
782− olds <- sample $ current result
783− return $ DMap.unionWithKey (\_ _ new -> new) olds news
784− in result
785−
786−-- | Convert a list of 'Dynamic's into a 'Dynamic' list.
787−distributeListOverDyn :: Reflex t => [Dynamic t a] -> Dynamic t [a]
788−distributeListOverDyn = distributeListOverDynWith id
789−
790−-- | Create a new 'Dynamic' by applying a combining function to a list of 'Dynamic's
791−distributeListOverDynWith :: Reflex t => ([a] -> b) -> [Dynamic t a] -> Dynamic t b
792−distributeListOverDynWith f = fmap (f . map (\(Const2 _ :=> Identity v) -> v) . DMap.toList) . distributeDMapOverDynPure . DMap.fromList . map (\(k, v) -> Const2 k :=> v) . zip [0 :: Int ..]
793−
794−-- | Create a new 'Event' that occurs when the first supplied 'Event' occurs
795−-- unless the second supplied 'Event' occurs simultaneously.
796−difference :: Reflex t => Event t a -> Event t b -> Event t a
797−difference = alignWithMaybe $ \case
798− This a -> Just a
799− _ -> Nothing
800−
801−-- (intentially not exported, for now)
802−alignWithMaybe
803− :: Reflex t => (These a b -> Maybe c) -> Event t a -> Event t b -> Event t c
804−alignWithMaybe f ea eb =
805− fmapMaybe (f <=< dmapToThese)
806− $ merge
807− $ DMap.fromList [LeftTag :=> ea, RightTag :=> eb]
808−
809−
810−--------------------------------------------------------------------------------
811−-- Accumulator
812−--------------------------------------------------------------------------------
813−
814−-- | An 'Accumulator' type can be built by accumulating occurrences of an
815−-- 'Event'.
816−class Reflex t => Accumulator t f | f -> t where
817− accum :: (MonadHold t m, MonadFix m) => (a -> b -> a) -> a -> Event t b -> m (f a)
818− accum f = accumMaybe $ \v o -> Just $ f v o
819− accumM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t a) -> a -> Event t b -> m (f a)
820− accumM f = accumMaybeM $ \v o -> Just <$> f v o
821− accumMaybe :: (MonadHold t m, MonadFix m) => (a -> b -> Maybe a) -> a -> Event t b -> m (f a)
822− accumMaybe f = accumMaybeM $ \v o -> return $ f v o
823− accumMaybeM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a)) -> a -> Event t b -> m (f a)
824− mapAccum :: (MonadHold t m, MonadFix m) => (a -> b -> (a, c)) -> a -> Event t b -> m (f a, Event t c)
825− mapAccum f = mapAccumMaybe $ \v o -> bimap Just Just $ f v o
826− mapAccumM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t (a, c)) -> a -> Event t b -> m (f a, Event t c)
827− mapAccumM f = mapAccumMaybeM $ \v o -> bimap Just Just <$> f v o
828− mapAccumMaybe :: (MonadHold t m, MonadFix m) => (a -> b -> (Maybe a, Maybe c)) -> a -> Event t b -> m (f a, Event t c)
829− mapAccumMaybe f = mapAccumMaybeM $ \v o -> return $ f v o
830− mapAccumMaybeM :: (MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a, Maybe c)) -> a -> Event t b -> m (f a, Event t c)
831−
832−-- | Accumulate occurrences of an 'Event', producing an output occurrence each
833−-- time. Discard the underlying 'Accumulator'.
834−mapAccum_ :: forall t m a b c. (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> (a, c)) -> a -> Event t b -> m (Event t c)
835−mapAccum_ f z e = do
836− (_ :: Behavior t a, result) <- mapAccum f z e
837− return result
838−
839−-- | Accumulate occurrences of an 'Event', possibly producing an output
840−-- occurrence each time. Discard the underlying 'Accumulator'.
841−mapAccumMaybe_ :: forall t m a b c. (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> (Maybe a, Maybe c)) -> a -> Event t b -> m (Event t c)
842−mapAccumMaybe_ f z e = do
843− (_ :: Behavior t a, result) <- mapAccumMaybe f z e
844− return result
845−
846−-- | Accumulate occurrences of an 'Event', using a 'PushM' action and producing
847−-- an output occurrence each time. Discard the underlying 'Accumulator'.
848−mapAccumM_ :: forall t m a b c. (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t (a, c)) -> a -> Event t b -> m (Event t c)
849−mapAccumM_ f z e = do
850− (_ :: Behavior t a, result) <- mapAccumM f z e
851− return result
852−
853−-- | Accumulate occurrences of an 'Event', using a 'PushM' action and possibly
854−-- producing an output occurrence each time. Discard the underlying
855−-- 'Accumulator'.
856−mapAccumMaybeM_ :: forall t m a b c. (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe a, Maybe c)) -> a -> Event t b -> m (Event t c)
857−mapAccumMaybeM_ f z e = do
858− (_ :: Behavior t a, result) <- mapAccumMaybeM f z e
859− return result
860−
861−instance Reflex t => Accumulator t (Dynamic t) where
862− accumMaybeM f z e = do
863− rec let e' = flip push e $ \o -> do
864− v <- sample $ current d'
865− f v o
866− d' <- holdDyn z e'
867− return d'
868− mapAccumMaybeM f z e = do
869− rec let e' = flip push e $ \o -> do
870− v <- sample $ current d'
871− result <- f v o
872− return $ case result of
873− (Nothing, Nothing) -> Nothing
874− _ -> Just result
875− d' <- holdDyn z $ fmapMaybe fst e'
876− return (d', fmapMaybe snd e')
877−
878−instance Reflex t => Accumulator t (Behavior t) where
879− accumMaybeM f z e = current <$> accumMaybeM f z e
880− mapAccumMaybeM f z e = first current <$> mapAccumMaybeM f z e
881−
882−instance Reflex t => Accumulator t (Event t) where
883− accumMaybeM f z e = updated <$> accumMaybeM f z e
884− mapAccumMaybeM f z e = first updated <$> mapAccumMaybeM f z e
885−
886−-- | Create a new 'Event' by combining each occurence with the next value of the
887−-- list using the supplied function. If the list runs out of items, all
888−-- subsequent 'Event' occurrences will be ignored.
889−zipListWithEvent :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> c) -> [a] -> Event t b -> m (Event t c)
890−zipListWithEvent f l e = do
891− let f' a b = case a of
892− h:t -> (Just t, Just $ f h b)
893− _ -> (Nothing, Nothing) --TODO: Unsubscribe the event?
894− mapAccumMaybe_ f' l e
895−
896−-- | A 'Monad' that supports adjustment over time. After an action has been
897−-- run, if the given events fire, it will adjust itself so that its net effect
898−-- is as though it had originally been run with the new value. Note that there
899−-- is some issue here with persistent side-effects: obviously, IO (and some
900−-- other side-effects) cannot be undone, so it is up to the instance implementer
901−-- to determine what the best meaning for this class is in such cases.
902−class (Reflex t, Monad m) => MonadAdjust t m | m -> t where
903− runWithReplace :: m a -> Event t (m b) -> m (a, Event t b)
904− sequenceDMapWithAdjust :: GCompare k => DMap k m -> Event t (PatchDMap k m) -> m (DMap k Identity, Event t (PatchDMap k Identity))
905−
906−instance (Reflex t, MonadAdjust t m) => MonadAdjust t (ReaderT r m) where
907− runWithReplace a0 a' = do
908− r <- ask
909− lift $ runWithReplace (runReaderT a0 r) $ fmap (`runReaderT` r) a'
910− sequenceDMapWithAdjust dm0 dm' = do
911− r <- ask
912− let loweredDm0 = DMap.map (`runReaderT` r) dm0
913− loweredDm' = ffor dm' $ \(PatchDMap p) -> PatchDMap $
914− DMap.map (\(ComposeMaybe mv) -> ComposeMaybe $ fmap (`runReaderT` r) mv) p
915− lift $ sequenceDMapWithAdjust loweredDm0 loweredDm'
916−
917−------------------
918−-- Cheap Functions
919−------------------
920−
921−{-# INLINE pushAlwaysCheap #-}
922−pushAlwaysCheap :: Reflex t => (a -> PushM t b) -> Event t a -> Event t b
923−pushAlwaysCheap f = pushCheap (fmap Just . f)
924−
925−{-# INLINE fmapMaybeCheap #-}
926−fmapMaybeCheap :: Reflex t => (a -> Maybe b) -> Event t a -> Event t b
927−fmapMaybeCheap f = pushCheap $ return . f
928−
929−{-# INLINE fforMaybeCheap #-}
930−fforMaybeCheap :: Reflex t => Event t a -> (a -> Maybe b) -> Event t b
931−fforMaybeCheap = flip fmapMaybeCheap
932−
933−{-# INLINE fforCheap #-}
934−fforCheap :: Reflex t => Event t a -> (a -> b) -> Event t b
935−fforCheap = flip fmapCheap
936−
937−{-# INLINE fmapCheap #-}
938−fmapCheap :: Reflex t => (a -> b) -> Event t a -> Event t b
939−fmapCheap f = pushCheap $ return . Just . f
940−
941−{-# INLINE tagCheap #-}
942−tagCheap :: Reflex t => Behavior t b -> Event t a -> Event t b
943−tagCheap b = pushAlwaysCheap $ \_ -> sample b
944−
945−{-# INLINE mergeWithCheap #-}
946−mergeWithCheap :: Reflex t => (a -> a -> a) -> [Event t a] -> Event t a
947−mergeWithCheap = mergeWithCheap' id
948−
949−{-# INLINE mergeWithCheap' #-}
950−mergeWithCheap' :: Reflex t => (a -> b) -> (b -> b -> b) -> [Event t a] -> Event t b
951−mergeWithCheap' f g es = fmapCheap (Prelude.foldl1 g . map (\(Const2 _ :=> Identity v) -> f v) . DMap.toList)
952− . merge
953− . DMap.fromDistinctAscList
954− . map (\(k, v) -> Const2 k :=> v)
955− $ zip [0 :: Int ..] es
956−
957−--------------------------------------------------------------------------------
958−-- Deprecated functions
959−--------------------------------------------------------------------------------
960−
961−-- | Create a new 'Event' that occurs if at least one of the supplied 'Event's
962−-- occurs. If both occur at the same time they are combined using 'mappend'.
963−{-# DEPRECATED appendEvents "If a 'Semigroup a' instance is available, use 'mappend'; otherwise, use 'alignWith (mergeThese mappend)' instead" #-}
964−appendEvents :: (Reflex t, Monoid a) => Event t a -> Event t a -> Event t a
965−appendEvents = alignWith $ mergeThese mappend
966−
967−-- | Alias for 'headE'
968−{-# DEPRECATED onceE "Use 'headE' instead" #-}
969−onceE :: (Reflex t, MonadHold t m, MonadFix m) => Event t a -> m (Event t a)
970−onceE = headE
971−
972−-- | Run both sides of a 'These' monadically, combining the results.
973−{-# DEPRECATED sequenceThese "Use bisequenceA or bisequence from the bifunctors package instead" #-}
974−#ifdef USE_TEMPLATE_HASKELL
975−{-# ANN sequenceThese "HLint: ignore Use fmap" #-}
976−#endif
977−sequenceThese :: Monad m => These (m a) (m b) -> m (These a b)
978−sequenceThese t = case t of
979− This ma -> fmap This ma
980− These ma mb -> liftM2 These ma mb
981− That mb -> fmap That mb
src/Reflex/Dynamic.hsdeleted−586
@@ -1,586 +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−#ifdef USE_REFLEX_OPTIMIZER
16−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
17−#endif
18−-- | This module contains various functions for working with 'Dynamic' values.
19−-- 'Dynamic' and its primitives have been moved to the 'Reflex' class.
20−module Reflex.Dynamic
21− ( -- * Basics
22− Dynamic -- Abstract so we can preserve the law that the current value is always equal to the most recent update
23− , current
24− , updated
25− , holdDyn
26− , constDyn
27− , uniqDyn
28− , uniqDynBy
29− , count
30− , toggle
31− , switchPromptlyDyn
32− , tagPromptlyDyn
33− , attachPromptlyDyn
34− , attachPromptlyDynWith
35− , attachPromptlyDynWithMaybe
36− , foldDyn
37− , foldDynM
38− , foldDynMaybe
39− , foldDynMaybeM
40− , joinDynThroughMap
41− , traceDyn
42− , traceDynWith
43− , splitDynPure
44− , distributeMapOverDynPure
45− , distributeDMapOverDynPure
46− , distributeListOverDynPure
47− , Demux
48− , demux
49− , demuxed
50− -- Things that probably aren't very useful:
51− , HList (..)
52− , FHList (..)
53− , collectDynPure
54− , RebuildSortedHList (..)
55− , IsHList (..)
56− , AllAreFunctors (..)
57− , HListPtr (..)
58− , distributeFHListOverDynPure
59− -- Unsafe
60− , unsafeDynamic
61− -- * Deprecated functions
62− , apDyn
63− , attachDyn
64− , attachDynWith
65− , attachDynWithMaybe
66− , collectDyn
67− , combineDyn
68− , distributeDMapOverDyn
69− , distributeFHListOverDyn
70− , forDyn
71− , forDynM
72− , getDemuxed
73− , joinDyn
74− , mapDyn
75− , mapDynM
76− , mconcatDyn
77− , nubDyn
78− , splitDyn
79− , tagDyn
80− ) where
81−
82−import Prelude hiding (mapM, mapM_)
83−
84−import Data.Functor.Misc
85−import Reflex.Class
86−
87−import Control.Applicative ((<*>))
88−import Control.Monad hiding (forM, forM_, mapM, mapM_)
89−import Control.Monad.Fix
90−import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_)
91−import Data.Align
92−import Data.Dependent.Map (DMap)
93−import qualified Data.Dependent.Map as DMap
94−import Data.Dependent.Sum (DSum (..))
95−import Data.GADT.Compare ((:~:) (..), GCompare (..), GEq (..), GOrdering (..))
96−import Data.Map (Map)
97−import Data.Monoid
98−import Data.These
99−
100−import Debug.Trace
101−
102−-- | Create a new 'Dynamic' that only signals changes if the values actually
103−-- changed.
104−uniqDyn :: (Reflex t, Eq a) => Dynamic t a -> Dynamic t a
105−uniqDyn = uniqDynBy (==)
106−
107−-- | Create a new 'Dynamic' that changes only when the underlying 'Dynamic'
108−-- changes and the given function returns 'False' when given both the old and
109−-- the new values.
110−uniqDynBy :: Reflex t => (a -> a -> Bool) -> Dynamic t a -> Dynamic t a
111−uniqDynBy eq d =
112− let e' = attachWithMaybe (\x x' -> if x' `eq` x then Nothing else Just x') (current d) (updated d)
113− in unsafeDynamic (current d) e'
114−
115−-- | Create a 'Dynamic' using the initial value and change it each time the
116−-- 'Event' occurs using a folding function on the previous value and the value
117−-- of the 'Event'.
118−foldDyn :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> b) -> b -> Event t a -> m (Dynamic t b)
119−foldDyn = accum . flip
120−
121−-- | Like 'foldDyn', but the combining function is a 'PushM' action, so it
122−-- can 'sample' existing 'Behaviors' and 'hold' new ones.
123−foldDynM :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t b) -> b -> Event t a -> m (Dynamic t b)
124−foldDynM = accumM . flip
125−
126−-- | Create a 'Dynamic' using the provided initial value and change it each time
127−-- the provided 'Event' occurs, using a function to combine the old value with
128−-- the 'Event''s value. If the function returns 'Nothing', the value is not
129−-- changed; this is distinct from returning 'Just' the old value, since the
130−-- 'Dynamic''s 'updated' 'Event' will fire in the 'Just' case, and will not fire
131−-- in the 'Nothing' case.
132−foldDynMaybe :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> Maybe b) -> b -> Event t a -> m (Dynamic t b)
133−foldDynMaybe = accumMaybe . flip
134−
135−-- | Like 'foldDynMaybe', but the combining function is a 'PushM' action, so it
136−-- can 'sample' existing 'Behaviors' and 'hold' new ones.
137−foldDynMaybeM :: (Reflex t, MonadHold t m, MonadFix m) => (a -> b -> PushM t (Maybe b)) -> b -> Event t a -> m (Dynamic t b)
138−foldDynMaybeM = accumMaybeM . flip
139−
140−-- | Create a new 'Dynamic' that counts the occurences of the 'Event'.
141−count :: (Reflex t, MonadHold t m, MonadFix m, Num b) => Event t a -> m (Dynamic t b)
142−count e = holdDyn 0 =<< zipListWithEvent const (iterate (+1) 1) e
143−
144−-- | Create a new 'Dynamic' using the initial value that flips its
145−-- value every time the 'Event' occurs.
146−toggle :: (Reflex t, MonadHold t m, MonadFix m) => Bool -> Event t a -> m (Dynamic t Bool)
147−toggle = foldDyn (const not)
148−
149−-- | Switches to the new 'Event' whenever it receives one. Switching occurs
150−-- *before* the inner 'Event' fires - so if the 'Dynamic' changes and both the
151−-- old and new inner Events fire simultaneously, the output will fire with the
152−-- value of the *new* 'Event'.
153−switchPromptlyDyn :: forall t a. Reflex t => Dynamic t (Event t a) -> Event t a
154−switchPromptlyDyn de =
155− let eLag = switch $ current de
156− eCoincidences = coincidence $ updated de
157− in leftmost [eCoincidences, eLag]
158−
159−-- | Split a 'Dynamic' pair into a pair of 'Dynamic's
160−splitDynPure :: Reflex t => Dynamic t (a, b) -> (Dynamic t a, Dynamic t b)
161−splitDynPure d = (fmap fst d, fmap snd d)
162−
163−-- | Convert a 'Map' with 'Dynamic' elements into a 'Dynamic' of a 'Map' with
164−-- non-'Dynamic' elements.
165−distributeMapOverDynPure :: (Reflex t, Ord k) => Map k (Dynamic t v) -> Dynamic t (Map k v)
166−distributeMapOverDynPure = fmap dmapToMap . distributeDMapOverDynPure . mapWithFunctorToDMap
167−
168−-- | Convert a list with 'Dynamic' elements into a 'Dynamic' of a list with
169−-- non-'Dynamic' elements, preserving the order of the elements.
170−distributeListOverDynPure :: Reflex t => [Dynamic t v] -> Dynamic t [v]
171−distributeListOverDynPure =
172− fmap (map fromDSum . DMap.toAscList) .
173− distributeDMapOverDynPure .
174− DMap.fromDistinctAscList .
175− zipWith toDSum [0..]
176− where
177− toDSum :: Int -> Dynamic t a -> DSum (Const2 Int a) (Dynamic t)
178− toDSum k v = Const2 k :=> v
179− fromDSum :: DSum (Const2 Int a) Identity -> a
180− fromDSum (Const2 _ :=> Identity v) = v
181−
182−--TODO: Generalize this to functors other than Maps
183−-- | Combine a 'Dynamic' of a 'Map' of 'Dynamic's into a 'Dynamic'
184−-- with the current values of the 'Dynamic's in a map.
185−joinDynThroughMap :: forall t k a. (Reflex t, Ord k) => Dynamic t (Map k (Dynamic t a)) -> Dynamic t (Map k a)
186−joinDynThroughMap = joinDyn . fmap distributeMapOverDynPure
187−
188−-- | Print the value of the 'Dynamic' on each change and prefix it
189−-- with the provided string. This should /only/ be used for debugging.
190−--
191−-- Note: Just like Debug.Trace.trace, the value will only be shown if something
192−-- else in the system is depending on it.
193−traceDyn :: (Reflex t, Show a) => String -> Dynamic t a -> Dynamic t a
194−traceDyn s = traceDynWith $ \x -> s <> ": " <> show x
195−
196−-- | Print the result of applying the provided function to the value
197−-- of the 'Dynamic' on each change. This should /only/ be used for
198−-- debugging.
199−--
200−-- Note: Just like Debug.Trace.trace, the value will only be shown if something
201−-- else in the system is depending on it.
202−traceDynWith :: Reflex t => (a -> String) -> Dynamic t a -> Dynamic t a
203−traceDynWith f d =
204− let e' = traceEventWith f $ updated d
205− getV0 = do
206− x <- sample $ current d
207− trace (f x) $ return x
208− in unsafeBuildDynamic getV0 e'
209−
210−-- | Replace the value of the 'Event' with the current value of the 'Dynamic'
211−-- each time the 'Event' occurs.
212−--
213−-- Note: `tagPromptlyDyn d e` differs from `tag (current d) e` in the case that `e` is firing
214−-- at the same time that `d` is changing. With `tagPromptlyDyn d e`, the *new* value of `d`
215−-- will replace the value of `e`, whereas with `tag (current d) e`, the *old* value
216−-- will be used, since the 'Behavior' won't be updated until the end of the frame.
217−-- Additionally, this means that the output 'Event' may not be used to directly change
218−-- the input 'Dynamic', because that would mean its value depends on itself. When creating
219−-- cyclic data flows, generally `tag (current d) e` is preferred.
220−tagPromptlyDyn :: Reflex t => Dynamic t a -> Event t b -> Event t a
221−tagPromptlyDyn = attachPromptlyDynWith const
222−
223−-- | Attach the current value of the 'Dynamic' to the value of the
224−-- 'Event' each time it occurs.
225−--
226−-- Note: `attachPromptlyDyn d` is not the same as `attach (current d)`. See 'tagPromptlyDyn' for details.
227−attachPromptlyDyn :: Reflex t => Dynamic t a -> Event t b -> Event t (a, b)
228−attachPromptlyDyn = attachPromptlyDynWith (,)
229−
230−-- | Combine the current value of the 'Dynamic' with the value of the
231−-- 'Event' each time it occurs.
232−--
233−-- Note: `attachPromptlyDynWith f d` is not the same as `attachWith f (current d)`. See 'tagPromptlyDyn' for details.
234−attachPromptlyDynWith :: Reflex t => (a -> b -> c) -> Dynamic t a -> Event t b -> Event t c
235−attachPromptlyDynWith f = attachPromptlyDynWithMaybe $ \a b -> Just $ f a b
236−
237−-- | Create a new 'Event' by combining the value at each occurence with the
238−-- current value of the 'Dynamic' value and possibly filtering if the combining
239−-- function returns 'Nothing'.
240−--
241−-- Note: `attachPromptlyDynWithMaybe f d` is not the same as `attachWithMaybe f
242−-- (current d)`. See 'tagPromptlyDyn' for details.
243−attachPromptlyDynWithMaybe :: Reflex t => (a -> b -> Maybe c) -> Dynamic t a -> Event t b -> Event t c
244−attachPromptlyDynWithMaybe f d e =
245− let e' = attach (current d) e
246− in fforMaybe (align e' $ updated d) $ \case
247− This (a, b) -> f a b -- Only the tagging event is firing, so use that
248− These (_, b) a -> f a b -- Both events are firing, so use the newer value
249− That _ -> Nothing -- The tagging event isn't firing, so don't fire
250−
251−--------------------------------------------------------------------------------
252−-- Demux
253−--------------------------------------------------------------------------------
254−
255−-- | Represents a time changing value together with an 'EventSelector' that can
256−-- efficiently detect when the underlying 'Dynamic' has a particular value.
257−-- This is useful for representing data like the current selection of a long
258−-- list.
259−--
260−-- Semantically,
261−--
262−-- > demuxed (demux d) k === fmap (== k) d
263−--
264−-- However, the when getDemuxed is used multiple times, the complexity is only
265−-- /O(log(n))/, rather than /O(n)/ for fmap.
266−data Demux t k = Demux { demuxValue :: Behavior t k
267− , demuxSelector :: EventSelector t (Const2 k Bool)
268− }
269−
270−-- | Demultiplex an input value to a 'Demux' with many outputs. At any given
271−-- time, whichever output is indicated by the given 'Dynamic' will be 'True'.
272−demux :: (Reflex t, Ord k) => Dynamic t k -> Demux t k
273−demux k = Demux (current k)
274− (fan $ attachWith (\k0 k1 -> if k0 == k1
275− then DMap.empty
276− else DMap.fromList [Const2 k0 :=> Identity False,
277− Const2 k1 :=> Identity True])
278− (current k) (updated k))
279−
280−-- | Select a particular output of the 'Demux'; this is equivalent to (but much
281−-- faster than) mapping over the original 'Dynamic' and checking whether it is
282−-- equal to the given key.
283−demuxed :: (Reflex t, Eq k) => Demux t k -> k -> Dynamic t Bool
284−demuxed d k =
285− let e = select (demuxSelector d) (Const2 k)
286− in unsafeBuildDynamic (fmap (==k) $ sample $ demuxValue d) e
287−
288−--------------------------------------------------------------------------------
289−-- collectDyn
290−--------------------------------------------------------------------------------
291−
292−--TODO: This whole section is badly in need of cleanup
293−
294−-- | A heterogeneous list whose type and length are fixed statically. This is
295−-- reproduced from the 'HList' package due to integration issues, and because
296−-- very little other functionality from that library is needed.
297−data HList (l::[*]) where
298− HNil :: HList '[]
299− HCons :: e -> HList l -> HList (e ': l)
300−
301−infixr 2 `HCons`
302−
303−type family HRevApp (l1 :: [k]) (l2 :: [k]) :: [k]
304−type instance HRevApp '[] l = l
305−type instance HRevApp (e ': l) l' = HRevApp l (e ': l')
306−
307−hRevApp :: HList l1 -> HList l2 -> HList (HRevApp l1 l2)
308−hRevApp HNil l = l
309−hRevApp (HCons x l) l' = hRevApp l (HCons x l')
310−
311−hReverse :: HList l -> HList (HRevApp l '[])
312−hReverse l = hRevApp l HNil
313−
314−hBuild :: (HBuild' '[] r) => r
315−hBuild = hBuild' HNil
316−
317−class HBuild' l r where
318− hBuild' :: HList l -> r
319−
320−instance (l' ~ HRevApp l '[])
321− => HBuild' l (HList l') where
322− hBuild' = hReverse
323−
324−instance HBuild' (a ': l) r
325− => HBuild' l (a->r) where
326− hBuild' l x = hBuild' (HCons x l)
327−
328−-- | Like 'HList', but with a functor wrapping each element.
329−data FHList f l where
330− FHNil :: FHList f '[]
331− FHCons :: f e -> FHList f l -> FHList f (e ': l)
332−
333−instance GEq (HListPtr l) where
334− HHeadPtr `geq` HHeadPtr = Just Refl
335− HHeadPtr `geq` HTailPtr _ = Nothing
336− HTailPtr _ `geq` HHeadPtr = Nothing
337− HTailPtr a `geq` HTailPtr b = a `geq` b
338−
339−instance GCompare (HListPtr l) where -- Warning: This ordering can't change, dmapTo*HList will break
340− HHeadPtr `gcompare` HHeadPtr = GEQ
341− HHeadPtr `gcompare` HTailPtr _ = GLT
342− HTailPtr _ `gcompare` HHeadPtr = GGT
343− HTailPtr a `gcompare` HTailPtr b = a `gcompare` b
344−
345−-- | A typed index into a typed heterogeneous list.
346−data HListPtr l a where
347− HHeadPtr :: HListPtr (h ': t) h
348− HTailPtr :: HListPtr t a -> HListPtr (h ': t) a
349−
350−fhlistToDMap :: forall (f :: * -> *) l. FHList f l -> DMap (HListPtr l) f
351−fhlistToDMap = DMap.fromList . go
352− where go :: forall l'. FHList f l' -> [DSum (HListPtr l') f]
353− go = \case
354− FHNil -> []
355− FHCons h t -> (HHeadPtr :=> h) : map (\(p :=> v) -> HTailPtr p :=> v) (go t)
356−
357−-- | This class allows 'HList's and 'FHlist's to be built from regular lists;
358−-- they must be contiguous and sorted.
359−class RebuildSortedHList l where
360− rebuildSortedFHList :: [DSum (HListPtr l) f] -> FHList f l
361− rebuildSortedHList :: [DSum (HListPtr l) Identity] -> HList l
362−
363−instance RebuildSortedHList '[] where
364− rebuildSortedFHList l = case l of
365− [] -> FHNil
366− _ : _ -> error "rebuildSortedFHList{'[]}: empty list expected"
367− rebuildSortedHList l = case l of
368− [] -> HNil
369− _ : _ -> error "rebuildSortedHList{'[]}: empty list expected"
370−
371−instance RebuildSortedHList t => RebuildSortedHList (h ': t) where
372− rebuildSortedFHList l = case l of
373− ((HHeadPtr :=> h) : t) -> FHCons h . rebuildSortedFHList . map (\(HTailPtr p :=> v) -> p :=> v) $ t
374− _ -> error "rebuildSortedFHList{h':t}: non-empty list with HHeadPtr expected"
375− rebuildSortedHList l = case l of
376− ((HHeadPtr :=> Identity h) : t) -> HCons h . rebuildSortedHList . map (\(HTailPtr p :=> v) -> p :=> v) $ t
377− _ -> error "rebuildSortedHList{h':t}: non-empty list with HHeadPtr expected"
378−
379−dmapToHList :: forall l. RebuildSortedHList l => DMap (HListPtr l) Identity -> HList l
380−dmapToHList = rebuildSortedHList . DMap.toList
381−
382−-- | Collect a hetereogeneous list whose elements are all 'Dynamic's into a
383−-- single 'Dynamic' whose value represents the current values of all of the
384−-- input 'Dynamic's.
385−distributeFHListOverDynPure :: (Reflex t, RebuildSortedHList l) => FHList (Dynamic t) l -> Dynamic t (HList l)
386−distributeFHListOverDynPure l = fmap dmapToHList $ distributeDMapOverDynPure $ fhlistToDMap l
387−
388−-- | Indicates that all elements in a type-level list are applications of the
389−-- same functor.
390−class AllAreFunctors (f :: a -> *) (l :: [a]) where
391− type FunctorList f l :: [*]
392− toFHList :: HList (FunctorList f l) -> FHList f l
393− fromFHList :: FHList f l -> HList (FunctorList f l)
394−
395−instance AllAreFunctors f '[] where
396− type FunctorList f '[] = '[]
397− toFHList l = case l of
398− HNil -> FHNil
399−#if !defined(__GLASGOW_HASKELL__) || __GLASGOW_HASKELL__ < 800
400− _ -> error "toFHList: impossible" -- Otherwise, GHC complains of a non-exhaustive pattern match; see https://ghc.haskell.org/trac/ghc/ticket/4139
401−#endif
402− fromFHList FHNil = HNil
403−
404−instance AllAreFunctors f t => AllAreFunctors f (h ': t) where
405− type FunctorList f (h ': t) = f h ': FunctorList f t
406− toFHList l = case l of
407− a `HCons` b -> a `FHCons` toFHList b
408−#if !defined(__GLASGOW_HASKELL__) || __GLASGOW_HASKELL__ < 800
409− _ -> error "toFHList: impossible" -- Otherwise, GHC complains of a non-exhaustive pattern match; see https://ghc.haskell.org/trac/ghc/ticket/4139
410−#endif
411− fromFHList (a `FHCons` b) = a `HCons` fromFHList b
412−
413−-- | Convert a datastructure whose constituent parts are all 'Dynamic's into a
414−-- single 'Dynamic' whose value represents all the current values of the input's
415−-- consitutent 'Dynamic's.
416−collectDynPure :: ( RebuildSortedHList (HListElems b)
417− , IsHList a, IsHList b
418− , AllAreFunctors (Dynamic t) (HListElems b)
419− , Reflex t
420− , HListElems a ~ FunctorList (Dynamic t) (HListElems b)
421− ) => a -> Dynamic t b
422−collectDynPure ds = fmap fromHList $ distributeFHListOverDynPure $ toFHList $ toHList ds
423−
424−-- | Poor man's 'Generic's for product types only.
425−class IsHList a where
426− type HListElems a :: [*]
427− toHList :: a -> HList (HListElems a)
428− fromHList :: HList (HListElems a) -> a
429−
430−instance IsHList (a, b) where
431− type HListElems (a, b) = [a, b]
432− toHList (a, b) = hBuild a b
433− fromHList l = case l of
434− a `HCons` b `HCons` HNil -> (a, b)
435−#if !defined(__GLASGOW_HASKELL__) || __GLASGOW_HASKELL__ < 800
436− _ -> error "fromHList: impossible" -- Otherwise, GHC complains of a non-exhaustive pattern match; see https://ghc.haskell.org/trac/ghc/ticket/4139
437−#endif
438−
439−instance IsHList (a, b, c, d) where
440− type HListElems (a, b, c, d) = [a, b, c, d]
441− toHList (a, b, c, d) = hBuild a b c d
442− fromHList l = case l of
443− a `HCons` b `HCons` c `HCons` d `HCons` HNil -> (a, b, c, d)
444−#if !defined(__GLASGOW_HASKELL__) || __GLASGOW_HASKELL__ < 800
445− _ -> error "fromHList: impossible" -- Otherwise, GHC complains of a non-exhaustive pattern match; see https://ghc.haskell.org/trac/ghc/ticket/4139
446−#endif
447−
448−instance IsHList (a, b, c, d, e, f) where
449− type HListElems (a, b, c, d, e, f) = [a, b, c, d, e, f]
450− toHList (a, b, c, d, e, f) = hBuild a b c d e f
451− fromHList l = case l of
452− a `HCons` b `HCons` c `HCons` d `HCons` e `HCons` f `HCons` HNil -> (a, b, c, d, e, f)
453−#if !defined(__GLASGOW_HASKELL__) || __GLASGOW_HASKELL__ < 800
454− _ -> error "fromHList: impossible" -- Otherwise, GHC complains of a non-exhaustive pattern match; see https://ghc.haskell.org/trac/ghc/ticket/4139
455−#endif
456−
457−--------------------------------------------------------------------------------
458−-- Deprecated functions
459−--------------------------------------------------------------------------------
460−
461−-- | Map a function over a 'Dynamic'.
462−{-# DEPRECATED mapDyn "Use 'return . fmap f' instead of 'mapDyn f'; consider eliminating monadic style" #-}
463−mapDyn :: (Reflex t, Monad m) => (a -> b) -> Dynamic t a -> m (Dynamic t b)
464−mapDyn f = return . fmap f
465−
466−-- | Map a sampling function over a 'Dynamic'. The sampling function will use the input 'Dynamic''s 'current' 'Behavior' until the first time its 'updated' 'Event' fires, at which point it will be invoked only once each time the 'Event' fires.
467−{-# DEPRECATED mapDynM "Consider using the Monad instance for Dynamic instead." #-}
468−mapDynM :: forall t m a b. (Reflex t, MonadHold t m) => (forall m'. MonadSample t m' => a -> m' b) -> Dynamic t a -> m (Dynamic t b)
469−mapDynM f d = do
470− let e' = push (fmap Just . f :: a -> PushM t (Maybe b)) $ updated d
471− eb' = fmap constant e'
472− v0 = pull $ f =<< sample (current d)
473− bb' :: Behavior t (Behavior t b) <- hold v0 eb'
474− let b' = pull $ sample =<< sample bb'
475− return $ unsafeDynamic b' e'
476−
477−-- | Flipped version of 'mapDyn'.
478−{-# DEPRECATED forDyn "Use 'return . ffor a' instead of 'forDyn a'; consider eliminating monadic style" #-}
479−forDyn :: (Reflex t, Monad m) => Dynamic t a -> (a -> b) -> m (Dynamic t b)
480−forDyn a = return . ffor a
481−
482−-- | Flipped version of 'mapDynM'
483−{-# DEPRECATED forDynM "Consider using the Monad instance for Dynamic instead." #-}
484−forDynM :: forall t m a b. (Reflex t, MonadHold t m) => Dynamic t a -> (forall m'. MonadSample t m' => a -> m' b) -> m (Dynamic t b)
485−forDynM d f = mapDynM f d
486−
487−-- | Split the 'Dynamic' into two 'Dynamic's, each taking the respective value
488−-- of the tuple.
489−{-# DEPRECATED splitDyn "Use 'return . splitDynPure' instead; consider eliminating monadic style" #-}
490−splitDyn :: (Reflex t, Monad m) => Dynamic t (a, b) -> m (Dynamic t a, Dynamic t b)
491−splitDyn = return . splitDynPure
492−
493−-- | Merge the 'Dynamic' values using their 'Monoid' instance.
494−{-# DEPRECATED mconcatDyn "Use 'return . mconcat' instead; consider eliminating monadic style" #-}
495−mconcatDyn :: forall t m a. (Reflex t, Monad m, Monoid a) => [Dynamic t a] -> m (Dynamic t a)
496−mconcatDyn = return . mconcat
497−
498−-- | This function no longer needs to be monadic; see 'distributeMapOverDynPure'.
499−{-# DEPRECATED distributeDMapOverDyn "Use 'return . distributeDMapOverDynPure' instead; consider eliminating monadic style" #-}
500−distributeDMapOverDyn :: (Reflex t, Monad m, GCompare k) => DMap k (Dynamic t) -> m (Dynamic t (DMap k Identity))
501−distributeDMapOverDyn = return . distributeDMapOverDynPure
502−
503−-- | Merge two 'Dynamic's into a new one using the provided function. The new
504−-- 'Dynamic' changes its value each time one of the original 'Dynamic's changes
505−-- its value.
506−{-# DEPRECATED combineDyn "Use 'return (zipDynWith f a b)' instead of 'combineDyn f a b'; consider eliminating monadic style" #-}
507−combineDyn :: forall t m a b c. (Reflex t, Monad m) => (a -> b -> c) -> Dynamic t a -> Dynamic t b -> m (Dynamic t c)
508−combineDyn f a b = return $ zipDynWith f a b
509−
510−-- | A psuedo applicative version of ap for 'Dynamic'. Example useage:
511−--
512−-- > do
513−-- > person <- Person `mapDyn` dynFirstName
514−-- > `apDyn` dynListName
515−-- > `apDyn` dynAge
516−-- > `apDyn` dynAddress
517−{-# 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" #-}
518−#ifdef USE_TEMPLATE_HASKELL
519−{-# ANN apDyn "HLint: ignore Use fmap" #-}
520−#endif
521−apDyn :: forall t m a b. (Reflex t, Monad m)
522− => m (Dynamic t (a -> b))
523− -> Dynamic t a
524− -> m (Dynamic t b)
525−apDyn m a = fmap (<*> a) m
526−
527−--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
528−-- | This function no longer needs to be monadic, so it has been replaced by
529−-- 'demuxed', which is pure.
530−{-# DEPRECATED getDemuxed "Use 'return . demuxed d' instead of 'getDemuxed d'; consider eliminating monadic style" #-}
531−getDemuxed :: (Reflex t, Monad m, Eq k) => Demux t k -> k -> m (Dynamic t Bool)
532−getDemuxed d = return . demuxed d
533−
534−-- | This function no longer needs to be monadic, so it has been replaced by
535−-- 'distributeFHListOverDynPure', which is pure.
536−{-# DEPRECATED distributeFHListOverDyn "Use 'return . distributeFHListOverDynPure' instead; consider eliminating monadic style" #-}
537−distributeFHListOverDyn :: forall t m l. (Reflex t, Monad m, RebuildSortedHList l) => FHList (Dynamic t) l -> m (Dynamic t (HList l))
538−distributeFHListOverDyn = return . distributeFHListOverDynPure
539−
540−-- | This function no longer needs to be monadic, so it has been replaced by
541−-- 'collectDynPure', which is pure.
542−{-# DEPRECATED collectDyn "Use 'return . collectDynPure' instead; consider eliminating monadic style" #-}
543−collectDyn :: ( RebuildSortedHList (HListElems b)
544− , IsHList a, IsHList b
545− , AllAreFunctors (Dynamic t) (HListElems b)
546− , Reflex t, Monad m
547− , HListElems a ~ FunctorList (Dynamic t) (HListElems b)
548− ) => a -> m (Dynamic t b)
549−collectDyn = return . collectDynPure
550−
551−-- | This function has been renamed to 'tagPromptlyDyn' to clarify its
552−-- semantics.
553−{-# DEPRECATED tagDyn "Use 'tagPromptlyDyn' instead" #-}
554−tagDyn :: Reflex t => Dynamic t a -> Event t b -> Event t a
555−tagDyn = tagPromptlyDyn
556−
557−-- | This function has been renamed to 'attachPromptlyDyn' to clarify its
558−-- semantics.
559−{-# DEPRECATED attachDyn "Use 'attachPromptlyDyn' instead" #-}
560−attachDyn :: Reflex t => Dynamic t a -> Event t b -> Event t (a, b)
561−attachDyn = attachPromptlyDyn
562−
563−-- | This function has been renamed to 'attachPromptlyDynWith' to clarify its
564−-- semantics.
565−{-# DEPRECATED attachDynWith "Use 'attachPromptlyDynWith' instead" #-}
566−attachDynWith :: Reflex t => (a -> b -> c) -> Dynamic t a -> Event t b -> Event t c
567−attachDynWith = attachPromptlyDynWith
568−
569−-- | This function has been renamed to 'attachPromptlyDynWithMaybe' to clarify
570−-- its semantics.
571−{-# DEPRECATED attachDynWithMaybe "Use 'attachPromptlyDynWithMaybe' instead" #-}
572−attachDynWithMaybe :: Reflex t => (a -> b -> Maybe c) -> Dynamic t a -> Event t b -> Event t c
573−attachDynWithMaybe = attachPromptlyDynWithMaybe
574−
575−-- | Combine an inner and outer 'Dynamic' such that the resulting 'Dynamic''s
576−-- current value will always be equal to the current value's current value, and
577−-- will change whenever either the inner or the outer (or both) values change.
578−{-# DEPRECATED joinDyn "Use 'join' instead" #-}
579−joinDyn :: Reflex t => Dynamic t (Dynamic t a) -> Dynamic t a
580−joinDyn = join
581−
582−-- | 'nubDyn''s behavior is not quite analogous to 'nub''s behavior, so it has
583−-- been renamed to 'uniqDyn'
584−{-# DEPRECATED nubDyn "Use 'uniqDyn' instead" #-}
585−nubDyn :: (Reflex t, Eq a) => Dynamic t a -> Dynamic t a
586−nubDyn = uniqDyn
src/Reflex/Dynamic/TH.hsdeleted−120
@@ -1,120 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−{-# LANGUAGE EmptyDataDecls #-}
3−{-# LANGUAGE GADTs #-}
4−{-# LANGUAGE PatternGuards #-}
5−{-# LANGUAGE ScopedTypeVariables #-}
6−{-# LANGUAGE TemplateHaskell #-}
7−{-# LANGUAGE TypeOperators #-}
8−#ifdef USE_REFLEX_OPTIMIZER
9−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
10−#endif
11−-- | Template Haskell helper functions for building complex 'Dynamic' values.
12−module Reflex.Dynamic.TH
13− ( qDynPure
14− , unqDyn
15− , mkDynPure
16− -- * Deprecated functions
17− , qDyn
18− , mkDyn
19− ) where
20−
21−import Reflex.Dynamic
22−
23−import Control.Monad.State
24−import Data.Data
25−import Data.Generics
26−import Data.Monoid
27−import qualified Language.Haskell.Exts as Hs
28−import qualified Language.Haskell.Meta.Syntax.Translate as Hs
29−import Language.Haskell.TH
30−import Language.Haskell.TH.Quote
31−import qualified Language.Haskell.TH.Syntax as TH
32−
33−-- | Quote a 'Dynamic' expression. Within the quoted expression, you can use
34−-- @$(unqDyn [| x |])@ to refer to any expression @x@ of type @Dynamic t a@; the
35−-- unquoted result will be of type @a@
36−qDynPure :: Q Exp -> Q Exp
37−qDynPure qe = do
38− e <- qe
39− let f :: forall d. Data d => d -> StateT [(Name, Exp)] Q d
40− f d = case eqT of
41− Just (Refl :: d :~: Exp)
42− | AppE (VarE m) eInner <- d
43− , m == 'unqMarker
44− -> do n <- lift $ newName "dynamicQuotedExpressionVariable"
45− modify ((n, eInner):)
46− return $ VarE n
47− _ -> gmapM f d
48− (e', exprsReversed) <- runStateT (gmapM f e) []
49− let exprs = reverse exprsReversed
50− arg = foldr (\a b -> ConE 'FHCons `AppE` a `AppE` b) (ConE 'FHNil) $ map snd exprs
51− param = foldr (\a b -> ConP 'HCons [VarP a, b]) (ConP 'HNil []) $ map fst exprs
52− [| $(return $ LamE [param] e') <$> distributeFHListOverDynPure $(return arg) |]
53−
54−-- | Antiquote a 'Dynamic' expression. This can /only/ be used inside of a
55−-- 'qDyn' quotation.
56−unqDyn :: Q Exp -> Q Exp
57−unqDyn e = [| unqMarker $e |]
58−
59−-- | This type represents an occurrence of unqDyn before it has been processed
60−-- by qDyn. If you see it in a type error, it probably means that unqDyn has
61−-- been used outside of a qDyn context.
62−data UnqDyn
63−
64−-- unqMarker must not be exported; it is used only as a way of smuggling data
65−-- from unqDyn to qDyn
66−
67−--TODO: It would be much nicer if the TH AST was extensible to support this kind of thing without trickery
68−unqMarker :: a -> UnqDyn
69−unqMarker = error "An unqDyn expression was used outside of a qDyn expression"
70−
71−-- | Create a 'Dynamic' value using other 'Dynamic's as inputs. The result is
72−-- sometimes more concise and readable than the equivalent 'Applicative'-based
73−-- expression. For example:
74−--
75−-- > [mkDyn| $x + $v * $t + 1/2 * $a * $t ^ 2 |]
76−--
77−-- would have a very cumbersome 'Applicative' encoding.
78−mkDynPure :: QuasiQuoter
79−mkDynPure = QuasiQuoter
80− { quoteExp = mkDynExp
81− , quotePat = error "mkDyn: pattern splices are not supported"
82− , quoteType = error "mkDyn: type splices are not supported"
83− , quoteDec = error "mkDyn: declaration splices are not supported"
84− }
85−
86−mkDynExp :: String -> Q Exp
87−mkDynExp s = case Hs.parseExpWithMode (Hs.defaultParseMode { Hs.extensions = [ Hs.EnableExtension Hs.TemplateHaskell ] }) s of
88− Hs.ParseFailed (Hs.SrcLoc _ l c) err -> fail $ "mkDyn:" <> show l <> ":" <> show c <> ": " <> err
89− Hs.ParseOk e -> qDynPure $ return $ everywhere (id `extT` reinstateUnqDyn) $ Hs.toExp $ everywhere (id `extT` antiE) e
90− where TH.Name (TH.OccName occName) (TH.NameG _ _ (TH.ModName modName)) = 'unqMarker
91− antiE x = case x of
92− Hs.SpliceExp se ->
93− Hs.App (Hs.Var $ Hs.Qual (Hs.ModuleName modName) (Hs.Ident occName)) $ case se of
94− Hs.IdSplice v -> Hs.Var $ Hs.UnQual $ Hs.Ident v
95− Hs.ParenSplice ps -> ps
96− _ -> x
97− reinstateUnqDyn (TH.Name (TH.OccName occName') (TH.NameQ (TH.ModName modName')))
98− | modName == modName' && occName == occName' = 'unqMarker
99− reinstateUnqDyn x = x
100−
101−--------------------------------------------------------------------------------
102−-- Deprecated
103−--------------------------------------------------------------------------------
104−
105−{-# DEPRECATED qDyn "Instead of $(qDyn x), use return $(qDynPure x)" #-}
106−-- | Like 'qDynPure', but wraps its result monadically using 'return'. This is
107−-- no longer necessary, due to 'Dynamic' being an instance of 'Functor'.
108−qDyn :: Q Exp -> Q Exp
109−qDyn qe = [| return $(qDynPure qe) |]
110−
111−{-# DEPRECATED mkDyn "Instead of [mkDyn| x |], use return [mkDynPure| x |]" #-}
112−-- | Like 'mkDynPure', but wraps its result monadically using 'return'. This is
113−-- no longer necessary, due to 'Dynamic' being an instance of 'Functor'.
114−mkDyn :: QuasiQuoter
115−mkDyn = QuasiQuoter
116− { quoteExp = \s -> [| return $(mkDynExp s) |]
117− , quotePat = error "mkDyn: pattern splices are not supported"
118− , quoteType = error "mkDyn: type splices are not supported"
119− , quoteDec = error "mkDyn: declaration splices are not supported"
120− }
src/Reflex/Dynamic/Uniq.hsdeleted−105
@@ -1,105 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−{-# LANGUAGE FlexibleInstances #-}
3−{-# LANGUAGE MagicHash #-}
4−{-# LANGUAGE MultiParamTypeClasses #-}
5−#ifdef USE_REFLEX_OPTIMIZER
6−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
7−#endif
8−-- | This module provides a variation of 'Dynamic' values that uses cheap
9−-- pointer equality checks to reduce the amount of signal propagation needed.
10−module Reflex.Dynamic.Uniq
11− ( UniqDynamic
12− , uniqDynamic
13− , fromUniqDynamic
14− , alreadyUniqDynamic
15− ) where
16−
17−import Control.Applicative (Applicative (..))
18−import GHC.Exts
19−import Reflex.Class
20−import Reflex.Dynamic
21−
22−-- | A 'Dynamic' whose 'updated' 'Event' will never fire with the same value as
23−-- the 'current' 'Behavior''s contents. In order to maintain this constraint,
24−-- the value inside a 'UniqDynamic' is always evaluated to
25−-- <https://wiki.haskell.org/Weak_head_normal_form weak head normal form>.
26−--
27−-- Internally, 'UniqDynamic' uses pointer equality as a heuristic to avoid
28−-- unnecessary update propagation; this is much more efficient than performing
29−-- full comparisons. However, when the 'UniqDynamic' is converted back into a
30−-- regular 'Dynamic', a full comparison is performed.
31−newtype UniqDynamic t a = UniqDynamic { unUniqDynamic :: Dynamic t a }
32−
33−-- | Construct a 'UniqDynamic' by eliminating redundant updates from a 'Dynamic'.
34−uniqDynamic :: Reflex t => Dynamic t a -> UniqDynamic t a
35−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
36− old <- sample $ current d --TODO: Is it better to sample ourselves here?
37− return $ unsafeJustChanged old new
38−
39−-- | Retrieve a normal 'Dynamic' from a 'UniqDynamic'. This will perform a
40−-- final check using the output type's 'Eq' instance to ensure deterministic
41−-- behavior.
42−--
43−-- WARNING: If used with a type whose 'Eq' instance is not law-abiding -
44−-- specifically, if there are cases where @x /= x@, 'fromUniqDynamic' may
45−-- eliminate more 'updated' occurrences than it should. For example, NaN values
46−-- of 'Double' and 'Float' are considered unequal to themselves by the 'Eq'
47−-- instance, but can be equal by pointer equality. This may cause 'UniqDynamic'
48−-- to lose changes from NaN to NaN.
49−fromUniqDynamic :: (Reflex t, Eq a) => UniqDynamic t a -> Dynamic t a
50−fromUniqDynamic (UniqDynamic d) = uniqDynBy superEq d
51− where
52− -- Only consider values different if they fail both pointer equality /and/
53− -- 'Eq' equality. This is to make things a bit more deterministic in the
54− -- case of unlawful 'Eq' instances. However, it is still possible to
55− -- achieve nondeterminism by constructing elements that are identical in
56− -- value, unequal according to 'Eq', and nondeterministically equal or
57− -- nonequal by pointer quality. I suspect that it is impossible to make the
58− -- behavior deterministic in this case.
59− superEq a b = a `unsafePtrEq` b || a == b
60−
61−-- | Create a UniqDynamic without uniqing it on creation. This will be slightly
62−-- faster than uniqDynamic when used with a Dynamic whose values are always (or
63−-- nearly always) different from its previous values; if used with a Dynamic
64−-- whose values do not change frequently, it may be much slower than uniqDynamic
65−alreadyUniqDynamic :: Dynamic t a -> UniqDynamic t a
66−alreadyUniqDynamic = UniqDynamic
67−
68−unsafePtrEq :: a -> a -> Bool
69−unsafePtrEq a b = case a `seq` b `seq` reallyUnsafePtrEquality# a b of
70− 0# -> False
71− _ -> True
72−
73−unsafeJustChanged :: a -> a -> Maybe a
74−unsafeJustChanged old new =
75− if old `unsafePtrEq` new
76− then Nothing
77− else Just new
78−
79−instance Reflex t => Accumulator t (UniqDynamic t) where
80− accumMaybeM f z e = do
81− let f' old change = do
82− mNew <- f old change
83− return $ unsafeJustChanged old =<< mNew
84− d <- accumMaybeM f' z e
85− return $ UniqDynamic d
86− mapAccumMaybeM f z e = do
87− let f' old change = do
88− (mNew, output) <- f old change
89− return (unsafeJustChanged old =<< mNew, output)
90− (d, out) <- mapAccumMaybeM f' z e
91− return (UniqDynamic d, out)
92−
93−instance Reflex t => Functor (UniqDynamic t) where
94− fmap f (UniqDynamic d) = uniqDynamic $ fmap f d
95−
96−instance Reflex t => Applicative (UniqDynamic t) where
97− pure = UniqDynamic . constDyn
98− UniqDynamic a <*> UniqDynamic b = uniqDynamic $ a <*> b
99− _ *> b = b
100− a <* _ = a
101−
102−instance Reflex t => Monad (UniqDynamic t) where
103− UniqDynamic x >>= f = uniqDynamic $ x >>= unUniqDynamic . f
104− _ >> b = b
105− return = pure
src/Reflex/DynamicWriter.hsdeleted−168
@@ -1,168 +0,0 @@
1−-- | This module defines 'MonadDynamicWriter' and 'DynamicWriterT', its standard
2−-- implementation.
3−{-# LANGUAGE CPP #-}
4−{-# LANGUAGE FlexibleInstances #-}
5−{-# LANGUAGE FunctionalDependencies #-}
6−{-# LANGUAGE GADTs #-}
7−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
8−{-# LANGUAGE LambdaCase #-}
9−{-# LANGUAGE MultiParamTypeClasses #-}
10−{-# LANGUAGE ScopedTypeVariables #-}
11−{-# LANGUAGE TypeFamilies #-}
12−{-# LANGUAGE UndecidableInstances #-}
13−#ifdef USE_REFLEX_OPTIMIZER
14−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
15−#endif
16−module Reflex.DynamicWriter
17− ( MonadDynamicWriter (..)
18− , DynamicWriterT (..)
19− , runDynamicWriterT
20− , withDynamicWriterT
21− ) where
22−
23−import Control.Monad.Exception
24−import Control.Monad.Identity
25−import Control.Monad.IO.Class
26−import Control.Monad.Reader
27−import Control.Monad.Ref
28−import Control.Monad.State.Strict
29−import Data.Dependent.Map (DMap, DSum (..))
30−import qualified Data.Dependent.Map as DMap
31−import Data.Functor.Misc
32−import Data.Map (Map)
33−import qualified Data.Map as Map
34−import Data.Semigroup
35−import Data.Some (Some)
36−import qualified Data.Some as Some
37−import Reflex.Class
38−import Reflex.Host.Class
39−import Reflex.PerformEvent.Class
40−import Reflex.PostBuild.Class
41−import Reflex.Requester.Class
42−import Reflex.TriggerEvent.Class
43−
44−instance MonadTrans (DynamicWriterT t w) where
45− lift = DynamicWriterT . lift
46−
47−mapIncrementalMapValuesWithKey :: (Reflex t, Ord k) => (k -> v -> v') -> Incremental t (PatchMap k v) -> Incremental t (PatchMap k v')
48−mapIncrementalMapValuesWithKey f = unsafeMapIncremental (Map.mapWithKey f) $ \(PatchMap m) -> PatchMap $ Map.mapWithKey (\k mv -> fmap (f k) mv) m
49−
50−mapIncrementalMapValues :: (Reflex t, Ord k) => (v -> v') -> Incremental t (PatchMap k v) -> Incremental t (PatchMap k v')
51−mapIncrementalMapValues f = mapIncrementalMapValuesWithKey $ const f
52−
53−unsafeMapIncremental :: (Reflex t, Patch p, Patch p') => (PatchTarget p -> PatchTarget p') -> (p -> p') -> Incremental t p -> Incremental t p'
54−unsafeMapIncremental f g a = unsafeBuildIncremental (fmap f $ sample $ currentIncremental a) $ g <$> updatedIncremental a
55−
56−incrementalExtractFunctorDMap :: (Reflex t, Ord k) => Incremental t (PatchMap k (f v)) -> Incremental t (PatchDMap (Const2 k v) f)
57−incrementalExtractFunctorDMap = unsafeMapIncremental mapWithFunctorToDMap $ \(PatchMap m) -> PatchDMap $ mapWithFunctorToDMap $ fmap ComposeMaybe m
58−
59−mergeIncrementalMap :: (Reflex t, Ord k) => Incremental t (PatchMap k (Event t v)) -> Event t (Map k v)
60−mergeIncrementalMap = fmap dmapToMap . mergeIncremental . incrementalExtractFunctorDMap
61−
62−mergeDynIncremental :: (Reflex t, Ord k) => Incremental t (PatchMap k (Dynamic t v)) -> Incremental t (PatchMap k v)
63−mergeDynIncremental a = unsafeBuildIncremental (mapM (sample . current) =<< sample (currentIncremental a)) $ addedAndRemovedValues <> changedValues
64− where changedValues = fmap (PatchMap . fmap Just) $ mergeIncrementalMap $ mapIncrementalMapValues updated a
65− addedAndRemovedValues = flip pushAlways (updatedIncremental a) $ \(PatchMap m) -> PatchMap <$> mapM (mapM (sample . current)) m
66−
67−-- | A basic implementation of 'MonadDynamicWriter'.
68−newtype DynamicWriterT t w m a = DynamicWriterT { unDynamicWriterT :: StateT [Dynamic t w] m a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadHold t, MonadSample t, MonadAsyncException, MonadException) -- The list is kept in reverse order
69−
70−instance MonadRef m => MonadRef (DynamicWriterT t w m) where
71− type Ref (DynamicWriterT t w m) = Ref m
72− newRef = lift . newRef
73− readRef = lift . readRef
74− writeRef r = lift . writeRef r
75−
76−instance MonadAtomicRef m => MonadAtomicRef (DynamicWriterT t w m) where
77− atomicModifyRef r = lift . atomicModifyRef r
78−
79−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (DynamicWriterT t w m) where
80− newEventWithTrigger = lift . newEventWithTrigger
81− newFanEventWithTrigger f = lift $ newFanEventWithTrigger f
82−
83−-- | Run a 'DynamicWriterT' action. The dynamic writer output will be provided
84−-- along with the result of the action.
85−runDynamicWriterT :: (MonadFix m, Reflex t, Monoid w) => DynamicWriterT t w m a -> m (a, Dynamic t w)
86−runDynamicWriterT (DynamicWriterT a) = do
87− (result, ws) <- runStateT a []
88− return (result, mconcat $ reverse ws)
89−
90−-- | 'MonadDynamicWriter' efficiently collects 'Dynamic' values using 'tellDyn'
91−-- and combines them monoidally to provide a 'Dynamic' result.
92−class (Monad m, Monoid w) => MonadDynamicWriter t w m | m -> t w where
93− tellDyn :: Dynamic t w -> m ()
94−
95−instance (Monad m, Monoid w, Reflex t) => MonadDynamicWriter t w (DynamicWriterT t w m) where
96− tellDyn w = DynamicWriterT $ modify (w :)
97−
98−instance MonadReader r m => MonadReader r (DynamicWriterT t w m) where
99− ask = lift ask
100− local f (DynamicWriterT a) = DynamicWriterT $ mapStateT (local f) a
101− reader = lift . reader
102−
103−instance PerformEvent t m => PerformEvent t (DynamicWriterT t w m) where
104− type Performable (DynamicWriterT t w m) = Performable m
105− performEvent_ = lift . performEvent_
106− performEvent = lift . performEvent
107−
108−instance TriggerEvent t m => TriggerEvent t (DynamicWriterT t w m) where
109− newTriggerEvent = lift newTriggerEvent
110− newTriggerEventWithOnComplete = lift newTriggerEventWithOnComplete
111− newEventWithLazyTriggerWithOnComplete = lift . newEventWithLazyTriggerWithOnComplete
112−
113−instance PostBuild t m => PostBuild t (DynamicWriterT t w m) where
114− getPostBuild = lift getPostBuild
115−
116−instance MonadDynamicWriter t w m => MonadDynamicWriter t w (ReaderT r m) where
117− tellDyn = lift . tellDyn
118−
119−instance MonadState s m => MonadState s (DynamicWriterT t w m) where
120− get = lift get
121− put = lift . put
122−
123−newtype DynamicWriterTLoweredResult t w v = DynamicWriterTLoweredResult (v, Dynamic t w)
124−
125−-- | When the execution of a 'DynamicWriterT' action is adjusted using
126−-- 'MonadAdjust', the 'Dynamic' output of that action will also be updated to
127−-- match.
128−instance (MonadAdjust t m, MonadFix m, Monoid w, MonadHold t m, Reflex t) => MonadAdjust t (DynamicWriterT t w m) where
129− runWithReplace a0 a' = do
130− (result0, result') <- lift $ runWithReplace (runDynamicWriterT a0) $ runDynamicWriterT <$> a'
131− tellDyn . join =<< holdDyn (snd result0) (snd <$> result')
132− return (fst result0, fst <$> result')
133− sequenceDMapWithAdjust (dm0 :: DMap k (DynamicWriterT t w m)) dm' = do
134− let loweredDm0 = mapKeyValuePairsMonotonic (\(k :=> v) -> WrapArg k :=> fmap DynamicWriterTLoweredResult (runDynamicWriterT v)) dm0
135− let loweredDm' = ffor dm' $ \(PatchDMap p) -> PatchDMap $
136− mapKeyValuePairsMonotonic (\(k :=> ComposeMaybe mv) -> WrapArg k :=> ComposeMaybe (fmap (fmap DynamicWriterTLoweredResult . runDynamicWriterT) mv)) p
137− (result0, result') <- lift $ sequenceDMapWithAdjust loweredDm0 loweredDm'
138− let getValue (DynamicWriterTLoweredResult (v, _)) = v
139− getWritten (DynamicWriterTLoweredResult (_, w)) = w
140− liftedResult0 = mapKeyValuePairsMonotonic (\(WrapArg k :=> Identity r) -> k :=> Identity (getValue r)) result0
141− liftedResult' = ffor result' $ \(PatchDMap p) -> PatchDMap $
142− mapKeyValuePairsMonotonic (\(WrapArg k :=> ComposeMaybe mr) -> k :=> ComposeMaybe (fmap (Identity . getValue . runIdentity) mr)) p
143− liftedWritten0 :: Map (Some k) (Dynamic t w)
144− liftedWritten0 = Map.fromDistinctAscList $ (\(WrapArg k :=> Identity r) -> (Some.This k, getWritten r)) <$> DMap.toList result0
145− liftedWritten' = ffor result' $ \(PatchDMap p) -> PatchMap $
146− Map.fromDistinctAscList $ (\(WrapArg k :=> ComposeMaybe mr) -> (Some.This k, fmap (getWritten . runIdentity) mr)) <$> DMap.toList p
147− --TODO: We should be able to improve the performance here by incrementally updating the mconcat of the merged Dynamics
148− i <- holdIncremental liftedWritten0 liftedWritten'
149− tellDyn $ fmap (mconcat . Map.elems) $ incrementalToDynamic $ mergeDynIncremental i
150− return (liftedResult0, liftedResult')
151−
152−-- | Map a function over the output of a 'DynamicWriterT'.
153−withDynamicWriterT :: (Monoid w, Monoid w', Reflex t, MonadHold t m, MonadFix m)
154− => (w -> w')
155− -> DynamicWriterT t w m a
156− -> DynamicWriterT t w' m a
157−withDynamicWriterT f dw = do
158− (r, d) <- lift $ do
159− (r, d) <- runDynamicWriterT dw
160− let d' = fmap f d
161− return (r, d')
162− tellDyn d
163− return r
164−
165−instance Requester t m => Requester t (DynamicWriterT t w m) where
166− type Request (DynamicWriterT t w m) = Request m
167− type Response (DynamicWriterT t w m) = Response m
168− withRequesting f = DynamicWriterT $ withRequesting $ unDynamicWriterT . f
src/Reflex/EventWriter.hsdeleted−179
@@ -1,179 +0,0 @@
1−-- | This module provides 'EventWriterT', the standard implementation of
2−-- 'EventWriter'.
3−{-# LANGUAGE CPP #-}
4−{-# LANGUAGE ExistentialQuantification #-}
5−{-# LANGUAGE FlexibleInstances #-}
6−{-# LANGUAGE FunctionalDependencies #-}
7−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
8−{-# LANGUAGE KindSignatures #-}
9−{-# LANGUAGE MultiParamTypeClasses #-}
10−{-# LANGUAGE Rank2Types #-}
11−{-# LANGUAGE ScopedTypeVariables #-}
12−{-# LANGUAGE TypeFamilies #-}
13−{-# LANGUAGE UndecidableInstances #-}
14−#ifdef USE_REFLEX_OPTIMIZER
15−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
16−#endif
17−module Reflex.EventWriter
18− ( EventWriterT (..)
19− , runEventWriterT
20− , EventWriter(..)
21− , runWithReplaceEventWriterTWith
22− , sequenceDMapWithAdjustEventWriterTWith
23− ) where
24−
25−import Reflex.Class
26−import Reflex.Host.Class
27−import Reflex.PerformEvent.Class
28−import Reflex.PostBuild.Class
29−import Reflex.Requester.Class
30−import Reflex.TriggerEvent.Class
31−
32−import Control.Monad.Exception
33−import Control.Monad.Identity
34−import Control.Monad.Reader
35−import Control.Monad.Ref
36−import Control.Monad.State.Strict
37−import Data.Dependent.Map (DMap, DSum (..))
38−import qualified Data.Dependent.Map as DMap
39−import Data.Foldable
40−import Data.Functor.Misc
41−import qualified Data.List.NonEmpty as NonEmpty
42−import Data.Maybe
43−import Data.Semigroup
44−import Data.Sequence
45−import Data.Some (Some)
46−import qualified Data.Some as Some
47−import Data.Tuple
48−import Data.Unique.Tag
49−
50−-- | 'EventWriter' efficiently collects 'Event' values using 'tellEvent'
51−-- and combines them monoidally to provide an 'Event' result.
52−class (Monad m, Monoid w) => EventWriter t w m | m -> t w where
53− tellEvent :: Event t w -> m ()
54−
55−-- | A basic implementation of 'EventWriter'.
56−newtype EventWriterT t w m a = EventWriterT { unEventWriterT :: StateT (Seq (Event t w)) m a }
57− deriving (Functor, Applicative, Monad, MonadFix, MonadIO, MonadException, MonadAsyncException)
58−
59−-- | Run a 'EventWriterT' action.
60−runEventWriterT :: (Reflex t, Monad m, Semigroup w) => EventWriterT t w m a -> m (a, Event t w)
61−runEventWriterT (EventWriterT a) = do
62− (result, requests) <- runStateT a mempty
63− return (result, mconcat $ toList requests)
64−
65−instance (Reflex t, Monad m, Monoid w) => EventWriter t w (EventWriterT t w m) where
66− tellEvent w = EventWriterT $ modify (|> w)
67−
68−instance MonadTrans (EventWriterT t w) where
69− lift = EventWriterT . lift
70−
71−instance MonadSample t m => MonadSample t (EventWriterT t w m) where
72− sample = lift . sample
73−
74−instance MonadHold t m => MonadHold t (EventWriterT t w m) where
75− hold v0 = lift . hold v0
76− holdDyn v0 = lift . holdDyn v0
77− holdIncremental v0 = lift . holdIncremental v0
78−
79−instance (Reflex t, MonadAdjust t m, MonadHold t m, Monoid w, Semigroup w) => MonadAdjust t (EventWriterT t w m) where
80− runWithReplace = runWithReplaceEventWriterTWith $ \dm0 dm' -> lift $ runWithReplace dm0 dm'
81− sequenceDMapWithAdjust = sequenceDMapWithAdjustEventWriterTWith $ \dm0 dm' -> lift $ sequenceDMapWithAdjust dm0 dm'
82−
83−instance Requester t m => Requester t (EventWriterT t w m) where
84− type Request (EventWriterT t w m) = Request m
85− type Response (EventWriterT t w m) = Response m
86− withRequesting f = EventWriterT $ withRequesting $ unEventWriterT . f
87−
88−
89−-- | Given a function like 'runWithReplace' for the underlying monad, implement
90−-- 'runWithReplace' for 'EventWriterT'. This is necessary when the underlying
91−-- monad doesn't have a 'MonadAdjust' instance or to override the default
92−-- 'MonadAdjust' behavior.
93−runWithReplaceEventWriterTWith :: forall m t w a b. (Reflex t, MonadHold t m, Monoid w)
94− => (forall a' b'. m a' -> Event t (m b') -> EventWriterT t w m (a', Event t b'))
95− -> EventWriterT t w m a
96− -> Event t (EventWriterT t w m b)
97− -> EventWriterT t w m (a, Event t b)
98−runWithReplaceEventWriterTWith f a0 a' = do
99− let g :: EventWriterT t w m c -> m (c, Seq (Event t w))
100− g (EventWriterT r) = runStateT r mempty
101− (result0, result') <- f (g a0) $ fmap g a'
102− request <- holdDyn (fmapCheap (mconcat . NonEmpty.toList) $ mergeList $ toList $ snd result0) $ fmapCheap (fmapCheap (mconcat . NonEmpty.toList) . mergeList . toList . snd) result'
103− -- We add these two separately to take advantage of the free merge being done later. The coincidence case must come first so that it has precedence if both fire simultaneously. (Really, we should probably block the 'switch' whenever 'updated' fires, but switchPromptlyDyn has the same issue.)
104− EventWriterT $ modify $ flip (|>) $ coincidence $ updated request
105− EventWriterT $ modify $ flip (|>) $ switch $ current request
106− return (fst result0, fmapCheap fst result')
107−
108−-- | Like 'runWithReplaceEventWriterTWith', but for 'sequenceDMapWithAdjust'.
109−sequenceDMapWithAdjustEventWriterTWith :: (GCompare k, Reflex t, MonadHold t m, Monoid w, Semigroup w)
110− => (forall k'. GCompare k'
111− => DMap k' m
112− -> Event t (PatchDMap k' m)
113− -> EventWriterT t w m (DMap k' Identity, Event t (PatchDMap k' Identity))
114− )
115− -> DMap k (EventWriterT t w m)
116− -> Event t (PatchDMap k (EventWriterT t w m))
117− -> EventWriterT t w m (DMap k Identity, Event t (PatchDMap k Identity))
118−sequenceDMapWithAdjustEventWriterTWith f (dm0 :: DMap k (EventWriterT t w m)) dm' = do
119− let inputTransform :: forall a. DMapTransform a k (WrapArg ((,) (Seq (Event t w))) k) (EventWriterT t w m) m
120− inputTransform = DMapTransform WrapArg (\(EventWriterT v) -> swap <$> runStateT v mempty)
121− (children0, children') <- f (mapKeysAndValuesMonotonic inputTransform dm0) $ mapPatchKeysAndValuesMonotonic inputTransform <$> dm'
122− let result0 = mapKeyValuePairsMonotonic (\(WrapArg k :=> Identity (_, v)) -> k :=> Identity v) children0
123− result' = fforCheap children' $ \(PatchDMap p) -> PatchDMap $
124− mapKeyValuePairsMonotonic (\(WrapArg k :=> ComposeMaybe mv) -> k :=> ComposeMaybe (fmap (Identity . snd . runIdentity) mv)) p
125− requests0 :: DMap (Const2 (Some k) w) (Event t)
126− requests0 = mapKeyValuePairsMonotonic (\(WrapArg k :=> Identity (r, _)) -> Const2 (Some.This k) :=> mconcat (toList r)) children0
127− requests' :: Event t (PatchDMap (Const2 (Some k) w) (Event t))
128− requests' = fforCheap children' $ \(PatchDMap p) -> PatchDMap $
129− mapKeyValuePairsMonotonic (\(WrapArg k :=> ComposeMaybe mv) -> Const2 (Some.This k) :=> ComposeMaybe (fmap (mconcat . toList . fst . runIdentity) mv)) p
130− childRequestMap <- holdIncremental requests0 requests'
131− -- We add these two separately to take advantage of the free merge being done later. The coincidence case must come first so that it has precedence if both fire simultaneously. (Really, we should probably block the 'switch' whenever 'updated' fires, but switchPromptlyDyn has the same issue.)
132− EventWriterT $ modify $ flip (|>) $ coincidence $ fforCheap requests' $ \(PatchDMap p) -> mconcat $ toList $ catMaybes $ ffor (DMap.toList p) $ \(Const2 _ :=> ComposeMaybe me) -> me
133− EventWriterT $ modify $ flip (|>) $ ffor (mergeIncremental childRequestMap) $ \m ->
134− mconcat $ (\(Const2 _ :=> Identity reqs) -> reqs) <$> DMap.toList m
135− return (result0, result')
136−
137−instance PerformEvent t m => PerformEvent t (EventWriterT t w m) where
138− type Performable (EventWriterT t w m) = Performable m
139− performEvent_ = lift . performEvent_
140− performEvent = lift . performEvent
141−
142−instance PostBuild t m => PostBuild t (EventWriterT t w m) where
143− getPostBuild = lift getPostBuild
144−
145−instance TriggerEvent t m => TriggerEvent t (EventWriterT t w m) where
146− newTriggerEvent = lift newTriggerEvent
147− newTriggerEventWithOnComplete = lift newTriggerEventWithOnComplete
148− newEventWithLazyTriggerWithOnComplete = lift . newEventWithLazyTriggerWithOnComplete
149−
150−instance MonadReader r m => MonadReader r (EventWriterT t w m) where
151− ask = lift ask
152− local f (EventWriterT a) = EventWriterT $ mapStateT (local f) a
153− reader = lift . reader
154−
155−instance MonadRef m => MonadRef (EventWriterT t w m) where
156− type Ref (EventWriterT t w m) = Ref m
157− newRef = lift . newRef
158− readRef = lift . readRef
159− writeRef r = lift . writeRef r
160−
161−instance MonadAtomicRef m => MonadAtomicRef (EventWriterT t w m) where
162− atomicModifyRef r = lift . atomicModifyRef r
163−
164−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (EventWriterT t w m) where
165− newEventWithTrigger = lift . newEventWithTrigger
166− newFanEventWithTrigger f = lift $ newFanEventWithTrigger f
167−
168−--------------------------------------------------------------------------------
169−-- Internal functions
170−--------------------------------------------------------------------------------
171−
172−data DMapTransform (a :: *) k k' v v' = forall (b :: *). DMapTransform !(k a -> k' b) !(v a -> v' b)
173−
174−mapPatchKeysAndValuesMonotonic :: (forall a. DMapTransform a k k' v v') -> PatchDMap k v -> PatchDMap k' v'
175−mapPatchKeysAndValuesMonotonic x (PatchDMap p) = PatchDMap $ mapKeyValuePairsMonotonic (\(k :=> ComposeMaybe mv) -> case x of DMapTransform f g -> f k :=> ComposeMaybe (fmap g mv)) p
176−
177−mapKeysAndValuesMonotonic :: (forall a. DMapTransform a k k' v v') -> DMap k v -> DMap k' v'
178−mapKeysAndValuesMonotonic x = mapKeyValuePairsMonotonic $ \(k :=> v) -> case x of
179− DMapTransform f g -> f k :=> g v
src/Reflex/FunctorMaybe.hsdeleted−29
@@ -1,29 +0,0 @@
1−-- | This module defines the FunctorMaybe class, which extends Functors with the
2−-- ability to delete values.
3−module Reflex.FunctorMaybe
4− ( FunctorMaybe (..)
5− ) where
6−
7−import Data.Maybe
8−
9−--TODO: See if there's a better class in the standard libraries already
10−
11−-- | A class for values that combines filtering and mapping using 'Maybe'.
12−-- Morally, @'FunctorMaybe' ~ KleisliFunctor 'Maybe'@. Also similar is the
13−-- @Witherable@ typeclass, but it requires @Foldable f@ and @Traverable f@,
14−-- and e.g. 'Event' is instance of neither.
15−--
16−-- A definition of 'fmapMaybe' must satisfy the following laws:
17−--
18−-- [/identity/]
19−-- @'fmapMaybe' 'Just' ≡ 'id'@
20−--
21−-- [/composition/]
22−-- @'fmapMaybe' (f <=< g) ≡ 'fmapMaybe' f . 'fmapMaybe' g@
23−class FunctorMaybe f where
24− -- | Combined mapping and filtering function.
25− fmapMaybe :: (a -> Maybe b) -> f a -> f b
26−
27−-- | @fmapMaybe f = catMaybes . fmap f@
28−instance FunctorMaybe [] where
29− fmapMaybe f = catMaybes . fmap f
src/Reflex/Host/Class.hsdeleted−299
@@ -1,299 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−{-# LANGUAGE ExistentialQuantification #-}
3−{-# LANGUAGE FlexibleContexts #-}
4−{-# LANGUAGE FlexibleInstances #-}
5−{-# LANGUAGE FunctionalDependencies #-}
6−{-# LANGUAGE GADTs #-}
7−{-# LANGUAGE MultiParamTypeClasses #-}
8−{-# LANGUAGE RankNTypes #-}
9−{-# LANGUAGE RoleAnnotations #-}
10−{-# LANGUAGE ScopedTypeVariables #-}
11−{-# LANGUAGE TypeFamilies #-}
12−{-# LANGUAGE UndecidableInstances #-}
13−#ifdef USE_REFLEX_OPTIMIZER
14−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
15−#endif
16−-- | This module provides the interface for hosting 'Reflex' engines. This
17−-- should only be necessary if you're writing a binding or some other library
18−-- that provides a core event loop.
19−module Reflex.Host.Class
20− ( ReflexHost (..)
21− , MonadSubscribeEvent (..)
22− , MonadReadEvent (..)
23− , MonadReflexCreateTrigger (..)
24− , MonadReflexHost (..)
25− , fireEvents
26− , newEventWithTriggerRef
27− , fireEventRef
28− , fireEventRefAndRead
29− ) where
30−
31−import Reflex.Class
32−
33−import Control.Applicative
34−import Control.Monad
35−import Control.Monad.Fix
36−import Control.Monad.Identity
37−import Control.Monad.Ref
38−import Control.Monad.Trans
39−import Control.Monad.Trans.Cont (ContT ())
40−import Control.Monad.Trans.Except (ExceptT ())
41−import Control.Monad.Trans.Reader (ReaderT ())
42−import Control.Monad.Trans.RWS (RWST ())
43−import Control.Monad.Trans.State (StateT ())
44−import qualified Control.Monad.Trans.State.Strict as Strict
45−import Control.Monad.Trans.Writer (WriterT ())
46−import Data.Dependent.Sum (DSum (..))
47−import Data.GADT.Compare
48−import Data.Monoid
49−
50−#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
51−import Control.Monad.Primitive (touch)
52−import Data.IORef
53−import Reflex.Spider.Internal (EventM (..), HasSpiderTimeline, RootTrigger, SpiderEventHandle (..),
54− SpiderHost (..), SpiderHostFrame (..), Subscriber (..), newEventWithTriggerIO,
55− newFanEventWithTriggerIO, run, runFrame, scheduleClear, subscribe)
56−import qualified Reflex.Spider.Internal
57−#endif
58−
59−-- Note: this import must come last to silence warnings from AMP
60−import Prelude hiding (foldl, mapM, mapM_, sequence, sequence_)
61−
62−#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
63−#include "../Spider/SpiderTimelineHost.include.hs"
64−#endif
65−
66−-- | Framework implementation support class for the reflex implementation
67−-- represented by @t@.
68−class ( Reflex t
69− , MonadReflexCreateTrigger t (HostFrame t)
70− , MonadSample t (HostFrame t)
71− , MonadHold t (HostFrame t)
72− , MonadFix (HostFrame t)
73− , MonadSubscribeEvent t (HostFrame t)
74− ) => ReflexHost t where
75− type EventTrigger t :: * -> *
76− type EventHandle t :: * -> *
77− type HostFrame t :: * -> *
78−
79−-- | Monad in which Events can be 'subscribed'. This forces all underlying
80−-- event sources to be initialized, so that the event will fire whenever it
81−-- ought to. Events must be subscribed before they are read using readEvent
82−class (Reflex t, Monad m) => MonadSubscribeEvent t m | m -> t where
83− -- | Subscribe to an event and set it up if needed.
84− --
85− -- This function will create a new 'EventHandle' from an 'Event'. This handle
86− -- may then be used via 'readEvent' in the read callback of
87− -- 'fireEventsAndRead'.
88− --
89− -- If the event wasn't subscribed to before (either manually or through a
90− -- dependent event or behavior) then this function will cause the event and
91− -- all dependencies of this event to be set up. For example, if the event was
92− -- created by 'newEventWithTrigger', then it's callback will be executed.
93− --
94− -- It's safe to call this function multiple times.
95− subscribeEvent :: Event t a -> m (EventHandle t a)
96−
97−-- | Monad that allows to read events' values.
98−class (ReflexHost t, Applicative m, Monad m) => MonadReadEvent t m | m -> t where
99− -- | Read the value of an 'Event' from an 'EventHandle' (created by calling
100− -- 'subscribeEvent').
101− --
102− -- After event propagation is done, all events can be in two states: either
103− -- they are firing with some value or they are not firing. In the former
104− -- case, this function returns @Just act@, where @act@ in an action to read
105− -- the current value of the event. In the latter case, the function returns
106− -- @Nothing@.
107− --
108− -- This function is normally used in the calllback for 'fireEventsAndRead'.
109− readEvent :: EventHandle t a -> m (Maybe (m a))
110−
111−-- | A monad where new events feed from external sources can be created.
112−class (Applicative m, Monad m) => MonadReflexCreateTrigger t m | m -> t where
113− -- | Creates a root 'Event' (one that is not based on any other event).
114− --
115− -- When a subscriber first subscribes to an event (building another event that
116− -- depends on the subscription) the given callback function is run and passed
117− -- a trigger. The callback function can then set up the event source in IO.
118− -- After this is done, the callback function must return an accompanying
119− -- teardown action.
120− --
121− -- Any time between setup and teardown the trigger can be used to fire the
122− -- event, by passing it to 'fireEventsAndRead'.
123− --
124− -- Note: An event may be set up multiple times. So after the teardown action
125− -- is executed, the event may still be set up again in the future.
126− newEventWithTrigger :: (EventTrigger t a -> IO (IO ())) -> m (Event t a)
127− newFanEventWithTrigger :: GCompare k => (forall a. k a -> EventTrigger t a -> IO (IO ())) -> m (EventSelector t k)
128−
129−-- | 'MonadReflexHost' designates monads that can run reflex frames.
130−class ( ReflexHost t
131− , MonadReflexCreateTrigger t m
132− , MonadSubscribeEvent t m
133− , MonadReadEvent t (ReadPhase m)
134− , MonadSample t (ReadPhase m)
135− , MonadHold t (ReadPhase m)
136− ) => MonadReflexHost t m | m -> t where
137− type ReadPhase m :: * -> *
138− -- | Propagate some events firings and read the values of events afterwards.
139− --
140− -- This function will create a new frame to fire the given events. It will
141− -- then update all dependent events and behaviors. After that is done, the
142− -- given callback is executed which allows to read the final values of events
143− -- and check whether they have fired in this frame or not.
144− --
145− -- All events that are given are fired at the same time.
146− --
147− -- This function is typically used in the main loop of a reflex framework
148− -- implementation. The main loop waits for external events to happen (such as
149− -- keyboard input or a mouse click) and then fires the corresponding events
150− -- using this function. The read callback can be used to read output events
151− -- and perform a corresponding response action to the external event.
152− fireEventsAndRead :: [DSum (EventTrigger t) Identity] -> ReadPhase m a -> m a
153−
154− -- | Run a frame without any events firing.
155− --
156− -- This function should be used when you want to use 'sample' and 'hold' when
157− -- no events are currently firing. Using this function in that case can
158− -- improve performance, since the implementation can assume that no events are
159− -- firing when 'sample' or 'hold' are called.
160− --
161− -- This function is commonly used to set up the basic event network when the
162− -- application starts up.
163− runHostFrame :: HostFrame t a -> m a
164−
165−-- | Like 'fireEventsAndRead', but without reading any events.
166−fireEvents :: MonadReflexHost t m => [DSum (EventTrigger t) Identity] -> m ()
167−fireEvents dm = fireEventsAndRead dm $ return ()
168−{-# INLINE fireEvents #-}
169−
170−-- | Create a new event and store its trigger in an 'IORef' while it's active.
171−--
172−-- An event is only active between the set up (when it's first subscribed to)
173−-- and the teardown phases (when noboby is subscribing the event anymore). This
174−-- function returns an Event and an 'IORef'. As long as the event is active, the
175−-- 'IORef' will contain 'Just' the event trigger to trigger this event. When the
176−-- event is not active, the 'IORef' will contain 'Nothing'. This allows event
177−-- sources to be more efficient, since they don't need to produce events when
178−-- nobody is listening.
179−newEventWithTriggerRef :: (MonadReflexCreateTrigger t m, MonadRef m, Ref m ~ Ref IO) => m (Event t a, Ref m (Maybe (EventTrigger t a)))
180−newEventWithTriggerRef = do
181− rt <- newRef Nothing
182− e <- newEventWithTrigger $ \t -> do
183− writeRef rt $ Just t
184− return $ writeRef rt Nothing
185− return (e, rt)
186−{-# INLINE newEventWithTriggerRef #-}
187−
188−-- | Fire the given trigger if it is not 'Nothing'.
189−fireEventRef :: (MonadReflexHost t m, MonadRef m, Ref m ~ Ref IO) => Ref m (Maybe (EventTrigger t a)) -> a -> m ()
190−fireEventRef mtRef input = do
191− mt <- readRef mtRef
192− case mt of
193− Nothing -> return ()
194− Just trigger -> fireEvents [trigger :=> Identity input]
195−
196−-- | Fire the given trigger if it is not 'Nothing', and read from the given
197−-- 'EventHandle'.
198−fireEventRefAndRead :: (MonadReflexHost t m, MonadRef m, Ref m ~ Ref IO) => Ref m (Maybe (EventTrigger t a)) -> a -> EventHandle t b -> m (Maybe b)
199−fireEventRefAndRead mtRef input e = do
200− mt <- readRef mtRef
201− case mt of
202− Nothing -> return Nothing -- Since we aren't firing the input, the output can't fire
203− Just trigger -> fireEventsAndRead [trigger :=> Identity input] $ do
204− mGetValue <- readEvent e
205− case mGetValue of
206− Nothing -> return Nothing
207− Just getValue -> fmap Just getValue
208−
209−
210−--------------------------------------------------------------------------------
211−-- Instances
212−--------------------------------------------------------------------------------
213−
214−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (ReaderT r m) where
215− newEventWithTrigger = lift . newEventWithTrigger
216− newFanEventWithTrigger initializer = lift $ newFanEventWithTrigger initializer
217−
218−instance MonadSubscribeEvent t m => MonadSubscribeEvent t (ReaderT r m) where
219− subscribeEvent = lift . subscribeEvent
220−
221−instance MonadReflexHost t m => MonadReflexHost t (ReaderT r m) where
222− type ReadPhase (ReaderT r m) = ReadPhase m
223− fireEventsAndRead dm a = lift $ fireEventsAndRead dm a
224− runHostFrame = lift . runHostFrame
225−
226−instance (MonadReflexCreateTrigger t m, Monoid w) => MonadReflexCreateTrigger t (WriterT w m) where
227− newEventWithTrigger = lift . newEventWithTrigger
228− newFanEventWithTrigger initializer = lift $ newFanEventWithTrigger initializer
229−
230−instance (MonadSubscribeEvent t m, Monoid w) => MonadSubscribeEvent t (WriterT w m) where
231− subscribeEvent = lift . subscribeEvent
232−
233−instance (MonadReflexHost t m, Monoid w) => MonadReflexHost t (WriterT w m) where
234− type ReadPhase (WriterT w m) = ReadPhase m
235− fireEventsAndRead dm a = lift $ fireEventsAndRead dm a
236− runHostFrame = lift . runHostFrame
237−
238−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (StateT s m) where
239− newEventWithTrigger = lift . newEventWithTrigger
240− newFanEventWithTrigger initializer = lift $ newFanEventWithTrigger initializer
241−
242−instance MonadSubscribeEvent t m => MonadSubscribeEvent t (StateT r m) where
243− subscribeEvent = lift . subscribeEvent
244−
245−instance MonadReflexHost t m => MonadReflexHost t (StateT s m) where
246− type ReadPhase (StateT s m) = ReadPhase m
247− fireEventsAndRead dm a = lift $ fireEventsAndRead dm a
248− runHostFrame = lift . runHostFrame
249−
250−
251−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (Strict.StateT s m) where
252− newEventWithTrigger = lift . newEventWithTrigger
253− newFanEventWithTrigger initializer = lift $ newFanEventWithTrigger initializer
254−
255−instance MonadSubscribeEvent t m => MonadSubscribeEvent t (Strict.StateT r m) where
256− subscribeEvent = lift . subscribeEvent
257−
258−instance MonadReflexHost t m => MonadReflexHost t (Strict.StateT s m) where
259− type ReadPhase (Strict.StateT s m) = ReadPhase m
260− fireEventsAndRead dm a = lift $ fireEventsAndRead dm a
261− runHostFrame = lift . runHostFrame
262−
263−
264−
265−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (ContT r m) where
266− newEventWithTrigger = lift . newEventWithTrigger
267− newFanEventWithTrigger initializer = lift $ newFanEventWithTrigger initializer
268−
269−instance MonadSubscribeEvent t m => MonadSubscribeEvent t (ContT r m) where
270− subscribeEvent = lift . subscribeEvent
271−
272−instance MonadReflexHost t m => MonadReflexHost t (ContT r m) where
273− type ReadPhase (ContT r m) = ReadPhase m
274− fireEventsAndRead dm a = lift $ fireEventsAndRead dm a
275− runHostFrame = lift . runHostFrame
276−
277−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (ExceptT e m) where
278− newEventWithTrigger = lift . newEventWithTrigger
279− newFanEventWithTrigger initializer = lift $ newFanEventWithTrigger initializer
280−
281−instance MonadSubscribeEvent t m => MonadSubscribeEvent t (ExceptT r m) where
282− subscribeEvent = lift . subscribeEvent
283−
284−instance MonadReflexHost t m => MonadReflexHost t (ExceptT e m) where
285− type ReadPhase (ExceptT e m) = ReadPhase m
286− fireEventsAndRead dm a = lift $ fireEventsAndRead dm a
287− runHostFrame = lift . runHostFrame
288−
289−instance (MonadReflexCreateTrigger t m, Monoid w) => MonadReflexCreateTrigger t (RWST r w s m) where
290− newEventWithTrigger = lift . newEventWithTrigger
291− newFanEventWithTrigger initializer = lift $ newFanEventWithTrigger initializer
292−
293−instance (MonadSubscribeEvent t m, Monoid w) => MonadSubscribeEvent t (RWST r w s m) where
294− subscribeEvent = lift . subscribeEvent
295−
296−instance (MonadReflexHost t m, Monoid w) => MonadReflexHost t (RWST r w s m) where
297− type ReadPhase (RWST r w s m) = ReadPhase m
298− fireEventsAndRead dm a = lift $ fireEventsAndRead dm a
299− runHostFrame = lift . runHostFrame
src/Reflex/Optimizer.hsdeleted−51
@@ -1,51 +0,0 @@
1−-- | This module provides a GHC plugin designed to improve code that uses
2−-- Reflex. Currently, it just adds an INLINABLE pragma to any top-level
3−-- definition that doesn't have an explicit inlining pragma. In the future,
4−-- additional optimizations are likely to be added.
5−{-# LANGUAGE CPP #-}
6−{-# LANGUAGE LambdaCase #-}
7−{-# LANGUAGE OverloadedStrings #-}
8−module Reflex.Optimizer
9− ( plugin
10− ) where
11−
12−#ifdef ghcjs_HOST_OS
13−import Plugins
14−#else
15−import Control.Arrow
16−import CoreMonad
17−import Data.String
18−import GhcPlugins
19−#endif
20−
21−#ifdef ghcjs_HOST_OS
22−
23−-- | The GHCJS build of Reflex.Optimizer just throws an error; instead, the version built with GHC should be used.
24−plugin :: Plugin
25−plugin = error "The GHCJS build of Reflex.Optimizer cannot be used. Instead, build with GHC and use the result with GHCJS."
26−
27−#else
28−
29−-- | The GHC plugin itself. See "GhcPlugins" for more details.
30−plugin :: Plugin
31−plugin = defaultPlugin { installCoreToDos = install }
32−
33−install :: [CommandLineOption] -> [CoreToDo] -> CoreM [CoreToDo]
34−install [] p = return $ makeInlinable : p
35−install options@(_:_) p = do
36− warnMsg $ "Reflex.Optimizer: ignoring " <> fromString (show $ length options) <> " command-line options"
37− install [] p
38−
39−makeInlinable :: CoreToDo
40−makeInlinable = CoreDoPluginPass "MakeInlinable" $ \modGuts -> do
41− let f v = setIdInfo v $ let i = idInfo v in
42− setInlinePragInfo i $ let p = inlinePragInfo i in
43− if isDefaultInlinePragma p
44− then defaultInlinePragma { inl_inline = Inlinable }
45− else p
46− newBinds = flip map (mg_binds modGuts) $ \case
47− NonRec b e -> NonRec (f b) e
48− Rec bes -> Rec $ map (first f) bes
49− return $ modGuts { mg_binds = newBinds }
50−
51−#endif
src/Reflex/Patch.hsdeleted−103
@@ -1,103 +0,0 @@
1−-- | This module defines the 'Patch' class, which is used by Reflex to manage
2−-- changes to 'Reflex.Class.Incremental' values.
3−{-# LANGUAGE CPP #-}
4−{-# LANGUAGE DeriveFunctor #-}
5−{-# LANGUAGE LambdaCase #-}
6−{-# LANGUAGE StandaloneDeriving #-}
7−{-# LANGUAGE TypeFamilies #-}
8−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
9−module Reflex.Patch
10− ( Patch (..)
11− , PatchDMap (..)
12− , ComposeMaybe (..)
13− , PatchMap (..)
14− , Group (..), Additive
15− , AdditivePatch (..)
16− ) where
17−
18−import Control.Monad.Identity
19−import Data.Dependent.Map (DMap, GCompare (..))
20−import qualified Data.Dependent.Map as DMap
21−import Data.Functor.Constant
22−import Data.Map (Map)
23−import qualified Data.Map as Map
24−import Data.Semigroup (Semigroup (..), stimesIdempotentMonoid, (<>))
25−
26−-- | A 'Patch' type represents a kind of change made to a datastructure.
27−class Patch p where
28− type PatchTarget p :: *
29− -- | Apply the patch @p a@ to the value @a@. If no change is needed, return
30− -- 'Nothing'.
31− apply :: p -> PatchTarget p -> Maybe (PatchTarget p)
32−
33−-- | We can't use @Compose Maybe@ instead of 'ComposeMaybe', because that would
34−-- make the 'f' parameter have a nominal type role. We need f to be
35−-- representational so that we can use safe 'coerce'.
36−newtype ComposeMaybe f a = ComposeMaybe { getComposeMaybe :: Maybe (f a) }
37−
38−deriving instance Functor f => Functor (ComposeMaybe f)
39−
40−instance Patch (Identity a) where
41− type PatchTarget (Identity a) = a
42− apply (Identity a) _ = Just a
43−
44−-- | A set of changes to a 'DMap'. Any element may be inserted/updated or
45−-- deleted.
46−newtype PatchDMap k v = PatchDMap (DMap k (ComposeMaybe v))
47−
48−deriving instance GCompare k => Semigroup (PatchDMap k v)
49−
50−deriving instance GCompare k => Monoid (PatchDMap k v)
51−
52−instance GCompare k => Patch (PatchDMap k v) where
53− type PatchTarget (PatchDMap k v) = DMap k v
54− 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?
55− where insertions = DMap.mapMaybeWithKey (const $ getComposeMaybe) diff
56− deletions = DMap.mapMaybeWithKey (const $ nothingToJust . getComposeMaybe) diff
57− nothingToJust = \case
58− Nothing -> Just $ Constant ()
59− Just _ -> Nothing
60−
61−-- | A set of changes to a 'Map'. Any element may be inserted/updated or
62−-- deleted.
63−newtype PatchMap k v = PatchMap (Map k (Maybe v))
64−
65−instance Ord k => Patch (PatchMap k v) where
66− type PatchTarget (PatchMap k v) = Map k v
67− 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?
68− where insertions = Map.mapMaybeWithKey (const id) p
69− deletions = Map.mapMaybeWithKey (const nothingToJust) p
70− nothingToJust = \case
71− Nothing -> Just ()
72− Just _ -> Nothing
73−
74−instance Ord k => Semigroup (PatchMap k v) where
75− PatchMap a <> PatchMap b = PatchMap $ a `mappend` b --TODO: Add a semigroup instance for Map
76− -- PatchMap is idempotent, so stimes n is id for every n
77−#if MIN_VERSION_semigroups(0,17,0)
78− stimes = stimesIdempotentMonoid
79−#else
80− times1p n x = case compare n 0 of
81− LT -> error "stimesIdempotentMonoid: negative multiplier"
82− EQ -> mempty
83− GT -> x
84−#endif
85−
86−instance Ord k => Monoid (PatchMap k v) where
87− mempty = PatchMap mempty
88− mappend = (<>)
89−
90−-- Patches based on commutative groups
91−
92−class (Semigroup q, Monoid q) => Group q where
93− negateG :: q -> q
94− (~~) :: q -> q -> q
95− r ~~ s = r <> negateG s
96−
97−class Semigroup q => Additive q where
98−
99−newtype AdditivePatch p = AdditivePatch { unAdditivePatch :: p }
100−
101−instance Additive p => Patch (AdditivePatch p) where
102− type PatchTarget (AdditivePatch p) = p
103− apply (AdditivePatch p) q = Just $ p <> q
src/Reflex/PerformEvent/Base.hsdeleted−151
@@ -1,151 +0,0 @@
1−-- | This module provides 'PerformEventT', the standard implementation of
2−-- 'PerformEvent'.
3−{-# LANGUAGE CPP #-}
4−{-# LANGUAGE ExistentialQuantification #-}
5−{-# LANGUAGE FlexibleContexts #-}
6−{-# LANGUAGE FlexibleInstances #-}
7−{-# LANGUAGE GADTs #-}
8−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
9−{-# LANGUAGE MultiParamTypeClasses #-}
10−{-# LANGUAGE PartialTypeSignatures #-}
11−{-# LANGUAGE PolyKinds #-}
12−{-# LANGUAGE RankNTypes #-}
13−{-# LANGUAGE ScopedTypeVariables #-}
14−{-# LANGUAGE StandaloneDeriving #-}
15−{-# LANGUAGE TypeFamilies #-}
16−{-# LANGUAGE TypeOperators #-}
17−{-# LANGUAGE UndecidableInstances #-}
18−#ifdef USE_REFLEX_OPTIMIZER
19−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
20−#endif
21−module Reflex.PerformEvent.Base
22− ( PerformEventT (..)
23− , FireCommand (..)
24− , hostPerformEventT
25− ) where
26−
27−import Reflex.Class
28−import Reflex.Host.Class
29−import Reflex.PerformEvent.Class
30−import Reflex.Requester.Base
31−import Reflex.Requester.Class
32−
33−import Control.Lens
34−import Control.Monad.Exception
35−import Control.Monad.Identity
36−import Control.Monad.Primitive
37−import Control.Monad.Reader
38−import Control.Monad.Ref
39−import Data.Coerce
40−import Data.Dependent.Map (DMap)
41−import qualified Data.Dependent.Map as DMap
42−import Data.Dependent.Sum
43−
44−-- | A function that fires events for the given 'EventTrigger's and then runs
45−-- any followup actions provided via 'PerformEvent'. The given 'ReadPhase'
46−-- action will be run once for the initial trigger execution as well as once for
47−-- each followup.
48−newtype FireCommand t m = FireCommand { runFireCommand :: forall a. [DSum (EventTrigger t) Identity] -> ReadPhase m a -> m [a] } --TODO: The handling of this ReadPhase seems wrong, or at least inelegant; how do we actually make the decision about what order frames run in?
49−
50−-- | Provides a basic implementation of 'PerformEvent'. Note that, despite the
51−-- name, 'PerformEventT' is not an instance of 'MonadTrans'.
52−newtype PerformEventT t m a = PerformEventT { unPerformEventT :: RequesterT t (HostFrame t) Identity (HostFrame t) a }
53−
54−deriving instance ReflexHost t => Functor (PerformEventT t m)
55−deriving instance ReflexHost t => Applicative (PerformEventT t m)
56−deriving instance ReflexHost t => Monad (PerformEventT t m)
57−deriving instance ReflexHost t => MonadFix (PerformEventT t m)
58−deriving instance (ReflexHost t, MonadIO (HostFrame t)) => MonadIO (PerformEventT t m)
59−deriving instance (ReflexHost t, MonadException (HostFrame t)) => MonadException (PerformEventT t m)
60−
61−instance (PrimMonad (HostFrame t), ReflexHost t) => PrimMonad (PerformEventT t m) where
62− type PrimState (PerformEventT t m) = PrimState (HostFrame t)
63− primitive = PerformEventT . lift . primitive
64−
65−instance (ReflexHost t, Ref m ~ Ref IO, PrimMonad (HostFrame t)) => PerformEvent t (PerformEventT t m) where
66− type Performable (PerformEventT t m) = HostFrame t
67− {-# INLINABLE performEvent_ #-}
68− performEvent_ = PerformEventT . requesting_
69− {-# INLINABLE performEvent #-}
70− performEvent = PerformEventT . requestingIdentity
71−
72−instance (ReflexHost t, PrimMonad (HostFrame t)) => MonadAdjust t (PerformEventT t m) where
73− runWithReplace outerA0 outerA' = PerformEventT $ runWithReplaceRequesterTWith f (coerce outerA0) (coerceEvent outerA')
74− where f :: HostFrame t a -> Event t (HostFrame t b) -> RequesterT t (HostFrame t) Identity (HostFrame t) (a, Event t b)
75− f a0 a' = do
76− result0 <- lift a0
77− result' <- requestingIdentity a'
78− return (result0, result')
79− sequenceDMapWithAdjust (outerDm0 :: DMap k (PerformEventT t m)) outerDm' = PerformEventT $ sequenceDMapWithAdjustRequesterTWith f (coerce outerDm0) (coerceEvent outerDm')
80− where f :: DMap k' (HostFrame t) -> Event t (PatchDMap k' (HostFrame t)) -> RequesterT t (HostFrame t) Identity (HostFrame t) (DMap k' Identity, Event t (PatchDMap k' Identity))
81− f dm0 dm' = do
82− result0 <- lift $ DMap.traverseWithKey (\_ v -> Identity <$> v) dm0
83− result' <- requestingIdentity $ ffor dm' $ \(PatchDMap p) -> do
84− PatchDMap <$> DMap.traverseWithKey (\_ (ComposeMaybe mv) -> ComposeMaybe <$> mapM (fmap Identity) mv) p
85− return (result0, result')
86−
87−instance ReflexHost t => MonadReflexCreateTrigger t (PerformEventT t m) where
88− {-# INLINABLE newEventWithTrigger #-}
89− newEventWithTrigger = PerformEventT . lift . newEventWithTrigger
90− {-# INLINABLE newFanEventWithTrigger #-}
91− newFanEventWithTrigger f = PerformEventT $ lift $ newFanEventWithTrigger f
92−
93−-- | Run a 'PerformEventT' action, returning a 'FireCommand' that allows the
94−-- caller to trigger 'Event's while ensuring that 'performEvent' actions are run
95−-- at the appropriate time.
96−{-# INLINABLE hostPerformEventT #-}
97−hostPerformEventT :: forall t m a.
98− ( Monad m
99− , MonadSubscribeEvent t m
100− , MonadReflexHost t m
101− , MonadRef m
102− , Ref m ~ Ref IO
103− )
104− => PerformEventT t m a
105− -> m (a, FireCommand t m)
106−hostPerformEventT a = do
107− (response, responseTrigger) <- newEventWithTriggerRef
108− (result, eventToPerform) <- runHostFrame $ runRequesterT (unPerformEventT a) response
109− eventToPerformHandle <- subscribeEvent eventToPerform
110− return $ (,) result $ FireCommand $ \triggers (readPhase :: ReadPhase m a') -> do
111− let go :: [DSum (EventTrigger t) Identity] -> m [a']
112− go ts = do
113− (result', mToPerform) <- fireEventsAndRead ts $ do
114− mToPerform <- sequence =<< readEvent eventToPerformHandle
115− result' <- readPhase
116− return (result', mToPerform)
117− case mToPerform of
118− Nothing -> return [result']
119− Just toPerform -> do
120− responses <- runHostFrame $ DMap.traverseWithKey (\_ v -> Identity <$> v) toPerform
121− mrt <- readRef responseTrigger
122− let followupEventTriggers = case mrt of
123− Just rt -> [rt :=> Identity responses]
124− Nothing -> []
125− (result':) <$> go followupEventTriggers
126− go triggers
127−
128−instance ReflexHost t => MonadSample t (PerformEventT t m) where
129− {-# INLINABLE sample #-}
130− sample = PerformEventT . lift . sample
131−
132−instance (ReflexHost t, MonadHold t m) => MonadHold t (PerformEventT t m) where
133− {-# INLINABLE hold #-}
134− hold v0 v' = PerformEventT $ lift $ hold v0 v'
135− {-# INLINABLE holdDyn #-}
136− holdDyn v0 v' = PerformEventT $ lift $ holdDyn v0 v'
137− {-# INLINABLE holdIncremental #-}
138− holdIncremental v0 v' = PerformEventT $ lift $ holdIncremental v0 v'
139−
140−instance (MonadRef (HostFrame t), ReflexHost t) => MonadRef (PerformEventT t m) where
141− type Ref (PerformEventT t m) = Ref (HostFrame t)
142− {-# INLINABLE newRef #-}
143− newRef = PerformEventT . lift . newRef
144− {-# INLINABLE readRef #-}
145− readRef = PerformEventT . lift . readRef
146− {-# INLINABLE writeRef #-}
147− writeRef r = PerformEventT . lift . writeRef r
148−
149−instance (MonadAtomicRef (HostFrame t), ReflexHost t) => MonadAtomicRef (PerformEventT t m) where
150− {-# INLINABLE atomicModifyRef #-}
151− atomicModifyRef r = PerformEventT . lift . atomicModifyRef r
src/Reflex/PerformEvent/Class.hsdeleted−64
@@ -1,64 +0,0 @@
1−-- | This module defines 'PerformEvent' and 'TriggerEvent', which mediate the
2−-- interaction between a "Reflex"-based program and the external side-effecting
3−-- actions such as 'IO'.
4−{-# LANGUAGE CPP #-}
5−{-# LANGUAGE FlexibleContexts #-}
6−{-# LANGUAGE FlexibleInstances #-}
7−{-# LANGUAGE FunctionalDependencies #-}
8−{-# LANGUAGE MultiParamTypeClasses #-}
9−{-# LANGUAGE RankNTypes #-}
10−{-# LANGUAGE ScopedTypeVariables #-}
11−{-# LANGUAGE TypeFamilies #-}
12−{-# LANGUAGE TypeOperators #-}
13−{-# LANGUAGE UndecidableInstances #-}
14−#ifdef USE_REFLEX_OPTIMIZER
15−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
16−#endif
17−module Reflex.PerformEvent.Class
18− ( PerformEvent (..)
19− , performEventAsync
20− ) where
21−
22−import Reflex.Class
23−import Reflex.TriggerEvent.Class
24−
25−import Control.Monad.Reader
26−
27−-- | 'PerformEvent' represents actions that can trigger other actions based on
28−-- 'Event's.
29−class (Reflex t, Monad (Performable m), Monad m) => PerformEvent t m | m -> t where
30− -- | The type of action to be triggered; this is often not the same type as
31− -- the triggering action.
32− type Performable m :: * -> *
33− -- | Perform the action contained in the given 'Event' whenever the 'Event'
34− -- fires. Return the result in another 'Event'. Note that the output 'Event'
35− -- will generally occur later than the input 'Event', since most 'Performable'
36− -- actions cannot be performed during 'Event' propagation.
37− performEvent :: Event t (Performable m a) -> m (Event t a)
38− -- | Like 'performEvent', but do not return the result. May have slightly
39− -- better performance.
40− performEvent_ :: Event t (Performable m ()) -> m ()
41−
42−-- | Like 'performEvent', but the resulting 'Event' occurs only when the
43−-- callback (@a -> IO ()@) is called, not when the included action finishes.
44−--
45−-- NOTE: Despite the name, 'performEventAsync' does not run its action in a
46−-- separate thread - although the action is free to invoke forkIO and then call
47−-- the callback whenever it is ready. This will work properly, even in GHCJS
48−-- (which fully implements concurrency even though JavaScript does not have
49−-- built in concurrency).
50−{-# INLINABLE performEventAsync #-}
51−performEventAsync :: (TriggerEvent t m, PerformEvent t m) => Event t ((a -> IO ()) -> Performable m ()) -> m (Event t a)
52−performEventAsync e = do
53− (eOut, triggerEOut) <- newTriggerEvent
54− performEvent_ $ fmap ($ triggerEOut) e
55− return eOut
56−
57−instance PerformEvent t m => PerformEvent t (ReaderT r m) where
58− type Performable (ReaderT r m) = ReaderT r (Performable m)
59− performEvent_ e = do
60− r <- ask
61− lift $ performEvent_ $ flip runReaderT r <$> e
62− performEvent e = do
63− r <- ask
64− lift $ performEvent $ flip runReaderT r <$> e
src/Reflex/PostBuild/Base.hsdeleted−119
@@ -1,119 +0,0 @@
1−-- | This module defines 'PostBuildT', the standard implementation of
2−-- 'PostBuild'.
3−{-# LANGUAGE CPP #-}
4−{-# LANGUAGE DataKinds #-}
5−{-# LANGUAGE FlexibleInstances #-}
6−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
7−{-# LANGUAGE MultiParamTypeClasses #-}
8−{-# LANGUAGE RecursiveDo #-}
9−{-# LANGUAGE ScopedTypeVariables #-}
10−{-# LANGUAGE TypeFamilies #-}
11−{-# LANGUAGE TypeOperators #-}
12−{-# LANGUAGE UndecidableInstances #-}
13−#ifdef USE_REFLEX_OPTIMIZER
14−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
15−#endif
16−module Reflex.PostBuild.Base
17− ( PostBuildT (..)
18− , runPostBuildT
19− ) where
20−
21−import Reflex.Class
22−import Reflex.Host.Class
23−import Reflex.PerformEvent.Class
24−import Reflex.PostBuild.Class
25−import Reflex.TriggerEvent.Class
26−
27−import Control.Monad.Exception
28−import Control.Monad.Primitive
29−import Control.Monad.Reader
30−import Control.Monad.Ref
31−import Control.Monad.Trans.Control
32−import qualified Data.Dependent.Map as DMap
33−
34−-- | Provides a basic implementation of 'PostBuild'.
35−newtype PostBuildT t m a = PostBuildT { unPostBuildT :: ReaderT (Event t ()) m a } deriving (Functor, Applicative, Monad, MonadFix, MonadIO, MonadTrans, MonadException, MonadAsyncException)
36−
37−-- | Run a 'PostBuildT' action. An 'Event' should be provided that fires
38−-- immediately after the action is finished running; no other 'Event's should
39−-- fire first.
40−{-# INLINABLE runPostBuildT #-}
41−runPostBuildT :: PostBuildT t m a -> Event t () -> m a
42−runPostBuildT (PostBuildT a) = runReaderT a
43−
44−instance PrimMonad m => PrimMonad (PostBuildT x m) where
45− type PrimState (PostBuildT x m) = PrimState m
46− primitive = lift . primitive
47−
48−instance MonadTransControl (PostBuildT t) where
49− type StT (PostBuildT t) a = StT (ReaderT (Event t ())) a
50− {-# INLINABLE liftWith #-}
51− liftWith = defaultLiftWith PostBuildT unPostBuildT
52− {-# INLINABLE restoreT #-}
53− restoreT = defaultRestoreT PostBuildT
54−
55−instance (Reflex t, Monad m) => PostBuild t (PostBuildT t m) where
56− {-# INLINABLE getPostBuild #-}
57− getPostBuild = PostBuildT ask
58−
59−instance MonadSample t m => MonadSample t (PostBuildT t m) where
60− {-# INLINABLE sample #-}
61− sample = lift . sample
62−
63−instance MonadHold t m => MonadHold t (PostBuildT t m) where
64− {-# INLINABLE hold #-}
65− hold v0 = lift . hold v0
66− {-# INLINABLE holdDyn #-}
67− holdDyn v0 = lift . holdDyn v0
68− {-# INLINABLE holdIncremental #-}
69− holdIncremental v0 = lift . holdIncremental v0
70−
71−instance PerformEvent t m => PerformEvent t (PostBuildT t m) where
72− type Performable (PostBuildT t m) = PostBuildT t (Performable m)
73− {-# INLINABLE performEvent_ #-}
74− performEvent_ e = liftWith $ \run -> performEvent_ $ fmap run e
75− {-# INLINABLE performEvent #-}
76− performEvent e = liftWith $ \run -> performEvent $ fmap run e
77−
78−instance (ReflexHost t, MonadReflexCreateTrigger t m) => MonadReflexCreateTrigger t (PostBuildT t m) where
79− {-# INLINABLE newEventWithTrigger #-}
80− newEventWithTrigger = PostBuildT . lift . newEventWithTrigger
81− {-# INLINABLE newFanEventWithTrigger #-}
82− newFanEventWithTrigger f = PostBuildT $ lift $ newFanEventWithTrigger f
83−
84−instance TriggerEvent t m => TriggerEvent t (PostBuildT t m) where
85− {-# INLINABLE newTriggerEvent #-}
86− newTriggerEvent = lift newTriggerEvent
87− {-# INLINABLE newTriggerEventWithOnComplete #-}
88− newTriggerEventWithOnComplete = lift newTriggerEventWithOnComplete
89− newEventWithLazyTriggerWithOnComplete = lift . newEventWithLazyTriggerWithOnComplete
90−
91−instance MonadRef m => MonadRef (PostBuildT t m) where
92− type Ref (PostBuildT t m) = Ref m
93− {-# INLINABLE newRef #-}
94− newRef = lift . newRef
95− {-# INLINABLE readRef #-}
96− readRef = lift . readRef
97− {-# INLINABLE writeRef #-}
98− writeRef r = lift . writeRef r
99−
100−instance MonadAtomicRef m => MonadAtomicRef (PostBuildT t m) where
101− {-# INLINABLE atomicModifyRef #-}
102− atomicModifyRef r = lift . atomicModifyRef r
103−
104−instance (Reflex t, MonadHold t m, MonadFix m, MonadAdjust t m, PerformEvent t m) => MonadAdjust t (PostBuildT t m) where
105− runWithReplace a0 a' = do
106− postBuild <- getPostBuild
107− lift $ do
108− rec result@(_, result') <- runWithReplace (runPostBuildT a0 postBuild) $ fmap (\v -> runPostBuildT v =<< headE voidResult') a'
109− let voidResult' = fmapCheap (\_ -> ()) result'
110− return result
111− sequenceDMapWithAdjust dm0 dm' = do
112− postBuild <- getPostBuild
113− let loweredDm0 = DMap.map (`runPostBuildT` postBuild) dm0
114− lift $ do
115− rec (result0, result') <- sequenceDMapWithAdjust loweredDm0 loweredDm'
116− let voidResult' = fmapCheap (\_ -> ()) result'
117− let loweredDm' = ffor dm' $ \(PatchDMap p) -> PatchDMap $
118− DMap.map (ComposeMaybe . fmap (\v -> runPostBuildT v =<< headE voidResult') . getComposeMaybe) p --TODO: Avoid doing this headE so many times; once per loweredDm' firing ought to be OK, but it's not totally trivial to do because result' might be firing at the same time, and we don't want *that* to be the postBuild occurrence
119− return (result0, result')
src/Reflex/PostBuild/Class.hsdeleted−34
@@ -1,34 +0,0 @@
1−-- | This module defines 'PostBuild', which indicates that an action will be
2−-- notified when it, and any action it's a part of, has finished executing.
3−{-# LANGUAGE CPP #-}
4−{-# LANGUAGE DataKinds #-}
5−{-# LANGUAGE FlexibleInstances #-}
6−{-# LANGUAGE FunctionalDependencies #-}
7−{-# LANGUAGE MultiParamTypeClasses #-}
8−{-# LANGUAGE ScopedTypeVariables #-}
9−{-# LANGUAGE TypeFamilies #-}
10−{-# LANGUAGE TypeOperators #-}
11−{-# LANGUAGE UndecidableInstances #-}
12−#ifdef USE_REFLEX_OPTIMIZER
13−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
14−#endif
15−module Reflex.PostBuild.Class
16− ( PostBuild (..)
17− ) where
18−
19−import Reflex.Class
20−
21−import Control.Monad.Reader
22−
23−-- | 'PostBuild' represents an action that is notified via an 'Event' when it
24−-- has finished executing. Note that the specific definition of "finished" is
25−-- determined by the instance of 'PostBuild', but the intent is to allow
26−-- 'Behavior's and 'Dynamic's to be safely sampled, regardless of where they
27−-- were created, when the post-build 'Event' fires. The post-build 'Event' will
28−-- fire exactly once for an given action.
29−class (Reflex t, Monad m) => PostBuild t m | m -> t where
30− -- | Retrieve the post-build 'Event' for this action.
31− getPostBuild :: m (Event t ())
32−
33−instance PostBuild t m => PostBuild t (ReaderT r m) where
34− getPostBuild = lift getPostBuild
src/Reflex/Pure.hsdeleted−184
@@ -1,184 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−{-# LANGUAGE EmptyDataDecls #-}
3−{-# LANGUAGE FlexibleInstances #-}
4−{-# LANGUAGE InstanceSigs #-}
5−{-# LANGUAGE MultiParamTypeClasses #-}
6−{-# LANGUAGE ScopedTypeVariables #-}
7−{-# LANGUAGE TypeFamilies #-}
8−#ifdef USE_REFLEX_OPTIMIZER
9−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
10−#endif
11−
12−-- There are two expected orphan instances in this module:
13−-- * MonadSample (Pure t) ((->) t)
14−-- * MonadHold (Pure t) ((->) t)
15−{-# OPTIONS_GHC -fno-warn-orphans #-}
16−
17−-- | This module provides a pure implementation of Reflex, which is intended to
18−-- serve as a reference for the semantics of the Reflex class. All
19−-- implementations of Reflex should produce the same results as this
20−-- implementation, although performance and laziness/strictness may differ.
21−module Reflex.Pure
22− ( Pure
23− , Behavior (..)
24− , Event (..)
25− , Dynamic (..)
26− , Incremental (..)
27− ) where
28−
29−#if !MIN_VERSION_base(4,8,0)
30−import Control.Applicative
31−#endif
32−
33−import Control.Monad
34−import Data.Dependent.Map (DMap, GCompare)
35−import qualified Data.Dependent.Map as DMap
36−import Data.Functor.Identity
37−import Data.Maybe
38−import Data.MemoTrie
39−import Data.Monoid
40−import Data.Type.Coercion
41−import Reflex.Class
42−
43−-- | A completely pure-functional 'Reflex' timeline, identifying moments in time
44−-- with the type @t@.
45−data Pure t
46−
47−-- | The Enum instance of t must be dense: for all x :: t, there must not exist
48−-- any y :: t such that pred x < y < x. The HasTrie instance will be used
49−-- exclusively to memoize functions of t, not for any of its other capabilities.
50−instance (Enum t, HasTrie t, Ord t) => Reflex (Pure t) where
51−
52− newtype Behavior (Pure t) a = Behavior { unBehavior :: t -> a }
53− newtype Event (Pure t) a = Event { unEvent :: t -> Maybe a }
54− newtype Dynamic (Pure t) a = Dynamic { unDynamic :: t -> (a, Maybe a) }
55− newtype Incremental (Pure t) p = Incremental { unIncremental :: t -> (PatchTarget p, Maybe p) }
56−
57− type PushM (Pure t) = (->) t
58− type PullM (Pure t) = (->) t
59−
60− never :: Event (Pure t) a
61− never = Event $ \_ -> Nothing
62−
63− constant :: a -> Behavior (Pure t) a
64− constant x = Behavior $ \_ -> x
65−
66− push :: (a -> PushM (Pure t) (Maybe b)) -> Event (Pure t) a -> Event (Pure t) b
67− push f e = Event $ memo $ \t -> unEvent e t >>= \o -> f o t
68−
69− pushCheap = push
70−
71− pull :: PullM (Pure t) a -> Behavior (Pure t) a
72− pull = Behavior . memo
73−
74− -- [UNUSED_CONSTRAINT]: The following type signature for merge will produce a
75− -- warning because the GCompare instance is not used; however, removing the
76− -- GCompare instance produces a different warning, due to that constraint
77− -- being present in the original class definition
78−
79− --merge :: GCompare k => DMap k (Event (Pure t)) -> Event (Pure t) (DMap k Identity)
80− merge events = Event $ memo $ \t ->
81− let currentOccurrences = DMap.mapMaybeWithKey (\_ (Event a) -> Identity <$> a t) events
82− in if DMap.null currentOccurrences
83− then Nothing
84− else Just currentOccurrences
85−
86− fan :: GCompare k => Event (Pure t) (DMap k Identity) -> EventSelector (Pure t) k
87− fan e = EventSelector $ \k -> Event $ \t -> unEvent e t >>= fmap runIdentity . DMap.lookup k
88−
89− switch :: Behavior (Pure t) (Event (Pure t) a) -> Event (Pure t) a
90− switch b = Event $ memo $ \t -> unEvent (unBehavior b t) t
91−
92− coincidence :: Event (Pure t) (Event (Pure t) a) -> Event (Pure t) a
93− coincidence e = Event $ memo $ \t -> unEvent e t >>= \o -> unEvent o t
94−
95− current :: Dynamic (Pure t) a -> Behavior (Pure t) a
96− current d = Behavior $ \t -> fst $ unDynamic d t
97−
98− updated :: Dynamic (Pure t) a -> Event (Pure t) a
99− updated d = Event $ \t -> snd $ unDynamic d t
100−
101− unsafeBuildDynamic :: PullM (Pure t) a -> Event (Pure t) a -> Dynamic (Pure t) a
102− unsafeBuildDynamic readV0 v' = Dynamic $ \t -> (readV0 t, unEvent v' t)
103−
104− -- See UNUSED_CONSTRAINT, above.
105−
106− --unsafeBuildIncremental :: Patch p => PullM (Pure t) a -> Event (Pure t) (p
107− --a) -> Incremental (Pure t) p a
108− unsafeBuildIncremental readV0 p = Incremental $ \t -> (readV0 t, unEvent p t)
109−
110− mergeIncremental i = Event $ \t ->
111− let results = DMap.mapMaybeWithKey (\_ (Event e) -> Identity <$> e t) $ fst $ unIncremental i t
112− in if DMap.null results
113− then Nothing
114− else Just results
115−
116− currentIncremental i = Behavior $ \t -> fst $ unIncremental i t
117−
118− updatedIncremental i = Event $ \t -> snd $ unIncremental i t
119−
120− incrementalToDynamic i = Dynamic $ \t ->
121− let (old, mPatch) = unIncremental i t
122− e = case mPatch of
123− Nothing -> Nothing
124− Just patch -> apply patch old
125− in (old, e)
126− behaviorCoercion Coercion = Coercion
127− eventCoercion Coercion = Coercion
128− dynamicCoercion Coercion = Coercion
129−
130−instance Functor (Dynamic (Pure t)) where
131− fmap f d = Dynamic $ \t -> let (cur, upd) = unDynamic d t
132− in (f cur, fmap f upd)
133−
134−instance Applicative (Dynamic (Pure t)) where
135− pure a = Dynamic $ \_ -> (a, Nothing)
136− (<*>) = ap
137−
138−instance Monad (Dynamic (Pure t)) where
139− return = pure
140− (x :: Dynamic (Pure t) a) >>= (f :: a -> Dynamic (Pure t) b) = Dynamic $ \t ->
141− let (curX :: a, updX :: Maybe a) = unDynamic x t
142− (cur :: b, updOuter :: Maybe b) = unDynamic (f curX) t
143− (updInner :: Maybe b, updBoth :: Maybe b) = case updX of
144− Nothing -> (Nothing, Nothing)
145− Just nextX -> let (c, u) = unDynamic (f nextX) t
146− in (Just c, u)
147− in (cur, getFirst $ mconcat $ map First [updBoth, updOuter, updInner])
148−
149−instance MonadSample (Pure t) ((->) t) where
150−
151− sample :: Behavior (Pure t) a -> (t -> a)
152− sample = unBehavior
153−
154−instance (Enum t, HasTrie t, Ord t) => MonadHold (Pure t) ((->) t) where
155−
156− hold :: a -> Event (Pure t) a -> t -> Behavior (Pure t) a
157− hold initialValue e initialTime = Behavior f
158− where f = memo $ \sampleTime ->
159− -- Really, the sampleTime should never be prior to the initialTime,
160− -- because that would mean the Behavior is being sampled before
161− -- being created.
162− if sampleTime <= initialTime
163− then initialValue
164− else let lastTime = pred sampleTime
165− in fromMaybe (f lastTime) $ unEvent e lastTime
166−
167− holdDyn :: a -> Event (Pure t) a -> t -> Dynamic (Pure t) a
168− holdDyn initialValue e initialTime =
169− let Behavior f = hold initialValue e initialTime
170− in Dynamic $ \t -> (f t, unEvent e t)
171−
172− holdIncremental :: Patch p => PatchTarget p -> Event (Pure t) p -> t -> Incremental (Pure t) p
173− holdIncremental initialValue e initialTime = Incremental $ \t -> (f t, unEvent e t)
174− where f = memo $ \sampleTime ->
175− -- Really, the sampleTime should never be prior to the initialTime,
176− -- because that would mean the Behavior is being sampled before
177− -- being created.
178− if sampleTime <= initialTime
179− then initialValue
180− else let lastTime = pred sampleTime
181− lastValue = f lastTime
182− in case unEvent e lastTime of
183− Nothing -> lastValue
184− Just x -> fromMaybe lastValue $ apply x lastValue
src/Reflex/Requester/Base.hsdeleted−133
@@ -1,133 +0,0 @@
1−-- | This module provides 'RequesterT', the standard implementation of
2−-- 'Requester'.
3−{-# LANGUAGE CPP #-}
4−{-# LANGUAGE ExistentialQuantification #-}
5−{-# LANGUAGE FlexibleInstances #-}
6−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
7−{-# LANGUAGE MultiParamTypeClasses #-}
8−{-# LANGUAGE Rank2Types #-}
9−{-# LANGUAGE ScopedTypeVariables #-}
10−{-# LANGUAGE TypeFamilies #-}
11−{-# LANGUAGE UndecidableInstances #-}
12−{-# LANGUAGE StandaloneDeriving #-}
13−#ifdef USE_REFLEX_OPTIMIZER
14−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
15−#endif
16−module Reflex.Requester.Base
17− ( RequesterT (..)
18− , runRequesterT
19− , runWithReplaceRequesterTWith
20− , sequenceDMapWithAdjustRequesterTWith
21− ) where
22−
23−import Reflex.Class
24−import Reflex.EventWriter
25−import Reflex.Host.Class
26−import Reflex.PerformEvent.Class
27−import Reflex.PostBuild.Class
28−import Reflex.Requester.Class
29−import Reflex.TriggerEvent.Class
30−
31−import Control.Monad.Exception
32−import Control.Monad.Identity
33−import Control.Monad.Primitive
34−import Control.Monad.Reader
35−import Control.Monad.Ref
36−import Control.Monad.State.Strict
37−import Data.Coerce
38−import Data.Dependent.Map (DMap, DSum (..))
39−import qualified Data.Dependent.Map as DMap
40−import Data.Functor.Misc
41−import Data.Unique.Tag
42−
43−-- | A basic implementation of 'Requester'.
44−newtype RequesterT t request response m a = RequesterT { unRequesterT :: EventWriterT t (DMap (Tag (PrimState m)) request) (ReaderT (EventSelector t (WrapArg response (Tag (PrimState m)))) m) a }
45− deriving (Functor, Applicative, Monad, MonadFix, MonadIO, MonadException)
46−
47−deriving instance MonadSample t m => MonadSample t (RequesterT t request response m)
48−deriving instance MonadHold t m => MonadHold t (RequesterT t request response m)
49−deriving instance PostBuild t m => PostBuild t (RequesterT t request response m)
50−deriving instance TriggerEvent t m => TriggerEvent t (RequesterT t request response m)
51−
52−-- | Run a 'RequesterT' action. The resulting 'Event' will fire whenever
53−-- requests are made, and responses should be provided in the input 'Event'.
54−-- The 'Tag' keys will be used to return the responses to the same place the
55−-- requests were issued.
56−
57−runRequesterT :: (Reflex t, Monad m)
58− => RequesterT t request response m a
59− -> Event t (DMap (Tag (PrimState m)) response)
60− -> m (a, Event t (DMap (Tag (PrimState m)) request))
61−runRequesterT (RequesterT a) responses = do
62− (result, requests) <- runReaderT (runEventWriterT a) $ fan $
63− mapKeyValuePairsMonotonic (\(t :=> e) -> WrapArg t :=> Identity e) <$> responses
64− return (result, requests)
65−
66−instance (Reflex t, PrimMonad m) => Requester t (RequesterT t request response m) where
67− type Request (RequesterT t request response m) = request
68− type Response (RequesterT t request response m) = response
69− withRequesting a = do
70− t <- lift newTag
71− s <- RequesterT ask
72− (req, result) <- a $ select s $ WrapArg t
73− RequesterT $ tellEvent $ fmapCheap (DMap.singleton t) req
74− return result
75−
76−instance MonadTrans (RequesterT t request response) where
77− lift = RequesterT . lift . lift
78−
79−instance PerformEvent t m => PerformEvent t (RequesterT t request response m) where
80− type Performable (RequesterT t request response m) = Performable m
81− performEvent_ = lift . performEvent_
82− performEvent = lift . performEvent
83−
84−instance MonadRef m => MonadRef (RequesterT t request response m) where
85− type Ref (RequesterT t request response m) = Ref m
86− newRef = lift . newRef
87− readRef = lift . readRef
88− writeRef r = lift . writeRef r
89−
90−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (RequesterT t request response m) where
91− newEventWithTrigger = lift . newEventWithTrigger
92− newFanEventWithTrigger f = lift $ newFanEventWithTrigger f
93−
94−instance MonadReader r m => MonadReader r (RequesterT t request response m) where
95− ask = lift ask
96− local f (RequesterT (EventWriterT a)) = RequesterT $ EventWriterT $ mapStateT (mapReaderT $ local f) a
97− reader = lift . reader
98−
99−instance (Reflex t, MonadAdjust t m, MonadHold t m) => MonadAdjust t (RequesterT t request response m) where
100− runWithReplace (RequesterT a) em = RequesterT $ runWithReplace a (coerceEvent em)
101− sequenceDMapWithAdjust dm edm = RequesterT $ sequenceDMapWithAdjust (coerce dm) (coerceEvent edm)
102−
103−runWithReplaceRequesterTWith :: forall m t request response a b. (Reflex t, MonadHold t m)
104− => (forall a' b'. m a' -> Event t (m b') -> RequesterT t request response m (a', Event t b'))
105− -> RequesterT t request response m a
106− -> Event t (RequesterT t request response m b)
107− -> RequesterT t request response m (a, Event t b)
108−runWithReplaceRequesterTWith f a0 a' =
109− let f' :: forall a' b'. ReaderT (EventSelector t (WrapArg response (Tag (PrimState m)))) m a'
110− -> Event t (ReaderT (EventSelector t (WrapArg response (Tag (PrimState m)))) m b')
111− -> EventWriterT t (DMap (Tag (PrimState m)) request) (ReaderT (EventSelector t (WrapArg response (Tag (PrimState m)))) m) (a', Event t b')
112− f' x y = do
113− r <- EventWriterT $ ask
114− unRequesterT (f (runReaderT x r) (fmapCheap (`runReaderT` r) y))
115− in RequesterT $ runWithReplaceEventWriterTWith f' (coerce a0) (coerceEvent a')
116−
117−sequenceDMapWithAdjustRequesterTWith :: (GCompare k, Reflex t, MonadHold t m)
118− => (forall k'. GCompare k' => DMap k' m -> Event t (PatchDMap k' m) -> RequesterT t request response m (DMap k' Identity, Event t (PatchDMap k' Identity)))
119− -> DMap k (RequesterT t request response m)
120− -> Event t (PatchDMap k (RequesterT t request response m))
121− -> RequesterT t request response m (DMap k Identity, Event t (PatchDMap k Identity))
122−sequenceDMapWithAdjustRequesterTWith f (dm0 :: DMap k (RequesterT t request response m)) dm' =
123− let dmapUnwrap r = mapKeyValuePairsMonotonic $ \(k :=> v) -> k :=> runReaderT v r
124− patchDmapUnwrap r (PatchDMap p) = PatchDMap $ mapKeyValuePairsMonotonic
125− (\(k :=> ComposeMaybe mv) -> k :=> ComposeMaybe (fmap (`runReaderT` r) mv)) p
126− f' :: forall k'. GCompare k'
127− => DMap k' (ReaderT (EventSelector t (WrapArg response (Tag (PrimState m)))) m)
128− -> Event t (PatchDMap k' (ReaderT (EventSelector t (WrapArg response (Tag (PrimState m)))) m))
129− -> EventWriterT t (DMap (Tag (PrimState m)) request) (ReaderT (EventSelector t (WrapArg response (Tag (PrimState m)))) m) (DMap k' Identity, Event t (PatchDMap k' Identity))
130− f' x y = do
131− r <- EventWriterT $ ask
132− unRequesterT (f (dmapUnwrap r x) (fmap (patchDmapUnwrap r) y))
133− in RequesterT $ sequenceDMapWithAdjustEventWriterTWith f' (coerce dm0) (coerceEvent dm')
src/Reflex/Requester/Class.hsdeleted−87
@@ -1,87 +0,0 @@
1−-- | This module defines 'Requester', which indicates that an action can make
2−-- requests and receive responses to them. Typically, this is used for things
3−-- like a WebSocket, where it's desirable to collect many potential sources of
4−-- events and send them over a single channel, then distribute the results back
5−-- out efficiently to their original request sites.
6−{-# LANGUAGE CPP #-}
7−{-# LANGUAGE FlexibleInstances #-}
8−{-# LANGUAGE FunctionalDependencies #-}
9−{-# LANGUAGE MultiParamTypeClasses #-}
10−{-# LANGUAGE TypeFamilies #-}
11−{-# LANGUAGE UndecidableInstances #-}
12−#ifdef USE_REFLEX_OPTIMIZER
13−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
14−#endif
15−module Reflex.Requester.Class
16− ( Requester (..)
17− , requesting
18− , requesting_
19− , requestingIdentity
20− ) where
21−
22−import Control.Monad.Identity
23−import Control.Monad.Reader
24−import qualified Control.Monad.State.Lazy as Lazy
25−import Control.Monad.State.Strict
26−import Reflex.Class
27−
28−-- | A 'Requester' action can trigger requests of type @Request m a@ based on
29−-- 'Event's, and receive responses of type @Response m a@ in return. Note that
30−-- the @a@ type can vary within the 'Requester' action, but will be linked for a
31−-- given request. For example, if @Request m@ is 'IO' and @Response m@ is
32−-- 'Identity', then 'requestingIdentity' has the same type as
33−-- 'Reflex.PerformEvent.Class.performEvent'.
34−class (Reflex t, Monad m) => Requester t m | m -> t where
35− -- | The type of requests that this 'Requester' can emit
36− type Request m :: * -> *
37− -- | The type of responses that this 'Requester' can receive
38− type Response m :: * -> *
39− -- | Usually, end-user code should use 'requesting', 'requesting_', or
40− -- 'requestingIdentity'. For implementers of 'Requester', this function
41− -- provides a convenient way to define instances of the typeclass that
42− -- efficiently support the underlying operations without needing to use
43− -- 'Control.Monad.Fix.MonadFix'.
44− withRequesting :: (Event t (Response m a) -> m (Event t (Request m a), r)) -> m r
45−
46−instance Requester t m => Requester t (ReaderT r m) where
47− type Request (ReaderT r m) = Request m
48− type Response (ReaderT r m) = Response m
49− withRequesting f = do
50− r <- ask
51− lift $ withRequesting $ (`runReaderT` r) . f
52−
53−instance Requester t m => Requester t (StateT s m) where
54− type Request (StateT s m) = Request m
55− type Response (StateT s m) = Response m
56− withRequesting f = do
57− old <- get
58− (result, new) <- lift $ withRequesting $ \x -> do
59− ((request, result), new) <- runStateT (f x) old
60− return (request, (result, new))
61− put new
62− return result
63−
64−instance Requester t m => Requester t (Lazy.StateT s m) where
65− type Request (Lazy.StateT s m) = Request m
66− type Response (Lazy.StateT s m) = Response m
67− withRequesting f = do
68− old <- Lazy.get
69− (result, new) <- lift $ withRequesting $ \x -> do
70− ((request, result), new) <- Lazy.runStateT (f x) old
71− return (request, (result, new))
72− Lazy.put new
73− return result
74−
75−-- | Emit a request whenever the given 'Event' fires, and return responses in
76−-- the resulting 'Event'.
77−requesting :: Requester t m => Event t (Request m a) -> m (Event t (Response m a))
78−requesting req = withRequesting $ return . (,) req
79−
80−-- | Emit a request whenever the given 'Event' fires, and ignore all responses.
81−requesting_ :: Requester t m => Event t (Request m a) -> m ()
82−requesting_ req = withRequesting $ \_ -> return (req, ())
83−
84−-- | Emit a request whenever the given 'Event' fires, and unwrap the responses
85−-- before returning them. @Response m@ must be 'Identity'.
86−requestingIdentity :: (Requester t m, Response m ~ Identity) => Event t (Request m a) -> m (Event t a)
87−requestingIdentity = fmap coerceEvent . requesting
src/Reflex/Spider.hsdeleted−22
@@ -1,22 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−-- | This module exports all of the user-facing functionality of the 'Spider'
3−-- 'Reflex' engine
4−module Reflex.Spider
5− ( Spider
6− , SpiderTimeline
7− , Global
8− , SpiderHost
9− , runSpiderHost
10−#ifndef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
11− , runSpiderHostForTimeline
12− , newSpiderTimeline
13− , withSpiderTimeline
14−#endif
15− -- * Deprecated
16− , SpiderEnv
17− ) where
18−
19−#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
20−import Reflex.Class
21−#endif
22−import Reflex.Spider.Internal
src/Reflex/Spider/Internal.hsdeleted−2083
@@ -1,2083 +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−#ifdef USE_REFLEX_OPTIMIZER
22−{-# OPTIONS_GHC -fplugin=Reflex.Optimizer #-}
23−#endif
24−#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
25−{-# OPTIONS_GHC -fno-warn-orphans #-}
26−#endif
27−-- | This module is the implementation of the 'Spider' 'Reflex' engine. It uses
28−-- a graph traversal algorithm to propagate 'Event's and 'Behavior's.
29−module Reflex.Spider.Internal (module Reflex.Spider.Internal) where
30−
31−import Control.Applicative
32−import Control.Concurrent
33−import Control.Exception
34−import Control.Monad hiding (forM, forM_, mapM, mapM_, sequence)
35−import Control.Monad.Exception
36−import Control.Monad.Identity hiding (forM, forM_, mapM, mapM_, sequence)
37−import Control.Monad.Primitive
38−import Control.Monad.Reader hiding (forM, forM_, mapM, mapM_, sequence)
39−import Control.Monad.Ref
40−import Data.Align
41−import Data.Coerce
42−import Data.Dependent.Map (DMap, DSum (..))
43−import qualified Data.Dependent.Map as DMap
44−import Data.Foldable hiding (concat, elem, sequence_)
45−import Data.Function
46−import Data.Functor.Constant
47−import Data.Functor.Misc
48−import Data.Functor.Product
49−import Data.GADT.Compare
50−import Data.IntMap.Strict (IntMap)
51−import qualified Data.IntMap.Strict as IntMap
52−import Data.IORef
53−import Data.List hiding (foldl')
54−import Data.Maybe
55−import Data.Monoid ((<>))
56−import Data.Proxy
57−import Data.These
58−import Data.Traversable
59−import Data.Word
60−import GHC.Exts
61−import GHC.IORef (IORef (..))
62−import GHC.Stack
63−import Reflex.FunctorMaybe
64−import System.IO.Unsafe
65−import System.Mem.Weak
66−import Unsafe.Coerce
67−
68−#ifdef DEBUG_CYCLES
69−import Control.Monad.State hiding (forM, forM_, mapM, mapM_, sequence)
70−import Data.List.NonEmpty (NonEmpty (..), nonEmpty)
71−import qualified Data.List.NonEmpty as NonEmpty
72−import Data.Monoid (mempty)
73−import Data.Tree (Forest, Tree (..), drawForest)
74−#endif
75−
76−import Data.WeakBag (WeakBag, WeakBagTicket)
77−import qualified Data.WeakBag as WeakBag
78−#ifndef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
79−import Data.Reflection
80−import Data.Some (Some)
81−import qualified Data.Some as Some
82−import Data.Type.Coercion
83−import qualified Reflex.Class
84−import qualified Reflex.Class as R
85−import qualified Reflex.Host.Class
86−#endif
87−import Reflex.Patch
88−
89−-- Note: must come last to silence warnings due to AMP on GHC < 7.10
90−import Prelude hiding (any, concat, mapM, mapM_, sequence)
91−
92−#ifdef DEBUG_TRACE_EVENTS
93−import System.IO (stderr)
94−import qualified Data.ByteString.Char8 as BS8
95−#endif
96−
97−#ifdef DEBUG_TRACE_EVENTS
98−
99−withStackOneLine :: (BS8.ByteString -> a) -> a
100−withStackOneLine expr = unsafePerformIO $ do
101− stack <- currentCallStack
102− return (expr (BS8.pack (unwords (reverse stack))))
103−
104−#endif
105−
106−debugPropagate :: Bool
107−
108−debugInvalidateHeight :: Bool
109−
110−debugInvalidate :: Bool
111−
112−#ifdef DEBUG
113−
114−#define DEBUG_NODEIDS
115−
116−debugPropagate = True
117−
118−debugInvalidateHeight = False
119−
120−debugInvalidate = True
121−
122−class HasNodeId a where
123− getNodeId :: a -> Int
124−
125−instance HasNodeId (Hold x p a) where
126− getNodeId = holdNodeId
127−
128−instance HasNodeId (PushSubscribed x a b) where
129− getNodeId = pushSubscribedNodeId
130−
131−instance HasNodeId (SwitchSubscribed x a) where
132− getNodeId = switchSubscribedNodeId
133−
134−instance HasNodeId (FanSubscribed x a) where
135− getNodeId = fanSubscribedNodeId
136−
137−instance HasNodeId (CoincidenceSubscribed x a) where
138− getNodeId = coincidenceSubscribedNodeId
139−
140−instance HasNodeId (RootSubscribed x a) where
141− getNodeId = rootSubscribedNodeId
142−
143−instance HasNodeId (Pull x a) where
144− getNodeId = pullNodeId
145−
146−{-# INLINE showNodeId #-}
147−showNodeId :: HasNodeId a => a -> String
148−showNodeId = ("#"<>) . show . getNodeId
149−
150−showSubscriberType :: Subscriber x a -> String
151−showSubscriberType = \case
152− SubscriberPush _ _ -> "SubscriberPush"
153− SubscriberMerge _ _ -> "SubscriberMerge"
154− SubscriberFan _ -> "SubscriberFan"
155− SubscriberMergeChange _ -> "SubscriberMergeChange"
156− SubscriberHold _ -> "SubscriberHold"
157− SubscriberHoldIdentity _ -> "SubscriberHoldIdentity"
158− SubscriberSwitch _ -> "SubscriberSwitch"
159− SubscriberCoincidenceOuter _ -> "SubscriberCoincidenceOuter"
160− SubscriberCoincidenceInner _ -> "SubscriberCoincidenceInner"
161− SubscriberHandle -> "SubscriberHandle"
162−
163−showEventType :: Event x a -> String
164−showEventType = \case
165− EventRoot _ _ -> "EventRoot"
166− EventNever -> "EventNever"
167− EventPush _ -> "EventPush"
168− EventMerge _ -> "EventMerge"
169− EventFan _ _ -> "EventFan"
170− EventSwitch _ -> "EventSwitch"
171− EventCoincidence _ -> "EventCoincidence"
172− EventHold _ -> "EventHold"
173− EventDyn _ -> "EventDyn"
174− EventHoldIdentity _ -> "EventHoldIdentity"
175− EventDynIdentity _ -> "EventDynIdentity"
176−
177−#else
178−
179−debugPropagate = False
180−
181−debugInvalidateHeight = False
182−
183−debugInvalidate = False
184−
185−-- This must be inline, or error messages will cause memory leaks due to retaining the node in question
186−{-# INLINE showNodeId #-}
187−showNodeId :: a -> String
188−showNodeId _ = ""
189−
190−#endif
191−
192−#ifdef DEBUG_NODEIDS
193−{-# NOINLINE nextNodeIdRef #-}
194−nextNodeIdRef :: IORef Int
195−nextNodeIdRef = unsafePerformIO $ newIORef 1
196−
197−newNodeId :: IO Int
198−newNodeId = atomicModifyIORef' nextNodeIdRef $ \n -> (succ n, n)
199−
200−{-# NOINLINE unsafeNodeId #-}
201−unsafeNodeId :: a -> Int
202−unsafeNodeId a = unsafePerformIO $ do
203− touch a
204− newNodeId
205−#endif
206−
207−--------------------------------------------------------------------------------
208−-- EventSubscription
209−--------------------------------------------------------------------------------
210−
211−--NB: Once you subscribe to an Event, you must always hold on the the WHOLE EventSubscription you get back
212−-- If you do not retain the subscription, you may be prematurely unsubscribed from the parent event.
213−data EventSubscription x = EventSubscription
214− { _eventSubscription_unsubscribe :: !(IO ())
215− , _eventSubscription_subscribed :: {-# UNPACK #-} !(EventSubscribed x)
216− }
217−
218−unsubscribe :: EventSubscription x -> IO ()
219−unsubscribe (EventSubscription u _) = u
220−
221−--------------------------------------------------------------------------------
222−-- Event
223−--------------------------------------------------------------------------------
224−
225−newtype Event x a = Event { unEvent :: Subscriber x a -> EventM x (EventSubscription x, Maybe a) }
226−
227−{-# INLINE subscribeAndRead #-}
228−subscribeAndRead :: Event x a -> Subscriber x a -> EventM x (EventSubscription x, Maybe a)
229−subscribeAndRead = unEvent
230−
231−{-# RULES
232−"cacheEvent/cacheEvent" forall e. cacheEvent (cacheEvent e) = cacheEvent e
233−"cacheEvent/pushCheap" forall f e. pushCheap f (cacheEvent e) = cacheEvent (pushCheap f e)
234−"hold/cacheEvent" forall f e. hold f (cacheEvent e) = hold f e
235− #-}
236−
237−-- | Construct an 'Event' equivalent to that constructed by 'push', but with no
238−-- caching; if the computation function is very cheap, this is (much) more
239−-- efficient than 'push'
240−{-# NOINLINE pushCheap #-}
241−pushCheap :: HasSpiderTimeline x => (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
242−pushCheap f e = Event $ \sub -> do
243− (subscription, occ) <- subscribeAndRead e $ sub
244− { subscriberPropagate = \a -> do
245− mb <- runComputeM $ f a
246− mapM_ (subscriberPropagate sub) mb
247− }
248− occ' <- join <$> mapM (runComputeM . f) occ
249− return (subscription, occ')
250−
251−data CacheSubscribed x a
252− = CacheSubscribed { _cacheSubscribed_subscribers :: {-# UNPACK #-} !(WeakBag (Subscriber x a))
253− , _cacheSubscribed_weakSelf :: {-# UNPACK #-} !(IORef (Weak (CacheSubscribed x a)))
254− , _cacheSubscribed_parent :: {-# UNPACK #-} !(EventSubscription x)
255− , _cacheSubscribed_cached :: {-# UNPACK #-} !(IORef (Maybe (CacheSubscribed x a)))
256− , _cacheSubscribed_occurrence :: {-# UNPACK #-} !(IORef (Maybe a))
257− }
258−
259−-- | Construct an 'Event' whose value is guaranteed not to be recomputed
260−-- repeatedly
261−--
262−--TODO: Try a caching strategy where we subscribe directly to the parent when
263−--there's only one subscriber, and then build our own WeakBag only when a second
264−--subscriber joins
265−{-# NOINLINE cacheEvent #-}
266−cacheEvent :: HasSpiderTimeline x => Event x a -> Event x a
267−cacheEvent e =
268−#ifdef DEBUG_TRACE_EVENTS
269− withStackOneLine $ \callSite -> Event $
270−#else
271− Event $
272−#endif
273− let !mSubscribedRef = unsafeNewIORef e Nothing
274− in \sub -> {-# SCC "cacheEvent" #-} do
275−#ifdef DEBUG_TRACE_EVENTS
276− unless (BS8.null callSite) $ liftIO $ BS8.hPutStrLn stderr callSite
277−#endif
278− mSubscribed <- liftIO $ readIORef mSubscribedRef
279− case mSubscribed of
280− Just subscribed -> liftIO $ do
281− ticket <- WeakBag.insert sub (_cacheSubscribed_subscribers subscribed) (_cacheSubscribed_weakSelf subscribed) cleanupCacheSubscribed
282− occ <- readIORef $ _cacheSubscribed_occurrence subscribed
283− let es = EventSubscribed
284− { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ _cacheSubscribed_parent subscribed
285− , eventSubscribedRetained = toAny subscribed
286− }
287− return (EventSubscription (WeakBag.remove ticket >> touch ticket) es, occ)
288− Nothing -> do
289− weakSelf <- liftIO $ newIORef $ error "cacheEvent: weakSelf not yet intialized"
290− (subscribers, ticket) <- liftIO $ WeakBag.singleton sub weakSelf cleanupCacheSubscribed
291− occRef <- liftIO $ newIORef undefined
292− (parentSub, occ) <- subscribeAndRead e $ Subscriber
293− { subscriberPropagate = \a -> do
294− liftIO $ writeIORef occRef $ Just a
295− scheduleClear occRef
296− propagate a subscribers
297− , subscriberInvalidateHeight = \old -> do
298− WeakBag.traverse subscribers $ invalidateSubscriberHeight old
299− , subscriberRecalculateHeight = \new -> do
300− WeakBag.traverse subscribers $ recalculateSubscriberHeight new
301− }
302− liftIO $ writeIORef occRef occ
303− when (isJust occ) $ scheduleClear occRef
304− let !subscribed = CacheSubscribed
305− { _cacheSubscribed_subscribers = subscribers
306− , _cacheSubscribed_weakSelf = weakSelf
307− , _cacheSubscribed_parent = parentSub
308− , _cacheSubscribed_cached = mSubscribedRef
309− , _cacheSubscribed_occurrence = occRef
310− }
311− liftIO $ writeIORef mSubscribedRef $ Just subscribed
312− liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "PushSubscribed"
313− return (EventSubscription (WeakBag.remove ticket >> touch ticket) (EventSubscribed (eventSubscribedHeightRef $ _eventSubscription_subscribed parentSub) (toAny subscribed)), occ)
314−
315−cleanupCacheSubscribed :: CacheSubscribed x a -> IO ()
316−cleanupCacheSubscribed self = do
317− unsubscribe $ _cacheSubscribed_parent self
318− writeIORef (_cacheSubscribed_cached self) Nothing
319−
320−subscribe :: Event x a -> Subscriber x a -> EventM x (EventSubscription x)
321−subscribe e s = fst <$> subscribeAndRead e s
322−
323−{-# INLINE wrap #-}
324−wrap :: MonadIO m => (t -> EventSubscribed x) -> (Subscriber x a -> m (WeakBagTicket, t, Maybe a)) -> Subscriber x a -> m (EventSubscription x, Maybe a)
325−wrap tag getSpecificSubscribed sub = do
326− (sln, subd, occ) <- getSpecificSubscribed sub
327− let es = tag subd
328− return (EventSubscription (WeakBag.remove sln >> touch sln) es, occ)
329−
330−eventRoot :: GCompare k => k a -> Root x k -> Event x a
331−eventRoot !k !r = Event $ wrap eventSubscribedRoot $ liftIO . getRootSubscribed k r
332−
333−eventNever :: Event x a
334−eventNever = Event $ \_ -> return (EventSubscription (return ()) eventSubscribedNever, Nothing)
335−
336−eventFan :: (GCompare k, HasSpiderTimeline x) => k a -> Fan x k -> Event x a
337−eventFan !k !f = Event $ wrap eventSubscribedFan $ getFanSubscribed k f
338−
339−eventSwitch :: HasSpiderTimeline x => Switch x a -> Event x a
340−eventSwitch !s = Event $ wrap eventSubscribedSwitch $ getSwitchSubscribed s
341−
342−eventCoincidence :: HasSpiderTimeline x => Coincidence x a -> Event x a
343−eventCoincidence !c = Event $ wrap eventSubscribedCoincidence $ getCoincidenceSubscribed c
344−
345−eventHold :: HasSpiderTimeline x => Hold x p -> Event x p
346−eventHold !h = Event $ subscribeHoldEvent h
347−
348−eventDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> Event x p
349−eventDyn !j = Event $ \sub -> getDynHold j >>= \h -> subscribeHoldEvent h sub
350−
351−{-# INLINE subscribeCoincidenceInner #-}
352−subscribeCoincidenceInner :: CanSubscribe x m => Event x a -> Height -> CoincidenceSubscribed x a -> m (Maybe a, Height, EventSubscribed x)
353−subscribeCoincidenceInner inner outerHeight subscribedUnsafe = do
354− subInner <- liftIO $ newSubscriberCoincidenceInner subscribedUnsafe
355− (subscription@(EventSubscription _ innerSubd), innerOcc) <- subscribeAndRead inner subInner
356− innerHeight <- liftIO $ getEventSubscribedHeight innerSubd
357− let height = max innerHeight outerHeight
358− defer $ SomeResetCoincidence subscription $ if height > outerHeight then Just subscribedUnsafe else Nothing
359− return (innerOcc, height, innerSubd)
360−
361−--------------------------------------------------------------------------------
362−-- Subscriber
363−--------------------------------------------------------------------------------
364−
365−data Subscriber x a = Subscriber
366− { subscriberPropagate :: !(a -> EventM x ())
367− , subscriberInvalidateHeight :: !(Height -> IO ())
368− , subscriberRecalculateHeight :: !(Height -> IO ())
369− }
370−
371−--TODO: Move this comment to WeakBag
372−-- These function are constructor functions that are marked NOINLINE so they are
373−-- opaque to GHC. If we do not do this, then GHC will sometimes fuse the constructor away
374−-- so any weak references that are attached to the constructors will have their
375−-- finalizer run. Using the opaque constructor, does not see the
376−-- constructor application, so it behaves like an IORef and cannot be fused away.
377−--
378−-- The result is also evaluated to WHNF, since forcing a thunk invalidates
379−-- the weak pointer to it in some cases.
380−
381−newSubscriberHold :: (HasSpiderTimeline x, Patch p) => Hold x p -> IO (Subscriber x p)
382−newSubscriberHold h = return $ Subscriber
383− { subscriberPropagate = {-# SCC "traverseHold" #-} propagateSubscriberHold h
384− , subscriberInvalidateHeight = \_ -> return ()
385− , subscriberRecalculateHeight = \_ -> return ()
386− }
387−
388−newSubscriberFan :: forall x k. (HasSpiderTimeline x, GCompare k) => FanSubscribed x k -> IO (Subscriber x (DMap k Identity))
389−newSubscriberFan subscribed = return $ Subscriber
390− { subscriberPropagate = \a -> {-# SCC "traverseFan" #-} do
391− subs <- liftIO $ readIORef $ fanSubscribedSubscribers subscribed
392− tracePropagate (Proxy :: Proxy x) $ "SubscriberFan" <> showNodeId subscribed <> ": " ++ show (DMap.size subs) ++ " keys subscribed, " ++ show (DMap.size a) ++ " keys firing"
393− liftIO $ writeIORef (fanSubscribedOccurrence subscribed) $ Just a
394− scheduleClear $ fanSubscribedOccurrence subscribed
395− let f _ (Pair (Identity v) subsubs) = do
396− propagate v $ _fanSubscribedChildren_list subsubs
397− return $ Constant ()
398− _ <- DMap.traverseWithKey f $ DMap.intersectionWithKey (\_ -> Pair) a subs --TODO: Would be nice to have DMap.traverse_
399− return ()
400− , subscriberInvalidateHeight = \old -> do
401− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
402− subscribers <- readIORef $ fanSubscribedSubscribers subscribed
403− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ invalidateSubscriberHeight old
404− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
405− , subscriberRecalculateHeight = \new -> do
406− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed
407− subscribers <- readIORef $ fanSubscribedSubscribers subscribed
408− forM_ (DMap.toList subscribers) $ \(_ :=> v) -> WeakBag.traverse (_fanSubscribedChildren_list v) $ recalculateSubscriberHeight new
409− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberFan" <> showNodeId subscribed <> " done"
410− }
411−
412−newSubscriberSwitch :: forall x a. HasSpiderTimeline x => SwitchSubscribed x a -> IO (Subscriber x a)
413−newSubscriberSwitch subscribed = return $ Subscriber
414− { subscriberPropagate = \a -> {-# SCC "traverseSwitch" #-} do
415− tracePropagate (Proxy :: Proxy x) $ "SubscriberSwitch" <> showNodeId subscribed
416− liftIO $ writeIORef (switchSubscribedOccurrence subscribed) $ Just a
417− scheduleClear $ switchSubscribedOccurrence subscribed
418− propagate a $ switchSubscribedSubscribers subscribed
419− , subscriberInvalidateHeight = \_ -> do
420− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
421− oldHeight <- readIORef $ switchSubscribedHeight subscribed
422− when (oldHeight /= invalidHeight) $ do
423− writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
424− WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
425− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
426− , subscriberRecalculateHeight = \new -> do
427− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed
428− updateSwitchHeight new subscribed
429− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberSwitch" <> showNodeId subscribed <> " done"
430− }
431−
432−newSubscriberCoincidenceOuter :: forall x b. HasSpiderTimeline x => CoincidenceSubscribed x b -> IO (Subscriber x (Event x b))
433−newSubscriberCoincidenceOuter subscribed = return $ Subscriber
434− { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceOuter" #-} do
435− tracePropagate (Proxy :: Proxy x) $ "SubscriberCoincidenceOuter" <> showNodeId subscribed
436− outerHeight <- liftIO $ readIORef $ coincidenceSubscribedHeight subscribed
437− tracePropagate (Proxy :: Proxy x) $ " outerHeight = " <> show outerHeight
438− (occ, innerHeight, innerSubd) <- subscribeCoincidenceInner a outerHeight subscribed
439− tracePropagate (Proxy :: Proxy x) $ " isJust occ = " <> show (isJust occ)
440− tracePropagate (Proxy :: Proxy x) $ " innerHeight = " <> show innerHeight
441− liftIO $ writeIORef (coincidenceSubscribedInnerParent subscribed) $ Just innerSubd
442− scheduleClear $ coincidenceSubscribedInnerParent subscribed
443− case occ of
444− Nothing -> do
445− when (innerHeight > outerHeight) $ liftIO $ do -- If the event fires, it will fire at a later height
446− writeIORef (coincidenceSubscribedHeight subscribed) $! innerHeight
447− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight outerHeight
448− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight innerHeight
449− Just o -> do -- Since it's already firing, no need to adjust height
450− liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) occ
451− scheduleClear $ coincidenceSubscribedOccurrence subscribed
452− propagate o $ coincidenceSubscribedSubscribers subscribed
453− , subscriberInvalidateHeight = \_ -> do
454− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
455− invalidateCoincidenceHeight subscribed
456− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
457− , subscriberRecalculateHeight = \_ -> do
458− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed
459− recalculateCoincidenceHeight subscribed
460− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceOuter" <> showNodeId subscribed <> " done"
461− }
462−
463−newSubscriberCoincidenceInner :: forall x a. HasSpiderTimeline x => CoincidenceSubscribed x a -> IO (Subscriber x a)
464−newSubscriberCoincidenceInner subscribed = return $ Subscriber
465− { subscriberPropagate = \a -> {-# SCC "traverseCoincidenceInner" #-} do
466− tracePropagate (Proxy :: Proxy x) $ "SubscriberCoincidenceInner" <> showNodeId subscribed
467− occ <- liftIO $ readIORef $ coincidenceSubscribedOccurrence subscribed
468− case occ of
469− Just _ -> return () -- SubscriberCoincidenceOuter must have already propagated this event
470− Nothing -> do
471− liftIO $ writeIORef (coincidenceSubscribedOccurrence subscribed) $ Just a
472− scheduleClear $ coincidenceSubscribedOccurrence subscribed
473− propagate a $ coincidenceSubscribedSubscribers subscribed
474− , subscriberInvalidateHeight = \_ -> do
475− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
476− invalidateCoincidenceHeight subscribed
477− when debugInvalidateHeight $ putStrLn $ "invalidateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
478− , subscriberRecalculateHeight = \_ -> do
479− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed
480− recalculateCoincidenceHeight subscribed
481− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: SubscriberCoincidenceInner" <> showNodeId subscribed <> " done"
482− }
483−
484−invalidateSubscriberHeight :: Height -> Subscriber x a -> IO ()
485−invalidateSubscriberHeight = flip subscriberInvalidateHeight
486−
487−recalculateSubscriberHeight :: Height -> Subscriber x a -> IO ()
488−recalculateSubscriberHeight = flip subscriberRecalculateHeight
489−
490−-- | Propagate everything at the current height
491−propagate :: a -> WeakBag (Subscriber x a) -> EventM x ()
492−propagate a subscribers = withIncreasedDepth $ do
493− -- 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
494− --TODO: Should we check if nodes already have their values before propagating? Maybe we're re-doing work
495− WeakBag.traverse subscribers $ \s -> subscriberPropagate s a
496−
497−--------------------------------------------------------------------------------
498−-- EventSubscribed
499−--------------------------------------------------------------------------------
500−
501−toAny :: a -> Any
502−toAny = unsafeCoerce
503−
504−data EventSubscribed x = EventSubscribed
505− { eventSubscribedHeightRef :: {-# UNPACK #-} !(IORef Height)
506− , eventSubscribedRetained :: {-# NOUNPACK #-} !Any
507−#ifdef DEBUG_CYCLES
508− , eventSubscribedGetParents :: !(IO [Some (EventSubscribed x)]) -- For debugging loops
509− , eventSubscribedHasOwnHeightRef :: !Bool
510− , eventSubscribedWhoCreated :: !(IO [String])
511−#endif
512− }
513−
514−eventSubscribedRoot :: RootSubscribed x a -> EventSubscribed x
515−eventSubscribedRoot !r = EventSubscribed
516− { eventSubscribedHeightRef = zeroRef
517− , eventSubscribedRetained = toAny r
518−#ifdef DEBUG_CYCLES
519− , eventSubscribedGetParents = return []
520− , eventSubscribedHasOwnHeightRef = False
521− , eventSubscribedWhoCreated = return ["root"]
522−#endif
523− }
524−
525−eventSubscribedNever :: EventSubscribed x
526−eventSubscribedNever = EventSubscribed
527− { eventSubscribedHeightRef = zeroRef
528− , eventSubscribedRetained = toAny ()
529−#ifdef DEBUG_CYCLES
530− , eventSubscribedGetParents = return []
531− , eventSubscribedHasOwnHeightRef = False
532− , eventSubscribedWhoCreated = return ["never"]
533−#endif
534− }
535−
536−eventSubscribedFan :: FanSubscribed x k -> EventSubscribed x
537−eventSubscribedFan !subscribed = EventSubscribed
538− { eventSubscribedHeightRef = eventSubscribedHeightRef $ _eventSubscription_subscribed $ fanSubscribedParent subscribed
539− , eventSubscribedRetained = toAny subscribed
540−#ifdef DEBUG_CYCLES
541− , eventSubscribedGetParents = return [Some.This $ _eventSubscription_subscribed $ fanSubscribedParent subscribed]
542− , eventSubscribedHasOwnHeightRef = False
543− , eventSubscribedWhoCreated = whoCreatedIORef $ fanSubscribedCachedSubscribed subscribed
544−#endif
545− }
546−
547−eventSubscribedSwitch :: SwitchSubscribed x a -> EventSubscribed x
548−eventSubscribedSwitch !subscribed = EventSubscribed
549− { eventSubscribedHeightRef = switchSubscribedHeight subscribed
550− , eventSubscribedRetained = toAny subscribed
551−#ifdef DEBUG_CYCLES
552− , eventSubscribedGetParents = do
553− s <- readIORef $ switchSubscribedCurrentParent subscribed
554− return [Some.This $ _eventSubscription_subscribed s]
555− , eventSubscribedHasOwnHeightRef = True
556− , eventSubscribedWhoCreated = whoCreatedIORef $ switchSubscribedCachedSubscribed subscribed
557−#endif
558− }
559−
560−eventSubscribedCoincidence :: CoincidenceSubscribed x a -> EventSubscribed x
561−eventSubscribedCoincidence !subscribed = EventSubscribed
562− { eventSubscribedHeightRef = coincidenceSubscribedHeight subscribed
563− , eventSubscribedRetained = toAny subscribed
564−#ifdef DEBUG_CYCLES
565− , eventSubscribedGetParents = do
566− innerSubscription <- readIORef $ coincidenceSubscribedInnerParent subscribed
567− let outerParent = Some.This $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
568− innerParents = maybeToList $ fmap Some.This innerSubscription
569− return $ outerParent : innerParents
570− , eventSubscribedHasOwnHeightRef = True
571− , eventSubscribedWhoCreated = whoCreatedIORef $ coincidenceSubscribedCachedSubscribed subscribed
572−#endif
573− }
574−
575−getEventSubscribedHeight :: EventSubscribed x -> IO Height
576−getEventSubscribedHeight es = readIORef $ eventSubscribedHeightRef es
577−
578−#ifdef DEBUG_CYCLES
579−whoCreatedEventSubscribed :: EventSubscribed x -> IO [String]
580−whoCreatedEventSubscribed = eventSubscribedWhoCreated
581−
582−walkInvalidHeightParents :: EventSubscribed x -> IO [Some (EventSubscribed x)]
583−walkInvalidHeightParents s0 = do
584− subscribers <- flip execStateT mempty $ ($ Some.This s0) $ fix $ \loop (Some.This s) -> do
585− h <- liftIO $ readIORef $ eventSubscribedHeightRef s
586− when (h == invalidHeight) $ do
587− when (eventSubscribedHasOwnHeightRef s) $ liftIO $ writeIORef (eventSubscribedHeightRef s) $! invalidHeightBeingTraversed
588− modify (Some.This s :)
589− mapM_ loop =<< liftIO (eventSubscribedGetParents s)
590− forM_ subscribers $ \(Some.This s) -> writeIORef (eventSubscribedHeightRef s) $! invalidHeight
591− return subscribers
592−#endif
593−
594−{-# INLINE subscribeHoldEvent #-}
595−subscribeHoldEvent :: CanSubscribe x m => Hold x p -> Subscriber x p -> m (EventSubscription x, Maybe p)
596−subscribeHoldEvent = subscribeAndRead . holdEvent
597−
598−--------------------------------------------------------------------------------
599−-- Behavior
600−--------------------------------------------------------------------------------
601−
602−newtype Behavior x a = Behavior { readBehaviorTracked :: BehaviorM x a }
603−
604−behaviorHold :: Hold x p -> Behavior x (PatchTarget p)
605−behaviorHold !h = Behavior $ readHoldTracked h
606−
607−behaviorHoldIdentity :: Hold x (Identity a) -> Behavior x a
608−behaviorHoldIdentity = behaviorHold
609−
610−behaviorConst :: a -> Behavior x a
611−behaviorConst !a = Behavior $ return a
612−
613−behaviorPull :: Pull x a -> Behavior x a
614−behaviorPull !p = Behavior $ do
615− val <- liftIO $ readIORef $ pullValue p
616− case val of
617− Just subscribed -> do
618− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
619− askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (pullSubscribedInvalidators subscribed) (wi:))
620− liftIO $ touch $ pullSubscribedOwnInvalidator subscribed
621− return $ pullSubscribedValue subscribed
622− Nothing -> do
623− i <- liftIO $ newInvalidatorPull p
624− wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorPull"
625− parentsRef <- liftIO $ newIORef []
626− holdInits <- askBehaviorHoldInits
627− a <- liftIO $ runReaderT (unBehaviorM $ pullCompute p) (Just (wi, parentsRef), holdInits)
628− invsRef <- liftIO . newIORef . maybeToList =<< askInvalidator
629− parents <- liftIO $ readIORef parentsRef
630− let subscribed = PullSubscribed
631− { pullSubscribedValue = a
632− , pullSubscribedInvalidators = invsRef
633− , pullSubscribedOwnInvalidator = i
634− , pullSubscribedParents = parents
635− }
636− liftIO $ writeIORef (pullValue p) $ Just subscribed
637− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedPull subscribed) :))
638− return a
639−
640−behaviorDyn :: Patch p => Dyn x p -> Behavior x (PatchTarget p)
641−behaviorDyn !d = Behavior $ readHoldTracked =<< getDynHold d
642−
643−{-# INLINE readHoldTracked #-}
644−readHoldTracked :: Hold x p -> BehaviorM x (PatchTarget p)
645−readHoldTracked h = do
646− result <- liftIO $ readIORef $ holdValue h
647− askInvalidator >>= mapM_ (\wi -> liftIO $ modifyIORef' (holdInvalidators h) (wi:))
648− askParentsRef >>= mapM_ (\r -> liftIO $ modifyIORef' r (SomeBehaviorSubscribed (BehaviorSubscribedHold h) :))
649− return result
650−
651−{-# INLINABLE readBehaviorUntracked #-}
652−readBehaviorUntracked :: Defer (SomeHoldInit x) m => Behavior x a -> m a
653−readBehaviorUntracked b = do
654− holdInits <- getDeferralQueue
655− liftIO $ runBehaviorM (readBehaviorTracked b) Nothing holdInits --TODO: Specialize readBehaviorTracked to the Nothing and Just cases
656−
657−--------------------------------------------------------------------------------
658−-- Dynamic
659−--------------------------------------------------------------------------------
660−
661−data Dynamic x p = Dynamic
662− { dynamicCurrent :: !(Behavior x (PatchTarget p))
663− , dynamicUpdated :: !(Event x p)
664− }
665−
666−dynamicHold :: HasSpiderTimeline x => Hold x p -> Dynamic x p
667−dynamicHold !h = Dynamic
668− { dynamicCurrent = behaviorHold h
669− , dynamicUpdated = eventHold h
670− }
671−
672−dynamicHoldIdentity :: HasSpiderTimeline x => Hold x (Identity a) -> Dynamic x (Identity a)
673−dynamicHoldIdentity = dynamicHold
674−
675−dynamicConst :: PatchTarget p -> Dynamic x p
676−dynamicConst !a = Dynamic
677− { dynamicCurrent = behaviorConst a
678− , dynamicUpdated = eventNever
679− }
680−
681−dynamicDyn :: (HasSpiderTimeline x, Patch p) => Dyn x p -> Dynamic x p
682−dynamicDyn !d = Dynamic
683− { dynamicCurrent = behaviorDyn d
684− , dynamicUpdated = eventDyn d
685− }
686−
687−dynamicDynIdentity :: HasSpiderTimeline x => Dyn x (Identity a) -> Dynamic x (Identity a)
688−dynamicDynIdentity = dynamicDyn
689−
690−--------------------------------------------------------------------------------
691−-- Combinators
692−--------------------------------------------------------------------------------
693−
694−--TODO: Figure out why certain things are not 'representational', then make them
695−--representational so we can use coerce
696−
697−--type role Hold representational
698−data Hold x p
699− = Hold { holdValue :: !(IORef (PatchTarget p))
700− , holdInvalidators :: !(IORef [Weak (Invalidator x)])
701− , holdEvent :: Event x p -- This must be lazy, or holds cannot be defined before their input Events
702− , holdParent :: !(IORef (Maybe (EventSubscription x))) -- Keeps its parent alive (will be undefined until the hold is initialized) --TODO: Probably shouldn't be an IORef
703−#ifdef DEBUG_NODEIDS
704− , holdNodeId :: Int
705−#endif
706− }
707−
708−-- | A statically allocated 'SpiderTimeline'; this is the only instance of
709−-- 'SpiderTimeline' that can used when using
710−-- -fspecialize-to-spidertimeline-global.
711−data Global
712−
713−{-# NOINLINE globalSpiderTimelineEnv #-}
714−globalSpiderTimelineEnv :: SpiderTimelineEnv Global
715−globalSpiderTimelineEnv = unsafePerformIO unsafeNewSpiderTimelineEnv
716−
717−-- | Stores all global data relevant to a particular Spider timeline; only one
718−-- value should exist for each type @x@
719−data SpiderTimelineEnv x = SpiderTimelineEnv
720− { _spiderTimeline_lock :: {-# UNPACK #-} !(MVar ())
721− , _spiderTimeline_eventEnv :: {-# UNPACK #-} !(EventEnv x)
722−#ifdef DEBUG
723− , _spiderTimeline_depth :: {-# UNPACK #-} !(IORef Int)
724−#endif
725− }
726−type role SpiderTimelineEnv nominal
727−
728−instance GEq SpiderTimelineEnv where
729− a `geq` b = if _spiderTimeline_lock a == _spiderTimeline_lock b
730− then Just $ unsafeCoerce Refl -- This unsafeCoerce is safe because the same SpiderTimelineEnv can't have two different 'x' arguments
731− else Nothing
732−
733−data EventEnv x
734− = EventEnv { eventEnvAssignments :: !(IORef [SomeAssignment x]) -- Needed for Subscribe
735− , eventEnvHoldInits :: !(IORef [SomeHoldInit x]) -- Needed for Subscribe
736− , eventEnvMergeUpdates :: !(IORef [SomeMergeUpdate x])
737− , eventEnvMergeInits :: !(IORef [SomeMergeInit x]) -- Needed for Subscribe
738− , eventEnvClears :: !(IORef [SomeClear]) -- Needed for Subscribe
739− , eventEnvRootClears :: !(IORef [SomeRootClear])
740− , eventEnvCurrentHeight :: !(IORef Height) -- Needed for Subscribe
741− , eventEnvResetCoincidences :: !(IORef [SomeResetCoincidence x]) -- Needed for Subscribe
742− , eventEnvDelayedMerges :: !(IORef (IntMap [EventM x ()]))
743− }
744−
745−{-# INLINE runEventM #-}
746−runEventM :: EventM x a -> IO a
747−runEventM = unEventM
748−
749−asksEventEnv :: forall x a. HasSpiderTimeline x => (EventEnv x -> a) -> EventM x a
750−asksEventEnv f = return $ f $ _spiderTimeline_eventEnv (spiderTimeline :: SpiderTimelineEnv x)
751−
752−class MonadIO m => Defer a m where
753− getDeferralQueue :: m (IORef [a])
754−
755−{-# INLINE defer #-}
756−defer :: Defer a m => a -> m ()
757−defer a = do
758− q <- getDeferralQueue
759− liftIO $ modifyIORef' q (a:)
760−
761−instance HasSpiderTimeline x => Defer (SomeAssignment x) (EventM x) where
762− {-# INLINE getDeferralQueue #-}
763− getDeferralQueue = asksEventEnv eventEnvAssignments
764−
765−instance HasSpiderTimeline x => Defer (SomeHoldInit x) (EventM x) where
766− {-# INLINE getDeferralQueue #-}
767− getDeferralQueue = asksEventEnv eventEnvHoldInits
768−
769−instance Defer (SomeHoldInit x) (BehaviorM x) where
770− {-# INLINE getDeferralQueue #-}
771− getDeferralQueue = BehaviorM $ asks snd
772−
773−instance HasSpiderTimeline x => Defer (SomeMergeUpdate x) (EventM x) where
774− {-# INLINE getDeferralQueue #-}
775− getDeferralQueue = asksEventEnv eventEnvMergeUpdates
776−
777−instance HasSpiderTimeline x => Defer (SomeMergeInit x) (EventM x) where
778− {-# INLINE getDeferralQueue #-}
779− getDeferralQueue = asksEventEnv eventEnvMergeInits
780−
781−class HasSpiderTimeline x => HasCurrentHeight x m | m -> x where
782− getCurrentHeight :: m Height
783− scheduleMerge :: Height -> EventM x () -> m ()
784−
785−instance HasSpiderTimeline x => HasCurrentHeight x (EventM x) where
786− {-# INLINE getCurrentHeight #-}
787− getCurrentHeight = do
788− heightRef <- asksEventEnv eventEnvCurrentHeight
789− liftIO $ readIORef heightRef
790− {-# INLINE scheduleMerge #-}
791− scheduleMerge height subscribed = do
792− delayedRef <- asksEventEnv eventEnvDelayedMerges
793− liftIO $ modifyIORef' delayedRef $ IntMap.insertWith (++) (unHeight height) [subscribed]
794−
795−#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
796−class x ~ Global => HasSpiderTimeline x where
797−#else
798−class HasSpiderTimeline x where
799−#endif
800− -- | Retrieve the current SpiderTimelineEnv
801− spiderTimeline :: SpiderTimelineEnv x
802−
803−instance HasSpiderTimeline Global where
804− spiderTimeline = globalSpiderTimelineEnv
805−
806−putCurrentHeight :: HasSpiderTimeline x => Height -> EventM x ()
807−putCurrentHeight h = do
808− heightRef <- asksEventEnv eventEnvCurrentHeight
809− liftIO $ writeIORef heightRef $! h
810−
811−instance HasSpiderTimeline x => Defer SomeClear (EventM x) where
812− {-# INLINE getDeferralQueue #-}
813− getDeferralQueue = asksEventEnv eventEnvClears
814−
815−{-# INLINE scheduleClear #-}
816−scheduleClear :: Defer SomeClear m => IORef (Maybe a) -> m ()
817−scheduleClear r = defer $ SomeClear r
818−
819−instance HasSpiderTimeline x => Defer SomeRootClear (EventM x) where
820− {-# INLINE getDeferralQueue #-}
821− getDeferralQueue = asksEventEnv eventEnvRootClears
822−
823−{-# INLINE scheduleRootClear #-}
824−scheduleRootClear :: Defer SomeRootClear m => IORef (DMap k Identity) -> m ()
825−scheduleRootClear r = defer $ SomeRootClear r
826−
827−instance HasSpiderTimeline x => Defer (SomeResetCoincidence x) (EventM x) where
828− {-# INLINE getDeferralQueue #-}
829− getDeferralQueue = asksEventEnv eventEnvResetCoincidences
830−
831−-- Note: hold cannot examine its event until after the phase is over
832−{-# INLINE [1] hold #-}
833−hold :: (Patch p, Defer (SomeHoldInit x) m) => PatchTarget p -> Event x p -> m (Hold x p)
834−hold v0 e = do
835− valRef <- liftIO $ newIORef v0
836− invsRef <- liftIO $ newIORef []
837− parentRef <- liftIO $ newIORef Nothing
838−#ifdef DEBUG_NODEIDS
839− nodeId <- liftIO newNodeId
840−#endif
841− let h = Hold
842− { holdValue = valRef
843− , holdInvalidators = invsRef
844− , holdEvent = e
845− , holdParent = parentRef
846−#ifdef DEBUG_NODEIDS
847− , holdNodeId = nodeId
848−#endif
849− }
850− defer $ SomeHoldInit h
851− return h
852−
853−{-# INLINE getHoldEventSubscription #-}
854−getHoldEventSubscription :: forall m p x. (Defer (SomeAssignment x) m, Defer (SomeHoldInit x) m, Defer SomeClear m, Patch p, HasCurrentHeight x m, Defer (SomeMergeInit x) m, Defer (SomeResetCoincidence x) m, HasSpiderTimeline x, m ~ EventM x) => Hold x p -> m (EventSubscription x)
855−getHoldEventSubscription h = do
856− ep <- liftIO $ readIORef $ holdParent h
857− case ep of
858− Just subd -> return subd
859− Nothing -> do
860− let e = holdEvent h
861− subscriptionRef <- liftIO $ newIORef $ error "getHoldEventSubscription: subdRef uninitialized"
862− (subscription@(EventSubscription _ _), occ) <- subscribeAndRead e =<< liftIO (newSubscriberHold h)
863− liftIO $ writeIORef subscriptionRef $! subscription
864− case occ of
865− Nothing -> return ()
866− Just o -> do
867− old <- liftIO $ readIORef $ holdValue h
868− case apply o old of
869− Nothing -> return ()
870− Just new -> do
871− -- Need to evaluate these so that we don't retain the Hold itself
872− v <- liftIO $ evaluate $ holdValue h
873− i <- liftIO $ evaluate $ holdInvalidators h
874− defer $ SomeAssignment v i new
875− liftIO $ writeIORef (holdParent h) $ Just subscription
876− return subscription
877−
878−type BehaviorEnv x = (Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]), IORef [SomeHoldInit x])
879−
880−--type role BehaviorM representational
881−-- BehaviorM can sample behaviors
882−newtype BehaviorM x a = BehaviorM { unBehaviorM :: ReaderT (BehaviorEnv x) IO a } deriving (Functor, Applicative, MonadIO, MonadFix)
883−
884−instance Monad (BehaviorM x) where
885− {-# INLINE (>>=) #-}
886− BehaviorM x >>= f = BehaviorM $ x >>= unBehaviorM . f
887− {-# INLINE (>>) #-}
888− BehaviorM x >> BehaviorM y = BehaviorM $ x >> y
889− {-# INLINE return #-}
890− return x = BehaviorM $ return x
891− {-# INLINE fail #-}
892− fail s = BehaviorM $ fail s
893−
894−data BehaviorSubscribed x a
895− = forall p. BehaviorSubscribedHold (Hold x p)
896− | BehaviorSubscribedPull (PullSubscribed x a)
897−
898−data SomeBehaviorSubscribed x = forall a. SomeBehaviorSubscribed (BehaviorSubscribed x a)
899−
900−--type role PullSubscribed representational
901−data PullSubscribed x a
902− = PullSubscribed { pullSubscribedValue :: !a
903− , pullSubscribedInvalidators :: !(IORef [Weak (Invalidator x)])
904− , pullSubscribedOwnInvalidator :: !(Invalidator x)
905− , pullSubscribedParents :: ![SomeBehaviorSubscribed x] -- Need to keep parent behaviors alive, or they won't let us know when they're invalidated
906− }
907−
908−--type role Pull representational
909−data Pull x a
910− = Pull { pullValue :: !(IORef (Maybe (PullSubscribed x a)))
911− , pullCompute :: !(BehaviorM x a)
912−#ifdef DEBUG_NODEIDS
913− , pullNodeId :: Int
914−#endif
915− }
916−
917−data Invalidator x
918− = forall a. InvalidatorPull (Pull x a)
919− | forall a. InvalidatorSwitch (SwitchSubscribed x a)
920−
921−data RootSubscribed x a = forall k. GCompare k => RootSubscribed
922− { rootSubscribedKey :: !(k a)
923− , rootSubscribedCachedSubscribed :: !(IORef (DMap k (RootSubscribed x))) -- From the original Root
924− , rootSubscribedSubscribers :: !(WeakBag (Subscriber x a))
925− , rootSubscribedOccurrence :: !(IO (Maybe a)) -- Lookup from rootOccurrence
926− , rootSubscribedUninit :: IO ()
927− , 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?
928−#ifdef DEBUG_NODEIDS
929− , rootSubscribedNodeId :: Int
930−#endif
931− }
932−
933−data Root x (k :: * -> *)
934− = Root { rootOccurrence :: !(IORef (DMap k Identity)) -- The currently-firing occurrence of this event
935− , rootSubscribed :: !(IORef (DMap k (RootSubscribed x)))
936− , rootInit :: !(forall a. k a -> RootTrigger x a -> IO (IO ()))
937− }
938−
939−data SomeHoldInit x = forall p. Patch p => SomeHoldInit !(Hold x p)
940−
941−data SomeMergeUpdate x = SomeMergeUpdate
942− { _someMergeUpdate_update :: !(EventM x [EventSubscription x])
943− , _someMergeUpdate_invalidateHeight :: !(IO ())
944− , _someMergeUpdate_recalculateHeight :: !(IO ())
945− }
946−
947−newtype SomeMergeInit x = SomeMergeInit { unSomeMergeInit :: EventM x () }
948−
949−-- EventM can do everything BehaviorM can, plus create holds
950−newtype EventM x a = EventM { unEventM :: IO a } deriving (Functor, Applicative, Monad, MonadIO, MonadFix, MonadException, MonadAsyncException) -- The environment should be Nothing if we are not in a frame, and Just if we are - in which case it is a list of assignments to be done after the frame is over
951−
952−newtype ComputeM x a = ComputeM (ReaderT (IORef [SomeHoldInit x]) IO a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
953−
954−instance Defer (SomeHoldInit x) (ComputeM x) where
955− getDeferralQueue = ComputeM ask
956−
957−{-# INLINABLE runComputeM #-}
958−runComputeM :: Defer (SomeHoldInit x) m => ComputeM x a -> m a
959−runComputeM (ComputeM a) = liftIO . runReaderT a =<< getDeferralQueue
960−
961−newtype MergeSubscribedParent x a = MergeSubscribedParent { unMergeSubscribedParent :: EventSubscription x }
962−
963−data HeightBag = HeightBag
964− { _heightBag_size :: {-# UNPACK #-} !Int
965− , _heightBag_contents :: !(IntMap Word) -- Number of excess in each bucket
966− }
967− deriving (Show, Read, Eq, Ord)
968−
969−heightBagEmpty :: HeightBag
970−heightBagEmpty = heightBagVerify $ HeightBag 0 IntMap.empty
971−
972−heightBagSize :: HeightBag -> Int
973−heightBagSize = _heightBag_size
974−
975−heightBagFromList :: [Height] -> HeightBag
976−heightBagFromList heights = heightBagVerify $ foldl' (flip heightBagAdd) heightBagEmpty heights
977−
978−heightBagAdd :: Height -> HeightBag -> HeightBag
979−heightBagAdd (Height h) (HeightBag s c) = heightBagVerify $ HeightBag (succ s) $ IntMap.insertWithKey (\_ _ old -> succ old) h 0 c
980−
981−heightBagRemove :: Height -> HeightBag -> HeightBag
982−heightBagRemove (Height h) b@(HeightBag s c) = heightBagVerify $ case IntMap.lookup h c of
983− Nothing -> error $ "heightBagRemove: Height " <> show h <> " not present in bag " <> show b
984− Just old -> HeightBag (pred s) $ case old of
985− 0 -> IntMap.delete h c
986− _ -> IntMap.insert h (pred old) c
987−
988−heightBagMax :: HeightBag -> Height
989−heightBagMax (HeightBag _ c) = case IntMap.maxViewWithKey c of
990− Just ((h, _), _) -> Height h
991− Nothing -> zeroHeight
992−
993−heightBagVerify :: HeightBag -> HeightBag
994−#ifdef DEBUG
995−heightBagVerify b@(HeightBag s c) = if
996− | s /= IntMap.size c + fromIntegral (sum (IntMap.elems c))
997− -> error $ "heightBagVerify: size doesn't match: " <> show b
998− | unHeight invalidHeight `IntMap.member` c
999− -> error $ "heightBagVerify: contains invalid height: " <> show b
1000− | otherwise -> b
1001−#else
1002−heightBagVerify = id
1003−#endif
1004−
1005−data FanSubscribedChildren (x :: *) k a = FanSubscribedChildren
1006− { _fanSubscribedChildren_list :: !(WeakBag (Subscriber x a))
1007− , _fanSubscribedChildren_self :: {-# NOUNPACK #-} !(k a, FanSubscribed x k)
1008− , _fanSubscribedChildren_weakSelf :: !(IORef (Weak (k a, FanSubscribed x k)))
1009− }
1010−
1011−data FanSubscribed (x :: *) k
1012− = FanSubscribed { fanSubscribedCachedSubscribed :: !(IORef (Maybe (FanSubscribed x k)))
1013− , fanSubscribedOccurrence :: !(IORef (Maybe (DMap k Identity)))
1014− , fanSubscribedSubscribers :: !(IORef (DMap k (FanSubscribedChildren x k))) -- This DMap should never be empty
1015− , fanSubscribedParent :: !(EventSubscription x)
1016−#ifdef DEBUG_NODEIDS
1017− , fanSubscribedNodeId :: Int
1018−#endif
1019− }
1020−
1021−data Fan x k
1022− = Fan { fanParent :: !(Event x (DMap k Identity))
1023− , fanSubscribed :: !(IORef (Maybe (FanSubscribed x k)))
1024− }
1025−
1026−data SwitchSubscribed x a
1027− = SwitchSubscribed { switchSubscribedCachedSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
1028− , switchSubscribedOccurrence :: !(IORef (Maybe a))
1029− , switchSubscribedHeight :: !(IORef Height)
1030− , switchSubscribedSubscribers :: !(WeakBag (Subscriber x a))
1031− , switchSubscribedOwnInvalidator :: {-# NOUNPACK #-} !(Invalidator x)
1032− , switchSubscribedOwnWeakInvalidator :: !(IORef (Weak (Invalidator x)))
1033− , switchSubscribedBehaviorParents :: !(IORef [SomeBehaviorSubscribed x])
1034− , switchSubscribedParent :: !(Behavior x (Event x a))
1035− , switchSubscribedCurrentParent :: !(IORef (EventSubscription x))
1036− , switchSubscribedWeakSelf :: !(IORef (Weak (SwitchSubscribed x a)))
1037−#ifdef DEBUG_NODEIDS
1038− , switchSubscribedNodeId :: Int
1039−#endif
1040− }
1041−
1042−data Switch x a
1043− = Switch { switchParent :: !(Behavior x (Event x a))
1044− , switchSubscribed :: !(IORef (Maybe (SwitchSubscribed x a)))
1045− }
1046−
1047−#ifdef USE_TEMPLATE_HASKELL
1048−{-# ANN CoincidenceSubscribed "HLint: ignore Redundant bracket" #-}
1049−#endif
1050−data CoincidenceSubscribed x a
1051− = CoincidenceSubscribed { coincidenceSubscribedCachedSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
1052− , coincidenceSubscribedOccurrence :: !(IORef (Maybe a))
1053− , coincidenceSubscribedSubscribers :: !(WeakBag (Subscriber x a))
1054− , coincidenceSubscribedHeight :: !(IORef Height)
1055− , coincidenceSubscribedOuter :: {-# NOUNPACK #-} (Subscriber x (Event x a))
1056− , coincidenceSubscribedOuterParent :: !(EventSubscription x)
1057− , coincidenceSubscribedInnerParent :: !(IORef (Maybe (EventSubscribed x)))
1058− , coincidenceSubscribedWeakSelf :: !(IORef (Weak (CoincidenceSubscribed x a)))
1059−#ifdef DEBUG_NODEIDS
1060− , coincidenceSubscribedNodeId :: Int
1061−#endif
1062− }
1063−
1064−data Coincidence x a
1065− = Coincidence { coincidenceParent :: !(Event x (Event x a))
1066− , coincidenceSubscribed :: !(IORef (Maybe (CoincidenceSubscribed x a)))
1067− }
1068−
1069−{-# NOINLINE newInvalidatorSwitch #-}
1070−newInvalidatorSwitch :: SwitchSubscribed x a -> IO (Invalidator x)
1071−newInvalidatorSwitch subd = return $! InvalidatorSwitch subd
1072−
1073−{-# NOINLINE newInvalidatorPull #-}
1074−newInvalidatorPull :: Pull x a -> IO (Invalidator x)
1075−newInvalidatorPull p = return $! InvalidatorPull p
1076−
1077−instance HasSpiderTimeline x => FunctorMaybe (Event x) where
1078− fmapMaybe f = push $ return . f
1079−
1080−instance HasSpiderTimeline x => Align (Event x) where
1081− nil = eventNever
1082− align ea eb = fmapMaybe dmapToThese $ merge $ dynamicConst $ DMap.fromList [LeftTag :=> ea, RightTag :=> eb]
1083−
1084−newtype Dyn x p = Dyn { unDyn :: IORef (Either (BehaviorM x (PatchTarget p), Event x p) (Hold x p)) }
1085−
1086−newMapDyn :: HasSpiderTimeline x => (a -> b) -> Dynamic x (Identity a) -> Dynamic x (Identity b)
1087−newMapDyn f d = dynamicDynIdentity $ unsafeDyn (fmap f $ readBehaviorTracked $ dynamicCurrent d) (Identity . f . runIdentity <$> dynamicUpdated d)
1088−
1089−--TODO: Avoid the duplication between this and R.zipDynWith
1090−zipDynWith :: HasSpiderTimeline x => (a -> b -> c) -> Dynamic x (Identity a) -> Dynamic x (Identity b) -> Dynamic x (Identity c)
1091−zipDynWith f da db =
1092− let eab = align (dynamicUpdated da) (dynamicUpdated db)
1093− ec = flip push eab $ \o -> do
1094− (a, b) <- case o of
1095− This (Identity a) -> do
1096− b <- readBehaviorUntracked $ dynamicCurrent db
1097− return (a, b)
1098− That (Identity b) -> do
1099− a <- readBehaviorUntracked $ dynamicCurrent da
1100− return (a, b)
1101− These (Identity a) (Identity b) -> return (a, b)
1102− return $ Just $ Identity $ f a b
1103− in dynamicDynIdentity $ unsafeDyn (f <$> readBehaviorUntracked (dynamicCurrent da) <*> readBehaviorUntracked (dynamicCurrent db)) ec
1104−
1105−unsafeDyn :: BehaviorM x (PatchTarget p) -> Event x p -> Dyn x p
1106−unsafeDyn readV0 v' = Dyn $ unsafeNewIORef x $ Left x
1107− where x = (readV0, v')
1108−
1109−-- ResultM can read behaviors and events
1110−type ResultM = EventM
1111−
1112−{-# NOINLINE unsafeNewIORef #-}
1113−unsafeNewIORef :: a -> b -> IORef b
1114−unsafeNewIORef _ b = unsafePerformIO $ newIORef b
1115−
1116−instance HasSpiderTimeline x => Functor (Event x) where
1117− fmap f = push $ return . Just . f
1118−
1119−instance Functor (Behavior x) where
1120− fmap f = pull . fmap f . readBehaviorTracked
1121−
1122−{-# INLINE push #-}
1123−push :: HasSpiderTimeline x => (a -> ComputeM x (Maybe b)) -> Event x a -> Event x b
1124−push f e = cacheEvent (pushCheap f e)
1125−
1126−{-# INLINABLE pull #-}
1127−pull :: BehaviorM x a -> Behavior x a
1128−pull a = behaviorPull $ Pull
1129− { pullCompute = a
1130− , pullValue = unsafeNewIORef a Nothing
1131−#ifdef DEBUG_NODEIDS
1132− , pullNodeId = unsafeNodeId a
1133−#endif
1134− }
1135−
1136−{-# INLINABLE switch #-}
1137−switch :: HasSpiderTimeline x => Behavior x (Event x a) -> Event x a
1138−switch a = eventSwitch $ Switch
1139− { switchParent = a
1140− , switchSubscribed = unsafeNewIORef a Nothing
1141− }
1142−
1143−coincidence :: HasSpiderTimeline x => Event x (Event x a) -> Event x a
1144−coincidence a = eventCoincidence $ Coincidence
1145− { coincidenceParent = a
1146− , coincidenceSubscribed = unsafeNewIORef a Nothing
1147− }
1148−
1149−-- Propagate the given event occurrence; before cleaning up, run the given action, which may read the state of events and behaviors
1150−run :: forall x b. HasSpiderTimeline x => [DSum (RootTrigger x) Identity] -> ResultM x b -> SpiderHost x b
1151−run roots after = do
1152− tracePropagate (Proxy :: Proxy x) $ "Running an event frame with " <> show (length roots) <> " events"
1153− t <- SpiderHost ask
1154− result <- SpiderHost $ lift $ withMVar (_spiderTimeline_lock t) $ \_ -> flip runReaderT t $ unSpiderHost $ runFrame $ do
1155− rootsToPropagate <- forM roots $ \r@(RootTrigger (_, occRef, k) :=> a) -> do
1156− occBefore <- liftIO $ do
1157− occBefore <- readIORef occRef
1158− writeIORef occRef $! DMap.insert k a occBefore
1159− return occBefore
1160− if DMap.null occBefore
1161− then do scheduleRootClear occRef
1162− return $ Just r
1163− else return Nothing
1164− forM_ (catMaybes rootsToPropagate) $ \(RootTrigger (subscribersRef, _, _) :=> Identity a) -> do
1165− propagate a subscribersRef
1166− delayedRef <- asksEventEnv eventEnvDelayedMerges
1167− let go = do
1168− delayed <- liftIO $ readIORef delayedRef
1169− case IntMap.minViewWithKey delayed of
1170− Nothing -> return ()
1171− Just ((currentHeight, cur), future) -> do
1172− tracePropagate (Proxy :: Proxy x) $ "Running height " ++ show currentHeight
1173− putCurrentHeight $ Height currentHeight
1174− liftIO $ writeIORef delayedRef $! future
1175− sequence_ cur
1176− go
1177− go
1178− putCurrentHeight maxBound
1179− after
1180− tracePropagate (Proxy :: Proxy x) "Done running an event frame"
1181− return result
1182−
1183−scheduleMerge' :: HasSpiderTimeline x => Height -> IORef Height -> EventM x () -> EventM x ()
1184−scheduleMerge' initialHeight heightRef a = scheduleMerge initialHeight $ do
1185− height <- liftIO $ readIORef heightRef
1186− currentHeight <- getCurrentHeight
1187− case height `compare` currentHeight of
1188− LT -> error "Somehow a merge's height has been decreased after it was scheduled"
1189− GT -> scheduleMerge' height heightRef a -- The height has been increased (by a coincidence event; TODO: is this the only way?)
1190− EQ -> a
1191−
1192−data SomeClear = forall a. SomeClear (IORef (Maybe a))
1193−
1194−data SomeRootClear = forall k. SomeRootClear (IORef (DMap k Identity))
1195−
1196−data SomeAssignment x = forall a. SomeAssignment {-# UNPACK #-} !(IORef a) {-# UNPACK #-} !(IORef [Weak (Invalidator x)]) a
1197−
1198−debugFinalize :: Bool
1199−debugFinalize = False
1200−
1201−mkWeakPtrWithDebug :: a -> String -> IO (Weak a)
1202−mkWeakPtrWithDebug x debugNote = do
1203− x' <- evaluate x
1204− mkWeakPtr x' $
1205− if debugFinalize
1206− then Just $ putStrLn $ "finalizing: " ++ debugNote
1207− else Nothing
1208−
1209−type WeakList a = [Weak a]
1210−
1211−{-# INLINE withIncreasedDepth #-}
1212−#ifdef DEBUG
1213−withIncreasedDepth :: CanTrace x m => m a -> m a
1214−withIncreasedDepth a = do
1215− spiderTimeline <- askSpiderTimelineEnv
1216− liftIO $ modifyIORef' (_spiderTimeline_depth spiderTimeline) succ
1217− result <- a
1218− liftIO $ modifyIORef' (_spiderTimeline_depth spiderTimeline) pred
1219− return result
1220−#else
1221−withIncreasedDepth :: m a -> m a
1222−withIncreasedDepth = id
1223−#endif
1224−
1225−type CanTrace x m = (HasSpiderTimeline x, MonadIO m)
1226−
1227−{-# INLINE tracePropagate #-}
1228−tracePropagate :: (CanTrace x m) => proxy x -> String -> m ()
1229−tracePropagate p = traceWhen p debugPropagate
1230−
1231−{-# INLINE traceInvalidate #-}
1232−traceInvalidate :: String -> IO ()
1233−traceInvalidate = when debugInvalidate . liftIO . putStrLn
1234−
1235−{-# INLINE traceWhen #-}
1236−traceWhen :: (CanTrace x m) => proxy x -> Bool -> String -> m ()
1237−traceWhen p b message = traceMWhen p b $ return message
1238−
1239−{-# INLINE traceMWhen #-}
1240−traceMWhen :: (CanTrace x m) => proxy x -> Bool -> m String -> m ()
1241−traceMWhen _ b getMessage = when b $ do
1242− message <- getMessage
1243−#ifdef DEBUG
1244− spiderTimeline <- askSpiderTimelineEnv
1245− d <- liftIO $ readIORef $ _spiderTimeline_depth spiderTimeline
1246−#else
1247− let d = 0
1248−#endif
1249− liftIO $ putStrLn $ replicate d ' ' <> message
1250−
1251−whoCreatedIORef :: IORef a -> IO [String]
1252−whoCreatedIORef (IORef a) = whoCreated $! a
1253−
1254−#ifdef DEBUG_CYCLES
1255−groupByHead :: Eq a => [NonEmpty a] -> [(a, NonEmpty [a])]
1256−groupByHead = \case
1257− [] -> []
1258− (x :| xs) : t -> case groupByHead t of
1259− [] -> [(x, xs :| [])]
1260− l@((y, yss) : t')
1261− | x == y -> (x, xs `NonEmpty.cons` yss) : t'
1262− | otherwise -> (x, xs :| []) : l
1263−
1264−listsToForest :: Eq a => [[a]] -> Forest a
1265−listsToForest l = fmap (\(a, l') -> Node a $ listsToForest $ toList l') $ groupByHead $ catMaybes $ fmap nonEmpty l
1266−#endif
1267−
1268−{-# INLINE propagateSubscriberHold #-}
1269−propagateSubscriberHold :: forall x p. (HasSpiderTimeline x, Patch p) => Hold x p -> p -> EventM x ()
1270−propagateSubscriberHold h a = do
1271− {-# SCC "trace" #-} traceMWhen (Proxy :: Proxy x) debugPropagate $ liftIO $ do
1272− invalidators <- liftIO $ readIORef $ holdInvalidators h
1273− return $ "SubscriberHold" <> showNodeId h <> ": " ++ show (length invalidators)
1274− v <- {-# SCC "read" #-} liftIO $ readIORef $ holdValue h
1275− case {-# SCC "apply" #-} apply a v of
1276− Nothing -> return ()
1277− Just v' -> do
1278− {-# SCC "trace2" #-} withIncreasedDepth $ tracePropagate (Proxy :: Proxy x) $ "propagateSubscriberHold: assigning Hold" <> showNodeId h
1279− vRef <- {-# SCC "vRef" #-} liftIO $ evaluate $ holdValue h
1280− iRef <- {-# SCC "iRef" #-} liftIO $ evaluate $ holdInvalidators h
1281− defer $ {-# SCC "assignment" #-} SomeAssignment vRef iRef v'
1282−
1283−data SomeResetCoincidence x = forall a. SomeResetCoincidence !(EventSubscription x) !(Maybe (CoincidenceSubscribed x a)) -- The CoincidenceSubscriber will be present only if heights need to be reset
1284−
1285−runBehaviorM :: BehaviorM x a -> Maybe (Weak (Invalidator x), IORef [SomeBehaviorSubscribed x]) -> IORef [SomeHoldInit x] -> IO a
1286−runBehaviorM a mwi holdInits = runReaderT (unBehaviorM a) (mwi, holdInits)
1287−
1288−askInvalidator :: BehaviorM x (Maybe (Weak (Invalidator x)))
1289−askInvalidator = do
1290− (!m, _) <- BehaviorM ask
1291− case m of
1292− Nothing -> return Nothing
1293− Just (!wi, _) -> return $ Just wi
1294−
1295−askParentsRef :: BehaviorM x (Maybe (IORef [SomeBehaviorSubscribed x]))
1296−askParentsRef = do
1297− (!m, _) <- BehaviorM ask
1298− case m of
1299− Nothing -> return Nothing
1300− Just (_, !p) -> return $ Just p
1301−
1302−askBehaviorHoldInits :: BehaviorM x (IORef [SomeHoldInit x])
1303−askBehaviorHoldInits = do
1304− (_, !his) <- BehaviorM ask
1305− return his
1306−
1307−{-# INLINE getDynHold #-}
1308−getDynHold :: (Defer (SomeHoldInit x) m, Patch p) => Dyn x p -> m (Hold x p)
1309−getDynHold d = do
1310− mh <- liftIO $ readIORef $ unDyn d
1311− case mh of
1312− Right h -> return h
1313− Left (readV0, v') -> do
1314− holdInits <- getDeferralQueue
1315− v0 <- liftIO $ runBehaviorM readV0 Nothing holdInits
1316− h <- hold v0 v'
1317− liftIO $ writeIORef (unDyn d) $ Right h
1318− return h
1319−
1320−-- Always refers to 0
1321−{-# NOINLINE zeroRef #-}
1322−zeroRef :: IORef Height
1323−zeroRef = unsafePerformIO $ newIORef zeroHeight
1324−
1325−type CanSubscribe x m =
1326− ( HasSpiderTimeline x
1327− , HasCurrentHeight x m
1328− , Defer (SomeHoldInit x) m, Defer (SomeMergeInit x) m -- The things we need to lazily initialize state
1329− , Defer SomeClear m -- Wiping out event firings
1330− , Defer (SomeAssignment x) m -- Updating state
1331− , Defer (SomeResetCoincidence x) m
1332− , m ~ EventM x
1333− )
1334−
1335−getRootSubscribed :: GCompare k => k a -> Root x k -> Subscriber x a -> IO (WeakBagTicket, RootSubscribed x a, Maybe a)
1336−getRootSubscribed k r sub = do
1337− mSubscribed <- readIORef $ rootSubscribed r
1338− let getOcc = fmap (coerce . DMap.lookup k) $ readIORef $ rootOccurrence r
1339− case DMap.lookup k mSubscribed of
1340− Just subscribed -> {-# SCC "hitRoot" #-} do
1341− sln <- subscribeRootSubscribed subscribed sub
1342− occ <- getOcc
1343− return (sln, subscribed, occ)
1344− Nothing -> {-# SCC "missRoot" #-} do
1345− weakSelf <- newIORef $ error "getRootSubscribed: weakSelfRef not initialized"
1346− let !cached = rootSubscribed r
1347− uninitRef <- newIORef $ error "getRootsubscribed: uninitRef not initialized"
1348− (subs, sln) <- WeakBag.singleton sub weakSelf cleanupRootSubscribed
1349− when debugPropagate $ putStrLn $ "getRootSubscribed: calling rootInit"
1350− uninit <- rootInit r k $ RootTrigger (subs, rootOccurrence r, k)
1351− writeIORef uninitRef $! uninit
1352− let subscribed = RootSubscribed
1353− { rootSubscribedKey = k
1354− , rootSubscribedCachedSubscribed = cached
1355− , rootSubscribedOccurrence = getOcc
1356− , rootSubscribedSubscribers = subs
1357− , rootSubscribedUninit = uninit
1358− , rootSubscribedWeakSelf = weakSelf
1359−#ifdef DEBUG_NODEIDS
1360− , rootSubscribedNodeId = unsafeNodeId (k, r, subs)
1361−#endif
1362− }
1363− writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "RootSubscribed"
1364− 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
1365− occ <- getOcc
1366− return (sln, subscribed, occ)
1367−
1368−#ifdef USE_TEMPLATE_HASKELL
1369−{-# ANN cleanupRootSubscribed "HLint: ignore Redundant bracket" #-}
1370−#endif
1371−cleanupRootSubscribed :: RootSubscribed x a -> IO ()
1372−cleanupRootSubscribed self@RootSubscribed { rootSubscribedKey = k, rootSubscribedCachedSubscribed = cached } = do
1373− rootSubscribedUninit self
1374− modifyIORef' cached $ DMap.delete k
1375−
1376−{-# INLINE subscribeRootSubscribed #-}
1377−subscribeRootSubscribed :: RootSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1378−subscribeRootSubscribed subscribed sub = WeakBag.insert sub (rootSubscribedSubscribers subscribed) (rootSubscribedWeakSelf subscribed) cleanupRootSubscribed
1379−
1380−{-# INLINABLE getFanSubscribed #-}
1381−getFanSubscribed :: (Defer (SomeAssignment x) m, Defer (SomeHoldInit x) m, Defer (SomeMergeInit x) m, Defer SomeClear m, HasCurrentHeight x m, Defer (SomeResetCoincidence x) m, HasSpiderTimeline x, m ~ EventM x, GCompare k) => k a -> Fan x k -> Subscriber x a -> m (WeakBagTicket, FanSubscribed x k, Maybe a)
1382−getFanSubscribed k f sub = do
1383− mSubscribed <- liftIO $ readIORef $ fanSubscribed f
1384− case mSubscribed of
1385− Just subscribed -> {-# SCC "hitFan" #-} liftIO $ do
1386− sln <- subscribeFanSubscribed k subscribed sub
1387− occ <- readIORef $ fanSubscribedOccurrence subscribed
1388− return (sln, subscribed, coerce $ DMap.lookup k =<< occ)
1389− Nothing -> {-# SCC "missFan" #-} do
1390− subscribedRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribedRef not yet initialized"
1391− subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1392− s <- liftIO $ newSubscriberFan subscribedUnsafe
1393− (subscription, parentOcc) <- subscribeAndRead (fanParent f) s
1394− weakSelf <- liftIO $ newIORef $ error "getFanSubscribed: weakSelf not yet initialized"
1395− (subsForK, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupFanSubscribed
1396− subscribersRef <- liftIO $ newIORef $ error "getFanSubscribed: subscribersRef not yet initialized"
1397− occRef <- liftIO $ newIORef parentOcc
1398− when (isJust parentOcc) $ scheduleClear occRef
1399− let subscribed = FanSubscribed
1400− { fanSubscribedCachedSubscribed = fanSubscribed f
1401− , fanSubscribedOccurrence = occRef
1402− , fanSubscribedParent = subscription
1403− , fanSubscribedSubscribers = subscribersRef
1404−#ifdef DEBUG_NODEIDS
1405− , fanSubscribedNodeId = unsafeNodeId f
1406−#endif
1407− }
1408− let !self = (k, subscribed)
1409− liftIO $ writeIORef subscribersRef $! DMap.singleton k $ FanSubscribedChildren subsForK self weakSelf
1410− liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug self "FanSubscribed"
1411− liftIO $ writeIORef subscribedRef $! subscribed
1412− liftIO $ writeIORef (fanSubscribed f) $ Just subscribed
1413− return (slnForSub, subscribed, coerce $ DMap.lookup k =<< parentOcc)
1414−
1415−cleanupFanSubscribed :: GCompare k => (k a, FanSubscribed x k) -> IO ()
1416−cleanupFanSubscribed (k, subscribed) = do
1417− subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1418− let reducedSubscribers = DMap.delete k subscribers
1419− if DMap.null reducedSubscribers
1420− then do
1421− unsubscribe $ fanSubscribedParent subscribed
1422− -- Not necessary in this case, because this whole FanSubscribed is dead: writeIORef (fanSubscribedSubscribers subscribed) reducedSubscribers
1423− writeIORef (fanSubscribedCachedSubscribed subscribed) Nothing
1424− else writeIORef (fanSubscribedSubscribers subscribed) $! reducedSubscribers
1425−
1426−{-# INLINE subscribeFanSubscribed #-}
1427−subscribeFanSubscribed :: GCompare k => k a -> FanSubscribed x k -> Subscriber x a -> IO WeakBagTicket
1428−subscribeFanSubscribed k subscribed sub = do
1429− subscribers <- readIORef $ fanSubscribedSubscribers subscribed
1430− case DMap.lookup k subscribers of
1431− Nothing -> {-# SCC "missSubscribeFanSubscribed" #-} do
1432− let !self = (k, subscribed)
1433− weakSelf <- newIORef =<< mkWeakPtrWithDebug self "FanSubscribed"
1434− (list, sln) <- WeakBag.singleton sub weakSelf cleanupFanSubscribed
1435− writeIORef (fanSubscribedSubscribers subscribed) $! DMap.insertWith (error "subscribeFanSubscribed: key that we just failed to find is present - should be impossible") k (FanSubscribedChildren list self weakSelf) subscribers
1436− return sln
1437− Just (FanSubscribedChildren list _ weakSelf) -> {-# SCC "hitSubscribeFanSubscribed" #-} WeakBag.insert sub list weakSelf cleanupFanSubscribed
1438−
1439−{-# INLINABLE getSwitchSubscribed #-}
1440−getSwitchSubscribed :: (Defer (SomeHoldInit x) m, Defer (SomeAssignment x) m, Defer (SomeMergeInit x) m, Defer SomeClear m, Defer (SomeResetCoincidence x) m, HasCurrentHeight x m, HasSpiderTimeline x, m ~ EventM x) => Switch x a -> Subscriber x a -> m (WeakBagTicket, SwitchSubscribed x a, Maybe a)
1441−getSwitchSubscribed s sub = do
1442− mSubscribed <- liftIO $ readIORef $ switchSubscribed s
1443− case mSubscribed of
1444− Just subscribed -> {-# SCC "hitSwitch" #-} liftIO $ do
1445− sln <- subscribeSwitchSubscribed subscribed sub
1446− occ <- readIORef $ switchSubscribedOccurrence subscribed
1447− return (sln, subscribed, occ)
1448− Nothing -> {-# SCC "missSwitch" #-} do
1449− subscribedRef <- liftIO $ newIORef $ error "getSwitchSubscribed: subscribed has not yet been created"
1450− subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1451− i <- liftIO $ newInvalidatorSwitch subscribedUnsafe
1452− mySub <- liftIO $ newSubscriberSwitch subscribedUnsafe
1453− wi <- liftIO $ mkWeakPtrWithDebug i "InvalidatorSwitch"
1454− wiRef <- liftIO $ newIORef wi
1455− parentsRef <- liftIO $ newIORef [] --TODO: This should be unnecessary, because it will always be filled with just the single parent behavior
1456− holdInits <- getDeferralQueue
1457− e <- liftIO $ runBehaviorM (readBehaviorTracked (switchParent s)) (Just (wi, parentsRef)) holdInits
1458− (subscription@(EventSubscription _ subd), parentOcc) <- subscribeAndRead e mySub
1459− heightRef <- liftIO $ newIORef =<< getEventSubscribedHeight subd
1460− subscriptionRef <- liftIO $ newIORef subscription
1461− occRef <- liftIO $ newIORef parentOcc
1462− when (isJust parentOcc) $ scheduleClear occRef
1463− weakSelf <- liftIO $ newIORef $ error "getSwitchSubscribed: weakSelf not yet initialized"
1464− (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupSwitchSubscribed
1465− let !subscribed = SwitchSubscribed
1466− { switchSubscribedCachedSubscribed = switchSubscribed s
1467− , switchSubscribedOccurrence = occRef
1468− , switchSubscribedHeight = heightRef
1469− , switchSubscribedSubscribers = subs
1470− , switchSubscribedOwnInvalidator = i
1471− , switchSubscribedOwnWeakInvalidator = wiRef
1472− , switchSubscribedBehaviorParents = parentsRef
1473− , switchSubscribedParent = switchParent s
1474− , switchSubscribedCurrentParent = subscriptionRef
1475− , switchSubscribedWeakSelf = weakSelf
1476−#ifdef DEBUG_NODEIDS
1477− , switchSubscribedNodeId = unsafeNodeId s
1478−#endif
1479− }
1480− liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "switchSubscribedWeakSelf"
1481− liftIO $ writeIORef subscribedRef $! subscribed
1482− liftIO $ writeIORef (switchSubscribed s) $ Just subscribed
1483− return (slnForSub, subscribed, parentOcc)
1484−
1485−cleanupSwitchSubscribed :: SwitchSubscribed x a -> IO ()
1486−cleanupSwitchSubscribed subscribed = do
1487− unsubscribe =<< readIORef (switchSubscribedCurrentParent subscribed)
1488− finalize =<< readIORef (switchSubscribedOwnWeakInvalidator subscribed) -- We don't need to get invalidated if we're dead
1489− writeIORef (switchSubscribedCachedSubscribed subscribed) Nothing
1490−
1491−{-# INLINE subscribeSwitchSubscribed #-}
1492−subscribeSwitchSubscribed :: SwitchSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1493−subscribeSwitchSubscribed subscribed sub = WeakBag.insert sub (switchSubscribedSubscribers subscribed) (switchSubscribedWeakSelf subscribed) cleanupSwitchSubscribed
1494−
1495−{-# INLINABLE getCoincidenceSubscribed #-}
1496−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, HasSpiderTimeline x, m ~ EventM x) => Coincidence x a -> Subscriber x a -> m (WeakBagTicket, CoincidenceSubscribed x a, Maybe a)
1497−getCoincidenceSubscribed c sub = do
1498− mSubscribed <- liftIO $ readIORef $ coincidenceSubscribed c
1499− case mSubscribed of
1500− Just subscribed -> {-# SCC "hitCoincidence" #-} liftIO $ do
1501− sln <- subscribeCoincidenceSubscribed subscribed sub
1502− occ <- readIORef $ coincidenceSubscribedOccurrence subscribed
1503− return (sln, subscribed, occ)
1504− Nothing -> {-# SCC "missCoincidence" #-} do
1505− subscribedRef <- liftIO $ newIORef $ error "getCoincidenceSubscribed: subscribed has not yet been created"
1506− subscribedUnsafe <- liftIO $ unsafeInterleaveIO $ readIORef subscribedRef
1507− subOuter <- liftIO $ newSubscriberCoincidenceOuter subscribedUnsafe
1508− (outerSubscription@(EventSubscription _ outerSubd), outerOcc) <- subscribeAndRead (coincidenceParent c) subOuter
1509− outerHeight <- liftIO $ getEventSubscribedHeight outerSubd
1510− (occ, height, mInnerSubd) <- case outerOcc of
1511− Nothing -> return (Nothing, outerHeight, Nothing)
1512− Just o -> do
1513− (occ, height, innerSubd) <- subscribeCoincidenceInner o outerHeight subscribedUnsafe
1514− return (occ, height, Just innerSubd)
1515− occRef <- liftIO $ newIORef occ
1516− when (isJust occ) $ scheduleClear occRef
1517− heightRef <- liftIO $ newIORef height
1518− innerSubdRef <- liftIO $ newIORef mInnerSubd
1519− scheduleClear innerSubdRef
1520− weakSelf <- liftIO $ newIORef $ error "getCoincidenceSubscribed: weakSelf not yet implemented"
1521− (subs, slnForSub) <- liftIO $ WeakBag.singleton sub weakSelf cleanupCoincidenceSubscribed
1522− let subscribed = CoincidenceSubscribed
1523− { coincidenceSubscribedCachedSubscribed = coincidenceSubscribed c
1524− , coincidenceSubscribedOccurrence = occRef
1525− , coincidenceSubscribedHeight = heightRef
1526− , coincidenceSubscribedSubscribers = subs
1527− , coincidenceSubscribedOuter = subOuter
1528− , coincidenceSubscribedOuterParent = outerSubscription
1529− , coincidenceSubscribedInnerParent = innerSubdRef
1530− , coincidenceSubscribedWeakSelf = weakSelf
1531−#ifdef DEBUG_NODEIDS
1532− , coincidenceSubscribedNodeId = unsafeNodeId c
1533−#endif
1534− }
1535− liftIO $ writeIORef weakSelf =<< evaluate =<< mkWeakPtrWithDebug subscribed "CoincidenceSubscribed"
1536− liftIO $ writeIORef subscribedRef $! subscribed
1537− liftIO $ writeIORef (coincidenceSubscribed c) $ Just subscribed
1538− return (slnForSub, subscribed, occ)
1539−
1540−cleanupCoincidenceSubscribed :: CoincidenceSubscribed x a -> IO ()
1541−cleanupCoincidenceSubscribed subscribed = do
1542− unsubscribe $ coincidenceSubscribedOuterParent subscribed
1543− writeIORef (coincidenceSubscribedCachedSubscribed subscribed) Nothing
1544−
1545−{-# INLINE subscribeCoincidenceSubscribed #-}
1546−subscribeCoincidenceSubscribed :: CoincidenceSubscribed x a -> Subscriber x a -> IO WeakBagTicket
1547−subscribeCoincidenceSubscribed subscribed sub = WeakBag.insert sub (coincidenceSubscribedSubscribers subscribed) (coincidenceSubscribedWeakSelf subscribed) cleanupCoincidenceSubscribed
1548−
1549−{-# INLINE merge #-}
1550−merge :: forall k x. (HasSpiderTimeline x, GCompare k) => Dynamic x (PatchDMap k (Event x)) -> Event x (DMap k Identity)
1551−merge d = cacheEvent (mergeCheap d)
1552−
1553−{-# INLINE [1] mergeCheap #-}
1554−mergeCheap :: forall k x. (HasSpiderTimeline x, GCompare k) => Dynamic x (PatchDMap k (Event x)) -> Event x (DMap k Identity)
1555−mergeCheap d = Event $ \sub -> do
1556− initialParents <- readBehaviorUntracked $ dynamicCurrent d
1557− accumRef <- liftIO $ newIORef $ error "merge: accumRef not yet initialized"
1558− heightRef <- liftIO $ newIORef $ error "merge: heightRef not yet initialized"
1559− heightBagRef <- liftIO $ newIORef $ error "merge: heightBagRef not yet initialized"
1560− parentsRef <- liftIO $ newIORef $ error "merge: parentsRef not yet initialized"
1561− let scheduleSelf height = scheduleMerge' height heightRef $ do
1562− m <- liftIO $ readIORef accumRef
1563− liftIO $ writeIORef accumRef $! DMap.empty
1564− --TODO: Assert that m is not empty
1565− subscriberPropagate sub m
1566− invalidateMyHeight = do
1567− oldHeight <- readIORef heightRef
1568− when (oldHeight /= invalidHeight) $ do -- If the height used to be valid, it must be invalid now; we should never have *more* heights than we have parents
1569− writeIORef heightRef $! invalidHeight
1570− subscriberInvalidateHeight sub oldHeight
1571− revalidateMyHeight = do
1572− currentHeight <- readIORef heightRef
1573− when (currentHeight == invalidHeight) $ do -- revalidateMergeHeight may be called multiple times; perhaps the's a way to finesse it to avoid this check
1574− heights <- readIORef heightBagRef
1575− parents <- readIORef parentsRef
1576− -- When the number of heights in the bag reaches the number of parents, we should have a valid height
1577− case heightBagSize heights `compare` DMap.size parents of
1578− LT -> return ()
1579− EQ -> do
1580− let height = succHeight $ heightBagMax heights
1581− when debugInvalidateHeight $ putStrLn $ "recalculateSubscriberHeight: height: " <> show height
1582− writeIORef heightRef $! height
1583− subscriberRecalculateHeight sub height
1584− GT -> error $ "revalidateMergeHeight: more heights than parents for Merge"
1585− subscriber :: forall a. k a -> Subscriber x a
1586− subscriber k = Subscriber
1587− { subscriberPropagate = \a -> do
1588− oldM <- liftIO $ readIORef accumRef
1589− let newM = DMap.insertWith (error $ "Same key fired multiple times for Merge") k (Identity a) oldM
1590− tracePropagate (Proxy :: Proxy x) $ " DMap.size oldM = " <> show (DMap.size oldM) <> "; DMap.size newM = " <> show (DMap.size newM)
1591− liftIO $ writeIORef accumRef $! newM
1592− when (DMap.null oldM) $ do -- Only schedule the firing once
1593− height <- liftIO $ readIORef heightRef
1594− --TODO: assertions about height
1595− currentHeight <- getCurrentHeight
1596− when (height <= currentHeight) $ do
1597− if height /= invalidHeight
1598− then do
1599− myStack <- liftIO $ whoCreatedIORef undefined --TODO
1600− error $ "Height (" ++ show height ++ ") is not greater than current height (" ++ show currentHeight ++ ")\n" ++ unlines (reverse myStack)
1601− else liftIO $ do
1602−#ifdef DEBUG_CYCLES
1603− nodesInvolvedInCycle <- walkInvalidHeightParents $ eventSubscribedMerge subscribed
1604− stacks <- forM nodesInvolvedInCycle $ \(Some.This es) -> whoCreatedEventSubscribed es
1605− let cycleInfo = ":\n" <> drawForest (listsToForest stacks)
1606−#else
1607− let cycleInfo = ""
1608−#endif
1609− error $ "Causality loop found" <> cycleInfo
1610− scheduleSelf height
1611− , subscriberInvalidateHeight = \old -> do --TODO: When removing a parent doesn't actually change the height, maybe we can avoid invalidating
1612− modifyIORef' heightBagRef $ heightBagRemove old
1613− invalidateMyHeight
1614− , subscriberRecalculateHeight = \new -> do
1615− modifyIORef' heightBagRef $ heightBagAdd new
1616− revalidateMyHeight
1617− }
1618− subscribers :: [(Maybe (DSum k Identity), Height, DSum k (MergeSubscribedParent x))] <- forM (DMap.toList initialParents) $ \(k :=> e) -> do
1619− let s = subscriber k
1620− (subscription@(EventSubscription _ parentSubd), parentOcc) <- subscribeAndRead e s
1621− height <- liftIO $ getEventSubscribedHeight parentSubd
1622− return $ (fmap (\x -> k :=> Identity x) parentOcc, height, k :=> MergeSubscribedParent subscription)
1623− let dm = DMap.fromDistinctAscList $ mapMaybe (\(x, _, _) -> x) subscribers
1624− heights = fmap (\(_, h, _) -> h) subscribers --TODO: Assert that there's no invalidHeight in here
1625− myHeightBag = heightBagFromList $ filter (/= invalidHeight) heights
1626− myHeight = if invalidHeight `elem` heights
1627− then invalidHeight
1628− else succHeight $ heightBagMax myHeightBag
1629− currentHeight <- getCurrentHeight
1630− let (occ, accum) = if currentHeight >= myHeight -- If we should have fired by now
1631− then (if DMap.null dm then Nothing else Just dm, DMap.empty)
1632− else (Nothing, dm)
1633− unless (DMap.null accum) $ do
1634− scheduleSelf myHeight
1635− occRef <- liftIO $ newIORef occ
1636− when (isJust occ) $ scheduleClear occRef
1637− liftIO $ writeIORef accumRef $! accum
1638− liftIO $ writeIORef heightRef $! myHeight
1639− liftIO $ writeIORef heightBagRef $! myHeightBag
1640− changeSubdRef <- liftIO $ newIORef $ error "getMergeSubscribed: changeSubdRef not yet initialized"
1641− liftIO $ writeIORef parentsRef $! DMap.fromDistinctAscList $ map (\(_, _, x) -> x) subscribers
1642− let updateMe (PatchDMap p) = do
1643− oldParents <- liftIO $ readIORef parentsRef
1644− let f (subscriptionsToKill, ps) (k :=> ComposeMaybe me) = do
1645− (mOldSubd, newPs) <- case me of
1646− Nothing -> return $ DMap.updateLookupWithKey (\_ _ -> Nothing) k ps
1647− Just e -> do
1648− let s = subscriber k
1649− subscription@(EventSubscription _ subd) <- subscribe e s
1650− newParentHeight <- liftIO $ getEventSubscribedHeight subd
1651− let newParent = MergeSubscribedParent subscription
1652− liftIO $ modifyIORef' heightBagRef $ heightBagAdd newParentHeight
1653− return $ DMap.insertLookupWithKey' (\_ new _ -> new) k newParent ps
1654− forM_ mOldSubd $ \oldSubd -> do
1655− oldHeight <- liftIO $ getEventSubscribedHeight $ _eventSubscription_subscribed $ unMergeSubscribedParent oldSubd
1656− liftIO $ modifyIORef heightBagRef $ heightBagRemove oldHeight
1657− return (maybeToList (unMergeSubscribedParent <$> mOldSubd) ++ subscriptionsToKill, newPs)
1658− (subscriptionsToKill, newParents) <- 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
1659− liftIO $ writeIORef parentsRef $! newParents
1660− return subscriptionsToKill
1661− defer $ SomeMergeInit $ do
1662− let s = Subscriber
1663− { subscriberPropagate = \a -> {-# SCC "traverseMergeChange" #-} do
1664− tracePropagate (Proxy :: Proxy x) $ "SubscriberMerge/Change"
1665− defer $ SomeMergeUpdate (updateMe a) invalidateMyHeight revalidateMyHeight
1666− , subscriberInvalidateHeight = \_ -> return ()
1667− , subscriberRecalculateHeight = \_ -> return ()
1668− }
1669− (EventSubscription sln changeSubscription, change) <- subscribeAndRead (dynamicUpdated d) s
1670− forM_ change $ \c -> defer $ SomeMergeUpdate (updateMe c) invalidateMyHeight revalidateMyHeight
1671− -- We explicitly hold on to the unsubscribe function from subscribing to the update event.
1672− -- If we don't do this, there are certain cases where mergeCheap will fail to properly retain
1673− -- its subscription.
1674− liftIO $ writeIORef changeSubdRef (s, sln, changeSubscription)
1675− let unsubscribeAll = do
1676− parents <- readIORef parentsRef
1677− forM_ (DMap.toList parents) $ \(_ :=> MergeSubscribedParent s) -> unsubscribe s
1678− return ( EventSubscription unsubscribeAll $ EventSubscribed heightRef $ toAny (parentsRef, changeSubdRef)
1679− , occ
1680− )
1681−
1682−newtype EventSelector x k = EventSelector { select :: forall a. k a -> Event x a }
1683−
1684−fan :: (HasSpiderTimeline x, GCompare k) => Event x (DMap k Identity) -> EventSelector x k
1685−fan e =
1686− let f = Fan
1687− { fanParent = e
1688− , fanSubscribed = unsafeNewIORef e Nothing
1689− }
1690− in EventSelector $ \k -> eventFan k f
1691−
1692−runHoldInits :: HasSpiderTimeline x => IORef [SomeHoldInit x] -> IORef [SomeMergeInit x] -> EventM x ()
1693−runHoldInits holdInitRef mergeInitRef = do
1694− holdInits <- liftIO $ readIORef holdInitRef
1695− mergeInits <- liftIO $ readIORef mergeInitRef
1696− unless (null holdInits && null mergeInits) $ do
1697− liftIO $ writeIORef holdInitRef []
1698− liftIO $ writeIORef mergeInitRef []
1699− mapM_ initHold holdInits
1700− mapM_ unSomeMergeInit mergeInits
1701− runHoldInits holdInitRef mergeInitRef
1702−
1703−initHold :: HasSpiderTimeline x => SomeHoldInit x -> EventM x ()
1704−initHold (SomeHoldInit h) = void $ getHoldEventSubscription h
1705−
1706−newEventEnv :: IO (EventEnv x)
1707−newEventEnv = do
1708− toAssignRef <- newIORef [] -- This should only actually get used when events are firing
1709− holdInitRef <- newIORef []
1710− mergeUpdateRef <- newIORef []
1711− mergeInitRef <- newIORef []
1712− heightRef <- newIORef zeroHeight
1713− toClearRef <- newIORef []
1714− toClearRootRef <- newIORef []
1715− coincidenceInfosRef <- newIORef []
1716− delayedRef <- newIORef IntMap.empty
1717− return $ EventEnv toAssignRef holdInitRef mergeUpdateRef mergeInitRef toClearRef toClearRootRef heightRef coincidenceInfosRef delayedRef
1718−
1719−clearEventEnv :: EventEnv x -> IO ()
1720−clearEventEnv (EventEnv toAssignRef holdInitRef mergeUpdateRef mergeInitRef toClearRef toClearRootRef heightRef coincidenceInfosRef delayedRef) = do
1721− writeIORef toAssignRef []
1722− writeIORef holdInitRef []
1723− writeIORef mergeUpdateRef []
1724− writeIORef mergeInitRef []
1725− writeIORef heightRef zeroHeight
1726− writeIORef toClearRef []
1727− writeIORef toClearRootRef []
1728− writeIORef coincidenceInfosRef []
1729− writeIORef delayedRef IntMap.empty
1730−
1731−-- | Run an event action outside of a frame
1732−runFrame :: forall x a. HasSpiderTimeline x => EventM x a -> SpiderHost x a --TODO: This function also needs to hold the mutex
1733−runFrame a = SpiderHost $ ask >>= \_ -> lift $ do
1734− let env = _spiderTimeline_eventEnv (spiderTimeline :: SpiderTimelineEnv x)
1735− let go = do
1736− result <- a
1737− runHoldInits (eventEnvHoldInits env) (eventEnvMergeInits env) -- This must happen before doing the assignments, in case subscribing a Hold causes existing Holds to be read by the newly-propagated events
1738− return result
1739− result <- runEventM go
1740− toClear <- readIORef $ eventEnvClears env
1741− forM_ toClear $ \(SomeClear ref) -> {-# SCC "clear" #-} writeIORef ref Nothing
1742− toClearRoot <- readIORef $ eventEnvRootClears env
1743− forM_ toClearRoot $ \(SomeRootClear ref) -> {-# SCC "rootClear" #-} writeIORef ref $! DMap.empty
1744− toAssign <- readIORef $ eventEnvAssignments env
1745− toReconnectRef <- newIORef []
1746− coincidenceInfos <- readIORef $ eventEnvResetCoincidences env
1747− forM_ toAssign $ \(SomeAssignment vRef iRef v) -> {-# SCC "assignment" #-} do
1748− writeIORef vRef v
1749− when debugInvalidate $ putStrLn $ "Invalidating Hold"
1750− writeIORef iRef =<< evaluate =<< invalidate toReconnectRef =<< readIORef iRef
1751− mergeUpdates <- readIORef $ eventEnvMergeUpdates env
1752− writeIORef (eventEnvMergeUpdates env) []
1753− when debugPropagate $ putStrLn "Updating merges"
1754− mergeSubscriptionsToKill <- runEventM $ concat <$> mapM _someMergeUpdate_update mergeUpdates
1755− when debugPropagate $ putStrLn "Updating merges done"
1756− toReconnect <- readIORef toReconnectRef
1757− clearEventEnv env
1758− switchSubscriptionsToKill <- forM toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
1759− oldSubscription <- readIORef $ switchSubscribedCurrentParent subscribed
1760− wi <- readIORef $ switchSubscribedOwnWeakInvalidator subscribed
1761− when debugInvalidate $ putStrLn $ "Finalizing invalidator for Switch" <> showNodeId subscribed
1762− finalize wi
1763− i <- evaluate $ switchSubscribedOwnInvalidator subscribed
1764− wi' <- mkWeakPtrWithDebug i "wi'"
1765− writeIORef (switchSubscribedOwnWeakInvalidator subscribed) $! wi'
1766− writeIORef (switchSubscribedBehaviorParents subscribed) []
1767− writeIORef (eventEnvHoldInits env) [] --TODO: Should we reuse this?
1768− e <- runBehaviorM (readBehaviorTracked (switchSubscribedParent subscribed)) (Just (wi', switchSubscribedBehaviorParents subscribed)) $ eventEnvHoldInits env
1769− runEventM $ runHoldInits (eventEnvHoldInits env) (eventEnvMergeInits env) --TODO: Is this actually OK? It seems like it should be, since we know that no events are firing at this point, but it still seems inelegant
1770− --TODO: Make sure we touch the pieces of the SwitchSubscribed at the appropriate times
1771− sub <- newSubscriberSwitch subscribed
1772− subscription <- runReaderT (unSpiderHost (runFrame ({-# SCC "subscribeSwitch" #-} subscribe e sub))) spiderTimeline --TODO: Assert that the event isn't firing --TODO: This should not loop because none of the events should be firing, but still, it is inefficient
1773− {-
1774− stackTrace <- liftIO $ fmap renderStack $ ccsToStrings =<< (getCCSOf $! switchSubscribedParent subscribed)
1775− liftIO $ putStrLn $ (++stackTrace) $ "subd' subscribed to " ++ case e of
1776− EventRoot _ -> "EventRoot"
1777− EventNever -> "EventNever"
1778− _ -> "something else"
1779− -}
1780− writeIORef (switchSubscribedCurrentParent subscribed) $! subscription
1781− return oldSubscription
1782− liftIO $ mapM_ unsubscribe mergeSubscriptionsToKill
1783− liftIO $ mapM_ unsubscribe switchSubscriptionsToKill
1784− forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> {-# SCC "switchSubscribed" #-} do
1785− EventSubscription _ subd' <- readIORef $ switchSubscribedCurrentParent subscribed
1786− parentHeight <- getEventSubscribedHeight subd'
1787− myHeight <- readIORef $ switchSubscribedHeight subscribed
1788− when (parentHeight /= myHeight) $ do
1789− writeIORef (switchSubscribedHeight subscribed) $! invalidHeight
1790− WeakBag.traverse (switchSubscribedSubscribers subscribed) $ invalidateSubscriberHeight myHeight
1791− mapM_ _someMergeUpdate_invalidateHeight mergeUpdates --TODO: In addition to when the patch is completely empty, we should also not run this if it has some Nothing values, but none of them have actually had any effect; potentially, we could even check for Just values with no effect (e.g. by comparing their IORefs and ignoring them if they are unchanged); actually, we could just check if the new height is different
1792− forM_ coincidenceInfos $ \(SomeResetCoincidence subscription mcs) -> do
1793− unsubscribe subscription
1794− mapM_ invalidateCoincidenceHeight mcs
1795− forM_ coincidenceInfos $ \(SomeResetCoincidence _ mcs) -> mapM_ recalculateCoincidenceHeight mcs
1796− mapM_ _someMergeUpdate_recalculateHeight mergeUpdates
1797− forM_ toReconnect $ \(SomeSwitchSubscribed subscribed) -> do
1798− height <- calculateSwitchHeight subscribed
1799− updateSwitchHeight height subscribed
1800− return result
1801−
1802−newtype Height = Height { unHeight :: Int } deriving (Show, Read, Eq, Ord, Bounded)
1803−
1804−{-# INLINE zeroHeight #-}
1805−zeroHeight :: Height
1806−zeroHeight = Height 0
1807−
1808−{-# INLINE invalidHeight #-}
1809−invalidHeight :: Height
1810−invalidHeight = Height (-1000)
1811−
1812−#ifdef DEBUG_CYCLES
1813−-- | An invalid height that is currently being traversed, e.g. by walkInvalidHeightParents
1814−{-# INLINE invalidHeightBeingTraversed #-}
1815−invalidHeightBeingTraversed :: Height
1816−invalidHeightBeingTraversed = Height (-1001)
1817−#endif
1818−
1819−{-# INLINE succHeight #-}
1820−succHeight :: Height -> Height
1821−succHeight h@(Height a) =
1822− if h == invalidHeight
1823− then invalidHeight
1824− else Height $ succ a
1825−
1826−invalidateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
1827−invalidateCoincidenceHeight subscribed = do
1828− oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
1829− when (oldHeight /= invalidHeight) $ do
1830− writeIORef (coincidenceSubscribedHeight subscribed) $! invalidHeight
1831− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ invalidateSubscriberHeight oldHeight
1832−
1833−updateSwitchHeight :: Height -> SwitchSubscribed x a -> IO ()
1834−updateSwitchHeight new subscribed = do
1835− oldHeight <- readIORef $ switchSubscribedHeight subscribed
1836− when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
1837− when (new /= invalidHeight) $ do --TODO: This 'when' should probably be an assertion
1838− writeIORef (switchSubscribedHeight subscribed) $! new
1839− WeakBag.traverse (switchSubscribedSubscribers subscribed) $ recalculateSubscriberHeight new
1840−
1841−recalculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO ()
1842−recalculateCoincidenceHeight subscribed = do
1843− oldHeight <- readIORef $ coincidenceSubscribedHeight subscribed
1844− when (oldHeight == invalidHeight) $ do --TODO: This 'when' should probably be an assertion
1845− height <- calculateCoincidenceHeight subscribed
1846− when (height /= invalidHeight) $ do
1847− writeIORef (coincidenceSubscribedHeight subscribed) $! height
1848− WeakBag.traverse (coincidenceSubscribedSubscribers subscribed) $ recalculateSubscriberHeight height
1849−
1850−calculateSwitchHeight :: SwitchSubscribed x a -> IO Height
1851−calculateSwitchHeight subscribed = getEventSubscribedHeight . _eventSubscription_subscribed =<< readIORef (switchSubscribedCurrentParent subscribed)
1852−
1853−calculateCoincidenceHeight :: CoincidenceSubscribed x a -> IO Height
1854−calculateCoincidenceHeight subscribed = do
1855− outerHeight <- getEventSubscribedHeight $ _eventSubscription_subscribed $ coincidenceSubscribedOuterParent subscribed
1856− innerHeight <- maybe (return zeroHeight) getEventSubscribedHeight =<< readIORef (coincidenceSubscribedInnerParent subscribed)
1857− return $ if outerHeight == invalidHeight || innerHeight == invalidHeight then invalidHeight else max outerHeight innerHeight
1858−
1859−data SomeSwitchSubscribed x = forall a. SomeSwitchSubscribed {-# NOUNPACK #-} (SwitchSubscribed x a)
1860−
1861−invalidate :: IORef [SomeSwitchSubscribed x] -> WeakList (Invalidator x) -> IO (WeakList (Invalidator x))
1862−invalidate toReconnectRef wis = do
1863− forM_ wis $ \wi -> do
1864− mi <- deRefWeak wi
1865− case mi of
1866− Nothing -> do
1867− traceInvalidate "invalidate Dead"
1868− return () --TODO: Should we clean this up here?
1869− Just i -> do
1870− finalize wi -- Once something's invalidated, it doesn't need to hang around; this will change when some things are strict
1871− case i of
1872− InvalidatorPull p -> do
1873− traceInvalidate $ "invalidate: Pull" <> showNodeId p
1874− mVal <- readIORef $ pullValue p
1875− forM_ mVal $ \val -> do
1876− writeIORef (pullValue p) Nothing
1877− writeIORef (pullSubscribedInvalidators val) =<< evaluate =<< invalidate toReconnectRef =<< readIORef (pullSubscribedInvalidators val)
1878− InvalidatorSwitch subscribed -> do
1879− traceInvalidate $ "invalidate: Switch" <> showNodeId subscribed
1880− modifyIORef' toReconnectRef (SomeSwitchSubscribed subscribed :)
1881− 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
1882−
1883−--------------------------------------------------------------------------------
1884−-- Reflex integration
1885−--------------------------------------------------------------------------------
1886−
1887−#ifndef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
1888−-- When we're specializing, we include this from Reflex.Class instead, because
1889−-- it needs access to these types; when we're not, we want them here, so our
1890−-- instance isn't an orphan instance.
1891−#include "SpiderTimeline.include.hs"
1892−#include "SpiderTimelineHost.include.hs"
1893−#endif
1894−
1895−unsafeNewSpiderTimelineEnv :: forall x. IO (SpiderTimelineEnv x)
1896−unsafeNewSpiderTimelineEnv = do
1897− lock <- newMVar ()
1898− env <- newEventEnv
1899−#ifdef DEBUG
1900− depthRef <- newIORef 0
1901−#endif
1902− return $ SpiderTimelineEnv
1903− { _spiderTimeline_lock = lock
1904− , _spiderTimeline_eventEnv = env
1905−#ifdef DEBUG
1906− , _spiderTimeline_depth = depthRef
1907−#endif
1908− }
1909−
1910−#ifndef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
1911−-- | Create a new SpiderTimelineEnv
1912−newSpiderTimeline :: IO (Some SpiderTimelineEnv)
1913−newSpiderTimeline = withSpiderTimeline (pure . Some.This)
1914−
1915−data LocalSpiderTimeline x s
1916−
1917−instance Reifies s (SpiderTimelineEnv x) =>
1918− HasSpiderTimeline (LocalSpiderTimeline x s) where
1919− spiderTimeline = localSpiderTimeline (Proxy :: Proxy s) $ reflect (Proxy :: Proxy s)
1920−
1921−localSpiderTimeline
1922− :: Proxy s
1923− -> SpiderTimelineEnv x
1924− -> SpiderTimelineEnv (LocalSpiderTimeline x s)
1925−localSpiderTimeline _ = unsafeCoerce
1926−
1927−-- | Pass a new timeline to the given function.
1928−withSpiderTimeline :: (forall x. HasSpiderTimeline x => SpiderTimelineEnv x -> IO r) -> IO r
1929−withSpiderTimeline k = do
1930− env <- unsafeNewSpiderTimelineEnv
1931− reify env $ \s -> k $ localSpiderTimeline s env
1932−#endif
1933−
1934−newtype SpiderPullM x a = SpiderPullM (BehaviorM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
1935−
1936−newtype SpiderPushM x a = SpiderPushM (ComputeM x a) deriving (Functor, Applicative, Monad, MonadIO, MonadFix)
1937−
1938−#ifndef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
1939−instance HasSpiderTimeline x => R.Reflex (SpiderTimeline x) where
1940− {-# SPECIALIZE instance R.Reflex (SpiderTimeline Global) #-}
1941− newtype Behavior (SpiderTimeline x) a = SpiderBehavior { unSpiderBehavior :: Behavior x a }
1942− newtype Event (SpiderTimeline x) a = SpiderEvent { unSpiderEvent :: Event x a }
1943− newtype Dynamic (SpiderTimeline x) a = SpiderDynamic { unSpiderDynamic :: Dynamic x (Identity a) } -- deriving (Functor, Applicative, Monad)
1944− newtype Incremental (SpiderTimeline x) p = SpiderIncremental { unSpiderIncremental :: Dynamic x p }
1945− type PullM (SpiderTimeline x) = SpiderPullM x
1946− type PushM (SpiderTimeline x) = SpiderPushM x
1947− {-# INLINABLE never #-}
1948− never = SpiderEvent eventNever
1949− {-# INLINABLE constant #-}
1950− constant = SpiderBehavior . behaviorConst
1951− {-# INLINE push #-}
1952− push f = SpiderEvent . push (coerce f) . unSpiderEvent
1953− {-# INLINE pushCheap #-}
1954− pushCheap f = SpiderEvent . pushCheap (coerce f) . unSpiderEvent
1955− {-# INLINABLE pull #-}
1956− pull = SpiderBehavior . pull . coerce
1957− {-# INLINABLE merge #-}
1958− merge = SpiderEvent . merge . dynamicConst . (coerce :: DMap k (R.Event (SpiderTimeline x)) -> DMap k (Event x))
1959− {-# INLINABLE fan #-}
1960− fan e = R.EventSelector $ SpiderEvent . select (fan (unSpiderEvent e))
1961− {-# INLINABLE switch #-}
1962− switch = SpiderEvent . switch . (coerce :: Behavior x (R.Event (SpiderTimeline x) a) -> Behavior x (Event x a)) . unSpiderBehavior
1963− {-# INLINABLE coincidence #-}
1964− coincidence = SpiderEvent . coincidence . (coerce :: Event x (R.Event (SpiderTimeline x) a) -> Event x (Event x a)) . unSpiderEvent
1965− {-# INLINABLE current #-}
1966− current = SpiderBehavior . dynamicCurrent . unSpiderDynamic
1967− {-# INLINABLE updated #-}
1968− updated = coerceWith Coercion $ SpiderEvent . dynamicUpdated . unSpiderDynamic
1969− {-# INLINABLE unsafeBuildDynamic #-}
1970− unsafeBuildDynamic readV0 v' = SpiderDynamic $ dynamicDynIdentity $ unsafeDyn (coerce readV0) $ coerce $ unSpiderEvent v'
1971− {-# INLINABLE unsafeBuildIncremental #-}
1972− unsafeBuildIncremental readV0 dv = SpiderIncremental $ dynamicDyn $ unsafeDyn (coerce readV0) $ unSpiderEvent dv
1973− {-# INLINABLE mergeIncremental #-}
1974− mergeIncremental = SpiderEvent . merge . (unsafeCoerce :: Dynamic x (PatchDMap k (R.Event (SpiderTimeline x))) -> Dynamic x (PatchDMap k (Event x))) . unSpiderIncremental
1975− {-# INLINABLE currentIncremental #-}
1976− currentIncremental = SpiderBehavior . dynamicCurrent . unSpiderIncremental
1977− {-# INLINABLE updatedIncremental #-}
1978− updatedIncremental = SpiderEvent . dynamicUpdated . unSpiderIncremental
1979− {-# INLINABLE incrementalToDynamic #-}
1980− incrementalToDynamic (SpiderIncremental i) = SpiderDynamic $ dynamicDynIdentity $ unsafeDyn (readBehaviorUntracked $ dynamicCurrent i) $ flip push (dynamicUpdated i) $ \p -> do
1981− c <- readBehaviorUntracked $ dynamicCurrent i
1982− return $ Identity <$> apply p c --TODO: Avoid the redundant 'apply'
1983− eventCoercion Coercion = Coercion
1984− behaviorCoercion Coercion = Coercion
1985− dynamicCoercion = unsafeCoerce --TODO: How can we avoid this unsafeCoerce? This is safe only because we know how Identity works as a Patch instance
1986−#endif
1987−
1988−data RootTrigger x a = forall k. GCompare k => RootTrigger (WeakBag (Subscriber x a), IORef (DMap k Identity), k a)
1989−
1990−data SpiderEventHandle x a = SpiderEventHandle
1991− { spiderEventHandleSubscription :: EventSubscription x
1992− , spiderEventHandleValue :: IORef (Maybe a)
1993− }
1994−
1995−instance MonadRef (EventM x) where
1996− type Ref (EventM x) = Ref IO
1997− {-# INLINABLE newRef #-}
1998− {-# INLINABLE readRef #-}
1999− {-# INLINABLE writeRef #-}
2000− newRef = liftIO . newRef
2001− readRef = liftIO . readRef
2002− writeRef r a = liftIO $ writeRef r a
2003−
2004−instance MonadAtomicRef (EventM x) where
2005− {-# INLINABLE atomicModifyRef #-}
2006− atomicModifyRef r f = liftIO $ atomicModifyRef r f
2007−
2008−-- | The monad for actions that manipulate a Spider timeline identified by @x@
2009−newtype SpiderHost x a = SpiderHost { unSpiderHost :: ReaderT (SpiderTimelineEnv x) IO a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2010−
2011−instance Monad (SpiderHost x) where
2012− {-# INLINABLE (>>=) #-}
2013− SpiderHost x >>= f = SpiderHost $ x >>= unSpiderHost . f
2014− {-# INLINABLE (>>) #-}
2015− SpiderHost x >> SpiderHost y = SpiderHost $ x >> y
2016− {-# INLINABLE return #-}
2017− return x = SpiderHost $ return x
2018− {-# INLINABLE fail #-}
2019− fail s = SpiderHost $ fail s
2020−
2021−-- | Run an action affecting the global Spider timeline; this will be guarded by
2022−-- a mutex for that timeline
2023−runSpiderHost :: SpiderHost Global a -> IO a
2024−runSpiderHost (SpiderHost a) = runReaderT a globalSpiderTimelineEnv
2025−
2026−#ifndef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
2027−-- | Run an action affecting a given Spider timeline; this will be guarded by a
2028−-- mutex for that timeline
2029−runSpiderHostForTimeline :: SpiderHost x a -> SpiderTimelineEnv x -> IO a
2030−runSpiderHostForTimeline (SpiderHost a) = runReaderT a
2031−#endif
2032−
2033−newtype SpiderHostFrame x a = SpiderHostFrame { runSpiderHostFrame :: EventM x a } deriving (Functor, Applicative, MonadFix, MonadIO, MonadException, MonadAsyncException)
2034−
2035−instance Monad (SpiderHostFrame x) where
2036− {-# INLINABLE (>>=) #-}
2037− SpiderHostFrame x >>= f = SpiderHostFrame $ x >>= runSpiderHostFrame . f
2038− {-# INLINABLE (>>) #-}
2039− SpiderHostFrame x >> SpiderHostFrame y = SpiderHostFrame $ x >> y
2040− {-# INLINABLE return #-}
2041− return x = SpiderHostFrame $ return x
2042− {-# INLINABLE fail #-}
2043− fail s = SpiderHostFrame $ fail s
2044−
2045−newEventWithTriggerIO :: (RootTrigger x a -> IO (IO ())) -> IO (Event x a)
2046−newEventWithTriggerIO f = do
2047− es <- newFanEventWithTriggerIO $ \Refl -> f
2048− return $ select es Refl
2049−
2050−newFanEventWithTriggerIO :: GCompare k => (forall a. k a -> RootTrigger x a -> IO (IO ())) -> IO (EventSelector x k)
2051−newFanEventWithTriggerIO f = do
2052− occRef <- newIORef DMap.empty
2053− subscribedRef <- newIORef DMap.empty
2054− let !r = Root
2055− { rootOccurrence = occRef
2056− , rootSubscribed = subscribedRef
2057− , rootInit = f
2058− }
2059− return $ EventSelector $ \k -> eventRoot k r
2060−
2061−newtype ReadPhase x a = ReadPhase (ResultM x a) deriving (Functor, Applicative, Monad, MonadFix)
2062−
2063−instance MonadRef (SpiderHost x) where
2064− type Ref (SpiderHost x) = Ref IO
2065− newRef = SpiderHost . newRef
2066− readRef = SpiderHost . readRef
2067− writeRef r = SpiderHost . writeRef r
2068−
2069−instance MonadAtomicRef (SpiderHost x) where
2070− atomicModifyRef r = SpiderHost . atomicModifyRef r
2071−
2072−instance MonadRef (SpiderHostFrame x) where
2073− type Ref (SpiderHostFrame x) = Ref IO
2074− newRef = SpiderHostFrame . newRef
2075− readRef = SpiderHostFrame . readRef
2076− writeRef r = SpiderHostFrame . writeRef r
2077−
2078−instance MonadAtomicRef (SpiderHostFrame x) where
2079− atomicModifyRef r = SpiderHostFrame . atomicModifyRef r
2080−
2081−instance PrimMonad (SpiderHostFrame x) where
2082− type PrimState (SpiderHostFrame x) = PrimState IO
2083− primitive = SpiderHostFrame . EventM . primitive
src/Reflex/Spider/SpiderTimeline.include.hsdeleted−122
@@ -1,122 +0,0 @@
1−-- | Designates the default, global Spider timeline
2−data SpiderTimeline x
3−type role SpiderTimeline nominal
4−
5−-- | The default, global Spider environment
6−type Spider = SpiderTimeline Global
7−
8−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (EventM x) where
9− {-# INLINABLE sample #-}
10− sample (SpiderBehavior b) = readBehaviorUntracked b
11−
12−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (EventM x) where
13− {-# INLINABLE hold #-}
14− hold = holdSpiderEventM
15− {-# INLINABLE holdDyn #-}
16− holdDyn = holdDynSpiderEventM
17− {-# INLINABLE holdIncremental #-}
18− holdIncremental = holdIncrementalSpiderEventM
19−
20−instance (
21−#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
22− x ~ Global
23−#endif
24− ) => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPullM x) where
25− {-# INLINABLE sample #-}
26− sample = coerce . readBehaviorTracked . unSpiderBehavior
27−
28−instance (
29−#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
30− x ~ Global
31−#endif
32− ) => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderPushM x) where
33− {-# INLINABLE sample #-}
34− sample (SpiderBehavior b) = SpiderPushM $ readBehaviorUntracked b
35−
36−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderPushM x) where
37− {-# INLINABLE hold #-}
38− hold v0 e = Reflex.Class.current <$> Reflex.Class.holdDyn v0 e
39− {-# INLINABLE holdDyn #-}
40− holdDyn v0 (SpiderEvent e) = SpiderPushM $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce e
41− {-# INLINABLE holdIncremental #-}
42− holdIncremental v0 (SpiderEvent e) = SpiderPushM $ SpiderIncremental . dynamicHold <$> Reflex.Spider.Internal.hold v0 e
43−
44−instance HasSpiderTimeline x => Monad (Reflex.Class.Dynamic (SpiderTimeline x)) where
45− {-# INLINE return #-}
46− return = pure
47− {-# INLINE (>>=) #-}
48− x >>= f = SpiderDynamic $ dynamicDynIdentity $ newJoinDyn $ newMapDyn (unSpiderDynamic . f) $ unSpiderDynamic x
49− {-# INLINE (>>) #-}
50− _ >> y = y
51− {-# INLINE fail #-}
52− fail _ = error "Dynamic does not support 'fail'"
53−
54−newJoinDyn :: HasSpiderTimeline x => Reflex.Spider.Internal.Dynamic x (Identity (Reflex.Spider.Internal.Dynamic x (Identity a))) -> Reflex.Spider.Internal.Dyn x (Identity a)
55−newJoinDyn d =
56− let readV0 = readBehaviorTracked . dynamicCurrent =<< readBehaviorTracked (dynamicCurrent d)
57− eOuter = Reflex.Spider.Internal.push (fmap (Just . Identity) . readBehaviorUntracked . dynamicCurrent . runIdentity) $ dynamicUpdated d
58− eInner = Reflex.Spider.Internal.switch $ dynamicUpdated <$> dynamicCurrent d
59− eBoth = Reflex.Spider.Internal.coincidence $ dynamicUpdated . runIdentity <$> dynamicUpdated d
60− v' = unSpiderEvent $ Reflex.Class.leftmost $ map SpiderEvent [eBoth, eOuter, eInner]
61− in unsafeDyn readV0 v'
62−
63−instance HasSpiderTimeline x => Functor (Reflex.Class.Dynamic (SpiderTimeline x)) where
64− fmap f = SpiderDynamic . newMapDyn f . unSpiderDynamic
65−
66−instance HasSpiderTimeline x => Applicative (Reflex.Class.Dynamic (SpiderTimeline x)) where
67− pure = SpiderDynamic . dynamicConst
68− SpiderDynamic a <*> SpiderDynamic b = SpiderDynamic $ Reflex.Spider.Internal.zipDynWith ($) a b
69− _ *> b = b
70− a <* _ = a
71−
72−holdSpiderEventM :: HasSpiderTimeline x => a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Behavior (SpiderTimeline x) a)
73−holdSpiderEventM v0 e = fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
74−
75−holdDynSpiderEventM :: HasSpiderTimeline x => a -> Reflex.Class.Event (SpiderTimeline x) a -> EventM x (Reflex.Class.Dynamic (SpiderTimeline x) a)
76−holdDynSpiderEventM v0 e = fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
77−
78−holdIncrementalSpiderEventM :: (HasSpiderTimeline x, Patch p) => PatchTarget p -> Reflex.Class.Event (SpiderTimeline x) p -> EventM x (Reflex.Class.Incremental (SpiderTimeline x) p)
79−holdIncrementalSpiderEventM v0 e = fmap (SpiderIncremental . dynamicHold) $ Reflex.Spider.Internal.hold v0 $ unSpiderEvent e
80−
81−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHost x) where
82− {-# INLINABLE hold #-}
83− hold v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.hold v0 e
84− {-# INLINABLE holdDyn #-}
85− holdDyn v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdDyn v0 e
86− {-# INLINABLE holdIncremental #-}
87− holdIncremental v0 e = runFrame . runSpiderHostFrame $ Reflex.Class.holdIncremental v0 e
88−
89−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHostFrame x) where
90− sample = SpiderHostFrame . readBehaviorUntracked . unSpiderBehavior --TODO: This can cause problems with laziness, so we should get rid of it if we can
91−
92−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (SpiderHostFrame x) where
93− {-# INLINABLE hold #-}
94− hold v0 e = SpiderHostFrame $ fmap (SpiderBehavior . behaviorHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
95− {-# INLINABLE holdDyn #-}
96− holdDyn v0 e = SpiderHostFrame $ fmap (SpiderDynamic . dynamicHoldIdentity) $ Reflex.Spider.Internal.hold v0 $ coerce $ unSpiderEvent e
97− {-# INLINABLE holdIncremental #-}
98− holdIncremental v0 e = SpiderHostFrame $ fmap (SpiderIncremental . dynamicHold) $ Reflex.Spider.Internal.hold v0 $ unSpiderEvent e
99−
100−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (SpiderHost x) where
101− {-# INLINABLE sample #-}
102− sample = runFrame . readBehaviorUntracked . unSpiderBehavior
103−
104−instance HasSpiderTimeline x => Reflex.Class.MonadSample (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
105− {-# INLINABLE sample #-}
106− sample = Reflex.Spider.Internal.ReadPhase . Reflex.Class.sample
107−
108−instance HasSpiderTimeline x => Reflex.Class.MonadHold (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
109− {-# INLINABLE hold #-}
110− hold v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.hold v0 e
111− {-# INLINABLE holdDyn #-}
112− holdDyn v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdDyn v0 e
113− {-# INLINABLE holdIncremental #-}
114− holdIncremental v0 e = Reflex.Spider.Internal.ReadPhase $ Reflex.Class.holdIncremental v0 e
115−
116−--------------------------------------------------------------------------------
117−-- Deprecated items
118−--------------------------------------------------------------------------------
119−
120−-- | 'SpiderEnv' is the old name for 'SpiderTimeline'
121−{-# DEPRECATED SpiderEnv "Use 'SpiderTimelineEnv' instead" #-}
122−type SpiderEnv = SpiderTimeline
src/Reflex/Spider/SpiderTimelineHost.include.hsdeleted−57
@@ -1,57 +0,0 @@
1−instance HasSpiderTimeline x => Reflex.Host.Class.MonadSubscribeEvent (SpiderTimeline x) (SpiderHostFrame x) where
2− {-# INLINABLE subscribeEvent #-}
3− subscribeEvent e = SpiderHostFrame $ do
4− --TODO: Unsubscribe eventually (manually and/or with weak ref)
5− val <- liftIO $ newIORef Nothing
6− subscription <- subscribe (unSpiderEvent e) $ Subscriber
7− { subscriberPropagate = \a -> do
8− liftIO $ writeIORef val $ Just a
9− scheduleClear val
10− , subscriberInvalidateHeight = \_ -> return ()
11− , subscriberRecalculateHeight = \_ -> return ()
12− }
13− return $ SpiderEventHandle
14− { spiderEventHandleSubscription = subscription
15− , spiderEventHandleValue = val
16− }
17−
18−instance HasSpiderTimeline x => Reflex.Host.Class.ReflexHost (SpiderTimeline x) where
19− type EventTrigger (SpiderTimeline x) = RootTrigger x
20− type EventHandle (SpiderTimeline x) = SpiderEventHandle x
21− type HostFrame (SpiderTimeline x) = SpiderHostFrame x
22−
23−instance HasSpiderTimeline x => Reflex.Host.Class.MonadReadEvent (SpiderTimeline x) (Reflex.Spider.Internal.ReadPhase x) where
24− {-# NOINLINE readEvent #-}
25− readEvent h = Reflex.Spider.Internal.ReadPhase $ fmap (fmap return) $ liftIO $ do
26− result <- readIORef $ spiderEventHandleValue h
27− touch h
28− return result
29−
30−instance (
31−#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
32− x ~ Global
33−#endif
34− ) => Reflex.Host.Class.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHost x) where
35− newEventWithTrigger = SpiderHost . lift . fmap SpiderEvent . newEventWithTriggerIO
36− newFanEventWithTrigger f = SpiderHost $ lift $ do
37− es <- newFanEventWithTriggerIO f
38− return $ Reflex.Class.EventSelector $ SpiderEvent . Reflex.Spider.Internal.select es
39−
40−instance (
41−#ifdef SPECIALIZE_TO_SPIDERTIMELINE_GLOBAL
42− x ~ Global
43−#endif
44− ) => Reflex.Host.Class.MonadReflexCreateTrigger (SpiderTimeline x) (SpiderHostFrame x) where
45− newEventWithTrigger = SpiderHostFrame . EventM . liftIO . fmap SpiderEvent . newEventWithTriggerIO
46− newFanEventWithTrigger f = SpiderHostFrame $ EventM $ liftIO $ do
47− es <- newFanEventWithTriggerIO f
48− return $ Reflex.Class.EventSelector $ SpiderEvent . Reflex.Spider.Internal.select es
49−
50−instance HasSpiderTimeline x => Reflex.Host.Class.MonadSubscribeEvent (SpiderTimeline x) (SpiderHost x) where
51− {-# INLINABLE subscribeEvent #-}
52− subscribeEvent = runFrame . runSpiderHostFrame . Reflex.Host.Class.subscribeEvent
53−
54−instance HasSpiderTimeline x => Reflex.Host.Class.MonadReflexHost (SpiderTimeline x) (SpiderHost x) where
55− type ReadPhase (SpiderHost x) = Reflex.Spider.Internal.ReadPhase x
56− fireEventsAndRead es (Reflex.Spider.Internal.ReadPhase a) = run es a
57− runHostFrame = runFrame . runSpiderHostFrame
src/Reflex/TriggerEvent/Base.hsdeleted−111
@@ -1,111 +0,0 @@
1−-- | This module defines 'TriggerEventT', the standard implementation of
2−-- 'TriggerEvent'.
3−{-# LANGUAGE DeriveFunctor #-}
4−{-# LANGUAGE FlexibleInstances #-}
5−{-# LANGUAGE GeneralizedNewtypeDeriving #-}
6−{-# LANGUAGE MultiParamTypeClasses #-}
7−{-# LANGUAGE TypeFamilies #-}
8−module Reflex.TriggerEvent.Base
9− ( TriggerEventT (..)
10− , runTriggerEventT
11− , askEvents
12− , TriggerInvocation (..)
13− , EventTriggerRef (..)
14− ) where
15−
16−import Control.Concurrent
17−import Control.Monad.Exception
18−import Control.Monad.Reader
19−import Control.Monad.Ref
20−import Data.Dependent.Sum
21−import Reflex.Class
22−import Reflex.Host.Class
23−import Reflex.PerformEvent.Class
24−import Reflex.PostBuild.Class
25−import Reflex.TriggerEvent.Class
26−
27−-- | A value with which to fire an 'Event', as well as a callback to invoke
28−-- after its propagation has completed.
29−data TriggerInvocation a = TriggerInvocation a (IO ())
30−
31−-- | A reference to an 'EventTrigger' suitable for firing with 'TriggerEventT'.
32−newtype EventTriggerRef t m a = EventTriggerRef { unEventTriggerRef :: Ref m (Maybe (EventTrigger t a)) }
33−
34−-- | A basic implementation of 'TriggerEvent'.
35−newtype TriggerEventT t m a = TriggerEventT { unTriggerEventT :: ReaderT (Chan [DSum (EventTriggerRef t m) TriggerInvocation]) m a } deriving (Functor, Applicative, Monad, MonadFix, MonadIO, MonadException, MonadAsyncException)
36−
37−-- | Run a 'TriggerEventT' action. The argument should be a 'Chan' into which
38−-- 'TriggerInvocation's can be passed; it is expected that some other thread
39−-- will be responsible for popping values out of the 'Chan' and firing their
40−-- 'EventTrigger's.
41−runTriggerEventT :: TriggerEventT t m a -> Chan [DSum (EventTriggerRef t m) TriggerInvocation] -> m a
42−runTriggerEventT = runReaderT . unTriggerEventT
43−
44−instance MonadTrans (TriggerEventT t) where
45− lift = TriggerEventT . lift
46−
47−instance PerformEvent t m => PerformEvent t (TriggerEventT t m) where
48− type Performable (TriggerEventT t m) = Performable m
49− {-# INLINABLE performEvent_ #-}
50− performEvent_ e = lift $ performEvent_ e
51− {-# INLINABLE performEvent #-}
52− performEvent e = lift $ performEvent e
53−
54−instance PostBuild t m => PostBuild t (TriggerEventT t m) where
55− {-# INLINABLE getPostBuild #-}
56− getPostBuild = lift getPostBuild
57−
58−instance MonadReflexCreateTrigger t m => MonadReflexCreateTrigger t (TriggerEventT t m) where
59− {-# INLINABLE newEventWithTrigger #-}
60− newEventWithTrigger = lift . newEventWithTrigger
61− {-# INLINABLE newFanEventWithTrigger #-}
62− newFanEventWithTrigger f = lift $ newFanEventWithTrigger f
63−
64−instance (Monad m, MonadRef m, Ref m ~ Ref IO, MonadReflexCreateTrigger t m) => TriggerEvent t (TriggerEventT t m) where
65− {-# INLINABLE newTriggerEvent #-}
66− newTriggerEvent = do
67− (e, t) <- newTriggerEventWithOnComplete
68− return (e, \a -> t a $ return ())
69− {-# INLINABLE newTriggerEventWithOnComplete #-}
70− newTriggerEventWithOnComplete = do
71− events <- askEvents
72− (eResult, reResultTrigger) <- lift newEventWithTriggerRef
73− return . (,) eResult $ \a cb ->
74− writeChan events [EventTriggerRef reResultTrigger :=> TriggerInvocation a cb]
75− {-# INLINABLE newEventWithLazyTriggerWithOnComplete #-}
76− newEventWithLazyTriggerWithOnComplete f = do
77− events <- askEvents
78− lift . newEventWithTrigger $ \t ->
79− f $ \a cb -> do
80− reResultTrigger <- newRef $ Just t
81− writeChan events [EventTriggerRef reResultTrigger :=> TriggerInvocation a cb]
82−
83−instance MonadRef m => MonadRef (TriggerEventT t m) where
84− type Ref (TriggerEventT t m) = Ref m
85− {-# INLINABLE newRef #-}
86− newRef = lift . newRef
87− {-# INLINABLE readRef #-}
88− readRef = lift . readRef
89− {-# INLINABLE writeRef #-}
90− writeRef r = lift . writeRef r
91−
92−instance MonadAtomicRef m => MonadAtomicRef (TriggerEventT t m) where
93− {-# INLINABLE atomicModifyRef #-}
94− atomicModifyRef r = lift . atomicModifyRef r
95−
96−instance MonadSample t m => MonadSample t (TriggerEventT t m) where
97− {-# INLINABLE sample #-}
98− sample = lift . sample
99−
100−instance MonadHold t m => MonadHold t (TriggerEventT t m) where
101− {-# INLINABLE hold #-}
102− hold v0 v' = lift $ hold v0 v'
103− {-# INLINABLE holdDyn #-}
104− holdDyn v0 v' = lift $ holdDyn v0 v'
105− {-# INLINABLE holdIncremental #-}
106− holdIncremental v0 v' = lift $ holdIncremental v0 v'
107−
108−-- | Retrieve the current 'Chan'; event trigger invocations pushed into it will
109−-- be fired.
110−askEvents :: Monad m => TriggerEventT t m (Chan [DSum (EventTriggerRef t m) TriggerInvocation])
111−askEvents = TriggerEventT ask
src/Reflex/TriggerEvent/Class.hsdeleted−38
@@ -1,38 +0,0 @@
1−-- | This module defines 'TriggerEvent', which describes actions that may create
2−-- new 'Event's that can be triggered from 'IO'.
3−{-# LANGUAGE FlexibleInstances #-}
4−{-# LANGUAGE FunctionalDependencies #-}
5−{-# LANGUAGE MultiParamTypeClasses #-}
6−{-# LANGUAGE UndecidableInstances #-}
7−module Reflex.TriggerEvent.Class
8− ( TriggerEvent (..)
9− ) where
10−
11−import Reflex.Class
12−
13−import Control.Monad.Reader
14−
15−--TODO: Shouldn't have IO hard-coded
16−-- | 'TriggerEvent' represents actions that can create 'Event's that can be
17−-- triggered by 'IO' actions.
18−class Monad m => TriggerEvent t m | m -> t where
19− -- | Create a triggerable 'Event'. Whenever the resulting function is called,
20− -- the resulting 'Event' will fire at some point in the future. Note that
21− -- this may not be synchronous.
22− newTriggerEvent :: m (Event t a, a -> IO ())
23− -- | Like 'newTriggerEvent', but the callback itself takes another callback,
24− -- to be invoked once the requested 'Event' occurrence has finished firing.
25− -- This allows synchronous operation.
26− newTriggerEventWithOnComplete :: m (Event t a, a -> IO () -> IO ()) --TODO: This and newTriggerEvent should be unified somehow
27− -- | Like 'newTriggerEventWithOnComplete', but with setup and teardown. This
28− -- relatively complex type signature allows any external listeners to be
29− -- subscribed lazily and then removed whenever the returned 'Event' is no
30− -- longer being listened to. Note that the setup/teardown may happen multiple
31− -- times, and there is no guarantee that the teardown will be executed
32− -- promptly, or even at all, in the case of program termination.
33− newEventWithLazyTriggerWithOnComplete :: ((a -> IO () -> IO ()) -> IO (IO ())) -> m (Event t a)
34−
35−instance TriggerEvent t m => TriggerEvent t (ReaderT r m) where
36− newTriggerEvent = lift newTriggerEvent
37− newTriggerEventWithOnComplete = lift newTriggerEventWithOnComplete
38− newEventWithLazyTriggerWithOnComplete = lift . newEventWithLazyTriggerWithOnComplete
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/EventWriterT.hsdeleted−61
@@ -1,61 +0,0 @@
1−{-# LANGUAGE FlexibleContexts, GADTs #-}
2−module Main where
3−
4−import Control.Monad
5−import Control.Monad.IO.Class
6−import Control.Monad.Ref
7−import Data.Dependent.Sum
8−import Data.IORef
9−import Data.List
10−import Data.Functor.Identity
11−
12−import Reflex
13−import Reflex.EventWriter
14−import Reflex.Host.Class
15−import Reflex.PerformEvent.Base
16−
17−import System.Exit (exitFailure)
18−
19−main :: IO ()
20−main = do
21− (Just out1, Nothing) <- runApp app1
22− print out1
23− (Just out2, Just (out3, out4)) <- runApp app2
24− print out2
25− print out3
26− print out4
27− when (sort out1 /= out1 || map (+1) out2 /= out3 || out3 /= out4) exitFailure
28−
29−runApp :: (Show a, t ~ SpiderTimeline Global, m ~ SpiderHost Global)
30− => (Event t () -> EventWriterT t [a] (PerformEventT t m) (Maybe (Ref m (Maybe (EventTrigger t ())))))
31− -> IO (Maybe [a], Maybe ([a], [a]))
32−runApp x = runSpiderHost $ do
33− (pulseE, pulseTriggerRef) <- newEventWithTriggerRef
34− ((mactuateRef, e), FireCommand fire) <- hostPerformEventT $ runEventWriterT (x pulseE)
35− hnd <- subscribeEvent e
36− out1 <- fireEventRefAndRead pulseTriggerRef () hnd
37− out2 <- fmap join $ forM mactuateRef $ \actuateRef -> do
38− let readPhase = do
39− mGetValue <- readEvent hnd
40− case mGetValue of
41− Nothing -> return Nothing
42− Just getValue -> fmap Just getValue
43− mactuate <- readRef actuateRef
44− mpulse <- readRef pulseTriggerRef
45− forM ((,) <$> mactuate <*> mpulse) $ \(actuate, pulse) -> do
46− _ <- fire [actuate :=> Identity ()] $ return ()
47− [Just a] <- fire [pulse :=> Identity ()] $ readPhase
48− [Just b, Nothing] <- fire [actuate :=> Identity (), pulse :=> Identity ()] $ readPhase
49− return (a,b)
50− return (out1, out2)
51−
52−app1 :: (Reflex t, Ref m ~ IORef, EventWriter t [Int] m) => Event t () -> m (Maybe (Ref m (Maybe (EventTrigger t ()))))
53−app1 e = do
54− forM_ [1..10] $ \i -> tellEvent ([i] <$ e)
55− return Nothing
56−
57−app2 :: (Reflex t, Ref m ~ IORef, EventWriter t [Int] m, MonadAdjust t m, MonadReflexCreateTrigger t m, MonadRef m) => Event t () -> m (Maybe (Ref m (Maybe (EventTrigger t ()))))
58−app2 e = do
59− (pulse, pulseTriggerRef) <- newEventWithTriggerRef
60− forM_ [1,3..9] $ \i -> runWithReplace (tellEvent ([i] <$ e)) $ ffor pulse $ \_ -> tellEvent ([i+1] <$ e)
61− return (Just pulseTriggerRef)
test/GC.hsdeleted−95
@@ -1,95 +0,0 @@
1−{-# LANGUAGE OverloadedStrings, FlexibleContexts, GADTs, TypeFamilies, RankNTypes, ScopedTypeVariables, LambdaCase #-}
2−module Main where
3−
4−import Control.Monad
5−import Control.Monad.IO.Class
6−import Control.Monad.Ref
7−import Data.Align
8−import Data.Dependent.Map (DMap)
9−import qualified Data.Dependent.Map as DMap
10−import Data.Dependent.Sum
11−import Data.Functor.Identity
12−import Data.GADT.Compare
13−import Data.IORef
14−import Data.Semigroup
15−import Data.These
16−
17−import Data.Functor.Misc
18−import Reflex.Patch
19−
20−import qualified Reflex.Spider.Internal as S
21−import qualified Reflex.Host.Class as Host
22−
23−import System.Mem
24−import System.Exit
25−
26−main :: IO ()
27−main = do
28− ref <- newIORef Nothing
29− hostPerf ref
30− readIORef ref >>= maybe exitFailure (putStrLn . ("Result " <>) . show)
31−
32−hostPerf :: IORef (Maybe Int) -> IO ()
33−hostPerf ref = S.runSpiderHost $ do
34− ---- body
35− liftIO $ putStrLn "#creating triggers"
36− (response', responseTrigger) <- Host.newEventWithTriggerRef
37− (eadd', addTriggerRef) <- Host.newEventWithTriggerRef
38− let response = S.unSpiderEvent response'
39− eadd = S.unSpiderEvent eadd'
40− liftIO $ putStrLn "#creating event graph"
41− eventToPerform <- Host.runHostFrame $ do
42− (reqMap :: S.Event S.Global (DMap (Const2 Int (DMap Tell (S.SpiderHostFrame S.Global))) Identity))
43− <- S.SpiderHostFrame
44− $ fmap ( S.merge
45− . S.dynamicHold)
46− $ S.hold DMap.empty
47− -- Construct a new heap object for the subscriber, invalidating any weak references to the subscriber if they are not retained
48− $ (\e -> S.Event $ \sub -> do
49− (s, o) <- S.subscribeAndRead e $ sub
50− { S.subscriberPropagate = S.subscriberPropagate sub
51− }
52− return (s, o))
53− $ runIdentity <$> S.select
54− (S.fan $ S.pushCheap (return . Just . mapKeyValuePairsMonotonic (\(t :=> e) -> WrapArg t :=> Identity e)) response)
55− (WrapArg Request)
56− return $ alignWith (mergeThese (<>))
57− (flip S.pushCheap eadd $ \_ -> return $ Just $ DMap.singleton Request $ do
58− liftIO $ putStrLn "#eadd fired"
59− return $ PatchDMap $ DMap.singleton (Const2 (1 :: Int)) $ ComposeMaybe $ Just
60− $ S.pushCheap (return . Just . DMap.singleton Action . (\_ -> liftIO (writeIORef ref (Just 1)))) $ eadd)
61− (flip S.pushCheap reqMap $ \m -> return $ Just $ mconcat $ (\(Const2 _ :=> Identity reqs) -> reqs) <$> DMap.toList m)
62− ---- epilogue
63− eventToPerformHandle <- Host.subscribeEvent (S.SpiderEvent eventToPerform)
64− liftIO $ putStrLn "#performing GC" >> performMajorGC
65− liftIO $ putStrLn "#attempting to fire eadd"
66− mAddTrigger <- readRef addTriggerRef
67− forM_ mAddTrigger $ \t -> replicateM_ 2 $ do
68− liftIO $ putStrLn "#firing eadd"
69− mToPerform <- Host.fireEventsAndRead [t :=> Identity ()] $ sequence =<< Host.readEvent eventToPerformHandle
70− case mToPerform of
71− Nothing -> return ()
72− Just toPerform -> do
73− responses <- Host.runHostFrame $ DMap.traverseWithKey (\_ v -> Identity <$> v) toPerform
74− mrt <- readRef responseTrigger
75− let followupEventTriggers = case mrt of
76− Just rt -> [rt :=> Identity responses]
77− Nothing -> []
78− Host.fireEventsAndRead followupEventTriggers $ return ()
79− return ()
80− return ()
81−
82−data Tell a where
83− Action :: Tell ()
84− Request :: Tell (PatchDMap (Const2 Int (DMap Tell (S.SpiderHostFrame S.Global))) (S.Event S.Global))
85−
86−instance GEq Tell where
87− geq Action Action = Just Refl
88− geq Request Request = Just Refl
89− geq _ _ = Nothing
90−
91−instance GCompare Tell where
92− gcompare Action Action = GEQ
93− gcompare Request Request = GEQ
94− gcompare Action Request = GLT
95− gcompare Request Action = GGT
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−285
@@ -1,285 +0,0 @@
1−{-# LANGUAGE BangPatterns #-}
2−{-# LANGUAGE ConstraintKinds #-}
3−{-# LANGUAGE FlexibleContexts #-}
4−{-# LANGUAGE FlexibleInstances #-}
5−{-# LANGUAGE GADTs #-}
6−{-# LANGUAGE MultiParamTypeClasses #-}
7−{-# LANGUAGE RankNTypes #-}
8−{-# LANGUAGE RecursiveDo #-}
9−
10−module Reflex.Test.Micro (testCases) where
11−
12−import Reflex
13−import Reflex.TestPlan
14−
15−import Control.Applicative
16−import Control.Monad
17−import Control.Monad.Fix
18−import Data.Char
19−import Data.Foldable
20−import Data.Functor.Misc
21−import qualified Data.Map as Map
22−import Data.Monoid
23−
24−import Prelude
25−
26−{-# ANN testCases "HLint: ignore Functor law" #-}
27−testCases :: [(String, TestCase)]
28−testCases =
29− [ testB "hold" $ hold "0" =<< events1
30−
31− , testB "count" $ do
32− b <- current <$> (count =<< events2)
33− return $ (+ (0::Int)) <$> b
34−
35− , testB "pull-1" $ do
36− b <- hold "0" =<< events1
37− return (pull $ sample $ pull $ sample b)
38−
39− , testB "pull-2" $ do
40− b1 <- behavior1
41− return (pull $ liftA2 (<>) (sample b1) (sample b1))
42−
43− , testB "pull-3" $ do
44− b1 <- behavior1
45− b2 <- behavior2
46− return (pull $ liftA2 (<>) (sample b1) (sample b2))
47−
48− , testB "pull-4" $ do
49− es <- planList ["a", "b", "c"]
50− e <- plan [(0, ())]
51− b <- hold (constant "") $
52− pushAlways (const $ hold "z" es) e
53− return (join b)
54−
55− , testE "id" $ do
56− events2
57−
58− , testE "fmap-id" $ do
59− e <- events2
60− return $ fmap id e
61−
62− , testE "tag-1" $ do
63− b1 <- behavior1
64− e <- events2
65− return (tag b1 e)
66−
67− , testE "tag-2" $ do
68− b1 <- behavior1
69− e <- events2
70− return (tag (map toUpper <$> b1) e)
71−
72− , testE "attach-1" $ do
73− b1 <- behavior1
74− e <- events2
75− return (attachWith (++) (map toUpper <$> b1) e)
76−
77− , testE "leftmost" $ liftA2 leftmost2 events1 events2
78−
79− , testE "appendEvents-1" $ liftA2 mappend events1 events2
80−
81− , testE "appendEvents-2" $ liftA2 mappend events3 events2
82−
83− , testE "merge-1" $ do
84− e <- events1
85− return $ leftmost ["x" <$ e, "y" <$ e]
86−
87− , testE "merge-2" $ do
88− e <- events1
89− let m = mergeMap $ Map.fromList [(1::Int, "y" <$ e), (2, "z" <$ e)]
90− let ee = flip pushAlways e $ const $ return m
91− return $ coincidence ee
92−
93− , testE "headE-1" $ do
94− e <- events1
95− headE $ leftmost [e, e]
96−
97− , testE "headE-2" $ do
98− e <- events1
99− b <- hold never (e <$ e)
100− headE $ switch b
101−
102− , testE "switch-1" $ do
103− e <- events1
104− b <- hold never (e <$ e)
105− return $ switch b
106−
107− , testE "switch-2" $ do
108− e <- events1
109− return $ coincidence $ flip pushAlways e $ const $ do
110− switch <$> hold (leftmost ["x" <$ e, "y" <$ e, "z" <$ e]) (e <$ e)
111−
112− , testE "switch-3" $ do
113− e <- events1
114− return $ coincidence $ flip pushAlways e $ const $ do
115− switch <$> hold (leftmost ["x" <$ e, "y" <$ e, "z" <$ e]) never
116−
117− , testE "switch-4" $ do
118− e <- events1
119− switch <$> hold (deep e) (e <$ e)
120−
121− , testE "switch-5" $ do
122− e <- events1
123− return $ coincidence $ flip pushAlways e $ const $
124− return $ leftmost ["x" <$ e, "y" <$ e, "z" <$ e]
125−
126− , testE "switch-6" $ do
127− e <- events1
128− return $ coincidence $ flip pushAlways e $ const $ do
129− switch <$> hold ("x" <$ e) (e <$ e)
130−
131− , testE "switchPromptly-1" $ do
132− e <- events1
133− let e' = e <$ e
134− switchPromptly never $ e <$ e'
135−
136− , testE "switchPromptly-2" $ do
137− e <- events1
138− switchPromptly never $ deep (e <$ e)
139−
140− , testE "switchPromptly-3" $ do
141− e <- events1
142− switchPromptly never $ (e <$ deep e)
143−
144− , testE "switchPromptly-4" $ do
145− e <- events1
146− switchPromptly never $ (deep e <$ e)
147−
148− , testE "switch-5" $ do
149− e <- events1
150− switch <$> hold never (deep e <$ e)
151−
152− , testE "switchPromptly-5" $ do
153− e <- events1
154− switchPromptly never $ flip push e $
155− const (Just <$> headE e)
156−
157− , testE "switchPromptly-6" $ do
158− e <- events1
159− switchPromptly never $ flip pushAlways e $
160− const (switchPromptly e never)
161−
162− , testE "coincidence-1" $ do
163− e <- events1
164− return $ coincidence $ flip pushAlways e $
165− const $ return e
166−
167− , testE "coincidence-2" $ do
168− e <- events1
169− return $ coincidence $ flip pushAlways e $
170− const $ return (deep e)
171−
172− , testE "coincidence-3" $ do
173− e <- events1
174− return $ coincidence $ flip pushAlways e $
175− const $ return (coincidence (e <$ e))
176−
177− , testE "coincidence-4" $ do
178− e <- events1
179− return $ coincidence $ flip pushAlways e $
180− const (headE e)
181−
182− , testE "coincidence-5" $ do
183− e <- events1
184− return $ coincidence $ flip pushAlways e $ const $ do
185− let e' = deep e
186− return (coincidence (e' <$ e'))
187−
188− , testE "coincidence-6" $ do
189− e <- events1
190− return $ coincidence $ flip pushAlways e $ const $ do
191− let e' = coincidence (e <$ e)
192− return $ deep e'
193−
194− , testE "coincidence-7" $ do
195− e <- events1
196− return $ coincidence (deep e <$ e)
197−
198− , testB "holdWhileFiring" $ do
199− e <- events1
200− eo <- headE e
201− bb <- hold (constant "x") $ pushAlways (const $ hold "a" eo) eo
202− return $ pull $ sample =<< sample bb
203−
204− , testE "joinDyn" $ do
205− e <- events1
206− bb <- hold "b" e
207− bd <- hold never . fmap (const e) =<< headE e
208−
209− eOuter <- pushAlways sample . fmap (const bb) <$> headE e
210− let eInner = switch bd
211− return $ leftmost [eOuter, eInner]
212−
213− , testB "foldDyn" $ do
214− d <- foldDyn (++) "0" =<< events1
215− return (current d)
216−
217− , testB "mapDyn" $ do
218− d <- foldDyn (++) "0" =<< events1
219− return $ current $ fmap (map toUpper) d
220−
221− , testB "combineDyn" $ do
222− d1 <- foldDyn (++) "0" =<< events1
223− d2 <- fmap (fmap (map toUpper)) $ foldDyn (++) "0" =<< events2
224−
225− return $ current $ zipDynWith (<>) d1 d2
226− , testE "fan-1" $ do
227− e <- fmap toMap <$> events1
228− let es = select (fanMap e) . Const2 <$> values
229−
230− return (mergeList es)
231−
232− , testE "fan-2" $ do
233− e <- fmap toMap <$> events3
234− let es = select (fanMap e) . Const2 <$> values
235−
236− return (mergeList es)
237−
238− , testE "fan-3" $ do
239− f <- fanMap . fmap toMap <$> events3
240− return $ select f (Const2 'c')
241−
242− , testE "fan-4" $ do
243− e <- fmap toMap <$> events1
244− return $ toUpper <$> select (fanMap e) (Const2 'a')
245−
246− , testE "fan-5" $ do
247− e <- fmap toMap <$> events2
248− return $ toUpper <$> select (fanMap e) (Const2 'c')
249−
250− , testE "fan-6" $ do
251− f <- fanMap . fmap toMap <$> events1
252− return $ toList <$> mergeList [ select f (Const2 'b'), select f (Const2 'b'), select f (Const2 'e'), select f (Const2 'e') ]
253−
254− , testE "difference" $ do
255− e1 <- events1
256− e2 <- events2
257− return $ e1 `difference ` e2
258−
259− , testE "lazy-hold" $ do
260− let lazyHold :: forall t m. (Reflex t, MonadHold t m, MonadFix m) => m (Event t ())
261− lazyHold = do
262− rec !b <- hold never e
263− let e = never <$ switch b
264− return $ void e
265− lazyHold
266−
267− ] where
268−
269− events1, events2, events3 :: TestPlan t m => m (Event t String)
270− events1 = plan [(1, "a"), (2, "b"), (5, "c"), (7, "d"), (8, "e")]
271− events2 = plan [(1, "e"), (3, "d"), (4, "c"), (6, "b"), (7, "a")]
272−
273− events3 = liftA2 mappend events1 events2
274−
275− values = "abcde"
276− toMap str = Map.fromList $ map (\c -> (c, c)) str
277−
278− behavior1, behavior2 :: forall t m. TestPlan t m => m (Behavior t String)
279− behavior1 = hold "1" =<< events1
280− behavior2 = hold "2" =<< events2
281−
282− deep e = leftmost [e, e]
283− leftmost2 e1 e2 = leftmost [e1, e2]
284−
285−
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/RequesterT.hsdeleted−70
@@ -1,70 +0,0 @@
1−{-# LANGUAGE FlexibleContexts, GADTs #-}
2−module Main where
3−
4−import Control.Monad
5−import Control.Monad.IO.Class
6−import Control.Monad.Ref
7−import qualified Data.Dependent.Map as DMap
8−import Data.Dependent.Sum
9−import Data.IORef
10−import Data.List
11−import Data.Functor.Identity
12−
13−import Reflex
14−import Reflex.Host.Class
15−import Reflex.PerformEvent.Base
16−import Reflex.Requester.Base
17−import Reflex.Requester.Class
18−
19−import System.Exit (exitFailure, exitSuccess)
20−
21−data RequestInt a where
22− RequestInt :: Int -> RequestInt Int
23−
24−main :: IO ()
25−main = do
26− (Just out1, Nothing) <- runApp app1
27− print out1
28− (Just out2, Just (out3, out4)) <- runApp app2
29− print out2
30− print out3
31− print out4
32− when (sort out1 /= out1 || map (+1) out2 /= out3 || out3 /= out4) exitFailure
33−
34−runApp :: (t ~ SpiderTimeline Global, m ~ SpiderHost Global)
35− => (Event t () -> RequesterT t RequestInt Identity (PerformEventT t m) (Maybe (Ref m (Maybe (EventTrigger t ())))))
36− -> IO (Maybe [Int], Maybe ([Int], [Int]))
37−runApp x = runSpiderHost $ do
38− (pulseE, pulseTriggerRef) <- newEventWithTriggerRef
39− ((mactuateRef, e), FireCommand fire) <- hostPerformEventT $ runRequesterT (x pulseE) never
40− hnd <- subscribeEvent (map unwrapRequest . DMap.toList <$> e)
41− out1 <- fireEventRefAndRead pulseTriggerRef () hnd
42− out2 <- fmap join $ forM mactuateRef $ \actuateRef -> do
43− let readPhase = do
44− mGetValue <- readEvent hnd
45− case mGetValue of
46− Nothing -> return Nothing
47− Just getValue -> fmap Just getValue
48− mactuate <- readRef actuateRef
49− mpulse <- readRef pulseTriggerRef
50− forM ((,) <$> mactuate <*> mpulse) $ \(actuate, pulse) -> do
51− _ <- fire [actuate :=> Identity ()] $ return ()
52− [Just a] <- fire [pulse :=> Identity ()] $ readPhase
53− [Just b, Nothing] <- fire [actuate :=> Identity (), pulse :=> Identity ()] $ readPhase
54− return (a,b)
55− return (out1, out2)
56−
57−unwrapRequest :: DSum tag RequestInt -> Int
58−unwrapRequest (_ :=> RequestInt i) = i
59−
60−app1 :: (Reflex t, Ref m ~ IORef, Requester t m, Response m ~ Identity, Request m ~ RequestInt) => Event t () -> m (Maybe (Ref m (Maybe (EventTrigger t ()))))
61−app1 e = do
62− forM_ [1..10] $ \i -> requestingIdentity (RequestInt i <$ e)
63− return Nothing
64−
65−app2 :: (Reflex t, Ref m ~ IORef, Requester t m, Response m ~ Identity, Request m ~ RequestInt, MonadAdjust t m, MonadReflexCreateTrigger t m, MonadRef m) => Event t () -> m (Maybe (Ref m (Maybe (EventTrigger t ()))))
66−app2 e = do
67− (pulse, pulseTriggerRef) <- newEventWithTriggerRef
68− forM_ [1,3..9] $ \i -> runWithReplace (requestingIdentity (RequestInt i <$ e)) $ ffor pulse $ \_ -> requestingIdentity (RequestInt (i+1) <$ e)
69− return (Just pulseTriggerRef)
70−
test/hlint.hs+34−12
@@ -1,17 +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"
15− , "--cpp-define=USE_TEMPLATE_HASKELL"
24+ , "--cpp-define=USE_TEMPLATE_HASKELL"
16− ]
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"
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
17 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