{"_id":"@ekliptor/bintrees-local","_rev":"10-22a049ce800f2e7fd8440d23657e7a6e","name":"@ekliptor/bintrees-local","description":"Binary Search Trees","dist-tags":{"latest":"1.0.9"},"versions":{"1.0.2":{"author":{"name":"Vadim Graboys","email":"dimva13@gmail.com"},"name":"@ekliptor/bintrees-local","description":"Binary Search Trees","version":"1.0.2","keywords":["binary tree","red black tree","red-black tree","redblack tree"],"license":"MIT","main":"./index.js","scripts":{"test":"nodeunit ./test/test_*.js && jshint lib/*.js index.js"},"dependencies":{},"devDependencies":{"nodeunit":"0.9.1","jshint":"0.5.9","underscore":"1.3.1","reunion":"0.0.0"},"licenseText":"Copyright (C) 2011 by Vadim Graboys\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n","_id":"@ekliptor/bintrees-local@1.0.2","dist":{"shasum":"c778e521adef05831cf8601255b4657003db075c","tarball":"https://registry.npmjs.org/@ekliptor/bintrees-local/-/bintrees-local-1.0.2.tgz","integrity":"sha512-XlwAFT9oARijFxhRyrKcAuodnJ+UgIG0lw/Vkf/ODqi8u6QRfOUr9D1lcIClupwfinYmebK16USZ8c1xUvilcA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIAyzsVzmMZ/MgZdTK/+EAOkzhQqLFTDOlAAqyeGBKJ+oAiEApk7TuWOS8DAAdO/jO9UCwb4mHdFRZVa0P4ML3NK5GEk="}]},"maintainers":[{"name":"ekliptor","email":"Ekliptor1@yandex.com"}],"_npmUser":{"name":"ekliptor","email":"Ekliptor1@yandex.com"},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bintrees-local-1.0.2.tgz_1516135687576_0.15766442264430225"},"directories":{}},"1.0.3":{"author":{"name":"Vadim Graboys","email":"dimva13@gmail.com"},"name":"@ekliptor/bintrees-local","description":"Binary Search Trees","version":"1.0.3","keywords":["binary tree","red black tree","red-black tree","redblack tree"],"license":"MIT","main":"./index.js","scripts":{"test":"nodeunit ./test/test_*.js && jshint lib/*.js index.js"},"dependencies":{},"devDependencies":{"nodeunit":"0.9.1","jshint":"0.5.9","underscore":"1.3.1","reunion":"0.0.0"},"licenseText":"Copyright (C) 2011 by Vadim Graboys\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n","_id":"@ekliptor/bintrees-local@1.0.3","dist":{"shasum":"2fb3d5a763b9561d1e355f51e7dea797a9e0f66f","tarball":"https://registry.npmjs.org/@ekliptor/bintrees-local/-/bintrees-local-1.0.3.tgz","integrity":"sha512-K/SJ37kELd+VItXxY5m7PPdSgaDDeQug4/gcEm9yccw4qh1ZPWeFdNvSoproFvJJdcetPkNgRJYDtPdWwXQGig==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIAeM5XG1wOG5wpZH1GQYQuuVFvowFVMmJr+N5UDFrfiMAiEAlS5acQm/etsK9HY7wTC1CS+jyuULQLGNVsDVCwK0j9A="}]},"maintainers":[{"name":"ekliptor","email":"Ekliptor1@yandex.com"}],"_npmUser":{"name":"ekliptor","email":"Ekliptor1@yandex.com"},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bintrees-local-1.0.3.tgz_1516136269265_0.850319103570655"},"directories":{}},"1.0.4":{"author":{"name":"Vadim Graboys","email":"dimva13@gmail.com"},"name":"@ekliptor/bintrees-local","description":"Binary Search Trees","version":"1.0.4","keywords":["binary tree","red black tree","red-black tree","redblack tree"],"license":"MIT","main":"./index.js","scripts":{"test":"nodeunit ./test/test_*.js && jshint lib/*.js index.js"},"dependencies":{},"devDependencies":{"jshint":"0.5.9","nodeunit":"0.9.1","reunion":"0.0.0","underscore":"1.3.1"},"licenseText":"Copyright (C) 2011 by Vadim Graboys\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n","_id":"@ekliptor/bintrees-local@1.0.4","dist":{"shasum":"20381cde7bcaaea42a578ee2fcade08f37abb72a","tarball":"https://registry.npmjs.org/@ekliptor/bintrees-local/-/bintrees-local-1.0.4.tgz","integrity":"sha512-GJ8PQanMCvAjOSJ0vnxPGwXyLK68fMyjBy1f/spBdnVIldaV6UQUqO4SAuroh2iPZCuni4150S1Q7+w8ruV8EQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQC4IDifGLNeen3qV8U1u1Gdes/6/ucY65/oXi9nFIA6egIhAIn5GcvECOPlxcxsJBnSBsC8wn8M7Q5zgAEHp/Oq6BRO"}]},"maintainers":[{"name":"ekliptor","email":"Ekliptor1@yandex.com"}],"_npmUser":{"name":"ekliptor","email":"Ekliptor1@yandex.com"},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bintrees-local-1.0.4.tgz_1516144543197_0.6085582638625056"},"directories":{}},"1.0.5":{"author":{"name":"Vadim Graboys","email":"dimva13@gmail.com"},"name":"@ekliptor/bintrees-local","description":"Binary Search Trees","version":"1.0.5","keywords":["binary tree","red black tree","red-black tree","redblack tree"],"license":"MIT","main":"./index.js","scripts":{"test":"nodeunit ./test/test_*.js && jshint lib/*.js index.js"},"dependencies":{},"devDependencies":{"jshint":"0.5.9","nodeunit":"0.9.1","reunion":"0.0.0","underscore":"1.3.1"},"licenseText":"Copyright (C) 2011 by Vadim Graboys\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n","_id":"@ekliptor/bintrees-local@1.0.5","dist":{"shasum":"7f4690b7ce62b0f0074817e075bf9163497ea02c","tarball":"https://registry.npmjs.org/@ekliptor/bintrees-local/-/bintrees-local-1.0.5.tgz","integrity":"sha512-M3rnS6YfLfxjmM9pAOmsMGlgAw0a7DZeYfqxqClE+2X8Ea5e6KptoDeXZreScwOPYJLblqKB9f/5PSTuaHqt+g==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCeKWdyGCLGQ1mvDnW006fv8Lz9Eztu1J/AIzi/XDVeJAIgH/mPw3SilQQQ7TIPh2m10J6S7sBpj1VUF/d1Fwlq2UU="}]},"maintainers":[{"name":"ekliptor","email":"Ekliptor1@yandex.com"}],"_npmUser":{"name":"ekliptor","email":"Ekliptor1@yandex.com"},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bintrees-local-1.0.5.tgz_1516144748072_0.08383798529393971"},"directories":{}},"1.0.6":{"author":{"name":"Vadim Graboys","email":"dimva13@gmail.com"},"name":"@ekliptor/bintrees-local","description":"Binary Search Trees","version":"1.0.6","keywords":["binary tree","red black tree","red-black tree","redblack tree"],"license":"MIT","main":"./index.js","scripts":{"test":"nodeunit ./test/test_*.js && jshint lib/*.js index.js"},"dependencies":{},"devDependencies":{"jshint":"0.5.9","nodeunit":"0.9.1","reunion":"0.0.0","underscore":"1.3.1"},"licenseText":"Copyright (C) 2011 by Vadim Graboys\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n","_id":"@ekliptor/bintrees-local@1.0.6","dist":{"shasum":"eff97ccbbe7619f89bb671424d272591beb1f36c","tarball":"https://registry.npmjs.org/@ekliptor/bintrees-local/-/bintrees-local-1.0.6.tgz","integrity":"sha512-simKicDndfMAyoYTToxqe1PBlrB7dNMcDzJq2w/RPJsnjFWDD3vYZBL/4pzanhg6Y20ah0a7VTxhD6H8dT/gcA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIHpbPXfjYpFwUK4Fsm5XPADHCddVJtoUCSs/D9KYL37yAiB5i/l4l/RoM1bsyCp23jlWrWbtc6E4+tf/wIJ8kId9pw=="}]},"maintainers":[{"name":"ekliptor","email":"Ekliptor1@yandex.com"}],"_npmUser":{"name":"ekliptor","email":"Ekliptor1@yandex.com"},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bintrees-local-1.0.6.tgz_1516145842937_0.9781907661817968"},"directories":{}},"1.0.7":{"author":{"name":"Vadim Graboys","email":"dimva13@gmail.com"},"name":"@ekliptor/bintrees-local","description":"Binary Search Trees","version":"1.0.7","keywords":["binary tree","red black tree","red-black tree","redblack tree"],"license":"MIT","directories":{"lib":"lib"},"main":"./index.js","scripts":{"test":"nodeunit ./test/test_*.js && jshint lib/*.js index.js"},"dependencies":{},"devDependencies":{"jshint":"0.5.9","nodeunit":"0.9.1","reunion":"0.0.0","underscore":"1.3.1"},"_id":"@ekliptor/bintrees-local@1.0.7","_npmVersion":"5.6.0","_nodeVersion":"10.1.0","_npmUser":{"name":"ekliptor","email":"Ekliptor1@yandex.com"},"dist":{"integrity":"sha512-3FJgfUeSPUIKcwRyZ2slLueiu3cwswE8kr1meF8CRGNP6KYR29MgZyDfdnN/gaYNphYYu52IOoJUZyIbI4zsHw==","shasum":"7ecc5cef197c6a112f31d5a2fab3b941491313e6","tarball":"https://registry.npmjs.org/@ekliptor/bintrees-local/-/bintrees-local-1.0.7.tgz","fileCount":33,"unpackedSize":2375711,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJbC7JACRA9TVsSAnZWagAAAmUQAJUX+NSn1/YjkGZYSyw3\nXaTeqFMm9xRI4nKpTY6bePih10dZQQ+Tn9D3f2TNg3prLJgLImcuuFm4Ejh3\nnJeFCqUIjw2+0ZuH2FjekC7qQQKNyDaKNR3pLOA9QXax8IoVbtKI35vWTyd5\nIWqKFWcCRpFKybSMLQ+3VDoXGmAEGrsAvYp4WBAWGKnMraW6kranDzopsN2F\nQb9gYOD9IY/rRRarIOOWjku8CZse5w8dPsrnLpgpRr12nLGCFGptJGgFIiWJ\ne/EFFhuRBgHdGiuKfisEaz8AhlQaJzXn9MZtGfkSI/Iwo1e8iQH5ML1sD8Cj\njo9Hg0uujx733xqVkOZUc8Zcw2NfxL1Wto78FTH2J6+IQ6XlN7xeyZH4RsYE\nxgDomy0mRIK6W/Y38ZJxyt1e8H0OGRXVGWzWpZPtqbUk9SInScdc/zvouHRB\nL83wDe82qC3eV6HjNCRCqIsjASiX1ZtI3zPc6GcXZrRhIEjDGgn6iIxLH1tY\nXQc3qpd7EPP5J0wqL9bssRgoRFGHerIn8p0vAhh6edAU1ofnjNjvT3OOJtNc\n+6vSxf42pkE/ciLBYDX9ApVyc97GndOhr6X3W9ZThnbS5+S3FwIiOKimnmxX\nxTkUrZ+JZXAB74+pL1upFOI9cAfxZtG58tCEw+TqntzG7YRZQLbQdNqcqBBU\nUpiy\r\n=O7Hl\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDrBTB3AgOsjNZ/xivZJ70XKmgvLKmeVOw84ENDGxw/PgIgNspOWIfpI8Zk3Z7j07orSNqiJVnDqESWPPIBAwg7OKk="}]},"maintainers":[{"name":"ekliptor","email":"Ekliptor1@yandex.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bintrees-local_1.0.7_1527493182987_0.48323931178575674"},"_hasShrinkwrap":false},"1.0.8":{"author":{"name":"Vadim Graboys","email":"dimva13@gmail.com"},"name":"@ekliptor/bintrees-local","description":"Binary Search Trees","version":"1.0.8","keywords":["binary tree","red black tree","red-black tree","redblack tree"],"license":"MIT","directories":{"lib":"lib"},"main":"./index.js","scripts":{"test":"nodeunit ./test/test_*.js && jshint lib/*.js index.js"},"dependencies":{},"devDependencies":{"jshint":"0.5.9","nodeunit":"0.9.1","reunion":"0.0.0","underscore":"1.3.1"},"_id":"@ekliptor/bintrees-local@1.0.8","_npmVersion":"5.6.0","_nodeVersion":"10.1.0","_npmUser":{"name":"ekliptor","email":"Ekliptor1@yandex.com"},"dist":{"integrity":"sha512-notzh2M8P6kmVJ11UgS4Jkc9GChEuJqFGboKDBZQBy7kWqtD1yN668EWly4QrAuVvwgrO7l18BqsLiVCe6sTYQ==","shasum":"05c098a9e11acda13dec107a6512bd4ff905b29c","tarball":"https://registry.npmjs.org/@ekliptor/bintrees-local/-/bintrees-local-1.0.8.tgz","fileCount":33,"unpackedSize":2375820,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJbC7KWCRA9TVsSAnZWagAAIdgP/iKgBBYHEMEqQ4WuSaqT\nInfvykcovCFvTx02c2+Wb6lwEv/hcM4BegSve/fmo2Yl1FUdrnFMRB32FdmT\nrcwc2LR0iKD5PfZlTvbwMXwc5i6IcoVYS/G2AkmV5cgL37rTIsdcqCjCVOzS\n9WLpSiSKjuFnn3xd0Zhx5vfZGG+pWNR3ig4ZuHyyybBt3iiyRJUg1kl3iDnT\njIN2nBDmooDt+1ZUtVQ7sraurBPEByPEQX2al8JrRZYRCywrYL/3HFhNc2Mu\nx+k1UMq3F1wy59L01Jgg3OLFYYq4JlBsHJsu7p+llvHE8XbNieRz9U4sFZOB\nbgoTgxVSdCkoQyydkfTv/xig5s6/Pa9b0oEy3TcdI5t4SwnsM4nTqmIkgWXz\nL22saVNRXUxMHl4Mb5gLoDAaan4tq/sbi1H7KYKO37nucw9cE0NqF60W8eSX\nHe8g62B/7ZYHpp1BuMvi6MldyovWY9EbQ0YAs265BFWcqG0qRxEYS77DYCcf\n6xPjaejNpdTXaqCeaJF+3Tr3GEGubhCBE4D5Ehi7nOsK0CmgjOk09por83WS\nBkVYBk9vw0APiXTVfEKG1kxQTWU5s4/eGoa5LqQ037NoVLL1xnOhw99U4QUJ\nT9U3hH/whLvO17ASwFYrDRJyW0BeHPtL/1FEr7EixoaiWUO06H50nRmNzBiG\nTTsl\r\n=c1+r\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCluRHsd/V7QLFQx4/EqnNDFr3U94pNbMd5PxlWvOIJ4gIgd4zlYT6APrwTt8ullKRAFN7iAI2KeIR1nE7qGXUUg+k="}]},"maintainers":[{"name":"ekliptor","email":"Ekliptor1@yandex.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bintrees-local_1.0.8_1527493270017_0.9678218016657574"},"_hasShrinkwrap":false},"1.0.9":{"author":{"name":"Vadim Graboys","email":"dimva13@gmail.com"},"name":"@ekliptor/bintrees-local","description":"Binary Search Trees","version":"1.0.9","homepage":"https://wolfbot.org/","keywords":["binary tree","red black tree","red-black tree","redblack tree"],"license":"MIT","main":"./index.js","scripts":{"test":"nodeunit ./test/test_*.js && jshint lib/*.js index.js"},"dependencies":{},"devDependencies":{"jshint":"0.5.9","nodeunit":"0.9.1","reunion":"0.0.0","underscore":"1.3.1"},"licenseText":"Copyright (C) 2011 by Vadim Graboys\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n","_id":"@ekliptor/bintrees-local@1.0.9","dist":{"shasum":"2332776edbd5cf9cebd1924f85af4e60c160f2d3","integrity":"sha512-MI6gUDb9cK6elmlDW7qkk8ZqKSQtViZpUiBUG6hRb7Hatz2MGitKmUH6mGb86fKpM5PX08HbBCp037jw7l5GmA==","tarball":"https://registry.npmjs.org/@ekliptor/bintrees-local/-/bintrees-local-1.0.9.tgz","fileCount":32,"unpackedSize":2353685,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJcZwaaCRA9TVsSAnZWagAAPpgQAIsmzaBv4RINVGiuW8Ns\nIO8lcJCi4JpFqREaixK/8/YPoHJ1UgQs8/I0Af5PvcTs6nbmDLhR4C4dXNtl\nB0dZZeREXRLLHx8rM26x0KpqAqba4LxmXn61nNt+ytGztsp2SvHwOAJpB0+k\nrX7yuMowlnkfVBjdk5OhG/dDiuJdTeKsUBgFS/Dlzj1570hiZt9P+rDouPQJ\nxXkHpsxQXCSfAqcytJ3RJKiCVU0sh7+EHrkMdl1ON0lrR/0jV1IcYQ7RgNmc\nF7q3As20HAcbKSRmTiDo+oTzPBRvEughD33SC2uR8izB0h8/1/3Wuof1zEfy\ntKsmtNFeOh4E8LlN/+h7eSRWSawHK35vl7vJAhU7h1i3NFSAOCk0Ml/1pvRO\nQ9wusz3kEbcZup/07AOno9/PQzmZABBQ819dcaMYxNm8i1KIxuIVRGEW+i6Z\nCmpaMg6xFSf1AS0M4YsVkjsy35lyMJWF2Cgxtrjv8bc4d7YS3dTRhTjRfftk\nJ1kcRDyQZUFZmUP73DTO9cRNf/3qCf5lWsaxDhVTwHHXaQ3b4jKxTT1Ez9C/\nzooSeF6b5iPRiiDij7Iqx3bDH97w76rqbvSap6bMH5b0jzS2tBIVUT1Gjvrn\nMZAaw6AnY2xkWVktirNdpOfdOcwU3Zv+ymm5h/sqC+Mgr9/hMh1mNKzRfrC/\n+O3J\r\n=iARf\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDd4dXSbwNxF/6Tg4almcQPgyCYpcMfE0T24pfAhLihCgIgDAMAZTZW5ZkEgm3j2EtHYstTK7diBOeiobFwYPHykcM="}]},"maintainers":[{"name":"ekliptor","email":"Ekliptor1@yandex.com"}],"_npmUser":{"name":"ekliptor","email":"Ekliptor1@yandex.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/bintrees-local_1.0.9_1550255769719_0.3263943272588947"},"_hasShrinkwrap":false}},"readme":"Binary Trees [![Build Status](https://secure.travis-ci.org/vadimg/js_bintrees.png?branch=master)](http://travis-ci.org/vadimg/js_bintrees)\n============\n\nFork\n------------\nFork of this package - please read the docs there: https://github.com/vadimg/js_bintrees\n\n\nThis package provides Binary and Red-Black Search Trees written in Javascript. It is released under the MIT License.\n\nBinary Search Trees are a good way to store data in sorted order. A Red-Black tree is a variation of a Binary Tree that balances itself.\n\nAlgorithms were taken from Julienne Walker: http://eternallyconfuzzled.com/jsw_home.aspx\n\nTrees\n------------\n\n* BinTree - Binary Search Tree\n* RBTree - Red-Black Tree\n\nQuickstart\n------------\nnode.js:\n\n```\nnpm install bintrees\n```\n\n```javascript\nvar RBTree = require('bintrees').RBTree;\n\nvar tree = new RBTree(function(a, b) { return a - b; });\n\ntree.insert(2);\ntree.insert(-3);\n```\n\nsee examples/node.js for more info\n\nIn the browser:\n\n```html\n<script src=\"/path/to/rbtree.js\"></script>\n<script>\n    var tree = new RBTree(function(a, b) { return a - b; });\n    tree.insert(0);\n    tree.insert(1);\n</script>\n```\n\nsee examples/client.html for more info\n\nConstructor\n------------\n\nRequires 1 argument: a comparator function f(a,b) which returns:\n* 0 if a == b\n* >0 if a > b\n* <0 if a < b\n\nMethods\n------------\n\n### insert(item)\n> Inserts the item into the tree. Returns true if inserted, false if duplicate.\n\n### remove(item)\n> Removes the item from the tree. Returns true if removed, false if not found.\n\n### size\n> Number of nodes in the tree.\n\n### clear()\n> Removes all nodes from the tree.\n\n### find(item)\n> Returns node data if found, null otherwise.\n\n### findIter(item)\n> Returns an iterator to the node if found, null otherwise.\n\n### lowerBound(item)\n> Returns an iterator to the tree node at or immediately after the item. Returns null-iterator if tree is empty.\n>> __NOTE: Changed in version 1.0.0 to match C++ lower_bound__\n\n### upperBound(item)\n> Returns an iterator to the tree node immediately after the item. Returns null-iterator if tree is empty.\n>> __NOTE: Changed in version 1.0.0 to match C++ upper_bound__\n\n### min()\n> Returns the min node data in the tree, or null if the tree is empty.\n\n### max()\n> Returns the max node data in the tree, or null if the tree is empty.\n\n### each(f)\n> Calls f on each node's data, in order.\n\n### reach(f)\n> Calls f on each node's data, in reverse order.\n\n### iterator()\n> Returns a null-iterator. See __Iterators__ section below.\n\nIterators\n------------\n\ntree.iterator() will return a null-iterator. On a null iterator,\n* next() will return the first element in the tree\n* prev() will return the last element in the tree\n\nOtherwise,\n* next() will return the next element\n* prev() will return the previous element\n* data() will return the node the iterator is pointing to\n\nWhen iteration reaches the end, the iterator becomes a null-iterator again.\n\nForward iteration example:\n\n```javascript\nvar it=tree.iterator(), item;\nwhile((item = it.next()) !== null) {\n    // do stuff with item\n}\n```\n\nIf you are iterating forward through the tree, you can always call prev() to go back, and vice versa.\n\n__NOTE:__ iterators become invalid when you add or remove elements from the tree.\n\n## Production Usage\n\n* [Coinbase Exchange](https://exchange.coinbase.com/), since Jan 26, 2015.\n* If you are using this in production, please let me know! (add your company to this README in a pull request)\n","maintainers":[{"name":"ekliptor","email":"Ekliptor1@yandex.com"}],"time":{"modified":"2022-06-12T17:30:03.156Z","created":"2018-01-16T20:48:07.842Z","1.0.2":"2018-01-16T20:48:07.842Z","1.0.3":"2018-01-16T20:57:49.880Z","1.0.4":"2018-01-16T23:15:43.379Z","1.0.5":"2018-01-16T23:19:08.185Z","1.0.6":"2018-01-16T23:37:23.095Z","1.0.7":"2018-05-28T07:39:43.093Z","1.0.8":"2018-05-28T07:41:10.170Z","1.0.9":"2019-02-15T18:36:09.967Z"},"keywords":["binary tree","red black tree","red-black tree","redblack tree"],"author":{"name":"Vadim Graboys","email":"dimva13@gmail.com"},"license":"MIT","readmeFilename":"README.md","homepage":"https://wolfbot.org/"}