/*
 * This file is part of McIDAS-V
 *
 * Copyright 2007-2025
 * Space Science and Engineering Center (SSEC)
 * University of Wisconsin - Madison
 * 1225 W. Dayton Street, Madison, WI 53706, USA
 * https://www.ssec.wisc.edu/mcidas/
 * 
 * All Rights Reserved
 * 
 * McIDAS-V is built on Unidata's IDV and SSEC's VisAD libraries, and
 * some McIDAS-V source code is based on IDV and VisAD source code.  
 * 
 * McIDAS-V is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Lesser Public License as published by
 * the Free Software Foundation; either version 3 of the License, or
 * (at your option) any later version.
 * 
 * McIDAS-V is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Lesser Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser Public License
 * along with this program.  If not, see https://www.gnu.org/licenses/.
 */

package edu.wisc.ssec.mcidasv.util;

import java.lang.reflect.Array;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.LinkedHashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Objects;
import java.util.Set;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.CopyOnWriteArrayList;
import java.util.concurrent.CopyOnWriteArraySet;
import java.util.stream.Collectors;

import edu.wisc.ssec.mcidasv.util.functional.Function;

/**
 * A <i>collection</i> (ugh) of static methods that make working with Java's 
 * default collections a bit easier, or at least allows you to elide some of
 * the redundancy of idiomatic Java.
 * 
 * <p>Make use of {@literal "static imports"} to omit even more needless code.
 */
@SuppressWarnings({"ClassWithoutLogger", "UnusedDeclaration"})
public final class CollectionHelpers {

    /** Never! */
    private CollectionHelpers() {}

    /**
     * {@literal "Converts"} the incoming {@literal "varargs"} into an array.
     * 
     * <p>Useful for doing things like:
     * {@code String[] strs = arr("hello", "how", "are", "you?");}
     *
     * @param <T> Type of items to be converted into an array.
     * @param ts Items that will make up the elements of the returned array.
     * Cannot be {@code null}, and (for now) the items should be of the 
     * <i>same</i> type.
     * 
     * @return Array populated with each item from {@code ts}.
     */
    @SafeVarargs
    public static <T> T[] arr(T... ts) { 
        return ts;
    }

    /**
     * Creates a {@link List} from incoming {@literal "varargs"}. Currently 
     * uses {@link ArrayList} as the {@code List} implementation.
     * 
     * <p>Used like so:
     * {@code List<String> listy = list("y", "helo", "thar");}
     *
     * @param <E> Type of items that will be added to the resulting collection.
     * @param elements Items that will make up the elements of the returned
     * {@code List}.
     * 
     * @return {@code List} whose elements are each item within 
     * {@code elements}.
     */
    @SafeVarargs
    public static <E> List<E> list(E... elements) {
        List<E> newList = new ArrayList<>(elements.length);
        Collections.addAll(newList, elements);
        return newList;
    }

    /**
     * Creates a {@link Set} from incoming {@literal "varargs"}. Currently uses
     * {@link LinkedHashSet} as the {@code Set} implementation (to preserve 
     * ordering).
     * 
     * <p>Used like so:<pre>
     * for (String s : set("beep", "boop", "blorp")) { ... }</pre>
     *
     * @param <E> Type of items that will be added to the resulting collection.
     * @param elements Items that will appear within the returned {@code Set}.
     * Cannot be {@code null}, and (for now) the items should be of the 
     * <i>same</i> type.
     * 
     * @return A {@code Set} containing the items in {@code elements}. Remember
     * that {@code Set}s only contain <i>unique</i> elements!
     */
    @SafeVarargs
    public static <E> Set<E> set(E... elements) {
        Set<E> newSet = new LinkedHashSet<>(elements.length);
        Collections.addAll(newSet, elements);
        return newSet;
    }

