madhums

var mongoose = require('mongoose');
mongoose.connect('mongodb://localhost/db_name');

// map function
var map = function(){
  emit(this.field_to_group_by, {
    other_fields: this.other_fields
    // list other fields like above to select them
  })
}

sixtenbe

#!/usr/bin/python2


# Copyright (C) 2016 Sixten Bergman
# License WTFPL
#
# This program is free software. It comes without any warranty, to the extent
# permitted by applicable law. 
# You can redistribute it and/or modify it under the terms of the Do What The
# Fuck You Want To Public License, Version 2, as published by Sam Hocevar. See

mfilej

<key>CFBundleIdentifier</key>
<string>com.apple.AppleScript.SafariURLHelper</string>
<key>CFBundleURLTypes</key>
<array>
  <dict>
    <key>CFBundleURLName</key>
    <string>SafariURLHelper</string>
    <key>CFBundleURLSchemes</key>
    <array>
      <string>http</string>

mbostock

license: gpl-3.0

cwholt

module.exports = function(redisClient,prefix) {
  var Autocomplete = {};
  
  Autocomplete.prefix = prefix;
  Autocomplete.terminal = "+";
  
  Autocomplete.add = function(word, next) {
    function add(letters, key, last, x) {
      var letter = last ? Autocomplete.terminal : letters[x];
      var score = last ? 0 : letter.charCodeAt(0);

Yavari

This is a fork of Bootstrap Typeahead that adds minimal but powerful extensions.

For example, process typeahead list asynchronously and return objects

  # This example does an AJAX lookup and is in CoffeeScript
  $('.typeahead').typeahead(
    # source can be a function
    source: (typeahead, query) ->
 # this function receives the typeahead object and the query string

troyk

// Don't care much about inheritance at this point, but I'll probably attempt it at 
// some point via cloning ancestor schema's

var mongoose            = require('mongoose'),
    Schema              = mongoose.Schema;
  
var Contact = new Schema({
  _type: String,
  name: String
});

henrik

tmux cheatsheet

As configured in my dotfiles.

start new:

tmux

start new with session name:

paullewis

/**
 * An implementation for Quicksort. Doesn't
 * perform as well as the native Array.sort
 * and also runs the risk of a stack overflow
 *
 * Tests with:
 *
 * var array = [];
 * for(var i = 0; i < 20; i++) {
 *   array.push(Math.round(Math.random() * 100));

ShirtlessKirk

/**
 * Luhn algorithm in JavaScript: validate credit card number supplied as string of numbers
 * @author ShirtlessKirk. Copyright (c) 2012.
 * @license WTFPL (http://www.wtfpl.net/txt/copying)
 */
var luhnChk = (function (arr) {
    return function (ccNum) {
        var 
            len = ccNum.length,
            bit = 1,