| /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...] |
| /external/pdfium/testing/ |
| range_set.h | 26 bool IsEmpty() const { return ranges().empty(); }
37 const RangesContainer& ranges() const { return ranges_; } function in class:RangeSet
|
| range_set.cpp | 19 auto it = ranges().upper_bound(fixed_range);
21 if (it == ranges().begin())
22 return false; // No ranges includes range.first.
47 if (start == end) { // No ranges to merge.
63 for (const auto& it : range_set.ranges())
|
| /external/libchrome/base/metrics/ |
| histogram.cc | 119 BucketRanges* ranges = new BucketRanges(bucket_count_ + 1); local
120 Histogram::InitializeBucketRanges(minimum_, maximum_, ranges);
121 return ranges;
126 virtual std::unique_ptr<HistogramBase> HeapAlloc(const BucketRanges* ranges) {
127 return WrapUnique(new Histogram(name_, minimum_, maximum_, ranges));
278 const BucketRanges* ranges,
284 return WrapUnique(new Histogram(name, minimum, maximum, ranges, counts,
293 // ranges(i) == ranges(i + 1)
301 BucketRanges* ranges) {
363 Sample Histogram::ranges(uint32_t i) const { function in class:base::Histogram
749 BucketRanges* ranges = new BucketRanges(bucket_count_ + 1); variable
941 BucketRanges* ranges = new BucketRanges(3 + 1); variable
1031 std::vector<int> ranges = *custom_ranges_; variable
[all...] |
| 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...] |
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_prim_restart.c | 132 struct range *ranges; member in struct:range_info
146 info->ranges = MALLOC(info->max * sizeof(struct range));
147 if (!info->ranges) {
152 /* grow the ranges[] array */
153 info->ranges = REALLOC(info->ranges,
156 if (!info->ranges) {
164 info->ranges[info->count].start = start;
165 info->ranges[info->count].count = count;
184 struct range_info ranges = {0} local
[all...] |
| /external/syslinux/memdisk/ |
| e820.h | 26 extern struct e820range ranges[];
|
| e820test.c | 41 ranges[i].start,
42 ranges[i + 1].start - ranges[i].start, ranges[i].type);
|
| /frameworks/minikin/include/minikin/ |
| SparseBitSet.h | 38 // Initialize the set to a new value, represented by ranges. For
39 // simplicity, these ranges are arranged as pairs of values,
41 SparseBitSet(const uint32_t* ranges, size_t nRanges) : SparseBitSet() {
42 initFromRanges(ranges, nRanges);
66 void initFromRanges(const uint32_t* ranges, size_t nRanges);
80 static uint32_t calcNumPages(const uint32_t* ranges, size_t nRanges);
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/cris/ |
| range-err-2.s | 1 ; Test error cases for constant ranges.
|
| range-err-3.s | 1 ; Test more error cases for constant ranges.
|
| /external/icu/icu4c/source/tools/toolutil/ |
| denseranges.cpp | 16 * Helper code for finding a small number of dense ranges.
89 * Does it make sense to write 1..capacity ranges?
90 * Returns 0 if not, otherwise the number of ranges.
95 * @param ranges Output ranges array.
96 * @param capacity Maximum number of ranges.
97 * @return Minimum number of ranges (at most capacity) that have the desired density,
103 int32_t ranges[][2], int32_t capacity) {
114 ranges[0][0]=minValue;
115 ranges[0][1]=maxValue
[all...] |
| /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);
|
| /external/guava/guava/src/com/google/common/collect/ |
| ImmutableRangeMap.java | 88 * A builder for immutable range maps. Overlapping ranges are prohibited.
102 * @throws IllegalArgumentException if {@code range} overlaps with any other ranges inserted
115 "Overlapping ranges: range " + range + " overlaps with entry " + entry);
127 * @throws IllegalArgumentException if any of the ranges in {@code rangeMap} overlap with ranges
154 private final ImmutableList<Range<K>> ranges; field in class:ImmutableRangeMap
157 ImmutableRangeMap(ImmutableList<Range<K>> ranges, ImmutableList<V> values) {
158 this.ranges = ranges;
165 int index = SortedLists.binarySearch(ranges, Range.<K>lowerBoundFn()
[all...] |
| /external/icu/icu4c/source/i18n/ |
| collationsettings.cpp | 86 const uint32_t *ranges, int32_t rangesLength,
94 (ranges[0] & 0xffff) == 0 && (ranges[rangesLength - 1] & 0xffff) != 0)) {
103 // Drop ranges before the first split byte. They are reordered by the table.
104 // This then speeds up reordering of the remaining ranges.
107 (ranges[firstSplitByteRangeIndex] & 0xff0000) == 0) {
117 U_ASSERT(table[ranges[firstSplitByteRangeIndex] >> 24] == 0);
118 minHighNoReorder = ranges[rangesLength - 1] & 0xffff0000;
119 reorderRanges = ranges + firstSplitByteRangeIndex;
145 const uint32_t *ranges = reinterpret_cast<uint32_t *>(rangesList.getBuffer()) local
264 const uint32_t *ranges = reorderRanges; local
[all...] |
| collationweights.cpp | 194 /* for uprv_sortArray: sort ranges in weight order */
250 * With the limit lengths of 1..4, there are up to 7 ranges for allocation:
260 * We are now going to calculate up to 7 ranges.
261 * Some of them will typically overlap, so we will then have to merge and eliminate ranges.
313 // These two lower and upper ranges collide.
322 // Intersect these two ranges.
335 // Merge adjacent ranges.
342 // Remove all shorter ranges.
343 // There was no room available for them between the ranges we just merged.
355 /* print ranges */
[all...] |
| /prebuilts/go/darwin-x86/src/net/http/ |
| range_test.go | 62 ranges, err := parseRange(test.s, test.length)
66 if len(ranges) != len(r) {
67 t.Errorf("len(parseRange(%q)) = %d, want %d", test.s, len(ranges), len(r))
71 if ranges[i].start != r[i].start {
72 t.Errorf("parseRange(%q)[%d].start = %d, want %d", test.s, i, ranges[i].start, r[i].start)
74 if ranges[i].length != r[i].length {
75 t.Errorf("parseRange(%q)[%d].length = %d, want %d", test.s, i, ranges[i].length, r[i].length)
|
| /prebuilts/go/linux-x86/src/net/http/ |
| range_test.go | 62 ranges, err := parseRange(test.s, test.length)
66 if len(ranges) != len(r) {
67 t.Errorf("len(parseRange(%q)) = %d, want %d", test.s, len(ranges), len(r))
71 if ranges[i].start != r[i].start {
72 t.Errorf("parseRange(%q)[%d].start = %d, want %d", test.s, i, ranges[i].start, r[i].start)
74 if ranges[i].length != r[i].length {
75 t.Errorf("parseRange(%q)[%d].length = %d, want %d", test.s, i, ranges[i].length, r[i].length)
|
| /external/adhd/cras/src/server/ |
| cras_utf8.c | 87 const u8range_t *ranges; member in struct:utf8seq
142 while (seq->ranges->min != 0) {
143 if (byte >= seq->ranges->min &&
144 byte <= seq->ranges->max) {
151 if (seq->ranges->min == 0) {
158 range = seq->ranges + 1;
|
| /frameworks/minikin/libs/minikin/ |
| SparseBitSet.cpp | 25 uint32_t SparseBitSet::calcNumPages(const uint32_t* ranges, size_t nRanges) {
30 uint32_t start = ranges[i * 2];
31 uint32_t end = ranges[i * 2 + 1];
49 void SparseBitSet::initFromRanges(const uint32_t* ranges, size_t nRanges) {
53 const uint32_t maxVal = ranges[nRanges * 2 - 1];
59 uint32_t nPages = calcNumPages(ranges, nRanges);
65 uint32_t start = ranges[i * 2];
66 uint32_t end = ranges[i * 2 + 1];
|
| /prebuilts/go/darwin-x86/src/debug/dwarf/ |
| entry_test.go | 39 // wantRange maps from a PC to the ranges of the compilation unit
43 ranges [][2]uint64
68 testRanges(t, "testdata/ranges.elf", want)
77 if w.ranges != nil {
86 ranges, err := d.Ranges(entry)
91 if !reflect.DeepEqual(ranges, w.ranges) {
92 t.Errorf("%s: for %#x got %x, expected %x", name, w.pc, ranges, w.ranges)
[all...] |
| /prebuilts/go/linux-x86/src/debug/dwarf/ |
| entry_test.go | 39 // wantRange maps from a PC to the ranges of the compilation unit
43 ranges [][2]uint64
68 testRanges(t, "testdata/ranges.elf", want)
77 if w.ranges != nil {
86 ranges, err := d.Ranges(entry)
91 if !reflect.DeepEqual(ranges, w.ranges) {
92 t.Errorf("%s: for %#x got %x, expected %x", name, w.pc, ranges, w.ranges)
[all...] |
| /bootable/recovery/otautil/include/otautil/ |
| SysUtil.h | 34 size_t ranges() const { function in class:MemMapping
|
| /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/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}});
|
