/external/regex-re2/re2/ |
regexp.h | 602 uint32 lower_; // bitmap of a-z member in class:re2::CharClassBuilder
|
/art/compiler/optimizing/ |
bounds_check_elimination.cc | 291 : allocator_(allocator), lower_(lower), upper_(upper) {} 301 ValueBound GetLower() const { return lower_; } 304 bool IsConstantValueRange() { return lower_.IsConstant() && upper_.IsConstant(); } 312 return lower_.GreaterThanOrEqualTo(other_range->lower_) && 330 ValueBound::NarrowLowerBound(lower_, range->lower_), 337 ValueBound lower = lower_.Add(constant, &overflow, &underflow); 354 const ValueBound lower_; // inclusive member in class:art::ValueRange [all...] |
/external/webp/src/enc/ |
backward_references_enc.c | 685 // minimal values using intervals, for which lower_ and upper_ bounds are kept. 693 double lower_; member in struct:CostInterval 708 double lower_; // Lower bound of the interval. member in struct:__anon36782 876 if (cur->lower_ < prev->lower_) { 877 prev->lower_ = cur->lower_; [all...] |
/external/v8/src/crankshaft/ |
hydrogen-instructions.h | 194 : lower_(kMinInt), 200 : lower_(lower), 206 int32_t lower() const { return lower_; } 212 return new(zone) Range(lower_, kMaxInt); 215 Range* result = new(zone) Range(lower_, upper_); 222 bool CanBeZero() const { return upper_ >= 0 && lower_ <= 0; } 223 bool CanBeNegative() const { return lower_ < 0; } 225 bool Includes(int value) const { return lower_ <= value && upper_ >= value; } 227 return lower_ == kMinInt && upper_ == kMaxInt && CanBeMinusZero(); 230 return lower_ >= Smi::kMinValue && upper_ <= Smi::kMaxValue 260 int32_t lower_; member in class:v8::internal::final [all...] |