Lines Matching defs:starts
71 // starts. For convenience, there is an extra entry at the
82 // starts. For convenience, there is an extra entry at the
125 // Add extra entries to starts arrays with the length
137 * Adjust indices in starts to reflect an insertion after pos.
138 * Any index in starts greater than pos will be increased by 1.
140 private static void insertInto(int pos, int[] starts, int numStarts) {
142 while (starts[--numStarts] > pos) {
143 starts[numStarts] += 1;
202 * Adjust indices in starts to reflect a deletion after deleteAt.
203 * Any index in starts greater than deleteAt will be increased by 1.
207 private static void deleteFrom(int deleteAt, int[] starts, int numStarts) {
209 while (starts[--numStarts] > deleteAt) {
210 starts[numStarts] -= 1;
323 * Return i such that starts[i] <= index < starts[i+1]. starts
327 private static int findRunContaining(int index, int[] starts) {
330 if (starts[i] > index) {
338 * the given index to the given starts array. If the
339 * starts array does not have room for the index, a
345 int[] starts) {
350 if (starts.length == count) {
351 int[] temp = new int[starts.length*2];
352 System.arraycopy(starts, 0, temp, 0, starts.length);
353 starts = temp;
355 starts[count-1] = index;
357 return starts;