HomeSort by relevance Sort by last modified time
    Searched refs:BytesTrie (Results 1 - 12 of 12) sorted by null

  /external/icu4c/common/unicode/
bytestrie.h 6 * file name: bytestrie.h
36 * Light-weight, non-const reader class for a BytesTrie.
48 class U_COMMON_API BytesTrie : public 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)
72 ~BytesTrie();
77 * @param other Another BytesTrie object.
80 BytesTrie(const BytesTrie &other
    [all...]
bytestriebuilder.h 17 * \brief C++ API: Builder for icu::BytesTrie
24 #include "unicode/bytestrie.h"
34 * Builder class for BytesTrie.
71 * Builds a BytesTrie for the add()ed data.
82 * @return A new BytesTrie for the add()ed data.
85 BytesTrie *build(UStringTrieBuildOption buildOption, UErrorCode &errorCode);
88 * Builds a BytesTrie for the add()ed data and byte-serializes it.
103 * @return A StringPiece which refers to the byte-serialized BytesTrie for the add()ed data.
134 virtual int32_t getMaxBranchLinearSubNodeLength() const { return BytesTrie::kMaxBranchLinearSubNodeLength; }
135 virtual int32_t getMinLinearMatch() const { return BytesTrie::kMinLinearMatch;
    [all...]
  /external/icu4c/common/
bytestrie.cpp 6 * file name: bytestrie.cpp
17 #include "unicode/bytestrie.h"
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)
    [all...]
bytestriebuilder.cpp 16 #include "unicode/bytestrie.h"
30 * of the byte sequences, until the BytesTrie is built.
190 BytesTrie *
193 BytesTrie *newTrie=NULL;
195 newTrie=new BytesTrie(bytes, bytes+(bytesCapacity-bytesLength));
426 if(0<=i && i<=BytesTrie::kMaxOneByteValue) {
427 return write(((BytesTrie::kMinOneByteValueLead+i)<<1)|isFinal);
432 intBytes[0]=(char)BytesTrie::kFiveByteValueLead;
438 // } else if(i<=BytesTrie::kMaxOneByteValue) {
439 // intBytes[0]=(char)(BytesTrie::kMinOneByteValueLead+i)
    [all...]
bytestrieiterator.cpp 16 #include "unicode/bytestrie.h"
23 BytesTrie::Iterator::Iterator(const void *trieBytes, int32_t maxStringLength,
32 // str_ and stack_ are pointers so that it's easy to turn bytestrie.h into
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();
    [all...]
propname.h 16 #include "unicode/bytestrie.h"
109 static UBool containsName(BytesTrie &trie, const char *name);
186 * This is a sequence of BytesTrie structures, byte-serialized tries for
dictionarydata.h 28 class BytesTrie;
92 // Implementation of the DictionaryMatcher interface for a BytesTrie dictionary
121 * A dictionary .dict data file contains a byte-serialized BytesTrie or
125 * For a BytesTrie, a transformation type is specified for
135 * For the data structure of BytesTrie & UCharsTrie see
137 * and the bytestrie.h and ucharstrie.h header files.
158 * stringTrie; -- a serialized BytesTrie or UCharsTrie
propname.cpp 169 ++valueMapIndex; // Skip the BytesTrie offset.
218 UBool PropNameData::containsName(BytesTrie &trie, const char *name) {
259 BytesTrie trie(bytesTries+bytesTrieOffset);
281 // where the first word is the BytesTrie offset.
dictionarydata.cpp 14 #include "unicode/bytestrie.h"
103 BytesTrie bt(characters);
  /external/icu4c/test/intltest/
bytestrietest.cpp 18 #include "unicode/bytestrie.h"
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)
    [all...]
  /external/icu4c/test/perf/dicttrieperf/
dicttrieperf.cpp 27 #include "unicode/bytestrie.h"
263 BytesTrie trie(nameTrieBytes);
297 printf("size of BytesTrie: %6ld\n", (long)length);
528 printf("size of BytesTrie: %6ld bytes\n", (long)length);
540 BytesTrie *trie;
545 bytesTrieMatches(BytesTrie &trie,
676 puts("Running BytesTrie perf tests on the .dat package file from the --sourcedir.\n"
693 name="bytestrie";
  /external/icu4c/tools/gendict/
gendict.cpp 21 #include "unicode/bytestrie.h"
123 "\t--bytes output a BytesTrie (mutually exclusive with -u!)\n"
236 // if we are a bytestrie, give back the StringPiece representing the serialized version of us
354 if (verbose) { printf("Initializing dictionary builder of type %s...\n", (isBytesTrie ? "BytesTrie" : "UCharsTrie")); }
480 BytesTrie::Iterator it(outData, outDataSize, status);

Completed in 816 milliseconds