diff options
| author | Yann Herklotz <git@yannherklotz.com> | 2020-05-09 16:40:44 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2020-05-09 16:40:44 +0100 |
| commit | d50a0b5b57aae1c7558fa77c362ae2e36038b63c (patch) | |
| tree | 9baedb7e8ef25c58b37ce78e65ceecb71972a43d /test | |
| parent | 088b5d8694c31f8ac8276afc4fdcfd76ceb69843 (diff) | |
| download | verismith-d50a0b5b57aae1c7558fa77c362ae2e36038b63c.tar.gz verismith-d50a0b5b57aae1c7558fa77c362ae2e36038b63c.zip | |
Add distance function (#75)
* Add distance function
* Add distance measure for lists with testcases
* Add more distance measures for AST
* Add distance to commandline
* Fix distance always giving 0
Diffstat (limited to 'test')
| -rw-r--r-- | test/Distance.hs | 30 | ||||
| -rw-r--r-- | test/Property.hs | 2 |
2 files changed, 32 insertions, 0 deletions
diff --git a/test/Distance.hs b/test/Distance.hs new file mode 100644 index 0000000..a59b401 --- /dev/null +++ b/test/Distance.hs @@ -0,0 +1,30 @@ +module Distance + ( distanceTests + ) +where + +import Hedgehog (Property, (===)) +import qualified Hedgehog as Hog +import qualified Hedgehog.Gen as Hog +import qualified Hedgehog.Range as Hog +import Verismith.Verilog.Distance +import Test.Tasty +import Test.Tasty.Hedgehog + +distanceLess :: Property +distanceLess = Hog.property $ do + x <- Hog.forAll (Hog.list (Hog.linear 0 15) Hog.alpha) + y <- Hog.forAll (Hog.list (Hog.linear 0 15) Hog.alpha) + Hog.assert $ udistance x y <= distance x y + +distanceEq :: Property +distanceEq = Hog.property $ do + x <- Hog.forAll (Hog.list (Hog.linear 0 15) Hog.alpha) + distance x x === 0 + udistance x x === 0 + +distanceTests :: TestTree +distanceTests = testGroup "Distance tests" + [ testProperty "Unordered distance <= distance" distanceLess + , testProperty "distance x x === 0" distanceEq + ] diff --git a/test/Property.hs b/test/Property.hs index 7e1911e..64f9bc6 100644 --- a/test/Property.hs +++ b/test/Property.hs @@ -26,6 +26,7 @@ import Verismith import Verismith.Result import Verismith.Verilog.Lex import Verismith.Verilog.Parser +import Distance (distanceTests) randomDAG' :: Gen Circuit randomDAG' = Hog.resize 30 randomDAG @@ -48,4 +49,5 @@ propertyTests = testGroup "Property Tests" [ testProperty "acyclic graph generation check" acyclicGraph , parserTests + , distanceTests ] |