com.thesett.common.util.StackQueue Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of junit-toolkit Show documentation

JUnit Toolkit enhances JUnit with performance testing, asymptotic behaviour analysis, and concurrency testing.

There is a newer version: 0.9.52

/*
 * Copyright The Sett Ltd, 2005 to 2014.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package com.thesett.common.util;

import java.util.LinkedList;

/**
 * The Stack class in java.util (most unhelpfully) does not implement the Queue interface. This is an implementation of
 * a stack that does implement the Queue interface.
 *
 * 
 * CRC Card Responsibilities  Collaborations
 * 
 Provide a queue that works as a LIFO stack.
 * 
 *
 * @author Rupert Smith
 */
public class StackQueue extends LinkedList implements Queue
{
    /**
     * Inserts the specified element into this queue, if possible.
     *
     * @param  o The data element to push onto the stack.
     *
     * @return True if it was added to the stack, false otherwise (this implementation always returns true).
     */
    public boolean offer(E o)
    {
        super.add(0, o);

        return true;
    }

    /**
     * Appends the specified element to the end of this list.
     *
     * This method is equivalent to {@link #addLast}.
     *
     * @param  e element to be appended to this list
     *
     * @return true (as specified by {@link java.util.Collection#add})
     */
    public boolean add(E e)
    {
        super.add(0, e);

        return true;
    }
}