Searched defs:hi0 (Results 1 - 7 of 7) sorted by relevance

/openjdk7/jdk/src/share/demo/applets/SortDemo/
H A DQSortAlgorithm.java72 * @param hi0 right boundary of array partition
74 void QuickSort(int a[], int lo0, int hi0) throws Exception { argument
76 int hi = hi0;
79 if (hi0 > lo0) {
84 mid = a[(lo0 + hi0) / 2];
91 while ((lo < hi0) && pauseTrue(lo0, hi0) && (a[lo] < mid)) {
98 while ((hi > lo0) && pauseTrue(lo0, hi0) && (a[hi] > mid)) {
120 if (lo < hi0) {
121 QuickSort(a, lo, hi0);
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/utils/
H A DNodeVector.java638 * @param hi0 The high index.
642 public void sort(int a[], int lo0, int hi0) throws Exception argument
646 int hi = hi0;
720 a[hi0] = a[hi];
725 * equal to pivot, elements a[hi+1] to a[hi0] are greater than
729 sort(a, hi + 1, hi0);
/openjdk7/jdk/src/share/classes/com/sun/jmx/snmp/agent/
H A DSnmpMibNode.java275 * @param hi0 Right boundary of array partition.
277 static void QuickSort(int a[], int lo0, int hi0) { argument
279 int hi = hi0;
282 if ( hi0 > lo0) {
287 mid = a[ ( lo0 + hi0 ) / 2 ];
294 while( ( lo < hi0 ) && ( a[lo] < mid ))
320 if( lo < hi0 )
321 QuickSort( a, lo, hi0 );
/openjdk7/jdk/src/share/classes/sun/tools/jconsole/inspector/
H A DTableSorter.java169 private void quickSort(int lo0,int hi0, int key, boolean isAscending) { argument
171 int hi = hi0;
174 if ( hi0 > lo0)
176 mid = getValueAt( ( lo0 + hi0 ) / 2 , key);
184 while( ( lo < hi0 ) &&
215 if( lo <= hi0 )
216 quickSort(lo, hi0 , key, isAscending);
/openjdk7/jdk/src/macosx/classes/com/apple/laf/
H A DAquaFileSystemModel.java270 // @param hi0 right boundary of array partition
272 final void quickSort(final Vector<Object> v, final int lo0, final int hi0) { argument
274 int hi = hi0;
277 if (hi0 > lo0) {
280 mid = (SortableFile)v.elementAt((lo0 + hi0) / 2);
289 while ((lo < hi0) && lt((SortableFile)v.elementAt(lo), mid)) {
315 if (lo < hi0) {
316 quickSort(v, lo, hi0);
/openjdk7/hotspot/src/share/vm/opto/
H A Dmulnode.cpp239 int32 hi0 = r0->_hi; local
240 double b = (double)hi0;
251 int32 C = hi0*lo1;
253 int32 D = hi0*hi1;
256 if( A < B ) { lo0 = A; hi0 = B; } // Sort range endpoints
257 else { lo0 = B; hi0 = A; }
260 if( D > hi0 ) hi0 = D;
263 if( C > hi0 ) hi0
335 jlong hi0 = r0->_hi; local
[all...]
H A Dsubnode.cpp526 juint hi0 = r0->_hi; local
533 bool bot0 = ((jint)(lo0 ^ hi0) < 0);
538 if (lo0 == 0 && hi0 == 0) {
545 assert(lo0 <= hi0 && lo1 <= hi1, "unsigned ranges are valid");
547 if (hi0 < lo1) {
551 } else if (hi0 == lo1 && lo0 == hi1) {
555 } else if (hi0 <= lo1) {

Completed in 45 milliseconds