On Sat, Sep 24, 2011 at 10:08 PM, Roger Burton West <ro...@firedrake.org> wrote: > The queuefiller itself starts with a big playlist, shuffled; whenever it > puts a file onto the queue, it pops it off the top of the playlist and > reinserts it randomly between half-way down and the end of the list.
This sounds like a nice strategy. Is it what media players such as audacious or amarok use? It's clear that it prevents repetitions within a distance of n/2, I wonder if it's random enough, ie. does it allow all patterns without such repetitions, in a uniform way? If there is consensus on what is a good shuffle, and a simple way of achieving it, we might change "randomize" or create another mode for playlist(). We also need to think about smartly handling reloads. I'm not planning to investigate this, but I'd welcome some references, algorithms, and even patches! Cheers, David ------------------------------------------------------------------------------ All of the data generated in your IT infrastructure is seriously valuable. Why? It contains a definitive record of application performance, security threats, fraudulent activity, and more. Splunk takes this data and makes sense of it. IT sense. And common sense. http://p.sf.net/sfu/splunk-d2dcopy2 _______________________________________________ Savonet-users mailing list Savonet-users@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/savonet-users
