1 /*******************************************************************************
2 * Jalview - A Sequence Alignment Editor and Viewer ($$Version-Rel$$)
3 * Copyright (C) $(date) The Jalview Authors
5 * This file is part of Jalview.
7 * Jalview is free software: you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation, either version 3
10 * of the License, or (at your option) any later version.
12 * Jalview is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty
14 * of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 * PURPOSE. See the GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with Jalview. If not, see <http://www.gnu.org/licenses/>.
19 * The Jalview Authors are detailed in the 'AUTHORS' file.
20 *******************************************************************************/
22 // This software is now distributed according to
23 // the Lesser Gnu Public License. Please see
24 // http://www.gnu.org/copyleft/lesser.txt for
26 // -- Happy Computing!
28 package com.stevesoft.pat;
30 import java.util.Hashtable;
31 import java.util.Vector;
34 * This class implements the (?: ... ) extended Pattern. It provides a base
35 * class from which we derive the [ ... ], ( ... ), (?! ... ), and (?= ... )
38 class Or extends Pattern
64 public Or addOr(Pattern p)
72 public String toString()
75 StringBuffer sb = new StringBuffer();
76 sb.append(leftForm());
79 sb.append(((Pattern) v.elementAt(0)).toString());
81 for (i = 1; i < v.size(); i++)
84 sb.append(((Pattern) v.elementAt(i)).toString());
86 sb.append(rightForm());
87 sb.append(nextString());
91 public int matchInternal(int pos, Pthings pt)
95 pv = new Pattern[v.size()];
98 for (int i = 0; i < v.size(); i++)
100 Pattern p = pv[i]; // (Pattern)v.elementAt(i);
101 int r = p.matchInternal(pos, pt);
110 public patInt minChars()
114 return new patInt(0);
116 patInt m = ((Pattern) v.elementAt(0)).countMinChars();
117 for (int i = 1; i < v.size(); i++)
119 Pattern p = (Pattern) v.elementAt(i);
120 m.mineq(p.countMinChars());
125 public patInt maxChars()
129 return new patInt(0);
131 patInt m = ((Pattern) v.elementAt(0)).countMaxChars();
132 for (int i = 1; i < v.size(); i++)
134 Pattern p = (Pattern) v.elementAt(i);
135 m.maxeq(p.countMaxChars());
140 Pattern clone1(Hashtable h)
145 for (int i = 0; i < v.size(); i++)
147 o.v.addElement(((Pattern) v.elementAt(i)).clone(h));