Commit 9ffaccce0fe84490e2adff9fef76b363274aa27c
docs(readme): add Greenkeeper badge
greenkeeper[bot] committed on 10/3/2017, 10:18:28 PMParent: 02e38f26cc47e190ae4171ada653feb7154f1161
Files changed
README.md | changed |
README.md | |||
---|---|---|---|
@@ -4,8 +4,10 @@ | |||
4 | 4 … | ||
5 | 5 … | [![js-standard-style](https://cdn.rawgit.com/feross/standard/master/badge.svg)](https://github.com/feross/standard) | |
6 | 6 … | ||
7 | 7 … | # SYNOPSIS | |
8 … | + | ||
9 … | +[![Greenkeeper badge](https://badges.greenkeeper.io/dfinity/js-dfinity-radix-tree.svg)](https://greenkeeper.io/) | ||
8 | 10 … | This implements a binary merkle radix tree. The point of using a binary radix | |
9 | 11 … | tree is that it generates smaller proof size then trees with larger radixes. | |
10 | 12 … | This tree is well suited for storing large dictonaries of fairly random keys. | |
11 | 13 … | And is optimized for storing keys of the same length. If the keys are not |
Built with git-ssb-web