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: * This class represents [+*]? constructs over LeafSets.
25: *
26: * @see java.util.regex.LeafSet
27: * @author Nikolay A. Kuznetsov
28: * @version $Revision: 1.8.2.2 $
29: */
30: class ReluctantQuantifierSet extends LeafQuantifierSet {
31:
32: public ReluctantQuantifierSet(LeafSet innerSet, AbstractSet next,
33: int type) {
34: super (innerSet, next, type);
35: }
36:
37: public int matches(int stringIndex, CharSequence testString,
38: MatchResultImpl matchResult) {
39: int shift = 0;
40:
41: do {
42: shift = next.matches(stringIndex, testString, matchResult);
43: if (shift >= 0) {
44: return shift;
45: }
46:
47: if (stringIndex + leaf.charCount() <= matchResult
48: .getRightBound()) {
49: shift = leaf.accepts(stringIndex, testString);
50: stringIndex += shift;
51: }
52: } while (shift >= 1);
53:
54: return -1;
55: }
56: }
|