mirror of
https://github.com/VectorCamp/vectorscan.git
synced 2025-09-30 19:47:43 +03:00
Merge pull request #283 from isildur-g/wip-cppcheck271-part2
Wip cppcheck271 useStlAlgorithm part2
This commit is contained in:
@@ -358,9 +358,8 @@ public:
|
||||
// Return the number of bytes scanned
|
||||
size_t bytes() const {
|
||||
size_t sum = 0;
|
||||
for (const auto &packet : packets) {
|
||||
sum += packet.size();
|
||||
}
|
||||
auto packs = [](size_t z, const string &packet) { return z + packet.size(); };
|
||||
sum += std::accumulate(packets.begin(), packets.end(), 0, packs);
|
||||
return sum;
|
||||
}
|
||||
|
||||
@@ -460,9 +459,8 @@ public:
|
||||
// dynamic storage.)
|
||||
vector<const char *> cstrPatterns;
|
||||
cstrPatterns.reserve(patterns.size());
|
||||
for (const auto &pattern : patterns) {
|
||||
cstrPatterns.push_back(pattern.c_str());
|
||||
}
|
||||
auto pstr = [](const string &pattern) { return pattern.c_str(); };
|
||||
std::transform(patterns.begin(), patterns.end(), std::back_inserter(cstrPatterns), pstr);
|
||||
|
||||
Clock clock;
|
||||
clock.start();
|
||||
|
@@ -55,6 +55,7 @@
|
||||
#include <fstream>
|
||||
#include <iomanip>
|
||||
#include <iostream>
|
||||
#include <numeric>
|
||||
#include <string>
|
||||
#include <unordered_map>
|
||||
#include <vector>
|
||||
@@ -249,9 +250,8 @@ public:
|
||||
// Return the number of bytes scanned
|
||||
size_t bytes() const {
|
||||
size_t sum = 0;
|
||||
for (const auto &packet : packets) {
|
||||
sum += packet.size();
|
||||
}
|
||||
auto packs = [](size_t z, const string &packet) { return z + packet.size(); };
|
||||
sum += std::accumulate(packets.begin(), packets.end(), 0, packs);
|
||||
return sum;
|
||||
}
|
||||
|
||||
@@ -432,6 +432,7 @@ static void databasesFromFile(const char *filename,
|
||||
// storage.)
|
||||
vector<const char*> cstrPatterns;
|
||||
for (const auto &pattern : patterns) {
|
||||
// cppcheck-suppress useStlAlgorithm
|
||||
cstrPatterns.push_back(pattern.c_str());
|
||||
}
|
||||
|
||||
|
Reference in New Issue
Block a user