Re: Feature-Request: random sort

[Matthias Schniedermeyer]

Brian Dessent wrote:
> Matthias Schniedermeyer wrote:
> 
>> As far as i can see it the opposite of sort is missing.
>> Randomize/shuffling the incoming data lines, so you can e.x. use it for
>> a playlist.
>>
>> find . -type f | sort --shuffle | xargs <...>
> 
> You must not be using the current version.  This was added in 6.1:
> 
> `-R'
> `--random-sort'
>      Sort by hashing the input keys and then sorting the hash values.
>      Choose the hash function at random, ensuring that it is free of
>      collisions so that differing keys have differing hash values.
>      This is like a random permutation of the inputs (*note shuf
>      invocation::), except that keys with the same value sort together.
> 
>      If multiple random sort fields are specified, the same random hash
>      function is used for all fields.  To use different random hash
>      functions for different fields, you can invoke `sort' more than
>      once.
> 
>      The choice of hash function is affected by the `--random-source'
>      option.

Seems like Debian-SID, which should be 'bleeding edge', isn't so
bleeding edge after all. :-|
Coreutils is reported with version 5.97




-- 
Real Programmers consider "what you see is what you get" to be just as
bad a concept in Text Editors as it is in women. No, the Real Programmer
wants a "you asked for it, you got it" text editor -- complicated,
cryptic, powerful, unforgiving, dangerous.