/external/libchrome/base/metrics/ |
H A D | bucket_ranges_unittest.cc | 15 BucketRanges ranges(5); 16 ASSERT_EQ(5u, ranges.size()); 17 ASSERT_EQ(4u, ranges.bucket_count()); 20 EXPECT_EQ(0, ranges.range(i)); 22 EXPECT_EQ(0u, ranges.checksum()); 24 ranges.set_range(3, 100); 25 EXPECT_EQ(100, ranges.range(3)); 29 // Compare empty ranges. 38 // Compare full filled ranges. 61 BucketRanges ranges( [all...] |
H A D | sample_vector_unittest.cc | 22 BucketRanges ranges(3); 23 ranges.set_range(0, 1); 24 ranges.set_range(1, 5); 25 ranges.set_range(2, 10); 26 SampleVector samples(1, &ranges); 49 BucketRanges ranges(5); 50 ranges.set_range(0, 0); 51 ranges.set_range(1, 1); 52 ranges.set_range(2, 2); 53 ranges [all...] |
H A D | histogram.cc | 99 BucketRanges* ranges = new BucketRanges(bucket_count + 1); local 100 InitializeBucketRanges(minimum, maximum, ranges); 102 StatisticsRecorder::RegisterOrDeleteDuplicateRanges(ranges); 157 // ranges(i) == ranges(i + 1) 165 BucketRanges* ranges) { 171 ranges->set_range(bucket_index, current); 172 size_t bucket_count = ranges->bucket_count(); 186 ranges->set_range(bucket_index, current); 188 ranges 163 InitializeBucketRanges(Sample minimum, Sample maximum, BucketRanges* ranges) argument 227 Sample Histogram::ranges(size_t i) const { function in class:base::Histogram 335 Histogram(const std::string& name, Sample minimum, Sample maximum, const BucketRanges* ranges) argument 600 BucketRanges* ranges = new BucketRanges(bucket_count + 1); local 639 LinearHistogram(const std::string& name, Sample minimum, Sample maximum, const BucketRanges* ranges) argument 667 InitializeBucketRanges(Sample minimum, Sample maximum, BucketRanges* ranges) argument 714 BucketRanges* ranges = new BucketRanges(4); local 739 BooleanHistogram(const std::string& name, const BucketRanges* ranges) argument 777 BucketRanges* ranges = CreateBucketRangesFromCustomRanges(custom_ranges); local 821 CustomHistogram(const std::string& name, const BucketRanges* ranges) argument 895 std::vector<int> ranges = custom_ranges; local [all...] |
H A D | histogram_unittest.cc | 89 BucketRanges ranges(9); 90 Histogram::InitializeBucketRanges(1, 64, &ranges); 91 EXPECT_EQ(0, ranges.range(0)); 94 EXPECT_EQ(power_of_2, ranges.range(i)); 97 EXPECT_EQ(HistogramBase::kSampleType_MAX, ranges.range(8)); 99 // Check the corresponding Histogram will use the correct ranges. 102 EXPECT_TRUE(ranges.Equals(histogram->bucket_ranges())); 104 // When bucket count is limited, exponential ranges will partially look like 126 // Check the corresponding Histogram will use the correct ranges. 133 BucketRanges ranges( 161 const HistogramBase::Sample ranges[3] = {5, 10, 20}; local 182 const BucketRanges* ranges = histogram->bucket_ranges(); local 231 const BucketRanges* ranges = histogram->bucket_ranges(); local 519 const BucketRanges* ranges = custom_histogram->bucket_ranges(); local [all...] |
/external/elfutils/tests/ |
H A D | run-dwarf-ranges.sh | 20 testfiles debug-ranges-no-lowpc.o 22 testrun_compare ${abs_builddir}/dwarf-ranges debug-ranges-no-lowpc.o 0xb <<\EOF
|
/external/regex-re2/re2/ |
H A D | make_perl_groups.pl | 6 # Generate table entries giving character ranges 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); [all...] |
H A 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): 43 """Print the ranges as an array of type named name.""" 45 for lo, hi in ranges: 62 # Split codes into 16-bit ranges and 32-bit ranges. 66 # Pull singleton ranges ou [all...] |
H A 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 132 print "// %d groups, %d pairs, %d ranges" % (len(casegroups), len(foldpairs), len(foldranges))
|
/external/valgrind/coregrind/ |
H A D | m_rangemap.c | 54 XArray* ranges; member in struct:_RangeMap 77 rm->ranges = VG_(newXA)( alloc_fn, cc, free_fn, sizeof(Range) ); 83 Word i = VG_(addToXA)(rm->ranges, &r); 85 vg_assert(VG_(sizeXA)(rm->ranges) == 1); 94 vg_assert(rm->ranges); 95 VG_(deleteXA)(rm->ranges); 110 Range* rng = VG_(indexXA)(rm->ranges, i); 120 Range* rng = (Range*)VG_(indexXA)(rm->ranges, i); 128 vg_assert(rm && rm->ranges); 129 Word size = VG_(sizeXA)(rm->ranges); 149 XArray* ranges = rm->ranges; local 165 XArray* ranges = rm->ranges; local 188 XArray* ranges = rm->ranges; local [all...] |
/external/easymock/src/org/easymock/internal/ |
H A D | 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) {
|
/external/v8/test/unittests/compiler/ |
H A D | coalesced-live-ranges-unittest.cc | 5 #include "src/compiler/coalesced-live-ranges.h" 21 CoalescedLiveRanges& ranges() { return ranges_; } function in class:v8::internal::compiler::CoalescedLiveRangesTest 22 const CoalescedLiveRanges& ranges() const { return ranges_; } function in class:v8::internal::compiler::CoalescedLiveRangesTest 57 auto conflicts = ranges().GetConflicts(range); 69 return ranges().VerifyAllocationsAreValidForTesting(); 77 auto conflicts = ranges().GetConflicts(range); 88 ASSERT_TRUE(ranges().empty()); 96 ranges().AllocateRange(range); 97 ASSERT_FALSE(ranges().empty()); 109 ranges() [all...] |
/external/icu/icu4c/source/tools/toolutil/ |
H A D | denseranges.h | 14 * Helper code for finding a small number of dense ranges. 23 * Does it make sense to write 1..capacity ranges? 24 * Returns 0 if not, otherwise the number of ranges. 29 * @param ranges Output ranges array. 30 * @param capacity Maximum number of ranges. 31 * @return Minimum number of ranges (at most capacity) that have the desired density, 37 int32_t ranges[][2], int32_t capacity);
|
H A D | denseranges.cpp | 14 * Helper code for finding a small number of dense ranges. 87 * Does it make sense to write 1..capacity ranges? 88 * Returns 0 if not, otherwise the number of ranges. 93 * @param ranges Output ranges array. 94 * @param capacity Maximum number of ranges. 95 * @return Minimum number of ranges (at most capacity) that have the desired density, 101 int32_t ranges[][2], int32_t capacity) { 112 ranges[0][0]=minValue; 113 ranges[ 99 uprv_makeDenseRanges(const int32_t values[], int32_t length, int32_t density, int32_t ranges[][2], int32_t capacity) argument [all...] |
/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
H A D | StringRange.java | 89 // TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from there. 99 for (Ranges ranges : compacted) { 100 adder.add(ranges.start(), ranges.end(shorterPairs)); 117 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); 120 for (Iterator<Ranges> it = ranges.iterator(); it.hasNext();) { 131 return ranges; 164 private final Range[] ranges; field in class:StringRange.Ranges 167 ranges = new Range[array.length]; 169 ranges[ [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | StringRange.java | 85 // TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from there. 95 for (Ranges ranges : compacted) { 96 adder.add(ranges.start(), ranges.end(shorterPairs)); 113 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); 116 for (Iterator<Ranges> it = ranges.iterator(); it.hasNext();) { 127 return ranges; 160 private final Range[] ranges; field in class:StringRange.Ranges 163 ranges = new Range[array.length]; 165 ranges[ [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | ImmutableRangeSet.java | 103 ImmutableRangeSet(ImmutableList<Range<C>> ranges) { argument 104 this.ranges = ranges; 107 private ImmutableRangeSet(ImmutableList<Range<C>> ranges, ImmutableRangeSet<C> complement) { argument 108 this.ranges = ranges; 112 private transient final ImmutableList<Range<C>> ranges; field in class:ImmutableRangeSet 116 int index = SortedLists.binarySearch(ranges, 122 return index != -1 && ranges.get(index).encloses(otherRange); 127 int index = SortedLists.binarySearch(ranges, 512 private final ImmutableList<Range<C>> ranges; field in class:ImmutableRangeSet.AsSetSerializedForm 515 AsSetSerializedForm(ImmutableList<Range<C>> ranges, DiscreteDomain<C> domain) argument 578 addAll(RangeSet<C> ranges) argument 594 private final ImmutableList<Range<C>> ranges; field in class:ImmutableRangeSet.SerializedForm 596 SerializedForm(ImmutableList<Range<C>> ranges) argument [all...] |
H A D | 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) { argument 158 this.ranges = ranges; 165 int index = SortedLists.binarySearch(ranges, Rang [all...] |
/external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
H A D | CollationWeights.java | 74 * what ranges to use for a given number of weights between (excluding) 77 * @param lowerLimit A collation element weight; the ranges will be filled to cover 79 * @param upperLimit A collation element weight; the ranges will be filled to cover 87 // which ranges to use for a given number of weights between (excluding) 92 // printf("error: unable to get Weight ranges\n"); 96 /* try until we find suitably large ranges */ 99 int minLength=ranges[0].length; 111 /* no good match, lengthen all minLength ranges and iterate */ 112 // printf("lengthen the short ranges from %ld bytes to %ld and iterate\n", minLength, minLength+1); 113 for(int i=0; ranges[ 556 private WeightRange[] ranges = new WeightRange[7]; field in class:CollationWeights [all...] |
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
H A D | CollationWeights.java | 72 * what ranges to use for a given number of weights between (excluding) 75 * @param lowerLimit A collation element weight; the ranges will be filled to cover 77 * @param upperLimit A collation element weight; the ranges will be filled to cover 85 // which ranges to use for a given number of weights between (excluding) 90 // printf("error: unable to get Weight ranges\n"); 94 /* try until we find suitably large ranges */ 97 int minLength=ranges[0].length; 109 /* no good match, lengthen all minLength ranges and iterate */ 110 // printf("lengthen the short ranges from %ld bytes to %ld and iterate\n", minLength, minLength+1); 111 for(int i=0; ranges[ 554 private WeightRange[] ranges = new WeightRange[7]; field in class:CollationWeights [all...] |
/external/compiler-rt/test/msan/ |
H A D | 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/icu/android_icu4j/src/main/java/android/icu/util/ |
H A D | RangeDateRule.java | 31 // public RangeDateRule(Range[] ranges) 33 // for (int i = 0; i < ranges.length; i++) { 34 // this.ranges.addElement(ranges[i]); 51 ranges.add(new Range(start, rule)); 62 if (index == ranges.size()) { 128 * returns an index >= ranges.size() if there is none 131 int lastIndex = ranges.size(); 133 for (int i = 0; i < ranges.size(); i++) { 134 Range r = ranges 148 List<Range> ranges = new ArrayList<Range>(2); field in class:RangeDateRule [all...] |
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
H A D | RangeDateRule.java | 31 // public RangeDateRule(Range[] ranges) 33 // for (int i = 0; i < ranges.length; i++) { 34 // this.ranges.addElement(ranges[i]); 53 ranges.add(new Range(start, rule)); 65 if (index == ranges.size()) { 134 * returns an index >= ranges.size() if there is none 137 int lastIndex = ranges.size(); 139 for (int i = 0; i < ranges.size(); i++) { 140 Range r = ranges 154 List<Range> ranges = new ArrayList<Range>(2); field in class:RangeDateRule [all...] |
/external/opencv3/samples/cpp/tutorial_code/Histograms_Matching/ |
H A D | compareHist_Demo.cpp | 52 const float* ranges[] = { h_ranges, s_ranges }; local 65 calcHist( &hsv_base, 1, channels, Mat(), hist_base, 2, histSize, ranges, true, false ); 68 calcHist( &hsv_half_down, 1, channels, Mat(), hist_half_down, 2, histSize, ranges, true, false ); 71 calcHist( &hsv_test1, 1, channels, Mat(), hist_test1, 2, histSize, ranges, true, false ); 74 calcHist( &hsv_test2, 1, channels, Mat(), hist_test2, 2, histSize, ranges, true, false );
|
/external/v8/tools/profviz/ |
H A D | composer.js | 67 this.ranges = []; 171 var ranges = []; 174 ranges.push( 177 return ranges; 180 function MergeRanges(ranges) { 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 [all...] |
/external/icu/icu4c/source/i18n/ |
H A D | collationsettings.cpp | 84 const uint32_t *ranges, int32_t rangesLength, 92 (ranges[0] & 0xffff) == 0 && (ranges[rangesLength - 1] & 0xffff) != 0)) { 101 // Drop ranges before the first split byte. They are reordered by the table. 102 // This then speeds up reordering of the remaining ranges. 105 (ranges[firstSplitByteRangeIndex] & 0xff0000) == 0) { 115 U_ASSERT(table[ranges[firstSplitByteRangeIndex] >> 24] == 0); 116 minHighNoReorder = ranges[rangesLength - 1] & 0xffff0000; 117 reorderRanges = ranges + firstSplitByteRangeIndex; 143 const uint32_t *ranges local 83 aliasReordering(const CollationData &data, const int32_t *codes, int32_t length, const uint32_t *ranges, int32_t rangesLength, const uint8_t *table, UErrorCode &errorCode) argument 189 setReorderArrays(const int32_t *codes, int32_t codesLength, const uint32_t *ranges, int32_t rangesLength, const uint8_t *table, UErrorCode &errorCode) argument 262 const uint32_t *ranges = reorderRanges; local [all...] |