{
  "name": "prolly-trees",
  "version": "1.0.4",
  "scripts": {
    "lint": "standard",
    "lint:fix": "standard --fix",
    "build": "npm_config_yes=true npx ipjs@latest build --tests",
    "publish": "npm_config_yes=true npx ipjs@latest publish",
    "test:node-v12": "mocha test/test-*.js",
    "test:watch": "mocha test/test-*.js --watch --parallel",
    "test:cjs": "npm run build && mocha dist/cjs/node-test/test-*.js",
    "test:node": "hundreds mocha test/test-*.js",
    "test:browser": "polendina --cleanup dist/cjs/node-test/test-*.js --webpack-config test/polendina-webpack.config.cjs",
    "test": "npm run lint && npm run test:node && npm run test:cjs && npm run test:browser",
    "coverage": "c8 --reporter=html mocha test/test-*.js && npm_config_yes=true npx st -d coverage -p 8080",
    "coverage:grep": "c8 --reporter=html mocha test/test-*.js -- --grep 'decreasing logic' && npm_config_yes=true npx st -d coverage -p 8080"
  },
  "keywords": [],
  "author": "Mikeal Rogers <mikeal.rogers@gmail.com> (https://www.mikealrogers.com/)",
  "license": "(Apache-2.0 AND MIT)",
  "description": "Implementation of [peer-to-peer b-trees](https://0fps.net/2020/12/19/peer-to-peer-ordered-search-indexes/) which are [prolly trees](https://www.dolthub.com/blog/2020-04-01-how-dolt-stores-table-data/) as used in dolt and noms.",
  "devDependencies": {
    "@ipld/dag-cbor": "^2.0.3",
    "assert-polyfill": "^0.0.0",
    "c8": "^7.3.5",
    "hundreds": "^0.0.9",
    "mocha": "^8.2.1",
    "multiformats": "^4.4.1",
    "polendina": "^3.0.0",
    "node-polyfill-webpack-plugin": "^1.1.4",
    "standard": "^16.0.3"
  },
  "dependencies": {
    "bl": "^4.0.3",
    "node-sql-parser": "^3.1.0"
  },
  "exports": {
    "./cache": {
      "browser": "./esm/src/cache.js",
      "require": "./cjs/src/cache.js",
      "import": "./esm/src/cache.js"
    },
    "./cid-set": {
      "browser": "./esm/src/cid-set.js",
      "require": "./cjs/src/cid-set.js",
      "import": "./esm/src/cid-set.js"
    },
    "./map": {
      "browser": "./esm/src/map.js",
      "require": "./cjs/src/map.js",
      "import": "./esm/src/map.js"
    },
    "./sparse-array": {
      "browser": "./esm/src/sparse-array.js",
      "require": "./cjs/src/sparse-array.js",
      "import": "./esm/src/sparse-array.js"
    },
    "./db-index": {
      "browser": "./esm/src/db-index.js",
      "require": "./cjs/src/db-index.js",
      "import": "./esm/src/db-index.js"
    },
    "./utils": {
      "browser": "./esm/src/utils.js",
      "require": "./cjs/src/utils.js",
      "import": "./esm/src/utils.js"
    }
  },
  "directories": {
    "test": "test"
  },
  "repository": {
    "type": "git",
    "url": "git+https://github.com/mikeal/prolly-trees.git"
  },
  "bugs": {
    "url": "https://github.com/mikeal/prolly-trees/issues"
  },
  "homepage": "https://github.com/mikeal/prolly-trees#readme",
  "browser": {
    "./cache": "./cjs/src/cache.js",
    "./cid-set": "./cjs/src/cid-set.js",
    "./map": "./cjs/src/map.js",
    "./sparse-array": "./cjs/src/sparse-array.js",
    "./db-index": "./cjs/src/db-index.js",
    "./utils": "./cjs/src/utils.js"
  }
}