Lines Matching defs:start
45 * Return the level of each character into the levels array starting at start.
50 * @param start the starting offset into the the array
51 * @throws IndexOutOfBoundsException if <code>start</code> is less than 0 or
52 * <code>start + getLength()</code> is greater than <code>levels.length</code>.
54 public static void getLevels(Bidi bidi, byte[] levels, int start) {
55 int limit = start + bidi.getLength();
57 if (start < 0 || limit > levels.length) {
59 " start: " + start + " limit: " + limit);
63 int p = start;
65 int rlimit = start + bidi.getRunLimit(i);
187 * Compute a contiguous order for the range start, limit.
189 private static int[] computeContiguousOrder(int[] values, int start,
192 int[] result = new int[limit-start];
194 result[i] = i + start;
215 // shift result by start:
216 if (start != 0) {
218 result[i] -= start;
239 * Return an array containing the data in the values array from start up to limit,
240 * normalized to fall within the range from 0 up to limit - start.
246 * @param start the starting offset in the values and levels arrays
251 int start, int limit) {
254 if (start != 0 || limit != values.length) {
265 if (levels[start] == levels[limit-1]) {
266 primaryLevel = levels[start];
271 for (i=start; i < limit; i++) {
296 int[] result = new int[limit-start];
302 baseValue = values[start];
306 System.arraycopy(values, start, result, 0, limit-start);
310 result[j] = values[j+start] - baseValue;
317 return computeContiguousOrder(values, start, limit);