/interpreter/tags/at2-build190607/src/edu/vub/util/regexp/RETokenChar.java
Java | 95 lines | 42 code | 15 blank | 38 comment | 7 complexity | f4f12012ceda32c66e1db425c8bbdf36 MD5 | raw file
1/* gnu/regexp/RETokenChar.java 2 Copyright (C) 1998-2001, 2004 Free Software Foundation, Inc. 3 4This file is part of GNU Classpath. 5 6GNU Classpath is free software; you can redistribute it and/or modify 7it under the terms of the GNU General Public License as published by 8the Free Software Foundation; either version 2, or (at your option) 9any later version. 10 11GNU Classpath is distributed in the hope that it will be useful, but 12WITHOUT ANY WARRANTY; without even the implied warranty of 13MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 14General Public License for more details. 15 16You should have received a copy of the GNU General Public License 17along with GNU Classpath; see the file COPYING. If not, write to the 18Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 1902110-1301 USA. 20 21Linking this library statically or dynamically with other modules is 22making a combined work based on this library. Thus, the terms and 23conditions of the GNU General Public License cover the whole 24combination. 25 26As a special exception, the copyright holders of this library give you 27permission to link this library with independent modules to produce an 28executable, regardless of the license terms of these independent 29modules, and to copy and distribute the resulting executable under 30terms of your choice, provided that you also meet, for each linked 31independent module, the terms and conditions of the license of that 32module. An independent module is a module which is not derived from 33or based on this library. If you modify this library, you may extend 34this exception to your version of the library, but you are not 35obligated to do so. If you do not wish to do so, delete this 36exception statement from your version. */ 37 38 39package edu.vub.util.regexp; 40 41final class RETokenChar extends REToken { 42 private char[] ch; 43 private boolean insens; 44 45 RETokenChar(int subIndex, char c, boolean ins) { 46 super(subIndex); 47 ch = new char [1]; 48 ch[0] = (insens = ins) ? Character.toLowerCase(c) : c; 49 } 50 51 int getMinimumLength() { 52 return ch.length; 53 } 54 55 int getMaximumLength() { 56 return ch.length; 57 } 58 59 boolean match(CharIndexed input, REMatch mymatch) { 60 int z = ch.length; 61 char c; 62 for (int i=0; i<z; i++) { 63 c = input.charAt(mymatch.index+i); 64 if (( (insens) ? Character.toLowerCase(c) : c ) != ch[i]) { 65 return false; 66 } 67 } 68 mymatch.index += z; 69 70 return next(input, mymatch); 71 } 72 73 // Overrides REToken.chain() to optimize for strings 74 boolean chain(REToken next) { 75 if (next instanceof RETokenChar && ((RETokenChar)next).insens == insens) { 76 RETokenChar cnext = (RETokenChar) next; 77 // assume for now that next can only be one character 78 int newsize = ch.length + cnext.ch.length; 79 80 char[] chTemp = new char [newsize]; 81 82 System.arraycopy(ch,0,chTemp,0,ch.length); 83 System.arraycopy(cnext.ch,0,chTemp,ch.length,cnext.ch.length); 84 85 ch = chTemp; 86 return false; 87 } else return super.chain(next); 88 } 89 90 void dump(StringBuffer os) { 91 os.append(ch); 92 } 93} 94 95