PageRenderTime 67ms CodeModel.GetById 55ms app.highlight 7ms RepoModel.GetById 1ms app.codeStats 0ms

/jEdit/tags/jedit-4-2-pre14/gnu/regexp/RETokenBackRef.java

#
Java | 53 lines | 26 code | 8 blank | 19 comment | 4 complexity | 55166ce7fb8a52ade317b6a96e19242a MD5 | raw file
 1/*
 2 *  gnu/regexp/RETokenBackRef.java
 3 *  Copyright (C) 1998-2001 Wes Biggs
 4 *
 5 *  This library is free software; you can redistribute it and/or modify
 6 *  it under the terms of the GNU Lesser General Public License as published
 7 *  by the Free Software Foundation; either version 2.1 of the License, or
 8 *  (at your option) any later version.
 9 *
10 *  This library is distributed in the hope that it will be useful,
11 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
12 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
13 *  GNU Lesser General Public License for more details.
14 *
15 *  You should have received a copy of the GNU Lesser General Public License
16 *  along with this program; if not, write to the Free Software
17 *  Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
18 */
19
20package gnu.regexp;
21
22final class RETokenBackRef extends REToken {
23  private int num;
24  private boolean insens;
25  
26  RETokenBackRef(int subIndex, int num, boolean insens) {
27    super(subIndex);
28    this.num = num;
29    this.insens = insens;
30  }
31
32  // should implement getMinimumLength() -- any ideas?
33
34    boolean match(CharIndexed input, REMatch mymatch) {
35	int b,e;
36	b = mymatch.start[num];
37	e = mymatch.end[num];
38	if ((b==-1)||(e==-1)) return false; // this shouldn't happen, but...
39	for (int i=b; i<e; i++) {
40	    if (input.charAt(mymatch.index+i-b) != input.charAt(i)) {
41		return false;
42	    }
43	}
44	mymatch.index += e-b;
45	return next(input, mymatch);
46    }
47    
48    void dump(StringBuffer os) {
49	os.append('\\').append(num);
50    }
51}
52
53