git ssb

0+

wanderer🌟 / js-dfinity-radix-tree



Commit 4eae03c4209ad03be025daa4ee56d39c7ad24526

Update README.md

wanderer authored on 10/4/2017, 3:13:33 AM
GitHub committed on 10/4/2017, 3:13:33 AM
Parent: 9ffaccce0fe84490e2adff9fef76b363274aa27c

Files changed

README.mdchanged
README.mdView
@@ -4,10 +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-
9-[![Greenkeeper badge](https://badges.greenkeeper.io/dfinity/js-dfinity-radix-tree.svg)](https://greenkeeper.io/)
8 +
109 This implements a binary merkle radix tree. The point of using a binary radix
1110 tree is that it generates smaller proof size then trees with larger radixes.
1211 This tree is well suited for storing large dictonaries of fairly random keys.
1312 And is optimized for storing keys of the same length. If the keys are not

Built with git-ssb-web