With the release of the KwCombinatorics v2.2.0, this project has reached a level of maturity where it should be able to rest a while. It performs ranking and unranking on permutations, pick-combinations, pick-multicombinations, and cartesian products. My goal is to offer the definitive combinatoric library for .NET programmers.
Key recently added features are:
- Added the k-multicombination combinatoric
- Added unranking constructors for every combinatoric
- All enumerators support subclassing of their combinatorics
- Vastly improved documentation
The source-lines-of-code breaks down like this:
- Library source: 2775 lines (40%)
- Test source: 3445 lines (50%)
- Example source: 655 lines (10%)
What really stands out here is that there is more test source than the library source, even with the library source heavily weighed down with XML documentation comments. Also, 6875 lines seems like an awful lot of source for a library that is ultimately a DLL of just 25 kilobytes.
Code coverage of 100%, edge cases, stress tests – they all add up.
Kasewick's Blog 