Searched defs:sort (Results 51 - 58 of 58) sorted by relevance

123

/openjdk7/jdk/src/share/classes/sun/java2d/loops/
H A DProcessPath.java1304 Arrays.sort(params, 0, cnt);
1846 * We could not use O(N) Radix sort here because in most cases list of
1847 * edges almost sorted. So, bubble sort (O(N^2)) is working much
1848 * better. Note, in case of array of edges Shell sort is more
1851 public void sort() { method in class:ProcessPath.ActiveEdgeList
1980 activeList.sort();
/openjdk7/jdk/src/share/classes/java/util/
H A DCollections.java46 * to. (For example, the algorithm used by <tt>sort</tt> does not have to be
55 * example, invoking the <tt>sort</tt> method on an unmodifiable list that is
110 * <p>This sort is guaranteed to be <i>stable</i>: equal elements will
111 * not be reordered as a result of the sort.
129 * simply concatenate the arrays and sort the resulting array.
131 * <p>The implementation was adapted from Tim Peters's list sort for Python
142 * to sort a linked list in place.
153 public static <T extends Comparable<? super T>> void sort(List<T> list) { method in class:Collections
155 Arrays.sort(a);
170 * <p>This sort i
215 public static <T> void sort(List<T> list, Comparator<? super T> c) { method in class:Collections
[all...]
/openjdk7/hotspot/src/share/vm/memory/
H A Ddump.cpp1223 SortMethodsClosure sort; local
1224 gen->ro_space()->object_iterate(&sort);
1225 gen->rw_space()->object_iterate(&sort);
/openjdk7/hotspot/src/share/vm/opto/
H A Dnode.cpp846 // %%% Temporary, until we sort out CheckCastPP vs. CastPP.
1925 void Node_Array::sort( C_sort_func_t func) { function in class:Node_Array
H A Dloopnode.cpp2698 //------------------------------sort-------------------------------------------
2701 IdealLoopTree *PhaseIdealLoop::sort( IdealLoopTree *loop, IdealLoopTree *innermost ) { function in class:PhaseIdealLoop
2710 while( l ) { // Insertion sort based on pre-order
2734 if( p ) sort( p, innermost ); // Insert my parents into list as well
2762 // loops. This means I need to sort my childrens' loops by pre-order.
2763 // The sort is of size number-of-control-children, which generally limits
2944 // it's children belong to several different loops. The sort call
2947 // belong to different loops, the sort call will properly set the
2951 innermost = sort( l, innermost );
/openjdk7/jdk/src/share/classes/com/sun/java/swing/plaf/gtk/
H A DGTKFileChooserUI.java920 protected void sort(Vector<? extends File> v) { method in class:GTKFileChooserUI.GTKDirectoryModel
922 Collections.sort(v, fileComparator);
/openjdk7/jdk/src/share/classes/sun/swing/
H A DFilePane.java923 public void sort() { method in class:FilePane.DetailsTableRowSorter
926 DetailsTableRowSorter.super.sort();
1522 Arrays.sort(files);
1523 Arrays.sort(selectedObjects);
/openjdk7/jdk/test/tools/pack200/pack200-verifier/src/xmlkit/
H A DXMLKit.java97 * void sortAttrs() // sort by key
141 * void sort(Comparator=contentOrder())
1223 public void sort(Comparator<Object> c) { method in class:XMLKit.Element
1224 Arrays.sort(parts, 0, size, c);
1227 public void sort() { method in class:XMLKit.Element
1228 sort(CONTENT_ORDER);
2117 Arrays.sort(buf, 0, alen / 2);
4287 ce.sort();

Completed in 89 milliseconds

123