File tree Expand file tree Collapse file tree 3 files changed +7
-6
lines changed Expand file tree Collapse file tree 3 files changed +7
-6
lines changed Original file line number Diff line number Diff line change @@ -37,10 +37,10 @@ library
37
37
hs-source-dirs : src
38
38
build-depends :
39
39
MemoTrie == 0.6. *,
40
- base >= 4.7 && < 4.12 ,
40
+ base >= 4.7 && < 4.13 ,
41
41
bifunctors >= 5.2 && < 5.6 ,
42
42
comonad,
43
- containers == 0.5. * ,
43
+ containers >= 0.5 && < 0.7 ,
44
44
data-default >= 0.5 && < 0.8 ,
45
45
dependent-map >= 0.2.4 && < 0.3 ,
46
46
exception-transformers == 0.4. *,
@@ -55,7 +55,7 @@ library
55
55
reflection == 2.1. *,
56
56
semigroupoids >= 4.0 && < 6 ,
57
57
semigroups >= 0.16 && < 0.19 ,
58
- stm == 2.4. * ,
58
+ stm >= 2.4 && < 2.6 ,
59
59
syb >= 0.5 && < 0.8 ,
60
60
these >= 0.4 && < 0.8 ,
61
61
time >= 1.4 && < 1.9 ,
@@ -130,7 +130,7 @@ library
130
130
dependent-sum >= 0.3 && < 0.5 ,
131
131
haskell-src-exts >= 1.16 && < 1.21 ,
132
132
haskell-src-meta >= 0.6 && < 0.9 ,
133
- template-haskell >= 2.9 && < 2.14
133
+ template-haskell >= 2.9 && < 2.15
134
134
exposed-modules :
135
135
Reflex.Dynamic.TH
136
136
other-extensions : TemplateHaskell
Original file line number Diff line number Diff line change @@ -26,7 +26,8 @@ import Prelude hiding (map, null)
26
26
import Data.Coerce
27
27
import Data.Default
28
28
import Data.Map (Map )
29
- import qualified Data.Map as Map
29
+ import qualified Data.Map as Map hiding (showTree , showTreeWith )
30
+ import qualified Data.Map.Internal.Debug as Map (showTree , showTreeWith )
30
31
import Data.Map.Monoidal
31
32
import Reflex.Class (FunctorMaybe (.. ))
32
33
import Reflex.Patch (Additive , Group (.. ))
Original file line number Diff line number Diff line change @@ -143,7 +143,7 @@ patchThatChangesMap oldByIndex newByIndex = patch
143
143
putRemainingKeys $ Set. delete k fromKs
144
144
return $ NodeInfo (From_Move k) $ Just undefined -- There's an existing value, and it's here, so no patch necessary
145
145
else do
146
- Just (fromK, remainingKeys) <- return $ Set. minView fromKs -- There's an existing value, but it's not here; move it here
146
+ (fromK, remainingKeys) <- return . fromJust $ Set. minView fromKs -- There's an existing value, but it's not here; move it here
147
147
putRemainingKeys remainingKeys
148
148
return $ NodeInfo (From_Move fromK) $ Just undefined
149
149
Map. traverseWithKey f newByIndex
You can’t perform that action at this time.
0 commit comments