List Operations
One item per line.
- 6
- Lines in
- 4
- Lines out
- 1
- Duplicates removed
apple banana cherry date
List operations applies several transformations to a list of lines at once: remove empty lines, remove duplicates, sort in either direction, reverse, shuffle, and number the results. The ordering operations are mutually exclusive, so selecting shuffle turns off sort rather than silently applying whichever ran last.
How it works
Operations apply in a fixed sequence: filtering first, then deduplication, then ordering, then numbering. That ordering is what makes the result predictable. Numbering before sorting would produce a list numbered out of sequence.
- Sorting uses locale-aware comparison with numeric ordering, so item 2 comes before item 10.
- Deduplication is exact and case-sensitive: "Apple" and "apple" are two different lines.
- Shuffling uses Fisher-Yates with the browser cryptographic random source, so every ordering is equally likely.
- Numbering is applied last, so the numbers always run 1, 2, 3 down the final list.
Examples
Clean and sort
List
banana apple cherry apple date
Operations
Remove empty, dedupe, sort A-Z
Result
apple banana cherry date
Six lines in, four out: one blank line removed and one duplicate. The counts confirm both.
Numeric sorting
List
item 10 item 2 item 1
Operations
Sort A-Z
Result
item 1 item 2 item 10
Numeric collation reads the digits as numbers. A plain string sort would place item 10 second.
Frequently asked questions
Why does selecting shuffle turn off sort?
Because they contradict each other and only one can win. Rather than silently applying whichever runs last, the tool treats sort, reverse and shuffle as one exclusive choice so the result always matches what is selected.
Is the deduplication case-sensitive?
Yes. "Apple" and "apple" are treated as different lines, because in most real lists (identifiers, filenames, codes) case carries meaning. Convert the case first if you want them merged.
Is the shuffle genuinely random?
Yes, Fisher-Yates using the browser cryptographic random source. The common alternative of sorting by a random comparator is measurably biased and produces some orderings far more often than others.
How does this differ from the ABC order generator?
The ABC order generator focuses on alphabetising, with case sensitivity and duplicate options tuned for that job. This one applies several operations in sequence, including shuffling and numbering, which is what you want when tidying a list rather than sorting one.