| /external/libchrome/base/metrics/ |
| 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(3)
[all...] |
| 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.set_range(3, 3)
[all...] |
| 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->set_range(ranges->bucket_count(), HistogramBase::kSampleType_MAX)
227 Sample Histogram::ranges(size_t i) const { function in class:base::Histogram
600 BucketRanges* ranges = new BucketRanges(bucket_count + 1); local
714 BucketRanges* ranges = new BucketRanges(4); local
777 BucketRanges* ranges = CreateBucketRangesFromCustomRanges(custom_ranges); local
895 std::vector<int> ranges = custom_ranges; local
[all...] |
| 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(9)
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/ |
| 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
|
| /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/regex-re2/re2/ |
| 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...] |
| 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 out of range16
[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/valgrind/coregrind/ |
| 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/ |
| 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) {
|
| /prebuilts/go/darwin-x86/src/regexp/syntax/ |
| make_perl_groups.pl | 8 # Generate table entries giving character ranges
38 my @ranges;
50 push @ranges, [$start, $i-1];
55 return @ranges;
59 my ($cname, $name, @ranges) = @_;
61 for (my $i=0; $i<@ranges; $i++) {
62 my @a = @{$ranges[$i]};
66 my $n = @ranges;
83 my @ranges = ComputeClass($cl);
84 push @entries, PrintClass(++$gen, $cl, @ranges);
[all...] |
| /prebuilts/go/linux-x86/src/regexp/syntax/ |
| make_perl_groups.pl | 8 # Generate table entries giving character ranges
38 my @ranges;
50 push @ranges, [$start, $i-1];
55 return @ranges;
59 my ($cname, $name, @ranges) = @_;
61 for (my $i=0; $i<@ranges; $i++) {
62 my @a = @{$ranges[$i]};
66 my $n = @ranges;
83 my @ranges = ComputeClass($cl);
84 push @entries, PrintClass(++$gen, $cl, @ranges);
[all...] |
| /external/icu/icu4c/source/tools/toolutil/ |
| 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);
|
| /frameworks/base/services/core/jni/ |
| com_android_server_ConsumerIrService.cpp | 72 consumerir_freq_range_t *ranges; local
79 ranges = new consumerir_freq_range_t[len];
81 len = dev->get_carrier_freqs(dev, len, ranges);
83 delete[] ranges;
91 delete[] ranges;
95 arr[i*2] = ranges[i].min;
96 arr[i*2+1] = ranges[i].max;
99 delete[] ranges;
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/ |
| StringRange.java | 89 // TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from there.
91 Relation<Integer,Ranges> lengthToArrays = Relation.of(new TreeMap<Integer,Set<Ranges>>(), TreeSet.class);
93 Ranges item = new Ranges(s);
97 for (Entry<Integer, Set<Ranges>> entry : lengthToArrays.keyValuesSet()) {
98 LinkedList<Ranges> compacted = compact(entry.getKey(), entry.getValue());
99 for (Ranges ranges : compacted) {
100 adder.add(ranges.start(), ranges.end(shorterPairs))
117 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); local
164 private final Range[] ranges; field in class:StringRange.Ranges
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| StringRange.java | 85 // TODO rewire to use the first (slower) algorithm to generate the ranges, then compact them from there.
87 Relation<Integer,Ranges> lengthToArrays = Relation.of(new TreeMap<Integer,Set<Ranges>>(), TreeSet.class);
89 Ranges item = new Ranges(s);
93 for (Entry<Integer, Set<Ranges>> entry : lengthToArrays.keyValuesSet()) {
94 LinkedList<Ranges> compacted = compact(entry.getKey(), entry.getValue());
95 for (Ranges ranges : compacted) {
96 adder.add(ranges.start(), ranges.end(shorterPairs))
113 LinkedList<Ranges> ranges = new LinkedList<Ranges>(inputRanges); local
160 private final Range[] ranges; field in class:StringRange.Ranges
[all...] |
| /system/core/metricsd/uploader/ |
| metrics_log_base_unittest.cc | 82 base::BucketRanges ranges(8);
83 ranges.set_range(0, 1);
84 ranges.set_range(1, 5);
85 ranges.set_range(2, 7);
86 ranges.set_range(3, 8);
87 ranges.set_range(4, 9);
88 ranges.set_range(5, 10);
89 ranges.set_range(6, 11);
90 ranges.set_range(7, 12);
92 base::SampleVector samples(&ranges);
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| ImmutableRangeSet.java | 103 ImmutableRangeSet(ImmutableList<Range<C>> ranges) {
104 this.ranges = ranges;
107 private ImmutableRangeSet(ImmutableList<Range<C>> ranges, ImmutableRangeSet<C> complement) {
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,
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| 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[i].length==minLength; ++i)
556 private WeightRange[] ranges = new WeightRange[7]; field in class:CollationWeights
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| 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[i].length==minLength; ++i)
554 private WeightRange[] ranges = new WeightRange[7]; field in class:CollationWeights
[all...] |
| /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/icu/android_icu4j/src/main/java/android/icu/util/ |
| 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.get(i)
148 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 | 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.get(i)
154 List<Range> ranges = new ArrayList<Range>(2); field in class:RangeDateRule
[all...] |
| /bootable/recovery/minzip/ |
| SysUtil.c | 41 pMap->ranges = malloc(sizeof(MappedRange));
42 if (pMap->ranges == NULL) {
47 pMap->ranges[0].addr = memPtr;
48 pMap->ranges[0].length = sb.st_size;
87 pMap->ranges = calloc(range_count, sizeof(MappedRange));
88 if (pMap->ranges == NULL) {
98 free(pMap->ranges);
106 free(pMap->ranges);
133 pMap->ranges[i].addr = addr;
134 pMap->ranges[i].length = length
[all...] |
