| Child |
Name |
Tests |
Failures |
Skipped |
Duration |
Success rate |
| Builder rejects non-positive counted insertion |
builderRejectsNonPositiveCountedInsertion() |
1 |
0 |
0 |
0.001s |
100% |
| Builder rejects null constructor arguments |
builderRejectsNullConstructorArguments() |
1 |
0 |
0 |
0.003s |
100% |
| Builder rejects null put arguments |
builderRejectsNullPutArguments() |
1 |
0 |
0 |
0.002s |
100% |
| Counted insertion aggregates frequencies correctly |
countedInsertionAggregatesFrequenciesCorrectly() |
1 |
0 |
0 |
0.001s |
100% |
| Dominant reduction falls back when winner is not dominant enough |
dominantReductionFallsBackWhenWinnerIsNotDominantEnough() |
1 |
0 |
0 |
0.001s |
100% |
| Dominant reduction merges nodes with a qualified dominant winner |
dominantReductionMergesQualifiedDominantWinnerNodes() |
1 |
0 |
0 |
0.003s |
100% |
| Empty key stores values at the root node |
emptyKeyStoresValuesAtRootNode() |
1 |
0 |
0 |
0.002s |
100% |
| Empty trie returns null, empty array, and empty entries |
emptyTrieReturnsNullEmptyArrayAndEmptyEntries() |
1 |
0 |
0 |
0.003s |
100% |
| Equal frequencies and lengths prefer lexicographically lower string |
equalFrequenciesAndLengthsPreferLexicographicallyLowerString() |
1 |
0 |
0 |
0.001s |
100% |
| Equal frequencies prefer shorter string representation |
equalFrequenciesPreferShorterStringRepresentation() |
1 |
0 |
0 |
0.002s |
100% |
| Equal textual representations preserve first-seen order |
equalTextualRepresentationsPreserveFirstSeenOrder() |
1 |
0 |
0 |
0.002s |
100% |
| Equivalent descendants do not override differing internal-node semantics |
equivalentDescendantsDoNotOverrideDifferingInternalNodeSemantics() |
1 |
0 |
0 |
0.002s |
100% |
| getAll returns a defensive copy |
getAllReturnsDefensiveCopy() |
1 |
0 |
0 |
0.001s |
100% |
| getAll returns values ordered by descending local frequency |
getAllReturnsValuesOrderedByDescendingLocalFrequency() |
1 |
0 |
0 |
0.001s |
100% |
| getEntries returns immutable list |
getEntriesReturnsImmutableList() |
1 |
0 |
0 |
0.002s |
100% |
| Internal-node values remain local to that node |
internalNodeValuesRemainLocalToThatNode() |
1 |
0 |
0 |
0.001s |
100% |
| Missing path below existing prefix returns empty results |
missingPathBelowExistingPrefixReturnsEmptyResults() |
1 |
0 |
0 |
0.002s |
100% |
| Ranked reduction keeps nodes separate when getAll ordering differs |
rankedReductionKeepsNodesSeparateWhenOrderingDiffers() |
1 |
0 |
0 |
0.001s |
100% |
| Ranked reduction merges subtrees with equivalent ranked getAll semantics |
rankedReductionMergesEquivalentRankedGetAllSubtrees() |
1 |
0 |
0 |
0.002s |
100% |
| readFrom rejects invalid root node identifier |
readFromRejectsInvalidRootNodeIdentifier() |
1 |
0 |
0 |
0.001s |
100% |
| readFrom rejects invalid stream magic header |
readFromRejectsInvalidStreamMagicHeader() |
1 |
0 |
0 |
0.001s |
100% |
| readFrom rejects negative node count |
readFromRejectsNegativeNodeCount() |
1 |
0 |
0 |
0.003s |
100% |
| readFrom rejects non-positive stored counts |
readFromRejectsNonPositiveStoredCounts() |
1 |
0 |
0 |
0.005s |
100% |
| readFrom rejects unsupported stream version |
readFromRejectsUnsupportedStreamVersion() |
1 |
0 |
0 |
0.002s |
100% |
| Reduction materially decreases compiled trie size for repeated equivalent suffixes |
reductionMateriallyDecreasesCompiledTrieSizeForRepeatedEquivalentSuffixes() |
1 |
0 |
0 |
0.007s |
100% |
| Reduction takes internal-node local values into account |
reductionTakesInternalNodeLocalValuesIntoAccount() |
1 |
0 |
0 |
0.001s |
100% |
| Trie rejects null lookup keys |
trieRejectsNullLookupKeys() |
1 |
0 |
0 |
0.002s |
100% |
| Unordered reduction merges nodes with the same getAll value set |
unorderedReductionMergesNodesWithSameGetAllValueSet() |
1 |
0 |
0 |
0.003s |
100% |
| writeTo and readFrom reject null arguments |
writeToAndReadFromRejectNullArguments() |
1 |
0 |
0 |
0.004s |
100% |
| writeTo and readFrom round-trip trie content |
writeToAndReadFromRoundTripTrieContent() |
1 |
0 |
0 |
0.004s |
100% |