src/utils/StringUtils.cpp

/*
 * 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. Acknowledgement of the program authors must be made in any
 *    publication of scientific results based in part on use of the
 *    program.  An acceptable form of acknowledgement is citation of
 *    the article in which the program was described (Matthew
 *    A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher
 *    J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented
 *    Parallel Simulation Engine for Molecular Dynamics,"
 *    J. Comput. Chem. 26, pp. 252-271 (2005))
 *
 * 2. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 3. 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.
 */

#include <algorithm> 
#include "utils/StringUtils.hpp"

namespace oopse {
  std::string UpperCase(const std::string& S) {
    std::string uc = S;
    unsigned int n = uc.size();
    for (unsigned int j = 0; j < n; j++) {   
      char sj = uc[j];
      if (sj >= 'a' && sj <= 'z') uc[j] = (char)(sj - ('a' - 'A'));
    }
    return uc;
  }

  std::string LowerCase(const std::string& S) {
    std::string lc = S;
    unsigned int n = lc.size();
    for (unsigned int j = 0; j < n; j++) {
      char sj = lc[j];
      if (sj >= 'A' && sj <= 'Z') lc[j] = (char)(sj + ('a' - 'A'));
    }
    return lc;
  }

  char* trimSpaces(char *str) {
    size_t len;
    char *right, *left;

    if (strlen(str) == 0) return(str);
  
    /* Trim whitespace from left side */
    for (left = str; isspace(*left); left++);

    /* Trim whitespace from right side */
    if ((len = strlen(left)))
      {
        right = left + (len - 1);
      
        while (isspace(*right))
          {
            *right = '\0';
            right--;
          }
      }

    /* Only do the str copy if there were spaces to the left */
    if (left != str)
      strcpy(str, left);
  
    return (str);
  }

  int findBegin(std::istream &theStream, char* startText ){
    const int MAXLEN = 1024;
    char readLine[MAXLEN];   
    int foundText = 0;
    int lineNum;
    char* the_token;
    char* eof_test;

    // rewind the stream
    theStream.seekg (0, std::ios::beg);
    lineNum = 0;
  
    if (!theStream.eof()) {
      theStream.getline(readLine, MAXLEN);
      lineNum++;
    } else {
      printf( "Error fast forwarding stream: stream is empty.\n");
      return -1;
    }
  
    while ( !foundText ) {
    
      if (theStream.eof()) {
        printf("Error fast forwarding stream at line %d: "
               "stream ended unexpectedly.\n", lineNum);
        return -1;
      }
    
      the_token = strtok( readLine, " ,;\t" );
      if ( the_token != NULL)
        if (!strcasecmp("begin", the_token)) {
          the_token = strtok( NULL, " ,;\t" );
          if ( the_token != NULL){
            foundText = !strcasecmp( startText, the_token );
          }
        }
    
      if (!foundText) {
        if (!theStream.eof()) {
          theStream.getline(readLine, MAXLEN);
          lineNum++;
        } else {
          printf( "Error fast forwarding stream at line %d: "
                  "stream ended unexpectedly.\n", lineNum);
          return -1;
        }
      }
    }
    return lineNum;
  }

  int countTokens(char *line, char *delimiters) {
    /* PURPOSE: RETURN A COUNT OF THE NUMBER OF TOKENS ON THE LINE. */
  
    char *working_line;   /* WORKING COPY OF LINE. */
    int ntokens;          /* NUMBER OF TOKENS FOUND IN LINE. */
    char *strtok_ptr;     /* POINTER FOR STRTOK. */

    strtok_ptr= working_line= strdup(line);

    ntokens=0;
    while (strtok(strtok_ptr,delimiters)!=NULL)
      {
        ntokens++;
        strtok_ptr=NULL;
      }

    free(working_line);
    return(ntokens);
  }

  int isEndLine(char *line) {
    char *working_line;
    char *foo;
  
    working_line = strdup(line);
  
    foo = strtok(working_line, " ,;\t");

    if (foo != NULL) {

      if (!strcasecmp(foo, "end")) return 1;

    }
 
    return 0;
  }
  
  std::string OOPSE_itoa(int value, unsigned int base) {    
    const char digitMap[] = "0123456789abcdef"; 
    std::string buf;

    if (base == 0 || base > 16) {      
      return buf;
    }

    if (value == 0) {
      buf = "0";
      return buf;
    }
    
    // Take care negative int:
        
    std::string sign;    
    int _value = value; 
    if (value < 0) {
      _value = -value;
      sign = "-";
    }

    // Translating number to string with base:
    for (int i = 30; _value && i ; --i) {
      buf = digitMap[ _value % base ] + buf;
      _value /= base;
    }
    return sign.append(buf);
  }


