Searched refs:sorted (Results 1 – 3 of 3) sorted by relevance
35 private boolean sorted; field in IntList94 sorted = true; in IntList()122 if (sorted != otherList.sorted) { in equals()199 sorted = false; in set()221 if (sorted && (size > 1)) { in add()222 sorted = (value >= values[size - 2]); in add()246 sorted = sorted in insert()360 if (!sorted) { in sort()362 sorted = true; in sort()395 if (!sorted) { in binarysearch()
35 private boolean sorted; field in IntList94 sorted = true; in IntList()122 if (sorted != otherList.sorted) { in equals()199 sorted = false; in set()221 if (sorted && (size > 1)) { in add()222 sorted = (value >= values[size - 2]); in add()246 sorted = sorted in insert()360 if (!sorted) { in sort()362 sorted = true; in sort()394 if (!sorted) { in binarysearch()
1372 TimedMethod *pTimed, *sorted; in sortTimedMethodList() local1383 sorted = (TimedMethod *) malloc(sizeof(TimedMethod) * num_entries); in sortTimedMethodList()1385 memcpy(&sorted[ii], pTimed, sizeof(TimedMethod)); in sortTimedMethodList()1386 qsort(sorted, num_entries, sizeof(TimedMethod), compareTimedMethod); in sortTimedMethodList()1390 sorted[ii].next = &sorted[ii + 1]; in sortTimedMethodList()1391 sorted[num_entries - 1].next = NULL; in sortTimedMethodList()1393 return sorted; in sortTimedMethodList()1420 TimedMethod *sorted = sortTimedMethodList(list, &num); in printInclusiveMethod() local1422 for (pTimed = sorted; pTimed; pTimed = pTimed->next) { in printInclusiveMethod()