| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| StringRange.java | 74 // new possible range
130 static final class Range implements Comparable<Range>{
133 public Range(int min, int max) {
139 return compareTo((Range)obj) == 0;
141 public int compareTo(Range that) {
160 private final Range[] ranges;
163 ranges = new Range[array.length];
165 ranges[i] = new Range(array[i], array[i]);
239 throw new ICUException("Range must have 2 valid strings")
[all...] |
| /external/libchrome/sandbox/linux/bpf_dsl/ |
| policy_compiler.cc | 66 // of returning an exit code in the range of -1..-4096. They do not try to
85 struct PolicyCompiler::Range {
203 // expected number range.
225 // and then verifying that the rest of the number range (both positive and
243 ranges->push_back(Range{old_sysnum, old_node});
248 ranges->push_back(Range{old_sysnum, old_node});
257 CHECK(start < stop) << "Invalid iterator range";
260 // If we have narrowed things down to a single range object, we can
265 // Pick the range object that is located at the mid point of our list.
267 // number in this range object. If our number is lower, it is outside o
[all...] |
| /external/libgdx/gdx/src/com/badlogic/gdx/utils/compression/rangecoder/ |
| Encoder.java | 31 int Range;
48 Range = -1;
79 Range >>>= 1;
80 if (((v >>> i) & 1) == 1) Low += Range;
81 if ((Range & Encoder.kTopMask) == 0) {
82 Range <<= 8;
102 int newBound = (Range >>> kNumBitModelTotalBits) * prob;
104 Range = newBound;
108 Range -= newBound;
111 if ((Range & kTopMask) == 0) {
[all...] |
| /external/llvm/include/llvm/Support/ |
| SourceMgr.h | 199 /// Represents a single fixit, a replacement of one range of text with another.
201 SMRange Range;
208 : Range(Loc, Loc), Text(Insertion.str()) {
214 : Range(R), Text(Replacement.str()) {
219 SMRange getRange() const { return Range; }
222 if (Range.Start.getPointer() != Other.Range.Start.getPointer())
223 return Range.Start.getPointer() < Other.Range.Start.getPointer();
224 if (Range.End.getPointer() != Other.Range.End.getPointer()
[all...] |
| /external/llvm/lib/CodeGen/ |
| CriticalAntiDepBreaker.cpp | 101 assert(Count < InsertPosIndex && "Instruction index out of expected range!");
106 // we don't know the extent of its live-range anymore (now that it
191 // If an alias of the reg is used during the live range, give up.
627 Range = RegRefs.equal_range(AntiDepReg);
628 if (unsigned NewReg = findSuitableFreeRegister(Range.first, Range.second,
640 Q = Range.first, QE = Range.second; Q != QE; ++Q) {
|
| /external/lzma/C/ |
| Ppmd7.h | 110 UInt32 Range;
127 UInt32 Range;
|
| /external/mesa3d/src/gallium/auxiliary/tgsi/ |
| tgsi_parse.h | 68 struct tgsi_declaration_range Range;
|
| /external/webrtc/webrtc/modules/desktop_capture/ |
| desktop_region_unittest.cc | 554 struct Range {
625 struct Range {
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/plat-mac/ |
| aetypes.py | 145 class Range:
146 """An AE range object"""
153 return "Range(%r, %r)" % (self.start, self.stop)
162 return isinstance(x, Range)
399 e.g. by index, by range, by name, or by property specifier
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_bisect.py | 26 class Range(object):
161 # Same as above, but without C-imposed limits on range() parameters
164 data = Range(0, n-1)
|
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_bisect.py | 26 class Range(object):
161 # Same as above, but without C-imposed limits on range() parameters
164 data = Range(0, n-1)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/ |
| aetypes.py | 145 class Range:
146 """An AE range object"""
153 return "Range(%r, %r)" % (self.start, self.stop)
162 return isinstance(x, Range)
399 e.g. by index, by range, by name, or by property specifier
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_bisect.py | 26 class Range(object):
161 # Same as above, but without C-imposed limits on range() parameters
164 data = Range(0, n-1)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_bisect.py | 26 class Range(object):
161 # Same as above, but without C-imposed limits on range() parameters
164 data = Range(0, n-1)
|
| /libcore/ojluni/src/main/java/java/awt/font/ |
| NumericShaper.java | 82 * enum-based ones, such as {@link NumericShaper.Range#ARABIC}.
88 * or creating a {@code Set} with the {@link NumericShaper.Range}
91 * EnumSet.of(NumericShaper.Scirpt.ARABIC, NumericShaper.Range.TAMIL)
96 * Unicode range values are mapped to their counterparts where such
97 * mapping is possible, such as {@code NumericShaper.Range.ARABIC}
98 * from/to {@code NumericShaper.ARABIC}. If any unmappable range
99 * values are specified, such as {@code NumericShaper.Range.BALINESE},
104 * <p>A Unicode range may have more than one set of decimal digits. If
106 * range, one of the sets will take precedence as follows.
110 * <th class="TableHeadingColor">Unicode Range</th
577 Range range = ranges[mid]; local
[all...] |
| /external/clang/include/clang/Basic/ |
| SourceLocation.h | 192 /// \brief A trivial tuple used to represent a source range.
219 /// \brief Represents a character-granular source range.
222 /// of the range, or it can specify the start of the range and the start of the
223 /// last token of the range (a "token range"). In the token range case, the
225 /// range.
227 SourceRange Range;
231 CharSourceRange(SourceRange R, bool ITR) : Range(R), IsTokenRange(ITR) {
[all...] |
| /external/clang/include/clang/Lex/ |
| PreprocessingRecord.h | 78 /// \brief The source range that covers this preprocessed entity.
79 SourceRange Range;
82 PreprocessedEntity(EntityKind Kind, SourceRange Range)
83 : Kind(Kind), Range(Range) { }
91 /// \brief Retrieve the source range that covers this entire preprocessed
93 SourceRange getSourceRange() const LLVM_READONLY { return Range; }
125 PreprocessingDirective(EntityKind Kind, SourceRange Range)
126 : PreprocessedEntity(Kind, Range) { }
142 SourceRange Range)
[all...] |
| /external/clang/lib/Edit/ |
| RewriteObjCFoundationAPI.cpp | 550 // Range of arguments up until and including the last key.
592 // Range of arguments up until and including the last key.
[all...] |
| /external/clang/lib/Lex/ |
| PPMacroExpansion.cpp | 486 Callbacks->MacroExpands(Info.Tok, Info.MD, Info.Range,
610 /// of an initializer list starting a macro argument, the range of those
[all...] |
| /external/clang/lib/Sema/ |
| SemaExceptionSpec.cpp | 71 bool Sema::CheckSpecifiedExceptionType(QualType &T, SourceRange Range) {
101 Diag(Range.getBegin(), diag::err_rref_in_exception_spec)
102 << T << Range;
115 RequireCompleteType(Range.getBegin(), PointeeT,
116 diag::err_incomplete_in_exception_spec, Kind, Range))
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| RangeConstraintManager.cpp | 1 //== RangeConstraintManager.cpp - Manage range constraints.------*- C++ -*--==//
27 /// A Range represents the closed range [from, to]. The caller must
28 /// guarantee that from <= to. Note that Range is immutable, so as not
31 class Range : public std::pair<const llvm::APSInt*,
34 Range(const llvm::APSInt &from, const llvm::APSInt &to)
58 class RangeTrait : public llvm::ImutContainerInfo<Range> {
60 // When comparing if one Range is less than another, we should compare
74 typedef llvm::ImmutableSet<Range, RangeTrait> PrimRangeSet;
88 for (const auto &range : ranges
[all...] |
| /external/compiler-rt/lib/ubsan/ |
| ubsan_diag.h | 102 /// \brief Annotation for a range of locations in a diagnostic.
103 class Range {
108 Range() : Start(), End(), Text() {}
109 Range(MemoryLocation Start, MemoryLocation End, const char *Text)
180 Range Ranges[MaxRanges];
189 Diag &AddRange(Range A) {
210 Diag &operator<<(const Range &R) { return AddRange(R); }
|
| /external/guava/guava/src/com/google/common/collect/ |
| Range.java | 35 * A range (or "interval") defines the <i>boundaries</i> around a contiguous span of values of some
37 * possible to <i>iterate</i> over these contained values. To do so, pass this range instance and
42 * <p>Each end of the range may be bounded or unbounded. If bounded, there is an associated
43 * <i>endpoint</i> value, and the range is considered to be either <i>open</i> (does not include the
46 * ({@code [ ]}) indicates that the range is closed on that side; a parenthesis ({@code ( )}) means
52 * <tr><td>{@code (a..b)} <td>{@code {x | a < x < b}} <td>{@link Range#open open}
53 * <tr><td>{@code [a..b]} <td>{@code {x | a <= x <= b}}<td>{@link Range#closed closed}
54 * <tr><td>{@code (a..b]} <td>{@code {x | a < x <= b}} <td>{@link Range#openClosed openClosed}
55 * <tr><td>{@code [a..b)} <td>{@code {x | a <= x < b}} <td>{@link Range#closedOpen closedOpen}
56 * <tr><td>{@code (a..+?)} <td>{@code {x | x > a}} <td>{@link Range#greaterThan greaterThan
215 public static <C extends Comparable<?>> Range<C> range( method in class:Range
[all...] |
| /external/llvm/lib/CodeGen/MIRParser/ |
| MILexer.cpp | 58 MIToken &MIToken::reset(TokenKind Kind, StringRef Range) {
60 this->Range = Range;
155 auto Range = C;
159 StringRef String = Range.upto(R);
165 Token.reset(MIToken::Error, Range.remaining());
166 return Range;
170 Token.reset(Type, Range.upto(C))
171 .setStringValue(Range.upto(C).drop_front(PrefixLength));
178 auto Range = C
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LowerSwitch.cpp | 43 // Find the first range whose High field is >= R.High,
45 // have a Range that covers R.
214 // Check if the Case Range is perfectly squeezed in between
216 // emitting the code that checks if the value actually falls in the range
241 // This is because it is computed from a case range that is never
242 // the smallest, so there is always a case range that has at least
316 // Make range comparison
346 uint64_t Range = Leaf.High->getSExtValue() -
348 for (uint64_t j = 0; j < Range; ++j) {
395 // A range counts double, since it requires two compares
[all...] |
