--- trunk/src/utils/StringUtils.hpp 2004/09/24 04:16:43 2 +++ branches/development/src/utils/StringUtils.hpp 2013/02/20 15:39:39 1850 @@ -1,9 +1,179 @@ -#ifndef _STRINGUTILS_HPP_ -#define _STRINGUTILS_HPP_ +/* + * Copyright (c) 2005 The University of Notre Dame. All Rights Reserved. + * + * The University of Notre Dame grants you ("Licensee") a + * non-exclusive, royalty free, license to use, modify and + * redistribute this software in source and binary code form, provided + * that the following conditions are met: + * + * 1. Redistributions of source code must retain the above copyright + * notice, this list of conditions and the following disclaimer. + * + * 2. Redistributions in binary form must reproduce the above copyright + * notice, this list of conditions and the following disclaimer in the + * documentation and/or other materials provided with the + * distribution. + * + * This software is provided "AS IS," without a warranty of any + * kind. All express or implied conditions, representations and + * warranties, including any implied warranty of merchantability, + * fitness for a particular purpose or non-infringement, are hereby + * excluded. The University of Notre Dame and its licensors shall not + * be liable for any damages suffered by licensee as a result of + * using, modifying or distributing the software or its + * derivatives. In no event will the University of Notre Dame or its + * licensors be liable for any lost revenue, profit or data, or for + * direct, indirect, special, consequential, incidental or punitive + * damages, however caused and regardless of the theory of liability, + * arising out of the use of or inability to use software, even if the + * University of Notre Dame has been advised of the possibility of + * such damages. + * + * SUPPORT OPEN SCIENCE! If you use OpenMD or its source code in your + * research, please cite the appropriate papers when you publish your + * work. Good starting points are: + * + * [1] Meineke, et al., J. Comp. Chem. 26, 252-271 (2005). + * [2] Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006). + * [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 234107 (2008). + * [4] Kuang & Gezelter, J. Chem. Phys. 133, 164101 (2010). + * [5] Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011). + */ + +/** + * @file StringUtils.hpp + * @author Dan Gezelter + * @date 10/18/2004 + * @version 1.0 + */ + +#ifndef UTILS_STRINGUTILS_HPP +#define UTILS_STRINGUTILS_HPP #include +#include +#include +#include +#include -using namespace std; -string UpperCase(const string& S); -string LowerCase(const string& S); +namespace OpenMD { + + /** + * Converts a string to UPPER CASE + * @param S + */ + std::string UpperCase(const std::string& S); + /** + * Converts a string to lower case + * @param S + */ + std::string LowerCase(const std::string& S); + + /** + * Removes left and right spaces from a string + * + * @param str String to trim + * + * @return char* to the trimed string + */ + char* trimSpaces(char *str); + + /** + * Finds the location of the string "begin " in an input stream. + * @param theStream + * @param startText + * + * @return the line number of the block within the theStream + */ + int findBegin(std::istream &theStream, const char* startText ); + + /** + * Counts the number of tokens on line which are delimited by the characters + * listed in delimiters + * @param line + * @param delimiters + */ + int countTokens(char *line, char *delimiters); + + /** + * discovers whether or not the line contains the "end" token + * + * @param line The line to test + * + * @return int (==1 if the line has "end", ==0 if not). + */ + int isEndLine(char *line); + + bool CaseInsensitiveEquals(char ch1, char ch2); + + size_t CaseInsensitiveFind(const std::string& str1, const std::string& str2); + + + /** + * Convert a variable to a string + * @tparam T data type + * @param v data to be converted + * @return a string + */ + template + std::string toString(const T& v) { + std::ostringstream oss; + if (!oss << v) { + std::cerr << "toString Error" << std::endl; + } + return oss.str(); + } + + template + T lexi_cast(const std::string& str) { + T result; + std::istringstream iss(str); + if (!(iss >> result)) { + std::cerr << "lexi_cast Error" << std::endl; + } + return result; + } + + + template + bool isType(const std::string& str) { + T result; + std::istringstream iss(str); + bool ret = true; + if (!(iss >> result)) { + ret = false; + } + return ret; + } + + bool isInteger(const std::string& str); + + std::string OpenMD_itoa(int value, unsigned int base = 10); + + /**@todo need implementation */ + std::string getPrefix(const std::string& str); + + /**@todo need implementation */ + std::string getSuffix(const std::string& str); + + +template +std::string containerToString(const ContainerType& cont) { + std::ostringstream oss; + oss << "("; + typename ContainerType::const_iterator i = cont.begin(); + if (i != cont.end()) { + oss << *i; + ++i; + } + for (; i != cont.end();++i) { + oss << ", "; + oss << *i; + } + oss << ")"; + return oss.str(); +} + + unsigned long long memparse (char *ptr, char **retptr); +} #endif