| pluralize(String) |   | 95% | | 83% | 1 | 4 | 1 | 11 | 0 | 1 |
| match(List, String, CompiledInflector.CompiledRule) | | 100% | | 100% | 0 | 5 | 0 | 8 | 0 | 1 |
| lambda$and$5(CompiledInflector.WordCondition[], String, int) | | 100% | | 100% | 0 | 3 | 0 | 4 | 0 | 1 |
| lambda$previousCharIn$2(String, String, int) | | 100% | | 100% | 0 | 3 | 0 | 1 | 0 | 1 |
| lambda$previousCharNot$3(char, String, int) | | 100% | | 100% | 0 | 3 | 0 | 1 | 0 | 1 |
| lambda$suffixStartAtLeast$4(int, String, int) | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| CompiledInflector(CompiledInflector.TrieNode) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| lambda$static$1(String, int) | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| static {...} | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| builder() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| previousCharIn(String) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| previousCharNot(char) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| suffixStartAtLeast(int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| and(CompiledInflector.WordCondition[]) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| lambda$static$0(String, int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |