summaryrefslogtreecommitdiff
path: root/libjava/classpath/gnu/java/util/regex/RETokenOneOf.java
blob: 3bea889ec91f1817835240771621580bbe755a6b (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
/* gnu/regexp/RETokenOneOf.java
   Copyright (C) 2006 Free Software Foundation, Inc.

This file is part of GNU Classpath.

GNU Classpath is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.

GNU Classpath is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
General Public License for more details.

You should have received a copy of the GNU General Public License
along with GNU Classpath; see the file COPYING.  If not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA.

Linking this library statically or dynamically with other modules is
making a combined work based on this library.  Thus, the terms and
conditions of the GNU General Public License cover the whole
combination.

As a special exception, the copyright holders of this library give you
permission to link this library with independent modules to produce an
executable, regardless of the license terms of these independent
modules, and to copy and distribute the resulting executable under
terms of your choice, provided that you also meet, for each linked
independent module, the terms and conditions of the license of that
module.  An independent module is a module which is not derived from
or based on this library.  If you modify this library, you may extend
this exception to your version of the library, but you are not
obligated to do so.  If you do not wish to do so, delete this
exception statement from your version. */

package gnu.java.util.regex;

import gnu.java.lang.CPStringBuilder;

import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
import java.util.List;

final class RETokenOneOf extends REToken
{
  private final List < REToken > options;
  private boolean negative;
  // True if this RETokenOneOf is supposed to match only one character,
  // which is typically the case of a character class expression.
  private boolean matchesOneChar;

  private final List < Object > addition;
  // This ArrayList addition is used to store nested character classes.
  // For example, if the original expression is
  //    [2-7a-c[f-k][m-z]&&[^p-v][st]]
  // the basic part /2-7a-c/ is stored in the ArrayList options, and
  // the additional part /[f-k][m-z]&&[^p-v][st]/ is stored in the
  // ArrayList addition in the following order (Reverse Polish Notation):
  //           -- The matching result of the basic part is assumed here.
  //    [f-k]  -- REToken
  //    "|"    -- or
  //    [m-z]  -- REToken
  //    "|"    -- or
  //    false
  //    [^p-v] -- REToken
  //    "|"    -- or
  //    [st]   -- REToken
  //    "|"    -- or
  //    "&"    -- and
  //
  // As it is clear from the explanation above, the ArrayList addition is
  // effective only when this REToken originates from a character class
  // expression.

  // This constructor is used for convenience when we know the set beforehand,
  // e.g. \d --> new RETokenOneOf("0123456789",false, ..)
  //      \D --> new RETokenOneOf("0123456789",true, ..)

    RETokenOneOf (int subIndex, String optionsStr, boolean negative,
                  boolean insens)
  {
    super (subIndex);
    options = new ArrayList < REToken > ();
    this.negative = negative;
    for (int i = 0; i < optionsStr.length (); i++)
      options.add (new RETokenChar (subIndex, optionsStr.charAt (i), insens));
    matchesOneChar = true;
    addition = null;
  }

  RETokenOneOf (int subIndex, List < REToken > options, boolean negative)
  {
    this (subIndex, options, null, negative);
  }

  RETokenOneOf (int subIndex, List < REToken > options,
                List < Object > addition, boolean negative)
  {
    super (subIndex);
    this.options = options;
    this.addition = addition;
    this.negative = negative;
    matchesOneChar = (negative || addition != null);
  }

  int getMinimumLength ()
  {
    if (matchesOneChar)
      return 1;
    int min = Integer.MAX_VALUE;
    int x;
  for (REToken t:options)
      {
        if ((x = t.getMinimumLength ()) < min)
          min = x;
      }
    return min;
  }

  int getMaximumLength ()
  {
    if (matchesOneChar)
      return 1;
    int max = 0;
    int x;
  for (REToken t:options)
      {
        if ((x = t.getMaximumLength ()) > max)
          max = x;
      }
    return max;
  }

  boolean match (CharIndexed input, REMatch mymatch)
  {
    setHitEnd (input, mymatch);
    if (matchesOneChar)
      return matchOneChar (input, mymatch);
    else
      return matchOneRE (input, mymatch);
  }

  boolean matchOneChar (CharIndexed input, REMatch mymatch)
  {
    REMatch tryMatch;
    boolean tryOnly;
    if (addition == null)
      {
        tryMatch = mymatch;
        tryOnly = false;
      }
    else
      {
        tryMatch = (REMatch) mymatch.clone ();
        tryOnly = true;
      }
    boolean b = negative ?
      matchN (input, tryMatch, tryOnly) : matchP (input, tryMatch, tryOnly);
    if (addition == null)
      return b;

    final Deque < Boolean > stack = new ArrayDeque < Boolean > ();
    stack.push (new Boolean (b));
  for (Object obj:addition)
      {
        if (obj instanceof REToken)
          {
            b = ((REToken) obj).match (input, (REMatch) mymatch.clone ());
            stack.push (new Boolean (b));
          }
        else if (obj instanceof Boolean)
          {
            stack.push ((Boolean) obj);
          }
        else if (obj.equals ("|"))
          {
            b = stack.pop ();
            b = stack.pop () || b;
            stack.push (new Boolean (b));
          }
        else if (obj.equals ("&"))
          {
            b = stack.pop ();
            b = stack.pop () && b;
            stack.push (new Boolean (b));
          }
        else
          {
            throw new RuntimeException ("Invalid object found");
          }
      }
    if (stack.pop ())
      {
        ++mymatch.index;
        return next (input, mymatch);
      }
    return false;
  }

  private boolean matchN (CharIndexed input, REMatch mymatch, boolean tryOnly)
  {
    if (input.charAt (mymatch.index) == CharIndexed.OUT_OF_BOUNDS)
      return false;

  for (REToken tk:options)
      {
        REMatch tryMatch = (REMatch) mymatch.clone ();
        if (tk.match (input, tryMatch))
          {                     // match was successful
            return false;
          }                     // is a match
      }                         // try next option

    if (tryOnly)
      return true;
    ++mymatch.index;
    return next (input, mymatch);
  }

  private boolean matchP (CharIndexed input, REMatch mymatch, boolean tryOnly)
  {
  for (REToken tk:options)
      {
        REMatch tryMatch = (REMatch) mymatch.clone ();
        if (tk.match (input, tryMatch))
          {                     // match was successful
            if (tryOnly)
              return true;
            if (next (input, tryMatch))
              {
                mymatch.assignFrom (tryMatch);
                return true;
              }
          }
      }
    return false;
  }

  private boolean matchOneRE (CharIndexed input, REMatch mymatch)
  {
    REMatch newMatch = findMatch (input, mymatch);
    if (newMatch != null)
      {
        mymatch.assignFrom (newMatch);
        return true;
      }
    return false;
  }

  REMatch findMatch (CharIndexed input, REMatch mymatch)
  {
    if (matchesOneChar)
      return super.findMatch (input, mymatch);
    return findMatch (input, mymatch, 0);
  }

  REMatch backtrack (CharIndexed input, REMatch mymatch, Object param)
  {
    return findMatch (input, mymatch, ((Integer) param).intValue ());
  }

  private REMatch findMatch (CharIndexed input, REMatch mymatch,
                             int optionIndex)
  {
    for (int i = optionIndex; i < options.size (); i++)
      {
        REToken tk = options.get (i);
        tk = (REToken) tk.clone ();
        tk.chain (getNext ());
        REMatch tryMatch = (REMatch) mymatch.clone ();
        if (tryMatch.backtrackStack == null)
          {
            tryMatch.backtrackStack = new BacktrackStack ();
          }
        boolean stackPushed = false;
        if (i + 1 < options.size ())
          {
            tryMatch.backtrackStack.push (new BacktrackStack.
                                          Backtrack (this, input, mymatch,
                                                     i + 1));
            stackPushed = true;
          }
        if (tk.match (input, tryMatch))
          {
            return tryMatch;
          }
        if (stackPushed)
          tryMatch.backtrackStack.pop ();
      }
    return null;
  }

  boolean returnsFixedLengthMatches ()
  {
    return matchesOneChar;
  }

  int findFixedLengthMatches (CharIndexed input, REMatch mymatch, int max)
  {
    if (!matchesOneChar)
      return super.findFixedLengthMatches (input, mymatch, max);
    int numRepeats = 0;
    REMatch m = (REMatch) mymatch.clone ();
    REToken tk = (REToken) this.clone ();
    tk.chain (null);
    while (true)
      {
        if (numRepeats >= max)
          break;
        m = tk.findMatch (input, m);
        if (m == null)
          break;
        numRepeats++;
      }
    return numRepeats;
  }

  void dump (CPStringBuilder os)
  {
    os.append (negative ? "[^" : "(?:");
    for (int i = 0; i < options.size (); i++)
      {
        if (!negative && (i > 0))
          os.append ('|');
        options.get (i).dumpAll (os);
      }
    os.append (negative ? ']' : ')');
  }
}