mbostock

license: gpl-3.0

LeCoupa

// XPath CheatSheet
// To test XPath in your Chrome Debugger: $x('/html/body')
// http://www.jittuu.com/2012/2/14/Testing-XPath-In-Chrome/


// 0. XPath Examples.
// More: http://xpath.alephzarro.com/content/cheatsheet.html


'//hr[@class="edge" and position()=1]'                // every first hr of 'edge' class

kamilogorek

var Collection = require("ampersand-rest-collection");
var Model = require("ampersand-model");

var Product = Model.extend({
    props: {
        name: 'string',
        price: 'integer'
    }
});

monsieurBelbo

mbostock

license: gpl-3.0

llb4ll

This example was inspired by patricksurry's D3JS quadtree nearest neighbor algorithm and finds the k-nearest neighbors (shown red) of a new point (shown yellow) using D3's Quadtrees. Orange points are visited but not selected. k is fixed to 10 for this demo.

Choose a new point to classify by clicking on the diagram.

The algorithm is based on one very simple but effective incremental approach first proposed by Hjaltason and Samet in their Ranking in Spatial Databases in 1995.

mbostock

license: gpl-3.0
redirect: https://observablehq.com/@d3/multi-line-chart

dgerber

swiss-cantons.topo.json: lib/swiss-maps/topojson/swiss-cantons.json
	topojson --properties --id-property abbr \
	-o $@ \
	lib/swiss-maps/topojson/swiss-cantons.json

balamuru

import logging
from scipy.odr import models
from sklearn import metrics
import unittest
import os
import os.path
import tempfile

import numpy
from matplotlib.pyplot import plot, show

mbostock

license: gpl-3.0
redirect: https://beta.observablehq.com/@mbostock/d3-hexbin-area