fiddlerwoaroof

{
    "name": "fiddlerwoaroof/markdown_case",
    "require": {
        "league/commonmark": "^0.13.0"
    },
    "authors": [
        {
            "name": "fiddlerwoaroof",
            "email": "[email protected]"
        }

fiddlerwoaroof

/home/edwlan/.stack/programs/x86_64-linux/ghc-7.10.2/lib/ghc-7.10.2/package.conf.d:
    Cabal-1.22.4.0
    array-0.5.1.0
    base-4.8.1.0
    bin-package-db-0.0.0.0
    binary-0.7.5.0
    rts-1.0
    bytestring-0.10.6.0
    containers-0.5.6.2
    deepseq-1.4.1.1

fiddlerwoaroof

% stack build                                                                                                                                                                               [11:12]
ghc-mod-5.4.0.0: configure
Configuring ghc-mod-5.4.0.0...
ghc-mod-5.4.0.0: build
Preprocessing library ghc-mod-5.4.0.0...
[24 of 46] Compiling Language.Haskell.GhcMod.CabalHelper ( Language/Haskell/GhcMod/CabalHelper.hs, .stack-work/dist/x86_64-linux/Cabal-1.22.4.0/build/Language/Haskell/GhcMod/CabalHelper.o )

/home/edwlan/github_repos/ghc-mod/Language/Haskell/GhcMod/CabalHelper.hs:149:33:
    Not in scope: ‘packageId’

fiddlerwoaroof

(lquery:define-lquery-list-function tag-name (nodes &rest tags)
  "Manipulate elements on the basis of there tag-name.
   With no arguments, return their names else return
   the corresponding tags."
  (if (null tags)
    (map 'vector #'plump:tag-name nodes)
    (loop for node across nodes
          if (find (plump:tag-name node) tags :test #'string=) 
          collect node)))

fiddlerwoaroof

This example shows how to use the d3.hexbin plugin for hexagonal binning. 2,000 random points with a normal distribution are binned into hexagons; color encodes the number of points that fall into each bin. You can also use area encoding. Inspired by earlier work by Zachary Forest Johnson.

fiddlerwoaroof

#include <v8.h>
#include <iostream>

#include "utils.h"

using namespace v8;


void runJS(const std::string& inp) {
   using namespace v8;