Sha256: 9b8ea3268829a98ee0e792cb32c1f9adefd9fa0831670c24a71131cd8bc114db
Contents?: true
Size: 886 Bytes
Versions: 2
Compression:
Stored size: 886 Bytes
Contents
#include "ProductionCode.h" int Counter = 0; int NumbersToFind[9] = { 0, 34, 55, 66, 32, 11, 1, 77, 888 }; /* some obnoxious array to search that is 1-based indexing instead of 0. */ /* This function is supposed to search through NumbersToFind and find a particular number. * If it finds it, the index is returned. Otherwise 0 is returned which sorta makes sense since * NumbersToFind is indexed from 1. Unfortunately it's broken * (and should therefore be caught by our tests) */ int FindFunction_WhichIsBroken(int NumberToFind) { int i = 0; while (i <= 8) /* Notice I should have been in braces */ i++; if (NumbersToFind[i] == NumberToFind) /* Yikes! I'm getting run after the loop finishes instead of during it! */ return i; return 0; } int FunctionWhichReturnsLocalVariable(void) { return Counter; }
Version data entries
2 entries across 2 versions & 1 rubygems
Version | Path |
---|---|
ceedling-0.29.1 | vendor/c_exception/vendor/unity/examples/example_1/src/ProductionCode.c |
ceedling-0.29.0 | vendor/c_exception/vendor/unity/examples/example_1/src/ProductionCode.c |