2 * Copyright (C) 2001, 2002 The Mir-coders group
\r
4 * This file is part of Mir.
\r
6 * Mir is free software; you can redistribute it and/or modify
\r
7 * it under the terms of the GNU General Public License as published by
\r
8 * the Free Software Foundation; either version 2 of the License, or
\r
9 * (at your option) any later version.
\r
11 * Mir is distributed in the hope that it will be useful,
\r
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
\r
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
\r
14 * GNU General Public License for more details.
\r
16 * You should have received a copy of the GNU General Public License
\r
17 * along with Mir; if not, write to the Free Software
\r
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
\r
20 * In addition, as a special exception, The Mir-coders gives permission to link
\r
21 * the code of this program with any library licensed under the Apache Software License,
\r
22 * The Sun (tm) Java Advanced Imaging library (JAI), The Sun JIMI library
\r
23 * (or with modified versions of the above that use the same license as the above),
\r
24 * and distribute linked combinations including the two. You must obey the
\r
25 * GNU General Public License in all respects for all of the code used other than
\r
26 * the above mentioned libraries. If you modify this file, you may extend this
\r
27 * exception to your version of the file, but you are not obligated to do so.
\r
28 * If you do not wish to do so, delete this exception statement from your version.
\r
32 import gnu.regexp.RE;
\r
33 import gnu.regexp.REException;
\r
35 import java.util.List;
\r
36 import java.util.Vector;
\r
38 public class StringRoutines {
\r
40 private StringRoutines() {
\r
43 public static int indexOfCharacters(String aString, char[] aCharacters, int aFrom) {
\r
48 for (i=0; i<aCharacters.length ; i++) {
\r
49 position = aString.indexOf(aCharacters[i], aFrom);
\r
51 if (position != -1 && ( result == -1 || position < result )) {
\r
59 public static String replaceStringCharacters(String aText, char[] aCharactersToReplace, String[] aStringsToSubstitute) {
\r
63 int position, nextPosition;
\r
65 StringBuffer result = new StringBuffer();
\r
69 nextPosition = StringRoutines.indexOfCharacters(aText, aCharactersToReplace, position);
\r
72 nextPosition = aText.length();
\r
74 result.append(aText.substring(position, nextPosition));
\r
76 if (nextPosition<aText.length())
\r
77 for (i=0; i<aCharactersToReplace.length; i++) {
\r
78 if (aCharactersToReplace[i] == aText.charAt(nextPosition)) {
\r
79 result.append(aStringsToSubstitute[i]);
\r
83 position=nextPosition+1;
\r
85 while (nextPosition<aText.length()) ;
\r
87 return result.toString();
\r
92 * @param anEscapeCharacater
\r
93 * @param aCharactersToReplace
\r
94 * @param aStringsToSubstitute
\r
98 public static String replaceEscapedStringCharacters(String aText, char anEscapeCharacter, char[] aCharactersToReplace, String[] aStringsToSubstitute) {
\r
102 int position, nextPosition;
\r
104 StringBuffer result = new StringBuffer();
\r
108 nextPosition = aText.indexOf(anEscapeCharacter, position);
\r
110 if (nextPosition<0)
\r
111 nextPosition = aText.length();
\r
113 result.append(aText.substring(position, nextPosition));
\r
115 if (nextPosition+1<aText.length()) {
\r
116 nextPosition = nextPosition+1;
\r
118 boolean found = false;
\r
119 for (i = 0; i < aCharactersToReplace.length; i++) {
\r
120 if (aCharactersToReplace[i] == aText.charAt(nextPosition)) {
\r
121 result.append(aStringsToSubstitute[i]);
\r
128 result.append(aText.charAt(nextPosition));
\r
131 position=nextPosition+1;
\r
133 while (nextPosition<aText.length()) ;
\r
135 return result.toString();
\r
138 public static String interpretAsString(Object aValue) throws Exception {
\r
139 if (aValue instanceof String)
\r
140 return (String) aValue;
\r
142 if (aValue instanceof Integer)
\r
143 return ((Integer) aValue).toString();
\r
145 if (aValue == null)
\r
148 throw new Exception("String expected, "+aValue+" found");
\r
151 public static int interpretAsInteger(Object aValue) throws Exception {
\r
152 if (aValue instanceof Integer)
\r
153 return ((Integer) aValue).intValue();
\r
155 if (aValue instanceof String)
\r
157 return Integer.parseInt((String) aValue);
\r
159 catch (Throwable t) {
\r
160 throw new Exception("Integer expected, "+aValue+" found");
\r
163 throw new Exception("Integer expected, "+aValue+" found");
\r
169 * @param aSearchExpression
\r
170 * @param aReplacement
\r
172 * @throws Exception
\r
174 public static String performRegularExpressionReplacement(String aSource,
\r
175 String aSearchExpression, String aReplacement) throws UtilExc {
\r
177 RE regularExpression;
\r
179 regularExpression = new RE(aSearchExpression);
\r
181 return regularExpression.substituteAll(aSource, aReplacement);
\r
183 catch (Throwable t) {
\r
184 throw new UtilFailure("StringRoutines.performRegularExpressionReplacement: " + t.toString(), t);
\r
188 public static String performCaseInsensitiveRegularExpressionReplacement(String aSource,
\r
189 String aSearchExpression, String aReplacement) throws UtilExc {
\r
191 RE regularExpression;
\r
193 regularExpression = new RE(aSearchExpression, RE.REG_ICASE);
\r
195 return regularExpression.substituteAll(aSource, aReplacement);
\r
197 catch (Throwable t) {
\r
198 throw new UtilFailure("StringRoutines.performRegularExpressionReplacement: " + t.toString(), t);
\r
205 * @param aSearchExpression
\r
207 * @throws REException
\r
209 public static boolean performRegularExpressionSearch(String aSource,
\r
210 String aSearchExpression) throws UtilExc {
\r
212 RE regularExpression;
\r
214 regularExpression = new RE(aSearchExpression);
\r
216 return regularExpression.isMatch(aSource);
\r
218 catch (Throwable t) {
\r
219 throw new UtilFailure("StringRoutines.performRegularExpressionSearch: " + t.toString(), t);
\r
224 * Separates a string based on a separator:
\r
225 * <code>seperateString("a:b:c", ":");</code> will lead to
\r
226 * a List with 3 Strings: <code>"a"</code>, <code>"b"</code> and <code>"c"</code>
\r
228 * @param aString The string to split
\r
229 * @param aSeparator
\r
233 public static List splitString(String aString, String aSeparator) {
\r
234 List result= new Vector();
\r
235 int previousPosition = 0;
\r
237 int endOfNamePosition;
\r
239 if (aString!=null) {
\r
240 while ( (position = aString.indexOf(aSeparator, previousPosition)) >= 0) {
\r
241 result.add(aString.substring(previousPosition, position));
\r
242 previousPosition = position + aSeparator.length();
\r
244 result.add(aString.substring(previousPosition, aString.length()));
\r
251 * Separates a String into at most 2 parts based on a separator:
\r
254 * <code>seperateString("a:b:c", ":");</code> will lead to
\r
255 * a List with 2 Strings: <code>"a"</code> and <code>"b:c"</code>
\r
257 * <code>seperateString("abc", ":");</code> will lead to
\r
258 * a List with a single String: <code>"abc"</code>
\r
263 * @param aSeparator
\r
266 public static List separateString(String aString, String aSeparator) {
\r
267 List result= new Vector();
\r
268 int previousPosition = 0;
\r
271 if((position = aString.indexOf(aSeparator, previousPosition))>=0) {
\r
272 result.add(aString.substring(previousPosition, position));
\r
273 previousPosition = position + aSeparator.length();
\r
276 result.add(aString.substring(previousPosition, aString.length()));
\r
281 public static List splitStringWithEscape(String aString, char aSeparator, char anEscape) {
\r
282 List result= new Vector();
\r
283 int previousPosition = 0;
\r
285 int endOfNamePosition;
\r
286 StringBuffer currentItem = new StringBuffer();
\r
288 if (aString!=null) {
\r
289 while ((position = indexOfCharacters(aString, new char[] {aSeparator, anEscape}, previousPosition))>=0) {
\r
290 currentItem.append(aString.substring(previousPosition, position));
\r
292 if (aString.charAt(position)==aSeparator) {
\r
293 result.add(currentItem.toString());
\r
294 currentItem.delete(0, currentItem.length());
\r
297 currentItem.append(aString.charAt(position));
\r
298 if (aString.length()>position+1) {
\r
299 position=position+1;
\r
300 currentItem.append(aString.charAt(position));
\r
303 previousPosition = position + 1;
\r
305 currentItem.append(aString.substring(previousPosition, aString.length()));
\r
306 result.add(currentItem.toString());
\r
312 public static String replicateString(String aString, int aCount) {
\r
313 StringBuffer result = new StringBuffer();
\r
315 for (int i=0; i<aCount; i++)
\r
316 result.append(aString);
\r
318 return result.toString();
\r
321 public static String replicateChar(char aCharacter, int aCount) {
\r
322 char result[] = new char[aCount];
\r
324 for (int i=0; i<aCount; i++)
\r
325 result[i]= aCharacter;
\r
327 return new String(result);
\r
330 public static String padStringLeft(String aString, int aLength, char aPadCharacter) {
\r
331 if (aString.length()<aLength)
\r
332 return replicateChar(aPadCharacter, aLength-aString.length()) + aString;
\r
337 private static final char HEX_CHARACTERS[] = {
\r
338 '0', '1', '2', '3', '4', '5', '6', '7',
\r
339 '8', '9', 'a', 'b', 'c', 'd', 'e', 'f'
\r
342 public static String convertToHex(long aData, int aNumberOfDigits) {
\r
343 StringBuffer result = new StringBuffer();
\r
345 for (int digit = aNumberOfDigits-1; digit>=0; digit--) {
\r
346 int value = (int) (aData >> (digit*4)) & 0xf;
\r
347 result.append(HEX_CHARACTERS[value]);
\r
350 return result.toString();
\r
353 public static String convertToHex(byte[] aData) {
\r
354 StringBuffer result = new StringBuffer();
\r
356 for (int i = 0; i<aData.length; i++) {
\r
357 result.append(convertToHex(aData[i], 2));
\r
361 return result.toString();
\r