{"bugs":{"url":"https://github.com/mikolalysenko/functional-red-black-tree/issues"},"dist":{"shasum":"1b0ab3bd553b2a0d6399d29c0e3ea0b252078327","tarball":"https://registry.npmjs.org/functional-red-black-tree/-/functional-red-black-tree-1.0.1.tgz","integrity":"sha512-dsKNQNdj6xA3T+QlADDA7mOSlX0qiMINjn0cgr+eGHGsbSHzTabcIogz2+p/iqP1Xs6EP/sS2SbqH+brGTbq0g==","signatures":[{"sig":"MEUCIQDUTWhqirmVXiAiH9PgGfFD8sl+ycPZoGA1GJDlsTM13wIgWBoErhz2vXwkPmEa1eUFJWPpdDi3QWBCE3V/+1Hntp0=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"rbtree.js","name":"functional-red-black-tree","_from":".","author":{"name":"Mikola Lysenko"},"license":"MIT","scripts":{"test":"tape test/*.js"},"_npmUser":{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"},"homepage":"https://github.com/mikolalysenko/functional-red-black-tree","keywords":["functional","red","black","tree","binary","search","balance","persistent","fully","dynamic","data","structure"],"repository":{"url":"git://github.com/mikolalysenko/functional-red-black-tree.git","type":"git"},"_npmVersion":"1.4.3","description":"A fully persistent balanced binary search tree","directories":{"test":"test"},"maintainers":[{"name":"mikolalysenko","email":"mikolalysenko@gmail.com"}],"dependencies":{},"devDependencies":{"tape":"^2.12.0","iota-array":"^0.0.1"},"_id":"functional-red-black-tree@1.0.1","version":"1.0.1"}