-// Copyright (C) 2007-2019 CEA/DEN, EDF R&D, OPEN CASCADE
+// Copyright (C) 2007-2021 CEA/DEN, EDF R&D, OPEN CASCADE
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
std::vector<DF_Attribute*> va = GetAttributes();
_node->_attributes.clear();
- for(int i = 0, len = va.size(); i<len; i++) {
+ for(size_t i = 0, len = va.size(); i<len; i++) {
va[i]->BeforeForget();
delete va[i];
}
sorted.push_back(p->first);
sort(sorted.begin(), sorted.end());
- int len = sorted.size();
- for(int i = 0; i<len; i++)
+ size_t len = sorted.size();
+ for(size_t i = 0; i<len; i++)
attributes.push_back(_node->_attributes[sorted[i]]);
return attributes;
for(AI p = _attributes.begin(); p!=_attributes.end(); p++)
va.push_back(p->second);
- for(int i = 0, len = va.size(); i<len; i++)
+ for(size_t i = 0, len = va.size(); i<len; i++)
delete va[i];
_attributes.clear();
for(AI p = _attributes.begin(); p!=_attributes.end(); p++)
va.push_back(p->second);
- for(int i = 0, len = va.size(); i<len; i++)
+ for(size_t i = 0, len = va.size(); i<len; i++)
delete va[i];
_attributes.clear();