jrvieira/nove - Change VHUL3O55RPR6QD7IXPMJFWI5EOXHQYAMHCLP2FYAULPAOAWUVQ7QC

vs

Created by jrvieira on April 28, 2026

VHUL3O55RPR6QD7IXPMJFWI5EOXHQYAMHCLP2FYAULPAOAWUVQ7QC

Dependencies

In channels

main

Change contents

Insertion in test/Test.hs at line 8 [6.19]

[6.39]

[6.58]

import Zero ( total )
import Zero.Color ( clr )
import Data.Function ( on )

Insertion in test/Test.hs at line 72 [6.19]

[3.1846]


instance Eq (Node Test) where
   a == b = on (==) atom a b && on (==) neighbours a b

Insertion in test/Test.hs at line 76 [6.19]
[3.1847]
[3.1847]
```
instance Show (Node Test) where
   show = show . atom
```
Deletion in test/Test.hs at line 101 [6.19]
B:BD[6.39] → [7.2:50]
```
import Zero ( total )
import Zero.Color ( clr )
```
Solving an order conflict in test/Test.hs at line 101 [6.19]
[3.2265]
Replacement in test/Maze.hs at line 29 [9.1]
B:BD[8.729] → [5.111:121]
```
size = 11
```
[8.729]
[8.739]
```
size = 24
```

Replacement in test/Maze.hs at line 82 [9.1]

B:BD[10.812] → [10.812:982]

      | KeyPress 'r' <- e , r : rs <- seed (nodes v ! 0) = Right (s { rand = r },set (Hex { look = pick r total , seed = rs , parent = Nothing , i = 1 }) 0 (verse size))

[10.812]

[10.982]

      | KeyPress 'r' <- e , r : rs <- seed (atom $ nodes v ! 0) = Right (s { rand = r },set (Hex { look = pick r total , seed = rs , parent = Nothing , i = 1 }) 0 (verse size))

Replacement in test/Maze.hs at line 114 [9.1]
B:BD[10.2147] → [10.2147:2169]
```
         h = node v n
```
[10.2147]
[10.2169]
```
         h = get v n
```
Insertion in test/Demo.hs at line 13 [6.135]
[6.308]
[6.361]
```
import Data.IntMap as IntMap ( filter, elems )
```
Replacement in test/Demo.hs at line 25 [6.135]
B:BD[10.2950] → [10.2950:2981]
```
      (generate (verse 24) rs)
```
[10.2950]
[6.765]
```
      (generate (verse 38) rs)
```

Replacement in test/Demo.hs at line 175 [6.135]

B:BD[10.5609] → [10.5609:5705]

   draw e (s,v) = centerFull e $ hcat [hex,ui] & (1,1) % makeTransparent ' ' (word "nove demo")

[10.5609]

[6.4859]

   draw e (s,v) = foldl (&) (blankPlaneFull e *** hex)
      [ (1,1) % word "nove demo"
      , (1,1) %^> ui
      ]

Insertion in test/Demo.hs at line 184 [6.135]
[6.4938]
[10.5741]
```
      (mx,my) = indexToCoord v (center s)
```
Replacement in test/Demo.hs at line 191 [6.135]
B:BD[10.5863] → [10.5863:5885]
```
         a = node v n
```
[10.5863]
[6.5107]
```
         a = get v n
```
Deletion in test/Demo.hs at line 196 [6.135]
B:BD[10.6061] → [10.6061:6079]
∅:D[10.6079] → [11.2224:2225]
B:BD[11.2224] → [11.2224:2225]
B:BD[11.2225] → [10.6080:6128]
```
            where
            (mx,my) = indexToCoord v (center s)
```

Replacement in test/Demo.hs at line 201 [6.135]

B:BD[7.1002] → [10.6299:6389]

      canvas :: Plane
      canvas = blankPlane (2 * succ (2 * r) + 2) (succ (2 * r) + 2)

[7.1002]

[7.1044]

      pad :: Int -> Plane -> Plane
      pad n p = blankPlane (w + 4 * n) (h + 2 * n) *** p
         where
         (w,h) = planeSize p

Replacement in test/Demo.hs at line 208 [6.135]

B:BD[10.6409] → [10.6409:6503]

      hex = foldl (&) canvas [ write (x,y) | x <- [-r..r] , y <- [-r..r] , abs (x + y) <= r ]

[10.6409]

[7.1270]

      hex = foldl (&) (blankPlane (succ $ 2 * r * 2) (succ $ 2 * r)) [ write (x,y) | x <- [-r..r] , y <- [-r..r] , abs (x + y) <= r ]