    /**
     * Creates a new {@code cl} instance (limited to things implementing 
     * {@link Collection}) populated with the {@literal "varargs"}. Useful if
     * you truly despise {@link #arr(Object...)}, {@link #list(Object...)}, 
     * or {@link #set(Object...)}.
     * 
     * <p>Example: {@code Collection<Integer> ints = collect(PriorityBlockingQueue.class, 1, 2, 3);}
     *
     * @param <E> Type of items that will be added to the resulting collection.
     * @param cl A (non-abstract!) class that implements {@code Collection}. Cannot be {@code null}.
     * @param elements Objects that will be added to the collection.
     * 
     * @return An instance of {@code cl} containing the given objects.
     * 
     * @throws RuntimeException
     * if {@link java.lang.reflect.Constructor#newInstance(Object...) Constructor#newInstance(Object...)}
     * had problems.
     * 
     * @see #arr(Object...)
     * @see #list(Object...)
     * @see #set(Object...)
     */
    @SuppressWarnings({ "unchecked", "rawtypes" }) // the only things being added to the collection are objects of type "E"
    public static <E> Collection<E> collect(Class<? extends Collection> cl,
                                            E... elements)
    {
        try {
            Collection<E> c = cl.getConstructor().newInstance();
            Collections.addAll(c, elements);
            return c;
        } catch (Exception e) {
            throw new RuntimeException("Problem creating a new "+cl, e);
        }
    }

    /**
     * Determines the {@literal "length"} of a given object. This method 
     * currently understands:<ul>
     * <li>{@link Collection}</li>
     * <li>{@link Map}</li> 
     * <li>{@link CharSequence}</li>
     * <li>{@link Array}</li>
     * <li>{@link Iterable}</li>
     * <li>{@link Iterator}</li>
     * </ul>
     * 
     * <p>More coming!
     * 
     * @param o {@code Object} whose length we want. Cannot be {@code null}.
     * 
     * @return {@literal "Length"} of {@code o}.
     * 
     * @throws NullPointerException if {@code o} is {@code null}.
     * @throws IllegalArgumentException if the method doesn't know how to test
     * whatever type of object {@code o} might be.
     */
    @SuppressWarnings({"WeakerAccess"})
    public static int len(final Object o) {
        Objects.requireNonNull(o, "Null arguments do not have a length");
        int len;
        if (o instanceof Collection<?>) {
            len = ((Collection<?>)o).size();
        } else if (o instanceof Map<?, ?>) {
            len = ((Map<?, ?>)o).size();
        } else if (o instanceof CharSequence) {
            len = ((CharSequence)o).length();
        } else if (o instanceof Iterator<?>) {
            int count = 0;
            Iterator<?> it = (Iterator<?>)o;
            while (it.hasNext()) {
                it.next();
                count++;
            }
            len = count;
        } else if (o instanceof Iterable<?>) {
            len = CollectionHelpers.len(((Iterable<?>)o).iterator());
        } else {
            throw new IllegalArgumentException("Don't know how to find the length of a " + o.getClass().getName());
        }
        return len;
    }

    /**
     * Searches an object to see if it {@literal "contains"} another object.
     * This method currently knows how to search:<ul>
     * <li>{@link Collection}</li>
     * <li>{@link Map}</li> 
     * <li>{@link CharSequence}</li>
     * <li>{@link Array}</li>
     * <li>{@link Iterable}</li>
     * <li>{@link Iterator}</li>
     * </ul>
     * 
     * <p>More coming!
     * 
     * @param collection {@code Object} that will be searched for
     * {@code item}. Cannot be {@code null}.
     * @param item {@code Object} to search for within {@code o}.
     * {@code null} values are allowed.
     * 
     * @return {@code true} if {@code o} contains {@code item}, {@code false}
     * otherwise.
     * 
     * @throws NullPointerException if {@code o} is {@code null}.
     * @throws IllegalArgumentException if the method doesn't know how to 
     * search whatever type of object {@code o} might be.
     */
    // TODO(jon:89): item should probably become an array/collection too...
    @SuppressWarnings({"WeakerAccess"})
    public static boolean contains(final Object collection, final Object item) {
        Objects.requireNonNull(collection, "Cannot search a null object.");
        if (collection instanceof Collection<?>) {
            return ((Collection<?>)collection).contains(item);
        } else if ((collection instanceof String) && (item instanceof CharSequence)) {
            return ((String)collection).contains((CharSequence) item);
        } else if (collection instanceof Map<?, ?>) {
            return ((Map<?, ?>)collection).containsKey(item);
        } else if (collection instanceof Iterator<?>) {
            Iterator<?> it = (Iterator<?>)collection;
            if (item == null) {
                while (it.hasNext()) {
                    if (it.next() == null) {
                        return true;
                    }
                }
            } else {
                while (it.hasNext()) {
                    if (item.equals(it.next())) {
                        return true;
                    }
                }
            }
            return false;
        } else if (collection instanceof Iterable<?>) {
            Iterator<?> it = ((Iterable<?>)collection).iterator();
            return CollectionHelpers.contains(it, item);
        } else if (collection.getClass().isArray()) {
            for (int i = 0; i < Array.getLength(collection); i++) {
                if (Array.get(collection, i).equals(item)) {
                    return true;
                }
            }
        }
        throw new IllegalArgumentException("Don't know how to search a "+collection.getClass().getName());
    }

