{"_id":"@apexds/bst","name":"@apexds/bst","dist-tags":{"latest":"1.1.1"},"versions":{"1.1.1":{"name":"@apexds/bst","version":"1.1.1","description":"Fast, type-safe Binary Search Trees (BST & RandBST). Zero-dependency data structures engineered for massive datasets and low-latency lookups.","scripts":{"build:lib":"rimraf ./lib && vite build","build:dts":"dts-bundle-generator -o lib/index.d.ts src/index.ts --no-check --inline-declare-externals --external-inlines @raikuxq/alg-ds","build:full":"yarn build:lib && yarn build:dts"},"author":{"name":"raikuxq","email":"raikuxqt@gmail.com"},"license":"MIT","repository":{"type":"git","url":"git+https://github.com/raikuxq/apexds-bst.git"},"keywords":["typescript","binary search tree","randomized binary search tree","BST"],"main":"./lib/index.mjs","module":"./lib/index.mjs","types":"./lib/index.d.ts","dependencies":{},"devDependencies":{"@apexds/core":"^4.2.3","@types/jest":"^29.5.12","dts-bundle-generator":"^9.5.1","jest":"^29.7.0","rimraf":"^6.1.2","ts-jest":"^29.1.2","typescript":"^5.4.5","vite":"^5.2.11"},"sideEffects":false,"_id":"@apexds/bst@1.1.1","gitHead":"cbc8f9d8a85a21ef02eb413dc0cd9b8d8a99060f","bugs":{"url":"https://github.com/raikuxq/apexds-bst/issues"},"homepage":"https://github.com/raikuxq/apexds-bst#readme","_nodeVersion":"22.17.1","_npmVersion":"11.5.2","dist":{"integrity":"sha512-yyk7l4+33HBA91l3mU3z1wvSOHdWwUj49lkN5PFzmQw+NP98vQdq8byeBgSjhPduK4omeIeIG9f7YuDwdTfIkw==","shasum":"44fdd8989dc8a065bf0f3345c253707bf7ce5c7b","tarball":"https://registry.npmjs.org/@apexds/bst/-/bst-1.1.1.tgz","fileCount":5,"unpackedSize":18549,"signatures":[{"keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U","sig":"MEYCIQCa3Bo89KRTeRBY+dAsn6+szhICQyCPp15BiqTz8/xO1wIhALi7ym4zvmSLyJ3EigRf26fRpCVPONs2gsKvgl9OnEf6"}]},"_npmUser":{"name":"raikuxq","email":"raikulmao.dev@gmail.com"},"directories":{},"maintainers":[{"name":"raikuxq","email":"raikulmao.dev@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages-npm-production","tmp":"tmp/bst_1.1.1_1771854119752_0.49080202307171117"},"_hasShrinkwrap":false}},"time":{"created":"2026-02-23T13:41:59.675Z","1.1.1":"2026-02-23T13:41:59.890Z","modified":"2026-02-23T13:42:00.370Z"},"maintainers":[{"name":"raikuxq","email":"raikulmao.dev@gmail.com"}],"description":"Fast, type-safe Binary Search Trees (BST & RandBST). Zero-dependency data structures engineered for massive datasets and low-latency lookups.","homepage":"https://github.com/raikuxq/apexds-bst#readme","keywords":["typescript","binary search tree","randomized binary search tree","BST"],"repository":{"type":"git","url":"git+https://github.com/raikuxq/apexds-bst.git"},"author":{"name":"raikuxq","email":"raikuxqt@gmail.com"},"bugs":{"url":"https://github.com/raikuxq/apexds-bst/issues"},"license":"MIT","readme":"# @apexds/bst\nFast, type-safe Binary Search Trees (BST & RandBST). Zero-dependency data structures engineered for massive datasets and low-latency lookups.\n\n[![npm version](https://img.shields.io/npm/v/@apexds/bst.svg)](https://www.npmjs.com/package/@apexds/bst)\n[![minzip](https://img.shields.io/bundlephobia/minzip/@apexds/bst)](https://bundlephobia.com/package/@apexds/bst)\n[![gzip size](https://img.shields.io/bundlejs/size/gzip/@apexds/bst)](https://bundlejs.com/?q=@apexds/bst)\n\n\n---\n\n## Documentation\n\nDetailed documentation is available at:  \n[https://raikuxq-algorithms.netlify.app/guide/data-structures/bsts](https://raikuxq-algorithms.netlify.app/guide/data-structures/bst.html)\n\n---\n\n# Installing\nInstall by using any of these commands:\n+ `yarn add @apexds/bst`\n+ `npm install @apexds/bst --save`\n\n## Core lib\nCore (implementation, tests, docs): [@apexds/core](https://github.com/raikuxq/apexds)","readmeFilename":"README.md","_rev":"1-e28e2422cde4375ac8aa12890e396baa"}