/external/chromium_org/third_party/libphonenumber/src/phonenumbers/utf/ |
unilib.cc | 49 char32 rune; local 53 int bytes_consumed = charntorune(&rune, p, end - p); 57 if ((rune == Runeerror && bytes_consumed == 1) || 58 !IsInterchangeValidCodepoint(rune)) {
|
rune.c | 58 * well-formed but incomplete (i.e., to get the whole Rune 59 * we'd need to read past str+length) then we'll set the Rune 66 charntorune(Rune *rune, const char *str, int length) 82 *rune = c; 104 *rune = l; 124 *rune = l; 142 *rune = l; 153 *rune = Bad; 156 *rune = Bad [all...] |
unicodetext.cc | 88 char32 rune; local 90 if (isvalidcharntorune(start, end - start, &rune, &n)) {
|
/external/chromium_org/third_party/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/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/chromium_org/third_party/re2/re2/ |
unicode_casefold.h | 65 // Returns the CaseFold* in the tables that contains rune. 66 // If rune is not in the tables, returns the first CaseFold* after rune. 67 // If rune is larger than any value in the tables, returns NULL. 68 extern CaseFold* LookupCaseFold(CaseFold*, int, Rune rune); 70 // Returns the result of applying the fold f to the rune r. 71 extern Rune ApplyFold(CaseFold *f, Rune r);
|
mimics_pcre.cc | 76 if (re->rune() == '\v')
|
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...] |
regexp.cc | 159 void Regexp::AddRuneToString(Rune r) { 163 runes_ = new Rune[8]; 166 Rune *old = runes_; 167 runes_ = new Rune[nrunes_ * 2]; 283 Regexp* Regexp::NewLiteral(Rune rune, ParseFlags flags) { 285 re->rune_ = rune; 289 Regexp* Regexp::LiteralString(Rune* runes, int nrunes, ParseFlags flags) { 338 return a->rune() == b->rune() & [all...] |
tostring.cc | 25 static void AppendCCRange(string* t, Rune lo, Rune hi); 120 static void AppendLiteral(string *t, Rune r, bool foldcase) { 157 AppendLiteral(t_, re->rune(), re->parse_flags() & Regexp::FoldCase); 295 // Appends a rune for use in a character class to the string t. 296 static void AppendCCChar(string* t, Rune r) { 331 static void AppendCCRange(string* t, Rune lo, Rune hi) {
|
prefilter.cc | 171 static Rune ToLowerRune(Rune r) { 184 static Rune ToLowerRuneLatin1(Rune r) { 215 static Info* Literal(Rune r); 216 static Info* LiteralLatin1(Rune r); 394 static string RuneToString(Rune r) { 400 static string RuneToStringLatin1(Rune r) { 405 // Constructs Info for literal rune. 406 Prefilter::Info* Prefilter::Info::Literal(Rune r) [all...] |
/external/regex-re2/re2/ |
unicode_casefold.h | 65 // Returns the CaseFold* in the tables that contains rune. 66 // If rune is not in the tables, returns the first CaseFold* after rune. 67 // If rune is larger than any value in the tables, returns NULL. 68 extern CaseFold* LookupCaseFold(CaseFold*, int, Rune rune); 70 // Returns the result of applying the fold f to the rune r. 71 extern Rune ApplyFold(CaseFold *f, Rune r);
|
mimics_pcre.cc | 76 if (re->rune() == '\v')
|
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...] |
regexp.cc | 159 void Regexp::AddRuneToString(Rune r) { 163 runes_ = new Rune[8]; 166 Rune *old = runes_; 167 runes_ = new Rune[nrunes_ * 2]; 283 Regexp* Regexp::NewLiteral(Rune rune, ParseFlags flags) { 285 re->rune_ = rune; 289 Regexp* Regexp::LiteralString(Rune* runes, int nrunes, ParseFlags flags) { 338 return a->rune() == b->rune() & [all...] |
tostring.cc | 25 static void AppendCCRange(string* t, Rune lo, Rune hi); 120 static void AppendLiteral(string *t, Rune r, bool foldcase) { 157 AppendLiteral(t_, re->rune(), re->parse_flags() & Regexp::FoldCase); 295 // Appends a rune for use in a character class to the string t. 296 static void AppendCCChar(string* t, Rune r) { 331 static void AppendCCRange(string* t, Rune lo, Rune hi) {
|
/external/chromium_org/third_party/re2/re2/testing/ |
dump.cc | 74 Rune r = re->rune(); 80 Rune r = re->runes()[i]; 98 Rune r = re->rune(); 106 Rune r = re->runes()[i];
|
/external/regex-re2/re2/testing/ |
dump.cc | 74 Rune r = re->rune(); 80 Rune r = re->runes()[i]; 98 Rune r = re->rune(); 106 Rune r = re->runes()[i];
|
/external/regex-re2/ |
Android.mk | 13 util/rune.cc \
|
/external/chromium_org/third_party/protobuf/src/google/protobuf/stubs/ |
strutil.cc | 367 char32 rune = 0; 371 rune = (rune << 4) + hex_digit_to_int(*++p); // Advance p. 379 d += runetochar(d, &rune); 384 char32 rune = 0; 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/protobuf/src/google/protobuf/stubs/ |
strutil.cc | 329 char32 rune = 0; 333 rune = (rune << 4) + hex_digit_to_int(*++p); // Advance p. 341 d += runetochar(d, &rune); 346 char32 rune = 0; 350 // Don't change rune until we're sure this 352 char32 newrune = (rune << 4) + hex_digit_to_int(*++p); 360 rune = newrune; 369 d += runetochar(d, &rune); [all...] |
/external/chromium_org/third_party/re2/ |
re2.target.darwin-arm.mk | 47 third_party/re2/util/rune.cc \
|
re2.target.darwin-mips.mk | 47 third_party/re2/util/rune.cc \
|