Examples of java.util.AbstractSequentialList

java.util.AbstractSequentialList
This class provides a skeletal implementation of the List interface to minimize the effort required to implement this interface backed by a "sequential access" data store (such as a linked list). For random access data (such as an array), AbstractList should be used in preference to this class.
This class is the opposite of the AbstractList class in the sense that it implements the "random access" methods (get(int index), set(int index, E element), add(int index, E element) and remove(int index)) on top of the list's list iterator, instead of the other way around.
To implement a list the programmer needs only to extend this class and provide implementations for the listIterator and size methods. For an unmodifiable list, the programmer need only implement the list iterator's hasNext, next, hasPrevious, previous and index methods.
For a modifiable list the programmer should additionally implement the list iterator's set method. For a variable-size list the programmer should additionally implement the list iterator's remove and add methods.
The programmer should generally provide a void (no argument) and collection constructor, as per the recommendation in the Collection interface specification.
This class is a member of the Java Collections Framework. @author Josh Bloch @author Neal Gafter @version 1.36, 04/21/06 @see Collection @see List @see AbstractList @see AbstractCollection @since 1.2


    /**
     * @tests java.util.AbstractSequentialList#get(int)
     */
    public void test_get() {
        AbstractSequentialList list = new MyAbstractSequentialList();
        list.add(1);
        list.add("value");
        assertEquals(1, list.get(0));
        assertEquals("value", list.get(1));


        // get value by index which is out of bounds
        try {
            list.get(list.size());
            fail("Should throw IndexOutOfBoundsException.");
        } catch (IndexOutOfBoundsException e) {
            // expected
        }
        try {
            list.get(-1);
            fail("Should throw IndexOutOfBoundsException.");
        } catch (IndexOutOfBoundsException e) {
            // expected
        }

View Full Code Here


    /**
     * @tests java.util.AbstractSequentialList#remove(int)
     */
    public void test_remove() {
        AbstractSequentialList list = new MyAbstractSequentialList();
        list.add(1);


        // normal test
        assertEquals(1, list.remove(0));


        list.add("value");
        assertEquals("value", list.remove(0));


        // remove index is out of bounds
        try {
            list.remove(list.size());
            fail("Should throw IndexOutOfBoundsException.");
        } catch (IndexOutOfBoundsException e) {
            // expected
        }
        try {
            list.remove(-1);
            fail("Should throw IndexOutOfBoundsException.");
        } catch (IndexOutOfBoundsException e) {
            // expected
        }


        // list dont't support remove operation
        try {
            AbstractSequentialList mylist = new MockAbstractSequentialList();
            mylist.remove(0);
            fail("Should throw UnsupportedOperationException.");
        } catch (UnsupportedOperationException e) {
            // expected
        }
    }

View Full Code Here

    this.keyToKeyTail.clear();
  }


  public List get(final Object paramObject)
  {
    return new AbstractSequentialList()
    {
      public int size()
      {
        return LinkedListMultimap.this.keyCount.count(paramObject);
      }

View Full Code Here


  public List values()
  {
    Object localObject = this.valuesList;
    if (localObject == null)
      this.valuesList = (localObject = new AbstractSequentialList()
      {
        public int size()
        {
          return LinkedListMultimap.this.keyCount.size();
        }

View Full Code Here


  public List entries()
  {
    Object localObject = this.entries;
    if (localObject == null)
      this.entries = (localObject = new AbstractSequentialList()
      {
        public int size()
        {
          return LinkedListMultimap.this.keyCount.size();
        }

View Full Code Here

TOP

Related Classes of java.util.AbstractSequentialList

com.google.common.collect.LinkedListMultimap

org.apache.harmony.luni.tests.java.util.AbstractSequentialListTest

org.zkoss.zul.Listbox

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.