Searched refs:MAX_SEEK_POINTS (Results 1 – 2 of 2) sorted by relevance
310 const int MAX_SEEK_POINTS = 7; in generateSeekTestArgs() local335 for (int i = 0; i < MAX_SEEK_POINTS; i++) { in generateSeekTestArgs()359 if (size > MAX_SEEK_POINTS) { in generateSeekTestArgs()360 indices = new int[MAX_SEEK_POINTS]; in generateSeekTestArgs()361 indexSize = MAX_SEEK_POINTS; in generateSeekTestArgs()363 indices[MAX_SEEK_POINTS - 1] = size - 1; in generateSeekTestArgs()364 for (int i = 1; i < MAX_SEEK_POINTS - 1; i++) { in generateSeekTestArgs()366 indices[i] = (int)(r * (MAX_SEEK_POINTS - 1) + 1); in generateSeekTestArgs()479 const int MAX_SEEK_POINTS = 7; in isSeekOk() local486 for (int i = 0; i < MAX_SEEK_POINTS && result; i++) { in isSeekOk()
554 final int MAX_SEEK_POINTS = 7; in isSeekOk() local563 for (int i = 0; i < MAX_SEEK_POINTS && result; i++) { in isSeekOk()774 private static final int MAX_SEEK_POINTS = 7;934 for (int i = 0; i < MAX_SEEK_POINTS; i++) {954 if (size > MAX_SEEK_POINTS) {955 indices = new int[MAX_SEEK_POINTS];957 indices[MAX_SEEK_POINTS - 1] = size - 1;958 for (int i = 1; i < MAX_SEEK_POINTS - 1; i++) {959 indices[i] = (int) (mRandNum.nextDouble() * (MAX_SEEK_POINTS - 1) + 1);