Program: gdcm
Module: $RCSfile: gdcmUtil.cxx,v $
Language: C++
- Date: $Date: 2004/10/09 02:57:12 $
- Version: $Revision: 1.52 $
+ Date: $Date: 2004/11/05 20:23:14 $
+ Version: $Revision: 1.60 $
Copyright (c) CREATIS (Centre de Recherche et d'Applications en Traitement de
l'Image). All rights reserved. See Doc/License.txt or
#include "gdcmUtil.h"
#include "gdcmDebug.h"
+#include <stdarg.h> //only included in implementation file
+#include <stdio.h> //only included in implementation file
+
+namespace gdcm
+{
/**
* \ingroup Globals
* << std::hex << element;
* buf.str();
*/
-#include <stdarg.h> //only included in implementation file
-#include <stdio.h> //only included in implementation file
-std::string Format(const char* format, ...)
+std::string Util::Format(const char* format, ...)
{
char buffer[2048];
va_list args;
* \ingroup Globals
* \brief Because not available in C++ (?)
*/
-void Tokenize (const std::string& str,
- std::vector<std::string>& tokens,
- const std::string& delimiters)
+void Util::Tokenize (const std::string& str,
+ std::vector<std::string>& tokens,
+ const std::string& delimiters)
{
std::string::size_type lastPos = str.find_first_not_of(delimiters,0);
std::string::size_type pos = str.find_first_of (delimiters,lastPos);
* Counts the number of occurences of a substring within a string
*/
-int CountSubstring (const std::string& str,
- const std::string& subStr)
+int Util::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
* to avoid corrupting the terminal of invocation when printing)
* @param s string to remove non printable characters from
*/
-std::string CreateCleanString(std::string s)
+std::string Util::CreateCleanString(std::string const & s)
{
std::string str = s;
* \brief Add a SEPARATOR to the end of the name is necessary
* @param name file/directory name to normalize
*/
-void NormalizePath(std::string &name)
+std::string Util::NormalizePath(std::string const & pathname)
{
const char SEPARATOR_X = '/';
const char SEPARATOR_WIN = '\\';
const std::string SEPARATOR = "/";
+ std::string name = pathname;
int size = name.size();
- if((name[size-1]!=SEPARATOR_X)&&(name[size-1]!=SEPARATOR_WIN))
+ if( name[size-1] != SEPARATOR_X && name[size-1] != SEPARATOR_WIN )
{
- name+=SEPARATOR;
+ name += SEPARATOR;
}
+ return name;
}
/**
* \brief Get the (directory) path from a full path file name
* @param fullName file/directory name to extract Path from
*/
-std::string GetPath(std::string &fullName)
+std::string Util::GetPath(std::string const & fullName)
{
- int pos1 = fullName.rfind("/");
- int pos2 = fullName.rfind("\\");
+ std::string res = fullName;
+ int pos1 = res.rfind("/");
+ int pos2 = res.rfind("\\");
if( pos1 > pos2)
{
- fullName.resize(pos1);
+ res.resize(pos1);
}
else
{
- fullName.resize(pos2);
+ res.resize(pos2);
}
- return fullName;
+ return res;
}
/**
- * \ingroup Globals
+ * \ingroup Util
* \brief Get the (last) name of a full path file name
* @param fullName file/directory name to extract end name from
*/
-std::string GetName(std::string &fullName)
+std::string Util::GetName(std::string const & fullName)
{
- int fin = fullName.length()-1;
- char a =fullName.c_str()[fin];
- if (a == '/' || a == '\\')
- {
- fin--;
- }
- int deb = 0;
- for (int i=fin;i!=0;i--)
- {
- if (fullName.c_str()[i] == '/' || fullName.c_str()[i] == '\\')
- {
- break;
- }
- deb = i;
- }
+ std::string filename = fullName;
- std::string lastName;
- for (int j=deb;j<fin+1;j++)
+ std::string::size_type slash_pos = filename.rfind("/");
+ std::string::size_type backslash_pos = filename.rfind("\\");
+ slash_pos = slash_pos > backslash_pos ? slash_pos : backslash_pos;
+ if(slash_pos != std::string::npos)
+ {
+ return filename.substr(slash_pos + 1);
+ }
+ else
+ {
+ return filename;
+ }
+}
+
+/**
+ * \ingroup Util
+ * \brief Create a /DICOM/ string:
+ * It should a of even lenght (no odd length ever)
+ * It can contains as many \0 as you want.
+ * This function is similar to DicomString(const char*),
+ * except it doesn't take a lenght.
+ * It only pad with a null character if length is odd
+ */
+std::string Util::DicomString(const char* s)
+{
+ size_t l = strlen(s);
+ if( l%2 )
{
- lastName=lastName+fullName.c_str()[j];
+ l++;
}
+ std::string r(s, s+l);
+ assert( !(r.size() % 2) );
+ return r;
+}
+
+/**
+ * \ingroup Util
+ * \brief Create a /DICOM/ string:
+ * It should a of even length (no odd length ever)
+ * It can contains as many \0 as you want.
+ */
+std::string Util::DicomString(const char* s, size_t l)
+{
+ std::string r(s, s+l);
+ assert( !(r.size() % 2) );
+ return r;
+}
+
+template <class T>
+std::ostream& binary_write(std::ostream& os, const T& val)
+{
+ return os.write(reinterpret_cast<const char*>(&val), sizeof val);
+}
+
+std::ostream& binary_write(std::ostream& os, const uint16_t& val)
+{
+#ifdef GDCM_WORDS_BIGENDIAN
+ uint16_t swap;
+ swap = ((( val << 8 ) & 0x0ff00 ) | (( val >> 8 ) & 0x00ff ) );
+ return os.write(reinterpret_cast<const char*>(&swap), 2);
+#else
+ return os.write(reinterpret_cast<const char*>(&val), 2);
+#endif //GDCM_WORDS_BIGENDIAN
+}
+
+std::ostream& binary_write(std::ostream& os, const uint32_t& val)
+{
+#ifdef GDCM_WORDS_BIGENDIAN
+ uint32_t swap;
+ swap = ( ((val<<24) & 0xff000000) | ((val<<8) & 0x00ff0000) |
+ ((val>>8) & 0x0000ff00) | ((val>>24) & 0x000000ff) );
+ return os.write(reinterpret_cast<const char*>(&swap), 4);
+#else
+ return os.write(reinterpret_cast<const char*>(&val), 4);
+#endif //GDCM_WORDS_BIGENDIAN
+}
+
+//template <>
+std::ostream& binary_write(std::ostream& os, const char* val)
+{
+ return os.write(val, strlen(val));
+}
+
+std::ostream& binary_write(std::ostream& os, std::string const & val)
+{
+ return os.write(val.c_str(), val.size());
+}
+
+
+} // end namespace gdcm
- return lastName;
-}