    /**
     * Creates an empty {@link HashSet} that uses a little cleverness with 
     * Java's generics. Useful for eliminating redundant type information and
     * declaring fields as {@code final}.
     *
     * <p>Please consider using {@link #newHashSet(int)} or
     * {@link #newHashSet(Collection)} instead of this method.
     *
     * @param <E> Type of items that will be added to the resulting collection.
     *
     * @return A new, empty {@code HashSet}.
     *
     * @see #newHashSet(int)
     * @see #newHashSet(Collection)
     */
    @SuppressWarnings({"CollectionWithoutInitialCapacity"})
    public static <E> Set<E> newHashSet() {
        return new HashSet<>();
    }

    /**
     * Creates an empty {@link HashSet} with a given initial capacity.
     *
     * @param <E> Type of items that will be added to the resulting collection.
     * @param initialCapacity Initial capacity of the {@code HashSet}. Cannot
     * be negative.
     *
     * @return A new, empty {@code HashSet} with the given initial capacity.
     */
    public static <E> Set<E> newHashSet(int initialCapacity) {
        return new HashSet<>(initialCapacity);
    }

    /**
     * Copies an existing {@link Collection} into a new {@link HashSet}.
     *
     * @param <E> Type of items that will be added to the resulting collection.
     * @param original {@code Collection} to be copied. Cannot be {@code null}.
     *
     * @return A new {@code HashSet} whose contents are the same as
     * {@code original}.
     */
    public static <E> Set<E> newHashSet(Collection<E> original) {
        return new HashSet<>(original);
    }

    /**
     * Creates an empty {@link LinkedHashSet} that uses a little cleverness 
     * with Java's generics. Useful for eliminating redundant type 
     * information and declaring fields as {@code final}.
     *
     * <p>Please consider using {@link #newLinkedHashSet(int)} or
     * {@link #newLinkedHashSet(Collection)} instead of this method.
     *
     * @param <E> Type of items that will be added to the resulting collection.
     *
     * @return A new, empty {@code LinkedHashSet}.
     *
     * @see #newLinkedHashSet(int)
     * @see #newLinkedHashSet(Collection)
     */
    @SuppressWarnings({"CollectionWithoutInitialCapacity"})
    public static <E> Set<E> newLinkedHashSet() {
        return new LinkedHashSet<>();
    }

    /**
     * Creates an empty {@link LinkedHashSet} with a given initial capacity.
     *
     * @param <E> Type of items that will be added to the resulting collection.
     * @param initialCapacity Initial capacity of the {@code LinkedHashSet}.
     * Cannot be negative.
     *
     * @return A new, empty {@code LinkedHashSet} with the given initial
     * capacity.
     */
    public static <E> Set<E> newLinkedHashSet(int initialCapacity) {
        return new LinkedHashSet<>(initialCapacity);
    }

    /**
     * Copies a {@link Collection} into a new {@link LinkedHashSet}.
     *
     * @param <E> Type of items that will be added to the resulting collection.
     * @param original Collection to be copied. Cannot be {@code null}.
     * 
     * @return A new {@code LinkedHashSet} whose contents are the same as 
     * {@code original}.
     */
    public static <E> Set<E> newLinkedHashSet(Collection<E> original) {
        return new LinkedHashSet<>(original);
    }