  std::string getPrefix(const std::string& str) {
    return str.substr(0, str.rfind('.'));
  }

  std::string getSuffix(const std::string& str) {
    return str.substr(0, str.find('.'));
  }

bool isInteger(const std::string& str) {

    bool result = false;

    std::string::const_iterator i = str.begin();    
    if (i != str.end() && (*i == '+' || *i == '-' || std::isdigit(*i) )) {
        ++i;        
        while (i != str.end() && std::isdigit(*i))
            ++i;
        if (i == str.end())
            result = true;
    }
    
    return result;
}

bool CaseInsensitiveEquals(const char ch1, const char ch2) {
  return std::toupper((unsigned char)ch1) == std::toupper((unsigned char)ch2);
}

size_t CaseInsensitiveFind(const std::string& str1, const std::string& str2) {
  std::string::const_iterator pos = std::search(str1.begin(), str1.end(), str2.begin(), str2.end(), CaseInsensitiveEquals);
  if (pos == str1.end())
    return std::string::npos;
  else
    return pos - str1.begin();
}

}
Revision:	2982
Committed:	Wed Aug 30 18:42:29 2006 UTC (17 years, 10 months ago) by tim
File size:	6957 byte(s)
Log Message:	Massive changes preparing for release of OOPSE-4: The main difference is that the new MD file format (.md, .dump, .eor) now contains meta-data information along with the configuration information.
#	User	Rev	Content
1	gezelter	2090	/*
2	gezelter	1930	* 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	tim	2982
42			#include <algorithm>
43	tim	1492	#include "utils/StringUtils.hpp"
44	gezelter	1490
45	gezelter	1614	namespace oopse {
46	gezelter	2090	std::string UpperCase(const std::string& S) {
47			std::string uc = S;
48			unsigned int n = uc.size();
49			for (unsigned int j = 0; j < n; j++) {
50			char sj = uc[j];
51			if (sj >= 'a' && sj <= 'z') uc[j] = (char)(sj - ('a' - 'A'));
52			}
53			return uc;
54	gezelter	1490	}
55
56	gezelter	2090	std::string LowerCase(const std::string& S) {
57			std::string lc = S;
58			unsigned int n = lc.size();
59			for (unsigned int j = 0; j < n; j++) {
60			char sj = lc[j];
61			if (sj >= 'A' && sj <= 'Z') lc[j] = (char)(sj + ('a' - 'A'));
62			}
63			return lc;
64	gezelter	1490	}
65	gezelter	1590
66	gezelter	2090	char* trimSpaces(char *str) {
67			size_t len;
68			char right, left;
69	chrisfen	1598
70	gezelter	2090	if (strlen(str) == 0) return(str);
71	chrisfen	1598
72	gezelter	2090	/* Trim whitespace from left side */
73			for (left = str; isspace(*left); left++);
74	chrisfen	1598
75	gezelter	2090	/* Trim whitespace from right side */
76			if ((len = strlen(left)))
77			{
78			right = left + (len - 1);
79	chrisfen	1598
80	gezelter	2090	while (isspace(*right))
81			{
82			*right = '\0';
83			right--;
84			}
85			}
86	chrisfen	1598
87	gezelter	2090	/* Only do the str copy if there were spaces to the left */
88			if (left != str)
89			strcpy(str, left);
90	chrisfen	1598
91	gezelter	2090	return (str);
92			}
93	chrisfen	1598
94	gezelter	2090	int findBegin(std::istream &theStream, char* startText ){
95			const int MAXLEN = 1024;
96			char readLine[MAXLEN];
97			int foundText = 0;
98			int lineNum;
99			char* the_token;
100			char* eof_test;
101	gezelter	1590
102	gezelter	2090	// rewind the stream
103			theStream.seekg (0, std::ios::beg);
104			lineNum = 0;
105	gezelter	1590
106	gezelter	2090	if (!theStream.eof()) {
107			theStream.getline(readLine, MAXLEN);
108			lineNum++;
109			} else {
110			printf( "Error fast forwarding stream: stream is empty.\n");
111	gezelter	1590	return -1;
112			}
113	gezelter	2090
114			while ( !foundText ) {
115	chrisfen	1598
116	gezelter	2090	if (theStream.eof()) {
117			printf("Error fast forwarding stream at line %d: "
118			"stream ended unexpectedly.\n", lineNum);
119			return -1;
120	chrisfen	1598	}
121
122	gezelter	2090	the_token = strtok( readLine, " ,;\t" );
123			if ( the_token != NULL)
124			if (!strcasecmp("begin", the_token)) {
125			the_token = strtok( NULL, " ,;\t" );
126			if ( the_token != NULL){
127			foundText = !strcasecmp( startText, the_token );
128			}
129			}
130
131			if (!foundText) {
132			if (!theStream.eof()) {
133			theStream.getline(readLine, MAXLEN);
134			lineNum++;
135			} else {
136			printf( "Error fast forwarding stream at line %d: "
137			"stream ended unexpectedly.\n", lineNum);
138			return -1;
139			}
140	gezelter	1590	}
141			}
142	gezelter	2090	return lineNum;
143	gezelter	1590	}
144
145	gezelter	2090	int countTokens(char line, char delimiters) {
146			/* PURPOSE: RETURN A COUNT OF THE NUMBER OF TOKENS ON THE LINE. */
147	gezelter	1590
148	gezelter	2090	char working_line; / WORKING COPY OF LINE. */
149			int ntokens; /* NUMBER OF TOKENS FOUND IN LINE. */
150			char strtok_ptr; / POINTER FOR STRTOK. */
151	gezelter	1590
152	gezelter	2090	strtok_ptr= working_line= strdup(line);
153	gezelter	1590
154	gezelter	2090	ntokens=0;
155			while (strtok(strtok_ptr,delimiters)!=NULL)
156			{
157			ntokens++;
158			strtok_ptr=NULL;
159			}
160	gezelter	1590
161	gezelter	2090	free(working_line);
162			return(ntokens);
163			}
164	gezelter	1590
165	gezelter	2090	int isEndLine(char *line) {
166			char *working_line;
167			char *foo;
168	gezelter	1590
169	gezelter	2090	working_line = strdup(line);
170	gezelter	1590
171	gezelter	2090	foo = strtok(working_line, " ,;\t");
172	gezelter	1590
173	gezelter	2090	if (foo != NULL) {
174	gezelter	1600
175	gezelter	2090	if (!strcasecmp(foo, "end")) return 1;
176	gezelter	1600
177	gezelter	2090	}
178
179			return 0;
180	gezelter	1600	}
181	gezelter	2090
182	tim	2241	std::string OOPSE_itoa(int value, unsigned int base) {
183	gezelter	2090	const char digitMap[] = "0123456789abcdef";
184			std::string buf;
185	gezelter	1930
186	gezelter	2090	if (base == 0 \|\| base > 16) {
187			return buf;
188			}
189	gezelter	1930
190	gezelter	2090	if (value == 0) {
191			buf = "0";
192			return buf;
193			}
194
195			// Take care negative int:
196
197			std::string sign;
198			int _value = value;
199			if (value < 0) {
200			_value = -value;
201			sign = "-";
202			}
203	gezelter	1930
204	gezelter	2090	// Translating number to string with base:
205			for (int i = 30; _value && i ; --i) {
206			buf = digitMap[ _value % base ] + buf;
207			_value /= base;
208			}
209			return sign.append(buf);
210			}
211
212
213			std::string getPrefix(const std::string& str) {
214			return str.substr(0, str.rfind('.'));
215			}
216
217			std::string getSuffix(const std::string& str) {
218	gezelter	1930	return str.substr(0, str.find('.'));
219	gezelter	2090	}
220	gezelter	1930
221	tim	2537	bool isInteger(const std::string& str) {
222
223			bool result = false;
224
225			std::string::const_iterator i = str.begin();
226			if (i != str.end() && (i == '+' \|\| i == '-' \|\| std::isdigit(*i) )) {
227			++i;
228			while (i != str.end() && std::isdigit(*i))
229			++i;
230			if (i == str.end())
231			result = true;
232			}
233
234			return result;
235	gezelter	1930	}
236	tim	2537
237	tim	2982	bool CaseInsensitiveEquals(const char ch1, const char ch2) {
238			return std::toupper((unsigned char)ch1) == std::toupper((unsigned char)ch2);
239	tim	2537	}
240	tim	2982
241			size_t CaseInsensitiveFind(const std::string& str1, const std::string& str2) {
242			std::string::const_iterator pos = std::search(str1.begin(), str1.end(), str2.begin(), str2.end(), CaseInsensitiveEquals);
243			if (pos == str1.end())
244			return std::string::npos;
245			else
246			return pos - str1.begin();
247			}
248
249			}