Home
last modified time | relevance | path

Searched refs:sorted (Results 1 – 12 of 12) sorted by relevance

/art/test/961-default-iface-resolution-generated/util-src/
Dgenerate_java.py79 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/
Dgenerate_java.py82 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/
Dgenerate_smali.py97 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/utils/python/
Dgenerate_java_main.py93 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/971-iface-super/util-src/
Dgenerate_smali.py97 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/test/005-annotations/src/android/test/anno/
DTestAnnotations.java32 TreeMap<String, Annotation> sorted = in printAnnotationArray() local
36 sorted.put(a.annotationType().getName(), a); in printAnnotationArray()
39 for (Annotation a : sorted.values()) { in printAnnotationArray()
/art/test/970-iface-super-resolution-generated/util-src/
Dgenerate_smali.py102 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/tools/checker/common/
Dlogger.py78 for var in collections.OrderedDict(sorted(variables.items())):
/art/tools/dmtracedump/
Dtracedump.cc1227 TimedMethod* sorted = new TimedMethod[num_entries]; in sortTimedMethodList() local
1229 memcpy(&sorted[ii], pTimed, sizeof(TimedMethod)); in sortTimedMethodList()
1230 qsort(sorted, num_entries, sizeof(TimedMethod), compareTimedMethod); in sortTimedMethodList()
1233 for (ii = 0; ii < num_entries - 1; ++ii) sorted[ii].next = &sorted[ii + 1]; in sortTimedMethodList()
1234 sorted[num_entries - 1].next = nullptr; in sortTimedMethodList()
1236 return sorted; in sortTimedMethodList()
1257 TimedMethod* sorted = sortTimedMethodList(list, &num); in printInclusiveMethod() local
1259 for (TimedMethod* pTimed = sorted; pTimed; pTimed = pTimed->next) { in printInclusiveMethod()
/art/tools/ahat/
DREADME.txt46 objects normally sorted by 'app' heap by default.
/art/runtime/gc/
Dheap.cc1507 bool search_live_stack, bool sorted) { in IsLiveObjectLocked() argument
1541 for (size_t i = 0; i < (sorted ? 1 : 5); ++i) { in IsLiveObjectLocked()
1546 if (sorted) { in IsLiveObjectLocked()
1556 if (sorted) { in IsLiveObjectLocked()
Dheap.h287 bool sorted = false)