1 | {
|
2 | "name": "functional-red-black-tree",
|
3 | "version": "1.0.1",
|
4 | "description": "A fully persistent balanced binary search tree",
|
5 | "main": "rbtree.js",
|
6 | "directories": {
|
7 | "test": "test"
|
8 | },
|
9 | "dependencies": {},
|
10 | "devDependencies": {
|
11 | "iota-array": "^0.0.1",
|
12 | "tape": "^2.12.0"
|
13 | },
|
14 | "scripts": {
|
15 | "test": "tape test/*.js"
|
16 | },
|
17 | "repository": {
|
18 | "type": "git",
|
19 | "url": "git://github.com/mikolalysenko/functional-red-black-tree.git"
|
20 | },
|
21 | "keywords": [
|
22 | "functional",
|
23 | "red",
|
24 | "black",
|
25 | "tree",
|
26 | "binary",
|
27 | "search",
|
28 | "balance",
|
29 | "persistent",
|
30 | "fully",
|
31 | "dynamic",
|
32 | "data",
|
33 | "structure"
|
34 | ],
|
35 | "author": "Mikola Lysenko",
|
36 | "license": "MIT",
|
37 | "bugs": {
|
38 | "url": "https://github.com/mikolalysenko/functional-red-black-tree/issues"
|
39 | }
|
40 | }
|