LinkedList implements
    Externalizable { public void clear() { while ( removeFirst() != null ) { } } LinkedList();  LinkedList(final T node); void readExternal(ObjectInput in); void writeExternal(ObjectOutput out); void add(final T node); void addLast(final T node); void addFirst(final T node); void remove(final T node); boolean contains(T node); final T getFirst(); final T getLast(); T removeFirst(); void insertAfter(final T existingNode,
                            final T newNode); T removeLast(); T get(int i); final boolean isEmpty(); void clear(); final int size(); int hashCode(); boolean equals(final Object object); FastIterator iterator(); FastIterator fastIterator(); java.util.Iterator<T> javaUtilIterator(); static final FastIterator fastIterator; }
@Test public void testClear() { this.list.add( this.node1 ); this.list.add( this.node2 ); this.list.add( this.node3 ); assertEquals( "List size should be 3", this.list.size(), 3 ); this.list.clear(); assertEquals( "Empty list should have size 0", this.list.size(), 0 ); }