| /external/chromium/chrome/browser/safe_browsing/ |
| 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[3].start(), 1138)
134 std::vector<ChunkRange> ranges; local
152 std::vector<ChunkRange> ranges; local
[all...] |
| chunk_range.cc | 55 void RangesToChunks(const std::vector<ChunkRange>& ranges,
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) {
95 if (ranges.empty())
99 int high = ranges.size() - 1
[all...] |
| 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/ |
| 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)
|
| 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)
|
| 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)
|
| 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)
|
| 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/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) {
|
| /external/icu4c/i18n/ |
| 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 The array of ranges that ucol_allocWeights() filled in
[all...] |
| ucol_wgt.cpp | 121 /* for uprv_sortArray: sort ranges in weight order */
139 * possible ranges of weights between the two limits, excluding them
140 * for weights with up to 4 bytes there are up to 2*4-1=7 ranges
145 WeightRange ranges[7]) {
185 * With the limit lengths of 1..4, there are up to 7 ranges for allocation:
195 * We are now going to calculate up to 7 ranges.
196 * Some of them will typically overlap, so we will then have to merge and eliminate ranges.
235 /* reduce or remove the lower ranges that go beyond upperLimit */
242 /* lower and upper ranges collide or are directly adjacent: merge these two and remove all shorter ranges */
[all...] |
| ucol_bld.h | 41 WeightRange ranges[7]; member in struct:__anon6272
|
| /external/chromium/base/metrics/ |
| 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(i))
[all...] |
| 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(i + 1), ranges(i))
912 std::vector<int> ranges = custom_ranges; local
[all...] |
| /external/webkit/Source/WebCore/dom/ |
| RangeException.idl | 20 module ranges {
|
| /libcore/luni/src/main/java/java/text/ |
| AttributedString.java | 162 private boolean inRange(List<Range> ranges) {
163 Iterator<Range> it = ranges.iterator();
197 List<Range> ranges = entry.getValue(); local
198 if (inRange(ranges)) {
206 private Object currentValue(List<Range> ranges) {
207 Iterator<Range> it = ranges.iterator();
223 ArrayList<Range> ranges = (ArrayList<Range>) attrString.attributeMap local
225 if (ranges == null) {
228 return currentValue(ranges);
253 private int runLimit(List<Range> ranges) {
276 ArrayList<Range> ranges = (ArrayList<Range>) attrString.attributeMap local
324 ArrayList<Range> ranges = (ArrayList<Range>) attrString.attributeMap local
556 ArrayList<Range> ranges = new ArrayList<Range>(1); local
584 List<Range> ranges = attributeMap.get(attribute); local
625 List<Range> ranges = attributeMap.get(attribute); local
[all...] |
| /external/clang/bindings/python/tests/cindex/ |
| test_diagnostics.py | 57 assert len(tu.diagnostics[0].ranges) == 1
58 assert tu.diagnostics[0].ranges[0].start.line == 1
59 assert tu.diagnostics[0].ranges[0].start.column == 20
60 assert tu.diagnostics[0].ranges[0].end.line == 1
61 assert tu.diagnostics[0].ranges[0].end.column == 27
63 tu.diagnostics[0].ranges[1].start.line
|
| /external/webkit/Source/WebCore/css/ |
| CSSSegmentedFontFace.cpp | 108 const Vector<CSSFontFace::UnicodeRange>& ranges = m_fontFaces[i]->ranges(); local
109 unsigned numRanges = ranges.size();
114 fontData->appendRange(FontDataRange(ranges[j].from(), ranges[j].to(), faceFontData));
|
| /external/pcre/ |
| pcre_scanner.cc | 164 void Scanner::GetComments(int start, int end, vector<StringPiece> *ranges) {
179 ranges->push_back(*it);
185 void Scanner::GetNextComments(vector<StringPiece> *ranges) {
194 ranges->push_back(*it);
|
| pcre_scanner.h | 136 // Append to vector ranges the comments found in the
141 void GetComments(int start, int end, std::vector<StringPiece> *ranges);
143 // Append to vector ranges the comments added
147 void GetNextComments(std::vector<StringPiece> *ranges);
|
| /libcore/luni/src/main/java/java/awt/font/ |
| NumericShaper.java | 110 /** The Constant ALL_RANGES indicates all ranges. */
115 * range constant value. Also script ranges, context names and digits low
116 * ranges are indexed with these indices.
200 * Scripts ranges array. Array represents ranges as pairs of
205 /** The scripts ranges. */
229 * Digit low ranges values decreased by 0x0030. Each low range
238 /** The digits low ranges. */
423 // ranges to be shaped
424 /** The ranges. *
[all...] |
| /external/llvm/lib/CodeGen/ |
| LiveInterval.cpp | 40 size_t Len = ranges.size();
53 Ranges::const_iterator r =
54 std::lower_bound(ranges.begin(), ranges.end(), End);
56 // Now r points to the first interval with start >= End, or ranges.end().
57 if (r == ranges.begin())
97 if (i != ranges.begin()) --i;
103 if (j != other.ranges.begin()) --j;
164 /// merge and eliminate all ranges that this will overlap with. The iterator is
166 void LiveInterval::extendIntervalEndTo(Ranges::iterator I, SlotIndex NewEnd)
[all...] |
| /external/chromium/net/disk_cache/ |
| stats_histogram.h | 43 virtual Sample ranges(size_t i) const;
|
| /external/freetype/src/autofit/ |
| aftypes.h | 212 * - A set of Unicode ranges to test whether the face supports the
318 #define AF_DEFINE_SCRIPT_CLASS( script_class, script_, ranges, m_size, \
324 ranges, \
342 #define AF_DEFINE_SCRIPT_CLASS( script_class, script_, ranges, m_size, \
348 ac->script_uni_ranges = ranges; \
|
| /external/webkit/Source/WebCore/svg/ |
| SVGFontElement.cpp | 104 static bool stringMatchesUnicodeRange(const String& unicodeString, const UnicodeRanges& ranges, const HashSet<String>& unicodeValues)
109 if (!ranges.isEmpty()) {
111 const UnicodeRanges::const_iterator end = ranges.end();
112 for (UnicodeRanges::const_iterator it = ranges.begin(); it != end; ++it) {
|