    /**
     * Creates an empty {@link HashSet} that uses a little cleverness with 
     * Java's generics. Useful for eliminating redundant type information and
     * declaring fields as {@code final}, while also reducing compiler warnings.
     *
     * <p>Please consider using {@link #newMap(int)} or
     * {@link #newMap(Map)} instead of this method.
     *
     * @param <K> Type of keys that will be added to the {@code Map}.
     * @param <V> Type of values that will be added to the {@code Map}.
     *
     * @return A new, empty {@code HashMap}.
     *
     * @see #newMap(int)
     * @see #newMap(Map)
     */
    @SuppressWarnings({"CollectionWithoutInitialCapacity"})
    public static <K, V> Map<K, V> newMap() {
        return new HashMap<>();
    }

    /**
     * Creates an empty {@link HashSet} with a given initial capacity.
     *
     * @param <K> Type of keys that will be added to the {@code Map}.
     * @param <V> Type of values that will be added to the {@code Map}.
     * @param initialCapacity Initial capacity of the {@code HashMap}.
     * Cannot be negative.
     *
     * @return A new, empty {@code HashMap} with the given initial capacity.
     */
    public static <K, V> Map<K, V> newMap(int initialCapacity) {
        return new HashMap<>(initialCapacity);
    }

    /**
     * Copies an existing {@link Map} into a new {@link HashMap}.
     *
     * @param <K> Type of keys that will be added to the {@code Map}.
     * @param <V> Type of values that will be added to the {@code Map}.
     * @param original Map to be copied. Cannot be {@code null}.
     * 
     * @return A new {@code HashMap} whose contents are the same as 
     * {@code original}.
     */
    public static <K, V> Map<K, V> newMap(Map<K, V> original) {
        return new HashMap<>(original);
    }

    /**
     * Creates an empty {@link LinkedHashMap} that uses a little cleverness with
     * Java's generics. Useful for eliminating redundant type information and 
     * declaring fields as {@code final}, while also reducing compiler warnings.
     *
     * <p>Please consider using {@link #newLinkedHashMap(int)} or
     * {@link #newLinkedHashSet(Collection)} instead of this method.
     *
     * @param <K> Type of keys that will be added to the {@code Map}.
     * @param <V> Type of values that will be added to the {@code Map}.
     *
     * @return A new, empty {@code LinkedHashMap}.
     *
     * @see #newLinkedHashMap(int)
     * @see #newLinkedHashMap(Map)
     */
    @SuppressWarnings({"CollectionWithoutInitialCapacity"})
    public static <K, V> Map<K, V> newLinkedHashMap() {
        return new LinkedHashMap<>();
    }

    /**
     * Creates an empty {@link LinkedHashMap} with a given initial capacity.
     *
     * @param <K> Type of keys that will be added to the {@code Map}.
     * @param <V> Type of values that will be added to the {@code Map}.
     * @param initialCapacity Initial capacity of the {@code LinkedHashMap}.
     * Cannot be negative.
     *
     * @return A new, empty {@code LinkedHashMap} with the given initial
     * capacity.
     */
    public static <K, V> Map<K, V> newLinkedHashMap(int initialCapacity) {
        return new LinkedHashMap<>(initialCapacity);
    }

    /**
     * Copies an existing {@link Map} into a new {@link LinkedHashMap}.
     *
     * @param <K> Type of keys that will be added to the {@code Map}.
     * @param <V> Type of values that will be added to the {@code Map}.
     * @param original Map to be copied. Cannot be {@code null}.
     * 
     * @return A new {@code LinkedHashMap} whose contents are the same as 
     * {@code original}.
     */
    public static <K, V> Map<K, V> newLinkedHashMap(Map<K, V> original) {
        return new LinkedHashMap<>(original);
    }

    /**
     * Abuses Java's sad {@literal "type"} implementation to create a new
     * {@link ConcurrentHashMap}.
     *
     * @param <K> Type of keys that will be added to the {@code Map}.
     * @param <V> Type of values that will be added to the {@code Map}.
     *
     * @return Shiny and new {@code ConcurrentHashMap}
     */
    @SuppressWarnings({"CollectionWithoutInitialCapacity"})
    public static <K, V> Map<K, V> concurrentMap() {
        return new ConcurrentHashMap<>();
    }

