/external/icing/icing/legacy/index/ |
D | icing-dynamic-trie_test.cc | 58 static void StatsDump(const IcingDynamicTrie& trie) { in StatsDump() argument 60 trie.CollectStats(&stats); in StatsDump() 64 static void AddToTrie(IcingDynamicTrie* trie, uint32_t num_keys) { in AddToTrie() argument 69 bool inserted = trie->Insert(key.c_str(), &i); in AddToTrie() 74 static void CheckTrie(const IcingDynamicTrie& trie, uint32_t num_keys) { in CheckTrie() argument 80 bool found = trie.Find(key.c_str(), &val); in CheckTrie() 86 static void PrintTrie(const IcingDynamicTrie& trie) { in PrintTrie() argument 90 trie.DumpTrie(&os, &keys); in PrintTrie() 119 IcingDynamicTrie trie(trie_files_prefix_, IcingDynamicTrie::RuntimeOptions(), in TEST_F() local 121 ASSERT_TRUE(trie.CreateIfNotExist(IcingDynamicTrie::Options())); in TEST_F() [all …]
|
/external/marisa-trie/tests/ |
D | marisa-test.cc | 15 marisa::Trie trie; in TestEmptyTrie() local 17 EXCEPT(trie.save("marisa-test.dat"), MARISA_STATE_ERROR); in TestEmptyTrie() 19 EXCEPT(trie.write(::_fileno(stdout)), MARISA_STATE_ERROR); in TestEmptyTrie() 21 EXCEPT(trie.write(::fileno(stdout)), MARISA_STATE_ERROR); in TestEmptyTrie() 23 EXCEPT(std::cout << trie, MARISA_STATE_ERROR); in TestEmptyTrie() 24 EXCEPT(marisa::fwrite(stdout, trie), MARISA_STATE_ERROR); in TestEmptyTrie() 28 EXCEPT(trie.lookup(agent), MARISA_STATE_ERROR); in TestEmptyTrie() 29 EXCEPT(trie.reverse_lookup(agent), MARISA_STATE_ERROR); in TestEmptyTrie() 30 EXCEPT(trie.common_prefix_search(agent), MARISA_STATE_ERROR); in TestEmptyTrie() 31 EXCEPT(trie.predictive_search(agent), MARISA_STATE_ERROR); in TestEmptyTrie() [all …]
|
/external/icu/icu4c/source/common/ |
D | utrie2_builder.cpp | 113 allocIndex2Block(UNewTrie2 *trie); 117 UTrie2 *trie; in utrie2_open() local 126 trie=(UTrie2 *)uprv_malloc(sizeof(UTrie2)); in utrie2_open() 129 if(trie==NULL || newTrie==NULL || data==NULL) { in utrie2_open() 130 uprv_free(trie); in utrie2_open() 137 uprv_memset(trie, 0, sizeof(UTrie2)); in utrie2_open() 138 trie->initialValue=initialValue; in utrie2_open() 139 trie->errorValue=errorValue; in utrie2_open() 140 trie->highStart=0x110000; in utrie2_open() 141 trie->newTrie=newTrie; in utrie2_open() [all …]
|
D | utrie.cpp | 53 UNewTrie *trie; in utrie_open() local 63 trie=fillIn; in utrie_open() 65 trie=(UNewTrie *)uprv_malloc(sizeof(UNewTrie)); in utrie_open() 66 if(trie==NULL) { in utrie_open() 70 uprv_memset(trie, 0, sizeof(UNewTrie)); in utrie_open() 71 trie->isAllocated= (UBool)(fillIn==NULL); in utrie_open() 74 trie->data=aliasData; in utrie_open() 75 trie->isDataAllocated=FALSE; in utrie_open() 77 trie->data=(uint32_t *)uprv_malloc(maxDataLength*4); in utrie_open() 78 if(trie->data==NULL) { in utrie_open() [all …]
|
D | utrie2.cpp | 42 get32(const UNewTrie2 *trie, UChar32 c, UBool fromLSCP) { in get32() argument 45 if(c>=trie->highStart && (!U_IS_LEAD(c) || fromLSCP)) { in get32() 46 return trie->data[trie->dataLength-UTRIE2_DATA_GRANULARITY]; in get32() 53 i2=trie->index1[c>>UTRIE2_SHIFT_1]+ in get32() 56 block=trie->index2[i2]; in get32() 57 return trie->data[block+(c&UTRIE2_DATA_MASK)]; in get32() 61 utrie2_get32(const UTrie2 *trie, UChar32 c) { in utrie2_get32() argument 62 if(trie->data16!=NULL) { in utrie2_get32() 63 return UTRIE2_GET16(trie, c); in utrie2_get32() 64 } else if(trie->data32!=NULL) { in utrie2_get32() [all …]
|
D | ucptrie.cpp | 100 UCPTrie *trie = (UCPTrie *)uprv_malloc(sizeof(UCPTrie)); in ucptrie_openFromBinary() local 101 if (trie == nullptr) { in ucptrie_openFromBinary() 105 uprv_memcpy(trie, &tempTrie, sizeof(tempTrie)); in ucptrie_openFromBinary() 107 trie->name = "fromSerialized"; in ucptrie_openFromBinary() 112 trie->index = p16; in ucptrie_openFromBinary() 113 p16 += trie->indexLength; in ucptrie_openFromBinary() 116 int32_t nullValueOffset = trie->dataNullOffset; in ucptrie_openFromBinary() 117 if (nullValueOffset >= trie->dataLength) { in ucptrie_openFromBinary() 118 nullValueOffset = trie->dataLength - UCPTRIE_HIGH_VALUE_NEG_DATA_OFFSET; in ucptrie_openFromBinary() 122 trie->data.ptr16 = p16; in ucptrie_openFromBinary() [all …]
|
D | utrie2.h | 144 utrie2_get32(const UTrie2 *trie, UChar32 c); 194 utrie2_enum(const UTrie2 *trie, 242 utrie2_close(UTrie2 *trie); 254 utrie2_set32(UTrie2 *trie, UChar32 c, uint32_t value, UErrorCode *pErrorCode); 270 utrie2_setRange32(UTrie2 *trie, 295 utrie2_freeze(UTrie2 *trie, UTrie2ValueBits valueBits, UErrorCode *pErrorCode); 305 utrie2_isFrozen(const UTrie2 *trie); 326 utrie2_serialize(const UTrie2 *trie, 360 #define UTRIE2_GET16(trie, c) _UTRIE2_GET((trie), index, (trie)->indexLength, (c)) argument 370 #define UTRIE2_GET32(trie, c) _UTRIE2_GET((trie), data32, 0, (c)) argument [all …]
|
D | utrie.h | 178 #define _UTRIE_GET_RAW(trie, data, offset, c16) \ argument 179 (trie)->data[ \ 180 ((int32_t)((trie)->index[(offset)+((c16)>>UTRIE_SHIFT)])<<UTRIE_INDEX_SHIFT)+ \ 185 #define _UTRIE_GET_FROM_PAIR(trie, data, c, c2, result, resultType) UPRV_BLOCK_MACRO_BEGIN { \ argument 189 (result)=_UTRIE_GET_RAW((trie), data, 0, (c)); \ 190 __offset=(trie)->getFoldingOffset(result); \ 194 (result)=_UTRIE_GET_RAW((trie), data, __offset, (c2)&0x3ff); \ 196 (result)=(resultType)((trie)->initialValue); \ 201 #define _UTRIE_GET_FROM_BMP(trie, data, c16) \ argument 202 _UTRIE_GET_RAW(trie, data, 0xd800<=(c16) && (c16)<=0xdbff ? UTRIE_LEAD_INDEX_DISP : 0, c16) [all …]
|
D | utrie_swap.cpp | 30 UTrieHeader trie; in utrie_swap() local 49 trie.signature=ds->readUInt32(inTrie->signature); in utrie_swap() 50 trie.options=ds->readUInt32(inTrie->options); in utrie_swap() 51 trie.indexLength=udata_readInt32(ds, inTrie->indexLength); in utrie_swap() 52 trie.dataLength=udata_readInt32(ds, inTrie->dataLength); in utrie_swap() 54 if( trie.signature!=0x54726965 || in utrie_swap() 55 (trie.options&UTRIE_OPTIONS_SHIFT_MASK)!=UTRIE_SHIFT || in utrie_swap() 56 ((trie.options>>UTRIE_OPTIONS_INDEX_SHIFT)&UTRIE_OPTIONS_SHIFT_MASK)!=UTRIE_INDEX_SHIFT || in utrie_swap() 57 trie.indexLength<UTRIE_BMP_INDEX_LENGTH || in utrie_swap() 58 (trie.indexLength&(UTRIE_SURROGATE_BLOCK_COUNT-1))!=0 || in utrie_swap() [all …]
|
/external/icu/icu4c/source/test/intltest/ |
D | ucharstrietest.cpp | 71 void checkFirst(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength); 72 void checkNext(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength); 73 void checkNextWithState(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength); 74 void checkNextWithState64(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength); 75 void checkNextString(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength); 76 void checkIterator(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength); 299 LocalPointer<UCharsTrie> trie(buildTrie(data, UPRV_LENGTHOF(data), USTRINGTRIE_BUILD_FAST)); in TestNextForCodePoint() local 300 if(trie.isNull()) { in TestNextForCodePoint() 304 if( (result=trie->nextForCodePoint(0x4dff))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint() 305 (result=trie->nextForCodePoint(0x10000))!=USTRINGTRIE_NO_VALUE || result!=trie->current() || in TestNextForCodePoint() [all …]
|
D | bytestrietest.cpp | 64 void checkFirst(BytesTrie &trie, const StringAndValue data[], int32_t dataLength); 65 void checkNext(BytesTrie &trie, const StringAndValue data[], int32_t dataLength); 66 void checkNextWithState(BytesTrie &trie, const StringAndValue data[], int32_t dataLength); 67 void checkNextWithState64(BytesTrie &trie, const StringAndValue data[], int32_t dataLength); 68 void checkNextString(BytesTrie &trie, const StringAndValue data[], int32_t dataLength); 69 void checkIterator(const BytesTrie &trie, const StringAndValue data[], int32_t dataLength); 311 LocalPointer<BytesTrie> trie(buildMonthsTrie(USTRINGTRIE_BUILD_FAST)); in TestHasUniqueValue() local 312 if(trie.isNull()) { in TestHasUniqueValue() 316 if(trie->hasUniqueValue(uniqueValue)) { in TestHasUniqueValue() 319 trie->next('j'); in TestHasUniqueValue() [all …]
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/util/ |
D | CharsTrieTest.java | 247 CharsTrie trie=buildTrie(data, data.length, StringTrieBuilder.Option.FAST); in Test32NextForCodePoint() local 249 … if( (result=trie.nextForCodePoint(0x4dff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint() 250 … (result=trie.nextForCodePoint(0x10000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint() 251 … (result=trie.nextForCodePoint(0x9999))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint() 252 … (result=trie.nextForCodePoint(0x20000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint() 253 … (result=trie.nextForCodePoint(0xdfff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint() 254 …(result=trie.nextForCodePoint(0x10ffff))!=BytesTrie.Result.FINAL_VALUE || result!=trie.current() || in Test32NextForCodePoint() 255 trie.getValue()!=2000000000 in Test32NextForCodePoint() 259 …if( (result=trie.firstForCodePoint(0x4dff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint() 260 … (result=trie.nextForCodePoint(0x10000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint() [all …]
|
D | BytesTrieTest.java | 268 BytesTrie trie=buildMonthsTrie(StringTrieBuilder.Option.FAST); in Test40GetUniqueValue() local 270 if((uniqueValue=trie.getUniqueValue())!=0) { in Test40GetUniqueValue() 273 trie.next('j'); in Test40GetUniqueValue() 274 trie.next('a'); in Test40GetUniqueValue() 275 trie.next('n'); in Test40GetUniqueValue() 277 if((uniqueValue=trie.getUniqueValue())!=((1<<1)|1)) { in Test40GetUniqueValue() 280 trie.first('j'); in Test40GetUniqueValue() 281 trie.next('u'); in Test40GetUniqueValue() 282 if((uniqueValue=trie.getUniqueValue())!=0) { in Test40GetUniqueValue() 285 if(trie.next('n')!=BytesTrie.Result.INTERMEDIATE_VALUE || 6!=trie.getValue()) { in Test40GetUniqueValue() [all …]
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/util/ |
D | CharsTrieTest.java | 244 CharsTrie trie=buildTrie(data, data.length, StringTrieBuilder.Option.FAST); in Test32NextForCodePoint() local 246 … if( (result=trie.nextForCodePoint(0x4dff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint() 247 … (result=trie.nextForCodePoint(0x10000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint() 248 … (result=trie.nextForCodePoint(0x9999))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint() 249 … (result=trie.nextForCodePoint(0x20000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint() 250 … (result=trie.nextForCodePoint(0xdfff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint() 251 …(result=trie.nextForCodePoint(0x10ffff))!=BytesTrie.Result.FINAL_VALUE || result!=trie.current() || in Test32NextForCodePoint() 252 trie.getValue()!=2000000000 in Test32NextForCodePoint() 256 …if( (result=trie.firstForCodePoint(0x4dff))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint() 257 … (result=trie.nextForCodePoint(0x10000))!=BytesTrie.Result.NO_VALUE || result!=trie.current() || in Test32NextForCodePoint() [all …]
|
D | BytesTrieTest.java | 265 BytesTrie trie=buildMonthsTrie(StringTrieBuilder.Option.FAST); in Test40GetUniqueValue() local 267 if((uniqueValue=trie.getUniqueValue())!=0) { in Test40GetUniqueValue() 270 trie.next('j'); in Test40GetUniqueValue() 271 trie.next('a'); in Test40GetUniqueValue() 272 trie.next('n'); in Test40GetUniqueValue() 274 if((uniqueValue=trie.getUniqueValue())!=((1<<1)|1)) { in Test40GetUniqueValue() 277 trie.first('j'); in Test40GetUniqueValue() 278 trie.next('u'); in Test40GetUniqueValue() 279 if((uniqueValue=trie.getUniqueValue())!=0) { in Test40GetUniqueValue() 282 if(trie.next('n')!=BytesTrie.Result.INTERMEDIATE_VALUE || 6!=trie.getValue()) { in Test40GetUniqueValue() [all …]
|
/external/icu/icu4c/source/common/unicode/ |
D | ucptrie.h | 217 ucptrie_close(UCPTrie *trie); 229 ucptrie_getType(const UCPTrie *trie); 241 ucptrie_getValueWidth(const UCPTrie *trie); 258 ucptrie_get(const UCPTrie *trie, UChar32 c); 297 ucptrie_getRange(const UCPTrie *trie, UChar32 start, 317 ucptrie_toBinary(const UCPTrie *trie, void *data, int32_t capacity, UErrorCode *pErrorCode); 327 #define UCPTRIE_16(trie, i) ((trie)->data.ptr16[i]) argument 337 #define UCPTRIE_32(trie, i) ((trie)->data.ptr32[i]) argument 347 #define UCPTRIE_8(trie, i) ((trie)->data.ptr8[i]) argument 359 #define UCPTRIE_FAST_GET(trie, dataAccess, c) dataAccess(trie, _UCPTRIE_CP_INDEX(trie, 0xffff, c)) argument [all …]
|
/external/icu/libandroidicu/include/unicode/ |
D | ucptrie.h | 217 ucptrie_close(UCPTrie *trie); 229 ucptrie_getType(const UCPTrie *trie); 241 ucptrie_getValueWidth(const UCPTrie *trie); 258 ucptrie_get(const UCPTrie *trie, UChar32 c); 297 ucptrie_getRange(const UCPTrie *trie, UChar32 start, 317 ucptrie_toBinary(const UCPTrie *trie, void *data, int32_t capacity, UErrorCode *pErrorCode); 327 #define UCPTRIE_16(trie, i) ((trie)->data.ptr16[i]) argument 337 #define UCPTRIE_32(trie, i) ((trie)->data.ptr32[i]) argument 347 #define UCPTRIE_8(trie, i) ((trie)->data.ptr8[i]) argument 359 #define UCPTRIE_FAST_GET(trie, dataAccess, c) dataAccess(trie, _UCPTRIE_CP_INDEX(trie, 0xffff, c)) argument [all …]
|
/external/icu/libicu/cts_headers/unicode/ |
D | ucptrie.h | 217 ucptrie_close(UCPTrie *trie); 229 ucptrie_getType(const UCPTrie *trie); 241 ucptrie_getValueWidth(const UCPTrie *trie); 258 ucptrie_get(const UCPTrie *trie, UChar32 c); 297 ucptrie_getRange(const UCPTrie *trie, UChar32 start, 317 ucptrie_toBinary(const UCPTrie *trie, void *data, int32_t capacity, UErrorCode *pErrorCode); 327 #define UCPTRIE_16(trie, i) ((trie)->data.ptr16[i]) argument 337 #define UCPTRIE_32(trie, i) ((trie)->data.ptr32[i]) argument 347 #define UCPTRIE_8(trie, i) ((trie)->data.ptr8[i]) argument 359 #define UCPTRIE_FAST_GET(trie, dataAccess, c) dataAccess(trie, _UCPTRIE_CP_INDEX(trie, 0xffff, c)) argument [all …]
|
/external/icu/libicu/cts_headers/ |
D | utrie2.h | 144 utrie2_get32(const UTrie2 *trie, UChar32 c); 194 utrie2_enum(const UTrie2 *trie, 242 utrie2_close(UTrie2 *trie); 254 utrie2_set32(UTrie2 *trie, UChar32 c, uint32_t value, UErrorCode *pErrorCode); 270 utrie2_setRange32(UTrie2 *trie, 295 utrie2_freeze(UTrie2 *trie, UTrie2ValueBits valueBits, UErrorCode *pErrorCode); 305 utrie2_isFrozen(const UTrie2 *trie); 326 utrie2_serialize(const UTrie2 *trie, 360 #define UTRIE2_GET16(trie, c) _UTRIE2_GET((trie), index, (trie)->indexLength, (c)) argument 370 #define UTRIE2_GET32(trie, c) _UTRIE2_GET((trie), data32, 0, (c)) argument [all …]
|
D | utrie.h | 178 #define _UTRIE_GET_RAW(trie, data, offset, c16) \ argument 179 (trie)->data[ \ 180 ((int32_t)((trie)->index[(offset)+((c16)>>UTRIE_SHIFT)])<<UTRIE_INDEX_SHIFT)+ \ 185 #define _UTRIE_GET_FROM_PAIR(trie, data, c, c2, result, resultType) UPRV_BLOCK_MACRO_BEGIN { \ argument 189 (result)=_UTRIE_GET_RAW((trie), data, 0, (c)); \ 190 __offset=(trie)->getFoldingOffset(result); \ 194 (result)=_UTRIE_GET_RAW((trie), data, __offset, (c2)&0x3ff); \ 196 (result)=(resultType)((trie)->initialValue); \ 201 #define _UTRIE_GET_FROM_BMP(trie, data, c16) \ argument 202 _UTRIE_GET_RAW(trie, data, 0xd800<=(c16) && (c16)<=0xdbff ? UTRIE_LEAD_INDEX_DISP : 0, c16) [all …]
|
/external/icu/icu4c/source/test/cintltst/ |
D | trie2test.c | 100 const UTrie2 *trie, in testTrieEnum() argument 108 utrie2_enum(trie, testEnumValue, testEnumRange, &checkRanges); in testTrieEnum() 114 const UTrie2 *trie, UTrie2ValueBits valueBits, in testTrieGetters() argument 121 UBool isFrozen=utrie2_isFrozen(trie); in testTrieGetters() 136 value2=UTRIE2_GET16_FROM_U16_SINGLE_LEAD(trie, start); in testTrieGetters() 138 value2=UTRIE2_GET32_FROM_U16_SINGLE_LEAD(trie, start); in testTrieGetters() 147 value2=UTRIE2_GET16_FROM_SUPP(trie, start); in testTrieGetters() 149 value2=UTRIE2_GET32_FROM_SUPP(trie, start); in testTrieGetters() 157 value2=UTRIE2_GET16(trie, start); in testTrieGetters() 159 value2=UTRIE2_GET32(trie, start); in testTrieGetters() [all …]
|
/external/llvm-project/llvm/test/tools/llvm-objdump/MachO/ |
D | bad-trie.test | 1 RUN: not llvm-objdump --macho --exports-trie %p/Inputs/macho-trie-bad-kind 2>&1 | FileCheck --check… 2 BAD_KIND: macho-trie-bad-kind': truncated or malformed object (unsupported exported symbol kind: 3 … 4 RUN: not llvm-objdump --macho --exports-trie %p/Inputs/macho-trie-bad-export-info-malformed-uleb128… 5 … macho-trie-bad-export-info-malformed-uleb128': truncated or malformed object (export info size ma… 7 RUN: not llvm-objdump --macho --exports-trie %p/Inputs/macho-trie-bad-export-info-malformed-uleb128… 8 … macho-trie-bad-export-info-malformed-uleb128_too_big': truncated or malformed object (export info… 10 RUN: not llvm-objdump --macho --exports-trie %p/Inputs/macho-trie-export-info-size-too-big 2>&1 | F… 11 …trie-export-info-size-too-big': truncated or malformed object (export info size: 0x1234 in export … 13 RUN: not llvm-objdump --macho --exports-trie %p/Inputs/macho-trie-children-count-byte 2>&1 | FileCh… 14 …acho-trie-children-count-byte': truncated or malformed object (byte for count of childern in expor… [all …]
|
/external/marisa-trie/bindings/ruby/ |
D | sample.rb | 9 trie = Marisa::Trie.new 10 trie.build(keyset) 11 print("no. keys: ", trie.num_keys(), "\n") 12 print("no. tries: ", trie.num_tries(), "\n") 13 print("no. nodes: ", trie.num_nodes(), "\n") 14 print("size: ", trie.io_size(), "\n") 19 trie.lookup(agent) 23 trie.lookup(agent) 27 if not trie.lookup(agent) 31 print("ice: ", trie.lookup("ice"), "\n") [all …]
|
/external/marisa-trie/bindings/perl/ |
D | sample.pl | 9 $trie = new marisa::Trie; 10 $trie->build($keyset); 11 print("no. keys: ", $trie->num_keys(), "\n"); 12 print("no. tries: ", $trie->num_tries(), "\n"); 13 print("no. nodes: ", $trie->num_nodes(), "\n"); 14 print("size: ", $trie->io_size(), "\n"); 19 $trie->lookup($agent); 23 $trie->lookup($agent); 27 if ($trie->lookup(agent)) { 31 print("ice: ", $trie->lookup("ice"), "\n"); [all …]
|
/external/marisa-trie/bindings/python/ |
D | sample.py | 9 trie = marisa.Trie() variable 10 trie.build(keyset) 11 print("no. keys: %d" % trie.num_keys()) 12 print("no. tries: %d" % trie.num_tries()) 13 print("no. nodes: %d" % trie.num_nodes()) 14 print("size: %d" % trie.io_size()) 19 trie.lookup(agent) 23 trie.lookup(agent) 27 if not trie.lookup(agent): 30 print("ice: %d" % trie.lookup("ice")) [all …]
|