trackler 2.2.1.54 → 2.2.1.55
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- checksums.yaml +4 -4
- data/lib/trackler/version.rb +1 -1
- data/problem-specifications/exercises/dominoes/description.md +3 -3
- data/problem-specifications/exercises/two-fer/description.md +0 -28
- data/tracks/c/config.json +12 -0
- data/tracks/c/exercises/queen-attack/README.md +65 -0
- data/tracks/c/exercises/queen-attack/makefile +15 -0
- data/tracks/c/exercises/queen-attack/src/example.c +25 -0
- data/tracks/c/exercises/queen-attack/src/queen_attack.h +19 -0
- data/tracks/c/exercises/queen-attack/test/test_queen_attack.c +190 -0
- data/tracks/c/exercises/queen-attack/test/vendor/unity.c +1300 -0
- data/tracks/c/exercises/queen-attack/test/vendor/unity.h +274 -0
- data/tracks/c/exercises/queen-attack/test/vendor/unity_internals.h +701 -0
- data/tracks/common-lisp/exercises/acronym/README.md +1 -1
- data/tracks/delphi/exercises/two-fer/README.md +0 -28
- data/tracks/ecmascript/config.json +41 -0
- data/tracks/ecmascript/exercises/accumulate/package.json +5 -3
- data/tracks/ecmascript/exercises/acronym/package.json +5 -3
- data/tracks/ecmascript/exercises/all-your-base/package.json +5 -3
- data/tracks/ecmascript/exercises/allergies/package.json +5 -3
- data/tracks/ecmascript/exercises/alphametics/package.json +5 -3
- data/tracks/ecmascript/exercises/anagram/package.json +5 -3
- data/tracks/ecmascript/exercises/atbash-cipher/package.json +5 -3
- data/tracks/ecmascript/exercises/beer-song/package.json +5 -3
- data/tracks/ecmascript/exercises/binary-search-tree/package.json +5 -3
- data/tracks/ecmascript/exercises/binary-search/package.json +5 -3
- data/tracks/ecmascript/exercises/binary/package.json +5 -3
- data/tracks/ecmascript/exercises/bob/package.json +5 -3
- data/tracks/ecmascript/exercises/bowling/package.json +2 -2
- data/tracks/ecmascript/exercises/bracket-push/package.json +5 -3
- data/tracks/ecmascript/exercises/change/README.md +44 -0
- data/tracks/ecmascript/exercises/change/change.spec.js +80 -0
- data/tracks/ecmascript/exercises/change/example.js +120 -0
- data/tracks/ecmascript/exercises/change/package.json +69 -0
- data/tracks/ecmascript/exercises/circular-buffer/package.json +5 -3
- data/tracks/ecmascript/exercises/clock/package.json +5 -3
- data/tracks/ecmascript/exercises/collatz-conjecture/package.json +6 -4
- data/tracks/ecmascript/exercises/connect/package.json +5 -3
- data/tracks/ecmascript/exercises/crypto-square/package.json +5 -3
- data/tracks/ecmascript/exercises/custom-set/package.json +5 -3
- data/tracks/ecmascript/exercises/diamond/package.json +5 -3
- data/tracks/ecmascript/exercises/difference-of-squares/package.json +5 -3
- data/tracks/ecmascript/exercises/diffie-hellman/package.json +5 -3
- data/tracks/ecmascript/exercises/etl/package.json +5 -3
- data/tracks/ecmascript/exercises/flatten-array/package.json +5 -3
- data/tracks/ecmascript/exercises/food-chain/package.json +5 -3
- data/tracks/ecmascript/exercises/gigasecond/package.json +5 -3
- data/tracks/ecmascript/exercises/grade-school/package.json +5 -3
- data/tracks/ecmascript/exercises/grains/package.json +5 -3
- data/tracks/ecmascript/exercises/hamming/package.json +5 -3
- data/tracks/ecmascript/exercises/hello-world/package.json +5 -3
- data/tracks/ecmascript/exercises/hexadecimal/package.json +5 -3
- data/tracks/ecmascript/exercises/isbn-verifier/README.md +62 -0
- data/tracks/ecmascript/exercises/isbn-verifier/example.js +17 -0
- data/tracks/ecmascript/exercises/isbn-verifier/isbn-verifier.spec.js +81 -0
- data/tracks/ecmascript/exercises/isbn-verifier/package.json +71 -0
- data/tracks/ecmascript/exercises/isogram/package.json +5 -3
- data/tracks/ecmascript/exercises/kindergarten-garden/package.json +5 -3
- data/tracks/ecmascript/exercises/largest-series-product/package.json +5 -3
- data/tracks/ecmascript/exercises/leap/package.json +5 -3
- data/tracks/ecmascript/exercises/linked-list/package.json +5 -3
- data/tracks/ecmascript/exercises/list-ops/package.json +5 -3
- data/tracks/ecmascript/exercises/luhn/package.json +5 -3
- data/tracks/ecmascript/exercises/matrix/package.json +5 -3
- data/tracks/ecmascript/exercises/meetup/package.json +5 -3
- data/tracks/ecmascript/exercises/minesweeper/package.json +5 -3
- data/tracks/ecmascript/exercises/nth-prime/package.json +5 -3
- data/tracks/ecmascript/exercises/ocr-numbers/package.json +5 -3
- data/tracks/ecmascript/exercises/octal/package.json +5 -3
- data/tracks/ecmascript/exercises/palindrome-products/package.json +5 -3
- data/tracks/ecmascript/exercises/pangram/package.json +5 -3
- data/tracks/ecmascript/exercises/pascals-triangle/package.json +5 -3
- data/tracks/ecmascript/exercises/perfect-numbers/package.json +5 -3
- data/tracks/ecmascript/exercises/phone-number/package.json +5 -3
- data/tracks/ecmascript/exercises/pig-latin/package.json +5 -3
- data/tracks/ecmascript/exercises/prime-factors/package.json +5 -3
- data/tracks/ecmascript/exercises/proverb/package.json +5 -3
- data/tracks/ecmascript/exercises/pythagorean-triplet/package.json +5 -3
- data/tracks/ecmascript/exercises/queen-attack/package.json +5 -3
- data/tracks/ecmascript/exercises/raindrops/package.json +5 -3
- data/tracks/ecmascript/exercises/rna-transcription/package.json +5 -3
- data/tracks/ecmascript/exercises/robot-name/package.json +5 -3
- data/tracks/ecmascript/exercises/robot-simulator/package.json +5 -3
- data/tracks/ecmascript/exercises/roman-numerals/package.json +5 -3
- data/tracks/ecmascript/exercises/run-length-encoding/package.json +5 -3
- data/tracks/ecmascript/exercises/saddle-points/package.json +5 -3
- data/tracks/ecmascript/exercises/say/package.json +5 -3
- data/tracks/ecmascript/exercises/scrabble-score/package.json +5 -3
- data/tracks/ecmascript/exercises/secret-handshake/package.json +5 -3
- data/tracks/ecmascript/exercises/series/package.json +5 -3
- data/tracks/ecmascript/exercises/sieve/package.json +5 -3
- data/tracks/ecmascript/exercises/simple-cipher/package.json +5 -3
- data/tracks/ecmascript/exercises/simple-linked-list/package.json +5 -3
- data/tracks/ecmascript/exercises/space-age/package.json +5 -3
- data/tracks/ecmascript/exercises/strain/package.json +5 -3
- data/tracks/ecmascript/exercises/sublist/package.json +5 -3
- data/tracks/ecmascript/exercises/sum-of-multiples/package.json +5 -3
- data/tracks/ecmascript/exercises/transpose/README.md +94 -0
- data/tracks/ecmascript/exercises/transpose/example.js +12 -0
- data/tracks/ecmascript/exercises/transpose/package.json +71 -0
- data/tracks/ecmascript/exercises/transpose/transpose.spec.js +67 -0
- data/tracks/ecmascript/exercises/triangle/package.json +5 -3
- data/tracks/ecmascript/exercises/trinary/package.json +5 -3
- data/tracks/ecmascript/exercises/twelve-days/package.json +5 -3
- data/tracks/ecmascript/exercises/two-bucket/package.json +5 -3
- data/tracks/ecmascript/exercises/two-fer/package.json +5 -3
- data/tracks/ecmascript/exercises/word-count/package.json +5 -3
- data/tracks/ecmascript/exercises/word-search/package.json +5 -3
- data/tracks/ecmascript/exercises/wordy/package.json +5 -3
- data/tracks/ecmascript/package-lock.json +6219 -0
- data/tracks/ecmascript/package.json +5 -3
- data/tracks/erlang/exercises/collatz-conjecture/src/collatz_conjecture.erl +3 -4
- data/tracks/erlang/exercises/collatz-conjecture/src/example.erl +3 -3
- data/tracks/erlang/exercises/collatz-conjecture/test/collatz_conjecture_tests.erl +13 -9
- data/tracks/erlang/exercises/hello-world/src/hello_world.erl +2 -2
- data/tracks/erlang/exercises/leap/src/example.erl +1 -1
- data/tracks/erlang/exercises/leap/src/leap.erl +3 -3
- data/tracks/erlang/exercises/leap/test/leap_tests.erl +9 -9
- data/tracks/erlang/testgen/src/testgen.erl +16 -13
- data/tracks/erlang/testgen/src/tgen.erl +65 -38
- data/tracks/erlang/testgen/src/tgen_collatz-conjecture.erl +38 -0
- data/tracks/erlang/testgen/src/tgen_hello-world.erl +11 -19
- data/tracks/erlang/testgen/src/tgen_leap.erl +31 -0
- data/tracks/erlang/testgen/src/tgs.erl +80 -0
- data/tracks/fsharp/exercises/alphametics/AlphameticsTest.fs +78 -23
- data/tracks/fsharp/exercises/anagram/AnagramTest.fs +66 -34
- data/tracks/fsharp/exercises/connect/ConnectTest.fs +81 -68
- data/tracks/fsharp/exercises/connect/Example.fs +9 -5
- data/tracks/fsharp/exercises/food-chain/Example.fs +5 -9
- data/tracks/fsharp/exercises/food-chain/FoodChain.fs +2 -2
- data/tracks/fsharp/exercises/food-chain/FoodChainTest.fs +143 -75
- data/tracks/fsharp/exercises/hamming/Example.fs +8 -4
- data/tracks/fsharp/exercises/hamming/Hamming.fs +1 -1
- data/tracks/fsharp/exercises/hamming/HammingTest.fs +53 -13
- data/tracks/fsharp/exercises/house/Example.fs +5 -6
- data/tracks/fsharp/exercises/house/House.fs +3 -1
- data/tracks/fsharp/exercises/house/HouseTest.fs +272 -96
- data/tracks/fsharp/exercises/meetup/Example.fs +1 -1
- data/tracks/fsharp/exercises/meetup/Meetup.fs +1 -1
- data/tracks/fsharp/exercises/meetup/MeetupTest.fs +384 -73
- data/tracks/fsharp/exercises/ocr-numbers/Example.fs +43 -35
- data/tracks/fsharp/exercises/ocr-numbers/OcrNumbersTest.fs +160 -125
- data/tracks/fsharp/exercises/two-fer/Example.fs +4 -2
- data/tracks/fsharp/exercises/two-fer/TwoFer.fs +1 -1
- data/tracks/fsharp/exercises/two-fer/TwoFerTest.fs +7 -4
- data/tracks/fsharp/generators/Common.fs +6 -2
- data/tracks/fsharp/generators/Exercise.fs +14 -13
- data/tracks/fsharp/generators/Generators.fs +145 -2
- data/tracks/fsharp/generators/Options.fs +4 -6
- data/tracks/fsharp/generators/Output.fs +2 -2
- data/tracks/fsharp/generators/Program.fs +4 -3
- data/tracks/java/exercises/saddle-points/README.md +1 -1
- data/tracks/java/exercises/two-fer/README.md +0 -28
- data/tracks/javascript/exercises/beer-song/example.js +18 -14
- data/tracks/kotlin/exercises/saddle-points/README.md +1 -1
- data/tracks/kotlin/exercises/two-fer/README.md +0 -28
- data/tracks/lua/config.json +12 -0
- data/tracks/lua/exercises/collatz-conjecture/README.md +43 -0
- data/tracks/lua/exercises/collatz-conjecture/collatz-conjecture_spec.lua +33 -0
- data/tracks/lua/exercises/collatz-conjecture/example.lua +16 -0
- data/tracks/python/config.json +4 -1
- data/tracks/python/exercises/binary-search/binary_search_test.py +2 -0
- data/tracks/python/exercises/change/change_test.py +2 -0
- data/tracks/python/exercises/circular-buffer/circular_buffer_test.py +56 -50
- data/tracks/python/exercises/forth/example.py +3 -1
- data/tracks/python/exercises/forth/forth_test.py +43 -26
- data/tracks/python/exercises/nth-prime/nth_prime.py +1 -1
- data/tracks/python/exercises/rna-transcription/README.md +5 -0
- data/tracks/python/exercises/rna-transcription/example.py +1 -1
- data/tracks/python/exercises/rna-transcription/rna_transcription_test.py +7 -4
- data/tracks/python/exercises/robot-simulator/robot_simulator_test.py +9 -7
- data/tracks/python/exercises/saddle-points/saddle_points_test.py +15 -5
- data/tracks/python/exercises/simple-cipher/simple_cipher.py +7 -1
- data/tracks/python/exercises/word-count/example.py +6 -4
- data/tracks/python/exercises/word-count/word_count_test.py +49 -22
- data/tracks/python/exercises/word-search/word_search_test.py +104 -12
- data/tracks/rust/.travis.yml +2 -0
- data/tracks/rust/README.md +5 -0
- data/tracks/rust/_test/check-exercises.sh +0 -6
- data/tracks/rust/_test/ensure-lib-src-rs-exist.sh +19 -0
- data/tracks/rust/_test/ensure-stubs-compile.sh +26 -0
- data/tracks/rust/config.json +12 -0
- data/tracks/rust/config/exercise-readme-insert.md +3 -2
- data/tracks/rust/docs/ABOUT.md +2 -2
- data/tracks/rust/docs/LEARNING.md +1 -1
- data/tracks/rust/docs/RESOURCES.md +1 -1
- data/tracks/rust/docs/TESTS.md +2 -2
- data/tracks/rust/exercises/accumulate/README.md +3 -2
- data/tracks/rust/exercises/acronym/README.md +3 -2
- data/tracks/rust/exercises/all-your-base/README.md +3 -2
- data/tracks/rust/exercises/allergies/README.md +3 -2
- data/tracks/rust/exercises/alphametics/README.md +3 -2
- data/tracks/rust/exercises/anagram/README.md +3 -2
- data/tracks/rust/exercises/atbash-cipher/README.md +3 -2
- data/tracks/rust/exercises/beer-song/README.md +3 -2
- data/tracks/rust/exercises/beer-song/src/lib.rs +2 -2
- data/tracks/rust/exercises/binary-search/README.md +3 -2
- data/tracks/rust/exercises/bob/README.md +3 -2
- data/tracks/rust/exercises/bob/src/lib.rs +1 -1
- data/tracks/rust/exercises/bowling/README.md +3 -2
- data/tracks/rust/exercises/bracket-push/HINTS.md +1 -1
- data/tracks/rust/exercises/bracket-push/README.md +4 -3
- data/tracks/rust/exercises/circular-buffer/README.md +3 -2
- data/tracks/rust/exercises/clock/README.md +3 -2
- data/tracks/rust/exercises/collatz-conjecture/README.md +3 -2
- data/tracks/rust/exercises/collatz-conjecture/src/lib.rs +1 -1
- data/tracks/rust/exercises/crypto-square/README.md +3 -2
- data/tracks/rust/exercises/custom-set/README.md +3 -2
- data/tracks/rust/exercises/decimal/.meta/ALLOWED_TO_NOT_COMPILE +2 -0
- data/tracks/rust/exercises/decimal/README.md +3 -2
- data/tracks/rust/exercises/difference-of-squares/README.md +3 -2
- data/tracks/rust/exercises/difference-of-squares/src/lib.rs +3 -3
- data/tracks/rust/exercises/dominoes/README.md +3 -2
- data/tracks/rust/exercises/etl/README.md +3 -2
- data/tracks/rust/exercises/forth/README.md +3 -2
- data/tracks/rust/exercises/forth/src/lib.rs +3 -0
- data/tracks/rust/exercises/gigasecond/README.md +3 -2
- data/tracks/rust/exercises/grade-school/README.md +3 -2
- data/tracks/rust/exercises/grains/README.md +3 -2
- data/tracks/rust/exercises/hamming/README.md +3 -2
- data/tracks/rust/exercises/hello-world/GETTING_STARTED.md +1 -1
- data/tracks/rust/exercises/hello-world/README.md +3 -2
- data/tracks/rust/exercises/hexadecimal/README.md +3 -2
- data/tracks/rust/exercises/isogram/.gitignore +8 -0
- data/tracks/rust/exercises/isogram/Cargo.toml +3 -0
- data/tracks/rust/exercises/isogram/README.md +52 -0
- data/tracks/rust/exercises/isogram/example.rs +12 -0
- data/tracks/rust/exercises/isogram/src/lib.rs +0 -0
- data/tracks/rust/exercises/isogram/tests/isogram.rs +72 -0
- data/tracks/rust/exercises/largest-series-product/README.md +3 -2
- data/tracks/rust/exercises/leap/README.md +3 -2
- data/tracks/rust/exercises/leap/src/lib.rs +1 -1
- data/tracks/rust/exercises/luhn-from/README.md +3 -2
- data/tracks/rust/exercises/luhn-trait/.meta/description.md +2 -2
- data/tracks/rust/exercises/luhn-trait/README.md +5 -4
- data/tracks/rust/exercises/luhn/README.md +3 -2
- data/tracks/rust/exercises/minesweeper/README.md +3 -2
- data/tracks/rust/exercises/nth-prime/README.md +3 -2
- data/tracks/rust/exercises/nucleotide-codons/README.md +3 -2
- data/tracks/rust/exercises/nucleotide-count/README.md +3 -2
- data/tracks/rust/exercises/ocr-numbers/README.md +3 -2
- data/tracks/rust/exercises/pangram/README.md +3 -2
- data/tracks/rust/exercises/parallel-letter-frequency/HINTS.md +1 -1
- data/tracks/rust/exercises/parallel-letter-frequency/README.md +4 -3
- data/tracks/rust/exercises/pascals-triangle/README.md +3 -2
- data/tracks/rust/exercises/perfect-numbers/README.md +3 -2
- data/tracks/rust/exercises/phone-number/README.md +3 -2
- data/tracks/rust/exercises/pig-latin/README.md +3 -2
- data/tracks/rust/exercises/poker/README.md +3 -2
- data/tracks/rust/exercises/prime-factors/README.md +3 -2
- data/tracks/rust/exercises/protein-translation/README.md +3 -2
- data/tracks/rust/exercises/proverb/README.md +3 -2
- data/tracks/rust/exercises/proverb/src/lib.rs +1 -1
- data/tracks/rust/exercises/pythagorean-triplet/README.md +3 -2
- data/tracks/rust/exercises/queen-attack/README.md +3 -2
- data/tracks/rust/exercises/raindrops/README.md +3 -2
- data/tracks/rust/exercises/raindrops/src/lib.rs +1 -1
- data/tracks/rust/exercises/react/README.md +3 -2
- data/tracks/rust/exercises/rectangles/README.md +3 -2
- data/tracks/rust/exercises/rna-transcription/README.md +3 -2
- data/tracks/rust/exercises/robot-name/README.md +3 -2
- data/tracks/rust/exercises/robot-simulator/README.md +3 -2
- data/tracks/rust/exercises/roman-numerals/README.md +3 -2
- data/tracks/rust/exercises/rotational-cipher/README.md +3 -2
- data/tracks/rust/exercises/run-length-encoding/README.md +3 -2
- data/tracks/rust/exercises/say/README.md +3 -2
- data/tracks/rust/exercises/scrabble-score/README.md +3 -2
- data/tracks/rust/exercises/sieve/README.md +3 -2
- data/tracks/rust/exercises/space-age/README.md +3 -2
- data/tracks/rust/exercises/sublist/README.md +3 -2
- data/tracks/rust/exercises/sum-of-multiples/README.md +3 -2
- data/tracks/rust/exercises/sum-of-multiples/src/lib.rs +1 -1
- data/tracks/rust/exercises/tournament/README.md +3 -2
- data/tracks/rust/exercises/triangle/HINTS.md +2 -2
- data/tracks/rust/exercises/triangle/README.md +5 -4
- data/tracks/rust/exercises/variable-length-quantity/README.md +3 -2
- data/tracks/rust/exercises/word-count/README.md +3 -2
- data/tracks/rust/exercises/wordy/README.md +3 -2
- metadata +38 -3
- data/tracks/ecmascript/yarn.lock +0 -3144
checksums.yaml
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
---
|
|
2
2
|
SHA1:
|
|
3
|
-
metadata.gz:
|
|
4
|
-
data.tar.gz:
|
|
3
|
+
metadata.gz: f3a2949812d8896565fdc94b7e575782eae5e655
|
|
4
|
+
data.tar.gz: 651589d72bebc56d98389e62c426f073e8041eb9
|
|
5
5
|
SHA512:
|
|
6
|
-
metadata.gz:
|
|
7
|
-
data.tar.gz:
|
|
6
|
+
metadata.gz: 1cea56c0f33205d1f42bdebe2ba12a7ebb7f403dd6b6862fb73127679961fd2a42ec2b14a1a32c3277d82a6162ed70a772948b288b93adeecad070d6ce4fdbff
|
|
7
|
+
data.tar.gz: 35fabeed490a5830e2549ca93ad28312dc30234b94e2b7df4b1602b4076c35ee1f6c8274b90e8b5ef1ecabf8095f997a9a0422d79567c46066a29721c3cefcfc
|
data/lib/trackler/version.rb
CHANGED
|
@@ -5,9 +5,9 @@ correct domino chain (the dots on one half of a stone match the dots on the
|
|
|
5
5
|
neighbouring half of an adjacent stone) and that dots on the halfs of the stones
|
|
6
6
|
which don't have a neighbour (the first and last stone) match each other.
|
|
7
7
|
|
|
8
|
-
For example given the stones `
|
|
9
|
-
like `
|
|
8
|
+
For example given the stones `[2|1]`, `[2|3]` and `[1|3]` you should compute something
|
|
9
|
+
like `[1|2] [2|3] [3|1]` or `[3|2] [2|1] [1|3]` or `[1|3] [3|2] [2|1]` etc, where the first and last numbers are the same.
|
|
10
10
|
|
|
11
|
-
For stones
|
|
11
|
+
For stones `[1|2]`, `[4|1]` and `[2|3]` the resulting chain is not valid: `[4|1] [1|2] [2|3]`'s first and last numbers are not the same. 4 != 3
|
|
12
12
|
|
|
13
13
|
Some test cases may use duplicate stones in a chain solution, assume that multiple Domino sets are being used.
|
|
@@ -9,31 +9,3 @@ When X is a name or "you".
|
|
|
9
9
|
If the given name is "Alice", the result should be "One for Alice, one for me."
|
|
10
10
|
If no name is given, the result should be "One for you, one for me."
|
|
11
11
|
|
|
12
|
-
## Test-Driven Development
|
|
13
|
-
|
|
14
|
-
As programmers mature, they eventually want to test their code.
|
|
15
|
-
|
|
16
|
-
Here at Exercism we simulate [Test-Driven
|
|
17
|
-
Development](http://en.wikipedia.org/wiki/Test-driven_development) (TDD), where
|
|
18
|
-
you write your tests before writing any functionality. The simulation comes in
|
|
19
|
-
the form of a pre-written test suite, which will signal that you have solved
|
|
20
|
-
the problem.
|
|
21
|
-
|
|
22
|
-
It will also provide you with a safety net to explore other solutions without
|
|
23
|
-
breaking the functionality.
|
|
24
|
-
|
|
25
|
-
### A typical TDD workflow on Exercism:
|
|
26
|
-
|
|
27
|
-
1. Run the test file and pick one test that's failing.
|
|
28
|
-
2. Write some code to fix the test you picked.
|
|
29
|
-
3. Re-run the tests to confirm the test is now passing.
|
|
30
|
-
4. Repeat from step 1.
|
|
31
|
-
5. Submit your solution (`exercism submit /path/to/file`)
|
|
32
|
-
|
|
33
|
-
## Instructions
|
|
34
|
-
|
|
35
|
-
Submissions are encouraged to be general, within reason. Having said that, it's
|
|
36
|
-
also important not to over-engineer a solution.
|
|
37
|
-
|
|
38
|
-
It's important to remember that the goal is to make code as expressive and
|
|
39
|
-
readable as we can.
|
data/tracks/c/config.json
CHANGED
|
@@ -452,6 +452,18 @@
|
|
|
452
452
|
"mathematics"
|
|
453
453
|
],
|
|
454
454
|
"uuid": "1f68f837-6432-4f9e-afae-0cb17f8e0153"
|
|
455
|
+
},
|
|
456
|
+
{
|
|
457
|
+
"core": true,
|
|
458
|
+
"difficulty": 1,
|
|
459
|
+
"slug": "queen-attack",
|
|
460
|
+
"topics": [
|
|
461
|
+
"control_flow_if_statements",
|
|
462
|
+
"functions",
|
|
463
|
+
"structs",
|
|
464
|
+
"enums"
|
|
465
|
+
],
|
|
466
|
+
"uuid": "ae266e01-0e88-6c80-ed67-eada1a30f8b4"
|
|
455
467
|
}
|
|
456
468
|
],
|
|
457
469
|
"foregone": [],
|
|
@@ -0,0 +1,65 @@
|
|
|
1
|
+
# Queen Attack
|
|
2
|
+
|
|
3
|
+
Given the position of two queens on a chess board, indicate whether or not they
|
|
4
|
+
are positioned so that they can attack each other.
|
|
5
|
+
|
|
6
|
+
In the game of chess, a queen can attack pieces which are on the same
|
|
7
|
+
row, column, or diagonal.
|
|
8
|
+
|
|
9
|
+
A chessboard can be represented by an 8 by 8 array.
|
|
10
|
+
|
|
11
|
+
So if you're told the white queen is at (2, 3) and the black queen at
|
|
12
|
+
(5, 6), then you'd know you've got a set-up like so:
|
|
13
|
+
|
|
14
|
+
```text
|
|
15
|
+
_ _ _ _ _ _ _ _
|
|
16
|
+
_ _ _ _ _ _ _ _
|
|
17
|
+
_ _ _ W _ _ _ _
|
|
18
|
+
_ _ _ _ _ _ _ _
|
|
19
|
+
_ _ _ _ _ _ _ _
|
|
20
|
+
_ _ _ _ _ _ B _
|
|
21
|
+
_ _ _ _ _ _ _ _
|
|
22
|
+
_ _ _ _ _ _ _ _
|
|
23
|
+
```
|
|
24
|
+
|
|
25
|
+
You'd also be able to answer whether the queens can attack each other.
|
|
26
|
+
In this case, that answer would be yes, they can, because both pieces
|
|
27
|
+
share a diagonal.
|
|
28
|
+
|
|
29
|
+
## Getting Started
|
|
30
|
+
|
|
31
|
+
Make sure you have read the
|
|
32
|
+
[C page](http://exercism.io/languages/c) on the Exercism site. This covers
|
|
33
|
+
the basic information on setting up the development environment expected
|
|
34
|
+
by the exercises.
|
|
35
|
+
|
|
36
|
+
|
|
37
|
+
## Passing the Tests
|
|
38
|
+
|
|
39
|
+
Get the first test compiling, linking and passing by following the [three
|
|
40
|
+
rules of test-driven development][3-tdd-rules].
|
|
41
|
+
|
|
42
|
+
The included makefile can be used to create and run the tests using the `test`
|
|
43
|
+
task.
|
|
44
|
+
|
|
45
|
+
make test
|
|
46
|
+
|
|
47
|
+
Create just the functions you need to satisfy any compiler errors and get the
|
|
48
|
+
test to fail. Then write just enough code to get the test to pass. Once you've
|
|
49
|
+
done that, move onto the next test.
|
|
50
|
+
|
|
51
|
+
[3-tdd-rules]: http://butunclebob.com/ArticleS.UncleBob.TheThreeRulesOfTdd
|
|
52
|
+
|
|
53
|
+
As you progress through the tests, take the time to refactor your
|
|
54
|
+
implementation for readability and expressiveness and then go on to the next
|
|
55
|
+
test.
|
|
56
|
+
|
|
57
|
+
Try to use standard C99 facilities in preference to writing your own
|
|
58
|
+
low-level algorithms or facilities by hand.
|
|
59
|
+
|
|
60
|
+
## Source
|
|
61
|
+
|
|
62
|
+
J Dalbey's Programming Practice problems [http://users.csc.calpoly.edu/~jdalbey/103/Projects/ProgrammingPractice.html](http://users.csc.calpoly.edu/~jdalbey/103/Projects/ProgrammingPractice.html)
|
|
63
|
+
|
|
64
|
+
## Submitting Incomplete Solutions
|
|
65
|
+
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
|
|
@@ -0,0 +1,15 @@
|
|
|
1
|
+
CFLAGS = -std=c99
|
|
2
|
+
CFLAGS += -Wall
|
|
3
|
+
CFLAGS += -Wextra
|
|
4
|
+
CFLAGS += -pedantic
|
|
5
|
+
CFLAGS += -Werror
|
|
6
|
+
|
|
7
|
+
test: tests.out
|
|
8
|
+
@./tests.out
|
|
9
|
+
|
|
10
|
+
clean:
|
|
11
|
+
rm -f *.o *.out
|
|
12
|
+
|
|
13
|
+
tests.out: test/test_queen_attack.c src/queen_attack.c src/queen_attack.h
|
|
14
|
+
@echo Compiling $@
|
|
15
|
+
@cc $(CFLAGS) src/queen_attack.c test/vendor/unity.c test/test_queen_attack.c -o tests.out
|
|
@@ -0,0 +1,25 @@
|
|
|
1
|
+
#include "queen_attack.h"
|
|
2
|
+
|
|
3
|
+
#define ROW_COUNT 8
|
|
4
|
+
#define COLUMN_COUNT 8
|
|
5
|
+
|
|
6
|
+
attack_status_t can_attack(position_t white_queen, position_t black_queen)
|
|
7
|
+
{
|
|
8
|
+
if ((white_queen.column == black_queen.column
|
|
9
|
+
&& white_queen.row == black_queen.row) || white_queen.row >= ROW_COUNT
|
|
10
|
+
|| white_queen.column >= COLUMN_COUNT || black_queen.row >= ROW_COUNT
|
|
11
|
+
|| black_queen.column >= COLUMN_COUNT) {
|
|
12
|
+
return INVALID_POSITION;
|
|
13
|
+
}
|
|
14
|
+
|
|
15
|
+
if (white_queen.column == black_queen.column ||
|
|
16
|
+
white_queen.row == black_queen.row ||
|
|
17
|
+
(white_queen.row - black_queen.row ==
|
|
18
|
+
white_queen.column - black_queen.column)
|
|
19
|
+
|| (white_queen.row - black_queen.row ==
|
|
20
|
+
black_queen.column - white_queen.column)) {
|
|
21
|
+
return CAN_ATTACK;
|
|
22
|
+
}
|
|
23
|
+
|
|
24
|
+
return CAN_NOT_ATTACK;
|
|
25
|
+
}
|
|
@@ -0,0 +1,19 @@
|
|
|
1
|
+
#ifndef QUEEN_ATTACK_H
|
|
2
|
+
#define QUEEN_ATTACK_H
|
|
3
|
+
|
|
4
|
+
#include <stdint.h>
|
|
5
|
+
|
|
6
|
+
typedef enum {
|
|
7
|
+
CAN_NOT_ATTACK,
|
|
8
|
+
CAN_ATTACK,
|
|
9
|
+
INVALID_POSITION
|
|
10
|
+
} attack_status_t;
|
|
11
|
+
|
|
12
|
+
typedef struct {
|
|
13
|
+
uint8_t row;
|
|
14
|
+
uint8_t column;
|
|
15
|
+
} position_t;
|
|
16
|
+
|
|
17
|
+
attack_status_t can_attack(position_t queen_1, position_t queen_2);
|
|
18
|
+
|
|
19
|
+
#endif
|
|
@@ -0,0 +1,190 @@
|
|
|
1
|
+
#include "vendor/unity.h"
|
|
2
|
+
#include "../src/queen_attack.h"
|
|
3
|
+
|
|
4
|
+
void test_invalid_if_on_same_position(void)
|
|
5
|
+
{
|
|
6
|
+
position_t white_queen;
|
|
7
|
+
position_t black_queen;
|
|
8
|
+
|
|
9
|
+
white_queen.column = 2;
|
|
10
|
+
white_queen.row = 5;
|
|
11
|
+
black_queen.column = white_queen.column;
|
|
12
|
+
black_queen.row = white_queen.row;
|
|
13
|
+
|
|
14
|
+
TEST_ASSERT_EQUAL(INVALID_POSITION, can_attack(white_queen, black_queen));
|
|
15
|
+
}
|
|
16
|
+
|
|
17
|
+
void test_white_queen_must_have_row_on_board(void)
|
|
18
|
+
{
|
|
19
|
+
TEST_IGNORE();
|
|
20
|
+
position_t white_queen;
|
|
21
|
+
position_t black_queen;
|
|
22
|
+
|
|
23
|
+
white_queen.column = 2;
|
|
24
|
+
white_queen.row = 8;
|
|
25
|
+
black_queen.column = 0;
|
|
26
|
+
black_queen.row = 0;
|
|
27
|
+
|
|
28
|
+
TEST_ASSERT_EQUAL(INVALID_POSITION, can_attack(white_queen, black_queen));
|
|
29
|
+
}
|
|
30
|
+
|
|
31
|
+
void test_white_queen_must_have_column_on_board(void)
|
|
32
|
+
{
|
|
33
|
+
TEST_IGNORE();
|
|
34
|
+
position_t white_queen;
|
|
35
|
+
position_t black_queen;
|
|
36
|
+
|
|
37
|
+
white_queen.column = 8;
|
|
38
|
+
white_queen.row = 2;
|
|
39
|
+
black_queen.column = 0;
|
|
40
|
+
black_queen.row = 0;
|
|
41
|
+
|
|
42
|
+
TEST_ASSERT_EQUAL(INVALID_POSITION, can_attack(white_queen, black_queen));
|
|
43
|
+
}
|
|
44
|
+
|
|
45
|
+
void test_black_queen_must_have_row_on_board(void)
|
|
46
|
+
{
|
|
47
|
+
TEST_IGNORE();
|
|
48
|
+
position_t white_queen;
|
|
49
|
+
position_t black_queen;
|
|
50
|
+
|
|
51
|
+
white_queen.column = 0;
|
|
52
|
+
white_queen.row = 0;
|
|
53
|
+
black_queen.column = 2;
|
|
54
|
+
black_queen.row = 10;
|
|
55
|
+
|
|
56
|
+
TEST_ASSERT_EQUAL(INVALID_POSITION, can_attack(white_queen, black_queen));
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
void test_black_queen_must_have_column_on_board(void)
|
|
60
|
+
{
|
|
61
|
+
TEST_IGNORE();
|
|
62
|
+
position_t white_queen;
|
|
63
|
+
position_t black_queen;
|
|
64
|
+
|
|
65
|
+
white_queen.column = 0;
|
|
66
|
+
white_queen.row = 0;
|
|
67
|
+
black_queen.column = 9;
|
|
68
|
+
black_queen.row = 4;
|
|
69
|
+
|
|
70
|
+
TEST_ASSERT_EQUAL(INVALID_POSITION, can_attack(white_queen, black_queen));
|
|
71
|
+
}
|
|
72
|
+
|
|
73
|
+
void test_can_not_attack(void)
|
|
74
|
+
{
|
|
75
|
+
TEST_IGNORE();
|
|
76
|
+
position_t white_queen;
|
|
77
|
+
position_t black_queen;
|
|
78
|
+
|
|
79
|
+
white_queen.column = 4;
|
|
80
|
+
white_queen.row = 2;
|
|
81
|
+
black_queen.column = 6;
|
|
82
|
+
black_queen.row = 6;
|
|
83
|
+
|
|
84
|
+
TEST_ASSERT_EQUAL(CAN_NOT_ATTACK, can_attack(white_queen, black_queen));
|
|
85
|
+
}
|
|
86
|
+
|
|
87
|
+
void test_can_attack_on_same_row(void)
|
|
88
|
+
{
|
|
89
|
+
TEST_IGNORE();
|
|
90
|
+
position_t white_queen;
|
|
91
|
+
position_t black_queen;
|
|
92
|
+
|
|
93
|
+
white_queen.column = 4;
|
|
94
|
+
white_queen.row = 2;
|
|
95
|
+
black_queen.column = 6;
|
|
96
|
+
black_queen.row = 2;
|
|
97
|
+
|
|
98
|
+
TEST_ASSERT_EQUAL(CAN_ATTACK, can_attack(white_queen, black_queen));
|
|
99
|
+
}
|
|
100
|
+
|
|
101
|
+
void test_can_attack_on_same_column(void)
|
|
102
|
+
{
|
|
103
|
+
TEST_IGNORE();
|
|
104
|
+
position_t white_queen;
|
|
105
|
+
position_t black_queen;
|
|
106
|
+
|
|
107
|
+
white_queen.column = 5;
|
|
108
|
+
white_queen.row = 4;
|
|
109
|
+
black_queen.column = 5;
|
|
110
|
+
black_queen.row = 2;
|
|
111
|
+
|
|
112
|
+
TEST_ASSERT_EQUAL(CAN_ATTACK, can_attack(white_queen, black_queen));
|
|
113
|
+
}
|
|
114
|
+
|
|
115
|
+
void test_can_attack_on_first_diagonal(void)
|
|
116
|
+
{
|
|
117
|
+
TEST_IGNORE();
|
|
118
|
+
position_t white_queen;
|
|
119
|
+
position_t black_queen;
|
|
120
|
+
|
|
121
|
+
white_queen.column = 2;
|
|
122
|
+
white_queen.row = 2;
|
|
123
|
+
black_queen.column = 4;
|
|
124
|
+
black_queen.row = 0;
|
|
125
|
+
|
|
126
|
+
TEST_ASSERT_EQUAL(CAN_ATTACK, can_attack(white_queen, black_queen));
|
|
127
|
+
}
|
|
128
|
+
|
|
129
|
+
void test_can_attack_on_second_diagonal(void)
|
|
130
|
+
{
|
|
131
|
+
TEST_IGNORE();
|
|
132
|
+
position_t white_queen;
|
|
133
|
+
position_t black_queen;
|
|
134
|
+
|
|
135
|
+
white_queen.column = 2;
|
|
136
|
+
white_queen.row = 2;
|
|
137
|
+
black_queen.column = 1;
|
|
138
|
+
black_queen.row = 3;
|
|
139
|
+
|
|
140
|
+
TEST_ASSERT_EQUAL(CAN_ATTACK, can_attack(white_queen, black_queen));
|
|
141
|
+
}
|
|
142
|
+
|
|
143
|
+
void test_can_attack_on_third_diagonal(void)
|
|
144
|
+
{
|
|
145
|
+
TEST_IGNORE();
|
|
146
|
+
position_t white_queen;
|
|
147
|
+
position_t black_queen;
|
|
148
|
+
|
|
149
|
+
white_queen.column = 2;
|
|
150
|
+
white_queen.row = 2;
|
|
151
|
+
black_queen.column = 1;
|
|
152
|
+
black_queen.row = 1;
|
|
153
|
+
|
|
154
|
+
TEST_ASSERT_EQUAL(CAN_ATTACK, can_attack(white_queen, black_queen));
|
|
155
|
+
}
|
|
156
|
+
|
|
157
|
+
void test_can_attack_on_fourth_diagonal(void)
|
|
158
|
+
{
|
|
159
|
+
TEST_IGNORE();
|
|
160
|
+
position_t white_queen;
|
|
161
|
+
position_t black_queen;
|
|
162
|
+
|
|
163
|
+
white_queen.column = 2;
|
|
164
|
+
white_queen.row = 2;
|
|
165
|
+
black_queen.column = 5;
|
|
166
|
+
black_queen.row = 5;
|
|
167
|
+
|
|
168
|
+
TEST_ASSERT_EQUAL(CAN_ATTACK, can_attack(white_queen, black_queen));
|
|
169
|
+
}
|
|
170
|
+
|
|
171
|
+
int main(void)
|
|
172
|
+
{
|
|
173
|
+
UnityBegin("test/test_queen_attack.c");
|
|
174
|
+
|
|
175
|
+
RUN_TEST(test_invalid_if_on_same_position);
|
|
176
|
+
RUN_TEST(test_white_queen_must_have_row_on_board);
|
|
177
|
+
RUN_TEST(test_white_queen_must_have_column_on_board);
|
|
178
|
+
RUN_TEST(test_black_queen_must_have_row_on_board);
|
|
179
|
+
RUN_TEST(test_black_queen_must_have_column_on_board);
|
|
180
|
+
RUN_TEST(test_can_not_attack);
|
|
181
|
+
RUN_TEST(test_can_attack_on_same_row);
|
|
182
|
+
RUN_TEST(test_can_attack_on_same_column);
|
|
183
|
+
RUN_TEST(test_can_attack_on_first_diagonal);
|
|
184
|
+
RUN_TEST(test_can_attack_on_second_diagonal);
|
|
185
|
+
RUN_TEST(test_can_attack_on_third_diagonal);
|
|
186
|
+
RUN_TEST(test_can_attack_on_fourth_diagonal);
|
|
187
|
+
|
|
188
|
+
UnityEnd();
|
|
189
|
+
return 0;
|
|
190
|
+
}
|
|
@@ -0,0 +1,1300 @@
|
|
|
1
|
+
/* =========================================================================
|
|
2
|
+
Unity Project - A Test Framework for C
|
|
3
|
+
Copyright (c) 2007-14 Mike Karlesky, Mark VanderVoord, Greg Williams
|
|
4
|
+
[Released under MIT License. Please refer to license.txt for details]
|
|
5
|
+
============================================================================ */
|
|
6
|
+
|
|
7
|
+
#include "unity.h"
|
|
8
|
+
#include <stddef.h>
|
|
9
|
+
|
|
10
|
+
#define UNITY_FAIL_AND_BAIL { Unity.CurrentTestFailed = 1; longjmp(Unity.AbortFrame, 1); }
|
|
11
|
+
#define UNITY_IGNORE_AND_BAIL { Unity.CurrentTestIgnored = 1; longjmp(Unity.AbortFrame, 1); }
|
|
12
|
+
/// return prematurely if we are already in failure or ignore state
|
|
13
|
+
#define UNITY_SKIP_EXECUTION { if ((Unity.CurrentTestFailed != 0) || (Unity.CurrentTestIgnored != 0)) {return;} }
|
|
14
|
+
#define UNITY_PRINT_EOL { UNITY_OUTPUT_CHAR('\n'); }
|
|
15
|
+
|
|
16
|
+
struct _Unity Unity;
|
|
17
|
+
|
|
18
|
+
const char UnityStrOk[] = "OK";
|
|
19
|
+
const char UnityStrPass[] = "PASS";
|
|
20
|
+
const char UnityStrFail[] = "FAIL";
|
|
21
|
+
const char UnityStrIgnore[] = "IGNORE";
|
|
22
|
+
const char UnityStrNull[] = "NULL";
|
|
23
|
+
const char UnityStrSpacer[] = ". ";
|
|
24
|
+
const char UnityStrExpected[] = " Expected ";
|
|
25
|
+
const char UnityStrWas[] = " Was ";
|
|
26
|
+
const char UnityStrTo[] = " To ";
|
|
27
|
+
const char UnityStrElement[] = " Element ";
|
|
28
|
+
const char UnityStrByte[] = " Byte ";
|
|
29
|
+
const char UnityStrMemory[] = " Memory Mismatch.";
|
|
30
|
+
const char UnityStrDelta[] = " Values Not Within Delta ";
|
|
31
|
+
const char UnityStrPointless[] = " You Asked Me To Compare Nothing, Which Was Pointless.";
|
|
32
|
+
const char UnityStrNullPointerForExpected[] = " Expected pointer to be NULL";
|
|
33
|
+
const char UnityStrNullPointerForActual[] = " Actual pointer was NULL";
|
|
34
|
+
const char UnityStrNot[] = "Not ";
|
|
35
|
+
const char UnityStrInf[] = "Infinity";
|
|
36
|
+
const char UnityStrNegInf[] = "Negative Infinity";
|
|
37
|
+
const char UnityStrNaN[] = "NaN";
|
|
38
|
+
const char UnityStrDet[] = "Determinate";
|
|
39
|
+
const char UnityStrErrFloat[] = "Unity Floating Point Disabled";
|
|
40
|
+
const char UnityStrErrDouble[] = "Unity Double Precision Disabled";
|
|
41
|
+
const char UnityStrErr64[] = "Unity 64-bit Support Disabled";
|
|
42
|
+
const char UnityStrBreaker[] = "-----------------------";
|
|
43
|
+
const char UnityStrResultsTests[] = " Tests ";
|
|
44
|
+
const char UnityStrResultsFailures[] = " Failures ";
|
|
45
|
+
const char UnityStrResultsIgnored[] = " Ignored ";
|
|
46
|
+
|
|
47
|
+
#ifndef UNITY_EXCLUDE_FLOAT
|
|
48
|
+
// Dividing by these constants produces +/- infinity.
|
|
49
|
+
// The rationale is given in UnityAssertFloatIsInf's body.
|
|
50
|
+
static const _UF f_zero = 0.0f;
|
|
51
|
+
#ifndef UNITY_EXCLUDE_DOUBLE
|
|
52
|
+
static const _UD d_zero = 0.0;
|
|
53
|
+
#endif
|
|
54
|
+
#endif
|
|
55
|
+
|
|
56
|
+
// compiler-generic print formatting masks
|
|
57
|
+
const _U_UINT UnitySizeMask[] =
|
|
58
|
+
{
|
|
59
|
+
255u, // 0xFF
|
|
60
|
+
65535u, // 0xFFFF
|
|
61
|
+
65535u,
|
|
62
|
+
4294967295u, // 0xFFFFFFFF
|
|
63
|
+
4294967295u,
|
|
64
|
+
4294967295u,
|
|
65
|
+
4294967295u
|
|
66
|
+
#ifdef UNITY_SUPPORT_64
|
|
67
|
+
,0xFFFFFFFFFFFFFFFF
|
|
68
|
+
#endif
|
|
69
|
+
};
|
|
70
|
+
|
|
71
|
+
void UnityPrintFail(void);
|
|
72
|
+
void UnityPrintOk(void);
|
|
73
|
+
|
|
74
|
+
//-----------------------------------------------
|
|
75
|
+
// Pretty Printers & Test Result Output Handlers
|
|
76
|
+
//-----------------------------------------------
|
|
77
|
+
|
|
78
|
+
void UnityPrint(const char* string)
|
|
79
|
+
{
|
|
80
|
+
const char* pch = string;
|
|
81
|
+
|
|
82
|
+
if (pch != NULL)
|
|
83
|
+
{
|
|
84
|
+
while (*pch)
|
|
85
|
+
{
|
|
86
|
+
// printable characters plus CR & LF are printed
|
|
87
|
+
if ((*pch <= 126) && (*pch >= 32))
|
|
88
|
+
{
|
|
89
|
+
UNITY_OUTPUT_CHAR(*pch);
|
|
90
|
+
}
|
|
91
|
+
//write escaped carriage returns
|
|
92
|
+
else if (*pch == 13)
|
|
93
|
+
{
|
|
94
|
+
UNITY_OUTPUT_CHAR('\\');
|
|
95
|
+
UNITY_OUTPUT_CHAR('r');
|
|
96
|
+
}
|
|
97
|
+
//write escaped line feeds
|
|
98
|
+
else if (*pch == 10)
|
|
99
|
+
{
|
|
100
|
+
UNITY_OUTPUT_CHAR('\\');
|
|
101
|
+
UNITY_OUTPUT_CHAR('n');
|
|
102
|
+
}
|
|
103
|
+
// unprintable characters are shown as codes
|
|
104
|
+
else
|
|
105
|
+
{
|
|
106
|
+
UNITY_OUTPUT_CHAR('\\');
|
|
107
|
+
UnityPrintNumberHex((_U_UINT)*pch, 2);
|
|
108
|
+
}
|
|
109
|
+
pch++;
|
|
110
|
+
}
|
|
111
|
+
}
|
|
112
|
+
}
|
|
113
|
+
|
|
114
|
+
void UnityPrintLen(const char* string, const _UU32 length);
|
|
115
|
+
void UnityPrintLen(const char* string, const _UU32 length)
|
|
116
|
+
{
|
|
117
|
+
const char* pch = string;
|
|
118
|
+
|
|
119
|
+
if (pch != NULL)
|
|
120
|
+
{
|
|
121
|
+
while (*pch && (_UU32)(pch - string) < length)
|
|
122
|
+
{
|
|
123
|
+
// printable characters plus CR & LF are printed
|
|
124
|
+
if ((*pch <= 126) && (*pch >= 32))
|
|
125
|
+
{
|
|
126
|
+
UNITY_OUTPUT_CHAR(*pch);
|
|
127
|
+
}
|
|
128
|
+
//write escaped carriage returns
|
|
129
|
+
else if (*pch == 13)
|
|
130
|
+
{
|
|
131
|
+
UNITY_OUTPUT_CHAR('\\');
|
|
132
|
+
UNITY_OUTPUT_CHAR('r');
|
|
133
|
+
}
|
|
134
|
+
//write escaped line feeds
|
|
135
|
+
else if (*pch == 10)
|
|
136
|
+
{
|
|
137
|
+
UNITY_OUTPUT_CHAR('\\');
|
|
138
|
+
UNITY_OUTPUT_CHAR('n');
|
|
139
|
+
}
|
|
140
|
+
// unprintable characters are shown as codes
|
|
141
|
+
else
|
|
142
|
+
{
|
|
143
|
+
UNITY_OUTPUT_CHAR('\\');
|
|
144
|
+
UnityPrintNumberHex((_U_UINT)*pch, 2);
|
|
145
|
+
}
|
|
146
|
+
pch++;
|
|
147
|
+
}
|
|
148
|
+
}
|
|
149
|
+
}
|
|
150
|
+
|
|
151
|
+
//-----------------------------------------------
|
|
152
|
+
void UnityPrintNumberByStyle(const _U_SINT number, const UNITY_DISPLAY_STYLE_T style)
|
|
153
|
+
{
|
|
154
|
+
if ((style & UNITY_DISPLAY_RANGE_INT) == UNITY_DISPLAY_RANGE_INT)
|
|
155
|
+
{
|
|
156
|
+
UnityPrintNumber(number);
|
|
157
|
+
}
|
|
158
|
+
else if ((style & UNITY_DISPLAY_RANGE_UINT) == UNITY_DISPLAY_RANGE_UINT)
|
|
159
|
+
{
|
|
160
|
+
UnityPrintNumberUnsigned( (_U_UINT)number & UnitySizeMask[((_U_UINT)style & (_U_UINT)0x0F) - 1] );
|
|
161
|
+
}
|
|
162
|
+
else
|
|
163
|
+
{
|
|
164
|
+
UnityPrintNumberHex((_U_UINT)number, (char)((style & 0x000F) << 1));
|
|
165
|
+
}
|
|
166
|
+
}
|
|
167
|
+
|
|
168
|
+
//-----------------------------------------------
|
|
169
|
+
/// basically do an itoa using as little ram as possible
|
|
170
|
+
void UnityPrintNumber(const _U_SINT number_to_print)
|
|
171
|
+
{
|
|
172
|
+
_U_SINT divisor = 1;
|
|
173
|
+
_U_SINT next_divisor;
|
|
174
|
+
_U_UINT number;
|
|
175
|
+
|
|
176
|
+
if (number_to_print == (1l << (UNITY_LONG_WIDTH-1)))
|
|
177
|
+
{
|
|
178
|
+
//The largest representable negative number
|
|
179
|
+
UNITY_OUTPUT_CHAR('-');
|
|
180
|
+
number = (1ul << (UNITY_LONG_WIDTH-1));
|
|
181
|
+
}
|
|
182
|
+
else if (number_to_print < 0)
|
|
183
|
+
{
|
|
184
|
+
//Some other negative number
|
|
185
|
+
UNITY_OUTPUT_CHAR('-');
|
|
186
|
+
number = (_U_UINT)(-number_to_print);
|
|
187
|
+
}
|
|
188
|
+
else
|
|
189
|
+
{
|
|
190
|
+
//Positive number
|
|
191
|
+
number = (_U_UINT)number_to_print;
|
|
192
|
+
}
|
|
193
|
+
|
|
194
|
+
// figure out initial divisor
|
|
195
|
+
while (number / divisor > 9)
|
|
196
|
+
{
|
|
197
|
+
next_divisor = divisor * 10;
|
|
198
|
+
if (next_divisor > divisor)
|
|
199
|
+
divisor = next_divisor;
|
|
200
|
+
else
|
|
201
|
+
break;
|
|
202
|
+
}
|
|
203
|
+
|
|
204
|
+
// now mod and print, then divide divisor
|
|
205
|
+
do
|
|
206
|
+
{
|
|
207
|
+
UNITY_OUTPUT_CHAR((char)('0' + (number / divisor % 10)));
|
|
208
|
+
divisor /= 10;
|
|
209
|
+
}
|
|
210
|
+
while (divisor > 0);
|
|
211
|
+
}
|
|
212
|
+
|
|
213
|
+
//-----------------------------------------------
|
|
214
|
+
/// basically do an itoa using as little ram as possible
|
|
215
|
+
void UnityPrintNumberUnsigned(const _U_UINT number)
|
|
216
|
+
{
|
|
217
|
+
_U_UINT divisor = 1;
|
|
218
|
+
_U_UINT next_divisor;
|
|
219
|
+
|
|
220
|
+
// figure out initial divisor
|
|
221
|
+
while (number / divisor > 9)
|
|
222
|
+
{
|
|
223
|
+
next_divisor = divisor * 10;
|
|
224
|
+
if (next_divisor > divisor)
|
|
225
|
+
divisor = next_divisor;
|
|
226
|
+
else
|
|
227
|
+
break;
|
|
228
|
+
}
|
|
229
|
+
|
|
230
|
+
// now mod and print, then divide divisor
|
|
231
|
+
do
|
|
232
|
+
{
|
|
233
|
+
UNITY_OUTPUT_CHAR((char)('0' + (number / divisor % 10)));
|
|
234
|
+
divisor /= 10;
|
|
235
|
+
}
|
|
236
|
+
while (divisor > 0);
|
|
237
|
+
}
|
|
238
|
+
|
|
239
|
+
//-----------------------------------------------
|
|
240
|
+
void UnityPrintNumberHex(const _U_UINT number, const char nibbles_to_print)
|
|
241
|
+
{
|
|
242
|
+
_U_UINT nibble;
|
|
243
|
+
char nibbles = nibbles_to_print;
|
|
244
|
+
UNITY_OUTPUT_CHAR('0');
|
|
245
|
+
UNITY_OUTPUT_CHAR('x');
|
|
246
|
+
|
|
247
|
+
while (nibbles > 0)
|
|
248
|
+
{
|
|
249
|
+
nibble = (number >> (--nibbles << 2)) & 0x0000000F;
|
|
250
|
+
if (nibble <= 9)
|
|
251
|
+
{
|
|
252
|
+
UNITY_OUTPUT_CHAR((char)('0' + nibble));
|
|
253
|
+
}
|
|
254
|
+
else
|
|
255
|
+
{
|
|
256
|
+
UNITY_OUTPUT_CHAR((char)('A' - 10 + nibble));
|
|
257
|
+
}
|
|
258
|
+
}
|
|
259
|
+
}
|
|
260
|
+
|
|
261
|
+
//-----------------------------------------------
|
|
262
|
+
void UnityPrintMask(const _U_UINT mask, const _U_UINT number)
|
|
263
|
+
{
|
|
264
|
+
_U_UINT current_bit = (_U_UINT)1 << (UNITY_INT_WIDTH - 1);
|
|
265
|
+
_US32 i;
|
|
266
|
+
|
|
267
|
+
for (i = 0; i < UNITY_INT_WIDTH; i++)
|
|
268
|
+
{
|
|
269
|
+
if (current_bit & mask)
|
|
270
|
+
{
|
|
271
|
+
if (current_bit & number)
|
|
272
|
+
{
|
|
273
|
+
UNITY_OUTPUT_CHAR('1');
|
|
274
|
+
}
|
|
275
|
+
else
|
|
276
|
+
{
|
|
277
|
+
UNITY_OUTPUT_CHAR('0');
|
|
278
|
+
}
|
|
279
|
+
}
|
|
280
|
+
else
|
|
281
|
+
{
|
|
282
|
+
UNITY_OUTPUT_CHAR('X');
|
|
283
|
+
}
|
|
284
|
+
current_bit = current_bit >> 1;
|
|
285
|
+
}
|
|
286
|
+
}
|
|
287
|
+
|
|
288
|
+
//-----------------------------------------------
|
|
289
|
+
#ifdef UNITY_FLOAT_VERBOSE
|
|
290
|
+
#include <string.h>
|
|
291
|
+
void UnityPrintFloat(_UF number)
|
|
292
|
+
{
|
|
293
|
+
char TempBuffer[32];
|
|
294
|
+
sprintf(TempBuffer, "%.6f", number);
|
|
295
|
+
UnityPrint(TempBuffer);
|
|
296
|
+
}
|
|
297
|
+
#endif
|
|
298
|
+
|
|
299
|
+
//-----------------------------------------------
|
|
300
|
+
|
|
301
|
+
void UnityPrintFail(void);
|
|
302
|
+
void UnityPrintFail(void)
|
|
303
|
+
{
|
|
304
|
+
UnityPrint(UnityStrFail);
|
|
305
|
+
}
|
|
306
|
+
|
|
307
|
+
void UnityPrintOk(void);
|
|
308
|
+
void UnityPrintOk(void)
|
|
309
|
+
{
|
|
310
|
+
UnityPrint(UnityStrOk);
|
|
311
|
+
}
|
|
312
|
+
|
|
313
|
+
//-----------------------------------------------
|
|
314
|
+
static void UnityTestResultsBegin(const char* file, const UNITY_LINE_TYPE line);
|
|
315
|
+
static void UnityTestResultsBegin(const char* file, const UNITY_LINE_TYPE line)
|
|
316
|
+
{
|
|
317
|
+
#ifndef UNITY_FIXTURES
|
|
318
|
+
UnityPrint(file);
|
|
319
|
+
UNITY_OUTPUT_CHAR(':');
|
|
320
|
+
UnityPrintNumber((_U_SINT)line);
|
|
321
|
+
UNITY_OUTPUT_CHAR(':');
|
|
322
|
+
UnityPrint(Unity.CurrentTestName);
|
|
323
|
+
UNITY_OUTPUT_CHAR(':');
|
|
324
|
+
#else
|
|
325
|
+
UNITY_UNUSED(file);
|
|
326
|
+
UNITY_UNUSED(line);
|
|
327
|
+
#endif
|
|
328
|
+
}
|
|
329
|
+
|
|
330
|
+
//-----------------------------------------------
|
|
331
|
+
static void UnityTestResultsFailBegin(const UNITY_LINE_TYPE line);
|
|
332
|
+
static void UnityTestResultsFailBegin(const UNITY_LINE_TYPE line)
|
|
333
|
+
{
|
|
334
|
+
#ifndef UNITY_FIXTURES
|
|
335
|
+
UnityTestResultsBegin(Unity.TestFile, line);
|
|
336
|
+
#else
|
|
337
|
+
UNITY_UNUSED(line);
|
|
338
|
+
#endif
|
|
339
|
+
UnityPrint(UnityStrFail);
|
|
340
|
+
UNITY_OUTPUT_CHAR(':');
|
|
341
|
+
}
|
|
342
|
+
|
|
343
|
+
//-----------------------------------------------
|
|
344
|
+
void UnityConcludeTest(void)
|
|
345
|
+
{
|
|
346
|
+
if (Unity.CurrentTestIgnored)
|
|
347
|
+
{
|
|
348
|
+
Unity.TestIgnores++;
|
|
349
|
+
}
|
|
350
|
+
else if (!Unity.CurrentTestFailed)
|
|
351
|
+
{
|
|
352
|
+
UnityTestResultsBegin(Unity.TestFile, Unity.CurrentTestLineNumber);
|
|
353
|
+
UnityPrint(UnityStrPass);
|
|
354
|
+
}
|
|
355
|
+
else
|
|
356
|
+
{
|
|
357
|
+
Unity.TestFailures++;
|
|
358
|
+
}
|
|
359
|
+
|
|
360
|
+
Unity.CurrentTestFailed = 0;
|
|
361
|
+
Unity.CurrentTestIgnored = 0;
|
|
362
|
+
UNITY_PRINT_EOL;
|
|
363
|
+
}
|
|
364
|
+
|
|
365
|
+
//-----------------------------------------------
|
|
366
|
+
static void UnityAddMsgIfSpecified(const char* msg);
|
|
367
|
+
static void UnityAddMsgIfSpecified(const char* msg)
|
|
368
|
+
{
|
|
369
|
+
if (msg)
|
|
370
|
+
{
|
|
371
|
+
UnityPrint(UnityStrSpacer);
|
|
372
|
+
UnityPrint(msg);
|
|
373
|
+
}
|
|
374
|
+
}
|
|
375
|
+
|
|
376
|
+
//-----------------------------------------------
|
|
377
|
+
static void UnityPrintExpectedAndActualStrings(const char* expected, const char* actual);
|
|
378
|
+
static void UnityPrintExpectedAndActualStrings(const char* expected, const char* actual)
|
|
379
|
+
{
|
|
380
|
+
UnityPrint(UnityStrExpected);
|
|
381
|
+
if (expected != NULL)
|
|
382
|
+
{
|
|
383
|
+
UNITY_OUTPUT_CHAR('\'');
|
|
384
|
+
UnityPrint(expected);
|
|
385
|
+
UNITY_OUTPUT_CHAR('\'');
|
|
386
|
+
}
|
|
387
|
+
else
|
|
388
|
+
{
|
|
389
|
+
UnityPrint(UnityStrNull);
|
|
390
|
+
}
|
|
391
|
+
UnityPrint(UnityStrWas);
|
|
392
|
+
if (actual != NULL)
|
|
393
|
+
{
|
|
394
|
+
UNITY_OUTPUT_CHAR('\'');
|
|
395
|
+
UnityPrint(actual);
|
|
396
|
+
UNITY_OUTPUT_CHAR('\'');
|
|
397
|
+
}
|
|
398
|
+
else
|
|
399
|
+
{
|
|
400
|
+
UnityPrint(UnityStrNull);
|
|
401
|
+
}
|
|
402
|
+
}
|
|
403
|
+
|
|
404
|
+
//-----------------------------------------------
|
|
405
|
+
static void UnityPrintExpectedAndActualStringsLen(const char* expected, const char* actual, const _UU32 length)
|
|
406
|
+
{
|
|
407
|
+
UnityPrint(UnityStrExpected);
|
|
408
|
+
if (expected != NULL)
|
|
409
|
+
{
|
|
410
|
+
UNITY_OUTPUT_CHAR('\'');
|
|
411
|
+
UnityPrintLen(expected, length);
|
|
412
|
+
UNITY_OUTPUT_CHAR('\'');
|
|
413
|
+
}
|
|
414
|
+
else
|
|
415
|
+
{
|
|
416
|
+
UnityPrint(UnityStrNull);
|
|
417
|
+
}
|
|
418
|
+
UnityPrint(UnityStrWas);
|
|
419
|
+
if (actual != NULL)
|
|
420
|
+
{
|
|
421
|
+
UNITY_OUTPUT_CHAR('\'');
|
|
422
|
+
UnityPrintLen(actual, length);
|
|
423
|
+
UNITY_OUTPUT_CHAR('\'');
|
|
424
|
+
}
|
|
425
|
+
else
|
|
426
|
+
{
|
|
427
|
+
UnityPrint(UnityStrNull);
|
|
428
|
+
}
|
|
429
|
+
}
|
|
430
|
+
|
|
431
|
+
|
|
432
|
+
|
|
433
|
+
//-----------------------------------------------
|
|
434
|
+
// Assertion & Control Helpers
|
|
435
|
+
//-----------------------------------------------
|
|
436
|
+
|
|
437
|
+
static int UnityCheckArraysForNull(UNITY_PTR_ATTRIBUTE const void* expected, UNITY_PTR_ATTRIBUTE const void* actual, const UNITY_LINE_TYPE lineNumber, const char* msg)
|
|
438
|
+
{
|
|
439
|
+
//return true if they are both NULL
|
|
440
|
+
if ((expected == NULL) && (actual == NULL))
|
|
441
|
+
return 1;
|
|
442
|
+
|
|
443
|
+
//throw error if just expected is NULL
|
|
444
|
+
if (expected == NULL)
|
|
445
|
+
{
|
|
446
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
447
|
+
UnityPrint(UnityStrNullPointerForExpected);
|
|
448
|
+
UnityAddMsgIfSpecified(msg);
|
|
449
|
+
UNITY_FAIL_AND_BAIL;
|
|
450
|
+
}
|
|
451
|
+
|
|
452
|
+
//throw error if just actual is NULL
|
|
453
|
+
if (actual == NULL)
|
|
454
|
+
{
|
|
455
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
456
|
+
UnityPrint(UnityStrNullPointerForActual);
|
|
457
|
+
UnityAddMsgIfSpecified(msg);
|
|
458
|
+
UNITY_FAIL_AND_BAIL;
|
|
459
|
+
}
|
|
460
|
+
|
|
461
|
+
//return false if neither is NULL
|
|
462
|
+
return 0;
|
|
463
|
+
}
|
|
464
|
+
|
|
465
|
+
//-----------------------------------------------
|
|
466
|
+
// Assertion Functions
|
|
467
|
+
//-----------------------------------------------
|
|
468
|
+
|
|
469
|
+
void UnityAssertBits(const _U_SINT mask,
|
|
470
|
+
const _U_SINT expected,
|
|
471
|
+
const _U_SINT actual,
|
|
472
|
+
const char* msg,
|
|
473
|
+
const UNITY_LINE_TYPE lineNumber)
|
|
474
|
+
{
|
|
475
|
+
UNITY_SKIP_EXECUTION;
|
|
476
|
+
|
|
477
|
+
if ((mask & expected) != (mask & actual))
|
|
478
|
+
{
|
|
479
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
480
|
+
UnityPrint(UnityStrExpected);
|
|
481
|
+
UnityPrintMask((_U_UINT)mask, (_U_UINT)expected);
|
|
482
|
+
UnityPrint(UnityStrWas);
|
|
483
|
+
UnityPrintMask((_U_UINT)mask, (_U_UINT)actual);
|
|
484
|
+
UnityAddMsgIfSpecified(msg);
|
|
485
|
+
UNITY_FAIL_AND_BAIL;
|
|
486
|
+
}
|
|
487
|
+
}
|
|
488
|
+
|
|
489
|
+
//-----------------------------------------------
|
|
490
|
+
void UnityAssertEqualNumber(const _U_SINT expected,
|
|
491
|
+
const _U_SINT actual,
|
|
492
|
+
const char* msg,
|
|
493
|
+
const UNITY_LINE_TYPE lineNumber,
|
|
494
|
+
const UNITY_DISPLAY_STYLE_T style)
|
|
495
|
+
{
|
|
496
|
+
UNITY_SKIP_EXECUTION;
|
|
497
|
+
|
|
498
|
+
if (expected != actual)
|
|
499
|
+
{
|
|
500
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
501
|
+
UnityPrint(UnityStrExpected);
|
|
502
|
+
UnityPrintNumberByStyle(expected, style);
|
|
503
|
+
UnityPrint(UnityStrWas);
|
|
504
|
+
UnityPrintNumberByStyle(actual, style);
|
|
505
|
+
UnityAddMsgIfSpecified(msg);
|
|
506
|
+
UNITY_FAIL_AND_BAIL;
|
|
507
|
+
}
|
|
508
|
+
}
|
|
509
|
+
|
|
510
|
+
//-----------------------------------------------
|
|
511
|
+
void UnityAssertEqualIntArray(UNITY_PTR_ATTRIBUTE const void* expected,
|
|
512
|
+
UNITY_PTR_ATTRIBUTE const void* actual,
|
|
513
|
+
const _UU32 num_elements,
|
|
514
|
+
const char* msg,
|
|
515
|
+
const UNITY_LINE_TYPE lineNumber,
|
|
516
|
+
const UNITY_DISPLAY_STYLE_T style)
|
|
517
|
+
{
|
|
518
|
+
_UU32 elements = num_elements;
|
|
519
|
+
UNITY_PTR_ATTRIBUTE const void* ptr_exp = (UNITY_PTR_ATTRIBUTE const void*)expected;
|
|
520
|
+
UNITY_PTR_ATTRIBUTE const void* ptr_act = (UNITY_PTR_ATTRIBUTE const void*)actual;
|
|
521
|
+
|
|
522
|
+
UNITY_SKIP_EXECUTION;
|
|
523
|
+
|
|
524
|
+
if (elements == 0)
|
|
525
|
+
{
|
|
526
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
527
|
+
UnityPrint(UnityStrPointless);
|
|
528
|
+
UnityAddMsgIfSpecified(msg);
|
|
529
|
+
UNITY_FAIL_AND_BAIL;
|
|
530
|
+
}
|
|
531
|
+
|
|
532
|
+
if (UnityCheckArraysForNull((UNITY_PTR_ATTRIBUTE const void*)expected, (UNITY_PTR_ATTRIBUTE const void*)actual, lineNumber, msg) == 1)
|
|
533
|
+
return;
|
|
534
|
+
|
|
535
|
+
// If style is UNITY_DISPLAY_STYLE_INT, we'll fall into the default case rather than the INT16 or INT32 (etc) case
|
|
536
|
+
// as UNITY_DISPLAY_STYLE_INT includes a flag for UNITY_DISPLAY_RANGE_AUTO, which the width-specific
|
|
537
|
+
// variants do not. Therefore remove this flag.
|
|
538
|
+
switch(style & (UNITY_DISPLAY_STYLE_T)(~UNITY_DISPLAY_RANGE_AUTO))
|
|
539
|
+
{
|
|
540
|
+
case UNITY_DISPLAY_STYLE_HEX8:
|
|
541
|
+
case UNITY_DISPLAY_STYLE_INT8:
|
|
542
|
+
case UNITY_DISPLAY_STYLE_UINT8:
|
|
543
|
+
while (elements--)
|
|
544
|
+
{
|
|
545
|
+
if (*(UNITY_PTR_ATTRIBUTE const _US8*)ptr_exp != *(UNITY_PTR_ATTRIBUTE const _US8*)ptr_act)
|
|
546
|
+
{
|
|
547
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
548
|
+
UnityPrint(UnityStrElement);
|
|
549
|
+
UnityPrintNumberByStyle((num_elements - elements - 1), UNITY_DISPLAY_STYLE_UINT);
|
|
550
|
+
UnityPrint(UnityStrExpected);
|
|
551
|
+
UnityPrintNumberByStyle(*(UNITY_PTR_ATTRIBUTE const _US8*)ptr_exp, style);
|
|
552
|
+
UnityPrint(UnityStrWas);
|
|
553
|
+
UnityPrintNumberByStyle(*(UNITY_PTR_ATTRIBUTE const _US8*)ptr_act, style);
|
|
554
|
+
UnityAddMsgIfSpecified(msg);
|
|
555
|
+
UNITY_FAIL_AND_BAIL;
|
|
556
|
+
}
|
|
557
|
+
ptr_exp = (UNITY_PTR_ATTRIBUTE const void*)((_UP)ptr_exp + 1);
|
|
558
|
+
ptr_act = (UNITY_PTR_ATTRIBUTE const void*)((_UP)ptr_act + 1);
|
|
559
|
+
}
|
|
560
|
+
break;
|
|
561
|
+
case UNITY_DISPLAY_STYLE_HEX16:
|
|
562
|
+
case UNITY_DISPLAY_STYLE_INT16:
|
|
563
|
+
case UNITY_DISPLAY_STYLE_UINT16:
|
|
564
|
+
while (elements--)
|
|
565
|
+
{
|
|
566
|
+
if (*(UNITY_PTR_ATTRIBUTE const _US16*)ptr_exp != *(UNITY_PTR_ATTRIBUTE const _US16*)ptr_act)
|
|
567
|
+
{
|
|
568
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
569
|
+
UnityPrint(UnityStrElement);
|
|
570
|
+
UnityPrintNumberByStyle((num_elements - elements - 1), UNITY_DISPLAY_STYLE_UINT);
|
|
571
|
+
UnityPrint(UnityStrExpected);
|
|
572
|
+
UnityPrintNumberByStyle(*(UNITY_PTR_ATTRIBUTE const _US16*)ptr_exp, style);
|
|
573
|
+
UnityPrint(UnityStrWas);
|
|
574
|
+
UnityPrintNumberByStyle(*(UNITY_PTR_ATTRIBUTE const _US16*)ptr_act, style);
|
|
575
|
+
UnityAddMsgIfSpecified(msg);
|
|
576
|
+
UNITY_FAIL_AND_BAIL;
|
|
577
|
+
}
|
|
578
|
+
ptr_exp = (UNITY_PTR_ATTRIBUTE const void*)((_UP)ptr_exp + 2);
|
|
579
|
+
ptr_act = (UNITY_PTR_ATTRIBUTE const void*)((_UP)ptr_act + 2);
|
|
580
|
+
}
|
|
581
|
+
break;
|
|
582
|
+
#ifdef UNITY_SUPPORT_64
|
|
583
|
+
case UNITY_DISPLAY_STYLE_HEX64:
|
|
584
|
+
case UNITY_DISPLAY_STYLE_INT64:
|
|
585
|
+
case UNITY_DISPLAY_STYLE_UINT64:
|
|
586
|
+
while (elements--)
|
|
587
|
+
{
|
|
588
|
+
if (*(UNITY_PTR_ATTRIBUTE const _US64*)ptr_exp != *(UNITY_PTR_ATTRIBUTE const _US64*)ptr_act)
|
|
589
|
+
{
|
|
590
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
591
|
+
UnityPrint(UnityStrElement);
|
|
592
|
+
UnityPrintNumberByStyle((num_elements - elements - 1), UNITY_DISPLAY_STYLE_UINT);
|
|
593
|
+
UnityPrint(UnityStrExpected);
|
|
594
|
+
UnityPrintNumberByStyle(*(UNITY_PTR_ATTRIBUTE const _US64*)ptr_exp, style);
|
|
595
|
+
UnityPrint(UnityStrWas);
|
|
596
|
+
UnityPrintNumberByStyle(*(UNITY_PTR_ATTRIBUTE const _US64*)ptr_act, style);
|
|
597
|
+
UnityAddMsgIfSpecified(msg);
|
|
598
|
+
UNITY_FAIL_AND_BAIL;
|
|
599
|
+
}
|
|
600
|
+
ptr_exp = (UNITY_PTR_ATTRIBUTE const void*)((_UP)ptr_exp + 8);
|
|
601
|
+
ptr_act = (UNITY_PTR_ATTRIBUTE const void*)((_UP)ptr_act + 8);
|
|
602
|
+
}
|
|
603
|
+
break;
|
|
604
|
+
#endif
|
|
605
|
+
default:
|
|
606
|
+
while (elements--)
|
|
607
|
+
{
|
|
608
|
+
if (*(UNITY_PTR_ATTRIBUTE const _US32*)ptr_exp != *(UNITY_PTR_ATTRIBUTE const _US32*)ptr_act)
|
|
609
|
+
{
|
|
610
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
611
|
+
UnityPrint(UnityStrElement);
|
|
612
|
+
UnityPrintNumberByStyle((num_elements - elements - 1), UNITY_DISPLAY_STYLE_UINT);
|
|
613
|
+
UnityPrint(UnityStrExpected);
|
|
614
|
+
UnityPrintNumberByStyle(*(UNITY_PTR_ATTRIBUTE const _US32*)ptr_exp, style);
|
|
615
|
+
UnityPrint(UnityStrWas);
|
|
616
|
+
UnityPrintNumberByStyle(*(UNITY_PTR_ATTRIBUTE const _US32*)ptr_act, style);
|
|
617
|
+
UnityAddMsgIfSpecified(msg);
|
|
618
|
+
UNITY_FAIL_AND_BAIL;
|
|
619
|
+
}
|
|
620
|
+
ptr_exp = (UNITY_PTR_ATTRIBUTE const void*)((_UP)ptr_exp + 4);
|
|
621
|
+
ptr_act = (UNITY_PTR_ATTRIBUTE const void*)((_UP)ptr_act + 4);
|
|
622
|
+
}
|
|
623
|
+
break;
|
|
624
|
+
}
|
|
625
|
+
}
|
|
626
|
+
|
|
627
|
+
//-----------------------------------------------
|
|
628
|
+
#ifndef UNITY_EXCLUDE_FLOAT
|
|
629
|
+
void UnityAssertEqualFloatArray(UNITY_PTR_ATTRIBUTE const _UF* expected,
|
|
630
|
+
UNITY_PTR_ATTRIBUTE const _UF* actual,
|
|
631
|
+
const _UU32 num_elements,
|
|
632
|
+
const char* msg,
|
|
633
|
+
const UNITY_LINE_TYPE lineNumber)
|
|
634
|
+
{
|
|
635
|
+
_UU32 elements = num_elements;
|
|
636
|
+
UNITY_PTR_ATTRIBUTE const _UF* ptr_expected = expected;
|
|
637
|
+
UNITY_PTR_ATTRIBUTE const _UF* ptr_actual = actual;
|
|
638
|
+
_UF diff, tol;
|
|
639
|
+
|
|
640
|
+
UNITY_SKIP_EXECUTION;
|
|
641
|
+
|
|
642
|
+
if (elements == 0)
|
|
643
|
+
{
|
|
644
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
645
|
+
UnityPrint(UnityStrPointless);
|
|
646
|
+
UnityAddMsgIfSpecified(msg);
|
|
647
|
+
UNITY_FAIL_AND_BAIL;
|
|
648
|
+
}
|
|
649
|
+
|
|
650
|
+
if (UnityCheckArraysForNull((UNITY_PTR_ATTRIBUTE const void*)expected, (UNITY_PTR_ATTRIBUTE const void*)actual, lineNumber, msg) == 1)
|
|
651
|
+
return;
|
|
652
|
+
|
|
653
|
+
while (elements--)
|
|
654
|
+
{
|
|
655
|
+
diff = *ptr_expected - *ptr_actual;
|
|
656
|
+
if (diff < 0.0f)
|
|
657
|
+
diff = 0.0f - diff;
|
|
658
|
+
tol = UNITY_FLOAT_PRECISION * *ptr_expected;
|
|
659
|
+
if (tol < 0.0f)
|
|
660
|
+
tol = 0.0f - tol;
|
|
661
|
+
|
|
662
|
+
//This first part of this condition will catch any NaN or Infinite values
|
|
663
|
+
if ((diff * 0.0f != 0.0f) || (diff > tol))
|
|
664
|
+
{
|
|
665
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
666
|
+
UnityPrint(UnityStrElement);
|
|
667
|
+
UnityPrintNumberByStyle((num_elements - elements - 1), UNITY_DISPLAY_STYLE_UINT);
|
|
668
|
+
#ifdef UNITY_FLOAT_VERBOSE
|
|
669
|
+
UnityPrint(UnityStrExpected);
|
|
670
|
+
UnityPrintFloat(*ptr_expected);
|
|
671
|
+
UnityPrint(UnityStrWas);
|
|
672
|
+
UnityPrintFloat(*ptr_actual);
|
|
673
|
+
#else
|
|
674
|
+
UnityPrint(UnityStrDelta);
|
|
675
|
+
#endif
|
|
676
|
+
UnityAddMsgIfSpecified(msg);
|
|
677
|
+
UNITY_FAIL_AND_BAIL;
|
|
678
|
+
}
|
|
679
|
+
ptr_expected++;
|
|
680
|
+
ptr_actual++;
|
|
681
|
+
}
|
|
682
|
+
}
|
|
683
|
+
|
|
684
|
+
//-----------------------------------------------
|
|
685
|
+
void UnityAssertFloatsWithin(const _UF delta,
|
|
686
|
+
const _UF expected,
|
|
687
|
+
const _UF actual,
|
|
688
|
+
const char* msg,
|
|
689
|
+
const UNITY_LINE_TYPE lineNumber)
|
|
690
|
+
{
|
|
691
|
+
_UF diff = actual - expected;
|
|
692
|
+
_UF pos_delta = delta;
|
|
693
|
+
|
|
694
|
+
UNITY_SKIP_EXECUTION;
|
|
695
|
+
|
|
696
|
+
if (diff < 0.0f)
|
|
697
|
+
{
|
|
698
|
+
diff = 0.0f - diff;
|
|
699
|
+
}
|
|
700
|
+
if (pos_delta < 0.0f)
|
|
701
|
+
{
|
|
702
|
+
pos_delta = 0.0f - pos_delta;
|
|
703
|
+
}
|
|
704
|
+
|
|
705
|
+
//This first part of this condition will catch any NaN or Infinite values
|
|
706
|
+
if ((diff * 0.0f != 0.0f) || (pos_delta < diff))
|
|
707
|
+
{
|
|
708
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
709
|
+
#ifdef UNITY_FLOAT_VERBOSE
|
|
710
|
+
UnityPrint(UnityStrExpected);
|
|
711
|
+
UnityPrintFloat(expected);
|
|
712
|
+
UnityPrint(UnityStrWas);
|
|
713
|
+
UnityPrintFloat(actual);
|
|
714
|
+
#else
|
|
715
|
+
UnityPrint(UnityStrDelta);
|
|
716
|
+
#endif
|
|
717
|
+
UnityAddMsgIfSpecified(msg);
|
|
718
|
+
UNITY_FAIL_AND_BAIL;
|
|
719
|
+
}
|
|
720
|
+
}
|
|
721
|
+
|
|
722
|
+
//-----------------------------------------------
|
|
723
|
+
void UnityAssertFloatSpecial(const _UF actual,
|
|
724
|
+
const char* msg,
|
|
725
|
+
const UNITY_LINE_TYPE lineNumber,
|
|
726
|
+
const UNITY_FLOAT_TRAIT_T style)
|
|
727
|
+
{
|
|
728
|
+
const char* trait_names[] = { UnityStrInf, UnityStrNegInf, UnityStrNaN, UnityStrDet };
|
|
729
|
+
_U_SINT should_be_trait = ((_U_SINT)style & 1);
|
|
730
|
+
_U_SINT is_trait = !should_be_trait;
|
|
731
|
+
_U_SINT trait_index = style >> 1;
|
|
732
|
+
|
|
733
|
+
UNITY_SKIP_EXECUTION;
|
|
734
|
+
|
|
735
|
+
switch(style)
|
|
736
|
+
{
|
|
737
|
+
//To determine Inf / Neg Inf, we compare to an Inf / Neg Inf value we create on the fly
|
|
738
|
+
//We are using a variable to hold the zero value because some compilers complain about dividing by zero otherwise
|
|
739
|
+
case UNITY_FLOAT_IS_INF:
|
|
740
|
+
case UNITY_FLOAT_IS_NOT_INF:
|
|
741
|
+
is_trait = ((1.0f / f_zero) == actual) ? 1 : 0;
|
|
742
|
+
break;
|
|
743
|
+
case UNITY_FLOAT_IS_NEG_INF:
|
|
744
|
+
case UNITY_FLOAT_IS_NOT_NEG_INF:
|
|
745
|
+
is_trait = ((-1.0f / f_zero) == actual) ? 1 : 0;
|
|
746
|
+
break;
|
|
747
|
+
|
|
748
|
+
//NaN is the only floating point value that does NOT equal itself. Therefore if Actual == Actual, then it is NOT NaN.
|
|
749
|
+
case UNITY_FLOAT_IS_NAN:
|
|
750
|
+
case UNITY_FLOAT_IS_NOT_NAN:
|
|
751
|
+
is_trait = (actual == actual) ? 0 : 1;
|
|
752
|
+
break;
|
|
753
|
+
|
|
754
|
+
//A determinate number is non infinite and not NaN. (therefore the opposite of the two above)
|
|
755
|
+
case UNITY_FLOAT_IS_DET:
|
|
756
|
+
case UNITY_FLOAT_IS_NOT_DET:
|
|
757
|
+
if ( (actual != actual) || ((1.0f / f_zero) == actual) || ((-1.0f / f_zero) == actual) )
|
|
758
|
+
is_trait = 0;
|
|
759
|
+
else
|
|
760
|
+
is_trait = 1;
|
|
761
|
+
break;
|
|
762
|
+
default:
|
|
763
|
+
;
|
|
764
|
+
}
|
|
765
|
+
|
|
766
|
+
if (is_trait != should_be_trait)
|
|
767
|
+
{
|
|
768
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
769
|
+
UnityPrint(UnityStrExpected);
|
|
770
|
+
if (!should_be_trait)
|
|
771
|
+
UnityPrint(UnityStrNot);
|
|
772
|
+
UnityPrint(trait_names[trait_index]);
|
|
773
|
+
UnityPrint(UnityStrWas);
|
|
774
|
+
#ifdef UNITY_FLOAT_VERBOSE
|
|
775
|
+
UnityPrintFloat(actual);
|
|
776
|
+
#else
|
|
777
|
+
if (should_be_trait)
|
|
778
|
+
UnityPrint(UnityStrNot);
|
|
779
|
+
UnityPrint(trait_names[trait_index]);
|
|
780
|
+
#endif
|
|
781
|
+
UnityAddMsgIfSpecified(msg);
|
|
782
|
+
UNITY_FAIL_AND_BAIL;
|
|
783
|
+
}
|
|
784
|
+
}
|
|
785
|
+
|
|
786
|
+
#endif //not UNITY_EXCLUDE_FLOAT
|
|
787
|
+
|
|
788
|
+
//-----------------------------------------------
|
|
789
|
+
#ifndef UNITY_EXCLUDE_DOUBLE
|
|
790
|
+
void UnityAssertEqualDoubleArray(UNITY_PTR_ATTRIBUTE const _UD* expected,
|
|
791
|
+
UNITY_PTR_ATTRIBUTE const _UD* actual,
|
|
792
|
+
const _UU32 num_elements,
|
|
793
|
+
const char* msg,
|
|
794
|
+
const UNITY_LINE_TYPE lineNumber)
|
|
795
|
+
{
|
|
796
|
+
_UU32 elements = num_elements;
|
|
797
|
+
UNITY_PTR_ATTRIBUTE const _UD* ptr_expected = expected;
|
|
798
|
+
UNITY_PTR_ATTRIBUTE const _UD* ptr_actual = actual;
|
|
799
|
+
_UD diff, tol;
|
|
800
|
+
|
|
801
|
+
UNITY_SKIP_EXECUTION;
|
|
802
|
+
|
|
803
|
+
if (elements == 0)
|
|
804
|
+
{
|
|
805
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
806
|
+
UnityPrint(UnityStrPointless);
|
|
807
|
+
UnityAddMsgIfSpecified(msg);
|
|
808
|
+
UNITY_FAIL_AND_BAIL;
|
|
809
|
+
}
|
|
810
|
+
|
|
811
|
+
if (UnityCheckArraysForNull((UNITY_PTR_ATTRIBUTE void*)expected, (UNITY_PTR_ATTRIBUTE void*)actual, lineNumber, msg) == 1)
|
|
812
|
+
return;
|
|
813
|
+
|
|
814
|
+
while (elements--)
|
|
815
|
+
{
|
|
816
|
+
diff = *ptr_expected - *ptr_actual;
|
|
817
|
+
if (diff < 0.0)
|
|
818
|
+
diff = 0.0 - diff;
|
|
819
|
+
tol = UNITY_DOUBLE_PRECISION * *ptr_expected;
|
|
820
|
+
if (tol < 0.0)
|
|
821
|
+
tol = 0.0 - tol;
|
|
822
|
+
|
|
823
|
+
//This first part of this condition will catch any NaN or Infinite values
|
|
824
|
+
if ((diff * 0.0 != 0.0) || (diff > tol))
|
|
825
|
+
{
|
|
826
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
827
|
+
UnityPrint(UnityStrElement);
|
|
828
|
+
UnityPrintNumberByStyle((num_elements - elements - 1), UNITY_DISPLAY_STYLE_UINT);
|
|
829
|
+
#ifdef UNITY_DOUBLE_VERBOSE
|
|
830
|
+
UnityPrint(UnityStrExpected);
|
|
831
|
+
UnityPrintFloat((float)(*ptr_expected));
|
|
832
|
+
UnityPrint(UnityStrWas);
|
|
833
|
+
UnityPrintFloat((float)(*ptr_actual));
|
|
834
|
+
#else
|
|
835
|
+
UnityPrint(UnityStrDelta);
|
|
836
|
+
#endif
|
|
837
|
+
UnityAddMsgIfSpecified(msg);
|
|
838
|
+
UNITY_FAIL_AND_BAIL;
|
|
839
|
+
}
|
|
840
|
+
ptr_expected++;
|
|
841
|
+
ptr_actual++;
|
|
842
|
+
}
|
|
843
|
+
}
|
|
844
|
+
|
|
845
|
+
//-----------------------------------------------
|
|
846
|
+
void UnityAssertDoublesWithin(const _UD delta,
|
|
847
|
+
const _UD expected,
|
|
848
|
+
const _UD actual,
|
|
849
|
+
const char* msg,
|
|
850
|
+
const UNITY_LINE_TYPE lineNumber)
|
|
851
|
+
{
|
|
852
|
+
_UD diff = actual - expected;
|
|
853
|
+
_UD pos_delta = delta;
|
|
854
|
+
|
|
855
|
+
UNITY_SKIP_EXECUTION;
|
|
856
|
+
|
|
857
|
+
if (diff < 0.0)
|
|
858
|
+
{
|
|
859
|
+
diff = 0.0 - diff;
|
|
860
|
+
}
|
|
861
|
+
if (pos_delta < 0.0)
|
|
862
|
+
{
|
|
863
|
+
pos_delta = 0.0 - pos_delta;
|
|
864
|
+
}
|
|
865
|
+
|
|
866
|
+
//This first part of this condition will catch any NaN or Infinite values
|
|
867
|
+
if ((diff * 0.0 != 0.0) || (pos_delta < diff))
|
|
868
|
+
{
|
|
869
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
870
|
+
#ifdef UNITY_DOUBLE_VERBOSE
|
|
871
|
+
UnityPrint(UnityStrExpected);
|
|
872
|
+
UnityPrintFloat((float)expected);
|
|
873
|
+
UnityPrint(UnityStrWas);
|
|
874
|
+
UnityPrintFloat((float)actual);
|
|
875
|
+
#else
|
|
876
|
+
UnityPrint(UnityStrDelta);
|
|
877
|
+
#endif
|
|
878
|
+
UnityAddMsgIfSpecified(msg);
|
|
879
|
+
UNITY_FAIL_AND_BAIL;
|
|
880
|
+
}
|
|
881
|
+
}
|
|
882
|
+
|
|
883
|
+
//-----------------------------------------------
|
|
884
|
+
|
|
885
|
+
void UnityAssertDoubleSpecial(const _UD actual,
|
|
886
|
+
const char* msg,
|
|
887
|
+
const UNITY_LINE_TYPE lineNumber,
|
|
888
|
+
const UNITY_FLOAT_TRAIT_T style)
|
|
889
|
+
{
|
|
890
|
+
const char* trait_names[] = { UnityStrInf, UnityStrNegInf, UnityStrNaN, UnityStrDet };
|
|
891
|
+
_U_SINT should_be_trait = ((_U_SINT)style & 1);
|
|
892
|
+
_U_SINT is_trait = !should_be_trait;
|
|
893
|
+
_U_SINT trait_index = style >> 1;
|
|
894
|
+
|
|
895
|
+
UNITY_SKIP_EXECUTION;
|
|
896
|
+
|
|
897
|
+
switch(style)
|
|
898
|
+
{
|
|
899
|
+
//To determine Inf / Neg Inf, we compare to an Inf / Neg Inf value we create on the fly
|
|
900
|
+
//We are using a variable to hold the zero value because some compilers complain about dividing by zero otherwise
|
|
901
|
+
case UNITY_FLOAT_IS_INF:
|
|
902
|
+
case UNITY_FLOAT_IS_NOT_INF:
|
|
903
|
+
is_trait = ((1.0 / d_zero) == actual) ? 1 : 0;
|
|
904
|
+
break;
|
|
905
|
+
case UNITY_FLOAT_IS_NEG_INF:
|
|
906
|
+
case UNITY_FLOAT_IS_NOT_NEG_INF:
|
|
907
|
+
is_trait = ((-1.0 / d_zero) == actual) ? 1 : 0;
|
|
908
|
+
break;
|
|
909
|
+
|
|
910
|
+
//NaN is the only floating point value that does NOT equal itself. Therefore if Actual == Actual, then it is NOT NaN.
|
|
911
|
+
case UNITY_FLOAT_IS_NAN:
|
|
912
|
+
case UNITY_FLOAT_IS_NOT_NAN:
|
|
913
|
+
is_trait = (actual == actual) ? 0 : 1;
|
|
914
|
+
break;
|
|
915
|
+
|
|
916
|
+
//A determinate number is non infinite and not NaN. (therefore the opposite of the two above)
|
|
917
|
+
case UNITY_FLOAT_IS_DET:
|
|
918
|
+
case UNITY_FLOAT_IS_NOT_DET:
|
|
919
|
+
if ( (actual != actual) || ((1.0 / d_zero) == actual) || ((-1.0 / d_zero) == actual) )
|
|
920
|
+
is_trait = 0;
|
|
921
|
+
else
|
|
922
|
+
is_trait = 1;
|
|
923
|
+
break;
|
|
924
|
+
default:
|
|
925
|
+
;
|
|
926
|
+
}
|
|
927
|
+
|
|
928
|
+
if (is_trait != should_be_trait)
|
|
929
|
+
{
|
|
930
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
931
|
+
UnityPrint(UnityStrExpected);
|
|
932
|
+
if (!should_be_trait)
|
|
933
|
+
UnityPrint(UnityStrNot);
|
|
934
|
+
UnityPrint(trait_names[trait_index]);
|
|
935
|
+
UnityPrint(UnityStrWas);
|
|
936
|
+
#ifdef UNITY_DOUBLE_VERBOSE
|
|
937
|
+
UnityPrintFloat(actual);
|
|
938
|
+
#else
|
|
939
|
+
if (should_be_trait)
|
|
940
|
+
UnityPrint(UnityStrNot);
|
|
941
|
+
UnityPrint(trait_names[trait_index]);
|
|
942
|
+
#endif
|
|
943
|
+
UnityAddMsgIfSpecified(msg);
|
|
944
|
+
UNITY_FAIL_AND_BAIL;
|
|
945
|
+
}
|
|
946
|
+
}
|
|
947
|
+
|
|
948
|
+
|
|
949
|
+
#endif // not UNITY_EXCLUDE_DOUBLE
|
|
950
|
+
|
|
951
|
+
//-----------------------------------------------
|
|
952
|
+
void UnityAssertNumbersWithin( const _U_SINT delta,
|
|
953
|
+
const _U_SINT expected,
|
|
954
|
+
const _U_SINT actual,
|
|
955
|
+
const char* msg,
|
|
956
|
+
const UNITY_LINE_TYPE lineNumber,
|
|
957
|
+
const UNITY_DISPLAY_STYLE_T style)
|
|
958
|
+
{
|
|
959
|
+
UNITY_SKIP_EXECUTION;
|
|
960
|
+
|
|
961
|
+
if ((style & UNITY_DISPLAY_RANGE_INT) == UNITY_DISPLAY_RANGE_INT)
|
|
962
|
+
{
|
|
963
|
+
if (actual > expected)
|
|
964
|
+
Unity.CurrentTestFailed = ((actual - expected) > delta);
|
|
965
|
+
else
|
|
966
|
+
Unity.CurrentTestFailed = ((expected - actual) > delta);
|
|
967
|
+
}
|
|
968
|
+
else
|
|
969
|
+
{
|
|
970
|
+
if ((_U_UINT)actual > (_U_UINT)expected)
|
|
971
|
+
Unity.CurrentTestFailed = ((_U_UINT)(actual - expected) > (_U_UINT)delta);
|
|
972
|
+
else
|
|
973
|
+
Unity.CurrentTestFailed = ((_U_UINT)(expected - actual) > (_U_UINT)delta);
|
|
974
|
+
}
|
|
975
|
+
|
|
976
|
+
if (Unity.CurrentTestFailed)
|
|
977
|
+
{
|
|
978
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
979
|
+
UnityPrint(UnityStrDelta);
|
|
980
|
+
UnityPrintNumberByStyle(delta, style);
|
|
981
|
+
UnityPrint(UnityStrExpected);
|
|
982
|
+
UnityPrintNumberByStyle(expected, style);
|
|
983
|
+
UnityPrint(UnityStrWas);
|
|
984
|
+
UnityPrintNumberByStyle(actual, style);
|
|
985
|
+
UnityAddMsgIfSpecified(msg);
|
|
986
|
+
UNITY_FAIL_AND_BAIL;
|
|
987
|
+
}
|
|
988
|
+
}
|
|
989
|
+
|
|
990
|
+
//-----------------------------------------------
|
|
991
|
+
void UnityAssertEqualString(const char* expected,
|
|
992
|
+
const char* actual,
|
|
993
|
+
const char* msg,
|
|
994
|
+
const UNITY_LINE_TYPE lineNumber)
|
|
995
|
+
{
|
|
996
|
+
_UU32 i;
|
|
997
|
+
|
|
998
|
+
UNITY_SKIP_EXECUTION;
|
|
999
|
+
|
|
1000
|
+
// if both pointers not null compare the strings
|
|
1001
|
+
if (expected && actual)
|
|
1002
|
+
{
|
|
1003
|
+
for (i = 0; expected[i] || actual[i]; i++)
|
|
1004
|
+
{
|
|
1005
|
+
if (expected[i] != actual[i])
|
|
1006
|
+
{
|
|
1007
|
+
Unity.CurrentTestFailed = 1;
|
|
1008
|
+
break;
|
|
1009
|
+
}
|
|
1010
|
+
}
|
|
1011
|
+
}
|
|
1012
|
+
else
|
|
1013
|
+
{ // handle case of one pointers being null (if both null, test should pass)
|
|
1014
|
+
if (expected != actual)
|
|
1015
|
+
{
|
|
1016
|
+
Unity.CurrentTestFailed = 1;
|
|
1017
|
+
}
|
|
1018
|
+
}
|
|
1019
|
+
|
|
1020
|
+
if (Unity.CurrentTestFailed)
|
|
1021
|
+
{
|
|
1022
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
1023
|
+
UnityPrintExpectedAndActualStrings(expected, actual);
|
|
1024
|
+
UnityAddMsgIfSpecified(msg);
|
|
1025
|
+
UNITY_FAIL_AND_BAIL;
|
|
1026
|
+
}
|
|
1027
|
+
}
|
|
1028
|
+
|
|
1029
|
+
//-----------------------------------------------
|
|
1030
|
+
void UnityAssertEqualStringLen(const char* expected,
|
|
1031
|
+
const char* actual,
|
|
1032
|
+
const _UU32 length,
|
|
1033
|
+
const char* msg,
|
|
1034
|
+
const UNITY_LINE_TYPE lineNumber)
|
|
1035
|
+
{
|
|
1036
|
+
_UU32 i;
|
|
1037
|
+
|
|
1038
|
+
UNITY_SKIP_EXECUTION;
|
|
1039
|
+
|
|
1040
|
+
// if both pointers not null compare the strings
|
|
1041
|
+
if (expected && actual)
|
|
1042
|
+
{
|
|
1043
|
+
for (i = 0; (expected[i] || actual[i]) && i < length; i++)
|
|
1044
|
+
{
|
|
1045
|
+
if (expected[i] != actual[i])
|
|
1046
|
+
{
|
|
1047
|
+
Unity.CurrentTestFailed = 1;
|
|
1048
|
+
break;
|
|
1049
|
+
}
|
|
1050
|
+
}
|
|
1051
|
+
}
|
|
1052
|
+
else
|
|
1053
|
+
{ // handle case of one pointers being null (if both null, test should pass)
|
|
1054
|
+
if (expected != actual)
|
|
1055
|
+
{
|
|
1056
|
+
Unity.CurrentTestFailed = 1;
|
|
1057
|
+
}
|
|
1058
|
+
}
|
|
1059
|
+
|
|
1060
|
+
if (Unity.CurrentTestFailed)
|
|
1061
|
+
{
|
|
1062
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
1063
|
+
UnityPrintExpectedAndActualStringsLen(expected, actual, length);
|
|
1064
|
+
UnityAddMsgIfSpecified(msg);
|
|
1065
|
+
UNITY_FAIL_AND_BAIL;
|
|
1066
|
+
}
|
|
1067
|
+
}
|
|
1068
|
+
|
|
1069
|
+
|
|
1070
|
+
//-----------------------------------------------
|
|
1071
|
+
void UnityAssertEqualStringArray( const char** expected,
|
|
1072
|
+
const char** actual,
|
|
1073
|
+
const _UU32 num_elements,
|
|
1074
|
+
const char* msg,
|
|
1075
|
+
const UNITY_LINE_TYPE lineNumber)
|
|
1076
|
+
{
|
|
1077
|
+
_UU32 i, j = 0;
|
|
1078
|
+
|
|
1079
|
+
UNITY_SKIP_EXECUTION;
|
|
1080
|
+
|
|
1081
|
+
// if no elements, it's an error
|
|
1082
|
+
if (num_elements == 0)
|
|
1083
|
+
{
|
|
1084
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
1085
|
+
UnityPrint(UnityStrPointless);
|
|
1086
|
+
UnityAddMsgIfSpecified(msg);
|
|
1087
|
+
UNITY_FAIL_AND_BAIL;
|
|
1088
|
+
}
|
|
1089
|
+
|
|
1090
|
+
if (UnityCheckArraysForNull((UNITY_PTR_ATTRIBUTE void*)expected, (UNITY_PTR_ATTRIBUTE void*)actual, lineNumber, msg) == 1)
|
|
1091
|
+
return;
|
|
1092
|
+
|
|
1093
|
+
do
|
|
1094
|
+
{
|
|
1095
|
+
// if both pointers not null compare the strings
|
|
1096
|
+
if (expected[j] && actual[j])
|
|
1097
|
+
{
|
|
1098
|
+
for (i = 0; expected[j][i] || actual[j][i]; i++)
|
|
1099
|
+
{
|
|
1100
|
+
if (expected[j][i] != actual[j][i])
|
|
1101
|
+
{
|
|
1102
|
+
Unity.CurrentTestFailed = 1;
|
|
1103
|
+
break;
|
|
1104
|
+
}
|
|
1105
|
+
}
|
|
1106
|
+
}
|
|
1107
|
+
else
|
|
1108
|
+
{ // handle case of one pointers being null (if both null, test should pass)
|
|
1109
|
+
if (expected[j] != actual[j])
|
|
1110
|
+
{
|
|
1111
|
+
Unity.CurrentTestFailed = 1;
|
|
1112
|
+
}
|
|
1113
|
+
}
|
|
1114
|
+
|
|
1115
|
+
if (Unity.CurrentTestFailed)
|
|
1116
|
+
{
|
|
1117
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
1118
|
+
if (num_elements > 1)
|
|
1119
|
+
{
|
|
1120
|
+
UnityPrint(UnityStrElement);
|
|
1121
|
+
UnityPrintNumberByStyle((j), UNITY_DISPLAY_STYLE_UINT);
|
|
1122
|
+
}
|
|
1123
|
+
UnityPrintExpectedAndActualStrings((const char*)(expected[j]), (const char*)(actual[j]));
|
|
1124
|
+
UnityAddMsgIfSpecified(msg);
|
|
1125
|
+
UNITY_FAIL_AND_BAIL;
|
|
1126
|
+
}
|
|
1127
|
+
} while (++j < num_elements);
|
|
1128
|
+
}
|
|
1129
|
+
|
|
1130
|
+
//-----------------------------------------------
|
|
1131
|
+
void UnityAssertEqualMemory( UNITY_PTR_ATTRIBUTE const void* expected,
|
|
1132
|
+
UNITY_PTR_ATTRIBUTE const void* actual,
|
|
1133
|
+
const _UU32 length,
|
|
1134
|
+
const _UU32 num_elements,
|
|
1135
|
+
const char* msg,
|
|
1136
|
+
const UNITY_LINE_TYPE lineNumber)
|
|
1137
|
+
{
|
|
1138
|
+
UNITY_PTR_ATTRIBUTE const unsigned char* ptr_exp = (UNITY_PTR_ATTRIBUTE const unsigned char*)expected;
|
|
1139
|
+
UNITY_PTR_ATTRIBUTE const unsigned char* ptr_act = (UNITY_PTR_ATTRIBUTE const unsigned char*)actual;
|
|
1140
|
+
_UU32 elements = num_elements;
|
|
1141
|
+
_UU32 bytes;
|
|
1142
|
+
|
|
1143
|
+
UNITY_SKIP_EXECUTION;
|
|
1144
|
+
|
|
1145
|
+
if ((elements == 0) || (length == 0))
|
|
1146
|
+
{
|
|
1147
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
1148
|
+
UnityPrint(UnityStrPointless);
|
|
1149
|
+
UnityAddMsgIfSpecified(msg);
|
|
1150
|
+
UNITY_FAIL_AND_BAIL;
|
|
1151
|
+
}
|
|
1152
|
+
|
|
1153
|
+
if (UnityCheckArraysForNull((UNITY_PTR_ATTRIBUTE const void*)expected, (UNITY_PTR_ATTRIBUTE const void*)actual, lineNumber, msg) == 1)
|
|
1154
|
+
return;
|
|
1155
|
+
|
|
1156
|
+
while (elements--)
|
|
1157
|
+
{
|
|
1158
|
+
/////////////////////////////////////
|
|
1159
|
+
bytes = length;
|
|
1160
|
+
while (bytes--)
|
|
1161
|
+
{
|
|
1162
|
+
if (*ptr_exp != *ptr_act)
|
|
1163
|
+
{
|
|
1164
|
+
UnityTestResultsFailBegin(lineNumber);
|
|
1165
|
+
UnityPrint(UnityStrMemory);
|
|
1166
|
+
if (num_elements > 1)
|
|
1167
|
+
{
|
|
1168
|
+
UnityPrint(UnityStrElement);
|
|
1169
|
+
UnityPrintNumberByStyle((num_elements - elements - 1), UNITY_DISPLAY_STYLE_UINT);
|
|
1170
|
+
}
|
|
1171
|
+
UnityPrint(UnityStrByte);
|
|
1172
|
+
UnityPrintNumberByStyle((length - bytes - 1), UNITY_DISPLAY_STYLE_UINT);
|
|
1173
|
+
UnityPrint(UnityStrExpected);
|
|
1174
|
+
UnityPrintNumberByStyle(*ptr_exp, UNITY_DISPLAY_STYLE_HEX8);
|
|
1175
|
+
UnityPrint(UnityStrWas);
|
|
1176
|
+
UnityPrintNumberByStyle(*ptr_act, UNITY_DISPLAY_STYLE_HEX8);
|
|
1177
|
+
UnityAddMsgIfSpecified(msg);
|
|
1178
|
+
UNITY_FAIL_AND_BAIL;
|
|
1179
|
+
}
|
|
1180
|
+
ptr_exp = (UNITY_PTR_ATTRIBUTE const void*)((_UP)ptr_exp + 1);
|
|
1181
|
+
ptr_act = (UNITY_PTR_ATTRIBUTE const void*)((_UP)ptr_act + 1);
|
|
1182
|
+
}
|
|
1183
|
+
/////////////////////////////////////
|
|
1184
|
+
|
|
1185
|
+
}
|
|
1186
|
+
}
|
|
1187
|
+
|
|
1188
|
+
//-----------------------------------------------
|
|
1189
|
+
// Control Functions
|
|
1190
|
+
//-----------------------------------------------
|
|
1191
|
+
|
|
1192
|
+
void UnityFail(const char* msg, const UNITY_LINE_TYPE line)
|
|
1193
|
+
{
|
|
1194
|
+
UNITY_SKIP_EXECUTION;
|
|
1195
|
+
|
|
1196
|
+
UnityTestResultsBegin(Unity.TestFile, line);
|
|
1197
|
+
UnityPrintFail();
|
|
1198
|
+
if (msg != NULL)
|
|
1199
|
+
{
|
|
1200
|
+
UNITY_OUTPUT_CHAR(':');
|
|
1201
|
+
if (msg[0] != ' ')
|
|
1202
|
+
{
|
|
1203
|
+
UNITY_OUTPUT_CHAR(' ');
|
|
1204
|
+
}
|
|
1205
|
+
UnityPrint(msg);
|
|
1206
|
+
}
|
|
1207
|
+
UNITY_FAIL_AND_BAIL;
|
|
1208
|
+
}
|
|
1209
|
+
|
|
1210
|
+
//-----------------------------------------------
|
|
1211
|
+
void UnityIgnore(const char* msg, const UNITY_LINE_TYPE line)
|
|
1212
|
+
{
|
|
1213
|
+
UNITY_SKIP_EXECUTION;
|
|
1214
|
+
|
|
1215
|
+
UnityTestResultsBegin(Unity.TestFile, line);
|
|
1216
|
+
UnityPrint(UnityStrIgnore);
|
|
1217
|
+
if (msg != NULL)
|
|
1218
|
+
{
|
|
1219
|
+
UNITY_OUTPUT_CHAR(':');
|
|
1220
|
+
UNITY_OUTPUT_CHAR(' ');
|
|
1221
|
+
UnityPrint(msg);
|
|
1222
|
+
}
|
|
1223
|
+
UNITY_IGNORE_AND_BAIL;
|
|
1224
|
+
}
|
|
1225
|
+
|
|
1226
|
+
//-----------------------------------------------
|
|
1227
|
+
#if defined(UNITY_WEAK_ATTRIBUTE)
|
|
1228
|
+
void setUp(void);
|
|
1229
|
+
void tearDown(void);
|
|
1230
|
+
UNITY_WEAK_ATTRIBUTE void setUp(void) { }
|
|
1231
|
+
UNITY_WEAK_ATTRIBUTE void tearDown(void) { }
|
|
1232
|
+
#elif defined(UNITY_WEAK_PRAGMA)
|
|
1233
|
+
# pragma weak setUp
|
|
1234
|
+
void setUp(void);
|
|
1235
|
+
# pragma weak tearDown
|
|
1236
|
+
void tearDown(void);
|
|
1237
|
+
#else
|
|
1238
|
+
void setUp(void);
|
|
1239
|
+
void tearDown(void);
|
|
1240
|
+
#endif
|
|
1241
|
+
//-----------------------------------------------
|
|
1242
|
+
void UnityDefaultTestRun(UnityTestFunction Func, const char* FuncName, const int FuncLineNum)
|
|
1243
|
+
{
|
|
1244
|
+
Unity.CurrentTestName = FuncName;
|
|
1245
|
+
Unity.CurrentTestLineNumber = (UNITY_LINE_TYPE)FuncLineNum;
|
|
1246
|
+
Unity.NumberOfTests++;
|
|
1247
|
+
if (TEST_PROTECT())
|
|
1248
|
+
{
|
|
1249
|
+
setUp();
|
|
1250
|
+
Func();
|
|
1251
|
+
}
|
|
1252
|
+
if (TEST_PROTECT() && !(Unity.CurrentTestIgnored))
|
|
1253
|
+
{
|
|
1254
|
+
tearDown();
|
|
1255
|
+
}
|
|
1256
|
+
UnityConcludeTest();
|
|
1257
|
+
}
|
|
1258
|
+
|
|
1259
|
+
//-----------------------------------------------
|
|
1260
|
+
void UnityBegin(const char* filename)
|
|
1261
|
+
{
|
|
1262
|
+
Unity.TestFile = filename;
|
|
1263
|
+
Unity.CurrentTestName = NULL;
|
|
1264
|
+
Unity.CurrentTestLineNumber = 0;
|
|
1265
|
+
Unity.NumberOfTests = 0;
|
|
1266
|
+
Unity.TestFailures = 0;
|
|
1267
|
+
Unity.TestIgnores = 0;
|
|
1268
|
+
Unity.CurrentTestFailed = 0;
|
|
1269
|
+
Unity.CurrentTestIgnored = 0;
|
|
1270
|
+
|
|
1271
|
+
UNITY_OUTPUT_START();
|
|
1272
|
+
}
|
|
1273
|
+
|
|
1274
|
+
//-----------------------------------------------
|
|
1275
|
+
int UnityEnd(void)
|
|
1276
|
+
{
|
|
1277
|
+
UNITY_PRINT_EOL;
|
|
1278
|
+
UnityPrint(UnityStrBreaker);
|
|
1279
|
+
UNITY_PRINT_EOL;
|
|
1280
|
+
UnityPrintNumber((_U_SINT)(Unity.NumberOfTests));
|
|
1281
|
+
UnityPrint(UnityStrResultsTests);
|
|
1282
|
+
UnityPrintNumber((_U_SINT)(Unity.TestFailures));
|
|
1283
|
+
UnityPrint(UnityStrResultsFailures);
|
|
1284
|
+
UnityPrintNumber((_U_SINT)(Unity.TestIgnores));
|
|
1285
|
+
UnityPrint(UnityStrResultsIgnored);
|
|
1286
|
+
UNITY_PRINT_EOL;
|
|
1287
|
+
if (Unity.TestFailures == 0U)
|
|
1288
|
+
{
|
|
1289
|
+
UnityPrintOk();
|
|
1290
|
+
}
|
|
1291
|
+
else
|
|
1292
|
+
{
|
|
1293
|
+
UnityPrintFail();
|
|
1294
|
+
}
|
|
1295
|
+
UNITY_PRINT_EOL;
|
|
1296
|
+
UNITY_OUTPUT_COMPLETE();
|
|
1297
|
+
return (int)(Unity.TestFailures);
|
|
1298
|
+
}
|
|
1299
|
+
|
|
1300
|
+
//-----------------------------------------------
|