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.8.2.2 $
21: */package java.util.regex;
22:
23: /**
24: * Possessive composite (i.e. {n, m}) quantifier node.
25: *
26: * @author Nikolay A. Kuznetsov
27: * @version $Revision: 1.8.2.2 $
28: */
29: class PossessiveCompositeQuantifierSet extends CompositeQuantifierSet {
30:
31: public PossessiveCompositeQuantifierSet(Quantifier quant,
32: LeafSet innerSet, AbstractSet next, int type) {
33: super (quant, innerSet, next, type);
34: }
35:
36: public int matches(int stringIndex, CharSequence testString,
37: MatchResultImpl matchResult) {
38: int min = quantifier.min();
39: int max = quantifier.max();
40: int i = 0;
41:
42: for (; i < min; i++) {
43: if (stringIndex + leaf.charCount() > matchResult
44: .getRightBound()) {
45: matchResult.hitEnd = true;
46: return -1;
47: }
48: int shift = leaf.accepts(stringIndex, testString);
49: if (shift < 1) {
50: return -1;
51: }
52: stringIndex += shift;
53: }
54:
55: for (; i < max; i++) {
56: int shift;
57: if (stringIndex + leaf.charCount() > matchResult
58: .getRightBound()
59: || (shift = leaf.accepts(stringIndex, testString)) < 1) {
60: break;
61: }
62: stringIndex += shift;
63: }
64: return next.matches(stringIndex, testString, matchResult);
65: }
66: }
|