/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...] |
/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/i18n/ |
H A D | ucol_bld.h | 41 WeightRange ranges[7]; member in struct:__anon5344
|
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/net/disk_cache/ |
H A D | stats_histogram.cc | 66 Histogram::Sample StatsHistogram::ranges(size_t i) const { function in class:disk_cache::StatsHistogram
|
/external/webkit/Source/WebCore/css/ |
H A D | CSSFontFace.h | 53 const Vector<UnicodeRange>& ranges() const { return m_ranges; } function in class:WebCore::CSSFontFace
|
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/chromium/net/http/ |
H A D | http_util_unittest.cc | 657 std::vector<net::HttpByteRange> ranges; local 659 &ranges); 662 EXPECT_EQ(tests[i].expected_ranges_size, ranges.size()); 663 for (size_t j = 0; j < ranges.size(); ++j) { 665 ranges[j].first_byte_position()); 667 ranges[j].last_byte_position()); 669 ranges[j].suffix_length());
|
H A D | http_util.cc | 184 // ranges-specifier = byte-ranges-specifier 185 // byte-ranges-specifier = bytes-unit "=" byte-range-set 191 std::vector<HttpByteRange>* ranges) { 207 return ParseRangeHeader(ranges_specifier, ranges); 212 std::vector<HttpByteRange>* ranges) { 276 ranges->push_back(range); 278 return !ranges->empty(); 190 ParseRanges(const std::string& headers, std::vector<HttpByteRange>* ranges) argument 211 ParseRangeHeader(const std::string& ranges_specifier, std::vector<HttpByteRange>* ranges) argument
|
/external/icu4c/tools/toolutil/ |
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/openfst/src/lib/ |
H A D | symbol-table.cc | 135 static bool IsInRange(const vector<pair<int64, int64> >& ranges, argument 137 if (ranges.size() == 0) return true; 138 for (size_t i = 0; i < ranges.size(); ++i) { 139 if (key >= ranges[i].first && key <= ranges[i].second)
|
/external/webkit/Source/WebCore/svg/ |
H A D | SVGFontElement.cpp | 104 static bool stringMatchesUnicodeRange(const String& unicodeString, const UnicodeRanges& ranges, const HashSet<String>& unicodeValues) argument 109 if (!ranges.isEmpty()) { 111 const UnicodeRanges::const_iterator end = ranges.end(); 112 for (UnicodeRanges::const_iterator it = ranges.begin(); it != end; ++it) {
|
/external/chromium/chrome/browser/printing/ |
H A D | print_dialog_gtk.cc | 151 const printing::PageRanges& ranges) { 185 InitPrintSettings(ranges); 271 // Handle page ranges. 150 UpdateSettings(const DictionaryValue& settings, const printing::PageRanges& ranges) argument
|
/external/chromium/net/url_request/ |
H A D | url_request_file_job.cc | 286 std::vector<HttpByteRange> ranges; local 287 if (HttpUtil::ParseRangeHeader(range_header, &ranges)) { 288 if (ranges.size() == 1) { 289 byte_range_ = ranges[0];
|
/external/llvm/lib/DebugInfo/ |
H A D | DWARFDebugAranges.cpp | 37 AddArangeDescriptors(DWARFDebugAranges::RangeColl &ranges) argument 38 : RangeCollection(ranges) {} 135 // Most address ranges are contiguous from function to function 136 // so our new ranges will likely be smaller. We calculate the size 137 // of the new ranges since although std::vector objects can be resized,
|
/external/opencv/cv/src/ |
H A D | cvthresh.cpp | 336 float* ranges = _ranges; local 343 CV_CALL( hist = cvCreateHist( 1, &hist_size, CV_HIST_ARRAY, &ranges ));
|
H A D | cvmotempl.cpp | 299 float* ranges = _ranges; local 328 CV_CALL( hist = cvCreateHist( 1, &hist_size, CV_HIST_ARRAY, &ranges ));
|
/external/bluetooth/bluez/attrib/ |
H A D | gatt.c | 110 GSList *ranges, *last; local 121 ranges = dec_find_by_type_resp(ipdu, iplen); 122 if (ranges == NULL) 125 dp->primaries = g_slist_concat(dp->primaries, ranges); 127 last = g_slist_last(ranges);
|
H A D | gatttool.c | 158 static void primary_by_uuid_cb(GSList *ranges, guint8 status, argument 169 for (l = ranges; l; l = l->next) {
|
H A D | interactive.c | 172 static void primary_by_uuid_cb(GSList *ranges, guint8 status, argument 184 for (l = ranges; l; l = l->next) {
|
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | RangeConstraintManager.cpp | 72 /// RangeSet contains a set of ranges. If the set is empty, then 77 PrimRangeSet ranges; // no need to make const, since it is an member in class:__anon3503::RangeSet 84 RangeSet(PrimRangeSet RS) : ranges(RS) {} 86 iterator begin() const { return ranges.begin(); } 87 iterator end() const { return ranges.end(); } 89 bool isEmpty() const { return ranges.isEmpty(); } 93 : ranges(F.add(F.getEmptySet(), Range(from, to))) {} 97 void Profile(llvm::FoldingSetNodeID &ID) const { ranges.Profile(ID); } 103 return ranges.isSingleton() ? ranges [all...] |
/external/webkit/Source/WebCore/platform/graphics/gtk/ |
H A D | FontGtk.cpp | 294 int ranges[] = {start - utf8, end - utf8}; local 295 partialRegion = gdk_pango_layout_line_get_clip_region(layoutLine, 0, 0, ranges, 1);
|
/external/clang/lib/StaticAnalyzer/Checkers/ |
H A D | CheckSecuritySyntaxOnly.cpp | 274 SmallVector<SourceRange, 2> ranges; local 282 ranges.push_back(drCond->getSourceRange()); 283 ranges.push_back(drInc->getSourceRange()); 291 FSLoc, ranges.data(), ranges.size());
|
/external/webkit/Source/WebKit/chromium/src/ |
H A D | WebMediaPlayerClientImpl.cpp | 386 // FIXME: Save the time ranges in a member variable and update it when needed. 387 RefPtr<TimeRanges> ranges = TimeRanges::create(); local 389 ranges->add(webRanges[i].start, webRanges[i].end); 390 return ranges.release();
|