Searched refs:less (Results 1 – 2 of 2) sorted by relevance
315 int less = left; // The index of the first element of center part in sort() local339 while (a[++less] < pivot1); in sort()362 for (int k = less - 1; ++k <= great; ) { in sort()365 a[k] = a[less]; in sort()370 a[less] = ak; in sort()371 ++less; in sort()379 a[k] = a[less]; in sort()380 a[less] = a[great]; in sort()381 ++less; in sort()395 a[left] = a[less - 1]; a[less - 1] = pivot1; in sort()[all …]
270 double less = previousDouble(choiceLimits[i]); in toPattern() local272 double tryLess = Math.abs(Math.IEEEremainder(less, 1.0d)); in toPattern()283 result.append(""+less); in toPattern()