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

  /external/icu4c/common/unicode/
bytestrie.h 66 pos_(bytes_), remainingMatchLength_(-1) {}
82 pos_(other.pos_), remainingMatchLength_(other.remainingMatchLength_) {}
91 remainingMatchLength_=-1;
125 state.remainingMatchLength=remainingMatchLength_;
142 remainingMatchLength_=state.remainingMatchLength;
164 remainingMatchLength_=-1;
225 return pos!=NULL && findUniqueValue(pos+remainingMatchLength_+1, FALSE, uniqueValue);
324 int32_t remainingMatchLength_;
354 pos_(bytes_), remainingMatchLength_(-1) {
    [all...]
ucharstrie.h 66 pos_(uchars_), remainingMatchLength_(-1) {}
82 pos_(other.pos_), remainingMatchLength_(other.remainingMatchLength_) {}
91 remainingMatchLength_=-1;
125 state.remainingMatchLength=remainingMatchLength_;
142 remainingMatchLength_=state.remainingMatchLength;
163 remainingMatchLength_=-1;
252 return pos!=NULL && findUniqueValue(pos+remainingMatchLength_+1, FALSE, uniqueValue);
354 int32_t remainingMatchLength_;
383 pos_(uchars_), remainingMatchLength_(-1) {
    [all...]
  /external/icu4c/common/
bytestrieiterator.cpp 27 remainingMatchLength_(-1), initialRemainingMatchLength_(-1),
48 remainingMatchLength_(trie.remainingMatchLength_),
49 initialRemainingMatchLength_(trie.remainingMatchLength_),
63 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
72 remainingMatchLength_-=length;
84 remainingMatchLength_=initialRemainingMatchLength_;
85 int32_t length=remainingMatchLength_+1; // Remaining match length.
91 remainingMatchLength_-=length;
126 if(remainingMatchLength_>=0)
    [all...]
ucharstrieiterator.cpp 26 remainingMatchLength_(-1), initialRemainingMatchLength_(-1),
47 remainingMatchLength_(trie.remainingMatchLength_),
48 initialRemainingMatchLength_(trie.remainingMatchLength_),
62 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
71 remainingMatchLength_-=length;
82 remainingMatchLength_=initialRemainingMatchLength_;
84 int32_t length=remainingMatchLength_+1; // Remaining match length.
90 remainingMatchLength_-=length;
125 if(remainingMatchLength_>=0)
    [all...]
bytestrie.cpp 73 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
158 remainingMatchLength_=--length;
189 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
193 remainingMatchLength_=--length;
216 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
224 remainingMatchLength_=length;
231 remainingMatchLength_=length;
244 remainingMatchLength_=length;
253 remainingMatchLength_=length;
391 if(remainingMatchLength_>=0)
    [all...]
ucharstrie.cpp 35 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
112 remainingMatchLength_=--length;
139 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
143 remainingMatchLength_=--length;
166 int32_t length=remainingMatchLength_; // Actual remaining match length minus 1.
174 remainingMatchLength_=length;
181 remainingMatchLength_=length;
194 remainingMatchLength_=length;
203 remainingMatchLength_=length;
350 if(remainingMatchLength_>=0)
    [all...]

Completed in 165 milliseconds