    /**
     * Creates an empty {@link CopyOnWriteArrayList}. Keep in mind that you 
     * only want to use {@code CopyOnWriteArrayList} for lists that are not 
     * going to be modified very often!
     *
     * @param <E> Type of items that will be added to the resulting collection.
     *
     * @return A new, empty {@code CopyOnWriteArrayList}.
     */
    public static <E> List<E> concurrentList() {
        return new CopyOnWriteArrayList<>();
    }

    /**
     * Creates a new {@link CopyOnWriteArrayList} that contains all of the 
     * elements in {@code original}. Keep in mind that you only want to use 
     * {@code CopyOnWriteArrayList} for lists that are not going to be 
     * modified very often!
     *
     * @param <E> Type of items that will be added to the resulting collection.
     * @param original Collection to be copied into the new list.
     * 
     * @return A new {@code CopyOnWriteArrayList} whose contents are the same 
     * as {@code original}.
     */
    public static <E> List<E> concurrentList(Collection<E> original) {
        return new CopyOnWriteArrayList<>(original);
    }

    /**
     * Creates a new {@link CopyOnWriteArrayList} from the incoming 
     * {@literal "varargs"}. Keep in mind that you only want to use 
     * {@code CopyOnWriteArrayList} for lists that are not going to be modified 
     * very often!
     *
     * @param <E> Type of items that will be added to the resulting collection.
     * @param elems Elements that will be contained in the resulting list.
     * 
     * @return A new {@code CopyOnWriteArrayList} that contains the incoming 
     * objects.
     */
    @SafeVarargs
    public static <E> List<E> concurrentList(E... elems) {
        return new CopyOnWriteArrayList<>(elems);
    }

    /**
     * Creates a new {@link CopyOnWriteArraySet}. Keep in mind that you only 
     * want to use a {@code CopyOnWriteArraySet} for sets that are not going to
     * be modified very often!
     *
     * @param <E> Type of items that will be added to the resulting collection.
     *
     * @return New, empty {@code CopyOnWriteArraySet}.
     */
    public static <E> Set<E> concurrentSet() {
        return new CopyOnWriteArraySet<>();
    }

    /**
     * Creates a new {@link CopyOnWriteArraySet} that contains all of the 
     * elements in {@code original}. Keep in mind that you only want to use a 
     * {@code CopyOnWriteArraySet} for sets that are not going to be modified 
     * very often!
     *
     * @param <E> Type of items that will be added to the resulting collection.
     * @param original Collection to be copied into the new set.
     * 
     * @return {@code CopyOnWriteArraySet} whose contents are the same as
     * {@code original}.
     */
    public static <E> Set<E> concurrentSet(Collection<E> original) {
        return new CopyOnWriteArraySet<>(original);
    }

    /**
     * Creates a new {@link CopyOnWriteArraySet} from the incoming 
     * {@literal "varargs"}. Keep in mind that you only want to use a 
     * {@code CopyOnWriteArraySet} for sets that are not going to be modified 
     * very often!
     *
     * @param <E> Type of items that will be added to the resulting collection.
     * @param elems Elements that will be contained in the resulting set.
     * 
     * @return {@code CopyOnWriteArraySet} that contains the incoming objects.
     */
    @SafeVarargs
    public static <E> Set<E> concurrentSet(E... elems) {
        Set<E> set = new CopyOnWriteArraySet<>();
        Collections.addAll(set, elems);
        return set;
    }

    public static <E> List<E> linkedList() {
        return new LinkedList<>();
    }

    public static <E> List<E> linkedList(final Collection<? extends E> c) {
        return new LinkedList<>(c);
    }

