分隔List集合，按subList指定大小或按subList指定个数

1. 当数据量过大时，我们可能需要对集合进行分组，再查询数据库，减小数据库一定压力。
2. 当我们多线程执行任务时，如果原始List特别大，可以对list先进行分割成多个，并分线程执行。

代码如下：

package com.ityj.multidb;

import org.junit.Test;

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

public class ListDemo {

    /**
     * 将集合分为指定大小len的多个小集合
     *
     * @param sourceList
     * @param len
     * @return
     */
    public static <T> List<List<T>> splitList2FixSize(List<T> sourceList, int len) {
        List<List<T>> result = new ArrayList<>();
        if (sourceList == null || sourceList.isEmpty()) {
            return result;
        }
        if (len < 1 || len > sourceList.size()) {
            result.add(sourceList);
            return result;
        }

        //传入集合长度
        int size = sourceList.size();
        //分隔后的集合个数
        int count = (size + len -1) / len;
        for (int i = 0; i < count; i++) {
            List<T> subList = sourceList.subList(i * len, ((i + 1) * len > size ? size : len * (i + 1)));
            result.add(subList);
        }
        return result;
    }


    /**
     * 将一组数据平均分成n组
     *
     * @param sourceList 要分组的数据源
     * @param n      平均分成n组
     * @param <T>
     * @return
     */
    public static <T> List<List<T>> doSplitListAverage(List<T> sourceList, int n) {
        List<List<T>> result = new ArrayList<>();
        if (sourceList == null || sourceList.isEmpty()) {
            return result;
        }
        if (n < 1) {
            result.add(sourceList);
            return result;
        }
        if (n > sourceList.size()) {
            n = sourceList.size();
        }

        int remainder = sourceList.size() % n;  //(先计算出余数)
        int number = sourceList.size() / n;  //然后是商
        int offset = 0;//偏移量
        for (int i = 0; i < n; i++) {
            List<T> value = null;
            if (remainder > 0) {
                value = sourceList.subList(i * number + offset, (i + 1) * number + offset + 1);
                remainder--;
                offset++;
            } else {
                value = sourceList.subList(i * number + offset, (i + 1) * number + offset);
            }
            result.add(value);
        }
        return result;
    }

    @Test
    public void testArrayList() {
        List<Integer> list = new ArrayList();
        for (int i = 1; i <= 16; i++) {
            list.add(i);
        }
        // 分割成单个subList长度为6的多个集合
        List<List<Integer>> listS = splitList2FixSize(list, 6);

        // 分割成6个子集合
        //List<List<Integer>> listS = doSplitListAverage(list, 6);
        System.out.println("分隔后List个数：\t" + listS.size());
        for (List<Integer> subList : listS) {
            System.out.println("subList = " + subList);
        }
    }
}

求两个map的差集

pom

<dependency>
	<groupId>com.google.guava</groupId>
	<artifactId>guava</artifactId>
	<version>30.1.1-jre</version>
</dependency>

public static void main(String[] args) {
   Map<String, List<String>> leftMap = mockLeftMap();
   Map<String, List<String>> rightMap = mockRightMap();
   MapDifference<String, List<String>> difference = Maps.difference(leftMap, rightMap);
   
   Map<String, List<String>> entriesOnlyOnLeft = difference.entriesOnlyOnLeft();
   System.out.println("entriesOnlyOnLeft = " + entriesOnlyOnLeft);
   Set<String> groupsToRemove = difference.entriesOnlyOnRight().keySet();
   System.out.println("groupsToRemove = " + groupsToRemove);

   Map<String, MapDifference.ValueDifference<List<String>>> differenceMap = difference.entriesDiffering();
   differenceMap.forEach((group, differ) -> {
       List<String> leftValue = differ.leftValue();
       List<String> rightValue = differ.rightValue();

       List<String> toBeAdd = subList2(leftValue, rightValue);
       List<String> toBeRemove = subList2(rightValue, leftValue);
       System.out.println(group + "-->toBeAdd:" + toBeAdd);
       System.out.println(group + "-->toBeRemove:" + toBeRemove);
   });

}

public static List<String> subList2(List<String> list1, List<String> list2) {
   return list1.stream().filter(str -> !list2.contains(str)).collect(Collectors.toList());
}


public static Map<String, List<String>> mockLeftMap() {
   Map<String, List<String>> leftMap = new HashMap<>();
   List<String> list = new ArrayList<>();
   list.add("Jack");
   list.add("Rose");
   list.add("Tom");
   list.add("Jerry");

   List<String> list2 = new ArrayList<>();
   list2.add("LE");
   list2.add("HP");
   list2.add("Jack");
   list2.add("Rose");

   leftMap.put("G1", list);
   leftMap.put("G2", list2);
   leftMap.put("G4", null);
   return leftMap;
}

public static Map<String, List<String>> mockRightMap() {
   Map<String, List<String>> rightMap = new HashMap<>();

   List<String> list = new ArrayList<>();
   list.add("Jack");
   list.add("James");
   list.add("Tom");
   list.add("Jerry");

   List<String> list2 = new ArrayList<>();
   list2.add("LE");
   list2.add("HP");
   list2.add("Jack");
   list2.add("James");

   rightMap.put("G1", list);
   rightMap.put("G2", list2);
   rightMap.put("G3", list2);
   return rightMap;
}