-// Copyright (C) 2014-2017 CEA/DEN, EDF R&D
+// Copyright (C) 2014-2023 CEA/DEN, EDF R&D
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
-// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
-// See http://www.salome-platform.org/ or
-// email : webmaster.salome@opencascade.com<mailto:webmaster.salome@opencascade.com>
+// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
//
#ifndef ModuleBase_ITreeNode_H
#include <QIcon>
#include <QVariant>
+#ifdef _MSC_VER
+#pragma warning(disable: 4100)
+#endif
+
class ModuleBase_ITreeNode;
class ModuleBase_IWorkshop;
int aIdx;
int aCount = 0;
int aSize = myChildren.size();
+ int aMaxCount = aSize * aSize;
int aShift = 0;
while (i < aSize) {
aCount++;
+ // To avoid unlimited cycling
+ if (aCount > aMaxCount)
+ break;
+
aNode = myChildren.at(i);
aObject = aNode->object();
if (aObject.get()) {
else
aShift++;
i++;
- // To avoid unlimited cycling
- if (aCount > aSize * aSize)
- break;
}
}
}