Searched refs:sorted (Results 1 – 25 of 27) sorted by relevance
12
137 q->sorted = False_; in Q_Init()315 q->sorted = False_; in Q_PushHead()366 q->sorted = False_; in Q_PushTail()412 q->sorted = False_; in Q_PopHead()454 q->sorted = False_; in Q_PopTail()562 q->sorted = False_; in Q_Iter_Del()785 if(q->sorted) { in Q_Sort()788 q->sorted = False_; in Q_Sort()831 q->sorted = True_; in Q_Sort()905 if(!q->sorted) { in Q_Seek()
39 int size, sorted, item_deleted; member
18 // And return the sorted array.
30 // Concatenate the sorted array and function result
16 * To test the new keys for the elements in the sorted array.37 // to test the new keys for the elements in the sorted array
29 // Different heredoc strings to be sorted
19 // array with diff sub arrays to be sorted
20 // Different heredoc strings to be sorted
12 * Pass arrays of different data types to natcasesort() to test how they are sorted
36 // Different heredoc strings to be sorted
15 …* Note: arrays are sorted based on total count of elements inside it, when all the elements are ar…
39 // to test the new keys for the elements in the sorted array
34 // to test the new keys for the elements in the sorted array
84 //dump the sorted array
33 // store file names into an array so can use sorted in expected output
65 // store file names into an array so can use sorted in expected output
122 sorted in decreasing order under the fixed version.
Completed in 39 milliseconds
