Examples of java.util.ArrayList.subList()

java.util.ArrayList.subList()
Returns a view of the portion of this list between the specified {@code fromIndex}, inclusive, and {@code toIndex}, exclusive. (If {@code fromIndex} and {@code toIndex} are equal, the returned list isempty.) The returned list is backed by this list, so non-structural changes in the returned list are reflected in this list, and vice-versa. The returned list supports all of the optional list operations.
This method eliminates the need for explicit range operations (of the sort that commonly exist for arrays). Any operation that expects a list can be used as a range operation by passing a subList view instead of a whole list. For example, the following idiom removes a range of elements from a list:
```
 list.subList(from, to).clear(); 
```
Similar idioms may be constructed for {@link #indexOf(Object)} and{@link #lastIndexOf(Object)}, and all of the algorithms in the {@link Collections} class can be applied to a subList.
The semantics of the list returned by this method become undefined if the backing list (i.e., this list) is structurally modified in any way other than via the returned list. (Structural modifications are those that change the size of this list, or otherwise perturb it in such a fashion that iterations in progress may yield incorrect results.) @throws IndexOutOfBoundsException {@inheritDoc} @throws IllegalArgumentException {@inheritDoc}

        Date begin0 = ((KalendarEvent) arg0).getBegin();
        Date begin1 = ((KalendarEvent) arg1).getBegin();
        return begin0.compareTo(begin1);
      }
    });
    if (events.size() > MAX_EVENTS) events = events.subList(0, MAX_EVENTS);
    return events;
  }
  
  /**
   * @see org.olat.core.gui.control.DefaultController#event(org.olat.core.gui.UserRequest,

View Full Code Here

        if (!indexedList)
        {
            if (list.size() > (endIdx-startIdx))
            {
                // Iterator hasn't restricted what is returned so do the index range restriction here
                return list.subList(startIdx, endIdx);
            }
        }
        return list;
    }

View Full Code Here

        }
        final Map tags2 = new HashMap();
        for(final Iterator iter = tags.keySet().iterator();iter.hasNext();) {
            final LispValue tag = (LispValue)iter.next();
            final int index = ((Integer)tags.get(tag)).intValue();
            tags2.put(tag,progns.subList(index,progns.size()));
        }


        compiler.getLegalTags().push(tags.keySet());


        final Map tags3 = new HashMap();

View Full Code Here


        parent.deleteChild(node.getValue());


        if (notify )
        {
          this.notifyRemove(path.subList(0,i).toArray(),indices,new Object[]{node});
        }


        node = parent;
        parent = node.getParent();
        i--;

View Full Code Here

    for (int i = 0; i < 10; i++) {
      al.add(new Integer(i));
    }
    assertTrue(
        "Sublist returned should have implemented Random Access interface",
        al.subList(3, 7) instanceof RandomAccess);


    List ll = new LinkedList();
    for (int i = 0; i < 10; i++) {
      ll.add(new Integer(i));
    }

View Full Code Here

     */
    public void test_subList_empty() {
        // Regression for HARMONY-389
        List al = new ArrayList();
        al.add("one");
        List emptySubList = al.subList(0, 0);


        try {
            emptySubList.get(0);
            fail("emptySubList.get(0) should throw IndexOutOfBoundsException");
        } catch (IndexOutOfBoundsException e) {

View Full Code Here

    public void test_subList_addAll() {
        // Regression for HARMONY-390
        List mainList = new ArrayList();
        Object[] mainObjects = { "a", "b", "c" };
        mainList.addAll(Arrays.asList(mainObjects));
        List subList = mainList.subList(1, 2);
        assertFalse("subList should not contain \"a\"", subList.contains("a"));
        assertFalse("subList should not contain \"c\"", subList.contains("c"));
        assertTrue("subList should contain \"b\"", subList.contains("b"));


        Object[] subObjects = { "one", "two", "three" };

View Full Code Here

        new Support_ListTest("", alist).runTest();


        ArrayList subList = new ArrayList();
        for (int i = -50; i < 150; i++)
            subList.add(new Integer(i));
        new Support_ListTest("", subList.subList(50, 150)).runTest();
    }


    /**
     * @tests java.util.ArrayList#ArrayList(int)
     */

View Full Code Here

    new Support_ListTest("", alist).runTest();


    ArrayList subList = new ArrayList();
    for (int i = -50; i < 150; i++)
      subList.add(new Integer(i));
    new Support_ListTest("", subList.subList(50, 150)).runTest();
  }


  /**
   * @tests java.util.ArrayList#ArrayList(int)
   */

View Full Code Here

    list.add("1");
    list.add("1");
    list.add("2");
    list.add("1");
    list.add("1");
    List subList = list.subList(0, 5);


    kryo.setRegistrationRequired(false);
    kryo.register(ArrayList.class);
    Class<List> subListClass = (Class<List>)subList.getClass();
    if(subListClass.getName().equals("java.util.ArrayList$SubList")) {

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

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.