package.json

{
  "name": "linear-partitioning",
  "version": "0.3.2",
  "description": "Given an array of numbers, partition them into a number of buckets, preserving order, where the ranges of each bucket are as close as possible.",
  "main": "index.js",
  "dependencies": {},
  "devDependencies": {
    "bench": "0.3.6",
    "faucet": "0.0.1",
    "tape": "4.6.3"
  },
  "scripts": {
    "test": "tape test | faucet"
  },
  "repository": {
    "type": "git",
    "url": "https://github.com/jayrbolton/linear-partitioning.git"
  },
  "keywords": [
    "linear",
    "partition",
    "algorithm",
    "buckets"
  ],
  "author": "jay r bolton <jayrbolton@gmail.com> (http://jayrbolton.com/)",
  "license": "MIT",
  "bugs": {
    "url": "https://github.com/jayrbolton/linear-partitioning/issues"
  }
}