Commits on Mar 4, 2011
  1. Allow env-js to be require'd.

    mbostock committed Mar 4, 2011
    This fixes a bug with the usage of `require` in env-js, such that env-js now
    uses proper relative paths rather than unshifting "." onto `require.paths`. The
    behavior of `require` is documented here:
    With this change in place, it's now possible to use env-js simply by require'ing
    it from a script, rather than having env-js host and eval.
    Also, this commit changes the initialization of env-js, such that the initial
    document is immediately available when the env-js module is loaded. And, the
    event loop is disabled so that env-js shuts down cleanly. This probably breaks
    some parts of env-js, but it makes it much easier to use so I'm going to play
    with it a bit.
  2. Fix env-js node 0.4.2 incompatibility.

    mbostock committed Mar 4, 2011
    The `console` global is read-only; it cannot be reassigned.
  3. Add lib/env-js.

    mbostock committed Mar 4, 2011
  4. Tiny simplification.

    mbostock committed Mar 4, 2011
Commits on Mar 3, 2011
Commits on Mar 1, 2011
  1. Add support for sortKeys on d3.nest.

    mbostock committed Mar 1, 2011
    The method existed previously, but it only makes sense in conjunction with the
    newly-added `entries` operator; map keys are inherently unsorted. Originally I
    envisioned that key-sorting could be done externally using `d3.entries`, but
    that's tedious for hierarchical structures.
Commits on Feb 28, 2011
  1. Add treemap example.

    mbostock committed Feb 28, 2011
    Still a work in progress. Need to decide on the appropriate API for representing
    tree structures; not sure I want to go the heavyweight pv.dom route. May also
    need rounding to exact pixel values.
  2. Restructure cartogram example.

    mbostock committed Feb 28, 2011
  3. Better force-directed layout.

    mbostock committed Feb 28, 2011
    Use the Floyd-Warshall algorithm to compute the shortest path between nodes, and
    use that graph theoretic distance as the distance constraint for the Gauss-
    Seidel relaxation. In addition, have the constraint alpha decay over time, as in
    Simulated Annealing.
Commits on Feb 27, 2011
  1. Add d3.interpolateHsl.

    mbostock committed Feb 27, 2011
    This allows scale interpolation in HSL space. For example:
        var fill = d3.scale.linear()
            .domain([0, 100])
            .range([d3.hsl(180, .5, 1), d3.hsl(180, .5, 0)]);
    You could approximate this in previous versions using d3.interpolateString, but
    the new interpolation method is slightly faster and also provides backwards-
    compatibility for browsers that only understand RGB.
  2. Restructure voronoi example.

    mbostock committed Feb 27, 2011
  3. Resize chord example.

    mbostock committed Feb 27, 2011
  4. Restructure splom example.

    mbostock committed Feb 27, 2011
  5. Restructure force example.

    mbostock committed Feb 27, 2011
  6. Resize a few examples.

    mbostock committed Feb 27, 2011
Commits on Feb 26, 2011
  1. Restructure choropleth example.

    mbostock committed Feb 26, 2011
Commits on Feb 25, 2011
  1. Tweak README.

    mbostock committed Feb 25, 2011
Commits on Feb 24, 2011
  1. Sort for layout, but don't reorder.

    mbostock committed Feb 24, 2011
    This fixes a bug in the pie layout sorting where we want the sort order to
    affect the layout, but not the order in which arcs are rendered—and furthermore
    we want the order of arcs to always match the order of data. (If you want to
    sort the data, do that before it is passed to the layout.)
  2. More convenient pies.

    mbostock committed Feb 24, 2011
    This adds d3.layout.pie, which can be used to compute the start and end angles
    for arcs given an arbitrary array of data. In addition, d3.svg.arc now has a
    `centroid` method that computes the center of the arc, useful for labeling.
    Together these changes greatly simplify the donut & pie examples.
    This commit also includes a `map` method for selections, which is similar to the
    `filter` method. This allows you to map the data bound to the current selection.
    I'm not currently using it, but it seems like a useful feature for those cases
    where you want to rebind the current selection to different (but related) data.
Commits on Feb 23, 2011
  1. Oops, include sqrt transform.

    mbostock committed Feb 23, 2011
  2. Merge branch 'master' of

    mbostock committed Feb 23, 2011
  3. Non-contiguous cartogram example.

    mbostock committed Feb 23, 2011
    Also includes new d3.geom.polygon.centroid method. Props to Zachary Johnson for
    the inspiration!
Commits on Feb 19, 2011
  1. Merge branch 'array_slice' of into …

    mbostock committed Feb 19, 2011
Commits on Feb 18, 2011
  1. Remove slice(arguments).

    mbostock committed Feb 18, 2011
  2. Fix `d3_array` for older/more esoteric browsers.

    jasondavies committed Feb 18, 2011
    This code is adapted from `makeArray` in Sizzle.js.
Commits on Feb 17, 2011
  1. Support for Sizzle.

    mbostock committed Feb 17, 2011
    D3 now supports Sizzle, preferring Sizzle to the native Selectors API if Sizzle
    is available. Sizzle internally uses the native Selectors API and thus this
    should have minimal performance implications; also, it allows you to use Sizzle
    proprietary extensions such as ":first".
    This commit also restricts the definition of the enter selection so that only
    append and insert operations are defined. The other operations were generally
    unsupported anyway, and it cleans up the code to have separate implementations
    for insert and append. (I might enable additional operations in the future, such
    as `filter`, `sort` and `each`, but this seems like a reasonable first pass.)