| /external/jmonkeyengine/engine/src/core/com/jme3/util/ |
| SortUtil.java | 38 * Quick and merge sort implementations that create no garbage, unlike {@link
39 * Arrays#sort}. The merge sort is stable, the quick sort is not.
44 * The size at or below which we will use insertion sort because it's
149 Arrays.sort(sorted, ic);
182 * @param lo0 the index of the lowest element to include in the sort.
183 * @param hi0 the index of the highest element to include in the sort.
192 // if this is a two element list, do a simple sort on it
231 // must now sort the left partitio
[all...] |
| /external/junit/src/org/junit/runner/manipulation/ |
| Sortable.java | 15 public void sort(Sorter sorter); method in interface:Sortable
|
| Sorter.java | 25 * to sort tests
39 sortable.sort(this);
|
| /external/linux-tools-perf/util/ |
| generate-cmdlist.sh | 15 sort |
|
| /external/llvm/test/CodeGen/MBlaze/ |
| select.ll | 2 ; some sort of branch instruction.
|
| /external/llvm/test/Linker/ |
| module-flags-3-a.ll | 1 ; RUN: llvm-link %s %p/module-flags-3-b.ll -S -o - | sort | FileCheck %s
|
| /external/llvm/test/Transforms/MergeFunc/ |
| fold-weak.ll | 6 ; This test is off for a bit as we change this particular sort of folding to
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| duplicate-phis.ll | 3 ; instcombine should sort the PHI operands so that simplifycfg can see the
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Array/ |
| 15.4.4.5-2.js | 24 ECMA Section: Array.prototype.sort(comparefn)
28 In this cases, the sort creates a reverse sort.
30 The elements of this array are sorted. The sort is not necessarily stable.
78 4.If the argument comparefn was not provided in the call to sort, go to step 7.
88 property values always sort to the end of the result. It is implementation-dependent whether or not such
89 properties will exist or not at the end of the array when the sort is concluded.
91 Note that the sort function is intentionally generic; it does not require that its this value be an Array object.
92 Therefore it can be transferred to other kinds of objects for use as a method. Whether the sort function can be
103 var TITLE = "Array.prototype.sort(comparefn)"
[all...] |
| /external/webkit/Source/JavaScriptCore/tests/mozilla/js1_2/Array/ |
| general2.js | 33 var TITLE = 'String:push,splice,concat,unshift,sort';
73 array1.sort();
74 array2.sort();
75 testcases[count++] = new TestCase( SECTION, "Array.sort", true,String(array1) == String(array2));
|
| /packages/apps/Email/src/org/apache/commons/io/comparator/ |
| DefaultFileComparator.java | 26 * This comparator can be used to sort lists or arrays of files
33 * Collections.sort(list, DefaultFileComparator.DEFAULT_COMPARATOR);
36 * Example of doing a <i>reverse</i> sort of an array of files using the
40 * Arrays.sort(array, DefaultFileComparator.DEFAULT_REVERSE);
|
| LastModifiedFileComparator.java | 27 * This comparator can be used to sort lists or arrays of files
34 * Collections.sort(list, LastModifiedFileComparator.LASTMODIFIED_COMPARATOR);
37 * Example of doing a <i>reverse</i> sort of an array of files using the
41 * Arrays.sort(array, LastModifiedFileComparator.LASTMODIFIED_REVERSE);
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| ElemSort.java | 30 * Implement xsl:sort.
32 * <!ELEMENT xsl:sort EMPTY>
33 * <!ATTLIST xsl:sort
40 * <!-- xsl:sort cannot occur after any other elements or
51 * xsl:sort has a select attribute whose value is an expression.
58 * xsl:sort has a select attribute whose value is an expression.
64 * sort key for that node. The default value of the select attribute
66 * be used as the sort key.
81 * xsl:sort has a select attribute whose value is an expression.
87 * sort key for that node. The default value of the select attribut
[all...] |
| /libcore/luni/src/test/java/tests/api/java/util/ |
| ArraysTest.java | 1735 private void sort(Object array) { method in class:ArraysTest
[all...] |
| /external/chromium/base/i18n/ |
| file_util_icu.h | 31 // used to sort directory listings. It behaves like "operator<" for use in
32 // std::sort.
|
| /external/clang/test/CXX/temp/temp.spec/temp.explicit/ |
| p2.cpp | 8 template<class T> void sort(Array<T>& v) { /* ... */ } function
9 template void sort(Array<char>&);
|
| /external/icu4c/test/intltest/ |
| escoll.h | 9 * specific primary and tertiary rules. This Spanish sort uses the traditional
10 * sorting sequence. The Spanish modern sorting sequence does not sort
|
| thcoll.h | 40 * Odd corner conditions taken from "How to Sort Thai Without Rewriting Sort",
|
| /external/linux-tools-perf/Documentation/ |
| perf-kmem.txt | 35 --sort=<key[,key2...]>::
36 Sort the output (default: frag,hit,bytes)
|
| /external/llvm/utils/ |
| findsym.pl | 20 @objects = grep(/l?i?b?LLVM.*\.[oa]$/,sort(@files));
26 "nm $Directory/$lib | grep '$Symbol' | sort --key=3 | uniq |";
|
| /external/stlport/test/unit/ |
| func_test.cpp | 59 sort(v.begin(), v.end(), bigger_than);
71 sort(v.begin(), v.end(), greater<int>());
|
| /external/webkit/LayoutTests/storage/domstorage/localstorage/ |
| enumerate-storage.html | 34 // Sort the array, since the storage order isn't guaranteed
35 enumeratedArray.sort();
|
| enumerate-with-length-and-key.html | 34 // Sort the array, since the storage order isn't guaranteed
35 enumeratedArray.sort();
|
| /external/webkit/LayoutTests/storage/domstorage/sessionstorage/ |
| enumerate-storage.html | 34 // Sort the array, since the storage order isn't guaranteed
35 enumeratedArray.sort();
|
| enumerate-with-length-and-key.html | 34 // Sort the array, since the storage order isn't guaranteed
35 enumeratedArray.sort();
|
