Lines Matching defs:sort
859 * @param sort If true the results are sorted by the insertion order.
866 boolean sort) {
876 if (sort) {
881 mOrderSortBuffer, 0, sort);
882 if (sort) sort(ret, mPrioSortBuffer, mOrderSortBuffer);
934 * @param sort Flag to fill the priority and insertion order buffers. If false then
941 int i, T[] ret, int[] priority, int[] insertionOrder, int count, boolean sort) {
951 insertionOrder, count, sort);
970 if (sort) {
974 //insertion sort for elements with priority
988 insertionOrder, count, sort);
1010 * An iterative heap sort implementation. It will sort the spans using first their priority
1021 private final <T> void sort(T[] array, int[] priority, int[] insertionOrder) {
1042 * Helper function for heap sort.
1657 // This is a simple insertion sort because we expect it to be mostly sorted.
1718 private int[] mPrioSortBuffer; // buffer used to sort getSpans result
1719 private int[] mOrderSortBuffer; // buffer used to sort getSpans result