com.querydsl.core.util.CollectionUtils Maven / Gradle / Ivy
The newest version!
/*
* Copyright 2015, The Querydsl Team (http://www.querydsl.com/team)
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
* http://www.apache.org/licenses/LICENSE-2.0
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.querydsl.core.util;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.TreeSet;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
/**
* CollectionUtils provides addition operations for Collection types that provide an immutable type
* for single item collections and after that mutable instances
*
* @author tiwe
*
*/
public final class CollectionUtils {
private static final Set> UNMODIFIABLE_TYPES;
static {
Set> unmodifiableTypes = new HashSet<>();
unmodifiableTypes.add(Collections.emptyList().getClass());
unmodifiableTypes.add(Collections.emptySet().getClass());
unmodifiableTypes.add(Collections.emptyNavigableSet().getClass());
unmodifiableTypes.add(Collections.emptySortedSet().getClass());
unmodifiableTypes.add(Collections.emptyMap().getClass());
unmodifiableTypes.add(Collections.emptySortedMap().getClass());
unmodifiableTypes.add(Collections.emptyNavigableMap().getClass());
unmodifiableTypes.add(Collections.singleton(1).getClass());
unmodifiableTypes.add(Collections.singletonList(1).getClass());
unmodifiableTypes.add(Collections.singletonMap(1, 1).getClass());
unmodifiableTypes.add(Collections.unmodifiableList(Collections.emptyList()).getClass());
unmodifiableTypes.add(Collections.unmodifiableCollection(Collections.emptyList()).getClass());
unmodifiableTypes.add(Collections.unmodifiableSet(Collections.emptySet()).getClass());
unmodifiableTypes.add(Collections.unmodifiableNavigableSet(Collections.emptyNavigableSet()).getClass());
unmodifiableTypes.add(Collections.unmodifiableSortedSet(Collections.emptySortedSet()).getClass());
unmodifiableTypes.add(Collections.unmodifiableMap(Collections.emptyMap()).getClass());
unmodifiableTypes.add(Collections.unmodifiableSortedMap(Collections.emptySortedMap()).getClass());
unmodifiableTypes.add(Collections.unmodifiableNavigableMap(Collections.emptyNavigableMap()).getClass());
try {
unmodifiableTypes.add(Class.forName("com.google.common.collect.ImmutableSet"));
unmodifiableTypes.add(Class.forName("com.google.common.collect.ImmutableList"));
unmodifiableTypes.add(Class.forName("com.google.common.collect.ImmutableMap"));
} catch (ClassNotFoundException e) {
// Nothing happens
}
try {
unmodifiableTypes.add(Class.forName("java.util.ImmutableCollections$AbstractImmutableCollection"));
unmodifiableTypes.add(Class.forName("java.util.ImmutableCollections$AbstractImmutableMap"));
} catch (ClassNotFoundException e) {
// Nothing happens
}
UNMODIFIABLE_TYPES = Collections.unmodifiableSet(unmodifiableTypes);
}
/**
* Returns true if the type is a known unmodifiable type.
*
* @param clazz the type
* @return true if the type is a known unmodifiable type
*/
public static boolean isUnmodifiableType(Class clazz) {
for (; clazz != null; clazz = clazz.getSuperclass()) {
if (UNMODIFIABLE_TYPES.contains(clazz)) {
return true;
}
}
return false;
}
/**
* Return an unmodifiable copy of a list, or the same list if its already an unmodifiable type.
*
* @param list the list
* @param element type
* @return unmodifiable copy of a list, or the same list if its already an unmodifiable type
*/
public static List unmodifiableList(List list) {
if (isUnmodifiableType(list.getClass())) {
return list;
}
switch (list.size()) {
case 0:
return Collections.emptyList();
case 1:
return Collections.singletonList(list.get(0));
default:
return Collections.unmodifiableList(new ArrayList<>(list));
}
}
/**
* Return an unmodifiable copy of a set, or the same set if its already an unmodifiable type.
*
* @param set the set
* @param element type
* @return unmodifiable copy of a set, or the same set if its already an unmodifiable type
*/
@SuppressWarnings("unchecked")
public static Set unmodifiableSet(Set set) {
if (isUnmodifiableType(set.getClass())) {
return set;
}
switch (set.size()) {
case 0:
return Collections.emptySet();
case 1:
return Collections.singleton(set.iterator().next());
default:
return Collections.unmodifiableSet((Set) (
set instanceof LinkedHashSet ? ((LinkedHashSet) set).clone() :
set instanceof TreeSet ? ((TreeSet) set).clone() :
set instanceof HashSet ? ((HashSet) set).clone() :
new LinkedHashSet<>(set)));
}
}
public static List> partition(List list, int batchSize) {
return IntStream.range(0, list.size() / batchSize + 1)
.mapToObj(i -> list.subList(i * batchSize,
Math.min(i * batchSize + batchSize, list.size())))
.filter(s -> !s.isEmpty()).collect(Collectors.toList());
}
public static List add(List list, T element) {
final int size = list.size();
if (size == 0) {
return Collections.singletonList(element);
} else if (isUnmodifiableType(list.getClass())) {
if (size == 1) {
final T val = list.get(0);
list = new ArrayList<>();
list.add(val);
} else {
list = new ArrayList<>(list);
}
}
list.add(element);
return list;
}
public static List copyOf(List list) {
if (isUnmodifiableType(list.getClass())) {
return list;
} else {
return new ArrayList<>(list);
}
}
public static Set add(Set set, T element) {
final int size = set.size();
if (size == 0) {
return Collections.singleton(element);
} else if (isUnmodifiableType(set.getClass())) {
if (size == 1) {
final T val = set.iterator().next();
set = new HashSet<>();
set.add(val);
} else {
set = new HashSet<>(set);
}
}
set.add(element);
return set;
}
public static Set copyOf(Set set) {
if (isUnmodifiableType(set.getClass())) {
return set;
} else {
return new HashSet<>(set);
}
}
public static Set addSorted(Set set, T element) {
final int size = set.size();
if (size == 0) {
return Collections.singleton(element);
} else if (isUnmodifiableType(set.getClass())) {
if (size == 1) {
final T val = set.iterator().next();
set = new LinkedHashSet<>();
set.add(val);
} else {
set = new LinkedHashSet<>(set);
}
}
set.add(element);
return set;
}
public static Set removeSorted(Set set, T element) {
final int size = set.size();
if (size == 0 || (size == 1 && set.contains(element))) {
return Collections.emptySet();
} else {
set.remove(element);
}
return set;
}
public static Set copyOfSorted(Set set) {
if (isUnmodifiableType(set.getClass())) {
return set;
} else {
return new LinkedHashSet<>(set);
}
}
public static Map put(Map map, K key, V value) {
final int size = map.size();
if (size == 0) {
return Collections.singletonMap(key, value);
} else if (isUnmodifiableType(map.getClass())) {
map = new HashMap<>(map);
}
map.put(key, value);
return map;
}
public static Map copyOf(Map map) {
if (isUnmodifiableType(map.getClass())) {
return map;
} else {
return new HashMap<>(map);
}
}
private CollectionUtils() { }
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy