}
// Determine if there are any gaps in the PK columns (in which case we don't need
// to sort in the coprocessor because the keys will already naturally be in sorted
// order.
int prevPos = positionOffset - 1;
OrderPreserving prevOrderPreserving = OrderPreserving.YES;
for (int i = 0; i < entries.size() && isOrderPreserving; i++) {
Entry entry = entries.get(i);
int pos = entry.getPkPosition();
isOrderPreserving &= (entry.getOrderPreserving() != OrderPreserving.NO) && (pos == prevPos || ((pos - 1 == prevPos) && (prevOrderPreserving == OrderPreserving.YES)));
prevPos = pos;