Code Coverage Counterexamples | James Howard Code Coverage Counterexamples | James Howard

# Code Coverage Counterexamples

Code coverage is not what it’s cracked up to be. As an experiment, I started using Coveralls on two of my R projects, cmna and phonics. Both projects had unit testing with testthat included, both use Travis for continuous integration, and Coveralls supports R. So this seemed like a logical experiment, and the results tell us something about code coverage.

First, cmna has miserable code coverage. As of this writing, code coverage is only about 8 percent and I am surprised it is that high. I basically gave up on writing unit tests while developing the package and the book to save time. With the book back into editorial, I should add more unit tests, especially since the examples in the book are a good starting point. However, the tests that are there are solid.

Second phonics has excellent code coverage. When I first added Coveralls, I was at 97.05 percent, with complete coverage for most of the functions. In fact, I have complete coverage for all of the functions written in R and those functions in C++ are less than perfect, though still 89 percent or better. So what makes R and C++ different? It’s an implementation detail. Those functions that are written in pure R code are those that are mostly implemented via regular expressions.

Unit testing is supposed to provide some basic tests to a function and determine if the function produces the correct, predetermined, output. If not, something is wrong. It’s probably the function, though it could be the test. You should check some primary cases and some edge cases.

Code coverage estimates work by evaluating how thoroughly the code is checked. It works on the presumption that every branch, basically if-then-else statements, follow all possible paths at least once. It’s important to realize, this does not mean all possible combinations within a functions are reached. That’s a combinatorial problem at scale. But each branch must be reached.

When the functions written in R use regular expressions, there is essentially no branching. Take this implementation of the statcan function (with comments removed):

Not a single branch. Any input will hit everyone line. The code coverage tool is very happy here. But it’s stupid.

This doesn’t happen with the C++ based functions, where branching is normal and logic more interesting. Consistently between the C++ functions, soundex and metaphone, the coverage holes were the same. All of them contain, more or less, this code block:

I failed to test the NULL string, single letter strings, and strings with a single letter followed by nonalphabetical characters. I added each of the three classes to the test suites.

Cases 1 and 2 passed with flying colors, increasing code coverage to 98.23 percent. But the third, well, it didn’t pass. There’s a bug where if any of the C++ functions get a string started by a letter and with trailing nonalphabetical characters, it crashes. I would have never caught this without better testing. And better testing was driven by code coverage checks.

It’s become a staple for programmers to ask how much code coverage is enough. Here’s a brief list of links:

There’s a lot more out there, too. Universally, the suggestion seems to be 80 percent is probably good enough. But here, in a single small project, there’s an example of a function with perfect code coverage which may or may not be tested correctly and another function with better than 90 percent coverage that is clearly insufficiently tested.

Image by Thomas Leuthard.