Implement Array Shuffling in MooTools
While shuffling the order of array elements isn't a greatly useful function, I recently found myself needing to accomplish the task. I found a great post about how to achieve this feat using jQuery. Here's how to implement array shuffling in MooTools.
The MooTools JavaScript
Array.implement({
shuffle: function() {
//destination array
for(var j, x, i = this.length; i; j = parseInt(Math.random() * i), x = this[--i], this[i] = this[j], this[j] = x);
return this;
}
});
This likely wont be used in the core framework but does have its uses.
![I’m an Impostor]()
This is the hardest thing I've ever had to write, much less admit to myself. I've written resignation letters from jobs I've loved, I've ended relationships, I've failed at a host of tasks, and let myself down in my life. All of those feelings were very...
![JavaScript Promise API]()
While synchronous code is easier to follow and debug, async is generally better for performance and flexibility. Why "hold up the show" when you can trigger numerous requests at once and then handle them when each is ready? Promises are becoming a big part of the JavaScript world...
![Save Web Form Content Using Control + S]()
We've all used word processing applications like Microsoft Word and if there's one thing they've taught you it's that you need to save every few seconds in anticipation of the inevitable crash. WordPress has mimicked this functionality within their WYSIWYG editor and I use it...
![Duplicate DeSandro’s CSS Effect]()
I recently stumbled upon David DeSandro's website when I saw a tweet stating that someone had stolen/hotlinked his website design and code, and he decided to do the only logical thing to retaliate: use some simple JavaScript goodness to inject unicorns into their page.
Another way (more elegant in my opinion):
Array.implement({ shuffle:function() { this.sort(function (x,y) { return Math.floor(Math.random()*3)-1; }); return this; } }); alert([1,2,3,4,5,6,7,8].shuffle());@Elad: Awesome! Nice work. Definitely more elegant.
Just a note that you can do cool stuff like this with Array Shuffling. :)
@Lim Chee Aun: Awesome!
I’ll point out that @David’s example is guaranteed to not require any additional storage space (it shuffles in place), is unbiased toward permutations, and runs in O(n) time. @Elad’s shuffle depends on the browser’s implementation of sort(). It may require more storage space, it may be biased to certain permutations, and it will run in O(n log n) time or worse due to the nature of sorting. However, I’m guessing that anything shuffled in JS is going to be small and no one will care if it is biased as long as it “seems” random.
I’ve tested both Elad and David script on a 27 lenght array… the shuffling is far better using David’s one….
Anyone for the best of both world : efficiency and elegance ?
Anyway thank you so much for the tip !
I’m trying to learn mootools (both in a general sense, and all over again with 1.2), and javascript OOP at the same time. How I use this to shuffle the order of some list elements on a webpage?
And, if you don’t mind, how would I do this in 1.1 vs. 1.2?
Hehe although the original idea is older than my mom (probably no one here knows the creator of this…), I would be glad if people could copy my things keeping the credits ^^
http://jsfromhell.com/array/shuffle