// Copyright 2008-2010 by Mary McGlohon
// Carnegie Mellon University
// mmcgloho@cs.cmu.edu

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;

public class CascadeUtils {
    
    public static String[] sortStringArray(String[] array) {
        String[] sortedarray = new String[array.length];
		ArrayList<String> al =  new ArrayList<String>();
		for (int i = 0; i < array.length; i++)
                    al.add(array[i]);
		Collections.sort(al);
		for (int i = 0; i < al.size(); i++) 
                    sortedarray[i]=al.get(i);
		return sortedarray;
		
    }


    // TODO(mmcgloho): Make this typesafe.
    public static ArrayList sortMapByValues(HashMap map) {
        ArrayList<Map.Entry<Object, Comparable>> list = new ArrayList<Map.Entry<Object, Comparable>>(map.entrySet());
        Collections.sort(list, new Comparator<Map.Entry<Object, Comparable>>() {
                public int compare(Map.Entry<Object, Comparable> e1, 
                                   Map.Entry<Object, Comparable> e2) {
                    return (-1 * (e1.getValue()).compareTo(e2.getValue()));
                }
            });
        return list;            
    }




}