Searched refs:hi (Results 1 - 25 of 110) sorted by relevance

12345

/openjdk7/langtools/test/tools/javac/
H A DClosure1.java35 // Specifically, N must have its T.this initialized when S calls hi().
39 void hi() { throw new Error(); } method in class:Closure1.S
40 S() { hi(); }
45 void hi() { method in class:Closure1.T.N
/openjdk7/jdk/src/share/demo/applets/SortDemo/
H A DQSortAlgorithm.java55 private boolean pauseTrue(int lo, int hi) throws Exception { argument
56 super.pause(lo, hi);
76 int hi = hi0;
87 while (lo <= hi) {
98 while ((hi > lo0) && pauseTrue(lo0, hi0) && (a[hi] > mid)) {
99 --hi;
103 if (lo <= hi) {
104 swap(a, lo, hi);
106 --hi;
[all...]
/openjdk7/hotspot/src/share/vm/libadt/
H A Dset.cpp81 uint hi = (uint)-2, lo = (uint)-2; local
83 if( hi+1 == i.elem ) { // Moving sequentially thru range?
84 hi = i.elem; // Yes, just update hi end of range
93 if( lo != hi ) sprintf(s,"%d-%d,",lo,hi);
97 hi = lo = i.elem;
107 if( lo != hi ) sprintf(s,"%d-%d}",lo,hi);
139 uint hi, local
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/utils/
H A DNodeVector.java646 int hi = hi0;
648 // pause(lo, hi);
649 if (lo >= hi)
653 else if (lo == hi - 1)
659 if (a[lo] > a[hi])
663 a[lo] = a[hi];
664 a[hi] = T;
673 int pivot = a[(lo + hi) / 2];
675 a[(lo + hi) / 2] = a[hi];
[all...]
/openjdk7/jdk/test/java/io/RandomAccessFile/
H A DOpenSync.java58 String hi = "Hello, world!";
60 raf.writeUTF(hi);
64 if (!raf.readUTF().equals(hi))
/openjdk7/jdk/test/com/sun/jdi/
H A DRedefineChangeClassOrder.sh51 new $1().hi(false);
52 new $1().hi(true); // @1 breakpoint
55 public void hi(boolean expected) {
68 foo1.hi(); // @1 commentout
93 foo2.hi();
96 // @1 uncomment foo1.hi();
101 public void hi() {
107 public void hi() {
/openjdk7/jdk/src/share/classes/com/sun/jmx/snmp/agent/
H A DSnmpMibNode.java279 int hi = hi0;
290 while( lo <= hi ) {
300 while( ( hi > lo0 ) && ( a[hi] > mid ))
301 --hi;
304 if( lo <= hi ) {
305 swap(a, lo, hi);
307 --hi;
314 if( lo0 < hi )
315 QuickSort( a, lo0, hi );
[all...]
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/interpreter/
H A DBytecodeTableswitch.java57 int hi = highKey();
58 if (hi < lo) // incorrect hi/lo values in tableswitch
61 int i = hi - lo - 1 ;
94 int hi = highKey();
95 int i = hi - lo - 1 ;
/openjdk7/jdk/src/share/native/java/lang/fdlibm/src/
H A De_exp.c37 * Here r will be represented as r = hi-lo for better
122 double y,hi=0,lo=0,c,t; local
144 hi = x-ln2HI[xsb]; lo=ln2LO[xsb]; k = 1-xsb-xsb;
148 hi = x - t*ln2HI[0]; /* t*ln2HI is exact here */
151 x = hi - lo;
162 else y = one-((lo-(x*c)/(2.0-c))-hi);
H A Ds_expm1.c150 double y,hi,lo,c=0,t,e,hxs,hfx,r1; local
179 {hi = x - ln2_hi; lo = ln2_lo; k = 1;}
181 {hi = x + ln2_hi; lo = -ln2_lo; k = -1;}
185 hi = x - t*ln2_hi; /* t*ln2_hi is exact here */
188 x = hi - lo;
189 c = (hi-x)-lo;
/openjdk7/hotspot/src/cpu/zero/vm/
H A Dbytes_zero.hpp96 u4 hi, lo; local
97 hi = (u4(p[0]) << 24) |
105 return u8(lo) | (u8(hi) << 32);
119 u4 hi, lo; local
121 hi = x >> 32;
122 p[0] = hi >> 24;
123 p[1] = hi >> 16;
124 p[2] = hi >> 8;
125 p[3] = hi;
/openjdk7/jdk/src/share/classes/java/lang/
H A DCharacterName.java75 int hi = cp >> 8;
76 if (lookup[hi] == null) {
77 lookup[hi] = new int[0x100];
79 lookup[hi][cp&0xff] = (nameOff << 8) | len;
/openjdk7/jdk/test/java/util/concurrent/BlockingQueue/
H A DLoopHelpers.java51 int hi = 16807 * (x >>> 16);
52 lo += (hi & 0x7FFF) << 16;
57 lo += hi >>> 15;
/openjdk7/jdk/test/java/util/concurrent/ConcurrentHashMap/
H A DLoopHelpers.java51 int hi = 16807 * (x >>> 16);
52 lo += (hi & 0x7FFF) << 16;
57 lo += hi >>> 15;
/openjdk7/jdk/test/java/util/concurrent/ConcurrentQueues/
H A DLoopHelpers.java51 int hi = 16807 * (x >>> 16);
52 lo += (hi & 0x7FFF) << 16;
57 lo += hi >>> 15;
/openjdk7/jdk/test/java/util/concurrent/Exchanger/
H A DLoopHelpers.java50 int hi = 16807 * (x >>> 16);
51 lo += (hi & 0x7FFF) << 16;
56 lo += hi >>> 15;
/openjdk7/jdk/test/java/util/concurrent/ExecutorCompletionService/
H A DLoopHelpers.java50 int hi = 16807 * (x >>> 16);
51 lo += (hi & 0x7FFF) << 16;
56 lo += hi >>> 15;
/openjdk7/jdk/test/java/util/concurrent/FutureTask/
H A DLoopHelpers.java50 int hi = 16807 * (x >>> 16);
51 lo += (hi & 0x7FFF) << 16;
56 lo += hi >>> 15;
/openjdk7/jdk/test/java/util/concurrent/locks/ReentrantLock/
H A DLoopHelpers.java50 int hi = 16807 * (x >>> 16);
51 lo += (hi & 0x7FFF) << 16;
56 lo += hi >>> 15;
/openjdk7/jdk/test/java/util/concurrent/locks/ReentrantReadWriteLock/
H A DLoopHelpers.java50 int hi = 16807 * (x >>> 16);
51 lo += (hi & 0x7FFF) << 16;
56 lo += hi >>> 15;
/openjdk7/jdk/src/share/classes/sun/tools/jconsole/inspector/
H A DTableSorter.java171 int hi = hi0;
178 while( lo <= hi )
191 while( ( hi > lo0 ) &&
192 ( compareG(mid,getValueAt(hi,key), isAscending) ))
193 --hi;
196 if( lo <= hi )
198 swap(lo, hi, key);
200 --hi;
208 if( lo0 < hi )
209 quickSort(lo0, hi , ke
[all...]
/openjdk7/jdk/src/share/classes/java/io/
H A DStreamTokenizer.java272 * @param hi the high end of the range.
274 public void wordChars(int low, int hi) { argument
277 if (hi >= ctype.length)
278 hi = ctype.length - 1;
279 while (low <= hi)
293 * @param hi the high end of the range.
295 public void whitespaceChars(int low, int hi) { argument
298 if (hi >= ctype.length)
299 hi = ctype.length - 1;
300 while (low <= hi)
315 ordinaryChars(int low, int hi) argument
[all...]
/openjdk7/jdk/src/share/classes/java/util/
H A DTimSort.java176 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c) { argument
178 Arrays.sort(a, lo, hi);
182 rangeCheck(a.length, lo, hi);
183 int nRemaining = hi - lo;
189 int initRunLen = countRunAndMakeAscending(a, lo, hi, c);
190 binarySort(a, lo, hi, lo + initRunLen, c);
203 int runLen = countRunAndMakeAscending(a, lo, hi, c);
222 assert lo == hi;
240 * @param hi the index after the last element in the range to be sorted
242 * not already known to be sorted ({@code lo <= start <= hi})
246 binarySort(T[] a, int lo, int hi, int start, Comparator<? super T> c) argument
316 countRunAndMakeAscending(T[] a, int lo, int hi, Comparator<? super T> c) argument
343 reverseRange(Object[] a, int lo, int hi) argument
[all...]
H A DComparableTimSort.java149 static void sort(Object[] a, int lo, int hi) { argument
150 rangeCheck(a.length, lo, hi);
151 int nRemaining = hi - lo;
157 int initRunLen = countRunAndMakeAscending(a, lo, hi);
158 binarySort(a, lo, hi, lo + initRunLen);
171 int runLen = countRunAndMakeAscending(a, lo, hi);
190 assert lo == hi;
208 * @param hi the index after the last element in the range to be sorted
210 * not already known to be sorted ({@code lo <= start <= hi})
213 private static void binarySort(Object[] a, int lo, int hi, in argument
283 countRunAndMakeAscending(Object[] a, int lo, int hi) argument
309 reverseRange(Object[] a, int lo, int hi) argument
[all...]
/openjdk7/jdk/src/share/classes/sun/nio/cs/ext/
H A DHKSCS.java340 int hi = c >> 8;
341 if (c2b[hi] == C2B_UNMAPPABLE) {
342 c2b[hi] = new char[0x100];
343 Arrays.fill(c2b[hi], (char)UNMAPPABLE_ENCODING);
345 c2b[hi][c & 0xff] = (char)((b1 << 8) | (i + b2Min));
353 int hi = c >> 8;
354 if (c2b[hi] == C2B_UNMAPPABLE) {
355 c2b[hi] = new char[0x100];
356 Arrays.fill(c2b[hi], (char)UNMAPPABLE_ENCODING);
358 c2b[hi][
[all...]

Completed in 133 milliseconds

12345