| /prebuilts/clang/host/linux-x86/clang-4579689/include/clang/Sema/ |
| LoopHint.h | 22 // Source range of the directive.
23 SourceRange Range;
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/clang/Sema/ |
| LoopHint.h | 22 // Source range of the directive.
23 SourceRange Range;
|
| /prebuilts/clang/host/linux-x86/clang-4639204/include/clang/Sema/ |
| LoopHint.h | 22 // Source range of the directive.
23 SourceRange Range;
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/Sema/ |
| LoopHint.h | 22 // Source range of the directive.
23 SourceRange Range;
|
| /prebuilts/go/darwin-x86/src/sync/ |
| map_reference_test.go | 20 Range(func(key, value interface{}) (shouldContinue bool))
65 func (m *RWMutexMap) Range(f func(key, value interface{}) (shouldContinue bool)) {
68 for k := range m.dirty {
73 for _, k := range keys {
135 func (m *DeepCopyMap) Range(f func(key, value interface{}) (shouldContinue bool)) {
137 for k, v := range clean {
147 for k, v := range clean {
|
| /prebuilts/go/linux-x86/src/sync/ |
| map_reference_test.go | 20 Range(func(key, value interface{}) (shouldContinue bool))
65 func (m *RWMutexMap) Range(f func(key, value interface{}) (shouldContinue bool)) {
68 for k := range m.dirty {
73 for _, k := range keys {
135 func (m *DeepCopyMap) Range(f func(key, value interface{}) (shouldContinue bool)) {
137 for k, v := range clean {
147 for k, v := range clean {
|
| /prebuilts/ndk/r16/sources/third_party/googletest/googletest/include/gtest/ |
| gtest-param-test.h | 86 // Range(begin, end [, step]) - Yields values {begin, begin+step,
91 // ValuesIn(begin,end) container, or an iterator range [begin, end).
218 // Range() returns generators providing sequences of values in a range.
221 // Range(start, end)
224 // Range(start, end, step)
228 // * The generated sequences never include end. For example, Range(1, 5)
229 // returns a generator producing a sequence {1, 2, 3, 4}. Range(1, 9, 2)
242 internal::ParamGenerator<T> Range(T start, T end, IncrementT step) {
248 internal::ParamGenerator<T> Range(T start, T end)
[all...] |
| /prebuilts/ndk/r16/sources/third_party/vulkan/src/tests/gtest-1.7.0/include/gtest/ |
| gtest-param-test.h | 86 // Range(begin, end [, step]) - Yields values {begin, begin+step,
91 // ValuesIn(begin,end) container, or an iterator range [begin, end).
218 // Range() returns generators providing sequences of values in a range.
221 // Range(start, end)
224 // Range(start, end, step)
228 // * The generated sequences never include end. For example, Range(1, 5)
229 // returns a generator producing a sequence {1, 2, 3, 4}. Range(1, 9, 2)
242 internal::ParamGenerator<T> Range(T start, T end, IncrementT step) {
248 internal::ParamGenerator<T> Range(T start, T end)
[all...] |
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| ContiguousSetTest.java | 61 ContiguousSet.create(Range.closed(1, 3), integers()),
62 ContiguousSet.create(Range.closedOpen(1, 4), integers()),
63 ContiguousSet.create(Range.openClosed(0, 3), integers()),
64 ContiguousSet.create(Range.open(0, 4), integers()),
65 ContiguousSet.create(Range.closed(1, 3), NOT_EQUAL_TO_INTEGERS),
66 ContiguousSet.create(Range.closedOpen(1, 4), NOT_EQUAL_TO_INTEGERS),
67 ContiguousSet.create(Range.openClosed(0, 3), NOT_EQUAL_TO_INTEGERS),
68 ContiguousSet.create(Range.open(0, 4), NOT_EQUAL_TO_INTEGERS),
73 ContiguousSet.create(Range.closed(Integer.MIN_VALUE, Integer.MAX_VALUE), integers()),
74 ContiguousSet.create(Range.<Integer>all(), integers()))
84 Range<Integer> range = Range.lessThan(0); local
92 Range<Integer> range = Range.greaterThan(0); local
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| 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...] |
| ContiguousSetTest.java | 78 ContiguousSet.create(Range.closed(1, 3), integers()),
79 ContiguousSet.create(Range.closedOpen(1, 4), integers()),
80 ContiguousSet.create(Range.openClosed(0, 3), integers()),
81 ContiguousSet.create(Range.open(0, 4), integers()),
82 ContiguousSet.create(Range.closed(1, 3), NOT_EQUAL_TO_INTEGERS),
83 ContiguousSet.create(Range.closedOpen(1, 4), NOT_EQUAL_TO_INTEGERS),
84 ContiguousSet.create(Range.openClosed(0, 3), NOT_EQUAL_TO_INTEGERS),
85 ContiguousSet.create(Range.open(0, 4), NOT_EQUAL_TO_INTEGERS),
90 ContiguousSet.create(Range.closed(Integer.MIN_VALUE, Integer.MAX_VALUE), integers()),
91 ContiguousSet.create(Range.<Integer>all(), integers()))
122 Range<Integer> range = Range.lessThan(0); local
130 Range<Integer> range = Range.greaterThan(0); local
[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...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/ |
| FastQueue.cs | 63 public virtual int Range {
82 if (absIndex > Range)
83 Range = absIndex;
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Misc/ |
| FastQueue.cs | 67 public virtual int Range
89 if (absIndex > Range)
90 Range = absIndex;
|
| /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/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) {
|
| /external/google-breakpad/src/processor/ |
| range_map.h | 30 // range_map.h: Range maps.
32 // A range map associates a range of addresses with a specific object. This
34 // address space. The range map makes it simple to determine which object is
36 // range associated with an object.
57 // Inserts a range into the map. Returns false for a parameter error,
58 // or if the location of the range would conflict with a range already
64 // Locates the range encompassing the supplied address. If there is
65 // no such range, returns false. entry_base and entry_size, if non-NULL
[all...] |
| static_range_map.h | 55 // Locates the range encompassing the supplied address. If there is
56 // no such range, returns false. entry_base and entry_size, if non-NULL,
57 // are set to the base and size of the entry's range.
61 // Locates the range encompassing the supplied address, if one exists.
62 // If no range encompasses the supplied address, locates the nearest range
64 // if no range meets these criteria. entry_base and entry_size, if
65 // non-NULL, are set to the base and size of the entry's range.
71 // occupy, locates the range at the index specified by index. Returns
74 // range
[all...] |
| /external/libchrome/base/trace_event/ |
| category_registry.h | 30 class Range {
32 Range(TraceCategory* begin, TraceCategory* end) : begin_(begin), end_(end) {
87 static Range GetAllCategories();
|
| /external/swiftshader/third_party/subzero/src/ |
| IceSwitchLowering.cpp | 67 const uint64_t Range = MaxValue - MinValue;
70 if (NumCases * 2 <= Range)
73 if (Range == UINT64_MAX)
75 const uint64_t TotalRange = Range + 1;
|
| /frameworks/native/libs/vr/libdvrcommon/include/private/dvr/ |
| range.h | 11 // Container of two points that define a 2D range.
13 struct Range {
14 // Construct an uninitialized Range.
15 Range() {}
16 Range(Eigen::Vector<T, d> p1, Eigen::Vector<T, d> p2) : p1(p1), p2(p2) {}
18 static Range<T, d> FromSize(Eigen::Vector<T, d> p1,
20 return Range<T, d>(p1, p1 + size);
23 bool operator==(const Range<T, d>& rhs) const {
37 typedef Range<int, 2> Range2i;
38 typedef Range<float, 2> Range2f
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/DebugInfo/DWARF/ |
| DWARFDebugAranges.h | 35 struct Range {
36 explicit Range(uint64_t LowPC = -1ULL, uint64_t HighPC = -1ULL,
57 bool operator<(const Range &other) const {
61 uint64_t LowPC; /// Start of address range.
62 uint32_t Length; /// End of address range (not including this address).
79 using RangeColl = std::vector<Range>;
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/DebugInfo/DWARF/ |
| DWARFDebugAranges.h | 35 struct Range {
36 explicit Range(uint64_t LowPC = -1ULL, uint64_t HighPC = -1ULL,
57 bool operator<(const Range &other) const {
61 uint64_t LowPC; /// Start of address range.
62 uint32_t Length; /// End of address range (not including this address).
79 using RangeColl = std::vector<Range>;
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/DebugInfo/DWARF/ |
| DWARFDebugAranges.h | 35 struct Range {
36 explicit Range(uint64_t LowPC = -1ULL, uint64_t HighPC = -1ULL,
57 bool operator<(const Range &other) const {
61 uint64_t LowPC; /// Start of address range.
62 uint32_t Length; /// End of address range (not including this address).
79 using RangeColl = std::vector<Range>;
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/DebugInfo/DWARF/ |
| DWARFDebugAranges.h | 35 struct Range {
36 explicit Range(uint64_t LowPC = -1ULL, uint64_t HighPC = -1ULL,
57 bool operator<(const Range &other) const {
61 uint64_t LowPC; /// Start of address range.
62 uint32_t Length; /// End of address range (not including this address).
79 using RangeColl = std::vector<Range>;
|
