Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
package edu.stanford.nlp.util;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.lang.reflect.Constructor;
import java.lang.reflect.InvocationTargetException;
import java.util.*;
import java.util.function.Function;
import java.util.function.Predicate;
import edu.stanford.nlp.stats.ClassicCounter;
import edu.stanford.nlp.stats.Counter;
import edu.stanford.nlp.stats.Counters;
/**
* Collection of useful static methods for working with Collections. Includes
* methods to increment counts in maps and cast list/map elements to common
* types.
*
* @author Joseph Smarr ([email protected])
*/
public class CollectionUtils {
/**
* Private constructor to prevent direct instantiation.
*/
private CollectionUtils() {
}
// Utils for making collections out of arrays of primitive types.
public static List asList(int[] a) {
List result = new ArrayList<>(a.length);
for (int j : a) {
result.add(Integer.valueOf(j));
}
return result;
}
public static List asList(double[] a) {
List result = new ArrayList<>(a.length);
for (double v : a) {
result.add(new Double(v));
}
return result;
}
// Inverses of the above
public static int[] asIntArray(Collection coll) {
int[] result = new int[coll.size()];
int index = 0;
for (Integer element : coll) {
result[index] = element;
index++;
}
return result;
}
public static double[] asDoubleArray(Collection coll) {
double[] result = new double[coll.size()];
int index = 0;
for (Double element : coll) {
result[index] = element;
index++;
}
return result;
}
/** Returns a new List containing the given objects. */
@SafeVarargs
public static List makeList(T... items) {
return new ArrayList<>(Arrays.asList(items));
}
/** Returns a new Set containing all the objects in the specified array. */
@SafeVarargs
public static Set asSet(T... o) {
return Generics.newHashSet(Arrays.asList(o));
}
public static Set intersection(Set set1, Set set2) {
Set intersect = Generics.newHashSet();
for (T t : set1) {
if (set2.contains(t)) {
intersect.add(t);
}
}
return intersect;
}
public static Collection union(Collection set1, Collection set2) {
Collection union = new ArrayList<>();
for (T t : set1) {
union.add(t);
}
for (T t : set2) {
union.add(t);
}
return union;
}
public static Set unionAsSet(Collection set1, Collection set2) {
Set union = Generics.newHashSet();
for (T t : set1) {
union.add(t);
}
for (T t : set2) {
union.add(t);
}
return union;
}
@SafeVarargs
public static Set unionAsSet(Collection... sets) {
Set union = Generics.newHashSet();
for(Collection set: sets){
for (T t : set) {
union.add(t);
}
}
return union;
}
/**
* Returns all objects in list1 that are not in list2.
*
* @param Type of items in the collection
* @param list1 First collection
* @param list2 Second collection
* @return The collection difference list1 - list2
*/
public static Collection diff(Collection list1, Collection list2) {
Collection diff = new ArrayList<>();
for (T t : list1) {
if (!list2.contains(t)) {
diff.add(t);
}
}
return diff;
}
/**
* Returns all objects in list1 that are not in list2.
*
* @param Type of items in the collection
* @param list1 First collection
* @param list2 Second collection
* @return The collection difference list1 - list2
*/
public static Set diffAsSet(Collection list1, Collection list2) {
Set diff = new HashSet<>();
for (T t : list1) {
if (!list2.contains(t)) {
diff.add(t);
}
}
return diff;
}
// Utils for loading and saving Collections to/from text files
/**
* @param filename The path to the file to load the List from
* @param c The Class to instantiate each member of the List. Must have a
* String constructor.
*/
public static Collection loadCollection(String filename, Class c, CollectionFactory cf) throws Exception {
return loadCollection(new File(filename), c, cf);
}
/**
* @param file The file to load the List from
* @param c The Class to instantiate each member of the List. Must have a
* String constructor.
*/
public static Collection loadCollection(File file, Class c, CollectionFactory cf) throws Exception {
Constructor m = c.getConstructor(new Class[] { String.class });
Collection result = cf.newCollection();
BufferedReader in = new BufferedReader(new FileReader(file));
String line = in.readLine();
while (line != null && line.length() > 0) {
try {
T o = m.newInstance(line);
result.add(o);
} catch (Exception e) {
System.err.println("Couldn't build object from line: " + line);
e.printStackTrace();
}
line = in.readLine();
}
in.close();
return result;
}
/**
* Adds the items from the file to the collection.
*
* @param The type of the items.
* @param fileName The name of the file from which items should be loaded.
* @param itemClass The class of the items (must have a constructor that accepts a String).
* @param collection The collection to which items should be added.
*/
public static void loadCollection(String fileName, Class itemClass, Collection collection) throws NoSuchMethodException, InstantiationException,
IllegalAccessException, InvocationTargetException, IOException {
loadCollection(new File(fileName), itemClass, collection);
}
/**
* Adds the items from the file to the collection.
*
* @param The type of the items.
* @param file The file from which items should be loaded.
* @param itemClass The class of the items (must have a constructor that accepts a String).
* @param collection The collection to which items should be added.
*/
public static void loadCollection(File file, Class itemClass, Collection collection) throws NoSuchMethodException, InstantiationException, IllegalAccessException,
InvocationTargetException, IOException {
Constructor itemConstructor = itemClass.getConstructor(String.class);
BufferedReader in = new BufferedReader(new FileReader(file));
String line = in.readLine();
while (line != null && line.length() > 0) {
T t = itemConstructor.newInstance(line);
collection.add(t);
line = in.readLine();
}
in.close();
}
public static Map getMapFromString(String s, Class keyClass, Class valueClass, MapFactory mapFactory) throws ClassNotFoundException,
NoSuchMethodException, IllegalAccessException, InvocationTargetException, InstantiationException {
Constructor keyC = keyClass.getConstructor(new Class[] { String.class });
Constructor valueC = valueClass.getConstructor(new Class[] { String.class });
if (s.charAt(0) != '{')
throw new RuntimeException("");
s = s.substring(1); // get rid of first brace
String[] fields = s.split("\\s+");
Map m = mapFactory.newMap();
// populate m
for (int i = 0; i < fields.length; i++) {
// System.err.println("Parsing " + fields[i]);
fields[i] = fields[i].substring(0, fields[i].length() - 1); // get rid of
// following
// comma or
// brace
String[] a = fields[i].split("=");
K key = keyC.newInstance(a[0]);
V value;
if (a.length > 1) {
value = valueC.newInstance(a[1]);
} else {
value = valueC.newInstance("");
}
m.put(key, value);
}
return m;
}
/**
* Checks whether a Collection contains a specified Object. Object equality
* (==), rather than .equals(), is used.
*/
public static boolean containsObject(Collection c, T o) {
for (Object o1 : c) {
if (o == o1) {
return true;
}
}
return false;
}
/**
* Removes the first occurrence in the list of the specified object, using
* object identity (==) not equality as the criterion for object presence. If
* this list does not contain the element, it is unchanged.
*
* @param l The {@link List} from which to remove the object
* @param o The object to be removed.
* @return Whether or not the List was changed.
*/
public static boolean removeObject(List l, T o) {
int i = 0;
for (Object o1 : l) {
if (o == o1) {
l.remove(i);
return true;
} else
i++;
}
return false;
}
/**
* Returns the index of the first occurrence in the list of the specified
* object, using object identity (==) not equality as the criterion for object
* presence. If this list does not contain the element, return -1.
*
* @param l The {@link List} to find the object in.
* @param o The sought-after object.
* @return Whether or not the List was changed.
*/
public static int getIndex(List l, T o) {
int i = 0;
for (Object o1 : l) {
if (o == o1)
return i;
else
i++;
}
return -1;
}
/**
* Returns the index of the first occurrence after the startIndex (exclusive)
* in the list of the specified object, using object equals function. If this
* list does not contain the element, return -1.
*
* @param l The {@link List} to find the object in.
* @param o The sought-after object.
* @param fromIndex The start index
* @return Whether or not the List was changed.
*/
public static int getIndex(List l, T o, int fromIndex) {
int i = -1;
for (T o1 : l) {
i++;
if (i < fromIndex) {
continue;
}
if (o.equals(o1)) {
return i;
}
}
return -1;
}
/**
* Samples without replacement from a collection.
*
* @param c The collection to be sampled from
* @param n The number of samples to take
* @return a new collection with the sample
*/
public static Collection sampleWithoutReplacement(Collection c, int n) {
return sampleWithoutReplacement(c, n, new Random());
}
/**
* Samples without replacement from a collection, using your own
* {@link Random} number generator.
*
* @param c The collection to be sampled from
* @param n The number of samples to take
* @param r The random number generator
* @return a new collection with the sample
*/
public static Collection sampleWithoutReplacement(Collection c, int n, Random r) {
if (n < 0)
throw new IllegalArgumentException("n < 0: " + n);
if (n > c.size())
throw new IllegalArgumentException("n > size of collection: " + n + ", " + c.size());
List copy = new ArrayList<>(c.size());
copy.addAll(c);
Collection result = new ArrayList<>(n);
for (int k = 0; k < n; k++) {
double d = r.nextDouble();
int x = (int) (d * copy.size());
result.add(copy.remove(x));
}
return result;
}
public static E sample(List l, Random r) {
int i = r.nextInt(l.size());
return l.get(i);
}
/**
* Samples with replacement from a collection.
*
* @param c The collection to be sampled from
* @param n The number of samples to take
* @return a new collection with the sample
*/
public static Collection sampleWithReplacement(Collection c, int n) {
return sampleWithReplacement(c, n, new Random());
}
/**
* Samples with replacement from a collection, using your own {@link Random}
* number generator.
*
* @param c The collection to be sampled from
* @param n The number of samples to take
* @param r The random number generator
* @return a new collection with the sample
*/
public static Collection sampleWithReplacement(Collection c, int n, Random r) {
if (n < 0)
throw new IllegalArgumentException("n < 0: " + n);
List copy = new ArrayList<>(c.size());
copy.addAll(c);
Collection result = new ArrayList<>(n);
for (int k = 0; k < n; k++) {
double d = r.nextDouble();
int x = (int) (d * copy.size());
result.add(copy.get(x));
}
return result;
}
/**
* Returns true iff l1 is a sublist of l (i.e., every member of l1 is in l,
* and for every e1 < e2 in l1, there is an e1 < e2 occurrence in l).
*/
public static boolean isSubList(List l1, List l) {
Iterator it = l.iterator();
for (T o1 : l1) {
if (!it.hasNext()) {
return false;
}
Object o = it.next();
while ((o == null && !(o1 == null)) || (o != null && !o.equals(o1))) {
if (!it.hasNext()) {
return false;
}
o = it.next();
}
}
return true;
}
public static String toVerticalString(Map m) {
StringBuilder b = new StringBuilder();
Set> entries = m.entrySet();
for (Map.Entry e : entries) {
b.append(e.getKey()).append('=').append(e.getValue()).append('\n');
}
return b.toString();
}
/**
* Provides a consistent ordering over lists. First compares by the first
* element. If that element is equal, the next element is considered, and so
* on.
*/
public static > int compareLists(List list1, List list2) {
if (list1 == null && list2 == null)
return 0;
if (list1 == null || list2 == null) {
throw new IllegalArgumentException();
}
int size1 = list1.size();
int size2 = list2.size();
int size = Math.min(size1, size2);
for (int i = 0; i < size; i++) {
int c = list1.get(i).compareTo(list2.get(i));
if (c != 0)
return c;
}
if (size1 < size2)
return -1;
if (size1 > size2)
return 1;
return 0;
}
public static > Comparator> getListComparator() {
return CollectionUtils::compareLists;
}
/**
* Return the items of an Iterable as a sorted list.
*
* @param The type of items in the Iterable.
* @param items The collection to be sorted.
* @return A list containing the same items as the Iterable, but sorted.
*/
public static > List sorted(Iterable items) {
List result = toList(items);
Collections.sort(result);
return result;
}
/**
* Return the items of an Iterable as a sorted list.
*
* @param The type of items in the Iterable.
* @param items The collection to be sorted.
* @return A list containing the same items as the Iterable, but sorted.
*/
public static List sorted(Iterable items, Comparator comparator) {
List result = toList(items);
Collections.sort(result, comparator);
return result;
}
/**
* Create a list out of the items in the Iterable.
*
* @param The type of items in the Iterable.
* @param items The items to be made into a list.
* @return A list consisting of the items of the Iterable, in the same order.
*/
public static List toList(Iterable items) {
List list = new ArrayList<>();
addAll(list, items);
return list;
}
/**
* Create a set out of the items in the Iterable.
*
* @param The type of items in the Iterable.
* @param items The items to be made into a set.
* @return A set consisting of the items from the Iterable.
*/
public static Set toSet(Iterable items) {
Set set = Generics.newHashSet();
addAll(set, items);
return set;
}
/**
* Add all the items from an iterable to a collection.
*
* @param The type of items in the iterable and the collection
* @param collection The collection to which the items should be added.
* @param items The items to add to the collection.
*/
public static void addAll(Collection collection, Iterable items) {
for (T item : items) {
collection.add(item);
}
}
/**
* Get all sub-lists of the given list of the given sizes.
*
* For example:
*
*
*
* @param The type of items contained in the list.
* @param items The list of items.
* @param minSize The minimum size of an ngram.
* @param maxSize The maximum size of an ngram.
* @return All sub-lists of the given sizes.
*/
public static List> getNGrams(List items, int minSize, int maxSize) {
List> ngrams = new ArrayList<>();
int listSize = items.size();
for (int i = 0; i < listSize; ++i) {
for (int ngramSize = minSize; ngramSize <= maxSize; ++ngramSize) {
if (i + ngramSize <= listSize) {
List ngram = new ArrayList<>();
for (int j = i; j < i + ngramSize; ++j) {
ngram.add(items.get(j));
}
ngrams.add(ngram);
}
}
}
return ngrams;
}
/**
* Get all prefix/suffix combinations from a list. It can extract just
* prefixes, just suffixes, or prefixes and suffixes of the same length.
*
* For example:
*
*
*
* @param The type of items contained in the list.
* @param items The list of items.
* @param minSize The minimum length of a prefix/suffix span (should be at least 1)
* @param maxSize The maximum length of a prefix/suffix span
* @param paddingSymbol Symbol to be included if we run out of bounds (e.g. if items has
* size 3 and we try to extract a span of length 4).
* @param includePrefixes Whether to extract prefixes
* @param includeSuffixes Whether to extract suffixes
* @return All prefix/suffix combinations of the given sizes.
*/
public static List> getPrefixesAndSuffixes(List items, int minSize, int maxSize, T paddingSymbol, boolean includePrefixes, boolean includeSuffixes) {
assert minSize > 0;
assert maxSize >= minSize;
assert includePrefixes || includeSuffixes;
List> prefixesAndSuffixes = new ArrayList<>();
for (int span = minSize - 1; span < maxSize; span++) {
List indices = new ArrayList<>();
List seq = new ArrayList<>();
if (includePrefixes) {
for (int i = 0; i <= span; i++) {
indices.add(i);
}
}
if (includeSuffixes) {
int maxIndex = items.size() - 1;
for (int i = span; i >= 0; i--) {
indices.add(maxIndex - i);
}
}
for (int i : indices) {
try {
seq.add(items.get(i));
} catch (IndexOutOfBoundsException ioobe) {
seq.add(paddingSymbol);
}
}
prefixesAndSuffixes.add(seq);
}
return prefixesAndSuffixes;
}
public static List mergeList(List list, Collection matched, Function> toIntervalFunc, Function, T> aggregator) {
List> matchedIntervals = new ArrayList<>(matched.size());
for (M m : matched) {
matchedIntervals.add(toIntervalFunc.apply(m));
}
return mergeList(list, matchedIntervals, aggregator);
}
public static List mergeList(List list, List> matched, Function, T> aggregator) {
Collections.sort(matched, HasInterval.ENDPOINTS_COMPARATOR);
return mergeListWithSortedMatched(list, matched, aggregator);
}
public static List mergeListWithSortedMatched(List list, List> matched, Function, T> aggregator) {
List merged = new ArrayList<>(list.size()); // Approximate size
int last = 0;
for (HasInterval m : matched) {
Interval interval = m.getInterval();
int start = interval.getBegin();
int end = interval.getEnd();
if (start >= last) {
merged.addAll(list.subList(last, start));
T t = aggregator.apply(list.subList(start, end));
merged.add(t);
last = end;
}
}
// Add rest of elements
if (last < list.size()) {
merged.addAll(list.subList(last, list.size()));
}
return merged;
}
public static List mergeListWithSortedMatchedPreAggregated(List list, List matched, Function> toIntervalFunc) {
List merged = new ArrayList<>(list.size()); // Approximate size
int last = 0;
for (T m : matched) {
Interval interval = toIntervalFunc.apply(m);
int start = interval.getBegin();
int end = interval.getEnd();
if (start >= last) {
merged.addAll(list.subList(last, start));
merged.add(m);
last = end;
}
}
// Add rest of elements
if (last < list.size()) {
merged.addAll(list.subList(last, list.size()));
}
return merged;
}
/**
* Combines all the lists in a collection to a single list.
*/
public static List flatten(Collection> nestedList) {
List result = new ArrayList<>();
for (List list : nestedList) {
result.addAll(list);
}
return result;
}
/**
* Makes it possible to uniquify a collection of objects which are normally
* non-hashable. Alternatively, it lets you define an alternate hash function
* for them for limited-use hashing.
*/
public static Collection uniqueNonhashableObjects(Collection objects, Function customHasher) {
Map hashesToObjects = Generics.newHashMap();
for (ObjType object : objects) {
hashesToObjects.put(customHasher.apply(object), object);
}
return hashesToObjects.values();
}
/**
* if any item in toCheck is present in collection
*
* @param collection
* @param toCheck
*/
public static boolean containsAny(Collection collection, Collection toCheck){
for(T c: toCheck){
if(collection.contains(c))
return true;
}
return false;
}
/**
* Split a list into numFolds (roughly) equally sized folds. The earlier folds
* may have one more item in them than later folds.
*
* The lists returned are subList()s of the original list.
* Therefore, don't try to modify the sublists, and don't modify the
* original list while the sublists are in use.
*/
public static List> partitionIntoFolds(List values, int numFolds) {
List> folds = Generics.newArrayList();
int numValues = values.size();
int foldSize = numValues / numFolds;
int remainder = numValues % numFolds;
int start = 0;
int end = foldSize;
for (int foldNum = 0; foldNum < numFolds; foldNum++) {
// if we're in the first 'remainder' folds, we get an extra item
if (foldNum < remainder) {
end++;
}
folds.add(values.subList(start, end));
start = end;
end += foldSize;
}
return folds;
}
/**
* Split a list into train, test pairs for use in k-fold crossvalidation. This
* returns a list of numFold (train, test) pairs where each train list will
* contain (numFolds-1)/numFolds of the original values and the test list will
* contain the remaining 1/numFolds of the original values.
*/
public static Collection, Collection>> trainTestFoldsForCV(List values, int numFolds) {
Collection, Collection>> trainTestPairs = new ArrayList<>();
List> folds = partitionIntoFolds(values, numFolds);
for (int splitNum = 0; splitNum < numFolds; splitNum++) {
Collection test = folds.get(splitNum);
Collection train = new ArrayList<>();
for (int foldNum = 0; foldNum < numFolds; foldNum++) {
if (foldNum != splitNum) {
train.addAll(folds.get(foldNum));
}
}
trainTestPairs.add(new Pair<>(train, test));
}
return trainTestPairs;
}
/**
* Returns a list of all modes in the Collection. (If the Collection has multiple items with the
* highest frequency, all of them will be returned.)
*/
public static Set modes(Collection values) {
Counter counter = new ClassicCounter<>(values);
List sortedCounts = CollectionUtils.sorted(counter.values());
Double highestCount = sortedCounts.get(sortedCounts.size() - 1);
Counters.retainAbove(counter, highestCount);
return counter.keySet();
}
/**
* Returns the mode in the Collection. If the Collection has multiple modes, this method picks one
* arbitrarily.
*/
public static T mode(Collection values) {
Set modes = modes(values);
return modes.iterator().next();
}
/**
* Transforms the keyset of collection according to the given Function and returns a set of the keys.
*
*/
public static Set transformAsSet(Collection original, Function f){
Set transformed = Generics.newHashSet();
for(T1 t: original){
transformed.add(f.apply(t));
}
return transformed;
}
/**
* Transforms the keyset of collection according to the given Function and returns a list.
*
*/
public static List transformAsList(Collection original, Function f){
List transformed = new ArrayList<>();
for(T1 t: original){
transformed.add(f.apply(t));
}
return transformed;
}
/**
* Filters the objects in the collection according to the given Filter and returns a list.
*
*/
public static List filterAsList(Collection original, Predicate f){
List transformed = new ArrayList<>();
for (T t: original) {
if (f.test(t)) {
transformed.add(t);
}
}
return transformed;
}
/**
* Get all values corresponding to the indices (if they exist in the map).
*
* @param map Any map from T to V
* @param indices A collection of indices of type T
* @return The corresponding list of values of type V
*/
public static List getAll(Map map, Collection indices) {
List result = new ArrayList<>();
for(T i: indices)
if(map.containsKey(i)){
result.add(map.get(i));
}
return result;
}
public static> int maxIndex(List list){
T max = null;
int i = 0;
int maxIndex = -1;
for(T t: list)
{
if(max == null || t.compareTo(max) > 0)
{
max = t;
maxIndex = i;
}
i++;
}
return maxIndex;
}
/**
* Concatenate a number of iterators together, to form one big iterator.
* This should respect the remove() functionality of the constituent iterators.
*
* @param iterators The iterators to concatenate.
* @param The type of the iterators.
* @return An iterator consisting of all the component iterators concatenated together in order.
*/
@SafeVarargs
public static Iterator concatIterators(final Iterator... iterators) {
return new Iterator() {
Iterator lastIter = null;
List> iters = new LinkedList<>(Arrays.asList(iterators));
@Override
public boolean hasNext() {
return !iters.isEmpty() && iters.get(0).hasNext();
}
@Override
public E next() {
if (!hasNext()) {
throw new IllegalArgumentException("Iterator is empty!");
}
E next = iters.get(0).next();
lastIter = iters.get(0);
while (!iters.isEmpty() && !iters.get(0).hasNext()) {
iters.remove(0);
}
return next;
}
@Override
public void remove() {
if (lastIter == null) {
throw new IllegalStateException("Call next() before calling remove()!");
}
lastIter.remove();
}
};
}
public static Iterator iteratorFromEnumerator(final Enumeration lst_) {
return new Iterator() {
private final Enumeration lst = lst_;
@Override
public boolean hasNext() {
return lst.hasMoreElements();
}
@Override
public E next() {
return lst.nextElement();
}
};
}
public static Iterable iterableFromEnumerator(final Enumeration lst) {
return new IterableIterator<>(iteratorFromEnumerator(lst));
}
}
