private int[] abD(Id nid, int di[]) { long x, y, d; int c = 0; if (compareTo(nid) > 0) for (int i = 0; i < nlen; i++) { x = Id[i] & 0x0ffffffffL; y = nid.Id[i] & 0x0ffffffffL; d = x - y - c; if (d < 0) c = 1; else c = 0; di[i] = (int) d; } else for (int i = 0; i < nlen; i++) { x = Id[i] & 0x0ffffffffL; y = nid.Id[i] & 0x0ffffffffL; d = y - x - c; if (d < 0) c = 1; else c = 0; di[i] = (int) d; } return di; }