    /**
     * Creates an empty {@link ArrayList} that uses a little cleverness with
     * Java's generics. Useful for eliminating redundant type information and
     * declaring fields as {@code final}.
     * 
     * <p>Used like so:
     * {@code List<String> listy = arrList();}
     *
     * <p>Please consider using {@link #arrList(int)} or
     * {@link #arrList(Collection)} instead of this method.
     *
     * @param <E> Type of items that will be added to the resulting collection.
     *
     * @return A new, empty {@code ArrayList}.
     *
     * @see #arrList(int)
     * @see #arrList(Collection)
     */
    @SuppressWarnings({"CollectionWithoutInitialCapacity"})
    public static <E> List<E> arrList() {
        return new ArrayList<>();
    }

    /**
     * Creates an empty {@link ArrayList} with a given capacity.
     *
     * @param <E> Type of items that will be added to the resulting collection.
     * @param capacity The initial size of the returned {@code ArrayList}.
     * 
     * @return A new, empty {@code ArrayList} that has an initial capacity of
     * {@code capacity} elements.
     * 
     * @see ArrayList#ArrayList(int)
     */
    public static <E> List<E> arrList(final int capacity) {
        return new ArrayList<>(capacity);
    }

    /**
     * Copies an existing {@link Collection} into a new {@link ArrayList}.
     *
     * @param <E> Type of items that will be added to the resulting collection.
     * @param c {@code Collection} whose elements are to be placed into the 
     * returned {@code ArrayList}.
     * 
     * @return An {@code ArrayList} containing the elements of {@code c}.
     * 
     * @see ArrayList#ArrayList(Collection)
     */
    public static <E> List<E> arrList(final Collection<? extends E> c) {
        return new ArrayList<>(c);
    }

    /**
     * Copies an existing {@link Collection} into a new (non-abstract!) 
     * {@code Collection} class.
     *
     * @param <E> Type of items that will be added to the resulting collection.
     * @param cl Non-abstract {@code Collection} class.
     * @param old An existing {@code Collection}.
     * 
     * @return A new instance of {@code cl} that contains all of the elements
     * from {@code old}.
     * 
     * @throws RuntimeException if there was trouble creating a new instance 
     * of {@code cl}.
     * 
     * @see #collect(Class, Object...)
     */
    // not sure about the utility of this one...
    @SuppressWarnings({ "unchecked", "rawtypes" }) // again, only adding items of type "E"
    public static <E> Collection<E> recollect(Class<? extends Collection> cl,
                                              Collection<E> old) 
    {
        try {
            Collection<E> c = cl.getConstructor().newInstance();
            c.addAll(old);
            return c;
        } catch (Exception e) {
            throw new RuntimeException("", e);
        }
    }

    /**
     * Takes arrays of {@code keys} and {@code values} and merges them 
     * together to form a {@link Map}. The returned {@code Map} is a 
     * {@link LinkedHashMap} and is truncated in length to the length of the 
     * shorter parameter.
     * 
     * <p>This is intended for use as {@literal "varargs"} supplied to 
     * {@link #arr(Object...)}. Rather than doing something ugly like:
     * <pre>
     * Map&lt;String, String&gt; mappy = new LinkedHashMap&lt;String, String&gt;();
     * mappy.put("key0", "val0");
     * mappy.put("key1", "val1");
     * ...
     * mappy.put("keyN", "valN");
     * </pre>
     * 
     * Simply do like so:
     * <pre>
     * mappy = zipMap(
     *     arr("key0", "key1", ..., "keyN"),
     *     arr("val0", "val1", ..., "valN"));
     * </pre>
     * 
     * <p>The latter approach also allows you to make {@code static final} 
     * {@link Map}s much more easily.
     *
     * @param <K> Type of keys that will be added to the {@code Map}.
     * @param <V> Type of values that will be added to the {@code Map}.
     * @param keys Array whose elements will be the keys in a {@code Map}.
     * @param values Array whose elements will the values in a {@code Map}.
     * 
     * @return A {@code Map} whose entries are of the form 
     * {@code keys[N], values[N]}.
     * 
     * @see #arr(Object...)
     * @see #zipMap(Collection, Collection)
     */
    public static <K, V> Map<K, V> zipMap(K[] keys, V[] values) {
        Map<K, V> zipped = new LinkedHashMap<>(keys.length);
        for (int i = 0; (i < keys.length) && (i < values.length); i++) {
            zipped.put(keys[i], values[i]);
        }
        return zipped;
    }

