{ "name": "dfinity-radix-tree", "version": "0.0.7", "description": "This implements a binary merkle radix tree", "main": "index.js", "scripts": { "coveralls": "npm run coverage && nyc report --reporter=text-lcov | coveralls", "coverage": "nyc npm test", "lint": "standard", "test": "node ./tests/index.js", "build:docs": "documentation build ./index.js --github --sort-order source -f md > ./docs/index.md" }, "author": "mjbecze ", "license": "MPL-2.0", "keywords": [ "merkle", "tree", "ipfs", "dfinity" ], "devDependencies": { "coveralls": "^3.0.0", "documentation": "^5.1.1", "level-browserify": "^1.1.1", "nyc": "^11.3.0", "standard": "^10.0.0", "tape": "^4.6.3" }, "dependencies": { "buffer-pipe": "0.0.0", "ipld-graph-builder": "^1.3.5", "leb128": "0.0.4", "node-webcrypto-shim": "0.0.0", "safe-buffer": "^5.1.1", "text-encoding": "^0.6.4", "uint1array": "^1.0.5" }, "standard": { "ignore": [ "/benchmark/" ] }, "bugs": { "url": "https://github.com/dfinity/js-dfinity-radix-tree/issues" }, "repository": { "type": "git", "url": "git+https://github.com/dfinity/js-dfinity-radix-tree.git" } }