/external/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/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/slf4j/slf4j-api/src/test/java/org/slf4j/helpers/ |
H A D | BubbleSort.java | 35 static void sort(int[] a) { method in class:BubbleSort
|
/external/testng/src/test/java/test/ |
H A D | GraphTest.java | 20 public void sort() { method in class:GraphTest 103 // Invoke sort to make sure there is no side effect
|
/external/caliper/examples/src/main/java/examples/ |
H A D | ArraySortBenchmark.java | 43 @Benchmark void sort(int reps) { method in class:ArraySortBenchmark 46 Arrays.sort(copy);
|
/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/clang/unittests/Format/ |
H A D | SortIncludesTest.cpp | 1 //===- unittest/Format/SortIncludesTest.cpp - Include sort unit tests -----===// 23 std::string sort(llvm::StringRef Code, StringRef FileName = "input.cpp") { function in class:clang::format::__anon3069::SortIncludesTest 45 sort("#include \"a.h\"\n" 59 sort("#include <b>\n" 74 sort("#include \"a.h\"\n" 83 sort("#include \"a.h\"\n" 92 sort("#include \"a.h\" // comment\n" 101 sort(" #include \"a.h\"\n" 107 sort("# include \"a.h\"\n" 116 sort("#includ [all...] |
/external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/ |
H A D | TaggedRecord.java | 31 // Straight insertion sort from Knuth vol. III, pg. 81 33 public static void sort(TaggedRecord[] table, int count) method in class:TaggedRecord
|
/external/jacoco/org.jacoco.core/src/org/jacoco/core/analysis/ |
H A D | NodeComparator.java | 75 public <T extends ICoverageNode> List<T> sort(final Collection<T> summaries) { method in class:NodeComparator 77 Collections.sort(result, this);
|
/external/slf4j/slf4j-ext/src/test/java/org/slf4j/profiler/ |
H A D | SortAndPruneComposites.java | 50 int[] sortedArray = sort(); 58 private int[] sort() { method in class:SortAndPruneComposites 61 Arrays.sort(sortedArray);
|
/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/junit/src/junit/framework/ |
H A D | JUnit4TestAdapter.java | 82 public void sort(Sorter sorter) { method in class:JUnit4TestAdapter
|
/external/nanopb-c/generator/google/protobuf/internal/ |
H A D | containers.py | 81 def sort(self, *args, **kwargs): member in class:BaseContainer 87 self._values.sort(*args, **kwargs)
|