git ssb

0+

wanderer🌟 / js-dfinity-radix-tree



Commit 9ffaccce0fe84490e2adff9fef76b363274aa27c

docs(readme): add Greenkeeper badge

greenkeeper[bot] committed on 10/3/2017, 10:18:28 PM
Parent: 02e38f26cc47e190ae4171ada653feb7154f1161

Files changed

README.mdchanged
README.mdView
@@ -4,8 +4,10 @@
44
55 [![js-standard-style](https://cdn.rawgit.com/feross/standard/master/badge.svg)](https://github.com/feross/standard)
66
77 # SYNOPSIS
8 +
9 +[![Greenkeeper badge](https://badges.greenkeeper.io/dfinity/js-dfinity-radix-tree.svg)](https://greenkeeper.io/)
810 This implements a binary merkle radix tree. The point of using a binary radix
911 tree is that it generates smaller proof size then trees with larger radixes.
1012 This tree is well suited for storing large dictonaries of fairly random keys.
1113 And is optimized for storing keys of the same length. If the keys are not

Built with git-ssb-web