ViewVC Help

View File | Revision Log | Show Annotations | View Changeset | Root Listing

root/OpenMD/branches/development/src/utils/StringUtils.cpp

Comparing:
trunk/src/utils/StringUtils.cpp (file contents), Revision 107 by gezelter, Tue Oct 19 20:40:30 2004 UTC vs.
branches/development/src/utils/StringUtils.cpp (file contents), Revision 1654 by gezelter, Wed Sep 28 19:40:45 2011 UTC

#	Line 1 | Line 1
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. Redistributions of source code must retain the above copyright
10	+	*    notice, this list of conditions and the following disclaimer.
11	+	*
12	+	* 2. Redistributions in binary form must reproduce the above copyright
13	+	*    notice, this list of conditions and the following disclaimer in the
14	+	*    documentation and/or other materials provided with the
15	+	*    distribution.
16	+	*
17	+	* This software is provided "AS IS," without a warranty of any
18	+	* kind. All express or implied conditions, representations and
19	+	* warranties, including any implied warranty of merchantability,
20	+	* fitness for a particular purpose or non-infringement, are hereby
21	+	* excluded.  The University of Notre Dame and its licensors shall not
22	+	* be liable for any damages suffered by licensee as a result of
23	+	* using, modifying or distributing the software or its
24	+	* derivatives. In no event will the University of Notre Dame or its
25	+	* licensors be liable for any lost revenue, profit or data, or for
26	+	* direct, indirect, special, consequential, incidental or punitive
27	+	* damages, however caused and regardless of the theory of liability,
28	+	* arising out of the use of or inability to use software, even if the
29	+	* University of Notre Dame has been advised of the possibility of
30	+	* such damages.
31	+	*
32	+	* SUPPORT OPEN SCIENCE!  If you use OpenMD or its source code in your
33	+	* research, please cite the appropriate papers when you publish your
34	+	* work.  Good starting points are:
35	+	*
36	+	* [1]  Meineke, et al., J. Comp. Chem. 26, 252-271 (2005).
37	+	* [2]  Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006).
38	+	* [3]  Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008).
39	+	* [4]  Vardeman & Gezelter, in progress (2009).
40	+	*/
41	+
42	+	#include <algorithm>
43	+	#include <stdlib.h>
44		#include "utils/StringUtils.hpp"
45
46	<	using namespace std;
47	<	using namespace oopse;
48	<
49	<	string UpperCase(const string& S) {
50	<	string uc = S;
51	<	unsigned int n = uc.size();
52	<	for (unsigned int j = 0; j < n; j++) {
53	<	char sj = uc[j];
54	<	if (sj >= 'a' && sj <= 'z') uc[j] = (char)(sj - ('a' - 'A'));
46	>	namespace OpenMD {
47	>	std::string UpperCase(const std::string& S) {
48	>	std::string uc = S;
49	>	unsigned int n = uc.size();
50	>	for (unsigned int j = 0; j < n; j++) {
51	>	char sj = uc[j];
52	>	if (sj >= 'a' && sj <= 'z') uc[j] = (char)(sj - ('a' - 'A'));
53	>	}
54	>	return uc;
55		}
13	–	return uc;
14	–	}
56
57	<	string LowerCase(const string& S) {
58	<	string lc = S;
59	<	unsigned int n = lc.size();
60	<	for (unsigned int j = 0; j < n; j++) {
61	<	char sj = lc[j];
62	<	if (sj >= 'A' && sj <= 'Z') lc[j] = (char)(sj + ('a' - 'A'));
57	>	std::string LowerCase(const std::string& S) {
58	>	std::string lc = S;
59	>	unsigned int n = lc.size();
60	>	for (unsigned int j = 0; j < n; j++) {
61	>	char sj = lc[j];
62	>	if (sj >= 'A' && sj <= 'Z') lc[j] = (char)(sj + ('a' - 'A'));
63	>	}
64	>	return lc;
65		}
23	–	return lc;
24	–	}
66
67	<	char* trimSpaces(char *str) {
68	<	size_t len;
69	<	char *right, *left;
67	>	char* trimSpaces(char *str) {
68	>	size_t len;
69	>	char *right, *left;
70
71	<	if (strlen(str) == 0) return(str);
71	>	if (strlen(str) == 0) return(str);
72
73	<	/* Trim whitespace from left side */
74	<	for (left = str; isspace(*left); left++);
73	>	/* Trim whitespace from left side */
74	>	for (left = str; isspace(*left); left++);
75
76	<	/* Trim whitespace from right side */
77	<	if ((len = strlen(left)))
78	<	{
79	<	right = left + (len - 1);
76	>	/* Trim whitespace from right side */
77	>	if ((len = strlen(left)))
78	>	{
79	>	right = left + (len - 1);
80
81	<	while (isspace(*right))
82	<	{
83	<	*right = '\0';
84	<	right--;
85	<	}
86	<	}
81	>	while (isspace(*right))
82	>	{
83	>	*right = '\0';
84	>	right--;
85	>	}
86	>	}
87
88	<	/* Only do the str copy if there were spaces to the left */
89	<	if (left != str)
90	<	strcpy(str, left);
88	>	/* Only do the str copy if there were spaces to the left */
89	>	if (left != str)
90	>	strcpy(str, left);
91
92	<	return (str);
93	<	}
92	>	return (str);
93	>	}
94
95	<	int findBegin(istream &theStream, char* startText ){
96	<	const int MAXLEN = 1024;
97	<	char readLine[MAXLEN];
98	<	int foundText = 0;
99	<	int lineNum;
100	<	char* the_token;
101	<	char* eof_test;
95	>	int findBegin(std::istream &theStream, const char* startText ){
96	>	const int MAXLEN = 1024;
97	>	char readLine[MAXLEN];
98	>	int foundText = 0;
99	>	int lineNum;
100	>	char* the_token;
101	>	char* eof_test;
102
103	<	// rewind the stream
104	<	theStream.seekg (0, ios::beg);
105	<	lineNum = 0;
103	>	// rewind the stream
104	>	theStream.seekg (0, std::ios::beg);
105	>	lineNum = 0;
106
107	<	if (!theStream.eof()) {
108	<	theStream.getline(readLine, MAXLEN);
109	<	lineNum++;
110	<	} else {
111	<	printf( "Error fast forwarding stream: stream is empty.\n");
71	<	return -1;
72	<	}
73	<
74	<	while ( !foundText ) {
75	<
76	<	if (theStream.eof()) {
77	<	printf("Error fast forwarding stream at line %d: "
78	<	"stream ended unexpectedly.\n", lineNum);
107	>	if (!theStream.eof()) {
108	>	theStream.getline(readLine, MAXLEN);
109	>	lineNum++;
110	>	} else {
111	>	printf( "Error fast forwarding stream: stream is empty.\n");
112		return -1;
113		}
114	+
115	+	while ( !foundText ) {
116
117	<	the_token = strtok( readLine, " ,;\t" );
118	<	if ( the_token != NULL)
119	<	if (!strcasecmp("begin", the_token)) {
120	<	the_token = strtok( NULL, " ,;\t" );
86	<	if ( the_token != NULL){
87	<	foundText = !strcasecmp( startText, the_token );
88	<	}
117	>	if (theStream.eof()) {
118	>	printf("Error fast forwarding stream at line %d: "
119	>	"stream ended unexpectedly.\n", lineNum);
120	>	return -1;
121		}
122
123	<	if (!foundText) {
124	<	if (!theStream.eof()) {
125	<	theStream.getline(readLine, MAXLEN);
126	<	lineNum++;
127	<	} else {
128	<	printf( "Error fast forwarding stream at line %d: "
129	<	"stream ended unexpectedly.\n", lineNum);
130	<	return -1;
123	>	the_token = strtok( readLine, " ,;\t" );
124	>	if ( the_token != NULL)
125	>	if (!strcasecmp("begin", the_token)) {
126	>	the_token = strtok( NULL, " ,;\t" );
127	>	if ( the_token != NULL){
128	>	foundText = !strcasecmp( startText, the_token );
129	>	}
130	>	}
131	>
132	>	if (!foundText) {
133	>	if (!theStream.eof()) {
134	>	theStream.getline(readLine, MAXLEN);
135	>	lineNum++;
136	>	} else {
137	>	printf( "Error fast forwarding stream at line %d: "
138	>	"stream ended unexpectedly.\n", lineNum);
139	>	return -1;
140	>	}
141		}
142		}
143	+	return lineNum;
144		}
102	–	return lineNum;
103	–	}
145
146	<	int countTokens(char *line, char *delimiters) {
147	<	/* PURPOSE: RETURN A COUNT OF THE NUMBER OF TOKENS ON THE LINE. */
146	>	int countTokens(char *line, char *delimiters) {
147	>	/* PURPOSE: RETURN A COUNT OF THE NUMBER OF TOKENS ON THE LINE. */
148
149	<	char *working_line;   /* WORKING COPY OF LINE. */
150	<	int ntokens;          /* NUMBER OF TOKENS FOUND IN LINE. */
151	<	char *strtok_ptr;     /* POINTER FOR STRTOK. */
149	>	char *working_line;   /* WORKING COPY OF LINE. */
150	>	int ntokens;          /* NUMBER OF TOKENS FOUND IN LINE. */
151	>	char *strtok_ptr;     /* POINTER FOR STRTOK. */
152
153	<	strtok_ptr= working_line= strdup(line);
153	>	strtok_ptr= working_line= strdup(line);
154
155	<	ntokens=0;
156	<	while (strtok(strtok_ptr,delimiters)!=NULL)
157	<	{
158	<	ntokens++;
159	<	strtok_ptr=NULL;
160	<	}
155	>	ntokens=0;
156	>	while (strtok(strtok_ptr,delimiters)!=NULL)
157	>	{
158	>	ntokens++;
159	>	strtok_ptr=NULL;
160	>	}
161
162	<	free(working_line);
163	<	return(ntokens);
164	<	}
162	>	free(working_line);
163	>	return(ntokens);
164	>	}
165
166	<	int isEndLine(char *line) {
167	<	char *working_line;
168	<	char *foo;
166	>	int isEndLine(char *line) {
167	>	char *working_line;
168	>	char *foo;
169
170	<	working_line = strdup(line);
170	>	working_line = strdup(line);
171
172	<	foo = strtok(working_line, " ,;\t");
172	>	foo = strtok(working_line, " ,;\t");
173
174	<	if (foo != NULL) {
174	>	if (foo != NULL) {
175
176	<	if (!strcasecmp(foo, "end")) return 1;
176	>	if (!strcasecmp(foo, "end")) return 1;
177
178	<	}
178	>	}
179
180	<	return 0;
180	>	return 0;
181	>	}
182	>
183	>	std::string OpenMD_itoa(int value, unsigned int base) {
184	>	const char digitMap[] = "0123456789abcdef";
185	>	std::string buf;
186	>
187	>	if (base == 0 || base > 16) {
188	>	return buf;
189	>	}
190	>
191	>	if (value == 0) {
192	>	buf = "0";
193	>	return buf;
194	>	}
195	>
196	>	// Take care negative int:
197	>
198	>	std::string sign;
199	>	int _value = value;
200	>	if (value < 0) {
201	>	_value = -value;
202	>	sign = "-";
203	>	}
204	>
205	>	// Translating number to string with base:
206	>	for (int i = 30; _value && i ; --i) {
207	>	buf = digitMap[ _value % base ] + buf;
208	>	_value /= base;
209	>	}
210	>	return sign.append(buf);
211	>	}
212	>
213	>
214	>	std::string getPrefix(const std::string& str) {
215	>	return str.substr(0, str.rfind('.'));
216	>	}
217	>
218	>	std::string getSuffix(const std::string& str) {
219	>	return str.substr(0, str.find('.'));
220	>	}
221	>
222	>	bool isInteger(const std::string& str) {
223	>
224	>	bool result = false;
225	>
226	>	std::string::const_iterator i = str.begin();
227	>	if (i != str.end() && (*i == '+' || *i == '-' || std::isdigit(*i) )) {
228	>	++i;
229	>	while (i != str.end() && std::isdigit(*i))
230	>	++i;
231	>	if (i == str.end())
232	>	result = true;
233	>	}
234	>
235	>	return result;
236	>	}
237	>
238	>	bool CaseInsensitiveEquals(const char ch1, const char ch2) {
239	>	return std::toupper((unsigned char)ch1) == std::toupper((unsigned char)ch2);
240	>	}
241	>
242	>	size_t CaseInsensitiveFind(const std::string& str1, const std::string& str2) {
243	>	std::string::const_iterator pos = std::search(str1.begin(), str1.end(), str2.begin(), str2.end(), CaseInsensitiveEquals);
244	>	if (pos == str1.end())
245	>	return std::string::npos;
246	>	else
247	>	return pos - str1.begin();
248	>	}
249	>
250	>	/**
251	>	*    memparse - parse a string with mem suffixes into a number
252	>	*    @ptr: Where parse begins
253	>	*    @retptr: (output) Pointer to next char after parse completes
254	>	*
255	>	*    Parses a string into a number.  The number stored at @ptr is
256	>	*    potentially suffixed with %K (for kilobytes, or 1024 bytes),
257	>	*    %M (for megabytes, or 1048576 bytes), or %G (for gigabytes, or
258	>	*    1073741824).  If the number is suffixed with K, M, or G, then
259	>	*    the return value is the number multiplied by one kilobyte, one
260	>	*    megabyte, or one gigabyte, respectively.
261	>	*/
262	>	unsigned long long memparse (char *ptr,  char **retptr) {
263	>	unsigned long long ret = strtoull (ptr, retptr, 0);
264	>
265	>	switch (**retptr) {
266	>	case 'G':
267	>	case 'g':
268	>	ret <<= 10;
269	>	case 'M':
270	>	case 'm':
271	>	ret <<= 10;
272	>	case 'K':
273	>	case 'k':
274	>	ret <<= 10;
275	>	(*retptr)++;
276	>	default:
277	>	break;
278	>	}
279	>	return ret;
280	>	}
281	>
282		}

Comparing:
trunk/src/utils/StringUtils.cpp (property svn:keywords), Revision 107 by gezelter, Tue Oct 19 20:40:30 2004 UTC vs.
branches/development/src/utils/StringUtils.cpp (property svn:keywords), Revision 1654 by gezelter, Wed Sep 28 19:40:45 2011 UTC

#	Line 0 | Line 1
1	+	Author Id Revision Date

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines