| /bootable/recovery/otautil/ |
| SysUtil.h | 34 size_t ranges() const { function in class:MemMapping
|
| /bootable/recovery/tests/unit/ |
| rangeset_test.cpp | 99 std::vector<Range> ranges; local
101 ranges.push_back(range);
103 ASSERT_EQ((std::vector<Range>{ Range{ 1, 5 }, Range{ 8, 10 } }), ranges);
105 ranges.clear();
109 ranges.push_back(*it);
111 ASSERT_EQ((std::vector<Range>{ Range{ 8, 10 }, Range{ 1, 5 } }), ranges);
|
| /external/compiler-rt/test/msan/ |
| ifaddrs.cc | 22 ranges.push_back(std::make_pair((void *)addr, (size_t)size)); \
38 std::vector<std::pair<void *, size_t> > ranges; local
51 for (int i = 0; i < ranges.size(); i++)
52 assert(0 == __msan_test_shadow(ranges[i].first, ranges[i].second));
|
| /external/syslinux/memdisk/ |
| e820func.c | 29 struct e820range ranges[MAXRANGES]; variable in typeref:struct:e820range
34 memset(ranges, 0, sizeof(ranges));
36 ranges[1].type = -1U;
44 ranges[i] = ranges[i - 1];
46 ranges[where].start = start;
47 ranges[where].type = type;
50 ranges[nranges].start = 0ULL;
51 ranges[nranges].type = -1U
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| RangeDateRule.java | 33 // public RangeDateRule(Range[] ranges)
35 // for (int i = 0; i < ranges.length; i++) {
36 // this.ranges.addElement(ranges[i]);
53 ranges.add(new Range(start, rule));
64 if (index == ranges.size()) {
130 * returns an index >= ranges.size() if there is none
133 int lastIndex = ranges.size();
135 for (int i = 0; i < ranges.size(); i++) {
136 Range r = ranges.get(i)
150 List<Range> ranges = new ArrayList<Range>(2); field in class:RangeDateRule
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| RangeDateRule.java | 33 // public RangeDateRule(Range[] ranges)
35 // for (int i = 0; i < ranges.length; i++) {
36 // this.ranges.addElement(ranges[i]);
55 ranges.add(new Range(start, rule));
67 if (index == ranges.size()) {
136 * returns an index >= ranges.size() if there is none
139 int lastIndex = ranges.size();
141 for (int i = 0; i < ranges.size(); i++) {
142 Range r = ranges.get(i)
156 List<Range> ranges = new ArrayList<Range>(2); field in class:RangeDateRule
[all...] |
| /art/compiler/optimizing/ |
| live_interval_test.cc | 30 static constexpr size_t ranges[][2] = {{0, 42}}; local
31 LiveInterval* interval = BuildInterval(ranges, arraysize(ranges), &allocator);
36 static constexpr size_t ranges[][2] = {{4, 12}, {14, 16}}; local
37 LiveInterval* interval = BuildInterval(ranges, arraysize(ranges), &allocator);
47 static constexpr size_t ranges[][2] = {{0, 42}}; local
48 LiveInterval* interval = BuildInterval(ranges, arraysize(ranges), &allocator);
57 static constexpr size_t ranges[][2] = {{4, 12}, {14, 16}} local
75 static constexpr size_t ranges[][2] = {{0, 42}}; local
85 static constexpr size_t ranges[][2] = {{4, 12}, {14, 16}}; local
196 static constexpr size_t ranges[][2] = {{0, 4}}; local
207 static constexpr size_t ranges[][2] = {{0, 4}}; local
218 static constexpr size_t ranges[][2] = {{0, 4}, {8, 12}}; local
229 static constexpr size_t ranges[][2] = {{0, 4}, {8, 12}}; local
240 static constexpr size_t ranges[][2] = {{0, 4}, {8, 12}}; local
251 static constexpr size_t ranges[][2] = {{0, 4}, {6, 10}}; local
262 static constexpr size_t ranges[][2] = {{0, 4}, {6, 10}}; local
273 static constexpr size_t ranges[][2] = {{0, 4}}; local
287 static constexpr size_t ranges[][2] = {{0, 4}}; local
298 static constexpr size_t ranges[][2] = {{2, 4}}; local
309 static constexpr size_t ranges[][2] = {{2, 4}, {8, 10}}; local
320 static constexpr size_t ranges[][2] = {{2, 4}, {10, 12}}; local
[all...] |
| /external/google-benchmark/test/ |
| multiple_ranges_test.cc | 30 std::vector<int> ranges = {state.range(0), state.range(1), state.range(2)}; local
32 assert(expectedValues.find(ranges) != expectedValues.end());
34 actualValues.insert(ranges);
56 ->Ranges({{1, 2}, {3, 7}, {5, 15}})
66 BENCHMARK(BM_CheckDefaultArgument)->Ranges({{1, 5}, {6, 10}});
72 BENCHMARK(BM_MultipleRanges)->Ranges({{5, 5}, {6, 6}});
|
| /external/icu/icu4c/source/i18n/ |
| collationweights.h | 56 * what ranges to use for a given number of weights between (excluding)
59 * @param lowerLimit A collation element weight; the ranges will be filled to cover
61 * @param upperLimit A collation element weight; the ranges will be filled to cover
70 * Given a set of ranges calculated by allocWeights(),
72 * The ranges are modified to keep the current iteration state.
74 * @return The next weight in the ranges, or 0xffffffff if there is none left.
95 * possible ranges of weights between the two limits, excluding them.
96 * For weights with up to 4 bytes there are up to 2*4-1=7 ranges.
105 WeightRange ranges[7]; member in class:CollationWeights
|
| collationsets.h | 134 UnicodeSet ranges; member in class:ContractionsAndExpansions
|
| /external/libchrome/base/metrics/ |
| histogram_base_unittest.cc | 118 std::vector<HistogramBase::Sample> ranges; local
119 ranges.push_back(13);
120 ranges.push_back(5);
121 ranges.push_back(9);
124 "TestHistogram", ranges, HistogramBase::kIPCSerializationSourceFlag);
170 std::vector<HistogramBase::Sample> ranges; local
171 ranges.push_back(1);
172 ranges.push_back(2);
173 ranges.push_back(4);
174 ranges.push_back(8)
[all...] |
| histogram_snapshot_manager.cc | 50 const BucketRanges* ranges = local
53 for (size_t i = 0; i < ranges->size(); ++i)
54 ranges_copy.push_back(ranges->range(i));
|
| /external/libcxx/utils/google-benchmark/test/ |
| multiple_ranges_test.cc | 30 std::vector<int> ranges = {state.range(0), state.range(1), state.range(2)}; local
32 assert(expectedValues.find(ranges) != expectedValues.end());
34 actualValues.insert(ranges);
56 ->Ranges({{1, 2}, {3, 7}, {5, 15}})
66 BENCHMARK(BM_CheckDefaultArgument)->Ranges({{1, 5}, {6, 10}});
72 BENCHMARK(BM_MultipleRanges)->Ranges({{5, 5}, {6, 6}});
|
| /external/libmojo/base/android/library_loader/ |
| library_prefetcher_unittest.cc | 72 std::vector<NativeLibraryPrefetcher::AddressRange> ranges; local
74 &ranges);
75 EXPECT_EQ(ranges.size(), 2U);
76 EXPECT_EQ(ranges[0].first, 0x1U);
77 EXPECT_EQ(ranges[0].second, 0x2U);
78 EXPECT_EQ(ranges[1].first, 0x3U);
79 EXPECT_EQ(ranges[1].second, 0x4U);
91 std::vector<NativeLibraryPrefetcher::AddressRange> ranges; local
93 &ranges);
94 EXPECT_EQ(ranges.size(), 1U)
105 std::vector<NativeLibraryPrefetcher::AddressRange> ranges = { local
132 std::vector<NativeLibraryPrefetcher::AddressRange> ranges = { local
[all...] |
| /frameworks/base/core/jni/ |
| android_view_InputDevice.cpp | 71 const Vector<InputDeviceInfo::MotionRange>& ranges = deviceInfo.getMotionRanges(); local
72 for (size_t i = 0; i < ranges.size(); i++) {
73 const InputDeviceInfo::MotionRange& range = ranges.itemAt(i);
|
| /frameworks/base/services/core/jni/ |
| com_android_server_ConsumerIrService.cpp | 58 hidl_vec<ConsumerIrFreqRange> ranges; local
62 ranges = vec;
70 len = ranges.size();
79 arr[i*2] = static_cast<jint>(ranges[i].min);
80 arr[i*2+1] = static_cast<jint>(ranges[i].max);
|
| /hardware/interfaces/ir/1.0/vts/functional/ |
| VtsHalIrV1_0TargetTest.cpp | 49 hidl_vec<ConsumerIrFreqRange> ranges; local
51 ranges = v;
58 if (ranges.size() > 0) {
63 for (auto range = ranges.begin(); range != ranges.end(); range++) {
|
| /prebuilts/go/darwin-x86/src/cmd/trace/ |
| main.go | 140 ranges = splitTrace(data)
153 var ranges []Range var
183 if err := templMain.Execute(w, ranges); err != nil {
|
| /prebuilts/go/linux-x86/src/cmd/trace/ |
| main.go | 140 ranges = splitTrace(data)
153 var ranges []Range var
183 if err := templMain.Execute(w, ranges); err != nil {
|
| /external/easymock/src/org/easymock/internal/ |
| Results.java | 29 private final LinkedList<Range> ranges = new LinkedList<Range>();
field in class:Results
34 if (!ranges.isEmpty()) {
35 Range lastRange = ranges.getLast();
41 ranges.add(range);
47 for (int i = 0; i < ranges.size(); i++) {
48 Range interval = ranges.get(i);
74 for (Range interval : ranges) {
|
| /system/update_engine/payload_generator/ |
| extent_ranges_unittest.cc | 34 void ExpectRangeEq(const ExtentRanges& ranges,
42 EXPECT_EQ(blocks, ranges.blocks()) << "line: " << line;
44 const ExtentRanges::ExtentSet& result = ranges.extent_set();
54 #define EXPECT_RANGE_EQ(ranges, var) \
56 ExpectRangeEq(ranges, var, arraysize(var), __LINE__); \
141 ExtentRanges ranges; local
145 ExpectRangeEq(ranges, expected, 0, __LINE__);
147 ranges.SubtractBlock(2);
151 ExpectRangeEq(ranges, expected, 0, __LINE__);
154 ranges.AddBlock(0)
241 ExtentRanges ranges; local
272 ExtentRanges ranges; local
291 ExtentRanges ranges; local
293 FilterExtentRanges(vector<Extent>(), ranges)); local
311 ExtentRanges ranges; local
334 ExtentRanges ranges; local
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| StringRange.java | 92 // TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from there.
94 Relation<Integer,Ranges> lengthToArrays = Relation.of(new TreeMap<Integer,Set<Ranges>>(), TreeSet.class);
96 Ranges item = new Ranges(s);
100 for (Entry<Integer, Set<Ranges>> entry : lengthToArrays.keyValuesSet()) {
101 LinkedList<Ranges> compacted = compact(entry.getKey(), entry.getValue());
102 for (Ranges ranges : compacted) {
103 adder.add(ranges.start(), ranges.end(shorterPairs))
120 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); local
168 private final Range[] ranges; field in class:StringRange.Ranges
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| StringRange.java | 88 // TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from there.
90 Relation<Integer,Ranges> lengthToArrays = Relation.of(new TreeMap<Integer,Set<Ranges>>(), TreeSet.class);
92 Ranges item = new Ranges(s);
96 for (Entry<Integer, Set<Ranges>> entry : lengthToArrays.keyValuesSet()) {
97 LinkedList<Ranges> compacted = compact(entry.getKey(), entry.getValue());
98 for (Ranges ranges : compacted) {
99 adder.add(ranges.start(), ranges.end(shorterPairs))
116 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); local
164 private final Range[] ranges; field in class:StringRange.Ranges
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| ContractionsAndExpansions.java | 36 private UnicodeSet ranges; field in class:ContractionsAndExpansions
88 // checkTailored > 0: Exclude tailored ranges from the base data enumeration.
94 if (cne.ranges == null) {
95 cne.ranges = new UnicodeSet();
97 cne.ranges.set(start, end).removeAll(cne.tailored);
98 int count = cne.ranges.getRangeCount();
100 cne.handleCE32(cne.ranges.getRangeStart(i), cne.ranges.getRangeEnd(i), ce32);
|
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| ContractionsAndExpansions.java | 32 private UnicodeSet ranges; field in class:ContractionsAndExpansions
84 // checkTailored > 0: Exclude tailored ranges from the base data enumeration.
90 if (cne.ranges == null) {
91 cne.ranges = new UnicodeSet();
93 cne.ranges.set(start, end).removeAll(cne.tailored);
94 int count = cne.ranges.getRangeCount();
96 cne.handleCE32(cne.ranges.getRangeStart(i), cne.ranges.getRangeEnd(i), ce32);
|
