封装一个方法,用一个Map来实现,这里是根据bean类的seq字段进行拆分的,分成好几个list
private LinkedHashMap<String,List<HandleInfo>> groupListBySeq(List<HandleInfo> list) {
LinkedHashMap<String,List<HandleInfo>> map = new LinkedHashMap<String,List<HandleInfo>>();
for (HandleInfo bean : list) {
if((())){
List<HandleInfo> subList = (());
(bean);
}else{
List<HandleInfo> subList = new ArrayList<HandleInfo>();
(bean);
((), subList);
}
}
return map;
}
然后可以对获取到的Map进行遍历:
LinkedHashMap<String,List<HandleInfo>> map = groupListBySeq(needUpdateHandleInfoList);
//遍历集合
for(<String, List<HandleInfo>> entry : ()){
List<HandleInfo> list=(List<HandleInfo>)();
HandleInfo bean0 = new HandleInfo();
if(null != list || !()){
bean0 = (0);
}
for(HandleInfo handleInfoModel : list){
...
}
}
上面是按数据库字段进行分组的方法,然后介绍一下平均分成多少数据量的集合
java代码只要获取参数进行集合拆分就可以:
举个例子,下面是一种方法,将list按照没1000个为一个集合分组
List<String> values = new ArrayList<String>();
String[] configSeqArray = (configSeq,',');
for (String str : configSeqArray) {
(str);
}
List<Collection<String>> configSeqs = (values, 1000);
复制公司同事写的集合拆分的方法
import ;
import ;
import ;
public class CollectionUtils {
public static List<Collection<String>> splitCollection(Collection<String>values , int size) {
List<Collection<String>> result = new ArrayList<Collection<String>>();
if(() <= size ){
(values);
}else{
int count =0;
Collection<String> subCollection= null;
for(String s:c){
if(subCollection == null){
subColletion = new ArrayList<String>();
(subColletion);
}
(s);
count++;
if(count == size){
count =0;
subCollectiion = null;
}
}
}
}
}
这种方法可以应用与解决Oracle select in超过1000个的报错,具体参考:/article/details/87922878