| /art/tools/ahat/src/main/com/android/ahat/ |
| ObjectsHandler.java | 22 import com.android.ahat.heapdump.Sort;
46 Collections.sort(insts, Sort.defaultInstanceCompare(mSnapshot));
|
| /art/tools/ahat/src/main/com/android/ahat/heapdump/ |
| DiffFields.java | 42 Collections.sort(currentSorted, FOR_DIFF);
48 Collections.sort(baselineSorted, FOR_DIFF);
88 * Fields with the same name and type are considered comparable, so we sort
92 = Sort.withPriority(Sort.FIELD_VALUE_BY_NAME, Sort.FIELD_VALUE_BY_TYPE);
|
| /cts/tools/cts-api-coverage/src/com/android/cts/apicoverage/ |
| TextReport.java | 36 Collections.sort(packages, comparator);
52 Collections.sort(classes, comparator);
59 Collections.sort(constructors);
65 Collections.sort(methods);
|
| /dalvik/dexgen/src/com/android/dexgen/util/ |
| ListIntSet.java | 34 ints.sort();
86 ints.sort();
93 ints.sort();
|
| /dalvik/dx/src/com/android/dx/util/ |
| ListIntSet.java | 34 ints.sort();
90 ints.sort();
97 ints.sort();
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/ |
| heapq.py | 29 without surprises: heap[0] is the smallest item, and heap.sort()
74 By iterating over all items, you get an O(n ln n) sort.
76 A nice feature of this sort is that you can efficiently insert new
77 items while the sort is going on, provided that the inserted items are
93 know that a big sort implies producing "runs" (which are pre-sorted
97 sort produces the longest runs possible. Tournaments are a good way
218 result.sort(reverse=True)
236 result.sort()
290 # The total compares needed by list.sort() on the same lists were 8627,
292 # heappop() compares): list.sort() is (unsurprisingly!) more efficient
479 sort = [] variable
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| 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-commons-math/src/main/java/org/apache/commons/math/optimization/ |
| MultiStartMultivariateRealOptimizer.java | 190 // sort the optima from best to worst, followed by null elements
191 Arrays.sort(optima, new Comparator<RealPointValuePair>() {
|
| /external/autotest/frontend/client/src/autotest/common/table/ |
| ArrayDataSource.java | 29 Collections.sort(sortedData, new JSONObjectComparator(sortOn));
|
| /external/emma/core/java12/com/vladium/emma/report/ |
| Item.java | 55 Arrays.sort (items, order);
|
| /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/ |
| FeatureList.java | 42 TaggedRecord.sort(features, featureCount);
|
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/utils/ |
| PositionUtils.java | 55 nodes.sort((o1, o2) -> PositionUtils.compare(o1, o2, ignoringAnnotations));
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/utils/ |
| PositionUtils.java | 50 Collections.sort(nodes, (o1, o2) -> PositionUtils.compare(o1, o2, ignoringAnnotations));
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/proper_source/com/github/javaparser/ |
| PositionUtils.java | 50 Collections.sort(nodes, new Comparator<Node>() {
|
| /external/junit/src/main/java/junit/framework/ |
| JUnit4TestAdapter.java | 83 public void sort(Sorter sorter) { method in class:JUnit4TestAdapter
|
| /external/nanopb-c/generator/google/protobuf/internal/ |
| containers.py | 81 def sort(self, *args, **kwargs): member in class:BaseContainer
87 self._values.sort(*args, **kwargs)
|
| /external/okhttp/samples/simple-client/src/main/java/com/squareup/okhttp/sample/ |
| OkHttpContributors.java | 43 // Sort list by the most contributions.
44 Collections.sort(contributors, new Comparator<Contributor>() {
|
| /external/proguard/src/proguard/classfile/editor/ |
| ConstantPoolSorter.java | 54 // Sort the constant pool and set up an index map.
74 // Sort the array.
75 Arrays.sort(comparableConstantPool, 0, sortLength);
|
| InterfaceSorter.java | 51 // Sort the interfaces.
52 Arrays.sort(interfaces, 0, interfacesCount);
124 // Sort the interface types in the array.
125 Arrays.sort(internalTypes, count - interfacesCount, count);
|
| VariableCleaner.java | 199 // Sort the local variable entries.
200 Arrays.sort(localVariableInfos, 0, localVariableInfoCount);
233 // Sort the local variable entries.
234 Arrays.sort(localVariableTypeInfos, 0, localVariableTypeInfoCount);
|
| /external/python/cpython2/Lib/ |
| heapq.py | 29 without surprises: heap[0] is the smallest item, and heap.sort()
74 By iterating over all items, you get an O(n ln n) sort.
76 A nice feature of this sort is that you can efficiently insert new
77 items while the sort is going on, provided that the inserted items are
93 know that a big sort implies producing "runs" (which are pre-sorted
97 sort produces the longest runs possible. Tournaments are a good way
218 result.sort(reverse=True)
236 result.sort()
290 # The total compares needed by list.sort() on the same lists were 8627,
292 # heappop() compares): list.sort() is (unsurprisingly!) more efficien
479 sort = [] variable
[all...] |
| /external/sl4a/ScriptingLayer/src/com/googlecode/android_scripting/ |
| ScriptStorageAdapter.java | 71 Collections.sort(scripts, new Comparator<File>() {
131 Collections.sort(scripts);
|
| /external/testng/src/main/java/org/testng/reporters/jq/ |
| ChronologicalPanel.java | 34 Collections.sort(invokedMethods, new Comparator<IInvokedMethod>() {
|
| TimesPanel.java | 47 Collections.sort(allTestResults, new Comparator<ITestResult>() {
|
| /external/testng/src/test/java/test/ |
| GraphTest.java | 20 public void sort() { method in class:GraphTest
103 // Invoke sort to make sure there is no side effect
|
