Home
last modified time | relevance | path

Searched refs:UCharsTrie (Results 1 – 16 of 16) sorted by relevance

/external/icu/icu4c/source/test/intltest/
Ducharstrietest.cpp53 UCharsTrie *buildLargeTrie(int32_t numUniqueFirst);
56 UCharsTrie *buildMonthsTrie(UStringTrieBuildOption buildOption);
68 UCharsTrie *buildTrie(const StringAndValue data[], int32_t dataLength,
70 void checkFirst(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
71 void checkNext(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
72 void checkNextWithState(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
73 void checkNextString(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
74 void checkIterator(UCharsTrie &trie, const StringAndValue data[], int32_t dataLength);
75 void checkIterator(UCharsTrie::Iterator &iter, const StringAndValue data[], int32_t dataLength);
297 LocalPointer<UCharsTrie> trie(buildTrie(data, UPRV_LENGTHOF(data), USTRINGTRIE_BUILD_FAST)); in TestNextForCodePoint()
[all …]
/external/icu/icu4c/source/common/unicode/
Ducharstrie.h50 class U_COMMON_API UCharsTrie : public UMemory {
66 UCharsTrie(const UChar *trieUChars) in UCharsTrie() function
74 ~UCharsTrie();
82 UCharsTrie(const UCharsTrie &other) in UCharsTrie() function
91 UCharsTrie &reset() { in reset()
110 friend class UCharsTrie;
124 const UCharsTrie &saveState(State &state) const { in saveState()
141 UCharsTrie &resetToState(const State &state) { in resetToState()
284 Iterator(const UCharsTrie &trie, int32_t maxStringLength, UErrorCode &errorCode);
371 UCharsTrie(UChar *adoptUChars, const UChar *trieUChars) in UCharsTrie() function
[all …]
Ducharstriebuilder.h89 UCharsTrie *build(UStringTrieBuildOption buildOption, UErrorCode &errorCode);
149 …virtual int32_t getMaxBranchLinearSubNodeLength() const { return UCharsTrie::kMaxBranchLinearSubNo… in getMaxBranchLinearSubNodeLength()
150 virtual int32_t getMinLinearMatch() const { return UCharsTrie::kMinLinearMatch; } in getMinLinearMatch()
151 virtual int32_t getMaxLinearMatchLength() const { return UCharsTrie::kMaxLinearMatchLength; } in getMaxLinearMatchLength()
/external/icu/icu4c/source/common/
Ducharstrie.cpp27 UCharsTrie::~UCharsTrie() { in ~UCharsTrie()
32 UCharsTrie::current() const { in current()
44 UCharsTrie::firstForCodePoint(UChar32 cp) { in firstForCodePoint()
53 UCharsTrie::nextForCodePoint(UChar32 cp) { in nextForCodePoint()
62 UCharsTrie::branchNext(const UChar *pos, int32_t length, int32_t uchar) { in branchNext()
124 UCharsTrie::nextImpl(const UChar *pos, int32_t uchar) { in nextImpl()
155 UCharsTrie::next(int32_t uchar) { in next()
178 UCharsTrie::next(const UChar *s, int32_t sLength) { in next()
285 UCharsTrie::findUniqueValueFromBranch(const UChar *pos, int32_t length, in findUniqueValueFromBranch()
323 UCharsTrie::findUniqueValue(const UChar *pos, UBool haveUniqueValue, int32_t &uniqueValue) { in findUniqueValue()
[all …]
Ducharstrieiterator.cpp24 UCharsTrie::Iterator::Iterator(const UChar *trieUChars, int32_t maxStringLength, in Iterator()
46 UCharsTrie::Iterator::Iterator(const UCharsTrie &trie, int32_t maxStringLength, in Iterator()
77 UCharsTrie::Iterator::~Iterator() { in ~Iterator()
81 UCharsTrie::Iterator &
82 UCharsTrie::Iterator::reset() { in reset()
98 UCharsTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_->isEmpty(); } in hasNext()
101 UCharsTrie::Iterator::next(UErrorCode &errorCode) { in next()
186 UCharsTrie::Iterator::branchNext(const UChar *pos, int32_t length, UErrorCode &errorCode) { in branchNext()
Ducharstriebuilder.cpp145 UCharsTrie *
148 UCharsTrie *newTrie=NULL; in build()
150 newTrie=new UCharsTrie(uchars, uchars+(ucharsCapacity-ucharsLength)); in build()
376 if(0<=i && i<=UCharsTrie::kMaxOneUnitValue) { in writeValueAndFinal()
381 if(i<0 || i>UCharsTrie::kMaxTwoUnitValue) { in writeValueAndFinal()
382 intUnits[0]=(UChar)(UCharsTrie::kThreeUnitValueLead); in writeValueAndFinal()
390 intUnits[0]=(UChar)(UCharsTrie::kMinTwoUnitValueLead+(i>>16)); in writeValueAndFinal()
405 if(value<0 || value>UCharsTrie::kMaxTwoUnitNodeValue) { in writeValueAndType()
406 intUnits[0]=(UChar)(UCharsTrie::kThreeUnitNodeValueLead); in writeValueAndType()
410 } else if(value<=UCharsTrie::kMaxOneUnitNodeValue) { in writeValueAndType()
[all …]
Dfilteredbrk.cpp140 SimpleFilteredSentenceBreakData(UCharsTrie *forwards, UCharsTrie *backwards ) in SimpleFilteredSentenceBreakData()
146 LocalPointer<UCharsTrie> fForwardsPartialTrie; // Has ".a" for "a.M."
147 LocalPointer<UCharsTrie> fBackwardsTrie; // i.e. ".srM" for Mrs.
158 …SimpleFilteredSentenceBreakIterator(BreakIterator *adopt, UCharsTrie *forwards, UCharsTrie *backwa…
242 …::SimpleFilteredSentenceBreakIterator(BreakIterator *adopt, UCharsTrie *forwards, UCharsTrie *back… in SimpleFilteredSentenceBreakIterator()
582 LocalPointer<UCharsTrie> backwardsTrie; // i.e. ".srM" for Mrs. in build()
583 LocalPointer<UCharsTrie> forwardsPartialTrie; // Has ".a" for "a.M." in build()
Ddictionarydata.h29 class UCharsTrie; variable
Ddictionarydata.cpp49 UCharsTrie uct(characters); in matches()
/external/icu/icu4c/source/i18n/
Dcollationsets.cpp219 UCharsTrie::Iterator prefixes(p, 0, errorCode); in comparePrefixes()
220 UCharsTrie::Iterator basePrefixes(q, 0, errorCode); in comparePrefixes()
264 UCharsTrie::Iterator suffixes(p, 0, errorCode); in compareContractions()
265 UCharsTrie::Iterator baseSuffixes(q, 0, errorCode); in compareContractions()
310 UCharsTrie::Iterator prefixes(p, 0, errorCode); in addPrefixes()
330 UCharsTrie::Iterator suffixes(p, 0, errorCode); in addContractions()
547 UCharsTrie::Iterator prefixes(p + 2, 0, errorCode); in handlePrefixes()
573 UCharsTrie::Iterator suffixes(p + 2, 0, errorCode); in handleContractions()
Dcollationiterator.cpp126 void saveTrieState(const UCharsTrie &trie) { trie.saveState(state); } in saveTrieState()
127 void resetToTrieState(UCharsTrie &trie) const { trie.resetToState(state); } in resetToTrieState()
144 UCharsTrie::State state;
455 UCharsTrie prefixes(p); in getCE32FromPrefix()
503 UCharsTrie suffixes(p); in nextCE32FromContraction()
558 const CollationData *d, UCharsTrie &suffixes, uint32_t ce32, in nextCE32FromDiscontiguousContraction()
Dcollationiterator.h28 class UCharsTrie; variable
282 const CollationData *d, UCharsTrie &suffixes, uint32_t ce32,
Dcollationfastlatinbuilder.cpp361 UCharsTrie::Iterator suffixes(p + 2, 0, errorCode); in getCEsFromContractionCE32()
Dcollationdatabuilder.cpp813 UCharsTrie::Iterator prefixes(p + 2, 0, errorCode); in copyFromBaseCE32()
883 UCharsTrie::Iterator suffixes(p + 2, 0, errorCode); in copyContractionsFromBaseCE32()
/external/icu/icu4c/source/test/perf/dicttrieperf/
Ddicttrieperf.cpp349 ucharsTrieMatches(UCharsTrie &trie, in ucharsTrieMatches()
434 UCharsTrie *trie;
/external/icu/icu4c/source/tools/gendict/
Dgendict.cpp465 UCharsTrie::Iterator it((const UChar *)outData, outDataSize, status); in main()