HomeSort by relevance Sort by last modified time
    Searched defs:rune (Results 1 - 10 of 10) sorted by null

  /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/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)) {
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/
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...]
  /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...]

Completed in 479 milliseconds