orthanc: OrthancFramework/Sources/Toolbox.h comparison

cppcheck

author	Sebastien Jodogne <s.jodogne@gmail.com>
date	Mon, 25 Apr 2022 17:32:58 +0200
parents	96a3e81eba90
children	95d8e0540219

comparison

equal deleted inserted replaced

-:8b95fc86b8d9
+:d0c34145320c
 // returns true if all element of 'needles' are found in 'haystack'
 template <typename T> static bool IsSetInSet(const std::set<T>& needles, const std::set<T>& haystack)
 {
 for (typename std::set<T>::const_iterator it = needles.begin();
-it != needles.end(); it++)
+it != needles.end(); ++it)
 {
 if (haystack.count(*it) == 0)
 {
 return false;
 }
 template <typename T> static size_t GetMissingsFromSet(std::set<T>& missings, const std::set<T>& needles, const std::set<T>& haystack)
 {
 missings.clear();
 for (typename std::set<T>::const_iterator it = needles.begin();
-it != needles.end(); it++)
+it != needles.end(); ++it)
 {
 if (haystack.count(*it) == 0)
 {
 missings.insert(*it);
 }
 }
 template <typename T> static void AppendSets(std::set<T>& target, const std::set<T>& toAppend)
 {
 for (typename std::set<T>::const_iterator it = toAppend.begin();
-it != toAppend.end(); it++)
+it != toAppend.end(); ++it)
 {
 target.insert(*it);
 }
 }
 template <typename T> static void RemoveSets(std::set<T>& target, const std::set<T>& toRemove)
 {
 for (typename std::set<T>::const_iterator it = toRemove.begin();
-it != toRemove.end(); it++)
+it != toRemove.end(); ++it)
 {
 target.erase(*it);
 }
 }

Mercurial > hg > orthanc