001package components.queue;
002
003import java.util.Comparator;
004import java.util.Iterator;
005
006/**
007 * Layered implementations of secondary methods for {@code Queue}.
008 *
009 * <p>
010 * Assuming execution-time performance of O(1) for method {@code iterator} and
011 * its return value's method {@code next}, execution-time performance of
012 * {@code front} as implemented in this class is O(1). Execution-time
013 * performance of {@code replaceFront} and {@code flip} as implemented in this
014 * class is O(|{@code this}|). Execution-time performance of {@code append} as
015 * implemented in this class is O(|{@code q}|). Execution-time performance of
016 * {@code sort} as implemented in this class is O(|{@code this}| log
017 * |{@code this}|) expected, O(|{@code this}|^2) worst case. Execution-time
018 * performance of {@code rotate} as implemented in this class is
019 * O({@code distance} mod |{@code this}|).
020 *
021 * @param <T>
022 *            type of {@code Queue} entries
023 */
024public abstract class QueueSecondary<T> implements Queue<T> {
025
026    /*
027     * 2221/2231 assignment code deleted.
028     */
029
030}