Home | History | Annotate | Download | only in base

Lines Matching defs:After

118 UniquePosition UniquePosition::After(
123 const std::string& after = FindGreaterWithSuffix(
125 return UniquePosition(after + suffix, suffix);
131 const UniquePosition& after,
134 DCHECK(after.IsValid());
135 DCHECK(before.LessThan(after));
139 Uncompress(after.compressed_),
294 const std::string& after,
297 DCHECK_NE(before, after);
298 DCHECK_LT(before, after);
303 if (before < suffix && suffix < after) {
308 for ( ; i < std::min(before.length(), after.length()); ++i) {
310 uint8 b_digit = after[i];
320 if (before.substr(i+1) < suffix && suffix < after.substr(i+1)) {
332 // |after|, no matter what we append afterwards. We then focus on
340 // until |mid| < |after|. Note that this option may not be viable if the
341 // current digit is the last one in |after|, so we skip the option in that
343 if (after.length() > i+1) {
346 mid_b.append(FindSmallerWithSuffix(after.substr(i+1), suffix));
358 DCHECK_EQ(before.substr(0, i), after.substr(0, i));
360 DCHECK_LT(before.length(), after.length());
363 // process of making it < |after|. Appending any digit, regardless of the
367 mid.append(FindSmallerWithSuffix(after.substr(i), suffix));
613 // Does the next digit after a count match the repeated character? Then