LinkedList implements
    Externalizable { public final T getFirst() { return this.firstNode; } 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 testGetFirst() { assertNull( "Empty list should return null on getFirst()", this.list.getFirst() ); this.list.add( this.node1 ); assertSame( "List should return node1 on getFirst()", this.list.getFirst(), this.node1 ); this.list.add( this.node2 ); assertSame( "List should return node1 on getFirst()", this.list.getFirst(), this.node1 ); this.list.add( this.node3 ); assertSame( "List should return node1 on getFirst()", this.list.getFirst(), this.node1 ); }