From 5ba642c20a14a40de1aceec3272fc472d272da8a Mon Sep 17 00:00:00 2001
From: justin <justin.g.kruger@gmail.com>
Date: Thu, 16 Oct 2025 23:52:25 +0100
Subject: [PATCH] Allow creatures to path around chasms

---
 src/Dodge/Base/Collide.hs        | 10 ++++++---
 src/Dodge/Data/PathGraph.hs.orig | 36 --------------------------------
 src/Dodge/Path.hs                | 13 ++++++++++++
 src/Dodge/Placement/PlaceSpot.hs | 15 ++++++++-----
 4 files changed, 30 insertions(+), 44 deletions(-)
 delete mode 100644 src/Dodge/Data/PathGraph.hs.orig

diff --git a/src/Dodge/Base/Collide.hs b/src/Dodge/Base/Collide.hs
index 1ab9fe30d..332545a2b 100644
--- a/src/Dodge/Base/Collide.hs
+++ b/src/Dodge/Base/Collide.hs
@@ -37,6 +37,7 @@ module Dodge.Base.Collide (
     collide3,
 ) where
 
+import Data.Monoid
 import Control.Lens
 import Control.Monad
 import qualified Data.IntSet as IS
@@ -326,10 +327,13 @@ hasLOSIndirect p1 p2 =
 
 isWalkable :: Point2 -> Point2 -> World -> Bool
 {-# INLINE isWalkable #-}
-isWalkable p1 p2 =
-    not
+isWalkable p1 p2 w =
+    (not
         . collidePointTestFilter (not . (^?! wlPathable)) p1 p2
-        . wlsNearSeg p1 p2
+        . wlsNearSeg p1 p2 $ w)
+    && not (getAny $ foldMap f (w ^. cWorld . chasms))
+  where
+    f = foldMap (Any . isJust . uncurry (intersectSegSeg p1 p2)) . loopPairs
 
 canSee :: Int -> Int -> World -> Bool
 {-# INLINE canSee #-}
diff --git a/src/Dodge/Data/PathGraph.hs.orig b/src/Dodge/Data/PathGraph.hs.orig
deleted file mode 100644
index 3bf0e61cb..000000000
--- a/src/Dodge/Data/PathGraph.hs.orig
+++ /dev/null
@@ -1,36 +0,0 @@
-{-# LANGUAGE TemplateHaskell #-}
-{-# LANGUAGE StrictData #-}
-module Dodge.Data.PathGraph where
-import Geometry.Data
-import Control.Lens
-import Data.Graph.Inductive
-import qualified Data.Set as Set
-import Data.Map.Strict (Map)
-data PathGraph = PathGraph
-    { _pgGraph      :: Gr Point2 PathEdge
-    , _pgNodeMap    :: Map Point2 Int
-    , _pgNodeCount  :: Int
-    , _pgEdgeMap    :: Map (V2 Point2) (Int,Int,PathEdge)
-    }
-data PathEdge = PathEdge
-    {_peStart :: Point2
-    ,_peEnd   :: Point2
-<<<<<<< HEAD
-=======
-    ,_peDist  :: Float
->>>>>>> efficientRuntime
-    ,_peObstacles :: Set.Set EdgeObstacle
-    }
-  deriving (Eq,Ord,Show)
-data EdgeObstacle
-    = BlockObstacle
-    | DoorObstacle
-    | AutoDoorObstacle
-    | WallObstacle
-  deriving (Eq,Ord,Show,Bounded,Enum)
-
-makeLenses ''PathGraph
-<<<<<<< HEAD
-=======
-makeLenses ''PathEdge
->>>>>>> efficientRuntime
diff --git a/src/Dodge/Path.hs b/src/Dodge/Path.hs
index 6ab41c5c1..fbc529e6a 100644
--- a/src/Dodge/Path.hs
+++ b/src/Dodge/Path.hs
@@ -5,6 +5,7 @@ module Dodge.Path (
     makePathBetweenPs,
     --    , removePathsCrossing
     obstructPathsCrossing,
+    obstructPathsCrossing',
     pairsToGraph,
     getNodePos,
     walkableNodeNear,
@@ -44,6 +45,7 @@ makePathBetween = makePathUsing $ not . pathEdgeObstructed
 
 pathEdgeObstructed :: PathEdge -> Bool
 pathEdgeObstructed pe = DoorObstacle `Set.member` obs || BlockObstacle `Set.member` obs
+    || ChasmObstacle `Set.member` obs
   where
     obs = _peObstacles pe
 
@@ -158,6 +160,17 @@ obstructPathsCrossing obstacletype sp' ep w =
     updateedge gr (PathEdgeNodes x y pe) =
         insEdge (x, y, pe & peObstacles . at obstacletype ?~ ()) $ delEdge (x, y) gr
 
+obstructPathsCrossing' :: EdgeObstacle -> Point2 -> Point2 -> World 
+    -> World
+obstructPathsCrossing' obstacletype sp' ep w =
+     w & cWorld . pathGraph %~ updateedges
+  where
+    es = Set.filter edgecrosses $ pesNearSeg sp' ep w
+    edgecrosses (PathEdgeNodes _ _ pe) = isJust $ intersectSegSeg sp' ep (_peStart pe) (_peEnd pe)
+    updateedges gr = foldl' updateedge gr es
+    updateedge gr (PathEdgeNodes x y pe) =
+        insEdge (x, y, pe & peObstacles . at obstacletype ?~ ()) $ delEdge (x, y) gr
+
 snapToGrid :: Set (Point2,Point2) -> Set (Point2, Point2)
 snapToGrid = Set.map (over each (fmap (fromIntegral . f)))
   where
diff --git a/src/Dodge/Placement/PlaceSpot.hs b/src/Dodge/Placement/PlaceSpot.hs
index 43ad8bc5b..cecd9df02 100644
--- a/src/Dodge/Placement/PlaceSpot.hs
+++ b/src/Dodge/Placement/PlaceSpot.hs
@@ -148,11 +148,7 @@ placeSpotID rid ps pt w = case pt of
     PutNothing -> (0, w)
     PutID i -> (i, w)
     PutWorldUpdate f -> (0, w & f rid ps)
-    PutChasm ps' ->
-        ( 0
-        , w & gwWorld . cWorld . chasms .:~ map doShift ps'
-            & genRooms . ix rid . rmPos %~ filter (\rp -> not $ pointInPoly (_rpPos rp) ps')
-        )
+    PutChasm ps' -> (0, placeChasm w rid ps' $ map doShift ps')
     PutLabel{} -> (0, w)
   where
     p@(V2 px py) = _psPos ps
@@ -160,6 +156,15 @@ placeSpotID rid ps pt w = case pt of
     rot = _psRot ps
     doShift = shiftPointBy (p, rot)
 
+placeChasm :: GenWorld -> Int -> [Point2] -> [Point2] -> GenWorld
+placeChasm gw rid ps shiftps =
+    gw & gwWorld . cWorld . chasms .:~ shiftps
+        & genRooms . ix rid . rmPos %~ filter (\rp -> not $ pointInPoly (_rpPos rp) ps)
+        & gwWorld %~ f
+  where
+    f w = foldl' g w (loopPairs shiftps)
+    g w (x,y) = fst $ obstructPathsCrossing ChasmObstacle x y w
+
 --evaluateRandPS
 --    :: Int -> State StdGen PSType -> PlacementSpot -> GenWorld -> (Int, GenWorld)
 --evaluateRandPS rid rgen ps w = placeSpotID rid ps evaluatedType