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;
32 /** Implements the parenthesis pattern subelement. */
33 class OrMark extends Or
35 SubMark sm = new SubMark();
50 public Pattern getNext()
55 public int matchInternal(int pos, Pthings pt)
57 sm.next = super.getNext();
60 int n2 = 2 * pt.nMarks + 2;
61 pt.marks = new int[n2];
62 for (int i = 0; i < n2; i++)
68 int ret = super.matchInternal(pos, pt);
73 else if (pt.marks[id] > pt.marks[id + pt.nMarks])
75 int swap = pt.marks[id];
76 pt.marks[id] = pt.marks[id + pt.nMarks] + 1;
77 pt.marks[id + pt.nMarks] = swap + 1;
82 public Pattern clone1(Hashtable h)
84 OrMark om = new OrMark(id);
87 for (int i = 0; i < v.size(); i++)
89 om.v.addElement(((Pattern) v.elementAt(i)).clone(h));