---

AUnit.java

package edu.ksu.cis.bandera.specification.pattern.node;

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
 * Bandera, a Java(TM) analysis and transformation toolkit           *
 * Copyright (C) 1998-2001 SAnToS Laboratories (santos@cis.ksu.edu)  *

 * All rights reserved.                                              *
 *                                                                   *
 * This work was done as a project in the SAnToS Laboratory,         *
 * Department of Computing and Information Sciences, Kansas State    *
 * University, USA (http://www.cis.ksu.edu/santos).                  *
 * It is understood that any modification not identified as such is  *
 * not covered by the preceding statement.                           *
 *                                                                   *
 * This work is free software; you can redistribute it and/or        *
 * modify it under the terms of the GNU Library General Public       *
 * License as published by the Free Software Foundation; either      *
 * version 2 of the License, or (at your option) any later version.  *
 *                                                                   *
 * This work 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 *
 * Library General Public License for more details.                  *
 *                                                                   *
 * You should have received a copy of the GNU Library General Public *
 * License along with this toolkit; if not, write to the             *
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,      *
 * Boston, MA  02111-1307, USA.                                      *
 *                                                                   *
 * Java is a trademark of Sun Microsystems, Inc.                     *
 *                                                                   *
 * To submit a bug report, send a comment, or get the latest news on *
 * this project and other SAnToS projects, please visit the web-site *
 *                http://www.cis.ksu.edu/santos                      *
 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/* This file was generated by SableCC (http://www.sable.mcgill.ca/sablecc/). */

import java.util.*;
import edu.ksu.cis.bandera.specification.pattern.analysis.*;

public final class AUnit extends PUnit
{
    private final LinkedList _pattern_ = new TypedLinkedList(new Pattern_Cast());

    private class Pattern_Cast implements Cast
    {
        public Object cast(Object o)
        {
            PPattern node = (PPattern) o;

            if((node.parent() != null) &&
                (node.parent() != AUnit.this))
            {
                node.parent().removeChild(node);
            }

            if((node.parent() == null) ||
                (node.parent() != AUnit.this))
            {
                node.parent(AUnit.this);
            }

            return node;
        }
    }
    public AUnit()
    {
    }
    public AUnit(
        XPPattern _pattern_)
    {
        if(_pattern_ != null)
        {
            while(_pattern_ instanceof X1PPattern)
            {
                this._pattern_.addFirst(((X1PPattern) _pattern_).getPPattern());
                _pattern_ = ((X1PPattern) _pattern_).getXPPattern();
            }
            this._pattern_.addFirst(((X2PPattern) _pattern_).getPPattern());
        }

    }
    public AUnit(
        List _pattern_)
    {
        {
            Object temp[] = _pattern_.toArray();
            for(int i = 0; i < temp.length; i++)
            {
                this._pattern_.add(temp[i]);
            }
        }

    }
    public void apply(Switch sw)
    {
        ((Analysis) sw).caseAUnit(this);
    }
    public Object clone()
    {
        return new AUnit(
            cloneList(_pattern_));
    }
    public LinkedList getPattern()
    {
        return _pattern_;
    }
    void removeChild(Node child)
    {
        if(_pattern_.remove(child))
        {
            return;
        }

    }
    void replaceChild(Node oldChild, Node newChild)
    {
        for(ListIterator i = _pattern_.listIterator(); i.hasNext();)
        {
            if(i.next() == oldChild)
            {
                if(newChild != null)
                {
                    i.set(newChild);
                    oldChild.parent(null);
                    return;
                }

                i.remove();
                oldChild.parent(null);
                return;
            }
        }

    }
    public void setPattern(List list)
    {
        Object temp[] = list.toArray();
        for(int i = 0; i < temp.length; i++)
        {
            _pattern_.add(temp[i]);
        }
    }
    public String toString()
    {
        return ""
            + toString(_pattern_);
    }
}

---