Searched refs:sorted (Results 1 - 11 of 11) sorted by relevance
/art/test/961-default-iface-resolution-generated/util-src/ |
H A D | generate_java.py | 79 all_tests = sorted(self.tests) 98 all_tests = sorted(self.tests) 240 self.ifaces = sorted(ifaces) 302 SUBTREES = [set(tuple(sorted(l)) for l in subtree_sizes(i)) 328 all_supers = sorted(set(dump_supers(supers)) - set(supers)) 341 all_supers = sorted(set(dump_supers(supers)) - set(supers))
|
/art/test/964-default-iface-init-generated/util-src/ |
H A D | generate_java.py | 82 all_tests = sorted(self.tests) 95 all_tests = sorted(self.tests) 227 return sorted(set(dump_tree(self.ifaces))) 372 selected = sorted(set(dump_tree(ns)) - set(ns))[i]
|
/art/test/968-default-partial-compile-generated/util-src/ |
H A D | generate_smali.py | 97 all_tests = sorted(self.tests) 116 all_tests = sorted(self.tests) 421 self.ifaces = sorted(ifaces) 547 SUBTREES = [set(tuple(sorted(l)) for l in subtree_sizes(i))
|
/art/test/005-annotations/src/android/test/anno/ |
H A D | TestAnnotations.java | 28 * Print the annotations in sorted order, so as to avoid 32 TreeMap<String, Annotation> sorted = 36 sorted.put(a.annotationType().getName(), a); 39 for (Annotation a : sorted.values()) {
|
/art/test/utils/python/ |
H A D | generate_java_main.py | 93 all_tests = sorted(self.tests) 98 for t in sorted(all_tests): 159 for f in sorted(self.funcs, key=lambda a: (a.func, a.farg)):
|
/art/test/970-iface-super-resolution-generated/util-src/ |
H A D | generate_smali.py | 102 all_tests = sorted(self.tests) 118 all_tests = sorted(self.tests) 553 SUBTREES = [set(tuple(sorted(l)) for l in subtree_sizes(i)) for i in range(MAX_IFACE_DEPTH + 1)]
|
/art/test/971-iface-super/util-src/ |
H A D | generate_smali.py | 97 all_tests = sorted(self.tests) 116 all_tests = sorted(self.tests) 483 self.ifaces = sorted(ifaces) 631 SUBTREES = [set(tuple(sorted(l)) for l in subtree_sizes(i))
|
/art/tools/checker/common/ |
H A D | logger.py | 78 for var in collections.OrderedDict(sorted(variables.items())):
|
/art/tools/dmtracedump/ |
H A D | tracedump.cc | 1215 * the sorted entries. 1227 TimedMethod* sorted = new TimedMethod[num_entries]; local 1229 memcpy(&sorted[ii], pTimed, sizeof(TimedMethod)); 1230 qsort(sorted, num_entries, sizeof(TimedMethod), compareTimedMethod); 1233 for (ii = 0; ii < num_entries - 1; ++ii) sorted[ii].next = &sorted[ii + 1]; 1234 sorted[num_entries - 1].next = nullptr; 1236 return sorted; 1257 TimedMethod* sorted = sortTimedMethodList(list, &num); local 1259 for (TimedMethod* pTimed = sorted; pTime [all...] |
/art/runtime/gc/ |
H A D | heap.cc | 508 // Compute heap capacity. Continuous spaces are sorted in order of Begin(). 510 // Relies on the spaces being sorted. 1078 // Ensure that spaces remain sorted in increasing order of start address. 1507 bool search_live_stack, bool sorted) { 1541 for (size_t i = 0; i < (sorted ? 1 : 5); ++i) { 1546 if (sorted) { 1556 if (sorted) { 3084 // Since we sorted the allocation stack content, need to revoke all 3213 // Since we sorted the allocation stack content, need to revoke all 1506 IsLiveObjectLocked(mirror::Object* obj, bool search_allocation_stack, bool search_live_stack, bool sorted) argument
|
H A D | heap.h | 287 bool sorted = false)
|
Completed in 1742 milliseconds