-// Copyright (C) 2007-2008 CEA/DEN, EDF R&D
+// Copyright (C) 2007-2015 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
-// License as published by the Free Software Foundation; either
-// version 2.1 of the License.
+// This library is free software; you can redistribute it and/or
+// modify it under the terms of the GNU Lesser General Public
+// License as published by the Free Software Foundation; either
+// version 2.1 of the License, or (at your option) any later version.
//
-// This library is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-// Lesser General Public License for more details.
+// This library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+// Lesser General Public License for more details.
//
-// 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
+// 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
//
-// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
+// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
//
+
#ifndef __EXPLICITMAPPING_HXX__
#define __EXPLICITMAPPING_HXX__
_comm_buffer=new int[_mapping.size()*2];
std::vector<int> offsets(_distant_domains.size());
offsets[0]=0;
- for (int i=1; i<_distant_domains.size();i++)
+ for (int i=1; i<(int)_distant_domains.size();i++)
offsets[i]=offsets[i-1]+_numbers[i-1];
- for (int i=0; i< _mapping.size(); i++)
+ for (int i=0; i<(int)_mapping.size(); i++)
{
int offset= offsets[_mapping[i].first];
_comm_buffer[offset*2]=idproc;
{
_numbers=new int[nbDistantDomains()];
_domains=new int[nbDistantDomains()];
- for (int i=0; i< _mapping.size(); i++)
+ for (int i=0; i<(int)_mapping.size(); i++)
{
if ( counts.find(_mapping[i].first) == counts.end())
counts.insert(std::make_pair(_mapping[i].first,1));