import gnu.trove.list.TLinkable; //导入依赖的package包/类
/** Empties the list. */
public void clear() {
    if ( null != _head ) {
        for ( TLinkable<T> link = _head.getNext();
              link != null;
              link = link.getNext() ) {
            TLinkable<T> prev = link.getPrevious();
            prev.setNext( null );
            link.setPrevious( null );
        }
        _head = _tail = null;
    }
    _size = 0;
}
 

import gnu.trove.list.TLinkable; //导入依赖的package包/类
/**
 * Copies the list to a native array, destroying the next/previous
 * links as the copy is made.  This list will be emptied after the
 * copy (as if clear() had been invoked).  The Object[] array
 * returned will contain TLinkables that do <b>not</b> hold
 * references to one another and so are less likely to be the
 * cause of memory leaks.
 *
 * @return an <code>Object[]</code> value
 */
public Object[] toUnlinkedArray() {
    Object[] o = new Object[_size];
    int i = 0;
    for ( TLinkable<T> link = _head, tmp; link != null; i++ ) {
        o[i] = link;
        tmp = link;
        link = link.getNext();
        tmp.setNext( null ); // clear the links
        tmp.setPrevious( null );
    }
    _size = 0;              // clear the list
    _head = _tail = null;
    return o;
}
 

import gnu.trove.list.TLinkable; //导入依赖的package包/类
/**
 * A linear search for <tt>o</tt> in the list.
 *
 * @param o an <code>Object</code> value
 * @return a <code>boolean</code> value
 */
public boolean contains( Object o ) {
    for ( TLinkable<T> link = _head; link != null; link = link.getNext() ) {
        if ( o.equals( link ) ) {
            return true;
        }
    }
    return false;
}
 

import gnu.trove.list.TLinkable; //导入依赖的package包/类
/** Empties the list. */
@Override
public void clear() {
    if ( null != _head ) {
        for ( TLinkable<T> link = _head.getNext();
              link != null;
              link = link.getNext() ) {
            TLinkable<T> prev = link.getPrevious();
            prev.setNext( null );
            link.setPrevious( null );
        }
        _head = _tail = null;
    }
    _size = 0;
}
 

import gnu.trove.list.TLinkable; //导入依赖的package包/类
/**
 * A linear search for <tt>o</tt> in the list.
 *
 * @param o an <code>Object</code> value
 * @return a <code>boolean</code> value
 */
@Override
public boolean contains( Object o ) {
    for ( TLinkable<T> link = _head; link != null; link = link.getNext() ) {
        if ( o.equals( link ) ) {
            return true;
        }
    }
    return false;
}
 

import gnu.trove.list.TLinkable; //导入依赖的package包/类
/**
 * Removes the specified element from the list.  Note that
 * it is the caller's responsibility to ensure that the
 * element does, in fact, belong to this list and not another
 * instance of TLinkedList.
 *
 * @param o a TLinkable element already inserted in this list.
 * @return true if the element was a TLinkable and removed
 */
@SuppressWarnings({"unchecked"})
public boolean remove( Object o ) {
    if ( o instanceof TLinkable ) {
        T p, n;
        TLinkable<T> link = (TLinkable<T>) o;

        p = link.getPrevious();
        n = link.getNext();

        if ( n == null && p == null ) { // emptying the list
            // It's possible this object is not something that's in the list. So,
            // make sure it's the head if it doesn't point to anything. This solves
            // problems caused by removing something multiple times.
            if ( o != _head ) {
                return false;
            }

            _head = _tail = null;
        } else if ( n == null ) { // this is the tail
            // make previous the new tail
            link.setPrevious( null );
            p.setNext( null );
            _tail = p;
        } else if ( p == null ) { // this is the head
            // make next the new head
            link.setNext( null );
            n.setPrevious( null );
            _head = n;
        } else {            // somewhere in the middle
            p.setNext( n );
            n.setPrevious( p );
            link.setNext( null );
            link.setPrevious( null );
        }

        _size--;            // reduce size of list
        return true;
    } else {
        return false;
    }
}
 

import gnu.trove.list.TLinkable; //导入依赖的package包/类
/**
 * Removes the specified element from the list.  Note that
 * it is the caller's responsibility to ensure that the
 * element does, in fact, belong to this list and not another
 * instance of TLinkedList.
 *
 * @param o a TLinkable element already inserted in this list.
 * @return true if the element was a TLinkable and removed
 */
@Override
@SuppressWarnings("unchecked")
public boolean remove( Object o ) {
    if ( o instanceof TLinkable ) {
        T p, n;
        TLinkable<T> link = (TLinkable<T>) o;

        p = link.getPrevious();
        n = link.getNext();

        if ( n == null && p == null ) { // emptying the list
            // It's possible this object is not something that's in the list. So,
            // make sure it's the head if it doesn't point to anything. This solves
            // problems caused by removing something multiple times.
            if ( o != _head ) {
                return false;
            }

            _head = _tail = null;
        } else if ( n == null ) { // this is the tail
            // make previous the new tail
            link.setPrevious( null );
            p.setNext( null );
            _tail = p;
        } else if ( p == null ) { // this is the head
            // make next the new head
            link.setNext( null );
            n.setPrevious( null );
            _head = n;
        } else {            // somewhere in the middle
            p.setNext( n );
            n.setPrevious( p );
            link.setNext( null );
            link.setPrevious( null );
        }

        _size--;            // reduce size of list
        return true;
    } else {
        return false;
    }
}