MSortedCollection.java

Go to the documentation of this file.

/*
 * (c) copyright 2008, Technische Universitaet Graz and Technische Universitaet Wien
 *
 * This file is part of jdiagengine.
 *
 * jdiagengine 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 3 of the License, or
 * (at your option) any later version.
 *
 * jdiagengine 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 jdiagengine. If not, see <http://www.gnu.org/licenses/>.
 *
 * Authors: Joerg Weber, Franz Wotawa
 * Contact: jweber@ist.tugraz.at (preferred), or fwotawa@ist.tugraz.at
 *
 */


package utils;

import java.util.*;

public class MSortedCollection extends Object {

    protected int elementCount = 0;
    protected MSortedCollectionNode topNode = null;

    public MSortedCollection() {
        topNode = new MSortedCollectionNode();
    }

    public void addElement(MSortedElementInterface element) {
        elementCount = elementCount + 1;
        topNode.addElement(element);
    }

    public void addAllElements(ArrayList v) {
        Iterator e = v.iterator();
        while (e.hasNext()) {
            addElement((MSortedElementInterface)e.next());
        }
    }


    public void removeElement(MSortedElementInterface element) {
    }

    public void removeAllElements() {
        elementCount = 0;
        topNode = new MSortedCollectionNode();
    }

    public int size() {
        return elementCount;
    }

    public Iterator elements() {
        return (topNode.allElements()).iterator();
    }

    public ArrayList elementsVector() {
        return topNode.allElements();
    }

    public Iterator elementsInverse() {
        return (topNode.allElementsInverse()).iterator();
    }

    public ArrayList elementsVectorInverse() {
        return topNode.allElementsInverse();
    }

}