vincentbernat

user root;
worker_processes 2;
worker_rlimit_nofile 90000;
error_log /usr/local/nginx/logs/error.log;
pid /var/run/nginx.pid;

events {
  use epoll;
  multi_accept off;
  accept_mutex off;

dresende

// MySQL test: (create on database 'abook' with username 'abook' and password 'abook')
// 
// CREATE TABLE IF NOT EXISTS `users` (
//   `id` int(5) unsigned NOT NULL AUTO_INCREMENT,
//   `username` varchar(50) NOT NULL,
//   `password` varchar(50) NOT NULL,
//   PRIMARY KEY (`id`),
//   KEY `username` (`username`)
// ) ENGINE=InnoDB  DEFAULT CHARSET=utf8;
// INSERT INTO `users` (`username`, `password`) VALUES

max-mapper

Your API does REST, but can it SLEEP?

SLEEP (Syncable Lightweight Event Emitting Persistence) is an emerging standard for distributed data sync using HTTP and JSON. A generalized version of CouchDB's much lauded built-in replication, SLEEP extends the REST architecture to define a way in which databases can offer syncable JSON APIs that foster open data innovation by allowing developers to replicate entire databases over the net.

---

SLEEP comes from the Apache CouchDB project which is now widely known for it's multi-master streaming HTTP + JSON replication. This is possible in part because of the CouchDB _changes feed, which is a particular API that lets you see if there have been any changes made to the database since last time you synchronized. CouchDB can efficiently implement the _changes feed because of one subtle difference between it and most other databases: it stores a history of all changes that happen to the database, including deletes.

If you synchronize data from a remote source and then the

perusio

### Testing if the client is a mobile or a desktop.
### The selection is based on the usual UA strings for desktop browsers.

## Testing a user agent using a method that reverts the logic of the
## UA detection. Inspired by notnotmobile.appspot.com.
map $http_user_agent $is_desktop {
    default 0;
    ~*linux.*android|windows\s+(?:ce|phone) 0; # exceptions to the rule
    ~*spider|crawl|slurp|bot 1; # bots
    ~*windows|linux|os\s+x\s*[\d\._]+|solaris|bsd 1; # OSes

thejefflarson

[].slice.call(document.getElementsByTagName('a')).forEach(function(e){
  var x = new XMLHttpRequest(); 
  x.open("HEAD", e.href, true);
  x.onreadystatechange = function(){
    if(x.status === 200) e.style.setProperty('background-color', 'papayaWhip');
  };
  x.send();
});

thejefflarson

/* USAGE

    var graph = new Graph(paper.get(0), 800, 500);

    graph.max(maxx, maxy)
         .min(minx, miny)
         .ticks(4, function(x, y){
            var attrs = {stroke: "#ffffff", 'stroke-width': '1'};
            graph.hor(y, attrs)
                 .ver(x, attrs);

kleinmatic

Open Source code doesn’t always come in big complex packages. At ProPublica we sometimes share small, simple snippets of using GitHub "Gists." These Gists range from single-byte file delimiters to an entire JavaScript framework for making stepper graphics. They rarely have documentation and don’t even always have names, but they can be super-useful. Here are some we’ve shared over the past few years:

• A simple way to grab remote template elements in your Rails app (after Brian Boyer's RemoteSnippets) https://gist.github.com/1664329
• A single byte gist that contains ASCII character 28, which the FEC uses as a field delimiter. https://gist.github.com/2191300
• A [quine](http://en.wikipedia.org/wiki/Quine_(computing) in Ruby https://gist.github.com/523940
• Check links on a page using JavaScript [https://gist.github.com/

mandric

// lib/events.js
// topnav ala bootstrap

// stores a reference to the modal dialog
var m;

session.on('change', function (userCtx) {

    if (!$('#session_menu').length) {
        $('#topnav .pull-right').append(

hellerbarde

Latency numbers every programmer should know

L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns
L2 cache reference ........................... 7 ns
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns             
Compress 1K bytes with Zippy ............. 3,000 ns  =   3 µs
Send 2K bytes over 1 Gbps network ....... 20,000 ns  =  20 µs
SSD random read ........................ 150,000 ns  = 150 µs

Read 1 MB sequentially from memory ..... 250,000 ns = 250 µs

emjayess

(function(){
  var context = arguments[0] || document.body
  , pNodes = [], txtNodes = []
  , ELM_NODE = 1, TXT_NODE = 3//, HTML_COMMENT_NODE = 8
  , whitespace = /^\s*$/;

  // more useful!
  function seekParaNodes(ctx) {
    if (ctx.nodeType == ELM_NODE && ctx.nodeName == 'P') {
        pNodes.push(ctx); //console.log(ctx.textContent);