Searched defs:rune (Results 1 - 11 of 11) sorted by relevance

/external/chromium_org/third_party/libphonenumber/src/phonenumbers/utf/
H A Dunilib.cc49 char32 rune; local
53 int bytes_consumed = charntorune(&rune, p, end - p);
57 if ((rune == Runeerror && bytes_consumed == 1) ||
58 !IsInterchangeValidCodepoint(rune)) {
H A Drune.c66 charntorune(Rune *rune, const char *str, int length) argument
82 *rune = c;
104 *rune = l;
124 *rune = l;
142 *rune = l;
153 *rune = Bad;
156 *rune = Bad;
167 chartorune(Rune *rune, const char *str) argument
178 *rune = c;
195 *rune
243 isvalidcharntorune(const char* str, int length, Rune* rune, int* consumed) argument
249 runetochar(char *str, const Rune *rune) argument
306 runelen(Rune rune) argument
[all...]
H A Dunicodetext.cc88 char32 rune; local
90 if (isvalidcharntorune(start, end - start, &rune, &n)) {
/external/chromium_org/third_party/re2/util/
H A Drune.cc49 chartorune(Rune *rune, const char *str) argument
60 *rune = c;
77 *rune = l;
92 *rune = l;
107 *rune = l;
120 *rune = Bad;
125 runetochar(char *str, const Rune *rune) argument
134 c = *rune;
151 * If the Rune is out of range, convert it to the error rune.
152 * Do this test here because the error rune encode
182 runelen(Rune rune) argument
214 Rune rune; local
[all...]
/external/regex-re2/util/
H A Drune.cc49 chartorune(Rune *rune, const char *str) argument
60 *rune = c;
77 *rune = l;
92 *rune = l;
107 *rune = l;
120 *rune = Bad;
125 runetochar(char *str, const Rune *rune) argument
134 c = *rune;
151 * If the Rune is out of range, convert it to the error rune.
152 * Do this test here because the error rune encode
182 runelen(Rune rune) argument
214 Rune rune; local
[all...]
/external/chromium_org/third_party/re2/re2/
H A Dregexp.cc283 Regexp* Regexp::NewLiteral(Rune rune, ParseFlags flags) { argument
285 re->rune_ = rune;
338 return a->rune() == b->rune() &&
H A Dregexp.h328 Rune rune() { DCHECK_EQ(op_, kRegexpLiteral); return rune_; } function in class:re2::Regexp
393 static Regexp* NewLiteral(Rune rune, ParseFlags flags);
H A Dparse.cc62 // Pushes the literal rune r onto the stack.
270 // Returns the result of applying the fold f to the rune r.
317 // AddFoldedRange calls itself recursively for each rune in the fold cycle.
333 if (lo < f->lo) { // lo has no fold; next rune with a fold is f->lo
367 // Pushes the literal rune r onto the stack.
547 Rune rune; local
550 rune = r3->rune_;
554 AddLiteral(r3->ccb_, rune, r3->parse_flags_ & Regexp::FoldCase);
735 Rune rune = re->runes_[re->nrunes_ - 1]; local
739 re->rune_ = rune;
1086 Rune rune = re2->rune_; local
[all...]
/external/regex-re2/re2/
H A Dregexp.cc283 Regexp* Regexp::NewLiteral(Rune rune, ParseFlags flags) { argument
285 re->rune_ = rune;
338 return a->rune() == b->rune() &&
H A Dregexp.h328 Rune rune() { DCHECK_EQ(op_, kRegexpLiteral); return rune_; } function in class:re2::Regexp
393 static Regexp* NewLiteral(Rune rune, ParseFlags flags);
H A Dparse.cc62 // Pushes the literal rune r onto the stack.
270 // Returns the result of applying the fold f to the rune r.
317 // AddFoldedRange calls itself recursively for each rune in the fold cycle.
333 if (lo < f->lo) { // lo has no fold; next rune with a fold is f->lo
367 // Pushes the literal rune r onto the stack.
547 Rune rune; local
550 rune = r3->rune_;
554 AddLiteral(r3->ccb_, rune, r3->parse_flags_ & Regexp::FoldCase);
735 Rune rune = re->runes_[re->nrunes_ - 1]; local
739 re->rune_ = rune;
1086 Rune rune = re2->rune_; local
[all...]

Completed in 744 milliseconds