1. 18 May, 2014 4 commits
  2. 17 May, 2014 1 commit
    • Mike Bostock's avatar
      Don’t store temporary variables on tree nodes. · 082c9593
      Mike Bostock authored
      Rather than creating a temporary _tree hash on the tree nodes to store temporary
      variables needed to compute the tree layout, the tree is wrapped. This
      eliminates the risk of a namespace collision, and eliminates the need to
      subsequently delete temporary variables. (They will be garbage collected.)
  3. 13 Apr, 2014 4 commits
  4. 11 Apr, 2014 1 commit
    • Jason Davies's avatar
      Optimise d3.mean. · c0e84e2c
      Jason Davies authored
      Originally we were using Welford’s algorithm, but this is primarily
      useful when computing the variance in a numerically stable manner, since
      Welford’s approach requires an incremental mean.
      I’ve removed a test for the mean of more than one instance of
      Number.MAX_VALUE as this is unlikely to occur in practice; most likely
      this was the reason I used Welford’s algorithm in the first place.
      There’s a paper [1] comparing various algorithms for computing the mean,
      and Welford’s is actually slightly less accurate than the naïve
      approach.  There are some more accurate approaches but I think it’s
      overkill for d3.mean.
      [1] Youngs, Edward A., and Elliot M. Cramer. "Some results relevant to
      choice of sum and sum-of-product algorithms." Technometrics 13.3 (1971):
      Related: #1842.
  5. 10 Apr, 2014 2 commits
  6. 08 Apr, 2014 3 commits
  7. 06 Apr, 2014 4 commits
  8. 04 Apr, 2014 1 commit
  9. 24 Mar, 2014 20 commits