01: /*
02: * Licensed to the Apache Software Foundation (ASF) under one or more
03: * contributor license agreements. See the NOTICE file distributed with
04: * this work for additional information regarding copyright ownership.
05: * The ASF licenses this file to You under the Apache License, Version 2.0
06: * (the "License"); you may not use this file except in compliance with
07: * the License. You may obtain a copy of the License at
08: *
09: * http://www.apache.org/licenses/LICENSE-2.0
10: *
11: * Unless required by applicable law or agreed to in writing, software
12: * distributed under the License is distributed on an "AS IS" BASIS,
13: * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14: * See the License for the specific language governing permissions and
15: * limitations under the License.
16: */
17:
18: /**
19: * @author Nikolay A. Kuznetsov
20: * @version $Revision: 1.7.2.2 $
21: */package java.util.regex;
22:
23: /**
24: * Possessive composite (i.e. {n,m}) quantifier node over groups.
25: * @author Nikolay A. Kuznetsov
26: * @version $Revision: 1.7.2.2 $
27: */
28: class PosCompositeGroupQuantifierSet extends
29: CompositeGroupQuantifierSet {
30:
31: public PosCompositeGroupQuantifierSet(Quantifier quant,
32: AbstractSet innerSet, AbstractSet next, int type,
33: int setCounter) {
34: super (quant, innerSet, next, type, setCounter);
35: innerSet.setNext(FSet.posFSet);
36: }
37:
38: public int matches(int stringIndex, CharSequence testString,
39: MatchResultImpl matchResult) {
40:
41: int nextIndex;
42: int counter = 0;
43: int max = quantifier.max();
44:
45: while ((nextIndex = innerSet.matches(stringIndex, testString,
46: matchResult)) > stringIndex
47: && counter < max) {
48: counter++;
49: stringIndex = nextIndex;
50: }
51:
52: if (nextIndex < 0 && counter < quantifier.min()) {
53: return -1;
54: } else {
55: return next.matches(stringIndex, testString, matchResult);
56: }
57: }
58: }
|