// BridgeHand.java
// [comment block]

import java.util.*; // Allows the use of Arrays.sort()

// BridgeHand implements the Comparable interface:
// this means that the class must have a compareTo method
// that behaves appropriately. See Card.java for an example
// of how another compareTo() has been done.
public class BridgeHand implements Comparable
{
    public static final int CARDSINHAND = 13;
    private Card[] hand;
    private int numPoints;
	
    // Constructor: input is 13 Cards
    // This must create a local copy of the input array.
    // Also, maintain the cards in sorted order
    // (use Arrays.sort() to do this).
    public BridgeHand(Card[] hand)
    {
    }

    // calculatePoints sets a value for numPoints.
    // It's private because no one outside the class
    // should ever need to call it (the constructor should)
    private void calculatePoints()
    {
    }

    // compareTo returns 1 if the current Hand is better than 
    // otherHand, 0 if they're equally good, and -1 if the otherHand
    // is better than this one.
    public int compareTo(Object otherHand)
    {
    }
	
    // ----- Add any other accessor or update methods here ----- //


    // Game tester.  You should create a new deck of cards,
    // shuffle it, and then deal out four hands.  This will
    // entirely consume the deck. Then sort the deck using
    // one of your methods in Sorting.java (you may use 
    // Arrays.sort() to check if you're getting the right result,
    // but you should ALSO try calling your own methods.)
    // Print out the hands before and after sorting.
    public static void main(String[] args)
    {
    }

    // --------- DO NOT MODIFY BELOW THIS LINE -------------- //
    // Nice printing method for a BridgeHand.
    public String toString()
    {
	String h = "< ";
	for (int i=0; i<CARDSINHAND-1; i++)
	{
	    h += hand[i] + ", ";
	}
	h += hand[CARDSINHAND-1] + " >";
	h += " (" + numPoints + " points)";
	return h;
    }
	
}