lancejpollard

What is your folder-structure preference for a large-scale Node.js project?

0: Starting from Rails

This is the reference point. All the other options are based off this.

|-- app
|   |-- controllers
|   |   |-- admin

nanasess

#
# Copyright (c) 1998, 1999, 2000, 2001, 2002, 2003, 2010, 2011
#	Tama Communications Corporation
#
# This file is part of GNU GLOBAL.
#
# This file is free software; as a special exception the author gives
# unlimited permission to copy and/or distribute it, with or without
# modifications, as long as this notice is preserved.
#

brian-mann

var FadeTransitionRegion = Backbone.Marionette.Region.extend({

  show: function(view){
    this.ensureEl();
    view.render();

    this.close(function() {
	  if (this.currentView && this.currentView !== view) { return; }
      this.currentView = view;

liob

{
  "translatorID": "7cb70025-a888-4a29-a210-93ec52da40d5",
  "translatorType": 3,
	"label": "BibTeX key for Markdown",
	"creator": "created by liob based on the works of Peter O'Brien, Simon Kornblith and Richard Karnesky",
	"target": "bib",
	"minVersion": "2.1.9",
	"maxVersion": null,
	"priority": 200,
	"inRepository": true,

debasishg

General Background and Overview

1. Probabilistic Data Structures for Web Analytics and Data Mining : A great overview of the space of probabilistic data structures and how they are used in approximation algorithm implementation.
2. Models and Issues in Data Stream Systems
3. Philippe Flajolet’s contribution to streaming algorithms : A presentation by Jérémie Lumbroso that visits some of the hostorical perspectives and how it all began with Flajolet
4. Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
5. [Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep=rep1&t

z-------------

var $$ = function(sel) {
    return document.querySelector(sel);
}

var $$$ = function(sel) {
    return document.querySelectorAll(sel);
}

// $$ is equivalent to querySelector
// $$$ is equivalent to querySelectorAll

staltz

The introduction to Reactive Programming you've been missing

(by @andrestaltz)

---

This tutorial as a series of videos

If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.

---

mpickering

import Text.Pandoc.JSON
import Text.Parsec
import Control.Applicative
import Data.Monoid

main :: IO ()
main = toJSONFilter index

index :: Maybe Format -> Inline -> [Inline]
index (Just (Format f)) c@(Code _ s) =

amoilanen

/*
 * Enhances 'require' from RequireJS with Promises API while preserving its original semantics.
 */

(function() {

  if (!Promise || !require) {
    return;
  }

jkr

{-# LANGUAGE PatternGuards #-}

{- This filter allows for numerical section references. It should be
used with "--number-sections", since it uses a similar numbering
scheme. It works by using the link notation: given a header with a
given id, we can refer to that number by using a link with `#` in it:

    My Header {#my-header-id}
    =========