Fabiane Lima fabianelima
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # Create a promise: | |
| myCoolPromise = new Promise (resolve, reject) -> | |
| # do a thing | |
| success = true | |
| if success | |
| resolve 'stuff worked' | |
| else | |
| reject Error 'it broke' |
ddgromit
/ fisheryates.coffee
Created
March 8, 2011 01:56
CoffeeScript Implementation of the Fisher-Yates array sorting algorithm
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # Adapted from the javascript implementation at http://sedition.com/perl/javascript-fy.html | |
| # Randomizes the order of elements in the passed in array in place. | |
| fisherYates = (arr) -> | |
| i = arr.length; | |
| if i == 0 then return false | |
| while --i | |
| j = Math.floor(Math.random() * (i+1)) | |
| tempi = arr[i] |