Java Utililty Methods List Sub List

List<T> subList = new ArrayList<>();
for (int i = start; i < end; i++) {
    if (list.size() > i) {
        subList.add(list.get(i));
    } else {
        break;
return subList;

int fromIndex = Math.min(start, list.size());
int toIndex = Math.min(fromIndex + limit, list.size());
return list.subList(fromIndex, toIndex);

if (list == null) {
    return null;
int end = start + max;
return list.subList(Math.max(0, start), Math.min(list.size(), end));

if (list == null || list.size() == 0) {
    return list;
if (indexs == null || indexs.length == 0) {
    return new ArrayList<T>(0);
List<T> result = new ArrayList<T>(indexs.length);
for (int index : indexs) {
...

return origin.subList(start, start + length);

List<T> l = new ArrayList<T>();
for (int i = start; i < end; i++) {
    l.add(parentList.get(i));
return l;

int to;
Iterator<T> e;
ArrayList<T> list;
if (query == null || query.isEmpty() || first >= query.size())
    return null;
to = Math.min(first + max, query.size());
list = new ArrayList<T>(to - first);
e = query.listIterator(first);
...

int count = src.size();
int batchCount = (count + preBatchCount - 1) / preBatchCount;
List[] result = new List[batchCount];
for (int index = 0; index < batchCount; ++index) {
    int begin = index * preBatchCount;
    int end = (index + 1) * preBatchCount;
    if (end > count) {
        end = count;
...

List<X> temp = new ArrayList<X>();
for (int i = start; i < end; i++) {
    temp.add(list.get(i));
return temp;

List<M> returnList = new ArrayList<M>();
for (M element : list) {
    if (element.compareTo(start) >= 0 && element.compareTo(end) <= 0) {
        returnList.add(element);
return returnList;