58fce2ec19
As the character walks around the map, progressively reveal the entities on the map to them, using an algorithm based on well known circle-rasterizing and line-rasterizing algorithms to calculate lines of sight that are potentially obscured by walls.
30 lines
1.1 KiB
Haskell
30 lines
1.1 KiB
Haskell
{-# LANGUAGE ApplicativeDo #-}
|
|
--------------------------------------------------------------------------------
|
|
module Xanthous.Data.EntityMapSpec where
|
|
--------------------------------------------------------------------------------
|
|
import Test.Prelude
|
|
--------------------------------------------------------------------------------
|
|
import Xanthous.Data.EntityMap
|
|
--------------------------------------------------------------------------------
|
|
|
|
main :: IO ()
|
|
main = defaultMain test
|
|
|
|
test :: TestTree
|
|
test = localOption (QuickCheckTests 20)
|
|
$ testGroup "Xanthous.Data.EntityMap"
|
|
[ testBatch $ monoid @(EntityMap Int) mempty
|
|
, testGroup "Deduplicate"
|
|
[ testBatch $ monoid @(Deduplicate Int) mempty
|
|
]
|
|
, testGroup "Eq laws"
|
|
[ testProperty "reflexivity" $ \(em :: EntityMap Int) ->
|
|
em == em
|
|
, testProperty "symmetric" $ \(em₁ :: EntityMap Int) em₂ ->
|
|
(em₁ == em₂) == (em₂ == em₁)
|
|
, testProperty "transitive" $ \(em₁ :: EntityMap Int) em₂ em₃ ->
|
|
if (em₁ == em₂ && em₂ == em₃)
|
|
then (em₁ == em₃)
|
|
else True
|
|
]
|
|
]
|