reflex 0.8.0.0 → 0.8.1.0
raw patch · 6 files changed
+14/−9 lines, 6 filesdep ~basedep ~profunctorsdep ~template-haskell
Dependency ranges changed: base, profunctors, template-haskell
Files
- ChangeLog.md +5/−0
- README.md +1/−1
- reflex.cabal +5/−5
- src/Reflex/Dynamic.hs +1/−1
- src/Reflex/Profiled.hs +1/−1
- src/Reflex/Spider/Internal.hs +1/−1
ChangeLog.md view
@@ -1,5 +1,10 @@ # Revision history for reflex +## 0.8.1.0++* Add support for GHC 8.10+* Drop support for GHC 8.2.* and earlier+ ## 0.8.0.0 * Replace 0.7.2.0 with 0.8.0.0 to reflect the `MonadHold` interface change. Deprecates 0.7.2.0.
README.md view
@@ -1,6 +1,6 @@ ## [Reflex](https://reflex-frp.org/) -[](https://haskell.org) [](https://hackage.haskell.org/package/reflex) [](https://matrix.hackage.haskell.org/#/package/reflex) [](https://travis-ci.org/reflex-frp/reflex) [](https://github.com/reflex-frp/reflex/blob/master/LICENSE)+[](https://haskell.org) [](https://hackage.haskell.org/package/reflex) [](https://matrix.hackage.haskell.org/#/package/reflex) [](https://github.com/reflex-frp/reflex/blob/master/LICENSE) Interactive programs without callbacks or side-effects. Functional Reactive Programming (FRP) uses composable events and time-varying values to describe interactive systems as pure functions. Just like other pure functional code, functional reactive code is easier to get right on the first try, maintain, and reuse.
reflex.cabal view
@@ -1,5 +1,5 @@ Name: reflex-Version: 0.8.0.0+Version: 0.8.1.0 Synopsis: Higher-order Functional Reactive Programming Description: Interactive programs without callbacks or side-effects.@@ -28,7 +28,7 @@ ChangeLog.md tested-with:- GHC ==8.0.2 || ==8.2.2 || ==8.4.4 || ==8.6.5 || ==8.8.1,+ GHC ==8.4.4 || ==8.6.5 || ==8.8.1 || ==8.10.2, GHCJS ==8.4 flag use-reflex-optimizer@@ -71,7 +71,7 @@ hs-source-dirs: src build-depends: MemoTrie == 0.6.*,- base >= 4.9 && < 4.14,+ base >= 4.9 && < 4.15, bifunctors >= 5.2 && < 5.6, comonad >= 5.0.4 && < 5.1, constraints-extras >= 0.3 && < 0.4,@@ -86,7 +86,7 @@ patch >= 0.0.1 && < 0.1, prim-uniq >= 0.1.0.1 && < 0.3, primitive >= 0.5 && < 0.8,- profunctors >= 5.3 && < 5.6,+ profunctors >= 5.3 && < 5.7, random == 1.1.*, ref-tf == 0.4.*, reflection == 2.1.*,@@ -185,7 +185,7 @@ dependent-sum >= 0.6 && < 0.8, haskell-src-exts >= 1.16 && < 1.24, haskell-src-meta >= 0.6 && < 0.9,- template-haskell >= 2.9 && < 2.16+ template-haskell >= 2.9 && < 2.17 exposed-modules: Reflex.Dynamic.TH other-extensions: TemplateHaskell
src/Reflex/Dynamic.hs view
@@ -348,7 +348,7 @@ -- -- > demuxed (demux d) k === fmap (== k) d ----- However, when getDemuxed is used multiple times, the complexity is only+-- However, when 'demuxed' is used multiple times, the complexity is only -- /O(log(n))/, rather than /O(n)/ for fmap. data Demux t k = Demux { demuxValue :: Behavior t k , demuxSelector :: EventSelector t (Const2 k Bool)
src/Reflex/Profiled.hs view
@@ -147,7 +147,7 @@ pushCheap f (Event_Profiled e) = coerce $ pushCheap (coerce f) $ profileEvent e pull = Behavior_Profiled . pull . coerce fanG (Event_Profiled e) = EventSelectorG $ coerce $ selectG (fanG $ profileEvent e)- mergeG :: forall (k :: z -> *) q v. GCompare k+ mergeG :: forall z (k :: z -> *) q v. GCompare k => (forall a. q a -> Event (ProfiledTimeline t) (v a)) -> DMap k q -> Event (ProfiledTimeline t) (DMap k v) mergeG nt = Event_Profiled #. mergeG (coerce nt)
src/Reflex/Spider/Internal.hs view
@@ -2775,7 +2775,7 @@ fanG e = R.EventSelectorG $ SpiderEvent . selectG (fanG (unSpiderEvent e)) {-# INLINABLE mergeG #-} mergeG- :: forall (k :: k2 -> *) q (v :: k2 -> *). GCompare k+ :: forall k2 (k :: k2 -> *) q (v :: k2 -> *). GCompare k => (forall a. q a -> R.Event (SpiderTimeline x) (v a)) -> DMap k q -> R.Event (SpiderTimeline x) (DMap k v)