ddur
ddur
Difference is because dll in release build has no sequence-points, therefore source code is not available. Without access to source code, removal of excess branches has limited capabilities.
@ulrichb Then I do not know. You can ignore my previous post.
As far as I remember, NPath complexity is computed as 2branches. 8 seems good value.
@jswolf19 Every IF branch has implicit ELSE. How many tests cases would you have to write to cover all possible branches? 100% coverage of correct code, does not cover all...
If you explicitly code implicit branches, you will find lines/branches/paths, that are possibly not covered by test, but can be filled in with correct or incorrect code at any time....
Open cover is not source code analysis tool, does not detects code semantics, so following code will also require 8 test cases. Example code is stupid and it is impossible...
> 100% coverage of correct code, does not cover all cases of incorrect code. Correction or in other words: 100% line coverage of code, does not cover all cases of...
https://modess.io/npath-complexity-cyclomatic-complexity-explained/
Yes you are right. It would be 8 paths only if branches are not nested. Sorry, I jumped into conclusion too fast. ``` public static string NPathResultShouldBe4(bool a, bool b,...
Fixing would require a kind of semantic analysis of source-code. There is not only `if` statement, we have `switch` and boolean expressions and loop branches. MS IL is flat, tracking...