/external/zlib/src/ |
H A D | trees.c | 13 * Each code tree is stored in a compressed form which is itself 87 /* The static literal tree. Since the bit lengths are imposed, there is no 89 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init 94 /* The static distance tree. (Actually a trivial tree since all codes use 118 const ct_data *static_tree; /* static tree or NULL */ 121 int elems; /* max number of elements in the tree */ 140 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k)); 142 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count)); 144 local void scan_tree OF((deflate_state *s, ct_data *tree, in 492 ct_data *tree = desc->dyn_tree; local 621 ct_data *tree = desc->dyn_tree; local [all...] |
/external/zopfli/src/zopflipng/lodepng/ |
H A D | lodepng.cpp | 466 /*the base backwards distances (the bits of distance codes appear after length codes and use their own huffman tree)*/ 477 the huffman tree of the dynamic huffman tree lengths is generated*/ 484 Huffman tree struct, containing multiple representations of the tree 490 unsigned* lengths; /*the lengths of the codes of the 1d-tree*/ 495 /*function used for debug purposes to draw the tree in ascii art with C++*/ 497 static void HuffmanTree_draw(HuffmanTree* tree) 499 std::cout << "tree. length: " << tree 508 HuffmanTree_init(HuffmanTree* tree) argument 515 HuffmanTree_cleanup(HuffmanTree* tree) argument 523 HuffmanTree_make2DTree(HuffmanTree* tree) argument 587 HuffmanTree_makeFromLengths2(HuffmanTree* tree) argument 631 HuffmanTree_makeFromLengths(HuffmanTree* tree, const unsigned* bitlen, size_t numcodes, unsigned maxbitlen) argument 834 HuffmanTree_makeFromFrequencies(HuffmanTree* tree, const unsigned* frequencies, size_t mincodes, size_t numcodes, unsigned maxbitlen) argument 851 HuffmanTree_getCode(const HuffmanTree* tree, unsigned index) argument 856 HuffmanTree_getLength(const HuffmanTree* tree, unsigned index) argument 863 generateFixedLitLenTree(HuffmanTree* tree) argument 882 generateFixedDistanceTree(HuffmanTree* tree) argument 2922 color_tree_init(ColorTree* tree) argument 2929 color_tree_cleanup(ColorTree* tree) argument 2943 color_tree_get(ColorTree* tree, unsigned char r, unsigned char g, unsigned char b, unsigned char a) argument 2956 color_tree_has(ColorTree* tree, unsigned char r, unsigned char g, unsigned char b, unsigned char a) argument 2964 color_tree_add(ColorTree* tree, unsigned char r, unsigned char g, unsigned char b, unsigned char a, int index) argument 3399 ColorTree tree; local 3479 ColorTree tree; /*for listing the counted colors, up to 256*/ member in struct:ColorProfile [all...] |
H A D | lodepng_util.cpp | 311 { //make tree given the lengths 348 { //Decodes a symbol from the tree 356 //2D representation of a huffman tree: one dimension is "0" or "1", the other contains all nodes and leaves. 383 void generateFixedTrees(HuffmanTree& tree, HuffmanTree& treeD) //get the tree of a deflated block with fixed tree argument 388 tree.makeFromLengths(bitlen, 15); 392 //the code tree for Huffman codes, dist codes, and code length codes 396 //decode a single symbol from given list of bits with given code tree. return value is the symbol 407 void getTreeInflateDynamic(HuffmanTree& tree, HuffmanTre argument [all...] |
/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
H A D | XMPMetaImpl.java | 55 /** root of the metadata tree */ 56 private XMPNode tree; field in class:XMPMetaImpl 67 tree = new XMPNode(null, null, null); 72 * Constructor for a cloned metadata tree. 74 * @param tree 75 * an prefilled metadata tree which fulfills all 78 public XMPMetaImpl(XMPNode tree) argument 80 this.tree = tree; 115 XMPNode arrayNode = XMPNodeUtils.findNode(tree, arrayPat [all...] |
H A D | XMPNodeUtils.java | 61 * @param tree the root of the xmp tree. 72 static XMPNode findSchemaNode(XMPNode tree, String namespaceURI, argument 76 return findSchemaNode(tree, namespaceURI, null, createNodes); 83 * @param tree the root of the xmp tree. 95 static XMPNode findSchemaNode(XMPNode tree, String namespaceURI, String suggestedPrefix, argument 99 assert tree.getParent() == null; // make sure that its the root 100 XMPNode schemaNode = tree.findChildByName(namespaceURI); 109 // only previously registered schema namespaces are allowed in the XMP tree [all...] |
H A D | XMPNormalizer.java | 62 XMPNode tree = xmp.getRoot(); 65 moveExplicitAliases(tree, options); 67 tweakOldXMP(tree); 69 deleteEmptySchemas(tree); 85 * @param tree the root of the metadata tree 88 private static void tweakOldXMP(XMPNode tree) throws XMPException argument 90 if (tree.getName() != null && tree.getName().length() >= Utils.UUID_LENGTH) 92 String nameStr = tree 290 moveExplicitAliases(XMPNode tree, ParseOptions options) argument 495 deleteEmptySchemas(XMPNode tree) argument [all...] |
/external/webp/src/dec/ |
H A D | vp8l.c | 5 // tree. An additional intellectual property rights grant can be found 7 // be found in the AUTHORS file in the root of the source tree. 154 static WEBP_INLINE int ReadSymbol(const HuffmanTree* tree, argument 156 const HuffmanTreeNode* node = tree->root_; 161 const int lut_bits = tree->lut_bits_[lut_ix]; 164 return tree->lut_symbol_[lut_ix]; 166 node += tree->lut_jump_[lut_ix]; 170 // Decode the value from a binary tree. 189 HuffmanTree tree; local 192 if (!VP8LHuffmanTreeBuildImplicit(&tree, code_length_code_length 242 ReadHuffmanCode(int alphabet_size, VP8LDecoder* const dec, int* const code_lengths, int* const huff_codes, HuffmanTree* const tree) argument [all...] |
/external/webp/src/enc/ |
H A D | vp8l.c | 5 // tree. An additional intellectual property rights grant can be found 7 // be found in the AUTHORS file in the root of the source tree. 323 const HuffmanTreeCode* const tree) { 326 const int max_tokens = tree->num_symbols; 334 num_tokens = VP8LCreateCompressedHuffmanTree(tree, tokens, max_tokens); 393 // Check whether it's a small tree. 401 if (count == 0) { // emit minimal tree for empty cases 402 // bits: small tree marker: 1, count-1: 0, large 8-bit code: 0, code: 0 405 VP8LWriteBits(bw, 1, 1); // Small tree marker to encode 1 or 2 symbols. 493 const uint16_t histogram_symbols[1] = { 0 }; // only one tree, on 320 StoreFullHuffmanCode(VP8LBitWriter* const bw, HuffmanTree* const huff_tree, HuffmanTreeToken* const tokens, const HuffmanTreeCode* const tree) argument [all...] |
/external/webp/src/utils/ |
H A D | huffman.c | 5 // tree. An additional intellectual property rights grant can be found 7 // be found in the AUTHORS file in the root of the source tree. 38 static int IsFull(const HuffmanTree* const tree) { argument 39 return (tree->num_nodes_ == tree->max_nodes_); 42 static void AssignChildren(HuffmanTree* const tree, argument 44 HuffmanTreeNode* const children = tree->root_ + tree->num_nodes_; 47 tree->num_nodes_ += 2; 52 // A Huffman tree i 58 HuffmanTreeAllocate(HuffmanTree* const tree, int num_nodes) argument 65 TreeInit(HuffmanTree* const tree, int num_leaves) argument 78 VP8LHuffmanTreeFree(HuffmanTree* const tree) argument 188 TreeAddSymbol(HuffmanTree* const tree, int symbol, int code, int code_length) argument 231 VP8LHuffmanTreeBuildImplicit(HuffmanTree* const tree, const int* const code_lengths, int* const codes, int code_lengths_size) argument 288 VP8LHuffmanTreeBuildExplicit(HuffmanTree* const tree, const int* const code_lengths, const int* const codes, const int* const symbols, int max_symbol, int num_symbols) argument [all...] |
H A D | huffman_encode.c | 5 // tree. An additional intellectual property rights grant can be found 7 // be found in the AUTHORS file in the root of the source tree. 30 // Huffman tree compression, especially its RLE-part, give smaller output. 135 static void SetBitDepths(const HuffmanTree* const tree, argument 138 if (tree->pool_index_left_ >= 0) { 139 SetBitDepths(&pool[tree->pool_index_left_], pool, bit_depths, level + 1); 140 SetBitDepths(&pool[tree->pool_index_right_], pool, bit_depths, level + 1); 142 bit_depths[tree->value_] = level; 146 // Create an optimal Huffman tree. 154 // The catch here is that the tree canno 165 GenerateOptimalTree(const uint32_t* const histogram, int histogram_size, HuffmanTree* tree, int tree_depth_limit, uint8_t* const bit_depths) argument 326 VP8LCreateCompressedHuffmanTree(const HuffmanTreeCode* const tree, HuffmanTreeToken* tokens, int max_tokens) argument 374 ConvertBitDepthsToSymbols(HuffmanTreeCode* const tree) argument [all...] |
/external/valgrind/main/helgrind/ |
H A D | libhb_core.c | 921 /* ------------ CacheLine and implicit-tree related ------------ */ 1042 valid bit in tree[0..7]*/ 1089 static Bool is_sane_Descr_and_Tree ( UShort descr, SVal* tree ) { 1097 if (tree[i] == SVal_INVALID) 1100 if (tree[i] != SVal_INVALID) 1108 VG_(printf)("%s","is_sane_Descr_and_Tree: bad tree {\n"); 1112 VG_(printf)(" [%ld] 0x%016llx\n", i, tree[i]); 1125 SVal* tree = &cl->svals[cloff]; local 1126 if (!is_sane_Descr_and_Tree(descr, tree)) 1136 static UShort normalise_tree ( /*MOD*/SVal* tree ) 1200 SVal* tree = &cl->svals[cloff]; local 1224 SVal* tree = &src->svals[cloff]; local 1568 pulldown_to_32( SVal* tree, UWord toff, UShort descr ) argument 1583 pulldown_to_16( SVal* tree, UWord toff, UShort descr ) argument 1610 pulldown_to_8( SVal* tree, UWord toff, UShort descr ) argument 5108 SVal* tree = &cl->svals[tno << 3]; local 5132 SVal* tree = &cl->svals[tno << 3]; local 5162 SVal* tree = &cl->svals[tno << 3]; local 5196 SVal* tree = &cl->svals[tno << 3]; local 5230 SVal* tree = &cl->svals[tno << 3]; local 5264 SVal* tree = &cl->svals[tno << 3]; local 5356 SVal* tree = &cl->svals[tno << 3]; local 5389 SVal* tree = &cl->svals[tno << 3]; local 5424 SVal* tree = &cl->svals[tno << 3]; local 5491 SVal* tree = &cl->svals[tno << 3]; local [all...] |
/external/stlport/test/unit/ |
H A D | set_test.cpp | 240 set<int> tree; local 241 tree.insert(1); 242 set<int>::iterator it = tree.begin(); 246 CPPUNIT_ASSERT( it == tree.end() ); 247 CPPUNIT_ASSERT( it != tree.begin() ); 249 set<int>::const_iterator cit = tree.begin(); 256 set<int> tree; local 257 tree.insert(1); 258 tree.insert(2); 261 set<int>::reverse_iterator rit(tree [all...] |
/external/svox/pico/lib/ |
H A D | picokdt.c | 45 /* decision tree */ 53 overview extended binary tree file: 55 tree part 58 used in the tree 62 - bin-file, decision tree knowledge base in binary form 64 - dt-kb = header inputmaptables outputmaptables tree 76 start of kb to the start of the tree 104 part of kb, e.g. tree), 122 - NRINBYTES2: two bytes, number of single byte IDs the tree can produce 133 - tree 245 picoos_uint8 *tree; member in struct:__anon31400 [all...] |
/external/sqlite/dist/orig/ |
H A D | sqlite3.c | 219 ** hash of the entire source tree. 1818 ** the canonical SQLite source tree.</dd> 3168 ** <dd>The maximum depth of the parse tree on any expression.</dd>)^ 7588 int mxLevel; /* The largest iLevel value in the tree */ 7683 ** The maximum depth of an expression tree. This is limited to 8876 sqlite3_vfs *pVfs, /* VFS to use with this b-tree */ 8892 #define BTREE_SINGLE 4 /* The file contains at most 1 b-tree */ 11287 ** Each node of an expression in the parse tree is an instance 11294 ** tree. 11376 int nHeight; /* Height of the tree heade 147907 Rtree tree; local [all...] |
/external/sqlite/dist/ |
H A D | sqlite3.c | 219 ** hash of the entire source tree. 1818 ** the canonical SQLite source tree.</dd> 3168 ** <dd>The maximum depth of the parse tree on any expression.</dd>)^ 7588 int mxLevel; /* The largest iLevel value in the tree */ 7683 ** The maximum depth of an expression tree. This is limited to 8876 sqlite3_vfs *pVfs, /* VFS to use with this b-tree */ 8892 #define BTREE_SINGLE 4 /* The file contains at most 1 b-tree */ 11287 ** Each node of an expression in the parse tree is an instance 11294 ** tree. 11376 int nHeight; /* Height of the tree heade 147939 Rtree tree; local [all...] |
/external/srec/seti/sltsEngine/src/ |
H A D | run_seq_lts.c | 503 RT_LTREE * tree = NULL; local 547 trees[let] = tree = (RT_LTREE*) lts_alloc(1, sizeof(RT_LTREE)); 548 if (tree == NULL) { 553 tree->num_nodes = load_int(fp); 555 tree->values_or_question1 = (short*) lts_alloc(tree->num_nodes, sizeof(short)); 556 if (tree->values_or_question1 == NULL) { 561 tree->question2 = (short*) lts_alloc(tree->num_nodes, sizeof(short)); 562 if (tree 619 RT_LTREE * tree; local 1312 RT_LTREE *tree; local [all...] |
/external/skia/src/gpu/ |
H A D | GrRedBlackTree.h | 32 * In debug build this will cause full traversals of the tree when the validate 38 * A sorted tree that uses the red-black tree algorithm. Allows duplicate 46 * Creates an empty tree. 52 * Class used to iterater through the tree. The valid range of the tree 55 * legal to decerement end() if the tree is not empty to get the last 61 * Add an element to the tree. Duplicates are allowed. 68 * Removes all items in the tree. 73 * @return true if there are no items in the tree, fals 217 Iter(Node* n, GrRedBlackTree* tree) argument [all...] |
/external/skia/tests/ |
H A D | BBoxHierarchyTest.cpp | 76 SkBBoxHierarchy& tree) { 80 tree.search(query, &hits); 85 static void tree_test_main(SkBBoxHierarchy* tree, int minChildren, int maxChildren, argument 89 REPORTER_ASSERT(reporter, NULL != tree); 117 tree->insert(rects[i].data, rects[i].rect, true); 119 tree->flushDeferredInserts(); 120 run_queries(reporter, rand, rects, *tree); 121 REPORTER_ASSERT(reporter, NUM_RECTS == tree->getCount()); 123 ((expectedDepthMin <= 0) || (expectedDepthMin <= tree->getDepth())) && 124 ((expectedDepthMax <= 0) || (expectedDepthMax >= tree 75 run_queries(skiatest::Reporter* reporter, SkRandom& rand, DataRect rects[], SkBBoxHierarchy& tree) argument [all...] |
H A D | GrRedBlackTreeTest.cpp | 18 Tree tree; local 26 Tree::Iter xi = tree.insert(x); 31 tree.insert(0); 33 tree.insert(99); 35 REPORTER_ASSERT(reporter, *tree.begin() == 0); 36 REPORTER_ASSERT(reporter, *tree.last() == 99); 37 REPORTER_ASSERT(reporter, --(++tree.begin()) == tree.begin()); 38 REPORTER_ASSERT(reporter, --tree.end() == tree [all...] |
H A D | RTreeTest.cpp | 71 SkRTree& tree) { 75 tree.search(query, &hits); 70 run_queries(skiatest::Reporter* reporter, SkRandom& rand, DataRect rects[], SkRTree& tree) argument
|
/external/smali/smali/src/main/java/org/jf/smali/ |
H A D | SemanticException.java | 35 import org.antlr.runtime.tree.CommonTree; 51 SemanticException(IntStream input, CommonTree tree, String errorMessage, Object... messageArguments) { argument 54 this.token = tree.getToken(); 55 this.index = tree.getTokenStartIndex();
|
H A D | smaliParser.java | 15 import org.antlr.runtime.tree.*; 497 CommonTree tree; field in class:smaliParser.smali_file_return 499 public CommonTree getTree() { return tree; } 680 retval.tree = root_0; 742 retval.tree = root_0; 748 retval.tree = (CommonTree)adaptor.rulePostProcessing(root_0); 749 adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop); 755 retval.tree = (CommonTree)adaptor.errorNode(input, retval.start, input.LT(-1), re); 768 CommonTree tree; field in class:smaliParser.class_spec_return 770 public CommonTree getTree() { return tree; } 850 CommonTree tree; field in class:smaliParser.super_spec_return 930 CommonTree tree; field in class:smaliParser.implements_spec_return 1010 CommonTree tree; field in class:smaliParser.source_spec_return 1090 CommonTree tree; field in class:smaliParser.access_list_return 1194 CommonTree tree; field in class:smaliParser.field_return 1492 CommonTree tree; field in class:smaliParser.method_return 1609 CommonTree tree; field in class:smaliParser.statements_and_directives_return 1898 CommonTree tree; field in class:smaliParser.ordered_method_item_return 2058 CommonTree tree; field in class:smaliParser.registers_directive_return 2213 CommonTree tree; field in class:smaliParser.simple_name_return 3610 CommonTree tree; field in class:smaliParser.member_name_return 3711 CommonTree tree; field in class:smaliParser.method_prototype_return 3818 CommonTree tree; field in class:smaliParser.param_list_return 3980 CommonTree tree; field in class:smaliParser.type_descriptor_return 4037 CommonTree tree; field in class:smaliParser.nonvoid_type_descriptor_return 4094 CommonTree tree; field in class:smaliParser.reference_type_descriptor_return 4151 CommonTree tree; field in class:smaliParser.integer_literal_return 4267 CommonTree tree; field in class:smaliParser.float_literal_return 4367 CommonTree tree; field in class:smaliParser.double_literal_return 4467 CommonTree tree; field in class:smaliParser.literal_return 4795 CommonTree tree; field in class:smaliParser.parsed_integer_literal_return 4848 CommonTree tree; field in class:smaliParser.integral_literal_return 4993 CommonTree tree; field in class:smaliParser.fixed_32bit_literal_return 5178 CommonTree tree; field in class:smaliParser.fixed_literal_return 5384 CommonTree tree; field in class:smaliParser.array_literal_return 5539 CommonTree tree; field in class:smaliParser.annotation_element_return 5628 CommonTree tree; field in class:smaliParser.annotation_return 5762 CommonTree tree; field in class:smaliParser.subannotation_return 5882 CommonTree tree; field in class:smaliParser.enum_literal_return 5990 CommonTree tree; field in class:smaliParser.type_field_method_literal_return 7220 CommonTree tree; field in class:smaliParser.fully_qualified_method_return 7310 CommonTree tree; field in class:smaliParser.fully_qualified_field_return 7406 CommonTree tree; field in class:smaliParser.label_return 7487 CommonTree tree; field in class:smaliParser.label_ref_return 7561 CommonTree tree; field in class:smaliParser.register_list_return 7721 CommonTree tree; field in class:smaliParser.register_range_return 7849 CommonTree tree; field in class:smaliParser.verification_error_reference_return 10090 CommonTree tree; field in class:smaliParser.catch_directive_return 10214 CommonTree tree; field in class:smaliParser.catchall_directive_return 10330 CommonTree tree; field in class:smaliParser.parameter_directive_return 10561 CommonTree tree; field in class:smaliParser.debug_directive_return 10749 CommonTree tree; field in class:smaliParser.line_directive_return 10830 CommonTree tree; field in class:smaliParser.local_directive_return 11073 CommonTree tree; field in class:smaliParser.end_local_directive_return 11153 CommonTree tree; field in class:smaliParser.restart_local_directive_return 11233 CommonTree tree; field in class:smaliParser.prologue_directive_return 11306 CommonTree tree; field in class:smaliParser.epilogue_directive_return 11379 CommonTree tree; field in class:smaliParser.source_directive_return 11479 CommonTree tree; field in class:smaliParser.instruction_format12x_return 11579 CommonTree tree; field in class:smaliParser.instruction_format22s_return 11679 CommonTree tree; field in class:smaliParser.instruction_format31i_return 11779 CommonTree tree; field in class:smaliParser.instruction_return 12710 CommonTree tree; field in class:smaliParser.insn_format10t_return 12792 CommonTree tree; field in class:smaliParser.insn_format10x_return 12866 CommonTree tree; field in class:smaliParser.insn_format10x_odex_return 12920 CommonTree tree; field in class:smaliParser.insn_format11n_return 13015 CommonTree tree; field in class:smaliParser.insn_format11x_return 13096 CommonTree tree; field in class:smaliParser.insn_format12x_return 13190 CommonTree tree; field in class:smaliParser.insn_format20bc_return 13290 CommonTree tree; field in class:smaliParser.insn_format20t_return 13372 CommonTree tree; field in class:smaliParser.insn_format21c_field_return 13467 CommonTree tree; field in class:smaliParser.insn_format21c_field_odex_return 13567 CommonTree tree; field in class:smaliParser.insn_format21c_string_return 13661 CommonTree tree; field in class:smaliParser.insn_format21c_type_return 13756 CommonTree tree; field in class:smaliParser.insn_format21ih_return 13851 CommonTree tree; field in class:smaliParser.insn_format21lh_return 13946 CommonTree tree; field in class:smaliParser.insn_format21s_return 14041 CommonTree tree; field in class:smaliParser.insn_format21t_return 14136 CommonTree tree; field in class:smaliParser.insn_format22b_return 14242 CommonTree tree; field in class:smaliParser.insn_format22c_field_return 14348 CommonTree tree; field in class:smaliParser.insn_format22c_field_odex_return 14459 CommonTree tree; field in class:smaliParser.insn_format22c_type_return 14565 CommonTree tree; field in class:smaliParser.insn_format22cs_field_return 14649 CommonTree tree; field in class:smaliParser.insn_format22s_return 14756 CommonTree tree; field in class:smaliParser.insn_format22t_return 14862 CommonTree tree; field in class:smaliParser.insn_format22x_return 14955 CommonTree tree; field in class:smaliParser.insn_format23x_return 15059 CommonTree tree; field in class:smaliParser.insn_format30t_return 15141 CommonTree tree; field in class:smaliParser.insn_format31c_return 15235 CommonTree tree; field in class:smaliParser.insn_format31i_return 15331 CommonTree tree; field in class:smaliParser.insn_format31t_return 15426 CommonTree tree; field in class:smaliParser.insn_format32x_return 15519 CommonTree tree; field in class:smaliParser.insn_format35c_method_return 15627 CommonTree tree; field in class:smaliParser.insn_format35c_type_return 15735 CommonTree tree; field in class:smaliParser.insn_format35c_method_odex_return 15821 CommonTree tree; field in class:smaliParser.insn_format35mi_method_return 15906 CommonTree tree; field in class:smaliParser.insn_format35ms_method_return 15991 CommonTree tree; field in class:smaliParser.insn_format3rc_method_return 16099 CommonTree tree; field in class:smaliParser.insn_format3rc_method_odex_return 16185 CommonTree tree; field in class:smaliParser.insn_format3rc_type_return 16293 CommonTree tree; field in class:smaliParser.insn_format3rmi_method_return 16378 CommonTree tree; field in class:smaliParser.insn_format3rms_method_return 16463 CommonTree tree; field in class:smaliParser.insn_format51l_return 16558 CommonTree tree; field in class:smaliParser.insn_array_data_directive_return 16699 CommonTree tree; field in class:smaliParser.insn_packed_switch_directive_return 16834 CommonTree tree; field in class:smaliParser.insn_sparse_switch_directive_return [all...] |
/external/smali/util/src/main/java/ds/tree/ |
H A D | DuplicateKeyException.java | 25 package ds.tree;
|
H A D | RadixTree.java | 25 package ds.tree; 30 * This interface represent the operation of a radix tree. A radix tree, 31 * Patricia trie/tree, or crit bit tree is a specialized set data structure 37 * radix tree and crit bit tree are only applied to trees storing integers and 46 * Insert a new string key and its value to the tree. 58 * Delete a key and its associated value from the tree. 67 * @param key The key for which to search the tree [all...] |
H A D | RadixTreeImpl.java | 27 package ds.tree; 37 * Implementation for Radix tree {@link RadixTree} 155 * @see ds.tree.RadixTree#insert(java.lang.String, java.lang.Object) 168 * Recursively insert the key in the radix tree. 181 // or we need to go down the tree 334 * recursively visit the tree based on the supplied "key". calls the Visitor 338 * The key o prefix to search in the tree 411 * Writes a textual representation of this tree to the given formatter. 425 * If a tree contain "blah1", "blah2"
|