| /external/guava/guava/src/com/google/common/collect/ |
| ImmutableRangeMap.java | 46 ImmutableList.<Range<Comparable<?>>>of(), ImmutableList.of());
49 * Returns an empty immutable range map.
57 * Returns an immutable range map mapping a single range to a single value.
60 Range<K> range, V value) {
61 return new ImmutableRangeMap<K, V>(ImmutableList.of(range), ImmutableList.of(value));
70 Map<Range<K>, ? extends V> map = rangeMap.asMapOfRanges();
71 ImmutableList.Builder<Range<K>> rangesBuilder = new ImmutableList.Builder<Range<K>>(map.size())
170 Range<K> range = ranges.get(index); local
183 Range<K> range = ranges.get(index); local
[all...] |
| RangeSet.java | 25 * A set comprising zero or more {@linkplain Range#isEmpty nonempty},
26 * {@linkplain Range#isConnected(Range) disconnected} ranges of type {@code C}.
28 * <p>Implementations that choose to support the {@link #add(Range)} operation are required to
32 * rangeSet.add(Range.closed(1, 10)); // {[1, 10]}
33 * rangeSet.add(Range.closedOpen(11, 15)); // disconnected range; {[1, 10], [11, 15)}
34 * rangeSet.add(Range.closedOpen(15, 20)); // connected range; {[1, 10], [11, 20)}
35 * rangeSet.add(Range.openClosed(0, 0)); // empty range; {[1, 10], [11, 20)
[all...] |
| 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...] |
| TreeRangeMap.java | 69 extends AbstractMapEntry<Range<K>, V> {
70 private final Range<K> range; field in class:TreeRangeMap.RangeMapEntry
74 this(Range.create(lowerBound, upperBound), value);
77 RangeMapEntry(Range<K> range, V value) {
78 this.range = range;
83 public Range<K> getKey() {
84 return range;
221 Range<?> range = (Range<?>) key; local
[all...] |
| ImmutableRangeSet.java | 47 new ImmutableRangeSet<Comparable<?>>(ImmutableList.<Range<Comparable<?>>>of());
50 new ImmutableRangeSet<Comparable<?>>(ImmutableList.of(Range.<Comparable<?>>all()));
53 * Returns an empty immutable range set.
61 * Returns an immutable range set containing the single range {@link Range#all()}.
69 * Returns an immutable range set containing the specified single range. If {@link Range#isEmpty()
70 * range.isEmpty()}, this is equivalent to {@link ImmutableRangeSet#of()}
134 Range<C> range = ranges.get(index); local
[all...] |
| /external/clang/unittests/Tooling/ |
| RefactoringTest.cpp | 155 // location being in the range ]a, z[.
439 TEST(Range, overlaps) {
440 EXPECT_TRUE(Range(10, 10).overlapsWith(Range(0, 11)));
441 EXPECT_TRUE(Range(0, 11).overlapsWith(Range(10, 10)));
442 EXPECT_FALSE(Range(10, 10).overlapsWith(Range(0, 10)));
443 EXPECT_FALSE(Range(0, 10).overlapsWith(Range(10, 10)))
[all...] |
| /frameworks/base/core/java/android/util/ |
| Range.java | 24 * Immutable class for describing the range of two numeric values.
26 * A range (or "interval") defines the inclusive boundaries around a contiguous span of
31 * All ranges are bounded, and the left side of the range is always {@code >=}
32 * the right side of the range.
36 * stored must also be immutable. If mutable objects are stored here, then the range
39 public final class Range<T extends Comparable<? super T>> {
41 * Create a new immutable range.
45 * is the range is bounded. {@code lower} must be {@link Comparable#compareTo lesser or equal}
54 public Range(final T lower, final T upper) {
64 * Create a new immutable range, with the argument types inferred
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| AbstractRangeSetTest.java | 41 List<Range<C>> asRanges = ImmutableList.copyOf(rangeSet.asRanges());
45 Range<C> range1 = asRanges.get(i);
46 Range<C> range2 = asRanges.get(i + 1);
51 for (Range<C> range : asRanges) {
52 assertFalse(range.isEmpty());
55 Iterator<Range<C>> itr = rangeSet.asRanges().iterator();
56 Range<C> expectedSpan = null;
65 Range<C> span = rangeSet.span();
|
| ImmutableRangeMapTest.java | 34 private static final ImmutableList<Range<Integer>> RANGES;
38 ImmutableList.Builder<Range<Integer>> builder = ImmutableList.builder();
40 builder.add(Range.<Integer>all());
45 builder.add(Range.upTo(i, type));
46 builder.add(Range.downTo(i, type));
58 builder.add(Range.range(i, lowerType, j, upperType));
70 builder.put(Range.closedOpen(i, i), 1);
76 builder.put(Range.openClosed(i, i), 1);
84 for (Range<Integer> range1 : RANGES)
[all...] |
| /external/clang/test/SemaCXX/ |
| for-range-no-std.cpp | 12 struct Range {};
13 int begin(Range); // expected-note {{not viable}}
14 int end(Range);
34 for (auto b : T()) {} // expected-error {{invalid range expression of type 'T'}}
37 for (int b : NS::NoADL()) {} // expected-error {{invalid range expression of type 'NS::NoADL'}}
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| RangeDateRule.java | 21 * Implementation of DateRule that takes a range.
32 // Range is a package-private class so this should be package-private too, probably
33 // public RangeDateRule(Range[] ranges)
53 ranges.add(new Range(start, rule));
62 // Find the range that I should look at
69 Range r = rangeAt(index);
70 Range e = rangeAt(index+1);
91 // Find the range that I should look at
95 Range next = rangeAt(index);
99 Range r = next
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| RangeDateRule.java | 20 * Implementation of DateRule that takes a range.
32 // Range is a package-private class so this should be package-private too, probably
33 // public RangeDateRule(Range[] ranges)
55 ranges.add(new Range(start, rule));
65 // Find the range that I should look at
72 Range r = rangeAt(index);
73 Range e = rangeAt(index+1);
95 // Find the range that I should look at
99 Range next = rangeAt(index);
103 Range r = next
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Universal/Network/Mtftp4Dxe/ |
| Mtftp4Support.c | 19 Allocate a MTFTP4 block range, then init it to the range of [Start, End]
22 @param End The last block number in the range
24 @return Pointer to the created block range, NULL if failed to allocate memory.
33 MTFTP4_BLOCK_RANGE *Range;
35 Range = AllocateZeroPool (sizeof (MTFTP4_BLOCK_RANGE));
37 if (Range == NULL) {
41 InitializeListHead (&Range->Link);
42 Range->Start = Start;
43 Range->End = End;
[all...] |
| /external/clang/lib/Format/ |
| SortJavaScriptImports.h | 30 ArrayRef<tooling::Range> Ranges,
|
| /external/lzma/Java/SevenZip/Compression/RangeCoder/ |
| Encoder.java | 15 int Range;
35 Range = -1;
74 Range >>>= 1;
76 Low += Range;
77 if ((Range & Encoder.kTopMask) == 0)
79 Range <<= 8;
105 int newBound = (Range >>> kNumBitModelTotalBits) * prob;
108 Range = newBound;
114 Range -= newBound;
117 if ((Range & kTopMask) == 0)
[all...] |
| /frameworks/base/media/java/android/media/ |
| Utils.java | 28 import android.util.Range;
43 * Sorts distinct (non-intersecting) range array in ascending order.
46 public static <T extends Comparable<? super T>> void sortDistinctRanges(Range<T>[] ranges) {
47 Arrays.sort(ranges, new Comparator<Range<T>>() {
49 public int compare(Range<T> lhs, Range<T> rhs) {
68 Range<T>[] intersectSortedDistinctRanges(Range<T>[] one, Range<T>[] another) {
70 Vector<Range<T>> result = new Vector<Range<T>>()
[all...] |
| /external/clang/include/clang/Tooling/Core/ |
| Replacement.h | 37 /// \brief A source range independent of the \c SourceManager.
38 class Range {
40 Range() : Offset(0), Length(0) {}
41 Range(unsigned Offset, unsigned Length) : Offset(Offset), Length(Length) {}
49 /// \name Range Predicates
51 /// \brief Whether this range overlaps with \p RHS or not.
52 bool overlapsWith(Range RHS) const {
56 /// \brief Whether this range contains \p RHS or not.
57 bool contains(Range RHS) const {
62 /// \brief Whether this range equals to \p RHS or not
[all...] |
| /frameworks/base/core/java/android/hardware/camera2/marshal/impl/ |
| MarshalQueryableRange.java | 22 import android.util.Range;
31 * Marshal {@link Range} to/from any native type
34 implements MarshalQueryable<Range<T>> {
37 private class MarshalerRange extends Marshaler<Range<T>> {
38 private final Class<? super Range<T>> mClass;
39 private final Constructor<Range<T>> mConstructor;
40 /** Marshal the {@code T} inside of {@code Range<T>} */
44 protected MarshalerRange(TypeReference<Range<T>> typeReference,
51 * Lookup the actual type argument, e.g. Range<Integer> --> Integer
58 throw new AssertionError("Raw use of Range is not supported", e)
[all...] |
| /external/swiftshader/third_party/LLVM/lib/DebugInfo/ |
| DWARFDebugAranges.h | 22 struct Range {
23 explicit Range(uint64_t lo = -1ULL, uint64_t hi = -1ULL,
46 static bool SortedOverlapCheck(const Range &curr_range,
47 const Range &next_range, uint32_t n) {
53 bool contains(const Range &range) const {
54 return LoPC <= range.LoPC && range.HiPC() <= HiPC();
58 uint64_t LoPC; // Start of address range
59 uint32_t Length; // End of address range (not including this address
[all...] |
| /external/clang/lib/StaticAnalyzer/Checkers/MPI-Checker/ |
| MPIBugReporter.cpp | 38 SourceRange Range = RequestRegion->sourceRange();
40 if (Range.isValid())
41 Report->addRange(Range);
60 SourceRange Range = RequestRegion->sourceRange();
61 if (Range.isValid())
62 Report->addRange(Range);
81 SourceRange Range = RequestRegion->sourceRange();
82 if (Range.isValid())
83 Report->addRange(Range);
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| MachineLoopRanges.cpp | 50 MachineLoopRange *&Range = Cache[Loop];
51 if (!Range)
52 Range = new MachineLoopRange(Loop, Allocator, *Indexes);
53 return Range;
64 const std::pair<SlotIndex, SlotIndex> &Range = Indexes.getMBBRange(*I);
65 Intervals.insert(Range.first, Range.second, 1u);
66 Area += Range.first.distance(Range.second);
70 /// overlaps - Return true if this loop overlaps the given range of machin
[all...] |
| /external/valgrind/coregrind/ |
| m_rangemap.c | 47 Range;
77 rm->ranges = VG_(newXA)( alloc_fn, cc, free_fn, sizeof(Range) );
78 /* Add the initial range */
79 Range r;
110 Range* rng = VG_(indexXA)(rm->ranges, i);
120 Range* rng = (Range*)VG_(indexXA)(rm->ranges, i);
138 Range* rng = (Range*)VG_(indexXA)(rm->ranges, ix);
151 Range* rng0 = VG_(indexXA)(ranges, i+0)
[all...] |
| /external/clang/include/clang/Rewrite/Core/ |
| HTMLRewrite.h | 29 /// HighlightRange - Highlight a range in the source code with the specified
31 /// start/end tags are placed at the start/end of each line if the range is
36 /// HighlightRange - Highlight a range in the source code with the specified
37 /// start/end tags. The Start/end of the range must be in the same file.
39 /// if the range is multiline.
40 inline void HighlightRange(Rewriter &R, SourceRange Range,
42 HighlightRange(R, Range.getBegin(), Range.getEnd(), StartTag, EndTag);
|
| /external/clang/include/clang/Tooling/ |
| FixIt.h | 30 StringRef getText(SourceRange Range, const ASTContext &Context);
34 inline SourceRange getSourceRange(const SourceRange &Range) { return Range; }
|
| /external/easymock/src/org/easymock/internal/ |
| Range.java | 20 public class Range implements Serializable {
28 public Range(int count) {
32 public Range(int minimum, int maximum) {
|
