1 |
< |
#ifndef _STRINGUTILS_HPP_ |
2 |
< |
#define _STRINGUTILS_HPP_ |
1 |
> |
/* |
2 |
> |
* Copyright (c) 2005 The University of Notre Dame. All Rights Reserved. |
3 |
> |
* |
4 |
> |
* The University of Notre Dame grants you ("Licensee") a |
5 |
> |
* non-exclusive, royalty free, license to use, modify and |
6 |
> |
* redistribute this software in source and binary code form, provided |
7 |
> |
* that the following conditions are met: |
8 |
> |
* |
9 |
> |
* 1. Acknowledgement of the program authors must be made in any |
10 |
> |
* publication of scientific results based in part on use of the |
11 |
> |
* program. An acceptable form of acknowledgement is citation of |
12 |
> |
* the article in which the program was described (Matthew |
13 |
> |
* A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher |
14 |
> |
* J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented |
15 |
> |
* Parallel Simulation Engine for Molecular Dynamics," |
16 |
> |
* J. Comput. Chem. 26, pp. 252-271 (2005)) |
17 |
> |
* |
18 |
> |
* 2. Redistributions of source code must retain the above copyright |
19 |
> |
* notice, this list of conditions and the following disclaimer. |
20 |
> |
* |
21 |
> |
* 3. Redistributions in binary form must reproduce the above copyright |
22 |
> |
* notice, this list of conditions and the following disclaimer in the |
23 |
> |
* documentation and/or other materials provided with the |
24 |
> |
* distribution. |
25 |
> |
* |
26 |
> |
* This software is provided "AS IS," without a warranty of any |
27 |
> |
* kind. All express or implied conditions, representations and |
28 |
> |
* warranties, including any implied warranty of merchantability, |
29 |
> |
* fitness for a particular purpose or non-infringement, are hereby |
30 |
> |
* excluded. The University of Notre Dame and its licensors shall not |
31 |
> |
* be liable for any damages suffered by licensee as a result of |
32 |
> |
* using, modifying or distributing the software or its |
33 |
> |
* derivatives. In no event will the University of Notre Dame or its |
34 |
> |
* licensors be liable for any lost revenue, profit or data, or for |
35 |
> |
* direct, indirect, special, consequential, incidental or punitive |
36 |
> |
* damages, however caused and regardless of the theory of liability, |
37 |
> |
* arising out of the use of or inability to use software, even if the |
38 |
> |
* University of Notre Dame has been advised of the possibility of |
39 |
> |
* such damages. |
40 |
> |
*/ |
41 |
> |
|
42 |
> |
/** |
43 |
> |
* @file StringUtils.hpp |
44 |
> |
* @author Dan Gezelter |
45 |
> |
* @date 10/18/2004 |
46 |
> |
* @version 1.0 |
47 |
> |
*/ |
48 |
> |
|
49 |
> |
#ifndef UTILS_STRINGUTILS_HPP |
50 |
> |
#define UTILS_STRINGUTILS_HPP |
51 |
|
#include <string> |
52 |
+ |
#include <string.h> |
53 |
+ |
#include <iostream> |
54 |
+ |
#include <fstream> |
55 |
+ |
#include <sstream> |
56 |
|
|
57 |
< |
using namespace std; |
58 |
< |
string UpperCase(const string& S); |
59 |
< |
string LowerCase(const string& S); |
57 |
> |
namespace oopse { |
58 |
> |
|
59 |
> |
/** |
60 |
> |
* Converts a string to UPPER CASE |
61 |
> |
* @param S |
62 |
> |
*/ |
63 |
> |
std::string UpperCase(const std::string& S); |
64 |
|
|
65 |
+ |
/** |
66 |
+ |
* Converts a string to lower case |
67 |
+ |
* @param S |
68 |
+ |
*/ |
69 |
+ |
std::string LowerCase(const std::string& S); |
70 |
+ |
|
71 |
+ |
/** |
72 |
+ |
* Removes left and right spaces from a string |
73 |
+ |
* |
74 |
+ |
* @param str String to trim |
75 |
+ |
* |
76 |
+ |
* @return char* to the trimed string |
77 |
+ |
*/ |
78 |
+ |
char* trimSpaces(char *str); |
79 |
+ |
|
80 |
+ |
/** |
81 |
+ |
* Finds the location of the string "begin <startText>" in an input stream. |
82 |
+ |
* @param theStream |
83 |
+ |
* @param startText |
84 |
+ |
* |
85 |
+ |
* @return the line number of the block within the theStream |
86 |
+ |
*/ |
87 |
+ |
int findBegin(std::istream &theStream, const char* startText ); |
88 |
+ |
|
89 |
+ |
/** |
90 |
+ |
* Counts the number of tokens on line which are delimited by the characters |
91 |
+ |
* listed in delimiters |
92 |
+ |
* @param line |
93 |
+ |
* @param delimiters |
94 |
+ |
*/ |
95 |
+ |
int countTokens(char *line, char *delimiters); |
96 |
+ |
|
97 |
+ |
/** |
98 |
+ |
* discovers whether or not the line contains the "end" token |
99 |
+ |
* |
100 |
+ |
* @param line The line to test |
101 |
+ |
* |
102 |
+ |
* @return int (==1 if the line has "end", ==0 if not). |
103 |
+ |
*/ |
104 |
+ |
int isEndLine(char *line); |
105 |
+ |
|
106 |
+ |
bool CaseInsensitiveEquals(char ch1, char ch2); |
107 |
+ |
|
108 |
+ |
size_t CaseInsensitiveFind(const std::string& str1, const std::string& str2); |
109 |
+ |
|
110 |
+ |
|
111 |
+ |
/** |
112 |
+ |
* Convert a variable to a string |
113 |
+ |
* @param T data type |
114 |
+ |
* @param v data to be converted |
115 |
+ |
* @return a string |
116 |
+ |
*/ |
117 |
+ |
template<typename T> |
118 |
+ |
std::string toString(const T& v) { |
119 |
+ |
std::ostringstream oss; |
120 |
+ |
if (!oss << v) { |
121 |
+ |
std::cerr << "toString Error" << std::endl; |
122 |
+ |
} |
123 |
+ |
return oss.str(); |
124 |
+ |
} |
125 |
+ |
|
126 |
+ |
template<typename T> |
127 |
+ |
T lexi_cast(const std::string& str) { |
128 |
+ |
T result; |
129 |
+ |
std::istringstream iss(str); |
130 |
+ |
if (!(iss >> result)) { |
131 |
+ |
std::cerr << "lexi_cast Error" << std::endl; |
132 |
+ |
} |
133 |
+ |
return result; |
134 |
+ |
} |
135 |
+ |
|
136 |
+ |
|
137 |
+ |
template<typename T> |
138 |
+ |
bool isType(const std::string& str) { |
139 |
+ |
T result; |
140 |
+ |
std::istringstream iss(str); |
141 |
+ |
bool ret = true; |
142 |
+ |
if (!(iss >> result)) { |
143 |
+ |
ret = false; |
144 |
+ |
} |
145 |
+ |
return ret; |
146 |
+ |
} |
147 |
+ |
|
148 |
+ |
bool isInteger(const std::string& str); |
149 |
+ |
|
150 |
+ |
std::string OOPSE_itoa(int value, unsigned int base = 10); |
151 |
+ |
|
152 |
+ |
/**@todo need implementation */ |
153 |
+ |
std::string getPrefix(const std::string& str); |
154 |
+ |
|
155 |
+ |
/**@todo need implementation */ |
156 |
+ |
std::string getSuffix(const std::string& str); |
157 |
+ |
|
158 |
+ |
|
159 |
+ |
template<class ContainerType> |
160 |
+ |
std::string containerToString(const ContainerType& cont) { |
161 |
+ |
std::ostringstream oss; |
162 |
+ |
oss << "("; |
163 |
+ |
typename ContainerType::const_iterator i = cont.begin(); |
164 |
+ |
if (i != cont.end()) { |
165 |
+ |
oss << *i; |
166 |
+ |
++i; |
167 |
+ |
} |
168 |
+ |
for (; i != cont.end();++i) { |
169 |
+ |
oss << ", "; |
170 |
+ |
oss << *i; |
171 |
+ |
} |
172 |
+ |
oss << ")"; |
173 |
+ |
return oss.str(); |
174 |
+ |
} |
175 |
+ |
|
176 |
+ |
|
177 |
+ |
} |
178 |
|
#endif |