I added a size restriction to the first name and last name inputs in the Person.java file.
My changes can be found in the following commit: https://gitlab.liu.se/vikbe588/tddd04-labs/-/tree/viktor-changes?ref_type=heads
I attempted to add other restrictions like comparing the input to a regex but ran into a slew of technical issues. As me and Fabian had already had a plethera of issues getting graphwalker up and running in the first place leading as far as to request a later date for the handin, I eventually gave up.
I attempted to add other restrictions like comparing the input to a regex but ran into a slew of technical issues. As me and Fabian had already had a plethora of issues getting graphwalker up and running in the first place leading as far as to request a later date for the handin, I eventually gave up.
#### Debugging
...
...
@@ -49,4 +50,4 @@ Answer: There seems to be some correlation between model coverage and code cover
To answer question two we added a part of the code dependant on a counter variable. This variable would be incremented with each visit of a certain edge. We then added a case in the code to check weather this variable was equal to a constant. By setting this constant to 7 we were able to run a test with 100% edge coverage which did not trigger the assertion. Based on this we can answer question nr 2.
2. Does 100% edge coverage imply 100% code coverage? Does it imply 100% branch coverage? Motivate your answer.
Answer: 100% edge coverage does not imply 100% code coverage since there may be specific paths in the code which are not covered by just traveling every edge. Branch coverage on the other hand must be 100% if the edge coverage is 100%. If we traverse every edge we must also visit every branch for at least 1 outcome.
\ No newline at end of file
Answer: 100% edge coverage does not imply 100% code coverage since there may be specific paths in the code which are not covered by just traveling every edge. Branch coverage on the other hand must be 100% if the edge coverage is 100%. This is since if we traverse every edge we must also visit every branch for at least 1 outcome.
