| 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 |
|
#include "utils/StringUtils.hpp" |
| 43 |
|
|
| 3 |
– |
using namespace std; |
| 4 |
– |
|
| 44 |
|
namespace oopse { |
| 45 |
< |
string UpperCase(const string& S) { |
| 46 |
< |
string uc = S; |
| 45 |
> |
std::string UpperCase(const std::string& S) { |
| 46 |
> |
std::string uc = S; |
| 47 |
|
unsigned int n = uc.size(); |
| 48 |
|
for (unsigned int j = 0; j < n; j++) { |
| 49 |
|
char sj = uc[j]; |
| 52 |
|
return uc; |
| 53 |
|
} |
| 54 |
|
|
| 55 |
< |
string LowerCase(const string& S) { |
| 56 |
< |
string lc = S; |
| 55 |
> |
std::string LowerCase(const std::string& S) { |
| 56 |
> |
std::string lc = S; |
| 57 |
|
unsigned int n = lc.size(); |
| 58 |
|
for (unsigned int j = 0; j < n; j++) { |
| 59 |
|
char sj = lc[j]; |
| 90 |
|
return (str); |
| 91 |
|
} |
| 92 |
|
|
| 93 |
< |
int findBegin(istream &theStream, char* startText ){ |
| 93 |
> |
int findBegin(std::istream &theStream, char* startText ){ |
| 94 |
|
const int MAXLEN = 1024; |
| 95 |
|
char readLine[MAXLEN]; |
| 96 |
|
int foundText = 0; |
| 99 |
|
char* eof_test; |
| 100 |
|
|
| 101 |
|
// rewind the stream |
| 102 |
< |
theStream.seekg (0, ios::beg); |
| 102 |
> |
theStream.seekg (0, std::ios::beg); |
| 103 |
|
lineNum = 0; |
| 104 |
|
|
| 105 |
|
if (!theStream.eof()) { |
| 177 |
|
|
| 178 |
|
return 0; |
| 179 |
|
} |
| 180 |
+ |
|
| 181 |
+ |
|
| 182 |
+ |
std::string getPrefix(const std::string& str) { |
| 183 |
+ |
return str.substr(0, str.rfind('.')); |
| 184 |
|
} |
| 185 |
+ |
|
| 186 |
+ |
std::string getSuffix(const std::string& str) { |
| 187 |
+ |
return str.substr(0, str.find('.')); |
| 188 |
+ |
} |
| 189 |
+ |
|
| 190 |
+ |
} |