---

LocVector.java

package edu.ksu.cis.bandera.bir;

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
 * Bandera, a Java(TM) analysis and transformation toolkit           *
 * Copyright (C) 1998, 1999   James Corbett (corbett@hawaii.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                      *
 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
import ca.mcgill.sable.util.*;

/**
 * A vector of Locations.
 */

public class LocVector { 

    int size = 0;
    Location [] data;

    public LocVector() { this(5); }
    public LocVector(int capacity) {
    data = new Location[capacity];
    }
    public LocVector(Location x) {
    this(5);
    addElement(x);
    }
    public void addElement(Location x) {
    if (x == null)
        throw new RuntimeException("Element cannot be null");
    if (size == data.length)
        expand();
    data[size++] = x;
    }
    public Location bottom() { 
    if (size == 0)
        throw new RuntimeException("Cannot bottom() empty vector");
    return data[0]; 
    }
    public boolean contains(Location x) {
    for (int i = 0; i < size; i++) 
        if (data[i].equals(x))
        return true;
    return false;
    }
    public Location elementAt(int pos) {
    if (pos < 0 || pos >= size) 
        throw new RuntimeException("Position invalid: " + pos);
    return data[pos];
    }
    void expand() {
    Location [] newData = new Location[data.length * 2];
    for (int i = 0; i < data.length; i++) 
        newData[i] = data[i];
    data = newData;
    }
    public Location firstElement() { return elementAt(0); }
    public void insertElementAt(Location x, int pos) {
    if (x == null)
        throw new RuntimeException("Element cannot be null");
    if (size == data.length)
        expand();
    if (pos > size || pos < 0)
        throw new RuntimeException("Position invalid: " + pos);
    for (int i = size; i > pos; i--) 
        data[i] = data[i-1];
    data[pos] = x;
    size++;
    }
    public Location pop() {
    if (size == 0)
        throw new RuntimeException("Cannot pop() empty vector");
    size--;
    return data[size];
    }
    public void push(Location x) {
    addElement(x);
    }
    public boolean removeElement(Location x) {
    int pos = 0;
    while (pos < size && data[pos] != x) 
        pos++;
    if (pos == size)
        return false;
    for (int i = pos; i < size - 1; i++) 
        data[i] = data[i+1];
    size--;
    return true;
    }
    public int size() { return size; }
    public Location top() { 
    if (size == 0)
        throw new RuntimeException("Cannot top() empty vector");
    return data[size-1]; 
    }
}

---