Searched refs:MAX_SEEK_POINTS (Results 1 – 2 of 2) sorted by relevance
306 const int MAX_SEEK_POINTS = 7; in generateSeekTestArgs() local331 for (int i = 0; i < MAX_SEEK_POINTS; i++) { in generateSeekTestArgs()355 if (size > MAX_SEEK_POINTS) { in generateSeekTestArgs()356 indices = new int[MAX_SEEK_POINTS]; in generateSeekTestArgs()357 indexSize = MAX_SEEK_POINTS; in generateSeekTestArgs()359 indices[MAX_SEEK_POINTS - 1] = size - 1; in generateSeekTestArgs()360 for (int i = 1; i < MAX_SEEK_POINTS - 1; i++) { in generateSeekTestArgs()362 indices[i] = (int)(r * (MAX_SEEK_POINTS - 1) + 1); in generateSeekTestArgs()473 const int MAX_SEEK_POINTS = 7; in isSeekOk() local480 for (int i = 0; i < MAX_SEEK_POINTS && result; i++) { in isSeekOk()
539 final int MAX_SEEK_POINTS = 7; in isSeekOk() local548 for (int i = 0; i < MAX_SEEK_POINTS && result; i++) { in isSeekOk()759 private static final int MAX_SEEK_POINTS = 7;919 for (int i = 0; i < MAX_SEEK_POINTS; i++) {939 if (size > MAX_SEEK_POINTS) {940 indices = new int[MAX_SEEK_POINTS];942 indices[MAX_SEEK_POINTS - 1] = size - 1;943 for (int i = 1; i < MAX_SEEK_POINTS - 1; i++) {944 indices[i] = (int) (mRandNum.nextDouble() * (MAX_SEEK_POINTS - 1) + 1);