// 2) if two or more indexes appear equal number of times, the lowest
// ones are stored first;
// 2) if two or more indexes appear equal number of times, the lowest
// ones are stored first;
- Int_t entries[size][2], i, j, index;
+ Int_t entries[kSize][2], i, j, index;
if ((entries[i][0] >= 0) && (entries[i+1][0] >= 0)) {
if ((entries[i][1] < entries[i+1][1]) ||
((entries[i][1] == entries[i+1][1]) &&
if ((entries[i][0] >= 0) && (entries[i+1][0] >= 0)) {
if ((entries[i][1] < entries[i+1][1]) ||
((entries[i][1] == entries[i+1][1]) &&