Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
radix_tree_test.cc File Reference

Tests for Aleph::RadixTree (tpl_radix_tree.H). More...

#include <gtest/gtest.h>
#include <prefix-tree.H>
#include <tpl_radix_tree.H>
#include <algorithm>
#include <map>
#include <memory>
#include <random>
#include <set>
#include <stdexcept>
#include <string>
#include <vector>
Include dependency graph for radix_tree_test.cc:

Go to the source code of this file.

Functions

 TEST (RadixTree, DefaultConstructedTreeIsEmpty)
 
 TEST (RadixTree, VerifyHoldsForEmptyTree)
 
 TEST (RadixTree, InsertAndFindSingleKey)
 
 TEST (RadixTree, InsertRejectsDuplicateKeys)
 
 TEST (RadixTree, InsertMoveOverloadIsSupported)
 
 TEST (RadixTree, InsertOrAssignInsertsThenOverwrites)
 
 TEST (RadixTree, EmptyStringKeyIsSupported)
 
 TEST (RadixTree, EraseReturnsFalseForMissingKey)
 
 TEST (RadixTree, EraseRemovesKeyAndShrinksSize)
 
 TEST (RadixTree, InsertingSharedPrefixSplitsEdgeCorrectly)
 
 TEST (RadixTree, InsertingKeyThatIsPrefixOfExistingKeySplitsWithoutExtraLeaf)
 
 TEST (RadixTree, InsertingKeyThatExtendsExistingKeyAddsLeafUnderIt)
 
 TEST (RadixTree, EraseMergesCompressedNodeBackTogether)
 
 TEST (RadixTree, EraseOfInternalNodeWithValueKeepsChildrenReachable)
 
 TEST (RadixTree, LongestPrefixFindsDeepestMatchingStoredKey)
 
 TEST (RadixTree, LongestPrefixMatchesEmptyStringKeyAsFallback)
 
 TEST (RadixTree, KeysWithPrefixReturnsAllMatchingKeys)
 
 TEST (RadixTree, KeysWithPrefixEmptyPrefixReturnsEverything)
 
 TEST (RadixTree, KeysWithPrefixExactKeyIncludesItself)
 
 TEST (RadixTree, MoveConstructorTransfersOwnershipLeavesSourceEmpty)
 
 TEST (RadixTree, MoveAssignmentTransfersOwnershipLeavesSourceEmpty)
 
 TEST (RadixTree, CopyConstructorProducesIndependentDeepCopy)
 
 TEST (RadixTree, CopyAssignmentProducesIndependentDeepCopy)
 
 TEST (RadixTree, FailedInsertCopyLeavesTreeUnchanged)
 
 TEST (RadixTree, FailedInsertCopyDuringEdgeSplitLeavesTreeUnchanged)
 
 TEST (RadixTree, FailedInsertCopyDuringEdgeSplitWithExactPrefixLeavesTreeUnchanged)
 
 TEST (RadixTree, RandomizedOperationTraceMatchesStdMapReferenceModel)
 
 TEST (RadixTree, RandomizedPrefixQueriesMatchBruteForceScan)
 
 TEST (RadixTree, MatchesPrefixTreeInsertContainsAndPrefixQueries)
 

Detailed Description

Tests for Aleph::RadixTree (tpl_radix_tree.H).

Definition in file radix_tree_test.cc.

Function Documentation

◆ TEST() [1/29]

◆ TEST() [2/29]

◆ TEST() [3/29]

◆ TEST() [4/29]

◆ TEST() [5/29]

◆ TEST() [6/29]

◆ TEST() [7/29]

◆ TEST() [8/29]

◆ TEST() [9/29]

◆ TEST() [10/29]

◆ TEST() [11/29]

◆ TEST() [12/29]

◆ TEST() [13/29]

◆ TEST() [14/29]

◆ TEST() [15/29]

◆ TEST() [16/29]

TEST ( RadixTree  ,
InsertMoveOverloadIsSupported   
)

◆ TEST() [17/29]

◆ TEST() [18/29]

◆ TEST() [19/29]

◆ TEST() [20/29]

◆ TEST() [21/29]

◆ TEST() [22/29]

TEST ( RadixTree  ,
LongestPrefixFindsDeepestMatchingStoredKey   
)

◆ TEST() [23/29]

TEST ( RadixTree  ,
LongestPrefixMatchesEmptyStringKeyAsFallback   
)

◆ TEST() [24/29]

◆ TEST() [25/29]

◆ TEST() [26/29]

◆ TEST() [27/29]

TEST ( RadixTree  ,
RandomizedOperationTraceMatchesStdMapReferenceModel   
)

Definition at line 534 of file radix_tree_test.cc.

References Aleph::blossom_maximum_cardinality_matching(), k, rng, and value.

◆ TEST() [28/29]

TEST ( RadixTree  ,
RandomizedPrefixQueriesMatchBruteForceScan   
)

◆ TEST() [29/29]

TEST ( RadixTree  ,
VerifyHoldsForEmptyTree   
)