    /**
     * A version of {@link #zipMap(Object[], Object[])} that works with 
     * {@link Collection}s.
     *
     * @param <K> Type of keys that will be added to the {@code Map}.
     * @param <V> Type of values that will be added to the {@code Map}.
     * @param keys Items that will be the keys in the resulting {@code Map}.
     * @param values Items that will be the values in the result {@code Map}.
     * 
     * @return A {@code Map} whose entries are of the form 
     * {@code keys[N], values[N]}.
     * 
     * @see #zipMap(Object[], Object[])
     */
    public static <K, V> Map<K, V> zipMap(Collection<? extends K> keys,
                                          Collection<? extends V> values)
    {
        Map<K, V> zipped = new LinkedHashMap<>(keys.size());
        Iterator<? extends K> keyIterator = keys.iterator();
        Iterator<? extends V> valueIterator = values.iterator();
        while (keyIterator.hasNext() && valueIterator.hasNext()) {
            zipped.put(keyIterator.next(), valueIterator.next());
        }
        return zipped;
    }

    /**
     * Applies a given function to each item in a given list.
     *
     * @param <A> Type of items that will be passed into {@code f}.
     * @param <B> Type of items that will be in the resulting {@code List}.
     * @param f The {@link Function} to apply.
     * @param as The list whose items are to be fed into {@code f}.
     * 
     * @return New list containing the results of each element of {@code as}
     * being passed through {@code f}.
     */
    public static <A, B> List<B> map(final Function<A, B> f, List<A> as) {
        List<B> bs = new ArrayList<>(as.size());
        bs.addAll(as.stream().map(f::apply).collect(Collectors.toList()));
        return bs;
    }

    /**
     * Applies a given function to each item in a given {@link Set}.
     *
     * @param <A> Type of items that will be passed into {@code f}.
     * @param <B> Type of items that will be in the resulting {@code Set}.
     * @param f The {@link Function} to apply to {@code as}.
     * @param as The {@code Set} whose items are to be fed into {@code f}.
     * 
     * @return New {@code Set} containing the results of passing each element
     * in {@code as} through {@code f}.
     */
    public static <A, B> Set<B> map(final Function<A, B> f, Set<A> as) {
        Set<B> bs = new LinkedHashSet<>(as.size());
        bs.addAll(as.stream().map(f::apply).collect(Collectors.toList()));
        return bs;
    }

    /**
     * {@literal "Generics-friendly"} way to cast an object of some superclass
     * ({@code A}) to a subclass or implementation ({@code B}). This method will
     * fail if you attempt to cast to a type that is not a subclass of type
     * {@code A}.
     *
     * <p>Example/Justification:<br>
     * Consider a method like {@link ucar.unidata.xml.XmlUtil#findChildren(org.w3c.dom.Node, String) XmlUtil.findChildren(Node, String)}.<br/>
     * Despite {@code findChildren} only returning lists containing {@code Node}
     * objects, Java will generate a warning for the following code:
     * <pre>
     * import ucar.unidata.xml.XmlUtil;
     * ....
     * List&lt;Node&gt; nodes = XmlUtil.findChildren(panel, "blah");
     * </pre>
     * {@code cast} is a nice and terse way to avoid those warnings. Here's the
     * previous example (with static imports of {@code cast} and {@code findChildren}):
     * <pre>
     * import static ucar.unidata.xml.XmlUtil.findChildren;
     * import static edu.wisc.ssec.mcidasv.util.CollectionHelpers.cast;
     * ....
     * List&lt;Node&gt; nodes = cast(findChildren(panel, "blah"));
     * </pre>
     *
     * @param <A> Superclass of {@code B}. This is what you are
     * {@literal "casting from"}...likely {@code Object} in most cases
     * @param <B> Subclass of {@code A}. This is what you are
     * {@literal "casting to"}.
     *
     * @param o The object whose type you are casting.
     *
     * @return {@code o}, casted from type {@code A} to {@code B}. Enjoy!
     */
    @SuppressWarnings("unchecked") public static <A, B extends A> B cast(A o) {
        return (B)o;
    }
}