Lines Matching defs:buffer
296 private int[] rangeList; // internal buffer
297 private int[] buffer; // internal buffer
1333 if (buffer != null && newLen <= buffer.length) return;
1334 buffer = new int[newLen + GROW_EXTRA];
1375 buffer[k++] = a;
1378 buffer[k++] = b;
1385 buffer[k++] = HIGH;
1390 // swap list and buffer
1392 list = buffer;
1393 buffer = temp;
1415 // Back up over overlapping ranges in buffer[]
1416 if (k > 0 && a <= buffer[k-1]) {
1417 // Pick latter end value in buffer[] vs. list[]
1418 a = max(list[i], buffer[--k]);
1421 buffer[k++] = a;
1427 if (k > 0 && b <= buffer[k-1]) {
1428 b = max(other[j], buffer[--k]);
1430 buffer[k++] = b;
1439 if (k > 0 && a <= buffer[k-1]) {
1440 a = max(list[i], buffer[--k]);
1443 buffer[k++] = a;
1454 buffer[k++] = a;
1457 buffer[k++] = b;
1464 buffer[k++] = a; a = list[i++]; polarity ^= 1;
1475 buffer[k++] = b; b = other[j++]; polarity ^= 2;
1486 buffer[k++] = HIGH; // terminate
1488 // swap list and buffer
1490 list = buffer;
1491 buffer = temp;
1518 buffer[k++] = a; a = list[i++]; polarity ^= 1;
1524 buffer[k++] = a; a = list[i++]; polarity ^= 1;
1526 buffer[k++] = b; b = other[j++]; polarity ^= 2;
1529 buffer[k++] = a; a = list[i++]; polarity ^= 1;
1537 buffer[k++] = b; b = other[j++]; polarity ^= 2;
1548 buffer[k++] = a; a = list[i++]; polarity ^= 1;
1557 buffer[k++] = HIGH; // terminate
1559 // swap list and buffer
1561 list = buffer;
1562 buffer = temp;