260 SortedLines::setSortingArray(Line **sortingArray, Line *elements, int32_t sizeToSort) {  in setSortingArray()  argument
263     sortingArray[i] = &elements[i];  in setSortingArray()
268 SortedLines::setSortingArray(Line **sortingArray, Hashtable *table) {  in setSortingArray()  argument
274     sortingArray[count++] = (Line *)hashElement->value.pointer;  in setSortingArray()
280 SortedLines::sort(Line **sortingArray, int32_t sizeToSort, UBool setStrengths, UBool link) {  in sort()  argument
285   qsort(sortingArray, sizeToSort, sizeof(Line *), probe.comparer);  in sort()
289       sortingArray[i]->strength = probe.getStrength(*sortingArray[i-1], *sortingArray[i]);  in sort()
296       if(sortingArray[i]->strength == UCOL_IDENTICAL) {  in sort()
298         equalStrength = sortingArray[equalStart]->strength;  in sort()
299         sortingArray[equalStart]->strength = UCOL_IDENTICAL;  in sort()
300         while(i < sizeToSort && sortingArray[i]->strength == UCOL_IDENTICAL) {  in sort()
303         qsort(sortingArray+equalStart, i-equalStart, sizeof(Line *), codePointCmp);  in sort()
304         sortingArray[equalStart]->strength = equalStrength;  in sort()
316       Line *curr = *(sortingArray+i);  in sort()
317       curr->next = *(sortingArray+i+1);  in sort()
318       (*(sortingArray+i+1))->previous = curr;  in sort()