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}

        if (args != null && args.length > 0) {
            ArrayList<String> argList = new ArrayList(Arrays.asList(args));
            int pos = argList.indexOf("-p4");
            if (pos != -1) {
                List<String> p4CmdLine = new ArrayList<String>();
                p4CmdLine.addAll(argList.subList(pos+1, argList.size()));
                argList.subList(pos, argList.size()).clear();


                String firstArg = p4CmdLine.get(0);
                File firstArgFile = new File(firstArg);
                if (!(firstArg.toLowerCase().contains("p4")

View Full Code Here

            ArrayList<String> argList = new ArrayList(Arrays.asList(args));
            int pos = argList.indexOf("-p4");
            if (pos != -1) {
                List<String> p4CmdLine = new ArrayList<String>();
                p4CmdLine.addAll(argList.subList(pos+1, argList.size()));
                argList.subList(pos, argList.size()).clear();


                String firstArg = p4CmdLine.get(0);
                File firstArgFile = new File(firstArg);
                if (!(firstArg.toLowerCase().contains("p4")
                        && firstArgFile.isFile()))

View Full Code Here


        while (!doomedIds.isEmpty()) {
            int size = doomedIds.size();
            int end = (batchSize < size) ? batchSize : size;


            List<Integer> idBatch = doomedIds.subList(0, end);
            query.setParameter("ids", idBatch);
            query.executeUpdate();


            // Advance our progress and possibly help GC. This will remove the processed ids from the backing list
            idBatch.clear();

View Full Code Here

        Collections.shuffle(bel, new Random(53672));
        assertEquals(replay, bel);


        List s = new ArrayList(bel);
        Collections.shuffle(s);
        s = s.subList(10, 90);
        bel.retainAll(s);
        assertEquals(replay, bel);


        s = new ArrayList(bel);
        Collections.shuffle(s);

View Full Code Here

        bel.retainAll(s);
        assertEquals(replay, bel);


        s = new ArrayList(bel);
        Collections.shuffle(s);
        s = s.subList(10, 20);
        bel.removeAll(s);
        assertEquals(replay, bel);
    }
}

View Full Code Here

          sublist.add(entries[j]);
        }
      }
      Collections.sort(sublist);
      if (sublist.size() > MAX_SIZE) {
        sublist = sublist.subList(0, MAX_SIZE);
      }
      list.addAll(sublist);
      sublist.clear();
    }
    for (int i=0; i<list.size(); i++) {

View Full Code Here

            if( beg >= count.intValue()) return new Object[] { count, new ArrayList() }; // Return an empty array if start is beyond end.
            int end = beg + numrecords.intValue();
            if( beg < 0 || end < beg ) return new Object[] { count, hist }; // Return entire array if either start or numrecords is less than 0.
            if( end > count.intValue() ) end = count.intValue();


            return new Object[] { count, hist.subList( beg, end ) };


        } catch( NullPointerException e ) {


            return new Object[] { count, hist };

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

          sublist.add(entries[j]);
        }
      }
      Collections.sort(sublist);
      if (sublist.size() > MAX_SIZE) {
        sublist = sublist.subList(0, MAX_SIZE);
      }
      list.addAll(sublist);
      sublist.clear();
    }
    for (int i=0; i<list.size(); i++) {

View Full Code Here


        // sort the hits
        Collections.sort(mdhList, iv_mdhComparator);


        // truncate off the hits
        mdhList.subList(iv_mdhCount, mdhList.size()).clear();
        
        return mdhList;
    }
}

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.