e76567b9e7
Add a dungeon level generator, which: 1. generates an infinite sequence of rectangular rooms within the dimensions of the level 2. removes any duplicates from that sequence 3. Generates a graph from the delaunay triangulation of the centerpoints of those rooms 4. Generates the minimum-spanning-tree of that delaunay triangulation, with weights given by line length in points 5. Adds back a subset (default 10-15%) of edges from the delaunay triangulation to the graph 6. Uses the resulting graph to draw corridors between the rooms, using a random point on the near edge of each room to pick the points of the corridors
82 lines
3.2 KiB
Haskell
82 lines
3.2 KiB
Haskell
--------------------------------------------------------------------------------
|
|
module Xanthous.DataSpec (main, test) where
|
|
--------------------------------------------------------------------------------
|
|
import Test.Prelude hiding (Right, Left, Down)
|
|
import Xanthous.Data
|
|
import Data.Group
|
|
--------------------------------------------------------------------------------
|
|
|
|
main :: IO ()
|
|
main = defaultMain test
|
|
|
|
test :: TestTree
|
|
test = testGroup "Xanthous.Data"
|
|
[ testGroup "Position"
|
|
[ testBatch $ monoid @Position mempty
|
|
, testProperty "group laws" $ \(pos :: Position) ->
|
|
pos <> invert pos == mempty && invert pos <> pos == mempty
|
|
, testGroup "stepTowards laws"
|
|
[ testProperty "takes only one step" $ \src tgt ->
|
|
src /= tgt ==>
|
|
isUnit (src `diffPositions` (src `stepTowards` tgt))
|
|
-- , testProperty "moves in the right direction" $ \src tgt ->
|
|
-- stepTowards src tgt == move (directionOf src tgt) src
|
|
]
|
|
, testProperty "directionOf laws" $ \pos dir ->
|
|
directionOf pos (move dir pos) == dir
|
|
, testProperty "diffPositions is add inverse" $ \(pos₁ :: Position) pos₂ ->
|
|
diffPositions pos₁ pos₂ == addPositions pos₁ (invert pos₂)
|
|
, testGroup "isUnit"
|
|
[ testProperty "double direction is never unit" $ \dir ->
|
|
not . isUnit $ move dir (asPosition dir)
|
|
, testCase "examples" $ do
|
|
isUnit (Position @Int 1 1) @? "not . isUnit $ Position 1 1"
|
|
isUnit (Position @Int 0 (-1)) @? "not . isUnit $ Position 0 (-1)"
|
|
(not . isUnit) (Position @Int 1 13) @? "isUnit $ Position 1 13"
|
|
]
|
|
]
|
|
|
|
, testGroup "Direction"
|
|
[ testProperty "opposite is involutive" $ \(dir :: Direction) ->
|
|
opposite (opposite dir) == dir
|
|
, testProperty "opposite provides inverse" $ \dir ->
|
|
invert (asPosition dir) === asPosition (opposite dir)
|
|
, testProperty "asPosition isUnit" $ \dir ->
|
|
dir /= Here ==> isUnit (asPosition dir)
|
|
, testGroup "Move"
|
|
[ testCase "Up" $ move Up mempty @?= Position 0 (-1)
|
|
, testCase "Down" $ move Down mempty @?= Position 0 1
|
|
, testCase "Left" $ move Left mempty @?= Position (-1) 0
|
|
, testCase "Right" $ move Right mempty @?= Position 1 0
|
|
, testCase "UpLeft" $ move UpLeft mempty @?= Position (-1) (-1)
|
|
, testCase "UpRight" $ move UpRight mempty @?= Position 1 (-1)
|
|
, testCase "DownLeft" $ move DownLeft mempty @?= Position (-1) 1
|
|
, testCase "DownRight" $ move DownRight mempty @?= Position 1 1
|
|
]
|
|
]
|
|
|
|
, testGroup "Corner"
|
|
[ testGroup "instance Opposite"
|
|
[ testProperty "involutive" $ \corner ->
|
|
opposite (opposite corner) === corner
|
|
]
|
|
]
|
|
|
|
, testGroup "Edge"
|
|
[ testGroup "instance Opposite"
|
|
[ testProperty "involutive" $ \edge ->
|
|
opposite (opposite edge) === edge
|
|
]
|
|
]
|
|
|
|
, testGroup "Box"
|
|
[ testGroup "boxIntersects"
|
|
[ testProperty "True" $ \dims ->
|
|
boxIntersects (Box @Word (V2 1 1) (V2 2 2))
|
|
(Box (V2 2 2) dims)
|
|
, testProperty "False" $ \dims ->
|
|
not $ boxIntersects (Box @Word (V2 1 1) (V2 2 2))
|
|
(Box (V2 4 2) dims)
|
|
]
|
|
]
|
|
]
|