/**
 * A linked implementation of in which elements maintain their 
 * relative positions.
 *
 * @author Samuel A. Rebelsky
 * @author Your Name Here.
 * @version 1.0 of April 2000 [Only Stubs]
 */
public class DoublyLinkedSequencedList
    implements SequencedList
{
    // +--------+--------------------------------------------------
    // | Fields |
    // +--------+

    // +--------------+--------------------------------------------
    // | Constructors |
    // +--------------+

    // +------------------+----------------------------------------
    // | Standard Methods |
    // +------------------+

    /**
     * Convert the list to a string (typically in preparation
     * for printing).
     */
    public String toString() {
        return "()";  // STUB
    } // toString()

    // +-----------+-----------------------------------------------
    // | Iterators |
    // +-----------+

    /**
     * Get the current element of the list.
     */
    public Object getCurrent()
        throws ListException
    {
        return null;  // STUB
    } // getCurrent()

    /**
     * Advance the current element to the next element.
     */
    public void advanceCurrent()
        throws ListException
    {
        // STUB
    } // advanceCurrent()

    /**
     * Move the current element to the previous element.
     */
    public void retreatCurrent()
        throws ListException
    {
        // STUB
    } // retreatCurrent()

    /**
     * Determine if the current element is the first element.
     * Pre: (none)
     * Post: Returns true if the current element is the first element.
     *       Returns false otherwise.
     */
    public boolean atFront() {
        return false;  // STUB
    } // atFront()


    /**
     * Determine if the current element is the last element.
     */
    public boolean atEnd() {
        return false;  // STUB
    } // atEnd()

    /**
     * Reset the current element to the front of the list.
     */
    public void toFront() {
        // STUB
    } // toFront()

    /**
     * Reset the current element to the end of the list.
     */
    public void toEnd() {
        // STUB
    } // toEnd()

    // +-----------+-----------------------------------------------
    // | Accessors |
    // +-----------+

    /**
     * Determine if a list contains a particular element.
     */
    public boolean contains(Object element) {
        return false;  // STUB
    } // contains(Object)

    /**
     * Get the length of the list.
     */
    public int length() {
        return 0;  // STUB
    } // length()


    // +-----------+-----------------------------------------------
    // | Modifiers |
    // +-----------+

    /**
     * Add an element to the front of the list.
     */
    public void addToFront(Object element) {
        // STUB
    } // addToFront(Object)

    /**
     * Add an element to the end of the list.
     */
    public void addToEnd(Object element) {
        // STUB
    } // addToEnd(Object)

    /**
     * Add an element immediately after the current element.
     */
    public void addAfterCurrent(Object element) {
        // STUB
    } // addAfterCurrent(Object)

    /**
     * Add an element immediately before the current element.
     */
    public void addBeforeCurrent(Object element) {
        // STUB
    } // addBeforeCurrent(Object)

    /**
     * Delete the first copy of element from the list.
     */
    public void delete(Object element) {
        // STUB
    } // delete(Object)

    /**
     * Delete the current element of the list.
     */
    public void deleteCurrent() {
        // STUB
    } // delete(Object)

} // interface SequencedList