Commit 41d856e209658485fcf9b1adaa49cada3e75c9de
Merge pull request #1 from dfinity/greenkeeper/initial
Update dependencies to enable Greenkeeper 🌴wanderer authored on 10/4/2017, 3:14:18 AM
GitHub committed on 10/4/2017, 3:14:18 AM
Parent: 80ba1b70430a3d5e8d24953cec12b5d28f71ae9d
Parent: 4eae03c4209ad03be025daa4ee56d39c7ad24526
Files changed
| README.md | changed |
| package.json | changed |
| README.md | |||
|---|---|---|---|
| @@ -4,8 +4,9 @@ | |||
| 4 | 4 … | ||
| 5 | 5 … | [](https://github.com/feross/standard) | |
| 6 | 6 … | ||
| 7 | 7 … | # SYNOPSIS | |
| 8 … | + | ||
| 8 | 9 … | This implements a binary merkle radix tree. The point of using a binary radix | |
| 9 | 10 … | tree is that it generates smaller proof size then trees with larger radixes. | |
| 10 | 11 … | This tree is well suited for storing large dictonaries of fairly random keys. | |
| 11 | 12 … | And is optimized for storing keys of the same length. If the keys are not | |
| package.json | ||
|---|---|---|
| @@ -27,9 +27,9 @@ | ||
| 27 | 27 … | "tape": "^4.6.3" |
| 28 | 28 … | }, |
| 29 | 29 … | "dependencies": { |
| 30 | 30 … | "ipld-graph-builder": "^1.3.3", |
| 31 | - "leb128": "0.0.2", | |
| 31 … | + "leb128": "0.0.3", | |
| 32 | 32 … | "node-webcrypto-shim": "0.0.0", |
| 33 | 33 … | "safe-buffer": "^5.1.1", |
| 34 | 34 … | "text-encoding": "^0.6.4", |
| 35 | 35 … | "uint1array": "^1.0.5" |
Built with git-ssb-web