2 * Copyright (C) 2001, 2002 The Mir-coders group
4 * This file is part of Mir.
6 * Mir is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * Mir is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with Mir; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 * In addition, as a special exception, The Mir-coders gives permission to link
21 * the code of this program with the com.oreilly.servlet library, any library
22 * licensed under the Apache Software License, The Sun (tm) Java Advanced
23 * Imaging library (JAI), The Sun JIMI library (or with modified versions of
24 * the above that use the same license as the above), and distribute linked
25 * combinations including the two. You must obey the GNU General Public
26 * License in all respects for all of the code used other than the above
27 * mentioned libraries. If you modify this file, you may extend this exception
28 * to your version of the file, but you are not obligated to do so. If you do
29 * not wish to do so, delete this exception statement from your version.
35 import gnu.regexp.REException;
37 import java.util.List;
38 import java.util.Vector;
40 public class StringRoutines {
42 private StringRoutines() {
45 static int indexOfCharacters(String aString, char[] aCharacters, int aFrom) {
50 for (i=0; i<aCharacters.length ; i++) {
51 position = aString.indexOf(aCharacters[i], aFrom);
53 if (position != -1 && ( result == -1 || position < result )) {
61 static String replaceStringCharacters(String aText, char[] aCharactersToReplace, String[] aStringsToSubstitute) {
62 int position, nextPosition;
64 StringBuffer result = new StringBuffer();
69 nextPosition = StringRoutines.indexOfCharacters(aText, aCharactersToReplace, position);
72 nextPosition = aText.length();
74 result.append(aText.substring(position, nextPosition));
76 if (nextPosition<aText.length())
77 for (i=0; i<aCharactersToReplace.length; i++) {
78 if (aCharactersToReplace[i] == aText.charAt(nextPosition)) {
79 result.append(aStringsToSubstitute[i]);
83 position=nextPosition+1;
85 while (nextPosition<aText.length()) ;
87 return result.toString();
91 public static String interpretAsString(Object aValue) throws Exception {
92 if (aValue instanceof String)
93 return (String) aValue;
95 if (aValue instanceof Integer)
96 return ((Integer) aValue).toString();
101 throw new Exception("String expected, "+aValue+" found");
104 public static int interpretAsInteger(Object aValue) throws Exception {
105 if (aValue instanceof Integer)
106 return ((Integer) aValue).intValue();
108 if (aValue instanceof String)
110 return Integer.parseInt((String) aValue);
112 catch (Throwable t) {
113 throw new Exception("Integer expected, "+aValue+" found");
116 throw new Exception("Integer expected, "+aValue+" found");
119 public static String performRegularExpressionReplacement(String aSource,
120 String aSearchExpression, String aReplacement) throws Exception {
122 RE regularExpression;
124 regularExpression = new RE(aSearchExpression);
126 return regularExpression.substituteAll(aSource, aReplacement);
129 public static boolean performRegularExpressionSearch(String aSource,
130 String aSearchExpression) throws REException {
131 RE regularExpression;
133 regularExpression = new RE(aSearchExpression);
135 return regularExpression.isMatch(aSource);
138 public static List splitString(String aString, String aSeparator) {
139 List result= new Vector();
140 int previousPosition = 0;
142 int endOfNamePosition;
144 while ((position = aString.indexOf(aSeparator, previousPosition))>=0) {
145 result.add(aString.substring(previousPosition, position));
146 previousPosition = position + aSeparator.length();
149 result.add(aString.substring(previousPosition, aString.length()));