if (oldState[i]==FULL) { double element = oldTable[i]; int index = indexOfInsertion(element); newTable[index]=element; newValues[index]=oldValues[i];
if (oldState[i] == FULL) { double element = oldTable[i]; int index = indexOfInsertion(element); newTable[index] = element; newValues[index] = oldValues[i];
if (oldState[i]==FULL) { double element = oldTable[i]; int index = indexOfInsertion(element); newTable[index]=element; newValues[index]=oldValues[i];
int i = indexOfInsertion(key); if (i<0) { //already contained i = -i -1;
int i = indexOfInsertion(key); if (i<0) { //already contained i = -i -1;
int i = indexOfInsertion(key); if (i < 0) { // already contained i = -i - 1;