集合分割

整理比较全的集合分割算法

需求：

把一个大的集合分成若干小的集合，然后利用多线程来同时处理这几个小集合的数据.

/**
* slist源集合
* cuont打算分割的目标的集拿个数
*/
public static List<List<String>>  createSubList(List<String> slist,int count) {
List<List<String>> tlist = new ArrayList<List<String>>();
int ssize = slist.size();

int subsize = ssize % count == 0 ? ssize / count : ssize / count + 1;

for (int i = 0; i < count; i++) {
tlist.add(new ArrayList());
}

aa : for (int j = 0; j < subsize; j++) {
for (int i = 0; i < count; i++) {
if(0 == slist.size()){
break aa;
}
tlist.get(i).add(slist.get(0));
slist.remove(0);
}
}

return tlist;

}

//将list按blockSize大小等分，最后多余的单独一份
public static <T> List<List<T>> subList(List<T> list, int blockSize) {
List<List<T>> lists = new ArrayList<List<T>>();
if (list != null && blockSize > 0) {
int listSize = list.size();
if(listSize<=blockSize){
lists.add(list);
return lists;
}
int batchSize = listSize / blockSize;
int remain = listSize % blockSize;
for (int i = 0; i < batchSize; i++) {
int fromIndex = i * blockSize;
int toIndex = fromIndex + blockSize;
System.out.println("fromIndex=" + fromIndex + ", toIndex=" + toIndex);
lists.add(list.subList(fromIndex, toIndex));
}
if(remain>0){
System.out.println("fromIndex=" + (listSize-remain) + ", toIndex=" + (listSize));
lists.add(list.subList(listSize-remain, listSize));
}
}
return lists;
}

public static List<List<String>>  createList(List<String> targe,int size) {
List<List<String>> listArr = new ArrayList<List<String>>();
//获取被拆分的数组个数
int arrSize = targe.size()%size==0?targe.size()/size:targe.size()/size+1;
for(int i=0;i<arrSize;i++) {
List<String> sub = new ArrayList<String>();
//把指定索引数据放入到list中
for(int j=i*size;j<=size*(i+1)-1;j++) {
if(j<=targe.size()-1) {
sub.add(targe.get(j));
}
}
listArr.add(sub);
}
return listArr;
}