import java.io.*;
class GreaterAat {
// Copyleft Harvey Greenberg, UW hgreen@u.washington.edu Dec 18  1997
// This loads an ARC/INFO AAT file into an array of objects (see Aat.java),
//  and checks that one or more items increase as you go downstream.
// Before invoking this class, we have built (in ARCINFO) a river network,
// The first argument is the name of the stream cover.
//          Second argument = an item to check
// The otional additional argumen: more itmes
//
// Remember, java defaults to a memory limit of 16 megs.  Use the mx switch,
// e.g. "java GreaterAat -mx200m mycover" for large data.


  public static void main (String args[])  throws IOException {
    Aat myatt;
    double value,upvalue;

    int maxid,nitems,itest1,itest2;
    int index[] = new int[10];
    int type[] = new int[10];
    String covername,item[] = new String[10];

    System.out.println("checking aat, version 1.00");
    if (args.length < 2){
	System.out.println("The cover name and at least one item name are required arguments.");
        return;
    }
    else
	covername = args[0];
    nitems = args.length - 1;
    for(int i=0;i<nitems;i++){
	item[i] = new String(args[i+1]);
    }
    System.out.println("Cover: " + covername + " with " + nitems +" items");
    try{
	myatt  = new Aat(covername);
    }
    catch (AatError e){
	System.out.print("Error loading AAT file:");
	System.out.println(e.getMessage());
	return;
    }
    myatt.report();

//return;
    maxid = myatt.nrecords;
    for(int i=0;i<nitems;i++){
	index[i] = myatt.findItem(item[i]);
	if(index[i] < 0)
	   return;
	type[i] = myatt.itemType[index[i]];
    }

      for(int i = 0;i < maxid;i++){
	for(int j = 0;j< maxid;j++){
	    if(myatt.tnode[j] == myatt.fnode[i]){  // found upstream arc
	      for(int k=0;k<nitems;k++){
		switch(type[k]){
		  case 3:	// I
		  case 5:	//Binary int
		    if(myatt.ivalues[index[k]][i] < myatt.ivalues[index[k]][j])
			System.out.println(item[k] + i + " (" + myatt.ivalues[index[k]][i] + ") < " + j + " (" + myatt.ivalues[index[k]][j] + ")");
		    break;
		  case 4:	// numeric
		  case 6:	// Float
		    if(myatt.dvalues[index[k]][i] < myatt.dvalues[index[k]][j])
			System.out.println(item[k] + i + " (" + myatt.dvalues[index[k]][i] + ") < " + j + " (" + myatt.dvalues[index[k]][j] + ")");
		    break;
		  default:
		    System.out.println("Item type is " + type[k] + "!  Get out out of here!" + k);
		    return;
		}	// switch
	      }		// each item
	    }		// a match
	}		// uphill search
      }			// each arc
  }
}