| /prebuilts/jdk/jdk8/darwin-x86/sample/forkjoin/mergesort/ |
| MergeSort.java | 48 * A {@code ForkJoinPool} is used for the parallelism, using the merge sort
54 * and possibly a swap. The tasks then finish by using insert sort to
58 * to implement the best possible parallel merge sort. This version creates
74 * @param array the array to sort
76 * @param high the non-inclusive high element to sort to
87 Arrays.sort(array, low, high);
131 * @param array the array to sort
133 public void sort(int[] array) { method in class:MergeSort
|
| /prebuilts/jdk/jdk8/linux-x86/sample/forkjoin/mergesort/ |
| MergeSort.java | 48 * A {@code ForkJoinPool} is used for the parallelism, using the merge sort
54 * and possibly a swap. The tasks then finish by using insert sort to
58 * to implement the best possible parallel merge sort. This version creates
74 * @param array the array to sort
76 * @param high the non-inclusive high element to sort to
87 Arrays.sort(array, low, high);
131 * @param array the array to sort
133 public void sort(int[] array) { method in class:MergeSort
|
| /art/test/044-proxy/src/ |
| NarrowingTest.java | 51 Arrays.sort(methods, new MethodComparator());
|
| /art/test/948-change-annotations/src/ |
| Main.java | 65 Arrays.sort(annos, Comparator.comparing((v) -> v.toString()));
|
| /art/tools/ahat/src/main/com/android/ahat/ |
| DominatedList.java | 22 import com.android.ahat.heapdump.Sort;
46 Collections.sort(insts, Sort.defaultInstanceCompare(snapshot));
|
| /art/tools/ahat/src/main/com/android/ahat/heapdump/ |
| Instances.java | 37 // Sort the instances by id so we can use binary search to lookup
39 instances.sort(new Comparator<AhatInstance>() {
|
| /cts/tests/tests/location/src/android/location/cts/asn1/base/ |
| Asn1SetOf.java | 36 Collections.sort(sequence,
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/distutils/ |
| filelist.py | 58 def sort(self):
member in class:FileList
59 # Not a strict lexical sort!
61 sortable_files.sort()
|
| /external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
| 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
|
| /external/clang/test/CXX/temp/temp.spec/temp.explicit/ |
| p2.cpp | 10 template<class T> void sort(Array<T>& v) { /* ... */ } function
11 template void sort(Array<char>&);
|
| 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/clang/unittests/Format/ |
| SortImportsTestJS.cpp | 1 //===- unittest/Format/SortImportsTestJS.cpp - JS import sort unit tests --===//
23 std::string sort(StringRef Code, unsigned Offset = 0, unsigned Length = 0) { function in class:clang::format::__anon17070::SortImportsTestJS
39 std::string Result = sort(Code, Offset, Length);
193 // Sort excluding a suffix.
203 // Sort excluding a prefix.
215 // Sort a range within imports.
230 // Sort excluding a suffix.
|
| SortIncludesTest.cpp | 1 //===- unittest/Format/SortIncludesTest.cpp - Include sort unit tests -----===//
27 std::string sort(StringRef Code, StringRef FileName = "input.cpp") { function in class:clang::format::__anon17071::SortIncludesTest
51 sort("#include \"a.h\"\n"
57 // Identical #includes have led to a failure with an unstable sort.
76 sort("#include <b>\n"
91 sort("#include \"a.h\"\n"
100 sort("#include \"a.h\"\n"
109 sort("#include \"a.h\" // comment\n"
118 sort(" #include \"a.h\"\n"
124 sort("# include \"a.h\"\n
[all...] |
| /external/icu/tools/srcgen/src/main/java/com/android/icu4j/srcgen/ |
| TagMatchingDeclarations.java | 54 Collections.sort(matchingNodes, new StartPositionComparator());
|
| /external/junit/src/main/java/org/junit/internal/ |
| MethodSorter.java | 11 * DEFAULT sort order
25 * Method name ascending lexicographic sort order, with {@link Method#toString()} as a tiebreaker
56 Arrays.sort(methods, comparator);
|
| /external/junit/src/main/java/org/junit/runner/manipulation/ |
| Sorter.java | 27 * to sort tests
41 sortable.sort(this);
|
| /external/proguard/src/proguard/classfile/editor/ |
| ClassMemberSorter.java | 41 // Sort the fields.
42 Arrays.sort(programClass.fields, 0, programClass.u2fieldsCount, this);
44 // Sort the methods.
45 Arrays.sort(programClass.methods, 0, programClass.u2methodsCount, this);
|
| /external/python/cpython2/Lib/distutils/ |
| filelist.py | 58 def sort(self): member in class:FileList
59 # Not a strict lexical sort!
61 sortable_files.sort()
|
| /external/python/cpython3/Lib/distutils/ |
| filelist.py | 57 def sort(self): member in class:FileList
58 # Not a strict lexical sort!
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| 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/testng/src/main/java/org/testng/reporters/jq/ |
| ResultsByClass.java | 31 Collections.sort(result, METHOD_NAME_COMPARATOR);
|
| /external/v8/tools/ |
| 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) { method in class:ProfileView
196 * functions. Must comply with Array.sort sorting function requirements.
200 this.children.sort(sortFunc);
|
| /external/vogar/src/vogar/target/junit/ |
| ErrorRunner.java | 68 public void sort(Sorter sorter) { method in class:ErrorRunner
|
| StatementRunner.java | 66 public void sort(Sorter sorter) { method in class:StatementRunner
|
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
| XMPSerializerHelper.java | 44 // sort the internal data model on demand
47 xmp.sort();
|
