org.databene.commons.CollectionUtil Maven / Gradle / Ivy
Show all versions of databene-commons Show documentation
/*
* Copyright (C) 2004-2014 Volker Bergmann ([email protected]).
* All rights reserved.
*
* 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 org.databene.commons;
import java.util.*;
import java.lang.reflect.Array;
import java.lang.reflect.Modifier;
import org.databene.commons.collection.SortedList;
/**
* Provides Collection-related utility methods.
*
* Created: 18.12.2006 06:46:24
*/
public final class CollectionUtil {
public static boolean isEmpty(Collection> collection) {
return (collection == null || collection.size() == 0);
}
/**
* Converts an array into a list.
* @param array the array to convert into a list.
* @return a list containing all elements of the given array.
*/
public static List toList(T ... array) {
List result = new ArrayList(array.length);
for (T item : array)
result.add(item);
return result;
}
public static List
toListOfType(Class
type, C ... array) {
List
result = new ArrayList
(array.length);
for (C item : array)
result.add(item);
return result;
}
/**
* Creates a HashSet filled with the specified elements
* @param elements the content of the Set
* @return a HashSet with the elements
*/
public static Set toSet(T ... elements) {
HashSet set = new HashSet();
if (elements != null)
for (T element : elements)
set.add(element);
return set;
}
public static SortedSet toSortedSet(U ... elements) {
TreeSet set = new TreeSet();
for (T element : elements)
set.add(element);
return set;
}
public static , U extends T> SortedList toSortedList(U ... elements) {
return new SortedList(CollectionUtil.toList(elements), new ComparableComparator());
}
public static Set toCharSet(char[] chars) {
HashSet set = new HashSet();
if (chars != null)
for (char element : chars)
set.add(element);
return set;
}
/**
* Adds the content of an array to a collection
* @param target the collection to be extended
* @param values the values to add
*/
public static > C add(C target, U ... values) {
for (T item : values)
target.add(item);
return target;
}
public static List copy(List extends T> src, int offset, int length) {
List items = new ArrayList(length);
for (int i = 0; i < length; i++)
items.add(src.get(offset + i));
return items;
}
@SuppressWarnings("unchecked")
public static T[] toArray(Collection extends T> source) {
if (source.size() == 0)
throw new IllegalArgumentException("For empty collections, a componentType needs to be specified.");
Class componentType = (Class) source.iterator().next().getClass();
T[] array = (T[]) Array.newInstance(componentType, source.size());
return source.toArray(array);
}
@SuppressWarnings("unchecked")
public static T[] toArray(Collection extends T> source, Class componentType) {
T[] array = (T[]) Array.newInstance(componentType, source.size());
return source.toArray(array);
}
@SuppressWarnings("unchecked")
public static T[] extractArray(List extends T> source, Class componentType, int fromIndex, int toIndex) {
T[] array = (T[]) Array.newInstance(componentType, toIndex - fromIndex);
return source.subList(fromIndex, toIndex).toArray(array);
}
public static char[] toCharArray(Collection source) {
char[] result = new char[source.size()];
int i = 0;
for (Character c : source)
result[i++] = c;
return result;
}
public static Map buildMap(K key, V value) {
Map map = new HashMap();
map.put(key, value);
return map;
}
@SuppressWarnings({ "unchecked", "rawtypes" })
public static Map buildMap(Object ... keyValuePairs) {
Map map = new HashMap();
if (keyValuePairs.length % 2 != 0)
throw new IllegalArgumentException("Invalid numer of arguments. " +
"It must be even to represent key-value-pairs");
for (int i = 0; i < keyValuePairs.length; i += 2)
map.put(keyValuePairs[i], keyValuePairs[i + 1]);
return map;
}
@SuppressWarnings({ "unchecked", "rawtypes" })
public static Map buildOrderedMap(Object ... keyValuePairs) {
Map map = new OrderedMap();
if (keyValuePairs.length % 2 != 0)
throw new IllegalArgumentException("Invalid numer of arguments. " +
"It must be even to represent key-value-pairs");
for (int i = 0; i < keyValuePairs.length; i += 2)
map.put(keyValuePairs[i], keyValuePairs[i + 1]);
return map;
}
/** Creates a new instance of a Collection. Abstract interfaces are mapped to a default implementation class. */
@SuppressWarnings("unchecked")
public static , U> T newInstance(Class collectionType) {
if ((collectionType.getModifiers() & Modifier.ABSTRACT) == 0)
return BeanUtil.newInstance(collectionType);
else if (Collection.class.equals(collectionType) || List.class.equals(collectionType))
return (T) new ArrayList