Commit before trying IntMap instead of vector for incidence graph
This commit is contained in:
+1
-7
@@ -55,16 +55,10 @@ getEdgesCrossing s e w = filter inedgecrosses $ nearSeg peZoneSize _incEdgeZonin
|
||||
updateEdge ::
|
||||
(Set.Set EdgeObstacle -> Set.Set EdgeObstacle) ->
|
||||
(Int, Int) ->
|
||||
-- V.Vector [(Int, SimpleEdge)] ->
|
||||
-- V.Vector [(Int, SimpleEdge)]
|
||||
V.Vector (IM.IntMap SimpleEdge) ->
|
||||
V.Vector (IM.IntMap SimpleEdge)
|
||||
{-# INLINE updateEdge #-}
|
||||
updateEdge f (i, j) = ix i . ix j . seObstacles %~ f
|
||||
--updateEdge f (i, j) = ix i . each %~ g
|
||||
-- where
|
||||
-- g (k, o)
|
||||
-- | j == k = (k, o & seObstacles %~ f)
|
||||
-- | otherwise = (k, o)
|
||||
|
||||
makePathUsing :: (Set.Set EdgeObstacle -> Bool) -> Point2 -> Point2 -> World -> Maybe [Int]
|
||||
makePathUsing t s e w = do
|
||||
|
||||
Reference in New Issue
Block a user