bum 0.0.4 → 0.0.12
Sign up to get free protection for your applications and to get access to all the features.
- data/README +0 -12
- data/bin/bum +16 -49
- data/bin/bum_master +20 -0
- data/lib/actor.rb +0 -0
- data/lib/app_role.rb +83 -0
- data/lib/client.rb +104 -0
- data/lib/db_crap.rb +85 -0
- data/lib/db_role.rb +107 -0
- data/lib/demo_socket.rb +51 -0
- data/lib/master.rb +109 -0
- data/lib/master_web.rb +81 -0
- data/lib/nice_socket.rb +77 -0
- data/lib/node.rb +96 -0
- data/lib/proxy_role.rb +132 -0
- data/lib/role.rb +99 -0
- data/lib/scenario.rb +186 -0
- data/lib/server.rb +30 -0
- data/lib/stats_role.rb +89 -0
- data/public/app.css +91 -0
- data/public/css/light.css +105 -0
- data/public/d3/LICENSE +26 -0
- data/public/d3/Makefile +247 -0
- data/public/d3/README.md +51 -0
- data/public/d3/d3.chart.js +984 -0
- data/public/d3/d3.chart.min.js +1 -0
- data/public/d3/d3.csv.js +92 -0
- data/public/d3/d3.csv.min.js +1 -0
- data/public/d3/d3.geo.js +692 -0
- data/public/d3/d3.geo.min.js +1 -0
- data/public/d3/d3.geom.js +825 -0
- data/public/d3/d3.geom.min.js +1 -0
- data/public/d3/d3.js +4013 -0
- data/public/d3/d3.layout.js +1865 -0
- data/public/d3/d3.layout.min.js +1 -0
- data/public/d3/d3.min.js +2 -0
- data/public/d3/d3.time.js +663 -0
- data/public/d3/d3.time.min.js +1 -0
- data/public/d3/examples/albers/albers.html +168 -0
- data/public/d3/examples/area/area-radial.html +48 -0
- data/public/d3/examples/area/area.html +113 -0
- data/public/d3/examples/axis/axis-alternating.html +50 -0
- data/public/d3/examples/axis/axis-ggplot2.html +68 -0
- data/public/d3/examples/axis/axis-multiples.html +117 -0
- data/public/d3/examples/axis/axis-orientations.html +63 -0
- data/public/d3/examples/axis/axis-transition.html +153 -0
- data/public/d3/examples/azimuthal/azimuthal.css +21 -0
- data/public/d3/examples/azimuthal/azimuthal.html +84 -0
- data/public/d3/examples/azimuthal/azimuthal.js +27 -0
- data/public/d3/examples/bar/bar.html +93 -0
- data/public/d3/examples/box/box.css +4 -0
- data/public/d3/examples/box/box.html +19 -0
- data/public/d3/examples/box/box.js +68 -0
- data/public/d3/examples/bubble/bubble.css +8 -0
- data/public/d3/examples/bubble/bubble.html +14 -0
- data/public/d3/examples/bubble/bubble.js +46 -0
- data/public/d3/examples/bullet/bullet.css +10 -0
- data/public/d3/examples/bullet/bullet.html +18 -0
- data/public/d3/examples/bullet/bullet.js +53 -0
- data/public/d3/examples/bullet/bullets.json +7 -0
- data/public/d3/examples/bundle/bundle-radial.css +9 -0
- data/public/d3/examples/bundle/bundle-radial.html +15 -0
- data/public/d3/examples/bundle/bundle-radial.js +50 -0
- data/public/d3/examples/bundle/bundle-treemap.css +14 -0
- data/public/d3/examples/bundle/bundle-treemap.html +16 -0
- data/public/d3/examples/bundle/bundle-treemap.js +53 -0
- data/public/d3/examples/bundle/packages.js +49 -0
- data/public/d3/examples/button.css +35 -0
- data/public/d3/examples/calendar/calendar.css +16 -0
- data/public/d3/examples/calendar/calendar.js +50 -0
- data/public/d3/examples/calendar/dji.csv +5233 -0
- data/public/d3/examples/calendar/dji.html +16 -0
- data/public/d3/examples/calendar/dji.js +61 -0
- data/public/d3/examples/calendar/vix.csv +5231 -0
- data/public/d3/examples/calendar/vix.html +16 -0
- data/public/d3/examples/calendar/vix.js +60 -0
- data/public/d3/examples/cartogram/cartogram.css +20 -0
- data/public/d3/examples/cartogram/cartogram.html +15 -0
- data/public/d3/examples/cartogram/cartogram.js +51 -0
- data/public/d3/examples/cartogram/demers.css +9 -0
- data/public/d3/examples/cartogram/demers.html +16 -0
- data/public/d3/examples/cartogram/demers.js +79 -0
- data/public/d3/examples/cartogram/dorling.css +9 -0
- data/public/d3/examples/cartogram/dorling.html +16 -0
- data/public/d3/examples/cartogram/dorling.js +80 -0
- data/public/d3/examples/chord/chord-flare.html +109 -0
- data/public/d3/examples/chord/chord.css +9 -0
- data/public/d3/examples/chord/chord.html +14 -0
- data/public/d3/examples/chord/chord.js +98 -0
- data/public/d3/examples/choropleth/choropleth-area.html +51 -0
- data/public/d3/examples/choropleth/choropleth-bounds.html +46 -0
- data/public/d3/examples/choropleth/choropleth.css +16 -0
- data/public/d3/examples/choropleth/choropleth.html +15 -0
- data/public/d3/examples/choropleth/choropleth.js +38 -0
- data/public/d3/examples/choropleth/unemployment.json +1 -0
- data/public/d3/examples/clock/clock.css +23 -0
- data/public/d3/examples/clock/clock.html +17 -0
- data/public/d3/examples/clock/clock.js +87 -0
- data/public/d3/examples/cluster/cluster-radial.html +14 -0
- data/public/d3/examples/cluster/cluster-radial.js +39 -0
- data/public/d3/examples/cluster/cluster.css +15 -0
- data/public/d3/examples/cluster/cluster.html +14 -0
- data/public/d3/examples/cluster/cluster.js +39 -0
- data/public/d3/examples/contour/contour.html +108 -0
- data/public/d3/examples/crimea/crimea-stacked-area.html +109 -0
- data/public/d3/examples/crimea/crimea-stacked-bar.html +98 -0
- data/public/d3/examples/crimea/crimea.csv +24 -0
- data/public/d3/examples/data/README +5 -0
- data/public/d3/examples/data/faithful.json +8 -0
- data/public/d3/examples/data/flare-imports.json +222 -0
- data/public/d3/examples/data/flare.json +380 -0
- data/public/d3/examples/data/morley.csv +101 -0
- data/public/d3/examples/data/sample.csv +2 -0
- data/public/d3/examples/data/sample.html +5 -0
- data/public/d3/examples/data/sample.json +1 -0
- data/public/d3/examples/data/sample.txt +1 -0
- data/public/d3/examples/data/sample.xml +4 -0
- data/public/d3/examples/data/stocks.csv +807 -0
- data/public/d3/examples/data/unemployment.csv +1709 -0
- data/public/d3/examples/data/us-borders.json +1 -0
- data/public/d3/examples/data/us-counties.json +3216 -0
- data/public/d3/examples/data/us-state-centroids.json +1 -0
- data/public/d3/examples/data/us-states.json +54 -0
- data/public/d3/examples/data/world-countries.json +246 -0
- data/public/d3/examples/delaunay/delaunay.html +44 -0
- data/public/d3/examples/donut/donut.html +124 -0
- data/public/d3/examples/dot/dot.html +103 -0
- data/public/d3/examples/force/README +10 -0
- data/public/d3/examples/force/force-bounds.html +70 -0
- data/public/d3/examples/force/force-cluster.html +251 -0
- data/public/d3/examples/force/force-dynamic.html +118 -0
- data/public/d3/examples/force/force-interactive.html +136 -0
- data/public/d3/examples/force/force-map.html +104 -0
- data/public/d3/examples/force/force-multi-foci.html +68 -0
- data/public/d3/examples/force/force.css +9 -0
- data/public/d3/examples/force/force.html +14 -0
- data/public/d3/examples/force/force.js +56 -0
- data/public/d3/examples/force/miserables.json +1 -0
- data/public/d3/examples/hello-world/hello-data-key.html +60 -0
- data/public/d3/examples/hello-world/hello-data-nested-key.html +75 -0
- data/public/d3/examples/hello-world/hello-data-nested.html +77 -0
- data/public/d3/examples/hello-world/hello-data.html +46 -0
- data/public/d3/examples/hello-world/hello-event.html +53 -0
- data/public/d3/examples/hello-world/hello-node-key.html +25 -0
- data/public/d3/examples/hello-world/hello-sort.html +75 -0
- data/public/d3/examples/hello-world/hello-transform.html +41 -0
- data/public/d3/examples/hello-world/hello-transition-undefined.html +43 -0
- data/public/d3/examples/hello-world/hello-transition.html +47 -0
- data/public/d3/examples/hello-world/hello-webkit-transition.html +64 -0
- data/public/d3/examples/hello-world/select-enter-add.html +29 -0
- data/public/d3/examples/hello-world/selectAll-enter-add.html +20 -0
- data/public/d3/examples/histogram/histogram.html +80 -0
- data/public/d3/examples/horizon/horizon.css +9 -0
- data/public/d3/examples/horizon/horizon.html +25 -0
- data/public/d3/examples/horizon/horizon.js +43 -0
- data/public/d3/examples/horizon/unemployment.json +1 -0
- data/public/d3/examples/hull/hull.html +75 -0
- data/public/d3/examples/kde/kde.css +9 -0
- data/public/d3/examples/kde/kde.html +14 -0
- data/public/d3/examples/kde/kde.js +40 -0
- data/public/d3/examples/line/line.css +22 -0
- data/public/d3/examples/line/line.html +11 -0
- data/public/d3/examples/line/line.js +63 -0
- data/public/d3/examples/marimekko/marimekko.html +116 -0
- data/public/d3/examples/marimekko/marimekko.json +18 -0
- data/public/d3/examples/marker/marker.html +169 -0
- data/public/d3/examples/mercator/mercator.html +133 -0
- data/public/d3/examples/moire/moire.html +53 -0
- data/public/d3/examples/pack/pack.css +15 -0
- data/public/d3/examples/pack/pack.html +14 -0
- data/public/d3/examples/pack/pack.js +33 -0
- data/public/d3/examples/partition/partition-icicle-zoom.html +59 -0
- data/public/d3/examples/partition/partition-icicle.html +45 -0
- data/public/d3/examples/partition/partition-sunburst-zoom.html +72 -0
- data/public/d3/examples/partition/partition-sunburst.html +21 -0
- data/public/d3/examples/partition/partition-sunburst.js +72 -0
- data/public/d3/examples/pie/pie-transition.html +70 -0
- data/public/d3/examples/pie/pie.html +51 -0
- data/public/d3/examples/population/population.css +28 -0
- data/public/d3/examples/population/population.csv +571 -0
- data/public/d3/examples/population/population.html +13 -0
- data/public/d3/examples/population/population.js +126 -0
- data/public/d3/examples/qq/qq.css +18 -0
- data/public/d3/examples/qq/qq.html +21 -0
- data/public/d3/examples/qq/qq.js +66 -0
- data/public/d3/examples/qq/stats.js +28 -0
- data/public/d3/examples/qq/turkers.json +1 -0
- data/public/d3/examples/quadtree/quadtree.html +114 -0
- data/public/d3/examples/sizzle/sizzle.html +27 -0
- data/public/d3/examples/sort/sort.css +4 -0
- data/public/d3/examples/sort/sort.html +12 -0
- data/public/d3/examples/sort/sort.js +112 -0
- data/public/d3/examples/spline/spline.css +30 -0
- data/public/d3/examples/spline/spline.html +14 -0
- data/public/d3/examples/spline/spline.js +113 -0
- data/public/d3/examples/splom/cross.js +7 -0
- data/public/d3/examples/splom/flowers.json +1 -0
- data/public/d3/examples/splom/splom.css +8 -0
- data/public/d3/examples/splom/splom.html +14 -0
- data/public/d3/examples/splom/splom.js +149 -0
- data/public/d3/examples/stream/stack.css +7 -0
- data/public/d3/examples/stream/stack.html +22 -0
- data/public/d3/examples/stream/stack.js +119 -0
- data/public/d3/examples/stream/stream.css +3 -0
- data/public/d3/examples/stream/stream.html +19 -0
- data/public/d3/examples/stream/stream.js +42 -0
- data/public/d3/examples/stream/stream_layers.js +33 -0
- data/public/d3/examples/superformula/dot.html +104 -0
- data/public/d3/examples/superformula/explorer.html +120 -0
- data/public/d3/examples/superformula/superformula.html +70 -0
- data/public/d3/examples/superformula/superformula.js +98 -0
- data/public/d3/examples/symbol-map/symbol-map.html +67 -0
- data/public/d3/examples/touch/touch.html +65 -0
- data/public/d3/examples/tree/tree-dynamic.html +111 -0
- data/public/d3/examples/tree/tree-interactive.html +139 -0
- data/public/d3/examples/tree/tree-radial.html +14 -0
- data/public/d3/examples/tree/tree-radial.js +40 -0
- data/public/d3/examples/tree/tree.css +15 -0
- data/public/d3/examples/tree/tree.html +14 -0
- data/public/d3/examples/tree/tree.js +39 -0
- data/public/d3/examples/treemap/treemap-svg.html +22 -0
- data/public/d3/examples/treemap/treemap-svg.js +34 -0
- data/public/d3/examples/treemap/treemap.css +8 -0
- data/public/d3/examples/treemap/treemap.html +22 -0
- data/public/d3/examples/treemap/treemap.js +53 -0
- data/public/d3/examples/voroboids/boid.js +235 -0
- data/public/d3/examples/voroboids/voroboids.css +15 -0
- data/public/d3/examples/voroboids/voroboids.html +14 -0
- data/public/d3/examples/voroboids/voroboids.js +65 -0
- data/public/d3/examples/voronoi/voronoi.css +16 -0
- data/public/d3/examples/voronoi/voronoi.html +15 -0
- data/public/d3/examples/voronoi/voronoi.js +34 -0
- data/public/d3/examples/zoom-pan/zoom-pan-transform.html +95 -0
- data/public/d3/examples/zoom-pan/zoom-pan.html +119 -0
- data/public/d3/examples/zoom/dji.csv +5233 -0
- data/public/d3/examples/zoom/zoom.html +162 -0
- data/public/d3/lib/colorbrewer/LICENSE +38 -0
- data/public/d3/lib/colorbrewer/colorbrewer.css +1327 -0
- data/public/d3/lib/colorbrewer/colorbrewer.js +32 -0
- data/public/d3/lib/jit/LICENSE +27 -0
- data/public/d3/lib/jquery-ui/LICENSE +25 -0
- data/public/d3/lib/jquery-ui/images/ui-bg_diagonals-thick_18_b81900_40x40.png +0 -0
- data/public/d3/lib/jquery-ui/images/ui-bg_diagonals-thick_20_666666_40x40.png +0 -0
- data/public/d3/lib/jquery-ui/images/ui-bg_flat_10_000000_40x100.png +0 -0
- data/public/d3/lib/jquery-ui/images/ui-bg_glass_100_f6f6f6_1x400.png +0 -0
- data/public/d3/lib/jquery-ui/images/ui-bg_glass_100_fdf5ce_1x400.png +0 -0
- data/public/d3/lib/jquery-ui/images/ui-bg_glass_65_ffffff_1x400.png +0 -0
- data/public/d3/lib/jquery-ui/images/ui-bg_gloss-wave_35_f6a828_500x100.png +0 -0
- data/public/d3/lib/jquery-ui/images/ui-bg_highlight-soft_100_eeeeee_1x100.png +0 -0
- data/public/d3/lib/jquery-ui/images/ui-bg_highlight-soft_75_ffe45c_1x100.png +0 -0
- data/public/d3/lib/jquery-ui/images/ui-icons_222222_256x240.png +0 -0
- data/public/d3/lib/jquery-ui/images/ui-icons_228ef1_256x240.png +0 -0
- data/public/d3/lib/jquery-ui/images/ui-icons_ef8c08_256x240.png +0 -0
- data/public/d3/lib/jquery-ui/images/ui-icons_ffd27a_256x240.png +0 -0
- data/public/d3/lib/jquery-ui/images/ui-icons_ffffff_256x240.png +0 -0
- data/public/d3/lib/jquery-ui/jquery-ui.css +318 -0
- data/public/d3/lib/jquery-ui/jquery-ui.min.js +83 -0
- data/public/d3/lib/jquery/LICENSE +20 -0
- data/public/d3/lib/jquery/jquery.js +6883 -0
- data/public/d3/lib/jquery/jquery.min.js +166 -0
- data/public/d3/lib/polymaps/LICENSE +28 -0
- data/public/d3/lib/protovis/LICENSE +27 -0
- data/public/d3/lib/science/LICENSE +26 -0
- data/public/d3/lib/science/science.js +5 -0
- data/public/d3/lib/science/science.min.js +1 -0
- data/public/d3/lib/science/science.stats.js +166 -0
- data/public/d3/lib/science/science.stats.min.js +1 -0
- data/public/d3/lib/sizzle/LICENSE +24 -0
- data/public/d3/lib/sizzle/sizzle.js +1376 -0
- data/public/d3/lib/sizzle/sizzle.min.js +28 -0
- data/public/d3/package.json +14 -0
- data/public/d3/src/behavior/behavior.js +1 -0
- data/public/d3/src/behavior/drag.js +106 -0
- data/public/d3/src/behavior/zoom.js +212 -0
- data/public/d3/src/chart/box.js +297 -0
- data/public/d3/src/chart/bullet.js +237 -0
- data/public/d3/src/chart/chart.js +1 -0
- data/public/d3/src/chart/horizon.js +203 -0
- data/public/d3/src/chart/qq.js +245 -0
- data/public/d3/src/compat/date.js +3 -0
- data/public/d3/src/compat/style.js +9 -0
- data/public/d3/src/core/array.js +11 -0
- data/public/d3/src/core/ascending.js +3 -0
- data/public/d3/src/core/bisect.js +38 -0
- data/public/d3/src/core/collapse.js +3 -0
- data/public/d3/src/core/core.js +1 -0
- data/public/d3/src/core/descending.js +3 -0
- data/public/d3/src/core/dispatch.js +45 -0
- data/public/d3/src/core/ease.js +128 -0
- data/public/d3/src/core/entries.js +5 -0
- data/public/d3/src/core/event.js +1 -0
- data/public/d3/src/core/first.js +13 -0
- data/public/d3/src/core/format.js +85 -0
- data/public/d3/src/core/functor.js +3 -0
- data/public/d3/src/core/hsl.js +62 -0
- data/public/d3/src/core/html.js +10 -0
- data/public/d3/src/core/interpolate.js +180 -0
- data/public/d3/src/core/json.js +5 -0
- data/public/d3/src/core/keys.js +5 -0
- data/public/d3/src/core/last.js +13 -0
- data/public/d3/src/core/max.js +14 -0
- data/public/d3/src/core/merge.js +3 -0
- data/public/d3/src/core/min.js +14 -0
- data/public/d3/src/core/nest.js +87 -0
- data/public/d3/src/core/noop.js +1 -0
- data/public/d3/src/core/ns.js +19 -0
- data/public/d3/src/core/permute.js +7 -0
- data/public/d3/src/core/quantile.js +8 -0
- data/public/d3/src/core/range.js +21 -0
- data/public/d3/src/core/rebind.js +7 -0
- data/public/d3/src/core/requote.js +5 -0
- data/public/d3/src/core/rgb.js +284 -0
- data/public/d3/src/core/round.js +5 -0
- data/public/d3/src/core/selection-append.js +15 -0
- data/public/d3/src/core/selection-attr.js +44 -0
- data/public/d3/src/core/selection-call.js +13 -0
- data/public/d3/src/core/selection-classed.js +46 -0
- data/public/d3/src/core/selection-data.js +110 -0
- data/public/d3/src/core/selection-each.js +9 -0
- data/public/d3/src/core/selection-empty.js +3 -0
- data/public/d3/src/core/selection-enter-select.js +24 -0
- data/public/d3/src/core/selection-enter.js +10 -0
- data/public/d3/src/core/selection-filter.js +19 -0
- data/public/d3/src/core/selection-html.js +6 -0
- data/public/d3/src/core/selection-insert.js +20 -0
- data/public/d3/src/core/selection-map.js +5 -0
- data/public/d3/src/core/selection-node.js +9 -0
- data/public/d3/src/core/selection-on.js +34 -0
- data/public/d3/src/core/selection-property.js +23 -0
- data/public/d3/src/core/selection-remove.js +9 -0
- data/public/d3/src/core/selection-root.js +16 -0
- data/public/d3/src/core/selection-select.js +30 -0
- data/public/d3/src/core/selection-selectAll.js +24 -0
- data/public/d3/src/core/selection-sort.js +20 -0
- data/public/d3/src/core/selection-style.js +26 -0
- data/public/d3/src/core/selection-text.js +6 -0
- data/public/d3/src/core/selection-transition.js +14 -0
- data/public/d3/src/core/selection.js +21 -0
- data/public/d3/src/core/split.js +21 -0
- data/public/d3/src/core/sum.js +14 -0
- data/public/d3/src/core/text.js +10 -0
- data/public/d3/src/core/this.js +3 -0
- data/public/d3/src/core/timer.js +104 -0
- data/public/d3/src/core/transition-attr.js +23 -0
- data/public/d3/src/core/transition-delay.js +6 -0
- data/public/d3/src/core/transition-duration.js +6 -0
- data/public/d3/src/core/transition-each.js +9 -0
- data/public/d3/src/core/transition-remove.js +6 -0
- data/public/d3/src/core/transition-select.js +22 -0
- data/public/d3/src/core/transition-selectAll.js +20 -0
- data/public/d3/src/core/transition-style.js +14 -0
- data/public/d3/src/core/transition-text.js +7 -0
- data/public/d3/src/core/transition-transition.js +3 -0
- data/public/d3/src/core/transition.js +105 -0
- data/public/d3/src/core/uninterpolate.js +9 -0
- data/public/d3/src/core/values.js +5 -0
- data/public/d3/src/core/xhr.js +10 -0
- data/public/d3/src/core/xml.js +10 -0
- data/public/d3/src/core/zip.js +13 -0
- data/public/d3/src/csv/csv.js +5 -0
- data/public/d3/src/csv/format.js +13 -0
- data/public/d3/src/csv/parse.js +73 -0
- data/public/d3/src/end.js +1 -0
- data/public/d3/src/externs.js +6 -0
- data/public/d3/src/geo/albers.js +128 -0
- data/public/d3/src/geo/azimuthal.js +70 -0
- data/public/d3/src/geo/bounds.js +76 -0
- data/public/d3/src/geo/geo.js +1 -0
- data/public/d3/src/geo/greatCircle.js +91 -0
- data/public/d3/src/geo/mercator.js +36 -0
- data/public/d3/src/geo/path.js +289 -0
- data/public/d3/src/geom/contour.js +78 -0
- data/public/d3/src/geom/delaunay.js +31 -0
- data/public/d3/src/geom/geom.js +1 -0
- data/public/d3/src/geom/hull.js +98 -0
- data/public/d3/src/geom/polygon.js +88 -0
- data/public/d3/src/geom/quadtree.js +129 -0
- data/public/d3/src/geom/voronoi.js +399 -0
- data/public/d3/src/layout/bundle.js +57 -0
- data/public/d3/src/layout/chord.js +148 -0
- data/public/d3/src/layout/cluster.js +77 -0
- data/public/d3/src/layout/force.js +332 -0
- data/public/d3/src/layout/hierarchy.js +120 -0
- data/public/d3/src/layout/histogram.js +102 -0
- data/public/d3/src/layout/layout.js +1 -0
- data/public/d3/src/layout/pack.js +200 -0
- data/public/d3/src/layout/partition.js +48 -0
- data/public/d3/src/layout/pie.js +95 -0
- data/public/d3/src/layout/stack.js +237 -0
- data/public/d3/src/layout/tree.js +234 -0
- data/public/d3/src/layout/treemap.js +213 -0
- data/public/d3/src/scale/bilinear.js +7 -0
- data/public/d3/src/scale/category.js +54 -0
- data/public/d3/src/scale/linear.js +115 -0
- data/public/d3/src/scale/log.js +80 -0
- data/public/d3/src/scale/nice.js +21 -0
- data/public/d3/src/scale/ordinal.js +74 -0
- data/public/d3/src/scale/polylinear.js +16 -0
- data/public/d3/src/scale/pow.js +54 -0
- data/public/d3/src/scale/quantile.js +43 -0
- data/public/d3/src/scale/quantize.js +36 -0
- data/public/d3/src/scale/scale.js +6 -0
- data/public/d3/src/scale/sqrt.js +3 -0
- data/public/d3/src/start.js +1 -0
- data/public/d3/src/svg/arc.js +95 -0
- data/public/d3/src/svg/area-radial.js +10 -0
- data/public/d3/src/svg/area.js +84 -0
- data/public/d3/src/svg/axis.js +182 -0
- data/public/d3/src/svg/chord.js +99 -0
- data/public/d3/src/svg/diagonal-radial.js +22 -0
- data/public/d3/src/svg/diagonal.js +38 -0
- data/public/d3/src/svg/line-radial.js +22 -0
- data/public/d3/src/svg/line.js +419 -0
- data/public/d3/src/svg/mouse.js +29 -0
- data/public/d3/src/svg/svg.js +1 -0
- data/public/d3/src/svg/symbol.js +98 -0
- data/public/d3/src/svg/touches.js +8 -0
- data/public/d3/src/time/day.js +7 -0
- data/public/d3/src/time/days.js +11 -0
- data/public/d3/src/time/format-iso.js +1 -0
- data/public/d3/src/time/format-utc.js +48 -0
- data/public/d3/src/time/format.js +315 -0
- data/public/d3/src/time/hour.js +8 -0
- data/public/d3/src/time/hours.js +11 -0
- data/public/d3/src/time/minute.js +5 -0
- data/public/d3/src/time/minutes.js +11 -0
- data/public/d3/src/time/month.js +7 -0
- data/public/d3/src/time/months.js +11 -0
- data/public/d3/src/time/range.js +16 -0
- data/public/d3/src/time/scale-utc.js +36 -0
- data/public/d3/src/time/scale.js +123 -0
- data/public/d3/src/time/second.js +5 -0
- data/public/d3/src/time/seconds.js +7 -0
- data/public/d3/src/time/time.js +3 -0
- data/public/d3/src/time/week.js +9 -0
- data/public/d3/src/time/weeks.js +11 -0
- data/public/d3/src/time/year.js +7 -0
- data/public/d3/src/time/years.js +11 -0
- data/public/d3/test/core/ascending-test.js +47 -0
- data/public/d3/test/core/bisect-test.js +103 -0
- data/public/d3/test/core/descending-test.js +47 -0
- data/public/d3/test/core/dispatch-test.js +116 -0
- data/public/d3/test/core/ease-test.js +129 -0
- data/public/d3/test/core/entries-test.js +43 -0
- data/public/d3/test/core/first-test.js +42 -0
- data/public/d3/test/core/format-test.js +204 -0
- data/public/d3/test/core/functor-test.js +29 -0
- data/public/d3/test/core/hsl-test.js +87 -0
- data/public/d3/test/core/html-test.js +37 -0
- data/public/d3/test/core/interpolate-test.js +203 -0
- data/public/d3/test/core/json-test.js +37 -0
- data/public/d3/test/core/keys-test.js +31 -0
- data/public/d3/test/core/last-test.js +42 -0
- data/public/d3/test/core/max-test.js +50 -0
- data/public/d3/test/core/merge-test.js +27 -0
- data/public/d3/test/core/min-test.js +50 -0
- data/public/d3/test/core/nest-test.js +236 -0
- data/public/d3/test/core/ns-test.js +53 -0
- data/public/d3/test/core/permute-test.js +53 -0
- data/public/d3/test/core/quantile-test.js +50 -0
- data/public/d3/test/core/range-test.js +93 -0
- data/public/d3/test/core/rebind-test.js +38 -0
- data/public/d3/test/core/requote-test.js +53 -0
- data/public/d3/test/core/rgb-test.js +89 -0
- data/public/d3/test/core/round-test.js +70 -0
- data/public/d3/test/core/select-test.js +42 -0
- data/public/d3/test/core/selectAll-test.js +42 -0
- data/public/d3/test/core/selection-append-test.js +119 -0
- data/public/d3/test/core/selection-attr-test.js +153 -0
- data/public/d3/test/core/selection-call-test.js +71 -0
- data/public/d3/test/core/selection-classed-test.js +200 -0
- data/public/d3/test/core/selection-data-test.js +165 -0
- data/public/d3/test/core/selection-each-test.js +83 -0
- data/public/d3/test/core/selection-empty-test.js +51 -0
- data/public/d3/test/core/selection-filter-test.js +63 -0
- data/public/d3/test/core/selection-html-test.js +121 -0
- data/public/d3/test/core/selection-insert-test.js +132 -0
- data/public/d3/test/core/selection-map-test.js +47 -0
- data/public/d3/test/core/selection-node-test.js +50 -0
- data/public/d3/test/core/selection-on-test.js +95 -0
- data/public/d3/test/core/selection-property-test.js +91 -0
- data/public/d3/test/core/selection-remove-test.js +39 -0
- data/public/d3/test/core/selection-select-test.js +125 -0
- data/public/d3/test/core/selection-selectAll-test.js +127 -0
- data/public/d3/test/core/selection-sort-test.js +59 -0
- data/public/d3/test/core/selection-style-test.js +100 -0
- data/public/d3/test/core/selection-test.js +35 -0
- data/public/d3/test/core/selection-text-test.js +109 -0
- data/public/d3/test/core/split-test.js +34 -0
- data/public/d3/test/core/sum-test.js +47 -0
- data/public/d3/test/core/text-test.js +48 -0
- data/public/d3/test/core/timer-test.js +62 -0
- data/public/d3/test/core/transition-test-attr.js +33 -0
- data/public/d3/test/core/transition-test-attrTween.js +67 -0
- data/public/d3/test/core/transition-test-call.js +33 -0
- data/public/d3/test/core/transition-test-delay.js +41 -0
- data/public/d3/test/core/transition-test-duration.js +41 -0
- data/public/d3/test/core/transition-test-each.js +166 -0
- data/public/d3/test/core/transition-test-id.js +20 -0
- data/public/d3/test/core/transition-test-remove.js +46 -0
- data/public/d3/test/core/transition-test-select.js +63 -0
- data/public/d3/test/core/transition-test-selectAll.js +55 -0
- data/public/d3/test/core/transition-test-style.js +38 -0
- data/public/d3/test/core/transition-test-styleTween.js +73 -0
- data/public/d3/test/core/transition-test-text.js +30 -0
- data/public/d3/test/core/transition-test-transition.js +60 -0
- data/public/d3/test/core/transition-test-tween.js +71 -0
- data/public/d3/test/core/transition-test.js +65 -0
- data/public/d3/test/core/values-test.js +35 -0
- data/public/d3/test/core/version-test.js +18 -0
- data/public/d3/test/core/xhr-test.js +56 -0
- data/public/d3/test/core/xml-test.js +48 -0
- data/public/d3/test/core/zip-test.js +32 -0
- data/public/d3/test/csv/csv-test.js +38 -0
- data/public/d3/test/csv/format-test.js +39 -0
- data/public/d3/test/csv/parse-test.js +101 -0
- data/public/d3/test/env-assert.js +96 -0
- data/public/d3/test/env-fragment.js +8 -0
- data/public/d3/test/env-xhr.js +56 -0
- data/public/d3/test/env.js +13 -0
- data/public/d3/test/geo/albers-test.js +57 -0
- data/public/d3/test/geo/azimuthal-test.js +89 -0
- data/public/d3/test/geo/greatCircle-test.js +42 -0
- data/public/d3/test/geo/mercator-test.js +57 -0
- data/public/d3/test/layout/histogram-test.js +91 -0
- data/public/d3/test/layout/partition-test.js +39 -0
- data/public/d3/test/layout/tree-test.js +21 -0
- data/public/d3/test/layout/treemap-test.js +180 -0
- data/public/d3/test/scale/category-test.js +74 -0
- data/public/d3/test/scale/linear-test.js +239 -0
- data/public/d3/test/scale/log-test.js +220 -0
- data/public/d3/test/scale/ordinal-test.js +193 -0
- data/public/d3/test/scale/pow-test.js +259 -0
- data/public/d3/test/scale/quantile-test.js +64 -0
- data/public/d3/test/scale/quantize-test.js +69 -0
- data/public/d3/test/scale/sqrt-test.js +256 -0
- data/public/d3/test/svg/arc-test.js +147 -0
- data/public/d3/test/svg/area-radial-test.js +200 -0
- data/public/d3/test/svg/area-test.js +191 -0
- data/public/d3/test/svg/axis-test.js +347 -0
- data/public/d3/test/svg/line-radial-test.js +125 -0
- data/public/d3/test/svg/line-test.js +189 -0
- data/public/d3/test/svg/symbol-test.js +96 -0
- data/public/d3/test/time/day-test.js +65 -0
- data/public/d3/test/time/days-test.js +105 -0
- data/public/d3/test/time/format-test.js +430 -0
- data/public/d3/test/time/hour-test.js +103 -0
- data/public/d3/test/time/hours-test.js +135 -0
- data/public/d3/test/time/minute-test.js +43 -0
- data/public/d3/test/time/minutes-test.js +101 -0
- data/public/d3/test/time/month-test.js +53 -0
- data/public/d3/test/time/months-test.js +105 -0
- data/public/d3/test/time/scale-test.js +525 -0
- data/public/d3/test/time/second-test.js +41 -0
- data/public/d3/test/time/seconds-test.js +101 -0
- data/public/d3/test/time/week-test.js +59 -0
- data/public/d3/test/time/weeks-test.js +105 -0
- data/public/d3/test/time/year-test.js +41 -0
- data/public/d3/test/time/years-test.js +73 -0
- data/public/graph.js +42 -0
- data/public/jquery.min.js +4 -0
- data/public/test.html +36 -0
- data/public/testdata/bigfucker.js +212 -0
- data/public/testdata/names_and_enabled.js +232 -0
- data/public/testdata/one.js +79 -0
- data/public/testdata/withnames.js +198 -0
- data/public/viz.js +289 -0
- data/views/graph.erb +15 -0
- data/views/one.erb +34 -0
- data/views/two.erb +44 -0
- data/views/vis.erb +47 -0
- metadata +594 -18
- data/lib/bum.rb +0 -385
- data/lib/client.rb.erb +0 -7
- data/lib/dhcpd.rb +0 -84
- data/lib/hosts.rb +0 -61
- data/lib/vmx.rb +0 -24
@@ -0,0 +1,78 @@
|
|
1
|
+
/**
|
2
|
+
* Computes a contour for a given input grid function using the <a
|
3
|
+
* href="http://en.wikipedia.org/wiki/Marching_squares">marching
|
4
|
+
* squares</a> algorithm. Returns the contour polygon as an array of points.
|
5
|
+
*
|
6
|
+
* @param grid a two-input function(x, y) that returns true for values
|
7
|
+
* inside the contour and false for values outside the contour.
|
8
|
+
* @param start an optional starting point [x, y] on the grid.
|
9
|
+
* @returns polygon [[x1, y1], [x2, y2], …]
|
10
|
+
*/
|
11
|
+
d3.geom.contour = function(grid, start) {
|
12
|
+
var s = start || d3_geom_contourStart(grid), // starting point
|
13
|
+
c = [], // contour polygon
|
14
|
+
x = s[0], // current x position
|
15
|
+
y = s[1], // current y position
|
16
|
+
dx = 0, // next x direction
|
17
|
+
dy = 0, // next y direction
|
18
|
+
pdx = NaN, // previous x direction
|
19
|
+
pdy = NaN, // previous y direction
|
20
|
+
i = 0;
|
21
|
+
|
22
|
+
do {
|
23
|
+
// determine marching squares index
|
24
|
+
i = 0;
|
25
|
+
if (grid(x-1, y-1)) i += 1;
|
26
|
+
if (grid(x, y-1)) i += 2;
|
27
|
+
if (grid(x-1, y )) i += 4;
|
28
|
+
if (grid(x, y )) i += 8;
|
29
|
+
|
30
|
+
// determine next direction
|
31
|
+
if (i === 6) {
|
32
|
+
dx = pdy === -1 ? -1 : 1;
|
33
|
+
dy = 0;
|
34
|
+
} else if (i === 9) {
|
35
|
+
dx = 0;
|
36
|
+
dy = pdx === 1 ? -1 : 1;
|
37
|
+
} else {
|
38
|
+
dx = d3_geom_contourDx[i];
|
39
|
+
dy = d3_geom_contourDy[i];
|
40
|
+
}
|
41
|
+
|
42
|
+
// update contour polygon
|
43
|
+
if (dx != pdx && dy != pdy) {
|
44
|
+
c.push([x, y]);
|
45
|
+
pdx = dx;
|
46
|
+
pdy = dy;
|
47
|
+
}
|
48
|
+
|
49
|
+
x += dx;
|
50
|
+
y += dy;
|
51
|
+
} while (s[0] != x || s[1] != y);
|
52
|
+
|
53
|
+
return c;
|
54
|
+
};
|
55
|
+
|
56
|
+
// lookup tables for marching directions
|
57
|
+
var d3_geom_contourDx = [1, 0, 1, 1,-1, 0,-1, 1,0, 0,0,0,-1, 0,-1,NaN],
|
58
|
+
d3_geom_contourDy = [0,-1, 0, 0, 0,-1, 0, 0,1,-1,1,1, 0,-1, 0,NaN];
|
59
|
+
|
60
|
+
function d3_geom_contourStart(grid) {
|
61
|
+
var x = 0,
|
62
|
+
y = 0;
|
63
|
+
|
64
|
+
// search for a starting point; begin at origin
|
65
|
+
// and proceed along outward-expanding diagonals
|
66
|
+
while (true) {
|
67
|
+
if (grid(x,y)) {
|
68
|
+
return [x,y];
|
69
|
+
}
|
70
|
+
if (x === 0) {
|
71
|
+
x = y + 1;
|
72
|
+
y = 0;
|
73
|
+
} else {
|
74
|
+
x = x - 1;
|
75
|
+
y = y + 1;
|
76
|
+
}
|
77
|
+
}
|
78
|
+
}
|
@@ -0,0 +1,31 @@
|
|
1
|
+
/**
|
2
|
+
* @param vertices [[x1, y1], [x2, y2], …]
|
3
|
+
* @returns triangles [[[x1, y1], [x2, y2], [x3, y3]], …]
|
4
|
+
*/
|
5
|
+
d3.geom.delaunay = function(vertices) {
|
6
|
+
var edges = vertices.map(function() { return []; }),
|
7
|
+
triangles = [];
|
8
|
+
|
9
|
+
// Use the Voronoi tessellation to determine Delaunay edges.
|
10
|
+
d3_voronoi_tessellate(vertices, function(e) {
|
11
|
+
edges[e.region.l.index].push(vertices[e.region.r.index]);
|
12
|
+
});
|
13
|
+
|
14
|
+
// Reconnect the edges into counterclockwise triangles.
|
15
|
+
edges.forEach(function(edge, i) {
|
16
|
+
var v = vertices[i],
|
17
|
+
cx = v[0],
|
18
|
+
cy = v[1];
|
19
|
+
edge.forEach(function(v) {
|
20
|
+
v.angle = Math.atan2(v[0] - cx, v[1] - cy);
|
21
|
+
});
|
22
|
+
edge.sort(function(a, b) {
|
23
|
+
return a.angle - b.angle;
|
24
|
+
});
|
25
|
+
for (var j = 0, m = edge.length - 1; j < m; j++) {
|
26
|
+
triangles.push([v, edge[j], edge[j + 1]]);
|
27
|
+
}
|
28
|
+
});
|
29
|
+
|
30
|
+
return triangles;
|
31
|
+
};
|
@@ -0,0 +1 @@
|
|
1
|
+
d3.geom = {};
|
@@ -0,0 +1,98 @@
|
|
1
|
+
/**
|
2
|
+
* Computes the 2D convex hull of a set of points using Graham's scanning
|
3
|
+
* algorithm. The algorithm has been implemented as described in Cormen,
|
4
|
+
* Leiserson, and Rivest's Introduction to Algorithms. The running time of
|
5
|
+
* this algorithm is O(n log n), where n is the number of input points.
|
6
|
+
*
|
7
|
+
* @param vertices [[x1, y1], [x2, y2], …]
|
8
|
+
* @returns polygon [[x1, y1], [x2, y2], …]
|
9
|
+
*/
|
10
|
+
d3.geom.hull = function(vertices) {
|
11
|
+
if (vertices.length < 3) return [];
|
12
|
+
|
13
|
+
var len = vertices.length,
|
14
|
+
plen = len - 1,
|
15
|
+
points = [],
|
16
|
+
stack = [],
|
17
|
+
i, j, h = 0, x1, y1, x2, y2, u, v, a, sp;
|
18
|
+
|
19
|
+
// find the starting ref point: leftmost point with the minimum y coord
|
20
|
+
for (i=1; i<len; ++i) {
|
21
|
+
if (vertices[i][1] < vertices[h][1]) {
|
22
|
+
h = i;
|
23
|
+
} else if (vertices[i][1] == vertices[h][1]) {
|
24
|
+
h = (vertices[i][0] < vertices[h][0] ? i : h);
|
25
|
+
}
|
26
|
+
}
|
27
|
+
|
28
|
+
// calculate polar angles from ref point and sort
|
29
|
+
for (i=0; i<len; ++i) {
|
30
|
+
if (i === h) continue;
|
31
|
+
y1 = vertices[i][1] - vertices[h][1];
|
32
|
+
x1 = vertices[i][0] - vertices[h][0];
|
33
|
+
points.push({angle: Math.atan2(y1, x1), index: i});
|
34
|
+
}
|
35
|
+
points.sort(function(a, b) { return a.angle - b.angle; });
|
36
|
+
|
37
|
+
// toss out duplicate angles
|
38
|
+
a = points[0].angle;
|
39
|
+
v = points[0].index;
|
40
|
+
u = 0;
|
41
|
+
for (i=1; i<plen; ++i) {
|
42
|
+
j = points[i].index;
|
43
|
+
if (a == points[i].angle) {
|
44
|
+
// keep angle for point most distant from the reference
|
45
|
+
x1 = vertices[v][0] - vertices[h][0];
|
46
|
+
y1 = vertices[v][1] - vertices[h][1];
|
47
|
+
x2 = vertices[j][0] - vertices[h][0];
|
48
|
+
y2 = vertices[j][1] - vertices[h][1];
|
49
|
+
if ((x1*x1 + y1*y1) >= (x2*x2 + y2*y2)) {
|
50
|
+
points[i].index = -1;
|
51
|
+
} else {
|
52
|
+
points[u].index = -1;
|
53
|
+
a = points[i].angle;
|
54
|
+
u = i;
|
55
|
+
v = j;
|
56
|
+
}
|
57
|
+
} else {
|
58
|
+
a = points[i].angle;
|
59
|
+
u = i;
|
60
|
+
v = j;
|
61
|
+
}
|
62
|
+
}
|
63
|
+
|
64
|
+
// initialize the stack
|
65
|
+
stack.push(h);
|
66
|
+
for (i=0, j=0; i<2; ++j) {
|
67
|
+
if (points[j].index !== -1) {
|
68
|
+
stack.push(points[j].index);
|
69
|
+
i++;
|
70
|
+
}
|
71
|
+
}
|
72
|
+
sp = stack.length;
|
73
|
+
|
74
|
+
// do graham's scan
|
75
|
+
for (; j<plen; ++j) {
|
76
|
+
if (points[j].index === -1) continue; // skip tossed out points
|
77
|
+
while (!d3_geom_hullCCW(stack[sp-2], stack[sp-1], points[j].index, vertices)) {
|
78
|
+
--sp;
|
79
|
+
}
|
80
|
+
stack[sp++] = points[j].index;
|
81
|
+
}
|
82
|
+
|
83
|
+
// construct the hull
|
84
|
+
var poly = [];
|
85
|
+
for (i=0; i<sp; ++i) {
|
86
|
+
poly.push(vertices[stack[i]]);
|
87
|
+
}
|
88
|
+
return poly;
|
89
|
+
}
|
90
|
+
|
91
|
+
// are three points in counter-clockwise order?
|
92
|
+
function d3_geom_hullCCW(i1, i2, i3, v) {
|
93
|
+
var t, a, b, c, d, e, f;
|
94
|
+
t = v[i1]; a = t[0]; b = t[1];
|
95
|
+
t = v[i2]; c = t[0]; d = t[1];
|
96
|
+
t = v[i3]; e = t[0]; f = t[1];
|
97
|
+
return ((f-b)*(c-a) - (d-b)*(e-a)) > 0;
|
98
|
+
}
|
@@ -0,0 +1,88 @@
|
|
1
|
+
// Note: requires coordinates to be counterclockwise and convex!
|
2
|
+
d3.geom.polygon = function(coordinates) {
|
3
|
+
|
4
|
+
coordinates.area = function() {
|
5
|
+
var i = 0,
|
6
|
+
n = coordinates.length,
|
7
|
+
a = coordinates[n - 1][0] * coordinates[0][1],
|
8
|
+
b = coordinates[n - 1][1] * coordinates[0][0];
|
9
|
+
while (++i < n) {
|
10
|
+
a += coordinates[i - 1][0] * coordinates[i][1];
|
11
|
+
b += coordinates[i - 1][1] * coordinates[i][0];
|
12
|
+
}
|
13
|
+
return (b - a) * .5;
|
14
|
+
};
|
15
|
+
|
16
|
+
coordinates.centroid = function(k) {
|
17
|
+
var i = -1,
|
18
|
+
n = coordinates.length - 1,
|
19
|
+
x = 0,
|
20
|
+
y = 0,
|
21
|
+
a,
|
22
|
+
b,
|
23
|
+
c;
|
24
|
+
if (!arguments.length) k = 1 / (6 * coordinates.area());
|
25
|
+
while (++i < n) {
|
26
|
+
a = coordinates[i];
|
27
|
+
b = coordinates[i + 1];
|
28
|
+
c = a[0] * b[1] - b[0] * a[1];
|
29
|
+
x += (a[0] + b[0]) * c;
|
30
|
+
y += (a[1] + b[1]) * c;
|
31
|
+
}
|
32
|
+
return [x * k, y * k];
|
33
|
+
};
|
34
|
+
|
35
|
+
// The Sutherland-Hodgman clipping algorithm.
|
36
|
+
coordinates.clip = function(subject) {
|
37
|
+
var input,
|
38
|
+
i = -1,
|
39
|
+
n = coordinates.length,
|
40
|
+
j,
|
41
|
+
m,
|
42
|
+
a = coordinates[n - 1],
|
43
|
+
b,
|
44
|
+
c,
|
45
|
+
d;
|
46
|
+
while (++i < n) {
|
47
|
+
input = subject.slice();
|
48
|
+
subject.length = 0;
|
49
|
+
b = coordinates[i];
|
50
|
+
c = input[(m = input.length) - 1];
|
51
|
+
j = -1;
|
52
|
+
while (++j < m) {
|
53
|
+
d = input[j];
|
54
|
+
if (d3_geom_polygonInside(d, a, b)) {
|
55
|
+
if (!d3_geom_polygonInside(c, a, b)) {
|
56
|
+
subject.push(d3_geom_polygonIntersect(c, d, a, b));
|
57
|
+
}
|
58
|
+
subject.push(d);
|
59
|
+
} else if (d3_geom_polygonInside(c, a, b)) {
|
60
|
+
subject.push(d3_geom_polygonIntersect(c, d, a, b));
|
61
|
+
}
|
62
|
+
c = d;
|
63
|
+
}
|
64
|
+
a = b;
|
65
|
+
}
|
66
|
+
return subject;
|
67
|
+
};
|
68
|
+
|
69
|
+
return coordinates;
|
70
|
+
};
|
71
|
+
|
72
|
+
function d3_geom_polygonInside(p, a, b) {
|
73
|
+
return (b[0] - a[0]) * (p[1] - a[1]) < (b[1] - a[1]) * (p[0] - a[0]);
|
74
|
+
}
|
75
|
+
|
76
|
+
// Intersect two infinite lines cd and ab.
|
77
|
+
function d3_geom_polygonIntersect(c, d, a, b) {
|
78
|
+
var x1 = c[0], x2 = d[0], x3 = a[0], x4 = b[0],
|
79
|
+
y1 = c[1], y2 = d[1], y3 = a[1], y4 = b[1],
|
80
|
+
x13 = x1 - x3,
|
81
|
+
x21 = x2 - x1,
|
82
|
+
x43 = x4 - x3,
|
83
|
+
y13 = y1 - y3,
|
84
|
+
y21 = y2 - y1,
|
85
|
+
y43 = y4 - y3,
|
86
|
+
ua = (x43 * y13 - y43 * x13) / (y43 * x21 - x43 * y21);
|
87
|
+
return [x1 + ua * x21, y1 + ua * y21];
|
88
|
+
}
|
@@ -0,0 +1,129 @@
|
|
1
|
+
// Constructs a new quadtree for the specified array of points. A quadtree is a
|
2
|
+
// two-dimensional recursive spatial subdivision. This implementation uses
|
3
|
+
// square partitions, dividing each square into four equally-sized squares. Each
|
4
|
+
// point exists in a unique node; if multiple points are in the same position,
|
5
|
+
// some points may be stored on internal nodes rather than leaf nodes. Quadtrees
|
6
|
+
// can be used to accelerate various spatial operations, such as the Barnes-Hut
|
7
|
+
// approximation for computing n-body forces, or collision detection.
|
8
|
+
d3.geom.quadtree = function(points, x1, y1, x2, y2) {
|
9
|
+
var p,
|
10
|
+
i = -1,
|
11
|
+
n = points.length;
|
12
|
+
|
13
|
+
// Type conversion for deprecated API.
|
14
|
+
if (n && isNaN(points[0].x)) points = points.map(d3_geom_quadtreePoint);
|
15
|
+
|
16
|
+
// Allow bounds to be specified explicitly.
|
17
|
+
if (arguments.length < 5) {
|
18
|
+
if (arguments.length === 3) {
|
19
|
+
y2 = x2 = y1;
|
20
|
+
y1 = x1;
|
21
|
+
} else {
|
22
|
+
x1 = y1 = Infinity;
|
23
|
+
x2 = y2 = -Infinity;
|
24
|
+
|
25
|
+
// Compute bounds.
|
26
|
+
while (++i < n) {
|
27
|
+
p = points[i];
|
28
|
+
if (p.x < x1) x1 = p.x;
|
29
|
+
if (p.y < y1) y1 = p.y;
|
30
|
+
if (p.x > x2) x2 = p.x;
|
31
|
+
if (p.y > y2) y2 = p.y;
|
32
|
+
}
|
33
|
+
|
34
|
+
// Squarify the bounds.
|
35
|
+
var dx = x2 - x1,
|
36
|
+
dy = y2 - y1;
|
37
|
+
if (dx > dy) y2 = y1 + dx;
|
38
|
+
else x2 = x1 + dy;
|
39
|
+
}
|
40
|
+
}
|
41
|
+
|
42
|
+
// Recursively inserts the specified point p at the node n or one of its
|
43
|
+
// descendants. The bounds are defined by [x1, x2] and [y1, y2].
|
44
|
+
function insert(n, p, x1, y1, x2, y2) {
|
45
|
+
if (isNaN(p.x) || isNaN(p.y)) return; // ignore invalid points
|
46
|
+
if (n.leaf) {
|
47
|
+
var v = n.point;
|
48
|
+
if (v) {
|
49
|
+
// If the point at this leaf node is at the same position as the new
|
50
|
+
// point we are adding, we leave the point associated with the
|
51
|
+
// internal node while adding the new point to a child node. This
|
52
|
+
// avoids infinite recursion.
|
53
|
+
if ((Math.abs(v.x - p.x) + Math.abs(v.y - p.y)) < .01) {
|
54
|
+
insertChild(n, p, x1, y1, x2, y2);
|
55
|
+
} else {
|
56
|
+
n.point = null;
|
57
|
+
insertChild(n, v, x1, y1, x2, y2);
|
58
|
+
insertChild(n, p, x1, y1, x2, y2);
|
59
|
+
}
|
60
|
+
} else {
|
61
|
+
n.point = p;
|
62
|
+
}
|
63
|
+
} else {
|
64
|
+
insertChild(n, p, x1, y1, x2, y2);
|
65
|
+
}
|
66
|
+
}
|
67
|
+
|
68
|
+
// Recursively inserts the specified point p into a descendant of node n. The
|
69
|
+
// bounds are defined by [x1, x2] and [y1, y2].
|
70
|
+
function insertChild(n, p, x1, y1, x2, y2) {
|
71
|
+
// Compute the split point, and the quadrant in which to insert p.
|
72
|
+
var sx = (x1 + x2) * .5,
|
73
|
+
sy = (y1 + y2) * .5,
|
74
|
+
right = p.x >= sx,
|
75
|
+
bottom = p.y >= sy,
|
76
|
+
i = (bottom << 1) + right;
|
77
|
+
|
78
|
+
// Recursively insert into the child node.
|
79
|
+
n.leaf = false;
|
80
|
+
n = n.nodes[i] || (n.nodes[i] = d3_geom_quadtreeNode());
|
81
|
+
|
82
|
+
// Update the bounds as we recurse.
|
83
|
+
if (right) x1 = sx; else x2 = sx;
|
84
|
+
if (bottom) y1 = sy; else y2 = sy;
|
85
|
+
insert(n, p, x1, y1, x2, y2);
|
86
|
+
}
|
87
|
+
|
88
|
+
// Create the root node.
|
89
|
+
var root = d3_geom_quadtreeNode();
|
90
|
+
|
91
|
+
root.add = function(p) {
|
92
|
+
insert(root, p, x1, y1, x2, y2);
|
93
|
+
};
|
94
|
+
|
95
|
+
root.visit = function(f) {
|
96
|
+
d3_geom_quadtreeVisit(f, root, x1, y1, x2, y2);
|
97
|
+
};
|
98
|
+
|
99
|
+
// Insert all points.
|
100
|
+
points.forEach(root.add);
|
101
|
+
return root;
|
102
|
+
};
|
103
|
+
|
104
|
+
function d3_geom_quadtreeNode() {
|
105
|
+
return {
|
106
|
+
leaf: true,
|
107
|
+
nodes: [],
|
108
|
+
point: null
|
109
|
+
};
|
110
|
+
}
|
111
|
+
|
112
|
+
function d3_geom_quadtreeVisit(f, node, x1, y1, x2, y2) {
|
113
|
+
if (!f(node, x1, y1, x2, y2)) {
|
114
|
+
var sx = (x1 + x2) * .5,
|
115
|
+
sy = (y1 + y2) * .5,
|
116
|
+
children = node.nodes;
|
117
|
+
if (children[0]) d3_geom_quadtreeVisit(f, children[0], x1, y1, sx, sy);
|
118
|
+
if (children[1]) d3_geom_quadtreeVisit(f, children[1], sx, y1, x2, sy);
|
119
|
+
if (children[2]) d3_geom_quadtreeVisit(f, children[2], x1, sy, sx, y2);
|
120
|
+
if (children[3]) d3_geom_quadtreeVisit(f, children[3], sx, sy, x2, y2);
|
121
|
+
}
|
122
|
+
}
|
123
|
+
|
124
|
+
function d3_geom_quadtreePoint(p) {
|
125
|
+
return {
|
126
|
+
x: p[0],
|
127
|
+
y: p[1]
|
128
|
+
};
|
129
|
+
}
|
@@ -0,0 +1,399 @@
|
|
1
|
+
// Adapted from Nicolas Garcia Belmonte's JIT implementation:
|
2
|
+
// http://blog.thejit.org/2010/02/12/voronoi-tessellation/
|
3
|
+
// http://blog.thejit.org/assets/voronoijs/voronoi.js
|
4
|
+
// See lib/jit/LICENSE for details.
|
5
|
+
|
6
|
+
/**
|
7
|
+
* @param vertices [[x1, y1], [x2, y2], …]
|
8
|
+
* @returns polygons [[[x1, y1], [x2, y2], …], …]
|
9
|
+
*/
|
10
|
+
d3.geom.voronoi = function(vertices) {
|
11
|
+
var polygons = vertices.map(function() { return []; });
|
12
|
+
|
13
|
+
// Note: we expect the caller to clip the polygons, if needed.
|
14
|
+
d3_voronoi_tessellate(vertices, function(e) {
|
15
|
+
var s1,
|
16
|
+
s2,
|
17
|
+
x1,
|
18
|
+
x2,
|
19
|
+
y1,
|
20
|
+
y2;
|
21
|
+
if (e.a === 1 && e.b >= 0) {
|
22
|
+
s1 = e.ep.r;
|
23
|
+
s2 = e.ep.l;
|
24
|
+
} else {
|
25
|
+
s1 = e.ep.l;
|
26
|
+
s2 = e.ep.r;
|
27
|
+
}
|
28
|
+
if (e.a === 1) {
|
29
|
+
y1 = s1 ? s1.y : -1e6;
|
30
|
+
x1 = e.c - e.b * y1;
|
31
|
+
y2 = s2 ? s2.y : 1e6;
|
32
|
+
x2 = e.c - e.b * y2;
|
33
|
+
} else {
|
34
|
+
x1 = s1 ? s1.x : -1e6;
|
35
|
+
y1 = e.c - e.a * x1;
|
36
|
+
x2 = s2 ? s2.x : 1e6;
|
37
|
+
y2 = e.c - e.a * x2;
|
38
|
+
}
|
39
|
+
var v1 = [x1, y1],
|
40
|
+
v2 = [x2, y2];
|
41
|
+
polygons[e.region.l.index].push(v1, v2);
|
42
|
+
polygons[e.region.r.index].push(v1, v2);
|
43
|
+
});
|
44
|
+
|
45
|
+
// Reconnect the polygon segments into counterclockwise loops.
|
46
|
+
return polygons.map(function(polygon, i) {
|
47
|
+
var cx = vertices[i][0],
|
48
|
+
cy = vertices[i][1];
|
49
|
+
polygon.forEach(function(v) {
|
50
|
+
v.angle = Math.atan2(v[0] - cx, v[1] - cy);
|
51
|
+
});
|
52
|
+
return polygon.sort(function(a, b) {
|
53
|
+
return a.angle - b.angle;
|
54
|
+
}).filter(function(d, i) {
|
55
|
+
return !i || (d.angle - polygon[i - 1].angle > 1e-10);
|
56
|
+
});
|
57
|
+
});
|
58
|
+
};
|
59
|
+
|
60
|
+
var d3_voronoi_opposite = {"l": "r", "r": "l"};
|
61
|
+
|
62
|
+
function d3_voronoi_tessellate(vertices, callback) {
|
63
|
+
|
64
|
+
var Sites = {
|
65
|
+
list: vertices
|
66
|
+
.map(function(v, i) {
|
67
|
+
return {
|
68
|
+
index: i,
|
69
|
+
x: v[0],
|
70
|
+
y: v[1]
|
71
|
+
};
|
72
|
+
})
|
73
|
+
.sort(function(a, b) {
|
74
|
+
return a.y < b.y ? -1
|
75
|
+
: a.y > b.y ? 1
|
76
|
+
: a.x < b.x ? -1
|
77
|
+
: a.x > b.x ? 1
|
78
|
+
: 0;
|
79
|
+
}),
|
80
|
+
bottomSite: null
|
81
|
+
};
|
82
|
+
|
83
|
+
var EdgeList = {
|
84
|
+
list: [],
|
85
|
+
leftEnd: null,
|
86
|
+
rightEnd: null,
|
87
|
+
|
88
|
+
init: function() {
|
89
|
+
EdgeList.leftEnd = EdgeList.createHalfEdge(null, "l");
|
90
|
+
EdgeList.rightEnd = EdgeList.createHalfEdge(null, "l");
|
91
|
+
EdgeList.leftEnd.r = EdgeList.rightEnd;
|
92
|
+
EdgeList.rightEnd.l = EdgeList.leftEnd;
|
93
|
+
EdgeList.list.unshift(EdgeList.leftEnd, EdgeList.rightEnd);
|
94
|
+
},
|
95
|
+
|
96
|
+
createHalfEdge: function(edge, side) {
|
97
|
+
return {
|
98
|
+
edge: edge,
|
99
|
+
side: side,
|
100
|
+
vertex: null,
|
101
|
+
"l": null,
|
102
|
+
"r": null
|
103
|
+
};
|
104
|
+
},
|
105
|
+
|
106
|
+
insert: function(lb, he) {
|
107
|
+
he.l = lb;
|
108
|
+
he.r = lb.r;
|
109
|
+
lb.r.l = he;
|
110
|
+
lb.r = he;
|
111
|
+
},
|
112
|
+
|
113
|
+
leftBound: function(p) {
|
114
|
+
var he = EdgeList.leftEnd;
|
115
|
+
do {
|
116
|
+
he = he.r;
|
117
|
+
} while (he != EdgeList.rightEnd && Geom.rightOf(he, p));
|
118
|
+
he = he.l;
|
119
|
+
return he;
|
120
|
+
},
|
121
|
+
|
122
|
+
del: function(he) {
|
123
|
+
he.l.r = he.r;
|
124
|
+
he.r.l = he.l;
|
125
|
+
he.edge = null;
|
126
|
+
},
|
127
|
+
|
128
|
+
right: function(he) {
|
129
|
+
return he.r;
|
130
|
+
},
|
131
|
+
|
132
|
+
left: function(he) {
|
133
|
+
return he.l;
|
134
|
+
},
|
135
|
+
|
136
|
+
leftRegion: function(he) {
|
137
|
+
return he.edge == null
|
138
|
+
? Sites.bottomSite
|
139
|
+
: he.edge.region[he.side];
|
140
|
+
},
|
141
|
+
|
142
|
+
rightRegion: function(he) {
|
143
|
+
return he.edge == null
|
144
|
+
? Sites.bottomSite
|
145
|
+
: he.edge.region[d3_voronoi_opposite[he.side]];
|
146
|
+
}
|
147
|
+
};
|
148
|
+
|
149
|
+
var Geom = {
|
150
|
+
|
151
|
+
bisect: function(s1, s2) {
|
152
|
+
var newEdge = {
|
153
|
+
region: {"l": s1, "r": s2},
|
154
|
+
ep: {"l": null, "r": null}
|
155
|
+
};
|
156
|
+
|
157
|
+
var dx = s2.x - s1.x,
|
158
|
+
dy = s2.y - s1.y,
|
159
|
+
adx = dx > 0 ? dx : -dx,
|
160
|
+
ady = dy > 0 ? dy : -dy;
|
161
|
+
|
162
|
+
newEdge.c = s1.x * dx + s1.y * dy
|
163
|
+
+ (dx * dx + dy * dy) * .5;
|
164
|
+
|
165
|
+
if (adx > ady) {
|
166
|
+
newEdge.a = 1;
|
167
|
+
newEdge.b = dy / dx;
|
168
|
+
newEdge.c /= dx;
|
169
|
+
} else {
|
170
|
+
newEdge.b = 1;
|
171
|
+
newEdge.a = dx / dy;
|
172
|
+
newEdge.c /= dy;
|
173
|
+
}
|
174
|
+
|
175
|
+
return newEdge;
|
176
|
+
},
|
177
|
+
|
178
|
+
intersect: function(el1, el2) {
|
179
|
+
var e1 = el1.edge,
|
180
|
+
e2 = el2.edge;
|
181
|
+
if (!e1 || !e2 || (e1.region.r == e2.region.r)) {
|
182
|
+
return null;
|
183
|
+
}
|
184
|
+
var d = (e1.a * e2.b) - (e1.b * e2.a);
|
185
|
+
if (Math.abs(d) < 1e-10) {
|
186
|
+
return null;
|
187
|
+
}
|
188
|
+
var xint = (e1.c * e2.b - e2.c * e1.b) / d,
|
189
|
+
yint = (e2.c * e1.a - e1.c * e2.a) / d,
|
190
|
+
e1r = e1.region.r,
|
191
|
+
e2r = e2.region.r,
|
192
|
+
el,
|
193
|
+
e;
|
194
|
+
if ((e1r.y < e2r.y) ||
|
195
|
+
(e1r.y == e2r.y && e1r.x < e2r.x)) {
|
196
|
+
el = el1;
|
197
|
+
e = e1;
|
198
|
+
} else {
|
199
|
+
el = el2;
|
200
|
+
e = e2;
|
201
|
+
}
|
202
|
+
var rightOfSite = (xint >= e.region.r.x);
|
203
|
+
if ((rightOfSite && (el.side === "l")) ||
|
204
|
+
(!rightOfSite && (el.side === "r"))) {
|
205
|
+
return null;
|
206
|
+
}
|
207
|
+
return {
|
208
|
+
x: xint,
|
209
|
+
y: yint
|
210
|
+
};
|
211
|
+
},
|
212
|
+
|
213
|
+
rightOf: function(he, p) {
|
214
|
+
var e = he.edge,
|
215
|
+
topsite = e.region.r,
|
216
|
+
rightOfSite = (p.x > topsite.x);
|
217
|
+
|
218
|
+
if (rightOfSite && (he.side === "l")) {
|
219
|
+
return 1;
|
220
|
+
}
|
221
|
+
if (!rightOfSite && (he.side === "r")) {
|
222
|
+
return 0;
|
223
|
+
}
|
224
|
+
if (e.a === 1) {
|
225
|
+
var dyp = p.y - topsite.y,
|
226
|
+
dxp = p.x - topsite.x,
|
227
|
+
fast = 0,
|
228
|
+
above = 0;
|
229
|
+
|
230
|
+
if ((!rightOfSite && (e.b < 0)) ||
|
231
|
+
(rightOfSite && (e.b >= 0))) {
|
232
|
+
above = fast = (dyp >= e.b * dxp);
|
233
|
+
} else {
|
234
|
+
above = ((p.x + p.y * e.b) > e.c);
|
235
|
+
if (e.b < 0) {
|
236
|
+
above = !above;
|
237
|
+
}
|
238
|
+
if (!above) {
|
239
|
+
fast = 1;
|
240
|
+
}
|
241
|
+
}
|
242
|
+
if (!fast) {
|
243
|
+
var dxs = topsite.x - e.region.l.x;
|
244
|
+
above = (e.b * (dxp * dxp - dyp * dyp)) <
|
245
|
+
(dxs * dyp * (1 + 2 * dxp / dxs + e.b * e.b));
|
246
|
+
|
247
|
+
if (e.b < 0) {
|
248
|
+
above = !above;
|
249
|
+
}
|
250
|
+
}
|
251
|
+
} else /* e.b == 1 */ {
|
252
|
+
var yl = e.c - e.a * p.x,
|
253
|
+
t1 = p.y - yl,
|
254
|
+
t2 = p.x - topsite.x,
|
255
|
+
t3 = yl - topsite.y;
|
256
|
+
|
257
|
+
above = (t1 * t1) > (t2 * t2 + t3 * t3);
|
258
|
+
}
|
259
|
+
return he.side === "l" ? above : !above;
|
260
|
+
},
|
261
|
+
|
262
|
+
endPoint: function(edge, side, site) {
|
263
|
+
edge.ep[side] = site;
|
264
|
+
if (!edge.ep[d3_voronoi_opposite[side]]) return;
|
265
|
+
callback(edge);
|
266
|
+
},
|
267
|
+
|
268
|
+
distance: function(s, t) {
|
269
|
+
var dx = s.x - t.x,
|
270
|
+
dy = s.y - t.y;
|
271
|
+
return Math.sqrt(dx * dx + dy * dy);
|
272
|
+
}
|
273
|
+
};
|
274
|
+
|
275
|
+
var EventQueue = {
|
276
|
+
list: [],
|
277
|
+
|
278
|
+
insert: function(he, site, offset) {
|
279
|
+
he.vertex = site;
|
280
|
+
he.ystar = site.y + offset;
|
281
|
+
for (var i=0, list=EventQueue.list, l=list.length; i<l; i++) {
|
282
|
+
var next = list[i];
|
283
|
+
if (he.ystar > next.ystar ||
|
284
|
+
(he.ystar == next.ystar &&
|
285
|
+
site.x > next.vertex.x)) {
|
286
|
+
continue;
|
287
|
+
} else {
|
288
|
+
break;
|
289
|
+
}
|
290
|
+
}
|
291
|
+
list.splice(i, 0, he);
|
292
|
+
},
|
293
|
+
|
294
|
+
del: function(he) {
|
295
|
+
for (var i=0, ls=EventQueue.list, l=ls.length; i<l && (ls[i] != he); ++i) {}
|
296
|
+
ls.splice(i, 1);
|
297
|
+
},
|
298
|
+
|
299
|
+
empty: function() { return EventQueue.list.length === 0; },
|
300
|
+
|
301
|
+
nextEvent: function(he) {
|
302
|
+
for (var i=0, ls=EventQueue.list, l=ls.length; i<l; ++i) {
|
303
|
+
if (ls[i] == he) return ls[i+1];
|
304
|
+
}
|
305
|
+
return null;
|
306
|
+
},
|
307
|
+
|
308
|
+
min: function() {
|
309
|
+
var elem = EventQueue.list[0];
|
310
|
+
return {
|
311
|
+
x: elem.vertex.x,
|
312
|
+
y: elem.ystar
|
313
|
+
};
|
314
|
+
},
|
315
|
+
|
316
|
+
extractMin: function() {
|
317
|
+
return EventQueue.list.shift();
|
318
|
+
}
|
319
|
+
};
|
320
|
+
|
321
|
+
EdgeList.init();
|
322
|
+
Sites.bottomSite = Sites.list.shift();
|
323
|
+
|
324
|
+
var newSite = Sites.list.shift(), newIntStar;
|
325
|
+
var lbnd, rbnd, llbnd, rrbnd, bisector;
|
326
|
+
var bot, top, temp, p, v;
|
327
|
+
var e, pm;
|
328
|
+
|
329
|
+
while (true) {
|
330
|
+
if (!EventQueue.empty()) {
|
331
|
+
newIntStar = EventQueue.min();
|
332
|
+
}
|
333
|
+
if (newSite && (EventQueue.empty()
|
334
|
+
|| newSite.y < newIntStar.y
|
335
|
+
|| (newSite.y == newIntStar.y
|
336
|
+
&& newSite.x < newIntStar.x))) { //new site is smallest
|
337
|
+
lbnd = EdgeList.leftBound(newSite);
|
338
|
+
rbnd = EdgeList.right(lbnd);
|
339
|
+
bot = EdgeList.rightRegion(lbnd);
|
340
|
+
e = Geom.bisect(bot, newSite);
|
341
|
+
bisector = EdgeList.createHalfEdge(e, "l");
|
342
|
+
EdgeList.insert(lbnd, bisector);
|
343
|
+
p = Geom.intersect(lbnd, bisector);
|
344
|
+
if (p) {
|
345
|
+
EventQueue.del(lbnd);
|
346
|
+
EventQueue.insert(lbnd, p, Geom.distance(p, newSite));
|
347
|
+
}
|
348
|
+
lbnd = bisector;
|
349
|
+
bisector = EdgeList.createHalfEdge(e, "r");
|
350
|
+
EdgeList.insert(lbnd, bisector);
|
351
|
+
p = Geom.intersect(bisector, rbnd);
|
352
|
+
if (p) {
|
353
|
+
EventQueue.insert(bisector, p, Geom.distance(p, newSite));
|
354
|
+
}
|
355
|
+
newSite = Sites.list.shift();
|
356
|
+
} else if (!EventQueue.empty()) { //intersection is smallest
|
357
|
+
lbnd = EventQueue.extractMin();
|
358
|
+
llbnd = EdgeList.left(lbnd);
|
359
|
+
rbnd = EdgeList.right(lbnd);
|
360
|
+
rrbnd = EdgeList.right(rbnd);
|
361
|
+
bot = EdgeList.leftRegion(lbnd);
|
362
|
+
top = EdgeList.rightRegion(rbnd);
|
363
|
+
v = lbnd.vertex;
|
364
|
+
Geom.endPoint(lbnd.edge, lbnd.side, v);
|
365
|
+
Geom.endPoint(rbnd.edge, rbnd.side, v);
|
366
|
+
EdgeList.del(lbnd);
|
367
|
+
EventQueue.del(rbnd);
|
368
|
+
EdgeList.del(rbnd);
|
369
|
+
pm = "l";
|
370
|
+
if (bot.y > top.y) {
|
371
|
+
temp = bot;
|
372
|
+
bot = top;
|
373
|
+
top = temp;
|
374
|
+
pm = "r";
|
375
|
+
}
|
376
|
+
e = Geom.bisect(bot, top);
|
377
|
+
bisector = EdgeList.createHalfEdge(e, pm);
|
378
|
+
EdgeList.insert(llbnd, bisector);
|
379
|
+
Geom.endPoint(e, d3_voronoi_opposite[pm], v);
|
380
|
+
p = Geom.intersect(llbnd, bisector);
|
381
|
+
if (p) {
|
382
|
+
EventQueue.del(llbnd);
|
383
|
+
EventQueue.insert(llbnd, p, Geom.distance(p, bot));
|
384
|
+
}
|
385
|
+
p = Geom.intersect(bisector, rrbnd);
|
386
|
+
if (p) {
|
387
|
+
EventQueue.insert(bisector, p, Geom.distance(p, bot));
|
388
|
+
}
|
389
|
+
} else {
|
390
|
+
break;
|
391
|
+
}
|
392
|
+
}//end while
|
393
|
+
|
394
|
+
for (lbnd = EdgeList.right(EdgeList.leftEnd);
|
395
|
+
lbnd != EdgeList.rightEnd;
|
396
|
+
lbnd = EdgeList.right(lbnd)) {
|
397
|
+
callback(lbnd.edge);
|
398
|
+
}
|
399
|
+
}
|