| /external/guava/guava/src/com/google/common/collect/ |
| 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...] |
| /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/libmojo/ui/gfx/range/ |
| range_f.cc | 5 #include "ui/gfx/range/range_f.h"
17 RangeF RangeF::Intersect(const RangeF& range) const {
18 float min = std::max(GetMin(), range.GetMin());
19 float max = std::min(GetMax(), range.GetMax());
27 RangeF RangeF::Intersect(const Range& range) const {
28 RangeF range_f(range.start(), range.end());
32 Range RangeF::Floor() const {
35 return Range(start, end)
[all...] |
| range_win_unittest.cc | 6 #include "ui/gfx/range/range.h"
10 gfx::Range r(cr, 50);
20 gfx::Range r(cr, 40);
30 gfx::Range r(cr, 20);
39 gfx::Range r(10, 30);
46 gfx::Range r(20, 10);
54 gfx::Range r(cr, 30);
59 gfx::Range r(gfx::Range::InvalidRange())
[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/perf_data_converter/src/quipper/ |
| address_mapper_test.cc | 19 struct Range {
25 Range() : addr(0), size(0), id(0), base_offset(0) {}
27 Range(uint64_t addr, uint64_t size, uint64_t id, uint64_t base_offset)
37 const Range kMapRanges[] = {
38 Range(0xff000000, 0x100000, 0xdeadbeef, 0),
39 Range(0x00a00000, 0x10000, 0xcafebabe, 0),
40 Range(0x0c000000, 0x1000000, 0x900df00d, 0),
41 Range(0x00001000, 0x30000, 0x9000091e, 0),
51 // Number of regularly-spaced intervals within a mapped range to test.
56 uint64_t GetMappedAddressFromRanges(const Range* ranges
63 const Range& range = ranges[i]; local
[all...] |
| /external/clang/lib/Format/ |
| SortJavaScriptImports.h | 30 ArrayRef<tooling::Range> Ranges,
|
| /external/libmojo/ui/gfx/range/mojo/ |
| range_struct_traits.h | 8 #include "ui/gfx/range/mojo/range.mojom-shared.h"
9 #include "ui/gfx/range/range.h"
10 #include "ui/gfx/range/range_f.h"
15 struct StructTraits<gfx::mojom::RangeDataView, gfx::Range> {
16 static uint32_t start(const gfx::Range& r) { return r.start(); }
17 static uint32_t end(const gfx::Range& r) { return r.end(); }
18 static bool Read(gfx::mojom::RangeDataView data, gfx::Range* out) {
|
| /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...] |
| /device/google/cuttlefish_common/common/vsoc/shm/ |
| circqueue.h | 52 struct Range {
53 // Points to the first bytes that is part of the range
55 // Points to the first byte that is not in the range. This is similar to
62 * Copy bytes from buffer_in into the part of the queue specified by Range.
64 void CopyInRange(const char* buffer_in, const Range& t);
67 * Copy the bytes specified by range to the given buffer. They caller must
68 * ensure that the buffer is large enough to hold the content of the range.
70 void CopyOutRange(const Range& t, char* buffer_out);
82 * Indexes pointing to the reserved space will be placed in range.
89 Range* t, bool non_blocking)
[all...] |
| /frameworks/minikin/tests/unittest/ |
| BidiUtilsTest.cpp | 21 #include "minikin/Range.h"
36 BidiText bidiText(text, Range(0, ltrLength), Bidi::LTR);
39 EXPECT_EQ(Range(0, ltrLength), (*it).range);
45 BidiText bidiText(text, Range(0, ltrLength), Bidi::RTL);
48 EXPECT_EQ(Range(0, ltrLength), (*it).range);
54 BidiText bidiText(text, Range(0, ltrLength), Bidi::DEFAULT_LTR);
57 EXPECT_EQ(Range(0, ltrLength), (*it).range);
[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...] |
| /packages/apps/Launcher3/src_ui_overrides/com/android/launcher3/uioverrides/dynamicui/ |
| ColorExtractionAlgorithm.java | 26 import android.util.Range;
605 new Range<>(0f, 20f) /* H */,
606 new Range<>(0.7f, 1f) /* S */,
607 new Range<>(0.21f, 0.79f)) /* L */,
609 new Range<>(0f, 20f),
610 new Range<>(0.3f, 0.7f),
611 new Range<>(0.355f, 0.653f)),
615 new Range<>(20f, 40f),
616 new Range<>(0.7f, 1f),
617 new Range<>(0.28f, 0.643f))
[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...] |
