Sean slawrence
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
| 0 info it worked if it ends with ok | |
| 1 verbose cli [ 'node', | |
| 1 verbose cli 'C:\\Users\\slawrence1\\AppData\\Roaming\\npm\\node_modules\\npm\\bin\\npm-cli.js', | |
| 1 verbose cli 'install', | |
| 1 verbose cli 'karma@canary' ] | |
| 2 info using [email protected] | |
| 3 info using [email protected] | |
| 4 verbose read json C:\dev\svn\pe2e.trunk\pe2e\pe2e-web\webapp\package.json | |
| 5 warn package.json [email protected] No README.md file found! | |
| 6 verbose read json C:\dev\svn\pe2e.trunk\pe2e\pe2e-web\webapp\node_modules\commander\package.json |
slawrence
/ schemanator.js
Created
February 7, 2013 22:09
A basic "schema" generator/comaparator. Requires underscore for deep compare.
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
| /*global _.isEqual, console, schemanator: true */ | |
| /*jslint browser: true */ | |
| (function () { | |
| 'use strict'; | |
| if (window.schemanator) { | |
| console.error("schemanator already defined"); | |
| return; | |
| } | |
| /** |
slawrence
/ shuffle.js
Created
December 13, 2012 15:48
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
| document.getElementById('results').innerHTML = (function (suits, ranks) { | |
| var cards = [], i, j; | |
| for (i = 0; i < suits.length; i += 1) { | |
| for (j = 0; j < ranks.length; j += 1) { | |
| cards.push(suits[i] + ranks[j]); | |
| } | |
| } | |
| return cards; | |
| }(['S', 'H', 'C', 'D'], [ '2', '3', '4', '5', '6', '7', '8', '9', '10', 'J', 'Q', 'K', 'A'])) | |
| .sort(function (a, b) { |
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
| /*jslint browser: true*/ | |
| /*global pn: true, Tree: true */ | |
| pn = window.pn || {}; | |
| (function () { | |
| if (pn.Tree) { | |
| console.error('Tree is already defined!'); | |
| return; | |
| } | |
| /** |
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
| var num = "174"; | |
| kaprekar(num); | |
| function kaprekar(num){ | |
| s1 = parseInt(num.split("").sort().join("")); | |
| s2 = parseInt(num.split("").sort(function(a,b){return b-a}).join("")); | |
| n = (s1 > s2) ? s1 -s2 : s2 - s1; | |
| if(n === parseInt(num)){ | |
| return n; |