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

/openjdk7/jdk/src/share/demo/applets/SortDemo/
H A DQSortAlgorithm.java71 * @param lo0 left boundary of array partition
74 void QuickSort(int a[], int lo0, int hi0) throws Exception { argument
75 int lo = lo0;
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)) {
113 if (lo0 < hi) {
114 QuickSort(a, lo0, h
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/utils/
H A DNodeVector.java637 * @param lo0 The low index.
642 public void sort(int a[], int lo0, int hi0) throws Exception argument
645 int lo = lo0;
724 * Recursive calls, elements a[lo0] to a[lo-1] are less than or
728 sort(a, lo0, lo - 1);
/openjdk7/jdk/src/share/classes/com/sun/jmx/snmp/agent/
H A DSnmpMibNode.java274 * @param lo0 Left boundary of array partition.
277 static void QuickSort(int a[], int lo0, int hi0) { argument
278 int lo = lo0;
282 if ( hi0 > lo0) {
287 mid = a[ ( lo0 + hi0 ) / 2 ];
300 while( ( hi > lo0 ) && ( a[hi] > mid ))
314 if( lo0 < hi )
315 QuickSort( a, lo0, hi );
/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
170 int lo = lo0;
174 if ( hi0 > lo0)
176 mid = getValueAt( ( lo0 + hi0 ) / 2 , key);
191 while( ( hi > lo0 ) &&
208 if( lo0 < hi )
209 quickSort(lo0, hi , key, isAscending);
/openjdk7/jdk/src/macosx/classes/com/apple/laf/
H A DAquaFileSystemModel.java269 // @param lo0 left boundary of array partition
272 final void quickSort(final Vector<Object> v, final int lo0, final int hi0) { argument
273 int lo = lo0;
277 if (hi0 > lo0) {
280 mid = (SortableFile)v.elementAt((lo0 + hi0) / 2);
295 while ((hi > lo0) && lt(mid, (SortableFile)v.elementAt(hi))) {
309 if (lo0 < hi) {
310 quickSort(v, lo0, hi);
/openjdk7/hotspot/src/share/vm/opto/
H A Dmulnode.cpp237 int32 lo0 = r0->_lo; local
238 double a = (double)lo0;
247 int32 A = lo0*lo1;
249 int32 B = lo0*hi1;
256 if( A < B ) { lo0 = A; hi0 = B; } // Sort range endpoints
257 else { lo0 = B; hi0 = A; }
259 if( C < lo0 ) lo0 = C;
262 if( D < lo0 ) lo0
333 jlong lo0 = r0->_lo; local
[all...]
H A Dsubnode.cpp525 juint lo0 = r0->_lo; local
533 bool bot0 = ((jint)(lo0 ^ hi0) < 0);
538 if (lo0 == 0 && hi0 == 0) {
545 assert(lo0 <= hi0 && lo1 <= hi1, "unsigned ranges are valid");
549 } else if (lo0 > hi1) {
551 } else if (hi0 == lo1 && lo0 == hi1) {
553 } else if (lo0 >= hi1) {
557 if ((jint)lo0 >= 0 && (jint)lo1 >= 0 && is_index_range_check())
568 if ((jint)lo0 >= 0 && (jint)lo1 >= 0 && is_index_range_check())

Completed in 55 milliseconds