Searched refs:Sorting (Results 1 – 25 of 41) sorted by relevance
12
17 import {Area, Sorting} from '../../common/state';61 getDefaultSorting(): Sorting {
17 import {Area, Sorting} from '../../common/state';74 getDefaultSorting(): Sorting {
17 import {Area, Sorting} from '../../common/state';62 getDefaultSorting(): Sorting {
17 import {Area, Sorting} from '../../common/state';141 getDefaultSorting(): Sorting {
23 import {Area, Sorting} from '../../common/state';35 private previousSorting?: Sorting;46 abstract getDefaultSorting(): Sorting;
18 import {Area, Sorting} from '../../common/state';163 getDefaultSorting(): Sorting {
6 colCaseLevel{"Case-Sensitive Sorting"}7 colNormalization{"Normalised Sorting"}
7 colNormalization{"Normalized Sorting"}
8 colAlternate{"Ignore Symbols Sorting"}9 colBackwards{"Reversed Accent Sorting"}11 colCaseLevel{"Case Sensitive Sorting"}12 colNormalization{"Normalized Sorting"}13 colNumeric{"Numeric Sorting"}15 colStrength{"Sorting Strength"}
8 colAlternate{"Ignore Symbols Sorting"}9 colBackwards{"Reversed Accent Sorting"}11 colCaseLevel{"Case Sensitive Sorting"}12 colNormalization{"Normalized Sorting"}13 colNumeric{"Numeric Sorting"}15 colStrength{"Sorting Strength"}
253 export interface Sorting { interface260 sorting?: Sorting;
6 size. Sorting the whole array is more efficient for sufficiently large
27 2) Sorting Test
91 TEST(CircularQueueTest, Sorting) { in TEST() argument
3 Sorting HOW TO17 Sorting Basics
33 default the output is sorted by the total read size in Kbytes (R_Kb). Sorting
743 (For a more detailed discussion of sorting, see the Sorting mini-HOWTO in the744 Python wiki at https://wiki.python.org/moin/HowTo/Sorting.)
24 f. Sweeping and Sorting the Spans565 f. Sweeping and Sorting the Spans605 Sorting doesn't necessarily take much time, as in 99 cases out
1221 #Subtopic Sorting1227 #In Sorting1250 #In Sorting
1703 #Subtopic Sorting1710 #In Sorting1733 #In Sorting1753 #Subtopic Sorting ##
108 Efficient Algorithm for Sorting with131 B. Jones A Variation on Sorting by Address323 E. S. Mankin Sorting in a Paging Environment . . . . 483--494407 Efficient Algorithm for Sorting with606 J. M. Chambers ACM Algorithm 410: Partial Sorting [M1] 357--358640 D. E. Ferguson Buffer Allocation in Merge-Sorting . . . 476--478973 I. Pohl A Sorting Problem and Its Complexity . . 462--4641144 C. K. Wong Sorting by Natural Selection . . . . . . 910--9131731 Shimon Even Parallelism in Tape-Sorting . . . . . . 202--2042180 E. Straus Sorting $X + Y$ . . . . . . . . . . . . 347--350 (or 347--349??)[all …]
246 ## Sorting section in Background
69 Filtering and Sorting Options
494 "Optimistic Sorting and Information Theoretic Complexity"