README.mdView |
---|
1 | | -[![NPM Package](https://img.shields.io/npm/v/merkle-radix-tree.svg?style=flat-square)](https://www.npmjs.org/package/merkle-radix-tree)
|
2 | | -[![Build Status](https://img.shields.io/travis/primea/js-primea-radix-tree.svg?branch=master&style=flat-square)](https://travis-ci.org/primea/js-primea-radix-tree)
|
3 | | -[![Coverage Status](https://img.shields.io/coveralls/primea/js-primea-radix-tree.svg?style=flat-square)](https://coveralls.io/primea/js-primea-radix-tree)
|
| 1 … | +[![NPM Package](https://img.shields.io/npm/v/dfinit-radix-tree.svg?style=flat-square)](https://www.npmjs.org/package/dfinity-radix-tree)
|
| 2 … | +[![Build Status](https://img.shields.io/travis/primea/js-dfinity-radix-tree.svg?branch=master&style=flat-square)](https://travis-ci.org/primea/js-dfinity-radix-tree)
|
| 3 … | +[![Coverage Status](https://img.shields.io/coveralls/primea/js-dfinity-radix-tree.svg?style=flat-square)](https://coveralls.io/primea/js-dfinity-radix-tree)
|
4 | 4 … |
|
5 | 5 … | [![js-standard-style](https://cdn.rawgit.com/feross/standard/master/badge.svg)](https://github.com/feross/standard)
|
6 | 6 … |
|
7 | | -# install
|
8 | | -`npm install js-dfinity-radix-tree`
|
9 | | -
|
10 | 7 … | # SYNOPSIS
|
11 | 8 … | This implements a binary merkle radix tree. The point of using a binary radix
|
12 | 9 … | tree is that it generates smaller proof size then trees with larger radixes.
|
13 | 10 … | This tree is well suited for storing large dictonaries of fairly random keys.
|
16 | 13 … | top of [ipld-graph-builder](https://github.com/ipld/js-ipld-graph-builder)
|
17 | 14 … | and the resulting state and proofs are generated using it.
|
18 | 15 … |
|
19 | 16 … | # INSTALL
|
20 | | -`npm install js-dfinity-radix-tree`
|
| 17 … | +`npm install dfinity-radix-tree`
|
21 | 18 … |
|
22 | 19 … | # USAGE
|
23 | 20 … |
|
24 | 21 … | ```javascript
|