This file contains 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
fetch( 'https://gist.githubusercontent.com/MAKIO135/0f0c45136069ee6e7366afef684f3373/raw/89e9b1600f2ff9331ddc9f12a9f58500d9ad09ae/pi.json' ) | |
.then( resp => resp.json() ) | |
.then( json => { | |
let pi = json.pi | |
let i = 0; | |
setInterval( function run(){ | |
console.clear() | |
console.log( + pi.charAt( i ) ) | |
i++; |
This file contains 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
<!DOCTYPE html> | |
<html> | |
<head> | |
<meta charset="utf-8" /> | |
<meta http-equiv="X-UA-Compatible" content="IE=edge"> | |
<title>Hello WebMIDI</title> | |
<meta name="viewport" content="width=device-width, initial-scale=1"> | |
</head> | |
<body> | |
<script> |
This file contains 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
// gif.worker.js 0.2.0 - https://github.com/jnordberg/gif.js | |
(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(require,module,exports){var NeuQuant=require("./TypedNeuQuant.js");var LZWEncoder=require("./LZWEncoder.js");function ByteArray(){this.page=-1;this.pages=[];this.newPage()}ByteArray.pageSize=4096;ByteArray.charMap={};for(var i=0;i<256;i++)ByteArray.charMap[i]=String.fromCharCode(i);ByteArray.prototype.newPage=function(){this.pages[++this.page]=new Uint8Array(ByteArray.pageSize);this.cursor=0};ByteArray.prototype.getData=function(){var rv="";for(var p=0;p<this.pages.length;p++){for(var i=0;i<ByteArray.p |
This file contains 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
// https://stackoverflow.com/questions/10865025/merge-flatten-an-array-of-arrays-in-javascript/39000004#39000004 | |
const flatten = function(arr, result = []) { | |
for (let i = 0, length = arr.length; i < length; i++) { | |
const value = arr[i]; | |
if (Array.isArray(value)) { | |
flatten(value, result); | |
} else { | |
result.push(value); | |
} |
This file contains 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
// Based on Fisher–Yates shuffle ( https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle ) | |
// and Shuffling an Array in JavaScript ( https://www.kirupa.com/html5/shuffling_array_js.htm ) | |
// returns a new array shuffled | |
Array.prototype.shuffle = function() { | |
let tmpArray = [ ... this ]; // create a copy of original array | |
for( let i = tmpArray.length - 1; i; i -- ) { | |
let randomIndex = ~~( Math.random() * ( i + 1 ) ); | |
[ tmpArray[ i ], tmpArray[ randomIndex ] ] = [ tmpArray[ randomIndex ], tmpArray[ i ] ]; // swap | |
} |
This file contains 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
function sortArrayByKey( arr, key ){ | |
let keyPath = key.split( '.' ); | |
return arr.map( ( e, i ) => { | |
let value = e[ keyPath[ 0 ] ]; | |
for( let index = 1; index < keyPath.length; index ++ ){ | |
value = value[ keyPath[ index ] ]; | |
} | |
return { | |
index: i, | |
value: value |
This file contains 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 googleFontsBaseUrl="//fonts.gstatic.com/s/",googleFonts=[{name:"ABeeZee",styles:["regular","italic"],files:[{style:"regular",url:"abeezee/v10/mE5BOuZKGln_Ex0uYKpIaw.ttf"},{style:"italic",url:"abeezee/v10/kpplLynmYgP0YtlJA3atRw.ttf"}]},{name:"Abel",styles:["regular"],files:[{style:"regular",url:"abel/v7/RpUKfqNxoyNe_ka23bzQ2A.ttf"}]},{name:"AbhayaLibre",styles:["regular","500","600","700","800"],files:[{style:"500",url:"abhayalibre/v2/wBjdF6T34NCo7wQYXgzrc5MQuUSAwdHsY8ov_6tk1oA.ttf"},{style:"600",url:"abhayalibre/v2/wBjdF6T34NCo7wQYXgzrc2v8CylhIUtwUiYO7Z2wXbE.ttf"},{style:"700",url:"abhayalibre/v2/wBjdF6T34NCo7wQYXgzrc0D2ttfZwueP-QU272T9-k4.ttf"},{style:"800",url:"abhayalibre/v2/wBjdF6T34NCo7wQYXgzrc_qsay_1ZmRGmC8pVRdIfAg.ttf"},{style:"regular",url:"abhayalibre/v2/zTLc5Jxv6yvb1nHyqBasVy3USBnSvpkopQaUR-2r7iU.ttf"}]},{name:"AbrilFatface",styles:["regular"],files:[{style:"regular",url:"abrilfatface/v8/X1g_KwGeBV3ajZIXQ9VnDojjx0o0jr6fNXxPgYh_a8Q.ttf"}]},{name:"Aclonica",styles:["regular"],files:[{style:"regula |
This file contains 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
const test = ( f, _n ) => { | |
console.log( ( new Array( _n || 1000 ) ).fill( 0 ).map( n => { | |
let t0 = performance.now() | |
f() | |
let t1 = performance.now() | |
return t1 - t0 | |
} ).reduce( ( sum, d ) => sum+=d ) + ' ms' ) | |
} | |
This file contains 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
h1 Percussion | |
section.switches.loading | |
.start.hidden | |
button type="button" Start | |
- keys = [ "a", "s", "d", "f", "j", "k", "l", ";" ] | |
- %w( highHat crash bell rim snare tom1 tom2 kick ).each_with_index do |instrument, i| | |
.instrument data-instrument=instrument | |
- 16.times do |tick| | |
button.tick type="checkbox" data-tick=tick = keys[i] | |
p Built by <a href="http://twitter.com/LandonSchropp" target="_blank">Landon Schropp</a> as part of the <a href="http://codepen.io/collection/fDxJj/" target="_blank">Randoms Collection</a> |
This file contains 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
######################################### | |
## Sonic Pi Drum Machine | |
## coded by Darin Wilson | |
## | |
use_bpm 95 | |
in_thread(name: :drum_machine) do | |
# choose your kit here (can be :acoustic, :acoustic_soft, :electro, :toy) |