Skip to content

Instantly share code, notes, and snippets.

View dribnet's full-sized avatar

tom white dribnet

View GitHub Profile
@dribnet
dribnet / ants.clj
Created August 20, 2012 01:53 — forked from michiakig/ants.clj
Clojure ant sim from Rich Hickey
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; Ant sim ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Copyright (c) Rich Hickey. All rights reserved.
; The use and distribution terms for this software are covered by the
; Common Public License 1.0 (http://opensource.org/licenses/cpl.php)
; which can be found in the file CPL.TXT at the root of this distribution.
; By using this software in any fashion, you are agreeing to be bound by
; the terms of this license.
; You must not remove this notice, or any other, from this software.
; Note: This code cannot run for very long on clojure 1.3 because
@dribnet
dribnet / README.md
Last active June 5, 2018 00:37 — forked from mbostock/.block
clojurescript convex hull using d3+strokes

This example uses d3.geom.hull to compute the 2D convex hull of a set of points. An outer stroke is used to pad the hull. Click to add a new point.

A fork and port of mike's js version, programmed in clojurescript atop the fledgling strokes library.

(Merge request? Use the repo version)

@dribnet
dribnet / README.md
Last active December 10, 2015 08:38 — forked from mbostock/README.md
Init bugfix of 4343214

This example demonstrates accelerated two-dimensional filtering enabled by d3.geom.quadtree. A quadtree recursively subdivides square cells into four equal-sized subcells. Each leaf node of the quadtree contains a single point. If a given quadtree cell does not intersect the brush extent, then none of the points contained in that subtree can be selected, and thus do not need to be scanned. Above, orange indicates points that are scanned but not selected. Without a quadtree, all points would need to be scanned!

@dribnet
dribnet / README.md
Last active June 12, 2021 19:24 — forked from mbostock/README.md
strokes version of quadtree

This example demonstrates accelerated two-dimensional filtering enabled by d3.geom.quadtree. A quadtree recursively subdivides square cells into four equal-sized subcells. Each leaf node of the quadtree contains a single point. If a given quadtree cell does not intersect the brush extent, then none of the points contained in that subtree can be selected, and thus do not need to be scanned. Above, orange indicates points that are scanned but not selected. Without a quadtree, all points would need to be scanned!

A fork and port of mike's js version (gist/block), programmed in clojurescript atop the incipient strokes library.

(Merge request? Use the repo version.)

@dribnet
dribnet / README.md
Last active December 10, 2015 17:08 — forked from mbostock/.block
Prose-only Blocks (polyglot)

So we can still embed code in the prose, and it will be syntax-highlighted. Super! So let's test sytax highlighting in other languages. Like maybe clojure(script)?

; this is a snippet of the strokes quadtree gist (4409139)

; Check it out clojurists - here we generate a lazy-seq of maps
(defn gen-data []
  (for [x (range 2500)]
    {:x (rand width), :y (rand height)}))
@dribnet
dribnet / README.md
Last active December 11, 2015 03:28 — forked from mbostock/README.md
underscore / d3 / clojurescript rosetta stone

Collections

each(array)

Underscore example:

_.each([1, 2, 3], function(num) { alert(num); });
@dribnet
dribnet / README.md
Last active December 11, 2015 10:09 — forked from mbostock/.block
strokes: circle packing

Enclosure diagrams use containment to represent the hierarchy. Although circle packing is not as space-efficient as a treemap, it better reveals the hierarchy. Implementation based on work by Jeff Heer. Data shows the Flare class hierarchy, also courtesy Jeff Heer.

A fork and port of mike's js version (gist/block), programmed in clojurescript atop the maturing strokes library.

This is running atop the first version of strokes that is able to repair a persistent data structure that has been mutated by javascript as the d3 layouts do - effectively trying to add new fields to the clojure maps. In this example the mrhyde function repersist reconstructs a persistent view of each node.

(Merge request? Use the repo version.)

@dribnet
dribnet / README.md
Last active April 22, 2016 18:05 — forked from mbostock/.block
strokes: rotating voronoi

Mario Klingemann has made some beautiful Voronoi diagrams. This is my attempt to recreate them using D3. To achieve the curved cells, each side of the Voronoi polygon is subdivided into three equal-length segments and then joined using the "basis-closed" line interpolator. There are some discontinuities in the animation when the sides of a polygon approach zero which could likely be avoided by adding a minimum-length threshold to the subdivision.

If you’d like to see other instances of this pattern, Mario describes the algorithm on Flickr.

A fork and port of mike's js version (gist/block), for the strokes examples repo.

(merge requests should go to the example in the repo).

@dribnet
dribnet / README.md
Last active December 12, 2015 10:39 — forked from mbostock/.block
strokes: voronoi clipping

Looking for a small and easy to follow strokes example? You've found it.

A fork and port of mike's js version (gist/block), for the strokes examples repo.

(merge requests should go to the example in the repo).


The Voronoi layout, d3.geom.voronoi, does not provide clipping by default; the returned diagram spans ±1e6. This example demonstrates how to clip the diagram to known dimensions.

@dribnet
dribnet / README.md
Last active December 14, 2015 04:19 — forked from mbostock/.block
strokes - General Update Pattern, I

strokes fork and port of mike's general update pattern tutorial, I.

merge requests should go to the example in the repo


This example demonstrates the general update pattern in D3, where a data-join is followed by operations on the enter, update and exit selections. Entering elements are shown in green, while updating elements are shown in black. Exiting elements are removed immediately, so they're invisible.

This example does not use a key function for the data-join, so entering elements are always added to the end: when the new data has more letters than the old data, new elements are entered to display the new letters. Likewise, exiting letters are always removed from the end when the new data has fewer letters than the old data.