Java中两个列表的交集

Question

I have used for and if loop to find intersections of list by comparing its inners JSON. I am looking for the solution using CollectionUtils or Java 8 or some other similar solution.

private List<IBXLocation> compareIbxLocationDetails(List<IBXLocation> serviceIbxsForLoggedInUser,
        List<IBXLocation> serviceIbxsForUser) {
    List<IBXLocation> finalList=new ArrayList();
    for (IBXLocation ibxForLoggedInUser : serviceIbxsForLoggedInUser) {
        String ibxSelected=ibxForLoggedInUser.getIbx();
        boolean ibxFound = false;
        ibxLoop:for (IBXLocation permittedIBXForUser : serviceIbxsForUser) {
            if (ibxSelected.equals(permittedIBXForUser.getIbx())) {
                IBXLocation newIbx = new IBXLocation(ibxSelected);
                List<Cage> newCageList=new ArrayList();
                if (!CollectionUtils.isEmpty(ibxForLoggedInUser.getCageDetails())) {
                    for (Cage selectedCage : ibxForLoggedInUser.getCageDetails()) {
                        String loggedInSelectedCageStr = selectedCage.getCage();
                        for (Cage permittedCage : permittedIBXForUser.getCageDetails()) {
                            if (loggedInSelectedCageStr.equals(permittedCage.getCage())) {
                                newCageList.add(permittedCage);
                            }

                        }
                        newIbx.setCageDetails(newCageList);
                    }
                    finalList.add(newIbx);
                }
                ibxFound = true;
                break ibxLoop;
            }

        }

    }

    return finalList;
}

Answer 1

You can use this

Set ibxForLoggedInUserToSet= new HashSet<IBXLocation>(ibxForLoggedInUser);

for(IBXLocation per: serviceIbxsForUser){
     if (ibxForLoggedInUserToSet.contains(per)){
          finalList.add(per);
     }
}

Answer 2

在org.apache.commons.collections4.ListUtils有一个方法public static <E> List<E> intersection(List<? extends E> list1, List<? extends E> list2)

Answer 3

You can utilize Set to get intersections:

public <T> intersect(List<T> firstList, List<T> secondList) {
     Set<T> result = new HashSet<>();
     result.addAll(firstList);
     result.addAll(secondList);
     return result;
}