From 02e38f26cc47e190ae4171ada653feb7154f1161 Mon Sep 17 00:00:00 2001 From: "greenkeeper[bot]" Date: Tue, 3 Oct 2017 22:09:32 +0000 Subject: [PATCH 1/3] chore(package): update dependencies --- package.json | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/package.json b/package.json index 4122928..ce36a20 100644 --- a/package.json +++ b/package.json @@ -27,7 +27,7 @@ }, "dependencies": { "ipld-graph-builder": "^1.3.3", - "leb128": "0.0.2", + "leb128": "0.0.3", "node-webcrypto-shim": "0.0.0", "safe-buffer": "^5.1.1", "text-encoding": "^0.6.4", From 9ffaccce0fe84490e2adff9fef76b363274aa27c Mon Sep 17 00:00:00 2001 From: "greenkeeper[bot]" Date: Tue, 3 Oct 2017 22:18:28 +0000 Subject: [PATCH 2/3] docs(readme): add Greenkeeper badge --- README.md | 2 ++ 1 file changed, 2 insertions(+) diff --git a/README.md b/README.md index 8bf78a9..410bcf7 100644 --- a/README.md +++ b/README.md @@ -5,6 +5,8 @@ [![js-standard-style](https://cdn.rawgit.com/feross/standard/master/badge.svg)](https://github.com/feross/standard) # SYNOPSIS + +[![Greenkeeper badge](https://badges.greenkeeper.io/dfinity/js-dfinity-radix-tree.svg)](https://greenkeeper.io/) This implements a binary merkle radix tree. The point of using a binary radix tree is that it generates smaller proof size then trees with larger radixes. This tree is well suited for storing large dictonaries of fairly random keys. From 4eae03c4209ad03be025daa4ee56d39c7ad24526 Mon Sep 17 00:00:00 2001 From: wanderer Date: Tue, 3 Oct 2017 23:13:33 -0400 Subject: [PATCH 3/3] Update README.md --- README.md | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/README.md b/README.md index 410bcf7..47b1e98 100644 --- a/README.md +++ b/README.md @@ -5,8 +5,7 @@ [![js-standard-style](https://cdn.rawgit.com/feross/standard/master/badge.svg)](https://github.com/feross/standard) # SYNOPSIS - -[![Greenkeeper badge](https://badges.greenkeeper.io/dfinity/js-dfinity-radix-tree.svg)](https://greenkeeper.io/) + This implements a binary merkle radix tree. The point of using a binary radix tree is that it generates smaller proof size then trees with larger radixes. This tree is well suited for storing large dictonaries of fairly random keys.