| /external/chromium/chrome/browser/safe_browsing/ |
| D | chunk_range_unittest.cc | 92 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 …]
|
| D | chunk_range.cc | 55 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 …]
|
| D | chunk_range.h | 46 void RangesToChunks(const std::vector<ChunkRange>& ranges,
53 std::vector<ChunkRange>* ranges);
60 bool IsChunkInRange(int chunk_number, const std::vector<ChunkRange>& ranges);
|
| /external/icu4c/i18n/ |
| D | ucol_wgt.cpp | 158 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/base/metrics/ |
| D | histogram_unittest.cc | 160 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 …]
|
| D | histogram.cc | 122 DCHECK_GE(value, ranges(index)); in Add()
123 DCHECK_LT(value, ranges(index + 1)); in Add()
315 int new_range = ranges(index); in FindCorruption()
356 Histogram::Sample Histogram::ranges(size_t i) const { in ranges() function in base::Histogram
469 DCHECK_LE(ranges(0), value); in BucketIndex()
470 DCHECK_GT(ranges(bucket_count()), value); in BucketIndex()
480 if (ranges(mid) <= value) in BucketIndex()
486 DCHECK_LE(ranges(mid), value); in BucketIndex()
487 CHECK_GT(ranges(mid+1), value); in BucketIndex()
497 DCHECK_GT(ranges(i + 1), ranges(i)); in GetBucketSize()
[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/llvm/lib/CodeGen/ |
| D | LiveInterval.cpp | 40 size_t Len = ranges.size(); in find()
54 std::lower_bound(ranges.begin(), ranges.end(), End); in killedInRange()
57 if (r == ranges.begin()) in killedInRange()
97 if (i != ranges.begin()) --i; in overlapsFrom()
103 if (j != other.ranges.begin()) --j; in overlapsFrom()
167 assert(I != ranges.end() && "Not a valid interval!"); in extendIntervalEndTo()
172 for (; MergeTo != ranges.end() && NewEnd >= MergeTo->end; ++MergeTo) { in extendIntervalEndTo()
180 ranges.erase(llvm::next(I), MergeTo); in extendIntervalEndTo()
185 if (Next != ranges.end() && Next->start <= I->end && Next->valno == ValNo) { in extendIntervalEndTo()
187 ranges.erase(Next); in extendIntervalEndTo()
[all …]
|
| /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/harfbuzz/contrib/tables/ |
| D | category-parse.py | 46 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)
|
| D | combining-class-parse.py | 11 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)
|
| D | unicode_parse_common.py | 34 ranges = []
46 ranges.append((codepoints[0], codepoints[1], value))
50 return ranges
52 def sort_and_merge(ranges): argument
56 ranges.sort()
58 for v in ranges:
|
| D | scripts-parse.py | 49 ranges = unicode_file_parse(infile,
52 ranges = sort_and_merge(ranges)
65 for (start, end, value) in ranges:
68 print >>outfile, 'static const unsigned script_properties_count = %d;\n' % len(ranges)
|
| D | grapheme-break-parse.py | 21 ranges = unicode_file_parse(infile, property_to_harfbuzz)
22 ranges.sort()
35 for (start, end, value) in ranges:
38 print >>outfile, 'static const unsigned grapheme_break_properties_count = %d;\n' % len(ranges)
|
| /external/icu4c/tools/toolutil/ |
| D | denseranges.cpp | 101 int32_t ranges[][2], int32_t capacity) { in uprv_makeDenseRanges()
112 ranges[0][0]=minValue; in uprv_makeDenseRanges()
113 ranges[0][1]=maxValue; in uprv_makeDenseRanges()
149 ranges[0][0]=minValue; in uprv_makeDenseRanges()
153 ranges[i][1]=gapStart-1; in uprv_makeDenseRanges()
154 ranges[i+1][0]=minValue=(int32_t)(gapStart+gaps.gapLength(gapIndex)); in uprv_makeDenseRanges()
156 ranges[num-1][1]=maxValue; in uprv_makeDenseRanges()
|
| /external/clang/bindings/python/tests/cindex/ |
| D | test_diagnostics.py | 50 assert len(tu.diagnostics[0].ranges) == 1
51 assert tu.diagnostics[0].ranges[0].start.line == 1
52 assert tu.diagnostics[0].ranges[0].start.column == 20
53 assert tu.diagnostics[0].ranges[0].end.line == 1
54 assert tu.diagnostics[0].ranges[0].end.column == 27
56 tu.diagnostics[0].ranges[1].start.line
|
| /external/webkit/Source/WebCore/css/ |
| D | CSSSegmentedFontFace.cpp | 109 const Vector<CSSFontFace::UnicodeRange>& ranges = m_fontFaces[i]->ranges(); in getFontData() local
110 unsigned numRanges = ranges.size(); in getFontData()
115 … fontData->appendRange(FontDataRange(ranges[j].from(), ranges[j].to(), faceFontData)); in getFontData()
|
| /external/webkit/Source/JavaScriptCore/ |
| D | create_regex_tables | 41 ranges = [];
45 ranges.append((ord(_class), ord(_class)))
47 ranges.append((_class, _class))
55 ranges.append((min, 0x7f))
57 ranges.append((min,max))
58 ranges.sort();
63 for (min,max) in ranges:
98 for (min, max) in ranges:
|
| /external/llvm/include/llvm/CodeGen/ |
| D | LiveInterval.h | 184 Ranges ranges; // the ranges in which this register is live
202 iterator begin() { return ranges.begin(); }
203 iterator end() { return ranges.end(); }
206 const_iterator begin() const { return ranges.begin(); }
207 const_iterator end() const { return ranges.end(); }
245 ranges.clear();
328 bool empty() const { return ranges.empty(); }
333 return ranges.front().start;
340 return ranges.back().end;
440 addRangeFrom(LR, ranges.begin());
|
| /external/webkit/Source/JavaScriptCore/yarr/ |
| D | YarrPattern.cpp | 184 void addSortedRange(Vector<CharacterRange>& ranges, UChar lo, UChar hi) in addSortedRange() argument
186 unsigned end = ranges.size(); in addSortedRange()
192 if (hi < ranges[i].begin) { in addSortedRange()
194 if (hi == (ranges[i].begin - 1)) { in addSortedRange()
195 ranges[i].begin = lo; in addSortedRange()
198 ranges.insert(i, CharacterRange(lo, hi)); in addSortedRange()
204 if (lo <= (ranges[i].end + 1)) { in addSortedRange()
206 ranges[i].begin = std::min(ranges[i].begin, lo); in addSortedRange()
207 ranges[i].end = std::max(ranges[i].end, hi); in addSortedRange()
212 while (next < ranges.size()) { in addSortedRange()
[all …]
|
| /external/v8/src/ |
| D | jsregexp.cc | 1544 ZoneList<CharacterRange>* ranges = cc->ranges(); in EmitCharClass() local
1557 int range_count = ranges->length(); in EmitCharClass()
1561 CharacterRange& range = ranges->at(last_valid_range); in EmitCharClass()
1582 ranges->at(0).IsEverything(max_char)) { in EmitCharClass()
1601 CharacterRange& range = ranges->at(i); in EmitCharClass()
1624 CharacterRange& range = ranges->at(last_valid_range); in EmitCharClass()
2010 ZoneList<CharacterRange>* ranges = tree->ranges(); in GetQuickCheckDetails() local
2020 while (ranges->at(first_range).from() > char_mask) { in GetQuickCheckDetails()
2022 if (first_range == ranges->length()) { in GetQuickCheckDetails()
2028 CharacterRange range = ranges->at(first_range); in GetQuickCheckDetails()
[all …]
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| D | RangeConstraintManager.cpp | 77 PrimRangeSet ranges; // no need to make const, since it is an member in __anon631060c20211::RangeSet
84 RangeSet(PrimRangeSet RS) : ranges(RS) {} in RangeSet()
86 iterator begin() const { return ranges.begin(); } in begin()
87 iterator end() const { return ranges.end(); } in end()
89 bool isEmpty() const { return ranges.isEmpty(); } in isEmpty()
93 : ranges(F.add(F.getEmptySet(), Range(from, to))) {} in RangeSet()
97 void Profile(llvm::FoldingSetNodeID &ID) const { ranges.Profile(ID); } in Profile()
103 return ranges.isSingleton() ? ranges.begin()->getConcreteValue() : 0; in getConcreteValue()
188 return ranges == other.ranges; in operator ==()
|
| /external/v8/test/mjsunit/regress/ |
| D | regress-1199401.js | 31 var ranges = [{min: -1073741824, max: 1073741823, bits: 31}, variable
34 for (var i = 0; i < ranges.length; i++) {
35 var range = ranges[i];
|