"<".length());
">-<".length());
  public String multiResultsetRanking(int comparisonColumn)    throws Exception {    int [][] win = multiResultsetWins(comparisonColumn);    int numResultsets = getNumResultsets();    int [] wins = new int [numResultsets];    int [] losses = new int [numResultsets];    int [] diff = new int [numResultsets];    for (int i = 0; i < win.length; i++) {      for (int j = 0; j < win[i].length; j++) {	wins[j] += win[i][j];	diff[j] += win[i][j];	losses[i] += win[i][j];	diff[i] -= win[i][j];      }    }    int biggest = Math.max(wins[Utils.maxIndex(wins)],			   losses[Utils.maxIndex(losses)]);    int width = Math.max(2 + (int)(Math.log(biggest) / Math.log(10)),			 "<".length());    String result = Utils.padLeft(">-<", width) + ' '      + Utils.padLeft(">", width) + ' '      + Utils.padLeft("<", width) + " Scheme\n";    int [] ranking = Utils.sort(diff);    for (int i = numResultsets - 1; i >= 0; i--) {      int curr = ranking[i];      result += Utils.padLeft("" + diff[curr], width) + ' '	+ Utils.padLeft("" + wins[curr], width) + ' '	+ Utils.padLeft("" + losses[curr], width) + ' '	+ getResultsetName(curr) + '\n';    }    return result;  }