Replacement in test/Demo.hs at line 211 [6.135]

B:BD[10.6522] → [10.6522:6843]

   -- ui = word "> ui content here <"
      ui = foldl (&) canvas
         [ (1,1) % vcat (intersperse (cell ' ')
            [ key
            , hcat
               [ scope $ take 1 $ IntMap.keys $ IntMap.filter me $ nodes v
               , cell ' '
               , vcat [word "",info]
               ]
            ])

[10.6522]

[10.6843]

      ui = pad 2 $ vcat $ intersperse (cell ' ')
         [ key
         , hcat
            [ scope $ take 1 $ IntMap.elems $ IntMap.filter (me . atom) $ nodes v
            , cell ' '
            , vcat [word "",info]
            ]

Replacement in test/Demo.hs at line 227 [6.135]

B:BD[10.7010] → [10.7010:7068]

            | Just m <- find me $ nodes v = word $ show m

[10.7010]

[10.7068]

            | Just n <- find (me . atom) $ nodes v = word $ show $ atom n

Deletion in test/Demo.hs at line 229 [6.135]

∅:D[10.7135] → [7.2146:2147]

B:BD[7.2146] → [7.2146:2147]

B:BD[7.2147] → [10.7136:7759]


      scope :: [Int] -> Plane
      scope n
         | i : _ <- n = foldl (&) (blankPlane 5 3)
            [ (1,2) % let a = neighbours v i U in cell (grapheme a) # style a
            , (1,4) % let a = neighbours v i I in cell (grapheme a) # style a
            , (2,1) % let a = neighbours v i H in cell (grapheme a) # style a
            , (2,3) % let a = node v i in cell (grapheme a)
            , (2,5) % let a = neighbours v i L in cell (grapheme a) # style a
            , (3,2) % let a = neighbours v i N in cell (grapheme a) # style a
            , (3,4) % let a = neighbours v i M in cell (grapheme a) # style a

Insertion in test/Demo.hs at line 230 [6.135]

[11.3289]

[10.7760]

      scope :: [Node Unit] -> Plane
      scope ns
         | n : _ <- ns = foldl (&) (blankPlane 5 3)
            [ (1,2) % let a = get v $ neighbour n U in cell (grapheme a) # style a
            , (1,4) % let a = get v $ neighbour n I in cell (grapheme a) # style a
            , (2,1) % let a = get v $ neighbour n H in cell (grapheme a) # style a
            , (2,3) % let a = atom n in cell (grapheme a)
            , (2,5) % let a = get v $ neighbour n L in cell (grapheme a) # style a
            , (3,2) % let a = get v $ neighbour n N in cell (grapheme a) # style a
            , (3,4) % let a = get v $ neighbour n M in cell (grapheme a) # style a

Deletion in test/Demo.hs at line 296 [6.135]
B:BD[6.308] → [11.71:117]
```
import Data.IntMap as IntMap ( filter, keys )
```
Solving an order conflict in test/Demo.hs at line 296 [6.135]
[12.3296]

Replacement in test/Cell.hs at line 31 [4.1]

B:BD[4.621] → [4.621:712]

noise r v = v { nodes = IntMap.mapWithKey (\k -> const $ Hex $ mod (r !! k) 8) $ nodes v }

[4.621]

[4.712]

noise r v = v { nodes = IntMap.mapWithKey (\k n -> n { atom = Hex $ mod (r !! k) 8 }) $ nodes v }

Replacement in test/Cell.hs at line 107 [4.1]
B:BD[4.3175] → [4.3175:3197]
```
         h = node v n
```
[4.3175]
[4.3197]
```
         h = get v n
```

Insertion in src/Nove/Verse.hs at line 4 [6.6595]

[6.6730]

import Data.IntMap as IntMap ( IntMap, fromDistinctAscList, lookup, adjust )
import Data.Vector.Unboxed as Vector ( Vector, unsafeIndex, generate )

Replacement in src/Nove/Verse.hs at line 42 [6.6595]

B:BD[6.7914] → [13.1607:1666]

data Verse a = Verse { radius :: Int , nodes :: IntMap a }

[6.7914]

[6.7982]

data Node a = Node { atom :: a , neighbours :: Vector Int }
data Verse a = Verse { radius :: Int , nodes :: IntMap (Node a) }

Replacement in src/Nove/Verse.hs at line 45 [6.6595]
B:BD[6.7983] → [6.7983:8017]
```
verse :: Atom a => Int -> Verse a
```
[6.7983]
[6.8017]
```
verse :: forall a. Atom a => Int -> Verse a
```
Insertion in src/Nove/Verse.hs at line 48 [6.6595]
[6.8038]
[6.8038]

Replacement in src/Nove/Verse.hs at line 51 [6.6595]

B:BD[6.8070] → [6.8070:8154]

      , nodes = IntMap.fromDistinctAscList $ zip [0..] (replicate (3 * r * r) void)

[6.8070]

[6.8154]

      , nodes = IntMap.fromDistinctAscList $ take (3 * r * r) $ mkNode <$> [0..]

Insertion in src/Nove/Verse.hs at line 54 [6.6595]

[6.8163]

   mkNode :: Int -> (Int,Node a)
   mkNode i = (i , Node
      { atom = void
      , neighbours = Vector.generate 6 (\n -> shift Verse { radius = r } 1 (toEnum n) i)
      })

Insertion in src/Nove/Verse.hs at line 88 [6.6595]
[6.8943]
[6.8943]

Replacement in src/Nove/Verse.hs at line 97 [6.6595]

B:BD[6.9156] → [11.3685:3753]

node :: Atom a => Verse a -> Int -> a
node v i = nodes v IntMap.! i

[6.9156]

[11.3753]

node :: Atom a => Verse a -> Int -> Node a
node v i = maybe (Node { atom = void }) id $ IntMap.lookup i (nodes v)
get :: Atom a => Verse a -> Int -> a
get v i = maybe void atom $ IntMap.lookup i (nodes v)

Replacement in src/Nove/Verse.hs at line 103 [6.6595]

B:BD[11.3754] → [10.11442:11539]

neighbours :: Atom a => Verse a -> Int -> Dir -> a
neighbours v i dir = node v $ shift v 1 dir i

[11.3754]

[6.9174]

neighbour :: Atom a => Node a -> Dir -> Int
neighbour n dir = Vector.unsafeIndex (neighbours n) (fromEnum dir)

Replacement in src/Nove/Verse.hs at line 109 [6.6595]

B:BD[6.9299] → [6.9299:9353]

upd f i v = v { nodes = IntMap.adjust f i $ nodes v }

[6.9299]

[6.9353]

upd f i v = v { nodes = IntMap.adjust (\n -> n { atom = f $ atom n }) i $ nodes v }

Replacement in src/Nove/Verse.hs at line 112 [6.6595]
B:BD[6.9402] → [6.9402:9456]
```
set a i v = v { nodes = IntMap.insert i a $ nodes v }
```
[6.9402]
[6.9456]
```
set = upd . const
```

Deletion in src/Nove/Verse.hs at line 114 [6.6595]

B:BD[6.6730] → [11.3561:3643]

import Data.IntMap as IntMap ( IntMap, fromDistinctAscList, (!), adjust, insert )

Solving an order conflict in src/Nove/Verse.hs at line 114 [6.6595]
[6.9457]

Insertion in src/Nove/Logic.hs at line 4 [6.10194]

[6.10238]

[14.3516]


import Zero ( total )
import Data.IntMap.Strict as IntMap ( IntMap, (!), foldrWithKey, fromDistinctAscList )

Replacement in src/Nove/Logic.hs at line 15 [6.10194]

B:BD[10.11614] → [10.11614:11676]

step f v = v { nodes = mapWithKey (f . neighbours v) nodes' }

[10.11614]

[6.10618]

step f !v = v { nodes = (\n -> n { atom = f (get v . neighbour n) $ atom n }) <$> nodes' }

Replacement in src/Nove/Logic.hs at line 24 [6.10194]

B:BD[6.12171] → [14.3797:3898]

   φ :: Int -> a -> ([Memo], [a]) -> ([Memo], [a])
   φ i a = bimap (Memo dest lock free :) (a' :)

[6.12171]

[14.3898]

   φ :: Int -> Node a -> ([Memo], [Node a]) -> ([Memo], [Node a])
   φ i n = bimap (Memo dest lock free :) (n' :)

Replacement in src/Nove/Logic.hs at line 30 [6.10194]

B:BD[14.3978] → [14.3978:4054]

         | Just dir <- move a , n <- shift v 1 dir i = n : dest' (memo ! n)

[14.3978]

[14.4054]

         | Just dir <- move $ atom n , ni <- neighbour n dir = ni : dest' (memo ! ni)

Replacement in src/Nove/Logic.hs at line 39 [6.10194]

B:BD[14.4189] → [14.4189:4252]

            | d : _ <- dest' $ memo ! shift v 1 dir i = d == i

[14.4189]

[14.4252]

            | d : _ <- dest' $ memo ! neighbour n dir = d == i

Replacement in src/Nove/Logic.hs at line 44 [6.10194]

B:BD[14.4328] → [14.4328:4375]

         | mass a , null dest = True  -- block

[14.4328]

[14.4375]

         | mass $ atom n , null dest = True  -- block

Replacement in src/Nove/Logic.hs at line 61 [6.10194]

B:BD[14.4796] → [2.9:64]

∅:D[2.64] → [14.4865:5078]

B:BD[14.4865] → [14.4865:5078]

         | Just n <- loop , i /= n = False  -- ρ tail
         | Just n <- loop , i == n = dest !! 1 /= i && not (any (lock' . (memo !)) $ takeWhile (/= i) dest)  -- closed loop
         | n : _ <- dest = free' $ memo ! n  -- linear (loops ruled out, recurse freely)

[14.4796]

[14.5078]

         | Just ni <- loop , i /= ni = False  -- ρ tail
         | Just ni <- loop , i == ni = dest !! 1 /= i && not (any (lock' . (memo !)) $ takeWhile (/= i) dest)  -- closed loop
         | ni : _ <- dest = free' $ memo ! ni  -- linear (loops ruled out, recurse freely)

Deletion in src/Nove/Logic.hs at line 67 [6.10194]

B:BD[14.5128] → [14.5128:5142]

B:BD[14.5142] → [15.9:125]

B:BD[15.125] → [12.3302:3377]

∅:D[15.200] → [14.5298:5323]

∅:D[12.3377] → [14.5298:5323]

B:BD[14.5298] → [14.5298:5323]

B:BD[14.5323] → [14.5323:5324]

      a' :: a
         | free , [dir] <- push = node v $ shift v 1 dir i  -- move in
         | free , null push = void  -- clear
         | not free , d : _ <- dest , free' $ memo ! d = void  -- move out
         | otherwise = a

Solving an order conflict in src/Nove/Logic.hs at line 67 [6.10194]
[14.5128]

Insertion in src/Nove/Logic.hs at line 67 [6.10194]

[0.3884]

[16.1912]

      n' :: Node a
         | free , [dir] <- push = n { atom = get v $ neighbour n dir }  -- move in
         | free , null push = n { atom = void }  -- clear
         | not free , d : _ <- dest , free' $ memo ! d = n { atom = void }  -- move out
         | otherwise = n

Deletion in src/Nove/Logic.hs at line 73 [6.10194]

B:BD[16.1913] → [14.3401:3423]

B:BD[14.3423] → [14.3423:3515]

import Zero ( total )
import Data.IntMap as IntMap ( IntMap, (!), mapWithKey, foldrWithKey, fromDistinctAscList )

Insertion in nove.cabal at line 28 [6.12206]
[6.12671]
[6.12671]
```
      , vector
```
Insertion in nove.cabal at line 53 [6.12206]
[6.13093]
[6.13093]
```
      , ansi-terminal
      , colour
```

vs

Dependencies

In channels

Change contents

Insertion in test/Test.hs at line 8 [6.19]

Insertion in test/Test.hs at line 72 [6.19]

Insertion in test/Test.hs at line 76 [6.19]

Deletion in test/Test.hs at line 101 [6.19]

Solving an order conflict in test/Test.hs at line 101 [6.19]

Replacement in test/Maze.hs at line 29 [9.1]

Replacement in test/Maze.hs at line 82 [9.1]

Replacement in test/Maze.hs at line 114 [9.1]

Insertion in test/Demo.hs at line 13 [6.135]

Replacement in test/Demo.hs at line 25 [6.135]

Replacement in test/Demo.hs at line 175 [6.135]

Insertion in test/Demo.hs at line 184 [6.135]

Replacement in test/Demo.hs at line 191 [6.135]

Deletion in test/Demo.hs at line 196 [6.135]

Replacement in test/Demo.hs at line 201 [6.135]

Replacement in test/Demo.hs at line 208 [6.135]

Replacement in test/Demo.hs at line 211 [6.135]

Replacement in test/Demo.hs at line 227 [6.135]

Deletion in test/Demo.hs at line 229 [6.135]

Insertion in test/Demo.hs at line 230 [6.135]

Deletion in test/Demo.hs at line 296 [6.135]

Solving an order conflict in test/Demo.hs at line 296 [6.135]

Replacement in test/Cell.hs at line 31 [4.1]

Replacement in test/Cell.hs at line 107 [4.1]

Insertion in src/Nove/Verse.hs at line 4 [6.6595]

Replacement in src/Nove/Verse.hs at line 42 [6.6595]

Replacement in src/Nove/Verse.hs at line 45 [6.6595]

Insertion in src/Nove/Verse.hs at line 48 [6.6595]