X-Git-Url: http://git.salome-platform.org/gitweb/?a=blobdiff_plain;f=src%2FHEXABLOCK%2FHexDocument.cxx;h=b7ce32e6e5cbd04108b25c5dbd1738f008e1f98c;hb=76a04c833d6dbc5affe2455f372fb625050f5746;hp=9857797b36274001a3197e150131347adc385a02;hpb=995be63a665a1722037fe7f6ff649108d6905427;p=modules%2Fhexablock.git

diff --git a/src/HEXABLOCK/HexDocument.cxx b/src/HEXABLOCK/HexDocument.cxx
old mode 100755
new mode 100644
index 9857797..b7ce32e
--- a/src/HEXABLOCK/HexDocument.cxx
+++ b/src/HEXABLOCK/HexDocument.cxx
@@ -1,7 +1,7 @@
 
 // C++ : La clase principale de Hexa
 
-// Copyright (C) 2009-2014  CEA/DEN, EDF R&D
+// Copyright (C) 2009-2019  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
@@ -676,13 +676,13 @@ int Document::mergeVertices (Vertex* vpar, Vertex* vold)
       return ier;
       }
 
-   map <Quad*,   Quad*>   rep_quad;
-   map <Edge*,   Edge*>   rep_edge;
-   map <Vertex*, Vertex*> rep_vertex;
+   std::map <Quad*,   Quad*>   rep_quad;
+   std::map <Edge*,   Edge*>   rep_edge;
+   std::map <Vertex*, Vertex*> rep_vertex;
 
-   map <Quad*,   Quad*>   :: iterator itq;
-   map <Edge*,   Edge*>   :: iterator ited;
-   map <Vertex*, Vertex*> :: iterator itv;
+   std::map <Quad*,   Quad*>   :: iterator itq;
+   std::map <Edge*,   Edge*>   :: iterator ited;
+   std::map <Vertex*, Vertex*> :: iterator itv;
    
    rep_vertex [vold] = vpar;
    int nbparv  = vold->getNbrParents ();
@@ -726,9 +726,9 @@ int Document::mergeVertices (Vertex* vpar, Vertex* vold)
            }
        }
 
-   cout << " +++ Intersection : veq = "   << rep_vertex.size() 
-        << " " << rep_edge.size() <<  " " << rep_quad.size()
-        << endl;
+   std::cout << " +++ Intersection : veq = "   << rep_vertex.size() 
+	     << " " << rep_edge.size() <<  " " << rep_quad.size()
+	     << std::endl;
 
    for (itq=rep_quad.begin(); itq!=rep_quad.end() ; ++itq)
       {
@@ -875,7 +875,7 @@ Law* Document::findLaw (const char* name)
 {
    DumpStart ("findLaw", name);
 
-   string nom = name;
+   std::string nom = name;
    Law*   loi = NULL;
 
    for (int nro=0 ;loi==NULL &&  nro<nbr_laws; nro++)
@@ -1068,7 +1068,7 @@ int Document::setName (cpchar prefix)
        ier = HERR;
    else
        {
-       string name = prefix;
+       std::string name = prefix;
        if (hex_parent != NULL)
            hex_parent->makeName (prefix, name);
        el_name = name;
@@ -1124,7 +1124,7 @@ bool Document::isEmpty ()
    return nombre <= 0 && countLaw  () <= 1;
 }
 // ======================================================== getNextName
-cpchar Document::getNextName (EnumElt type, string& buff)
+cpchar Document::getNextName (EnumElt type, std::string& buff)
 {
    char name [8];
    EltBase::makeName (type, doc_nbr_elt [type], name);
@@ -1134,12 +1134,12 @@ cpchar Document::getNextName (EnumElt type, string& buff)
 }
 
 // ======================================================== getNextName
-string Document::getNextName (EnumElt type)
+std::string Document::getNextName (EnumElt type)
 {
    char name [8];
    EltBase::makeName (type, doc_nbr_elt [type], name);
 
-   return string(name);
+   return std::string(name);
 }
 
 // ======================================================== lockDump