/external/libutf/ |
utflen.c | 24 Rune rune; local 34 s += chartorune(&rune, s);
|
utfnlen.c | 24 Rune rune; local 38 s += chartorune(&rune, s);
|
/external/regex-re2/util/ |
rune.cc | 49 chartorune(Rune *rune, const char *str) 60 *rune = c; 77 *rune = l; 92 *rune = l; 107 *rune = l; 120 *rune = Bad; 125 runetochar(char *str, const Rune *rune) 134 c = *rune; 214 Rune rune; local [all...] |
/external/protobuf/src/google/protobuf/stubs/ |
strutil.cc | 367 char32 rune = 0; local 371 rune = (rune << 4) + hex_digit_to_int(*++p); // Advance p. 379 d += runetochar(d, &rune); 384 char32 rune = 0; local 388 // Don't change rune until we're sure this 390 char32 newrune = (rune << 4) + hex_digit_to_int(*++p); 398 rune = newrune; 407 d += runetochar(d, &rune); [all...] |
/external/regex-re2/re2/ |
parse.cc | 62 // Pushes the literal rune r onto the stack. 63 bool PushLiteral(Rune r); 123 bool ParseCCCharacter(StringPiece* s, Rune *rp, 219 Rune r = re->ccb_->begin()->lo; 224 Rune r = re->ccb_->begin()->lo; 243 CaseFold* LookupCaseFold(CaseFold *f, int n, Rune r) { 270 // Returns the result of applying the fold f to the rune r. 271 Rune ApplyFold(CaseFold *f, Rune r) { 296 // Returns the next Rune in r's folding cycle (see unicode_casefold.h) 547 Rune rune; local 735 Rune rune = re->runes_[re->nrunes_ - 1]; local 1086 Rune rune = re2->rune_; local [all...] |
regexp.h | 223 Rune lo; 224 Rune hi; 228 // This lets us look in a set to find the range covering a particular Rune. 250 bool Contains(Rune r); 328 Rune rune() { DCHECK_EQ(op_, kRegexpLiteral); return rune_; } function in class:re2::Regexp 332 Rune* runes() { DCHECK_EQ(op_, kRegexpLiteralString); return runes_; } 393 static Regexp* NewLiteral(Rune rune, ParseFlags flags); 395 static Regexp* LiteralString(Rune* runes, int nrunes, ParseFlags flags) [all...] |