Skip to content

Instantly share code, notes, and snippets.

View JCMais's full-sized avatar
🚀
Being Happy

Jonathan Cardoso JCMais

🚀
Being Happy
View GitHub Profile

Keybase proof

I hereby claim:

  • I am JCMais on github.
  • I am jonathancardoso (https://keybase.io/jonathancardoso) on keybase.
  • I have a public key whose fingerprint is BA38 640E FD59 598A 5ACB F22D A1D2 A6FA 4FD5 02D8

To claim this, I am signing this object:

#include <SPI.h>
#include <Adafruit_WS2801.h>
#include <FastLED.h>
#define ADAFRUIT 1
#define NUM_LEDS 17
#define DATA_PIN 11
#define CLOCK_PIN 13
@JCMais
JCMais / iteratedLog.js
Created August 29, 2012 14:09
Javascript implementation of the Itearated Logarithm, just for fun
/**
* Javascript implementation of the Itearated Logarithm {@link http://en.wikipedia.org/wiki/Iterated_logarithm}
* @author Jonathan Cardoso
*
* @param {Number} n The number to get the iterated logarithm.
* @return {Number}
*/
var iteratedLog = function( n ) {
var result = 0;
@JCMais
JCMais / LICENSE.txt
Created July 7, 2012 22:36 — forked from LeverOne/LICENSE.txt
generate random v4 UUIDs (107 bytes)
DO WTF YOU WANT TO PUBLIC LICENSE
Version 2, December 2004
Copyright (C) 2011 Alexey Silin <pinkoblomingo@gmail.com>
Everyone is permitted to copy and distribute verbatim or modified
copies of this license document, and changing it is allowed as long
as the name is changed.
DO WTF YOU WANT TO PUBLIC LICENSE
@JCMais
JCMais / README
Created February 22, 2012 18:37 — forked from joelambert/README
Drop in replacements for setTimeout()/setInterval() that makes use of requestAnimationFrame() where possible for better performance
Drop in replace functions for setTimeout() & setInterval() that
make use of requestAnimationFrame() for performance where available
http://www.joelambert.co.uk
Copyright 2011, Joe Lambert.
Free to use under the MIT license.
http://www.opensource.org/licenses/mit-license.php
Array.prototype.duplicates = function ( ) {
return this.filter ( function ( x , y , k ) {
return y !== k.lastIndexOf ( x );
});
};
Array.prototype.hasDuplicates = function ( ) {
var me = this;
return me.some ( function ( idx ) {
return me.indexOf( idx ) !== me.lastIndexOf ( idx );