Splits the list. : List « Collections Data Structure « Java

Splits the list.

 * Copyright 2004-2010 the Seasar Foundation and the Others.
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *     http://www.apache.org/licenses/LICENSE-2.0
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * either express or implied. See the License for the specific language
 * governing permissions and limitations under the License.
//package org.slim3.util;

import java.util.ArrayList;
import java.util.List;

 * A utility for {@link List}.
 * @author higa
 * @since 1.0.0
public final class ListUtil {

     * Splits the list.
     * @param <T>
     *            the type of list element
     * @param list
     *            the list
     * @param size
     *            the piece size
     * @return the split lists.
     * @throws NullPointerException
     *             if the list parameter is null
     * @throws IllegalArgumentException
     *             if the size parameter is less than 1
    public static <T> List<List<T>> split(List<T> list, int size)
            throws NullPointerException, IllegalArgumentException {
        if (list == null) {
            throw new NullPointerException("The list parameter is null.");
        if (size <= 0) {
            throw new IllegalArgumentException(
                "The size parameter must be more than 0.");
        int num = list.size() / size;
        int mod = list.size() % size;
        List<List<T>> ret = new ArrayList<List<T>>(mod > 0 ? num + 1 : num);
        for (int i = 0; i < num; i++) {
            ret.add(list.subList(i * size, (i + 1) * size));
        if (mod > 0) {
            ret.add(list.subList(num * size, list.size()));
        return ret;

    private ListUtil() {


Related examples in the same category

1.Using the Double Brace Initialization.
2.Add to end Performance compare: LinkList and ArrayListAdd to end Performance compare: LinkList and ArrayList
3.Add to start Performance compare: LinkList and ArrayList
4.Convert array to list and sortConvert array to list and sort
5.Shuffle a listShuffle a list
6.Sort a listSort a list
7.Bidirectional Traversal with ListIteratorBidirectional Traversal with ListIterator
8.Int listInt list
9.Linked List example
10.List to array
11.List Reverse Test
12.Build your own Linked List class
13.List Search Test List Search Test
14.Convert a List to a Set
15.Set Operating on Lists: addAll, removeAll, retainAll, subList
16.Convert collection into array
17.Convert LinkedList to array
18.Convert Set into List
19.If a List contains an item
20.ListSet extends List and Set
21.List containing other lists
22.Helper method for creating list
23.Generic to list
24.List implementation with lazy array construction and modification tracking.
25.Utility methods for operating on memory-efficient lists. All lists of size 0 or 1 are assumed to be immutable.
26.A class that wraps an array with a List interface.
27.Slice a list
28.A List that, like a Set, contains no duplicate Elements.
29.Determines if the given lists contain the same elements. We suppose that all the elements of the given lists are different.
30.List that allows items to be added with a priority that will affect the order in which they are later iterated over.