git ssb

0+

wanderer🌟 / js-dfinity-radix-tree



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.mdchanged
package.jsonchanged
README.mdView
@@ -4,8 +4,9 @@
44
55 [![js-standard-style](https://cdn.rawgit.com/feross/standard/master/badge.svg)](https://github.com/feross/standard)
66
77 # SYNOPSIS
8 +
89 This implements a binary merkle radix tree. The point of using a binary radix
910 tree is that it generates smaller proof size then trees with larger radixes.
1011 This tree is well suited for storing large dictonaries of fairly random keys.
1112 And is optimized for storing keys of the same length. If the keys are not
package.jsonView
@@ -27,9 +27,9 @@
2727 "tape": "^4.6.3"
2828 },
2929 "dependencies": {
3030 "ipld-graph-builder": "^1.3.3",
31- "leb128": "0.0.2",
31 + "leb128": "0.0.3",
3232 "node-webcrypto-shim": "0.0.0",
3333 "safe-buffer": "^5.1.1",
3434 "text-encoding": "^0.6.4",
3535 "uint1array": "^1.0.5"

Built with git-ssb-web