/external/chromium_org/third_party/sqlite/src/test/ |
H A D | boundary1.tcl | 71 # A simple selection sort. Not trying to be efficient. 73 proc sort {inlist} { procedure 180 puts "\175 {[sort $aset]}" 187 puts "\175 {[reverse [sort $aset]]}" 191 foreach rx [sort $rset] { 202 foreach rx [reverse [sort $rset]] { 217 foreach x [sort $xset] { 236 foreach rx [sort $rset] { 247 foreach rx [reverse [sort $rset]] { 265 foreach rx [sort [all...] |
H A D | boundary2.tcl | 71 # A simple selection sort. Not trying to be efficient. 73 proc sort {inlist} { procedure 181 puts "\175 {[sort $aset]}" 188 puts "\175 {[reverse [sort $aset]]}" 192 foreach rx [sort $rset] { 203 foreach rx [reverse [sort $rset]] { 218 foreach x [sort $xset] { 237 foreach rx [sort $rset] { 248 foreach rx [reverse [sort $rset]] { 266 foreach rx [sort [all...] |
H A D | boundary3.tcl | 71 # A simple selection sort. Not trying to be efficient. 73 proc sort {inlist} { procedure 197 puts "\175 {[sort $aset]}" 205 puts "\175 {[reverse [sort $aset]]}" 211 foreach rx [sort $rset] { 224 foreach rx [reverse [sort $rset]] { 241 foreach x [sort $xset] { 262 foreach rx [sort $rset] { 275 foreach rx [reverse [sort $rset]] {
|
H A D | boundary4.tcl | 70 # A simple selection sort. Not trying to be efficient. 72 proc sort {inlist} { procedure 149 foreach r [sort $all_rowid] { 156 foreach r [reverse [sort $all_rowid]] { 163 foreach a [sort $all_a] { 171 foreach a [reverse [sort $all_a]] { 179 foreach x [sort $all_x] { 187 foreach x [reverse [sort $all_x]] { 197 foreach r [sort $all_rowid] { 204 foreach r [reverse [sort [all...] |
/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | regress-98773.js | 28 // Calling Array.sort on an external array is not supposed to crash. 36 Array.prototype.sort.call(array);
|
H A D | regress-sort-arguments.js | 8 Array.prototype.sort.apply(a); 10 Array.prototype.sort.apply(a);
|
H A D | regress-builtin-array-op.js | 28 // Test that we invoke the correct sort function in 32 Array.prototype.sort = function(fn) { foo = "fisk"; };
|
H A D | regress-1131.js | 29 Array.prototype.sort.call(nonArray);
|
H A D | regress-326.js | 29 // Should sort non-array into equivalent of [37,42,undefined,,0] 32 Array.prototype.sort.call(nonArray); 35 assertEquals(37, nonArray[0], "sort smallest first"); 36 assertEquals(42, nonArray[1], "sort largest last"); 38 assertEquals(undefined, nonArray[2], "sort undefined after largest");
|
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | DOMStringList.cpp | 51 void DOMStringList::sort() function in class:blink::DOMStringList 53 std::sort(m_strings.begin(), m_strings.end(), WTF::codePointCompareLessThan);
|
/external/junit/src/org/junit/runner/manipulation/ |
H A D | Sortable.java | 15 public void sort(Sorter sorter); method in interface:Sortable
|
/external/replicaisland/src/com/replica/replicaisland/ |
H A D | Sorter.java | 22 public abstract void sort(Type[] array, int count, Comparator<Type> comparator); method in class:Sorter
|
H A D | StandardSorter.java | 25 public void sort(Object[] array, int count, Comparator comparator) { method in class:StandardSorter 26 Arrays.sort(array, 0, count, comparator);
|
H A D | QuickSorter.java | 22 public void sort(Type[] array, int count, Comparator<Type> comparator) { method in class:QuickSorter 27 // http://www.cs.princeton.edu/introcs/42sort/QuickSort.java.html
|
H A D | ShellSorter.java | 23 * Shell sort implementation based on the one found here: 30 public void sort(Type[] array, int count, Comparator<Type> comparator) { method in class:ShellSorter 33 // Sort by insertion sort at diminishing increments. 49 * Insertion sort modified to sort elements at a 53 * 'if', but I found that it made the sort slower.
|
/external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
H A D | p6.cpp | 44 template<class T> void sort(Array<T>& v) { /* ... */ } function 50 sort(v); // expected-note{{required}} 52 // sort(Array<T>&), T is String 55 template<> void sort<String>(Array<String>& v); // // expected-error{{after instantiation}} 56 template<> void sort<>(Array<char*>& v); // OK: sort<char*> not yet used
|
H A D | p1.cpp | 99 template<class T> void sort(Array<T>& v) { /* ... */ } function 100 template<> void sort<char*>(Array<char*>&) ;
|
/external/clang/test/CXX/temp/temp.spec/temp.explicit/ |
H A D | p2.cpp | 8 template<class T> void sort(Array<T>& v) { /* ... */ } function 9 template void sort(Array<char>&);
|
H A D | p6.cpp | 5 template<class T> void sort(Array<T>& v) { } function 7 // instantiate sort(Array<int>&) - template-argument deduced 8 template void sort<>(Array<int>&); 10 template void sort(Array<long>&);
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | Graph.java | 33 * This is only used to topologically sort a list of file dependencies 70 /** DFS-based topological sort. A valid sort is the reverse of 81 public List<Object> sort() { method in class:Graph
|
/external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
H A D | NodeSorter.java | 35 * This class can sort vectors of DOM nodes according to a select pattern. 65 * Given a vector of nodes, sort each node according to 73 public void sort(DTMIterator v, Vector keys, XPathContext support) method in class:NodeSorter 119 * @param kIndex Index of NodeSortKey to use for sort 283 * sort for our purpose than the Quicksort because it 285 * the order isn't changed by the sort. 424 // must now sort the left partition. 431 // must now sort the right partition. 458 * node against the sort key(s). 477 /** Value from first sort ke [all...] |
/external/chromium_org/third_party/protobuf/python/google/protobuf/internal/ |
H A D | containers.py | 81 def sort(self, *args, **kwargs): member in class:BaseContainer 87 self._values.sort(*args, **kwargs)
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkRect.cpp | 29 void SkIRect::sort() { function in class:SkIRect 40 void SkRect::sort() { function in class:SkRect
|
/external/chromium_org/v8/tools/ |
H A D | profile_view.js | 118 * Sorts the profile view using the specified sort function. 122 * functions. Must comply with Array.sort sorting function requirements. 124 ProfileView.prototype.sort = function(sortFunc) { 196 * functions. Must comply with Array.sort sorting function requirements. 200 this.children.sort(sortFunc);
|
/external/junit/src/junit/framework/ |
H A D | JUnit4TestAdapter.java | 82 public void sort(Sorter sorter) { method in class:JUnit4TestAdapter
|