Searched refs:BytesTrie (Results 1 - 10 of 10) sorted by relevance
/external/icu4c/common/unicode/ |
H A D | bytestrie.h | 36 * Light-weight, non-const reader class for a BytesTrie. 48 class U_COMMON_API BytesTrie : public UMemory { class in inherits:UMemory 51 * Constructs a BytesTrie reader instance. 55 * The BytesTrie object will not read more bytes than 59 * the BytesTrie object is in use. 64 BytesTrie(const void *trieBytes) function in class:BytesTrie 72 ~BytesTrie(); 77 * @param other Another BytesTrie object. 80 BytesTrie(const BytesTrie function in class:BytesTrie 351 BytesTrie(void *adoptBytes, const void *trieBytes) function in class:BytesTrie [all...] |
H A D | bytestriebuilder.h | 29 * Builder class for BytesTrie. 66 * Builds a BytesTrie for the add()ed data. 77 * @return A new BytesTrie for the add()ed data. 80 BytesTrie *build(UStringTrieBuildOption buildOption, UErrorCode &errorCode); 83 * Builds a BytesTrie for the add()ed data and byte-serializes it. 98 * @return A StringPiece which refers to the byte-serialized BytesTrie for the add()ed data. 129 virtual int32_t getMaxBranchLinearSubNodeLength() const { return BytesTrie::kMaxBranchLinearSubNodeLength; } 130 virtual int32_t getMinLinearMatch() const { return BytesTrie::kMinLinearMatch; } 131 virtual int32_t getMaxLinearMatchLength() const { return BytesTrie::kMaxLinearMatchLength; }
|
H A D | urename.h | 1792 #define BytesTrie U_ICU_ENTRY_POINT_RENAME(BytesTrie) macro
|
/external/icu4c/common/ |
H A D | bytestrie.cpp | 24 BytesTrie::~BytesTrie() { 30 BytesTrie::readValue(const uint8_t *pos, int32_t leadByte) { 47 BytesTrie::jumpByDelta(const uint8_t *pos) { 67 BytesTrie::current() const { 79 BytesTrie::branchNext(const uint8_t *pos, int32_t length, int32_t inByte) { 149 BytesTrie::nextImpl(const uint8_t *pos, int32_t inByte) { 181 BytesTrie::next(int32_t inByte) { 207 BytesTrie::next(const char *s, int32_t sLength) { 314 BytesTrie [all...] |
H A D | bytestriebuilder.cpp | 29 * of the byte sequences, until the BytesTrie is built. 188 BytesTrie * 191 BytesTrie *newTrie=NULL; 193 newTrie=new BytesTrie(bytes, bytes+(bytesCapacity-bytesLength)); 424 if(0<=i && i<=BytesTrie::kMaxOneByteValue) { 425 return write(((BytesTrie::kMinOneByteValueLead+i)<<1)|isFinal); 430 intBytes[0]=(char)BytesTrie::kFiveByteValueLead; 436 // } else if(i<=BytesTrie::kMaxOneByteValue) { 437 // intBytes[0]=(char)(BytesTrie::kMinOneByteValueLead+i); 439 if(i<=BytesTrie [all...] |
H A D | bytestrieiterator.cpp | 23 BytesTrie::Iterator::Iterator(const void *trieBytes, int32_t maxStringLength, 35 // Unlike BytesTrie itself, its Iterator performs memory allocations anyway 45 BytesTrie::Iterator::Iterator(const BytesTrie &trie, int32_t maxStringLength, 76 BytesTrie::Iterator::~Iterator() { 81 BytesTrie::Iterator & 82 BytesTrie::Iterator::reset() { 97 BytesTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_->isEmpty(); } 100 BytesTrie::Iterator::next(UErrorCode &errorCode) { 171 BytesTrie [all...] |
H A D | propname.h | 109 static UBool containsName(BytesTrie &trie, const char *name); 186 * This is a sequence of BytesTrie structures, byte-serialized tries for
|
H A D | propname.cpp | 168 ++valueMapIndex; // Skip the BytesTrie offset. 217 UBool PropNameData::containsName(BytesTrie &trie, const char *name) { 258 BytesTrie trie(bytesTries+bytesTrieOffset); 280 // where the first word is the BytesTrie offset.
|
/external/icu4c/test/intltest/ |
H A D | bytestrietest.cpp | 48 BytesTrie *buildMonthsTrie(UStringTrieBuildOption buildOption); 60 BytesTrie *buildTrie(const StringAndValue data[], int32_t dataLength, 62 void checkFirst(BytesTrie &trie, const StringAndValue data[], int32_t dataLength); 63 void checkNext(BytesTrie &trie, const StringAndValue data[], int32_t dataLength); 64 void checkNextWithState(BytesTrie &trie, const StringAndValue data[], int32_t dataLength); 65 void checkNextString(BytesTrie &trie, const StringAndValue data[], int32_t dataLength); 66 void checkIterator(const BytesTrie &trie, const StringAndValue data[], int32_t dataLength); 67 void checkIterator(BytesTrie::Iterator &iter, const StringAndValue data[], int32_t dataLength); 266 BytesTrie *BytesTrieTest::buildMonthsTrie(UStringTrieBuildOption buildOption) { 307 LocalPointer<BytesTrie> tri [all...] |
/external/icu4c/test/perf/dicttrieperf/ |
H A D | dicttrieperf.cpp | 264 BytesTrie trie(nameTrieBytes); 298 printf("size of BytesTrie: %6ld\n", (long)length); 579 printf("size of BytesTrie: %6ld bytes\n", (long)length); 591 BytesTrie *trie; 596 bytesTrieMatches(BytesTrie &trie, 733 puts("Running BytesTrie perf tests on the .dat package file from the --sourcedir.\n"
|
Completed in 79 milliseconds