/external/chromium_org/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. 44 // Convert a set of ranges into individual chunk numbers. 45 void RangesToChunks(const std::vector<ChunkRange>& ranges, 52 std::vector<ChunkRange>* ranges); 59 bool IsChunkInRange(int chunk_number, const std::vector<ChunkRange>& ranges);
|
/external/chromium_org/base/metrics/ |
H A D | bucket_ranges_unittest.cc | 13 BucketRanges ranges(5); 14 ASSERT_EQ(5u, ranges.size()); 15 ASSERT_EQ(4u, ranges.bucket_count()); 18 EXPECT_EQ(0, ranges.range(i)); 20 EXPECT_EQ(0u, ranges.checksum()); 22 ranges.set_range(3, 100); 23 EXPECT_EQ(100, ranges.range(3)); 27 // Compare empty ranges. 36 // Compare full filled ranges. 59 BucketRanges ranges( [all...] |
H A D | sample_vector_unittest.cc | 20 BucketRanges ranges(3); 21 ranges.set_range(0, 1); 22 ranges.set_range(1, 5); 23 ranges.set_range(2, 10); 24 SampleVector samples(&ranges); 47 BucketRanges ranges(5); 48 ranges.set_range(0, 0); 49 ranges.set_range(1, 1); 50 ranges.set_range(2, 2); 51 ranges [all...] |
/external/chromium_org/tools/gn/ |
H A D | substitution_pattern_unittest.cc | 14 ASSERT_EQ(1u, pattern.ranges().size()); 15 EXPECT_EQ(SUBSTITUTION_LITERAL, pattern.ranges()[0].type); 16 EXPECT_EQ("This is a literal", pattern.ranges()[0].literal); 25 ASSERT_EQ(5u, pattern.ranges().size()); 27 EXPECT_EQ(SUBSTITUTION_LITERAL, pattern.ranges()[0].type); 28 EXPECT_EQ("AA", pattern.ranges()[0].literal); 29 EXPECT_EQ(SUBSTITUTION_SOURCE, pattern.ranges()[1].type); 30 EXPECT_EQ(SUBSTITUTION_SOURCE_NAME_PART, pattern.ranges()[2].type); 31 EXPECT_EQ(SUBSTITUTION_LITERAL, pattern.ranges()[3].type); 32 EXPECT_EQ("BB", pattern.ranges()[ [all...] |
/external/chromium_org/third_party/WebKit/Source/core/html/ |
H A D | TimeRangesTest.cpp | 41 static std::string ToString(const TimeRanges& ranges) argument 45 for (unsigned i = 0; i < ranges.length(); ++i) 46 ss << " [" << ranges.start(i, IGNORE_EXCEPTION) << "," << ranges.end(i, IGNORE_EXCEPTION) << ")"; 95 RefPtrWillBeRawPtr<TimeRanges> ranges = TimeRanges::create(); local 97 ranges->add(0, 2); 98 ranges->add(10, 11); 99 ASSERT_RANGE("{ [0,2) [10,11) }", ranges); 101 ranges->add(0, 2); 102 ASSERT_RANGE("{ [0,2) [10,11) }", ranges); 125 RefPtrWillBeRawPtr<TimeRanges> ranges = TimeRanges::create(0, 2); local 304 RefPtrWillBeRawPtr<TimeRanges> ranges = TimeRanges::create(); local [all...] |
/external/chromium_org/printing/ |
H A D | page_range_unittest.cc | 9 printing::PageRanges ranges; local 13 ranges.push_back(range); 16 ranges.push_back(range); 19 ranges.push_back(range); 20 std::vector<int> pages(printing::PageRange::GetPages(ranges)); 33 printing::PageRanges ranges; local 34 std::vector<int> pages(printing::PageRange::GetPages(ranges)); 39 printing::PageRanges ranges; local 43 ranges.push_back(range); 44 std::vector<int> pages(printing::PageRange::GetPages(ranges)); [all...] |
H A D | page_range.cc | 16 std::vector<int> PageRange::GetPages(const PageRanges& ranges) { argument 19 for (unsigned i = 0; i < ranges.size(); ++i) { 20 const PageRange& range = ranges[i];
|
/external/chromium_org/third_party/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...] |
/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...] |
/external/valgrind/main/coregrind/ |
H A D | m_rangemap.c | 54 XArray* ranges; member in struct:_RangeMap 78 rm->ranges = VG_(newXA)( alloc_fn, cc, free_fn, sizeof(Range) ); 79 vg_assert(rm->ranges); 85 Word i = VG_(addToXA)(rm->ranges, &r); 87 vg_assert(VG_(sizeXA)(rm->ranges) == 1); 96 vg_assert(rm->ranges); 97 VG_(deleteXA)(rm->ranges); 112 Range* rng = VG_(indexXA)(rm->ranges, i); 122 Range* rng = (Range*)VG_(indexXA)(rm->ranges, i); 130 vg_assert(rm && rm->ranges); 149 XArray* ranges = rm->ranges; local 165 XArray* ranges = rm->ranges; local 188 XArray* ranges = rm->ranges; local [all...] |
/external/chromium_org/third_party/WebKit/Source/core/css/ |
H A D | CSSFontFaceTest.cpp | 16 Vector<CSSFontFace::UnicodeRange> ranges; local 17 CSSFontFace::UnicodeRangeSet set(ranges); 27 Vector<CSSFontFace::UnicodeRange> ranges; local 28 ranges.append(CSSFontFace::UnicodeRange('b', 'b')); 29 CSSFontFace::UnicodeRangeSet set(ranges); 44 Vector<CSSFontFace::UnicodeRange> ranges; local 45 ranges.append(CSSFontFace::UnicodeRange('6', '7')); 46 ranges.append(CSSFontFace::UnicodeRange('2', '4')); 47 CSSFontFace::UnicodeRangeSet set(ranges); 67 Vector<CSSFontFace::UnicodeRange> ranges; local 80 Vector<CSSFontFace::UnicodeRange> ranges; local [all...] |
/external/chromium_org/tools/deep_memory_profiler/tests/ |
H A D | range_dict_tests.py | 41 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 [all...] |
/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/chromium_org/third_party/icu/source/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);
|
/external/icu/icu4c/source/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);
|
/external/chromium_org/third_party/icu/source/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...] |
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/cm/ |
H A D | closebrackets.js | 44 var ranges = cm.listSelections(); 45 for (var i = 0; i < ranges.length; i++) { 46 if (!ranges[i].empty()) return CodeMirror.Pass; 47 var around = charsAround(cm, ranges[i].head); 50 for (var i = ranges.length - 1; i >= 0; i--) { 51 var cur = ranges[i].head; 61 var ranges = cm.listSelections(), type, next; 62 for (var i = 0; i < ranges.length; i++) { 63 var range = ranges[i], cur = range.head, curType; 109 var ranges [all...] |
/external/icu/icu4c/source/i18n/ |
H A D | collationweights.cpp | 192 /* for uprv_sortArray: sort ranges in weight order */ 248 * With the limit lengths of 1..4, there are up to 7 ranges for allocation: 258 * We are now going to calculate up to 7 ranges. 259 * Some of them will typically overlap, so we will then have to merge and eliminate ranges. 300 /* reduce or remove the lower ranges that go beyond upperLimit */ 307 /* lower and upper ranges collide or are directly adjacent: merge these two and remove all shorter ranges */ 311 * merging directly adjacent ranges needs to subtract the 0/1 gaps in between; 328 /* print ranges */ 344 /* copy the ranges, shortes [all...] |
/external/compiler-rt/test/msan/ |
H A D | ifaddrs.cc | 18 ranges.push_back(std::make_pair((void *)addr, (size_t)size)); \ 34 std::vector<std::pair<void *, size_t> > ranges; local 47 for (int i = 0; i < ranges.size(); i++) 48 assert(0 == __msan_test_shadow(ranges[i].first, ranges[i].second));
|
/external/chromium_org/content/browser/resources/media/ |
H A D | disjoint_range_set.js | 8 * This class represents a collection of non-intersecting ranges. Ranges 25 * Deletes all ranges intersecting with (start ... end) and returns the 29 * @param {int} sloppiness 0 removes only strictly overlapping ranges, and 34 var ranges = this.ranges_; 43 delete ranges[rangeStart]; 54 * Joins adjacent and overlapping ranges together. 62 // Remove all touching ranges. 70 * @param {DisjointRangeSet} ranges A DisjointRangeSet to be squished into 74 var ranges = this; 75 other.forEach(function(start, end) { ranges [all...] |