Home
last modified time | relevance | path

Searched refs:ranges (Results 1 – 25 of 392) sorted by relevance

12345678910>>...16

/external/chromium/chrome/browser/safe_browsing/
Dchunk_range_unittest.cc92 std::vector<ChunkRange> ranges; in TEST() local
95 EXPECT_TRUE(StringToRanges(input, &ranges)); in TEST()
96 EXPECT_EQ(ranges.size(), static_cast<size_t>(5)); in TEST()
97 EXPECT_EQ(ranges[0].start(), 1); in TEST()
98 EXPECT_EQ(ranges[0].stop(), 100); in TEST()
99 EXPECT_EQ(ranges[1].start(), 398); in TEST()
100 EXPECT_EQ(ranges[1].stop(), 398); in TEST()
101 EXPECT_EQ(ranges[3].start(), 1138); in TEST()
102 EXPECT_EQ(ranges[3].stop(), 2001); in TEST()
104 ranges.clear(); in TEST()
[all …]
Dchunk_range.cc55 void RangesToChunks(const std::vector<ChunkRange>& ranges, in RangesToChunks() argument
58 for (size_t i = 0; i < ranges.size(); ++i) { in RangesToChunks()
59 const ChunkRange& range = ranges[i]; in RangesToChunks()
67 std::vector<ChunkRange>* ranges) { in StringToRanges() argument
68 DCHECK(ranges); in StringToRanges()
84 ranges->clear(); in StringToRanges()
87 ranges->push_back(ChunkRange(start, stop)); in StringToRanges()
94 bool IsChunkInRange(int chunk_number, const std::vector<ChunkRange>& ranges) { in IsChunkInRange() argument
95 if (ranges.empty()) in IsChunkInRange()
99 int high = ranges.size() - 1; in IsChunkInRange()
[all …]
/external/chromium_org/chrome/browser/safe_browsing/
Dchunk_range_unittest.cc92 std::vector<ChunkRange> ranges; in TEST() local
95 EXPECT_TRUE(StringToRanges(input, &ranges)); in TEST()
96 EXPECT_EQ(ranges.size(), static_cast<size_t>(5)); in TEST()
97 EXPECT_EQ(ranges[0].start(), 1); in TEST()
98 EXPECT_EQ(ranges[0].stop(), 100); in TEST()
99 EXPECT_EQ(ranges[1].start(), 398); in TEST()
100 EXPECT_EQ(ranges[1].stop(), 398); in TEST()
101 EXPECT_EQ(ranges[3].start(), 1138); in TEST()
102 EXPECT_EQ(ranges[3].stop(), 2001); in TEST()
104 ranges.clear(); in TEST()
[all …]
Dchunk_range.cc55 void RangesToChunks(const std::vector<ChunkRange>& ranges, in RangesToChunks() argument
58 for (size_t i = 0; i < ranges.size(); ++i) { in RangesToChunks()
59 const ChunkRange& range = ranges[i]; in RangesToChunks()
67 std::vector<ChunkRange>* ranges) { in StringToRanges() argument
68 DCHECK(ranges); in StringToRanges()
84 ranges->clear(); in StringToRanges()
87 ranges->push_back(ChunkRange(start, stop)); in StringToRanges()
94 bool IsChunkInRange(int chunk_number, const std::vector<ChunkRange>& ranges) { in IsChunkInRange() argument
95 if (ranges.empty()) in IsChunkInRange()
99 int high = ranges.size() - 1; in IsChunkInRange()
[all …]
/external/chromium_org/third_party/icu/source/i18n/
Ducol_wgt.cpp145 WeightRange ranges[7]) { in getWeightRanges()
282 uprv_memcpy(ranges, &middle, sizeof(WeightRange)); in getWeightRanges()
288 uprv_memcpy(ranges+rangeCount, upper+length, sizeof(WeightRange)); in getWeightRanges()
292 uprv_memcpy(ranges+rangeCount, lower+length, sizeof(WeightRange)); in getWeightRanges()
308 WeightRange ranges[7]) { in ucol_allocWeights()
329 rangeCount=getWeightRanges(lowerLimit, upperLimit, maxByte, countBytes, ranges); in ucol_allocWeights()
340 maxCount+=(uint32_t)ranges[i].count*powers[4-ranges[i].length]; in ucol_allocWeights()
355 ranges[i].length2=ranges[i].length; in ucol_allocWeights()
356 ranges[i].count2=(uint32_t)ranges[i].count; in ucol_allocWeights()
362 minLength=ranges[0].length2; in ucol_allocWeights()
[all …]
/external/icu4c/i18n/
Ducol_wgt.cpp158 WeightRange ranges[7]) { in getWeightRanges()
295 uprv_memcpy(ranges, &middle, sizeof(WeightRange)); in getWeightRanges()
301 uprv_memcpy(ranges+rangeCount, upper+length, sizeof(WeightRange)); in getWeightRanges()
305 uprv_memcpy(ranges+rangeCount, lower+length, sizeof(WeightRange)); in getWeightRanges()
321 WeightRange ranges[7]) { in ucol_allocWeights()
342 rangeCount=getWeightRanges(lowerLimit, upperLimit, maxByte, countBytes, ranges); in ucol_allocWeights()
353 maxCount+=(uint32_t)ranges[i].count*powers[4-ranges[i].length]; in ucol_allocWeights()
368 ranges[i].length2=ranges[i].length; in ucol_allocWeights()
369 ranges[i].count2=(uint32_t)ranges[i].count; in ucol_allocWeights()
375 minLength=ranges[0].length2; in ucol_allocWeights()
[all …]
/external/chromium_org/base/metrics/
Dbucket_ranges_unittest.cc13 BucketRanges ranges(5); in TEST() local
14 ASSERT_EQ(5u, ranges.size()); in TEST()
15 ASSERT_EQ(4u, ranges.bucket_count()); in TEST()
18 EXPECT_EQ(0, ranges.range(i)); in TEST()
20 EXPECT_EQ(0u, ranges.checksum()); in TEST()
22 ranges.set_range(3, 100); in TEST()
23 EXPECT_EQ(100, ranges.range(3)); in TEST()
59 BucketRanges ranges(3); in TEST() local
60 ranges.set_range(0, 0); in TEST()
61 ranges.set_range(1, 1); in TEST()
[all …]
Dsample_vector_unittest.cc20 BucketRanges ranges(3); in TEST() local
21 ranges.set_range(0, 1); in TEST()
22 ranges.set_range(1, 5); in TEST()
23 ranges.set_range(2, 10); in TEST()
24 SampleVector samples(&ranges); in TEST()
47 BucketRanges ranges(5); in TEST() local
48 ranges.set_range(0, 0); in TEST()
49 ranges.set_range(1, 1); in TEST()
50 ranges.set_range(2, 2); in TEST()
51 ranges.set_range(3, 3); in TEST()
[all …]
Dhistogram.cc99 BucketRanges* ranges = new BucketRanges(bucket_count + 1); in FactoryGet() local
100 InitializeBucketRanges(minimum, maximum, ranges); in FactoryGet()
102 StatisticsRecorder::RegisterOrDeleteDuplicateRanges(ranges); in FactoryGet()
146 BucketRanges* ranges) { in InitializeBucketRanges() argument
152 ranges->set_range(bucket_index, current); in InitializeBucketRanges()
153 size_t bucket_count = ranges->bucket_count(); in InitializeBucketRanges()
167 ranges->set_range(bucket_index, current); in InitializeBucketRanges()
169 ranges->set_range(ranges->bucket_count(), HistogramBase::kSampleType_MAX); in InitializeBucketRanges()
170 ranges->ResetChecksum(); in InitializeBucketRanges()
180 int new_range = ranges(index); in FindCorruption()
[all …]
Dhistogram_unittest.cc92 BucketRanges ranges(9); in TEST_F() local
93 Histogram::InitializeBucketRanges(1, 64, &ranges); in TEST_F()
94 EXPECT_EQ(0, ranges.range(0)); in TEST_F()
97 EXPECT_EQ(power_of_2, ranges.range(i)); in TEST_F()
100 EXPECT_EQ(HistogramBase::kSampleType_MAX, ranges.range(8)); in TEST_F()
105 EXPECT_TRUE(ranges.Equals(histogram->bucket_ranges())); in TEST_F()
136 BucketRanges ranges(9); in TEST_F() local
137 LinearHistogram::InitializeBucketRanges(1, 7, &ranges); in TEST_F()
140 EXPECT_EQ(i, ranges.range(i)); in TEST_F()
141 EXPECT_EQ(HistogramBase::kSampleType_MAX, ranges.range(8)); in TEST_F()
[all …]
Dstatistics_recorder.cc85 const BucketRanges* ranges) { in RegisterOrDeleteDuplicateRanges() argument
86 DCHECK(ranges->HasValidChecksum()); in RegisterOrDeleteDuplicateRanges()
90 ANNOTATE_LEAKING_OBJECT_PTR(ranges); in RegisterOrDeleteDuplicateRanges()
91 return ranges; in RegisterOrDeleteDuplicateRanges()
96 ANNOTATE_LEAKING_OBJECT_PTR(ranges); in RegisterOrDeleteDuplicateRanges()
97 return ranges; in RegisterOrDeleteDuplicateRanges()
101 RangesMap::iterator ranges_it = ranges_->find(ranges->checksum()); in RegisterOrDeleteDuplicateRanges()
106 (*ranges_)[ranges->checksum()] = checksum_matching_list; in RegisterOrDeleteDuplicateRanges()
116 if (existing_ranges->Equals(ranges)) { in RegisterOrDeleteDuplicateRanges()
117 if (existing_ranges == ranges) { in RegisterOrDeleteDuplicateRanges()
[all …]
Dstatistics_recorder_unittest.cc41 BucketRanges* ranges = new BucketRanges(bucket_count + 1); in CreateHistogram() local
42 Histogram::InitializeBucketRanges(min, max, ranges); in CreateHistogram()
44 StatisticsRecorder::RegisterOrDeleteDuplicateRanges(ranges); in CreateHistogram()
75 BucketRanges* ranges = new BucketRanges(3);; in TEST_F() local
76 ranges->ResetChecksum(); in TEST_F()
77 EXPECT_EQ(ranges, in TEST_F()
78 StatisticsRecorder::RegisterOrDeleteDuplicateRanges(ranges)); in TEST_F()
251 std::vector<const BucketRanges*> ranges; in TEST_F() local
252 StatisticsRecorder::GetBucketRanges(&ranges); in TEST_F()
253 EXPECT_EQ(0u, ranges.size()); in TEST_F()
[all …]
/external/chromium/base/metrics/
Dhistogram_unittest.cc160 EXPECT_EQ(0, histogram->ranges(0)); in TEST()
163 EXPECT_EQ(power_of_2, histogram->ranges(i)); in TEST()
166 EXPECT_EQ(INT_MAX, histogram->ranges(8)); in TEST()
173 EXPECT_EQ(i, short_histogram->ranges(i)); in TEST()
174 EXPECT_EQ(INT_MAX, short_histogram->ranges(8)); in TEST()
180 EXPECT_EQ(i, linear_histogram->ranges(i)); in TEST()
181 EXPECT_EQ(INT_MAX, linear_histogram->ranges(8)); in TEST()
187 EXPECT_EQ(2 * i, linear_broad_histogram->ranges(i)); in TEST()
188 EXPECT_EQ(INT_MAX, linear_broad_histogram->ranges(8)); in TEST()
193 EXPECT_EQ(0, transitioning_histogram->ranges(0)); in TEST()
[all …]
/external/chromium_org/third_party/WebKit/Source/core/html/
DTimeRangesTest.cpp41 static std::string ToString(const TimeRanges& ranges) in ToString() argument
45 for (unsigned i = 0; i < ranges.length(); ++i) in ToString()
46 … ss << " [" << ranges.start(i, IGNORE_EXCEPTION) << "," << ranges.end(i, IGNORE_EXCEPTION) << ")"; in ToString()
95 RefPtr<TimeRanges> ranges = TimeRanges::create(); in TEST() local
97 ranges->add(0, 2); in TEST()
98 ranges->add(10, 11); in TEST()
99 ASSERT_RANGE("{ [0,2) [10,11) }", ranges); in TEST()
101 ranges->add(0, 2); in TEST()
102 ASSERT_RANGE("{ [0,2) [10,11) }", ranges); in TEST()
104 ranges->add(2, 3); in TEST()
[all …]
/external/chromium_org/tools/deep_memory_profiler/tests/
Drange_dict_tests.py41 ranges = ExclusiveRangeDict(self.TestAttribute)
44 for begin, end, attr in ranges.iter_range(20, 40):
52 ranges = ExclusiveRangeDict(self.TestAttribute)
55 for begin, end, attr in ranges.iter_range(20, 20):
61 ranges = ExclusiveRangeDict(self.TestAttribute)
62 for begin, end, attr in ranges.iter_range(20, 30):
64 for begin, end, attr in ranges.iter_range(30, 40):
68 for begin, end, attr in ranges.iter_range(20, 40):
77 ranges = ExclusiveRangeDict(self.TestAttribute)
78 for begin, end, attr in ranges.iter_range(20, 30):
[all …]
/external/chromium_org/v8/tools/profviz/
Dcomposer.js66 this.ranges = []; property in PlotScriptComposer.TimerEvent
167 var ranges = [];
170 ranges.push(
173 return ranges;
176 function MergeRanges(ranges) { argument
177 ranges.sort(function(a, b) { return a.start - b.start; });
180 for (var i = 0; i < ranges.length; i = j) {
181 var merge_start = ranges[i].start;
183 var merge_end = ranges[i].end;
184 for (j = i + 1; j < ranges.length; j++) {
[all …]
/external/chromium_org/printing/
Dpage_range_unittest.cc9 printing::PageRanges ranges; in TEST() local
13 ranges.push_back(range); in TEST()
16 ranges.push_back(range); in TEST()
19 ranges.push_back(range); in TEST()
20 std::vector<int> pages(printing::PageRange::GetPages(ranges)); in TEST()
33 printing::PageRanges ranges; in TEST() local
34 std::vector<int> pages(printing::PageRange::GetPages(ranges)); in TEST()
39 printing::PageRanges ranges; in TEST() local
43 ranges.push_back(range); in TEST()
44 std::vector<int> pages(printing::PageRange::GetPages(ranges)); in TEST()
/external/regex-re2/re2/
Dmake_perl_groups.pl36 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);
/external/chromium_org/third_party/re2/re2/
Dmake_perl_groups.pl36 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);
/external/chromium_org/net/disk_cache/
Dstats_histogram.cc26 const BucketRanges* ranges, in StatsHistogram() argument
28 : Histogram(name, minimum, maximum, ranges), in StatsHistogram()
35 BucketRanges* ranges) { in InitializeBucketRanges() argument
36 for (size_t i = 0; i < ranges->size(); ++i) { in InitializeBucketRanges()
37 ranges->set_range(i, stats->GetBucketRange(i)); in InitializeBucketRanges()
39 ranges->ResetChecksum(); in InitializeBucketRanges()
52 BucketRanges* ranges = new BucketRanges(bucket_count + 1); in FactoryGet() local
53 InitializeBucketRanges(stats, ranges); in FactoryGet()
55 StatisticsRecorder::RegisterOrDeleteDuplicateRanges(ranges); in FactoryGet()
/external/chromium_org/chrome/common/metrics/
Dmetrics_log_base_unittest.cc79 base::BucketRanges ranges(8); in TEST() local
80 ranges.set_range(0, 1); in TEST()
81 ranges.set_range(1, 5); in TEST()
82 ranges.set_range(2, 7); in TEST()
83 ranges.set_range(3, 8); in TEST()
84 ranges.set_range(4, 9); in TEST()
85 ranges.set_range(5, 10); in TEST()
86 ranges.set_range(6, 11); in TEST()
87 ranges.set_range(7, 12); in TEST()
89 base::SampleVector samples(&ranges); in TEST()
/external/chromium_org/third_party/ots/src/
Dcmap.cc123 std::vector<Subtable314Range> ranges(segcount); in ParseFormat4() local
126 if (!subtable.ReadU16(&ranges[i].end_range)) { in ParseFormat4()
140 if (!subtable.ReadU16(&ranges[i].start_range)) { in ParseFormat4()
145 if (!subtable.ReadS16(&ranges[i].id_delta)) { in ParseFormat4()
150 ranges[i].id_range_offset_offset = subtable.offset(); in ParseFormat4()
151 if (!subtable.ReadU16(&ranges[i].id_range_offset)) { in ParseFormat4()
155 if (ranges[i].id_range_offset & 1) { in ParseFormat4()
161 ranges[i].id_range_offset = 0; in ParseFormat4()
174 (ranges[i - 1].start_range == 0xffff) && in ParseFormat4()
175 (ranges[i - 1].end_range == 0xffff) && in ParseFormat4()
[all …]
/external/easymock/src/org/easymock/internal/
DResults.java29 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/harfbuzz/contrib/tables/
Dcategory-parse.py46 ranges = unicode_file_parse(infile, category_to_harfbuzz)
47 ranges = sort_and_merge(ranges)
60 for (start, end, value) in ranges:
63 print >>outfile, 'static const unsigned category_properties_count = %d;\n' % len(ranges)
Dcombining-class-parse.py11 ranges = unicode_file_parse(infile, IdentityMap(), '0')
12 ranges = sort_and_merge(ranges)
24 for (start, end, value) in ranges:
27 print >>outfile, 'static const unsigned combining_properties_count = %d;\n' % len(ranges)

12345678910>>...16