| /external/guava/guava/src/com/google/common/collect/ |
| D | ImmutableRangeSet.java | 103 ImmutableRangeSet(ImmutableList<Range<C>> ranges) { in ImmutableRangeSet() argument
104 this.ranges = ranges; in ImmutableRangeSet()
107 private ImmutableRangeSet(ImmutableList<Range<C>> ranges, ImmutableRangeSet<C> complement) { in ImmutableRangeSet() argument
108 this.ranges = ranges; in ImmutableRangeSet()
112 private transient final ImmutableList<Range<C>> ranges; field in ImmutableRangeSet
116 int index = SortedLists.binarySearch(ranges, in encloses()
122 return index != -1 && ranges.get(index).encloses(otherRange); in encloses()
127 int index = SortedLists.binarySearch(ranges, in rangeContaining()
134 Range<C> range = ranges.get(index); in rangeContaining()
142 if (ranges.isEmpty()) { in span()
[all …]
|
| D | ImmutableRangeMap.java | 154 private final ImmutableList<Range<K>> ranges; field in ImmutableRangeMap
157 ImmutableRangeMap(ImmutableList<Range<K>> ranges, ImmutableList<V> values) { in ImmutableRangeMap() argument
158 this.ranges = ranges; in ImmutableRangeMap()
165 int index = SortedLists.binarySearch(ranges, Range.<K>lowerBoundFn(), in get()
170 Range<K> range = ranges.get(index); in get()
178 int index = SortedLists.binarySearch(ranges, Range.<K>lowerBoundFn(), in getEntry()
183 Range<K> range = ranges.get(index); in getEntry()
190 if (ranges.isEmpty()) { in span()
193 Range<K> firstRange = ranges.get(0); in span()
194 Range<K> lastRange = ranges.get(ranges.size() - 1); in span()
[all …]
|
| /external/libchrome/base/metrics/ |
| D | bucket_ranges_unittest.cc | 15 BucketRanges ranges(5); in TEST() local
16 ASSERT_EQ(5u, ranges.size()); in TEST()
17 ASSERT_EQ(4u, ranges.bucket_count()); in TEST()
20 EXPECT_EQ(0, ranges.range(i)); in TEST()
22 EXPECT_EQ(0u, ranges.checksum()); in TEST()
24 ranges.set_range(3, 100); in TEST()
25 EXPECT_EQ(100, ranges.range(3)); in TEST()
61 BucketRanges ranges(3); in TEST() local
62 ranges.set_range(0, 0); in TEST()
63 ranges.set_range(1, 1); in TEST()
[all …]
|
| D | sample_vector_unittest.cc | 22 BucketRanges ranges(3); in TEST() local
23 ranges.set_range(0, 1); in TEST()
24 ranges.set_range(1, 5); in TEST()
25 ranges.set_range(2, 10); in TEST()
26 SampleVector samples(1, &ranges); in TEST()
49 BucketRanges ranges(5); in TEST() local
50 ranges.set_range(0, 0); in TEST()
51 ranges.set_range(1, 1); in TEST()
52 ranges.set_range(2, 2); in TEST()
53 ranges.set_range(3, 3); in TEST()
[all …]
|
| D | histogram.cc | 99 BucketRanges* ranges = new BucketRanges(bucket_count + 1); in FactoryGet() local
100 InitializeBucketRanges(minimum, maximum, ranges); in FactoryGet()
102 StatisticsRecorder::RegisterOrDeleteDuplicateRanges(ranges); in FactoryGet()
165 BucketRanges* ranges) { in InitializeBucketRanges() argument
171 ranges->set_range(bucket_index, current); in InitializeBucketRanges()
172 size_t bucket_count = ranges->bucket_count(); in InitializeBucketRanges()
186 ranges->set_range(bucket_index, current); in InitializeBucketRanges()
188 ranges->set_range(ranges->bucket_count(), HistogramBase::kSampleType_MAX); in InitializeBucketRanges()
189 ranges->ResetChecksum(); in InitializeBucketRanges()
199 int new_range = ranges(index); in FindCorruption()
[all …]
|
| D | histogram_unittest.cc | 89 BucketRanges ranges(9); in TEST_F() local
90 Histogram::InitializeBucketRanges(1, 64, &ranges); in TEST_F()
91 EXPECT_EQ(0, ranges.range(0)); in TEST_F()
94 EXPECT_EQ(power_of_2, ranges.range(i)); in TEST_F()
97 EXPECT_EQ(HistogramBase::kSampleType_MAX, ranges.range(8)); in TEST_F()
102 EXPECT_TRUE(ranges.Equals(histogram->bucket_ranges())); in TEST_F()
133 BucketRanges ranges(9); in TEST_F() local
134 LinearHistogram::InitializeBucketRanges(1, 7, &ranges); in TEST_F()
137 EXPECT_EQ(i, ranges.range(i)); in TEST_F()
138 EXPECT_EQ(HistogramBase::kSampleType_MAX, ranges.range(8)); in TEST_F()
[all …]
|
| /external/valgrind/coregrind/ |
| D | m_rangemap.c | 54 XArray* ranges; member
77 rm->ranges = VG_(newXA)( alloc_fn, cc, free_fn, sizeof(Range) ); in VG_()
83 Word i = VG_(addToXA)(rm->ranges, &r); in VG_()
85 vg_assert(VG_(sizeXA)(rm->ranges) == 1); in VG_()
94 vg_assert(rm->ranges); in VG_()
95 VG_(deleteXA)(rm->ranges); in VG_()
110 Range* rng = VG_(indexXA)(rm->ranges, i); in VG_()
120 Range* rng = (Range*)VG_(indexXA)(rm->ranges, i); in VG_()
128 vg_assert(rm && rm->ranges); in VG_()
129 Word size = VG_(sizeXA)(rm->ranges); in VG_()
[all …]
|
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| D | CollationWeights.java | 97 int minLength=ranges[0].length; in allocWeights()
111 for(int i=0; ranges[i].length==minLength; ++i) { in allocWeights()
112 lengthenRange(ranges[i]); in allocWeights()
123 if(rangeCount < ranges.length) { in allocWeights()
124 ranges[rangeCount] = null; // force a crash when going out of bounds in allocWeights()
141 WeightRange range = ranges[rangeIndex]; in nextWeight()
442 ranges[0] = middle; in getWeightRanges()
448 ranges[rangeCount++]=upper[length]; in getWeightRanges()
451 ranges[rangeCount++]=lower[length]; in getWeightRanges()
459 for(int i = 0; i < rangeCount && ranges[i].length <= (minLength + 1); ++i) { in allocWeightsInShortRanges()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| D | CollationWeights.java | 99 int minLength=ranges[0].length; in allocWeights()
113 for(int i=0; ranges[i].length==minLength; ++i) { in allocWeights()
114 lengthenRange(ranges[i]); in allocWeights()
125 if(rangeCount < ranges.length) { in allocWeights()
126 ranges[rangeCount] = null; // force a crash when going out of bounds in allocWeights()
143 WeightRange range = ranges[rangeIndex]; in nextWeight()
444 ranges[0] = middle; in getWeightRanges()
450 ranges[rangeCount++]=upper[length]; in getWeightRanges()
453 ranges[rangeCount++]=lower[length]; in getWeightRanges()
461 for(int i = 0; i < rangeCount && ranges[i].length <= (minLength + 1); ++i) { in allocWeightsInShortRanges()
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| D | StringRange.java | 99 for (Ranges ranges : compacted) { in compact()
100 adder.add(ranges.start(), ranges.end(shorterPairs)); in compact()
117 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); in compact() local
120 for (Iterator<Ranges> it = ranges.iterator(); it.hasNext();) { in compact()
131 return ranges; in compact()
164 private final Range[] ranges; field in StringRange.Ranges
167 ranges = new Range[array.length]; in Ranges()
169 ranges[i] = new Range(array[i], array[i]); in Ranges()
174 for (int i = ranges.length-1; i >= 0; --i) { in merge()
176 if (ranges[i].max != other.ranges[i].min-1) { // not adjacent in merge()
[all …]
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| D | StringRange.java | 95 for (Ranges ranges : compacted) { in compact()
96 adder.add(ranges.start(), ranges.end(shorterPairs)); in compact()
113 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); in compact() local
116 for (Iterator<Ranges> it = ranges.iterator(); it.hasNext();) { in compact()
127 return ranges; in compact()
160 private final Range[] ranges; field in StringRange.Ranges
163 ranges = new Range[array.length]; in Ranges()
165 ranges[i] = new Range(array[i], array[i]); in Ranges()
170 for (int i = ranges.length-1; i >= 0; --i) { in merge()
172 if (ranges[i].max != other.ranges[i].min-1) { // not adjacent in merge()
[all …]
|
| /external/v8/test/unittests/compiler/ |
| D | coalesced-live-ranges-unittest.cc | 21 CoalescedLiveRanges& ranges() { return ranges_; } in ranges() function in v8::internal::compiler::CoalescedLiveRangesTest
22 const CoalescedLiveRanges& ranges() const { return ranges_; } in ranges() function in v8::internal::compiler::CoalescedLiveRangesTest
57 auto conflicts = ranges().GetConflicts(range); in RemoveConflicts()
69 return ranges().VerifyAllocationsAreValidForTesting(); in AllocationsAreValid()
77 auto conflicts = ranges().GetConflicts(range); in IsRangeConflictingWith()
88 ASSERT_TRUE(ranges().empty()); in TEST_F()
96 ranges().AllocateRange(range); in TEST_F()
97 ASSERT_FALSE(ranges().empty()); in TEST_F()
109 ranges().AllocateRange(range); in TEST_F()
110 ASSERT_FALSE(ranges().empty()); in TEST_F()
[all …]
|
| /external/icu/icu4c/source/i18n/ |
| D | collationweights.cpp | 372 uprv_memcpy(ranges, &middle, sizeof(WeightRange)); in getWeightRanges()
378 uprv_memcpy(ranges+rangeCount, upper+length, sizeof(WeightRange)); in getWeightRanges()
382 uprv_memcpy(ranges+rangeCount, lower+length, sizeof(WeightRange)); in getWeightRanges()
392 for(int32_t i = 0; i < rangeCount && ranges[i].length <= (minLength + 1); ++i) { in allocWeightsInShortRanges()
393 if(n <= ranges[i].count) { in allocWeightsInShortRanges()
395 if(ranges[i].length > minLength) { in allocWeightsInShortRanges()
399 ranges[i].count = n; in allocWeightsInShortRanges()
409 uprv_sortArray(ranges, rangeCount, sizeof(WeightRange), in allocWeightsInShortRanges()
415 n -= ranges[i].count; // still >0 in allocWeightsInShortRanges()
428 ranges[minLengthRangeCount].length == minLength; in allocWeightsInMinLengthRanges()
[all …]
|
| D | collationsettings.cpp | 84 const uint32_t *ranges, int32_t rangesLength, in aliasReordering() argument
92 (ranges[0] & 0xffff) == 0 && (ranges[rangesLength - 1] & 0xffff) != 0)) { in aliasReordering()
105 (ranges[firstSplitByteRangeIndex] & 0xff0000) == 0) { in aliasReordering()
115 U_ASSERT(table[ranges[firstSplitByteRangeIndex] >> 24] == 0); in aliasReordering()
116 minHighNoReorder = ranges[rangesLength - 1] & 0xffff0000; in aliasReordering()
117 reorderRanges = ranges + firstSplitByteRangeIndex; in aliasReordering()
143 const uint32_t *ranges = reinterpret_cast<uint32_t *>(rangesList.getBuffer()); in setReordering() local
149 U_ASSERT((ranges[0] & 0xffff) == 0 && (ranges[rangesLength - 1] & 0xffff) != 0); in setReordering()
150 minHighNoReorder = ranges[rangesLength - 1] & 0xffff0000; in setReordering()
158 uint32_t pair = ranges[i]; in setReordering()
[all …]
|
| /external/v8/tools/profviz/ |
| D | composer.js | 67 this.ranges = []; property in PlotScriptComposer.TimerEvent
171 var ranges = [];
174 ranges.push(
177 return ranges;
180 function MergeRanges(ranges) { argument
181 ranges.sort(function(a, b) { return a.start - b.start; });
184 for (var i = 0; i < ranges.length; i = j) {
185 var merge_start = ranges[i].start;
187 var merge_end = ranges[i].end;
188 for (j = i + 1; j < ranges.length; j++) {
[all …]
|
| /external/regex-re2/re2/ |
| D | make_perl_groups.pl | 36 my @ranges;
48 push @ranges, [$start, $i-1];
53 return @ranges;
57 my ($cname, $name, @ranges) = @_;
59 for (my $i=0; $i<@ranges; $i++) {
60 my @a = @{$ranges[$i]};
64 my $n = @ranges;
82 my @ranges = ComputeClass($cl);
83 push @entries, PrintClass(++$gen, $cl, @ranges);
|
| D | make_unicode_groups.py | 32 ranges = []
36 ranges[-1][1] = c
38 ranges.append([c, c])
40 return ranges
42 def PrintRanges(type, name, ranges): argument
45 for lo, hi in ranges:
|
| D | make_unicode_casefold.py | 65 ranges = []
92 if ranges and evenodd(last, a, b, ranges[-1]):
94 elif ranges and evenoddpair(last, a, b, ranges[-1]):
97 ranges.append([a, a, _Delta(a, b)])
99 return ranges
|
| /external/easymock/src/org/easymock/internal/ |
| D | Results.java | 29 private final LinkedList<Range> ranges = new LinkedList<Range>(); field in Results
34 if (!ranges.isEmpty()) { in add()
35 Range lastRange = ranges.getLast(); in add()
41 ranges.add(range); in add()
47 for (int i = 0; i < ranges.size(); i++) { in next()
48 Range interval = ranges.get(i); in next()
74 for (Range interval : ranges) { in getMainInterval()
|
| /external/opencv3/modules/imgproc/test/ocl/ |
| D | test_histogram.cpp | 71 std::vector<float> ranges; in PARAM_TEST_CASE() local
103 ranges.clear(); in PARAM_TEST_CASE()
112 ranges.push_back(10); in PARAM_TEST_CASE()
113 ranges.push_back(100); in PARAM_TEST_CASE()
125 cv::calcHist(images_roi, channels, noArray(), tmpHist, hist_size, ranges); in PARAM_TEST_CASE()
205 OCL_OFF(cv::calcBackProject(images_roi, channels, hist_roi, dst_roi, ranges, scale)); in OCL_TEST_P()
206 OCL_ON(cv::calcBackProject(uimages_roi, channels, uhist_roi, udst_roi, ranges, scale)); in OCL_TEST_P()
254 std::vector<float> ranges(2); in OCL_TEST_P() local
256 ranges[0] = 0; in OCL_TEST_P()
257 ranges[1] = 256; in OCL_TEST_P()
[all …]
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| D | RangeDateRule.java | 53 ranges.add(new Range(start, rule)); in add()
65 if (index == ranges.size()) { in firstAfter()
137 int lastIndex = ranges.size(); in startIndex()
139 for (int i = 0; i < ranges.size(); i++) { in startIndex()
140 Range r = ranges.get(i); in startIndex()
150 return (index < ranges.size()) ? ranges.get(index) in rangeAt()
154 List<Range> ranges = new ArrayList<Range>(2); field in RangeDateRule
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| D | RangeDateRule.java | 51 ranges.add(new Range(start, rule)); in add()
62 if (index == ranges.size()) { in firstAfter()
131 int lastIndex = ranges.size(); in startIndex()
133 for (int i = 0; i < ranges.size(); i++) { in startIndex()
134 Range r = ranges.get(i); in startIndex()
144 return (index < ranges.size()) ? ranges.get(index) in rangeAt()
148 List<Range> ranges = new ArrayList<Range>(2); field in RangeDateRule
|
| /external/fonttools/Lib/fontTools/ttLib/tables/ |
| D | otTables.py | 45 ranges = rawTable["RangeRecord"]
50 sorted_ranges = sorted(ranges, key=lambda a: a.StartCoverageIndex)
51 if ranges != sorted_ranges:
53 ranges = sorted_ranges
55 for r in ranges:
92 ranges = [[last]]
95 ranges[-1].append(last)
96 ranges.append([glyphID])
98 ranges[-1].append(last)
100 if brokenOrder or len(ranges) * 3 < len(glyphs): # 3 words vs. 1 word
[all …]
|
| /external/v8/test/mjsunit/ |
| D | unicodelctest.js | 95 var ranges = new Array(len);
98 ranges.push(last);
101 ranges.sort(function (a, b) { return a - b });
104 var ch = String.fromCharCode(ranges[j]);
113 retest(re, (ranges[j] - 1), negated);
114 retest(re, (ranges[j]), negated);
115 retest(re, (ranges[j] + 1), negated);
|
| D | unicodelctest-no-optimization.js | 97 var ranges = new Array(len);
100 ranges.push(last);
103 ranges.sort(function (a, b) { return a - b });
106 var ch = String.fromCharCode(ranges[j]);
115 retest(re, (ranges[j] - 1), negated);
116 retest(re, (ranges[j]), negated);
117 retest(re, (ranges[j] + 1), negated);
|