X-Git-Url: https://git.creatis.insa-lyon.fr/pubgit/?a=blobdiff_plain;f=src%2FgdcmUtil.cxx;h=ec96d5321b2941bf1cdcbc611d448212c812464b;hb=e62d57cbd05c8e864fd2ba197a271cdcac9a2128;hp=c6a9d0365d3f24bd109a49ed64acd5da43632638;hpb=b9ab8805bd66e5fc6dc74788435df455899eb661;p=gdcm.git

diff --git a/src/gdcmUtil.cxx b/src/gdcmUtil.cxx
index c6a9d036..ec96d532 100644
--- a/src/gdcmUtil.cxx
+++ b/src/gdcmUtil.cxx
@@ -1,5 +1,21 @@
-// gdcmUtil.cxx
-//-----------------------------------------------------------------------------
+/*=========================================================================
+                                                                                
+  Program:   gdcm
+  Module:    $RCSfile: gdcmUtil.cxx,v $
+  Language:  C++
+  Date:      $Date: 2004/09/07 14:11:57 $
+  Version:   $Revision: 1.49 $
+                                                                                
+  Copyright (c) CREATIS (Centre de Recherche et d'Applications en Traitement de
+  l'Image). All rights reserved. See Doc/License.txt or
+  http://www.creatis.insa-lyon.fr/Public/Gdcm/License.htm for details.
+                                                                                
+     This software is distributed WITHOUT ANY WARRANTY; without even
+     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
+     PURPOSE.  See the above copyright notices for more information.
+                                                                                
+=========================================================================*/
+
 #include "gdcmUtil.h"
 #include "gdcmDebug.h"
 #include <stdio.h>
@@ -38,6 +54,29 @@ void Tokenize (const std::string& str,
    }
 }
 
+/**
+ * \ingroup Globals
+ * \brief Because not available in C++ (?)
+ *        Counts the number of occurences of a substring within a string
+ */
+ 
+ int CountSubstring (const std::string& str,
+                     const std::string& subStr) {
+   int count = 0;   // counts how many times it appears
+   unsigned int x = 0;       // The index position in the string
+
+   do
+    { x = str.find(subStr,x);       // Find the substring
+      if (x != std::string::npos)   // If present
+        { count++;                  // increase the count
+          x += subStr.length();     // Skip this word
+        }
+    }
+   while (x != std::string::npos);  // Carry on until not present
+
+   return count;
+}
+
 /**
  * \ingroup Globals
  * \brief  Weed out a string from the non-printable characters (in order
@@ -58,7 +97,7 @@ std::string CreateCleanString(std::string s) {
          if(s[str.size()-1]==0)
             str[str.size()-1]=' ';
 
-   return(str);
+   return str;
 }
 
 /**
@@ -86,13 +125,17 @@ void NormalizePath(std::string &name)
  */
 std::string GetPath(std::string &fullName)
 {
-   int pos1=fullName.rfind("/");
-   int pos2=fullName.rfind("\\");
-   if(pos1>pos2)
+   int pos1 = fullName.rfind("/");
+   int pos2 = fullName.rfind("\\");
+   if( pos1 > pos2)
+   {
       fullName.resize(pos1);
+   }
    else
+   {
       fullName.resize(pos2);
-   return(fullName);
+   }
+   return fullName;
 }
 
 /**
@@ -107,7 +150,7 @@ std::string GetName(std::string &fullName)
   if (a == '/' || a == '\\') {
      fin--;
   }
-  int deb;
+  int deb = 0;
   for (int i=fin;i!=0;i--) {
      if (fullName.c_str()[i] == '/' || fullName.c_str()[i] == '\\')  
         break;
@@ -118,5 +161,5 @@ std::string GetName(std::string &fullName)
   for (int j=deb;j<fin+1;j++)
     lastName=lastName+fullName.c_str()[j];
 
-  return(lastName);
+  return lastName;
 }