/external/chromium/chrome/browser/safe_browsing/ |
H A D | chunk_range_unittest.cc | 5 // Test program to convert lists of integers into ranges, and vice versa. 42 // Test no chunk numbers in contiguous ranges. 92 std::vector<ChunkRange> ranges; local 95 EXPECT_TRUE(StringToRanges(input, &ranges)); 96 EXPECT_EQ(ranges.size(), static_cast<size_t>(5)); 97 EXPECT_EQ(ranges[0].start(), 1); 98 EXPECT_EQ(ranges[0].stop(), 100); 99 EXPECT_EQ(ranges[1].start(), 398); 100 EXPECT_EQ(ranges[1].stop(), 398); 101 EXPECT_EQ(ranges[ 134 std::vector<ChunkRange> ranges; local 152 std::vector<ChunkRange> ranges; local [all...] |
H A D | chunk_range.cc | 55 void RangesToChunks(const std::vector<ChunkRange>& ranges, argument 58 for (size_t i = 0; i < ranges.size(); ++i) { 59 const ChunkRange& range = ranges[i]; 67 std::vector<ChunkRange>* ranges) { 68 DCHECK(ranges); 84 ranges->clear(); 87 ranges->push_back(ChunkRange(start, stop)); 94 bool IsChunkInRange(int chunk_number, const std::vector<ChunkRange>& ranges) { argument 95 if (ranges.empty()) 99 int high = ranges 66 StringToRanges(const std::string& input, std::vector<ChunkRange>* ranges) argument [all...] |
H A D | chunk_range.h | 5 // Class for parsing lists of integers into ranges. 8 // and ranges of numbers corresponding to chunks of whitelists and blacklists. 45 // Convert a set of ranges into individual chunk numbers. 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/harfbuzz/contrib/tables/ |
H A 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)
|
H A 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)
|
H A 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)
|
H A 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)
|
H A D | unicode_parse_common.py | 34 ranges = [] 46 ranges.append((codepoints[0], codepoints[1], value)) 50 return ranges 52 def sort_and_merge(ranges): 53 '''Given a list of (start, end, value), merge elements where the ranges are 56 ranges.sort() 58 for v in ranges:
|
/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/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/icu4c/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/icu4c/i18n/ |
H A D | ucol_wgt.h | 35 * what ranges to use for a given number of weights between (excluding) 38 * @param lowerLimit A collation element weight; the ranges will be filled to cover 40 * @param upperLimit A collation element weight; the ranges will be filled to cover 45 * @param ranges An array that is filled in with one or more ranges to cover 47 * @return number of ranges, 0 if it is not possible to fit n elements between the limits 53 WeightRange ranges[7]); 56 * Given a set of ranges calculated by ucol_allocWeights(), 58 * The ranges are modified to keep the current iteration state. 60 * @param ranges Th [all...] |
H A D | ucol_wgt.cpp | 134 /* for uprv_sortArray: sort ranges in weight order */ 152 * possible ranges of weights between the two limits, excluding them 153 * for weights with up to 4 bytes there are up to 2*4-1=7 ranges 158 WeightRange ranges[7]) { 198 * With the limit lengths of 1..4, there are up to 7 ranges for allocation: 208 * We are now going to calculate up to 7 ranges. 209 * Some of them will typically overlap, so we will then have to merge and eliminate ranges. 248 /* reduce or remove the lower ranges that go beyond upperLimit */ 255 /* lower and upper ranges collide or are directly adjacent: merge these two and remove all shorter ranges */ 156 getWeightRanges(uint32_t lowerLimit, uint32_t upperLimit, uint32_t maxByte, uint32_t countBytes, WeightRange ranges[7]) argument 318 ucol_allocWeights(uint32_t lowerLimit, uint32_t upperLimit, uint32_t n, uint32_t maxByte, WeightRange ranges[7]) argument 498 ucol_nextWeight(WeightRange ranges[], int32_t *pRangeCount) argument [all...] |
H A D | ucol_bld.h | 41 WeightRange ranges[7]; member in struct:__anon5885
|
/external/chromium/base/metrics/ |
H A D | histogram_unittest.cc | 160 EXPECT_EQ(0, histogram->ranges(0)); 163 EXPECT_EQ(power_of_2, histogram->ranges(i)); 166 EXPECT_EQ(INT_MAX, histogram->ranges(8)); 173 EXPECT_EQ(i, short_histogram->ranges(i)); 174 EXPECT_EQ(INT_MAX, short_histogram->ranges(8)); 178 // We also get a nice linear set of bucket ranges when we ask for it 180 EXPECT_EQ(i, linear_histogram->ranges(i)); 181 EXPECT_EQ(INT_MAX, linear_histogram->ranges(8)); 185 // ...but when the list has more space, then the ranges naturally spread out. 187 EXPECT_EQ(2 * i, linear_broad_histogram->ranges( [all...] |
H A D | histogram.cc | 122 DCHECK_GE(value, ranges(index)); 123 DCHECK_LT(value, ranges(index + 1)); 315 int new_range = ranges(index); 356 Histogram::Sample Histogram::ranges(size_t i) const { function in class:base::Histogram 469 DCHECK_LE(ranges(0), value); 470 DCHECK_GT(ranges(bucket_count()), value); 480 if (ranges(mid) <= value) 486 DCHECK_LE(ranges(mid), value); 487 CHECK_GT(ranges(mid+1), value); 497 DCHECK_GT(ranges( 912 std::vector<int> ranges = custom_ranges; local [all...] |
/external/webkit/Source/WebCore/dom/ |
H A D | RangeException.idl | 20 module ranges {
|
/external/clang/bindings/python/tests/cindex/ |
H A 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/ |
H A D | CSSSegmentedFontFace.cpp | 109 const Vector<CSSFontFace::UnicodeRange>& ranges = m_fontFaces[i]->ranges(); local 110 unsigned numRanges = ranges.size(); 115 fontData->appendRange(FontDataRange(ranges[j].from(), ranges[j].to(), faceFontData));
|
/external/llvm/lib/CodeGen/ |
H A D | LiveInterval.cpp | 41 size_t Len = ranges.size(); 58 ranges.push_back(LiveRange(Def, Def.getDeadSlot(), VNI)); 68 ranges.insert(I, LiveRange(Def, Def.getDeadSlot(), VNI)); 75 std::lower_bound(ranges.begin(), ranges.end(), End); 77 // Now r points to the first interval with start >= End, or ranges.end(). 78 if (r == ranges.begin()) 118 if (i != ranges.begin()) --i; 124 if (j != other.ranges.begin()) --j; 227 /// merge and eliminate all ranges tha [all...] |
/external/v8/test/mjsunit/regress/ |
H A D | regress-1199401.js | 30 // Possible Smi ranges. 31 var ranges = [{min: -1073741824, max: 1073741823, bits: 31}, 34 for (var i = 0; i < ranges.length; i++) { 35 var range = ranges[i];
|
/external/chromium/net/disk_cache/ |
H A D | stats_histogram.h | 43 virtual Sample ranges(size_t i) const;
|