github_mirrors/vectorscan
3
0
Fork 1
mirror of https://github.com/VectorCamp/vectorscan.git synced 2025-06-28 16:41:01 +03:00
Code Issues Packages Projects Releases Wiki Activity

cppcheck suppress useStlAlgorithm

Browse Source
This commit is contained in:
gtsoul-tech 2024-11-08 16:06:54 +02:00
parent c30575df42
commit be0a86e78f
1 changed files with 2 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
src/nfagraph/ng_literal_analysis.cpp
View File

@ -262,6 +262,7 @@ static
bool hasSuffixLiterals(const set<ue2_literal> &s) { bool hasSuffixLiterals(const set<ue2_literal> &s) {
for (auto it = s.begin(), ite = s.end(); it != ite; ++it) { for (auto it = s.begin(), ite = s.end(); it != ite; ++it) {
for (auto jt = std::next(it); jt != ite; ++jt) { for (auto jt = std::next(it); jt != ite; ++jt) {
// cppcheck-suppress useStlAlgorithm
if (isSuffix(*it, *jt) || isSuffix(*jt, *it)) { if (isSuffix(*it, *jt) || isSuffix(*jt, *it)) {
DEBUG_PRINTF("'%s' and '%s' have suffix issues\n", DEBUG_PRINTF("'%s' and '%s' have suffix issues\n",
dumpString(*it).c_str(), dumpString(*it).c_str(),
@ -530,7 +531,7 @@ void findMinCut(LitGraph &lg, vector<LitEdge> &cutset) {
vector<s32> distances(num_verts); vector<s32> distances(num_verts);
vector<LitEdge> predecessors(num_verts); vector<LitEdge> predecessors(num_verts);
vector<u64a> residuals(num_edges(lg)); vector<u64a> residuals(num_edges(lg));
//cppcheck-suppress unreadVariable
UNUSED u64a flow = boykov_kolmogorov_max_flow(lg, UNUSED u64a flow = boykov_kolmogorov_max_flow(lg,
get(&LitGraphEdgeProps::score, lg), get(&LitGraphEdgeProps::score, lg),
make_iterator_property_map(residuals.begin(), e_index_map), make_iterator_property_map(residuals.begin(), e_index_map),