I hereby claim:
- I am akilism on github.
- I am akilism (https://keybase.io/akilism) on keybase.
- I have a public key whose fingerprint is 0C83 8B6E F921 49F3 A2BB B2DD D06C 0BC7 690A 958B
To claim this, I am signing this object:
1 acorn: A Leiningen template for a ClojureScript setup with Figwheel, Austin, Om. | |
8 amp: Leiningen template for AMP (Alfresco Module Package) projects. | |
1 angular-cl2: A Leiningen template for using AngularJS and ChlorineJS | |
1 angular: Clojure and AngularJS in perfect harmony. | |
6 angular: Clojure and AngularJS in perfect harmony. $ lein new angular <name> | |
2 angularjs-app: Leiningen template for web application with http-kit and angularjs | |
5 angular-simple: Clojure and AngularJS $ lein new angular-simple <name> | |
1 aperiodic-cljs: My cljs development starting point. Basically ripped from lein-cljsbuild. | |
1 apijr: clojurescript project template | |
1 appfgo: 'lein new' template for Funcgo application |
normal | |
multiply | |
screen | |
overlay | |
darken | |
lighten | |
color-dodge | |
color-burn | |
hard-light | |
soft-light |
function updtm(m) | |
--if flr(m.pos.y) >= 127 then | |
-- m.pos.y = 127 | |
-- return l | |
--end | |
m.vel = addv(m.vel, m.acc) | |
m.ang = addv(m.ang, m.vel) | |
m.pos = addv(m.pos, m.vel) | |
m.acc = multv(m.acc, 0) |
--some helpers | |
function rndint(x) | |
return flr(rnd(x)) | |
end | |
function dir() | |
if randint(2) == 1 then | |
return 1 | |
else | |
return -1 |
--begin vector functions | |
function addv(v1, v2) | |
return {x=v1.x+v2.x, y=v1.y+v2.y} | |
end | |
function subv(v1,v2) | |
return {x=v1.x-v2.x, y=v1.y-v2.y} | |
end | |
function multv(v,n) |
var cnvs = (function() { | |
var canvas, | |
ctx, | |
isCanvasEnabled, | |
drawPending, | |
canvasHeight, | |
canvasWidth, | |
time = 0, | |
counter = 0, | |
c, |
class MinPQ { | |
constructor(comparator) { | |
this.comparator = comparator || MinPQ.compare; | |
this.items = []; | |
this.n = 0; | |
} | |
insert(value) { | |
this.items[++this.n] = value; | |
this.swim(this.n); |
var quickSort = (function(){ | |
var items; | |
var less = function(a, b) { return compare(items[a], items[b]) < 0; }; | |
var sort = function(items, lo, high) { | |
if(high <= lo) { return; } | |
mid = partition(items, high, lo); | |
sort(items, lo, mid-1); | |
sort(items, mid+1, high); |
I hereby claim:
To claim this, I am signing this object:
var saveObjects = function (objects) { | |
var MongoC = MongoClient; | |
var mongoConnect = Q.nbind(MongoC.connect, MongoC); | |
return mongoConnect(dbString).then(function (db) { | |
var DocumentCollection = db.collection('collection'); | |
var documentCollectionUpsert = Q.nbind(DocumentCollection.update, DocumentCollection); | |
//Use upsert option. | |
var options = { 'w' : 1, 'upsert' : true }; | |
var upsertPromises = objects.map(function (obj) { |