| Child |
Name |
Tests |
Failures |
Skipped |
Duration |
Success rate |
| Builder rejects non-positive counted insertion |
builderRejectsNonPositiveCountedInsertion() |
1 |
0 |
0 |
0.002s |
100% |
| Builder rejects null constructor arguments |
builderRejectsNullConstructorArguments() |
1 |
0 |
0 |
0.002s |
100% |
| Builder rejects null put arguments |
builderRejectsNullPutArguments() |
1 |
0 |
0 |
0.003s |
100% |
| Counted insertion aggregates frequencies correctly |
countedInsertionAggregatesFrequenciesCorrectly() |
1 |
0 |
0 |
0.002s |
100% |
| Diacritic REMOVE mode strips dictionary and lookup keys |
diacriticRemoveModeStripsDictionaryAndLookupKeys() |
1 |
0 |
0 |
0.002s |
100% |
| Dominant reduction falls back when winner is not dominant enough |
dominantReductionFallsBackWhenWinnerIsNotDominantEnough() |
1 |
0 |
0 |
0.002s |
100% |
| Dominant reduction merges nodes with a qualified dominant winner |
dominantReductionMergesQualifiedDominantWinnerNodes() |
1 |
0 |
0 |
0.002s |
100% |
| Empty key stores values at the root node |
emptyKeyStoresValuesAtRootNode() |
1 |
0 |
0 |
0.001s |
100% |
| Empty trie returns null, empty array, and empty entries |
emptyTrieReturnsNullEmptyArrayAndEmptyEntries() |
1 |
0 |
0 |
0.002s |
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.003s |
100% |
| AS_IS_AND_STRIPPED_FALLBACK mode is not supported yet |
fallbackDiacriticModeIsNotSupportedYet() |
1 |
0 |
0 |
0.001s |
100% |
| Fingerprint reflects metadata and compiled trie content |
fingerprintReflectsMetadataAndCompiledTrieContent() |
1 |
0 |
0 |
0.004s |
100% |
| getAll returns a defensive copy |
getAllReturnsDefensiveCopy() |
1 |
0 |
0 |
0s |
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.001s |
100% |
| getEntries returns a one-item list for single stored values |
getEntriesReturnsSingleItemListForSingleStoredValue() |
1 |
0 |
0 |
0.001s |
100% |
| Internal-node values remain local to that node |
internalNodeValuesRemainLocalToThatNode() |
1 |
0 |
0 |
0.001s |
100% |
| Lookup applies lowercase normalization when metadata requires it |
lookupAppliesLowercaseNormalizationWhenMetadataRequiresIt() |
1 |
0 |
0 |
0.001s |
100% |
| Lookup keeps case-sensitive behavior when metadata is AS_IS |
lookupKeepsCaseSensitiveBehaviorWhenMetadataIsAsIs() |
1 |
0 |
0 |
0.001s |
100% |
| Missing path below existing prefix returns empty results |
missingPathBelowExistingPrefixReturnsEmptyResults() |
1 |
0 |
0 |
0.001s |
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.001s |
100% |
| readFrom parses version 4 case processing metadata |
readFromParsesVersionFourCaseMetadata() |
1 |
0 |
0 |
0.002s |
100% |
| readFrom parses version 3 metadata |
readFromParsesVersionThreeMetadata() |
1 |
0 |
0 |
0.003s |
100% |
| readFrom rejects cyclic serialized node references |
readFromRejectsCyclicSerializedNodeReferences() |
1 |
0 |
0 |
0.002s |
100% |
| readFrom rejects invalid child node identifiers |
readFromRejectsInvalidChildNodeId() |
1 |
0 |
0 |
0.004s |
100% |
| readFrom rejects invalid metadata ordinal in legacy stream |
readFromRejectsInvalidLegacyMetadataOrdinal() |
1 |
0 |
0 |
0.004s |
100% |
| readFrom rejects invalid maxExpandedIndex override |
readFromRejectsInvalidMaxExpandedIndexOverride() |
1 |
0 |
0 |
0.001s |
100% |
| readFrom rejects invalid root node identifier |
readFromRejectsInvalidRootNodeIdentifier() |
1 |
0 |
0 |
0.002s |
100% |
| readFrom rejects invalid stream magic header |
readFromRejectsInvalidStreamMagicHeader() |
1 |
0 |
0 |
0s |
100% |
| readFrom rejects invalid textual metadata block |
readFromRejectsInvalidTextualMetadataBlock() |
1 |
0 |
0 |
0.001s |
100% |
| readFrom rejects negative node count |
readFromRejectsNegativeNodeCount() |
1 |
0 |
0 |
0.002s |
100% |
| readFrom rejects non-ascending serialized edge labels |
readFromRejectsNonAscendingSerializedEdgeLabels() |
1 |
0 |
0 |
0.006s |
100% |
| readFrom rejects non-positive stored counts |
readFromRejectsNonPositiveStoredCounts() |
1 |
0 |
0 |
0.004s |
100% |
| readFrom rejects unsupported stream version |
readFromRejectsUnsupportedStreamVersion() |
1 |
0 |
0 |
0.001s |
100% |
| readFrom respects dense lookup max-expanded index override |
readFromRespectsDenseLookupMaxExpandedIndexOverride() |
1 |
0 |
0 |
0.004s |
100% |
| readFrom supports legacy version 1 metadata |
readFromSupportsLegacyVersionOneMetadata() |
1 |
0 |
0 |
0.007s |
100% |
| readFrom supports legacy version 2 metadata |
readFromSupportsLegacyVersionTwoMetadata() |
1 |
0 |
0 |
0.001s |
100% |
| Reduction materially decreases compiled trie size for repeated equivalent suffixes |
reductionMateriallyDecreasesCompiledTrieSizeForRepeatedEquivalentSuffixes() |
1 |
0 |
0 |
0.011s |
100% |
| Reduction takes internal-node local values into account |
reductionTakesInternalNodeLocalValuesIntoAccount() |
1 |
0 |
0 |
0.001s |
100% |
| Uniform subtree contraction replaces uniform internal subtree with accepting leaf |
shouldContractUniformInternalSubtreeIntoAcceptingLeaf() |
1 |
0 |
0 |
0.004s |
100% |
| Default reduction keeps exact lookup semantics for uniform subtrees |
shouldKeepExactLookupWhenUniformSubtreeContractionIsDisabled() |
1 |
0 |
0 |
0.005s |
100% |
| Binary round trip preserves uniform subtree accepting leaf |
shouldPreserveUniformSubtreeContractionAcrossBinaryRoundTrip() |
1 |
0 |
0 |
0.002s |
100% |
| Value mapping preserves uniform subtree accepting leaf |
shouldPreserveUniformSubtreeContractionWhenMappingValues() |
1 |
0 |
0 |
0.002s |
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.002s |
100% |
| Visitor lookup handles zero, negative, missing, and first-result cases |
visitorLookupHandlesBoundaryCases() |
1 |
0 |
0 |
0.003s |
100% |
| Visitor lookup honors maxResults and sink early stop |
visitorLookupHonorsMaxResultsAndSinkEarlyStop() |
1 |
0 |
0 |
0.002s |
100% |
| Visitor lookup matches getAll order and getEntries counts |
visitorLookupMatchesGetAllOrderAndGetEntriesCounts() |
1 |
0 |
0 |
0.002s |
100% |
| Visitor lookup rejects null and invalid range arguments |
visitorLookupRejectsNullAndInvalidRangeArguments() |
1 |
0 |
0 |
0.004s |
100% |
| Visitor lookup supports normalized char slices and metadata-aware CharSequence keys |
visitorLookupSupportsCharSlicesAndMetadataAwareKeys() |
1 |
0 |
0 |
0.002s |
100% |
| writeTo and readFrom reject null arguments |
writeToAndReadFromRejectNullArguments() |
1 |
0 |
0 |
0.002s |
100% |
| writeTo and readFrom round-trip trie content |
writeToAndReadFromRoundTripTrieContent() |
1 |
0 |
0 |
0.004s |
100% |