Searched defs:middle (Results 1 - 6 of 6) sorted by relevance
/openjdk7/jdk/src/share/sample/forkjoin/mergesort/ |
H A D | MergeSort.java | 89 int middle = low + ((high - low) >> 1); 91 invokeAll(new MergeSortTask(array, low, middle), new MergeSortTask(array, middle, high)); 93 merge(middle); 98 * Merges the two sorted arrays this.low, middle - 1 and middle, this.high - 1 99 * @param middle the index in the array where the second sorted list begins 101 private void merge(int middle) { argument 102 if (array[middle - 1] < array[middle]) { [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/dom/ |
H A D | DeferredDocumentImpl.java | 1890 int middle = (start + end) >>> 1; 1891 int value = values[middle]; 1894 print(values, start, end, middle, target); 1897 while (middle > 0 && values[middle - 1] == target) { 1898 middle--; 1901 System.out.println("FOUND AT "+middle); 1903 return middle; 1908 end = middle - 1; 1911 start = middle 2071 print(int values[], int start, int end, int middle, int target) argument [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | heapRegion.cpp | 466 HeapWord* middle = low + (diff+1)/2; local 467 if (middle == high) return high; 468 HeapWord* mid_bs = block_start_careful(middle); 470 low = middle;
|
/openjdk7/hotspot/src/share/vm/asm/ |
H A D | codeBuffer.cpp | 156 address middle = limit - size; local 157 middle -= (intptr_t)middle & (align-1); // align the division point downward 158 guarantee(middle - slop > start, "need enough space to divide up"); 159 _insts._limit = middle - slop; // subtract desired space, plus slop 160 cs->initialize(middle, limit - middle); 161 assert(cs->start() == middle, "sanity");
|
/openjdk7/jdk/src/share/classes/sun/java2d/pisces/ |
H A D | Stroker.java | 770 private float[] middle = new float[2*8]; field in class:Stroker 783 final float xf = middle[type-2], yf = middle[type-1]; 784 float dxs = middle[2] - middle[0]; 785 float dys = middle[3] - middle[1]; 786 float dxf = middle[type - 2] - middle[type - 4]; 787 float dyf = middle[typ [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/ |
H A D | psParallelCompact.cpp | 1312 const size_t middle = left + (right - left) / 2; local 1313 RegionData* const middle_ptr = sd.region(middle); 1315 HeapWord* const addr = sd.region_to_addr(middle); 1319 if (middle > left && dest < addr) { 1320 right = middle - 1; 1321 } else if (middle < right && middle_ptr->data_size() == region_size) { 1322 left = middle + 1; 1342 const size_t middle = left + (right - left) / 2; local 1343 RegionData* const middle_ptr = sd.region(middle); 1345 HeapWord* const addr = sd.region_to_addr(middle); [all...] |
Completed in 68 milliseconds