{"_id":"big-sparse-array","_rev":"1284638","name":"big-sparse-array","description":"A sparse array optimised for low memory whilst still being fast","dist-tags":{"latest":"1.0.2"},"maintainers":[{"name":"npm:mafintosh","email":""}],"time":{"modified":"2021-10-19T10:51:03.000Z","created":"2020-11-26T09:54:36.451Z","1.0.2":"2020-11-26T12:11:45.149Z","1.0.1":"2020-11-26T10:13:19.232Z","1.0.0":"2020-11-26T09:54:36.451Z"},"users":{},"author":{"name":"Mathias Buus","url":"@mafintosh"},"repository":{"type":"git","url":"git+https://github.com/mafintosh/big-sparse-array.git"},"versions":{"1.0.2":{"name":"big-sparse-array","version":"1.0.2","description":"A sparse array optimised for low memory whilst still being fast","main":"index.js","dependencies":{},"devDependencies":{"standard":"^16.0.3","tape":"^5.0.1"},"scripts":{"test":"standard && tape test.js"},"repository":{"type":"git","url":"git+https://github.com/mafintosh/big-sparse-array.git"},"author":{"name":"Mathias Buus","url":"@mafintosh"},"license":"MIT","bugs":{"url":"https://github.com/mafintosh/big-sparse-array/issues"},"homepage":"https://github.com/mafintosh/big-sparse-array","gitHead":"06d71cb727c29edcabe7e1e97359f1ae3db5ab9c","_id":"big-sparse-array@1.0.2","_nodeVersion":"14.15.0","_npmVersion":"6.14.8","dist":{"shasum":"705f19d8e066218fa0dfee86cf7c94280312d807","size":2677,"noattachment":false,"key":"/big-sparse-array/-/big-sparse-array-1.0.2.tgz","tarball":"http://registry.cnpm.dingdandao.com/big-sparse-array/download/big-sparse-array-1.0.2.tgz"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"directories":{},"maintainers":[{"name":"npm:mafintosh","email":""}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/big-sparse-array_1.0.2_1606392705048_0.0993365718707444"},"_hasShrinkwrap":false,"publish_time":1606392705149,"_cnpm_publish_time":1606392705149},"1.0.1":{"name":"big-sparse-array","version":"1.0.1","description":"A sparse array optimised for low memory whilst still being fast","main":"index.js","dependencies":{},"devDependencies":{"standard":"^16.0.3","tape":"^5.0.1"},"scripts":{"test":"standard && tape test.js"},"repository":{"type":"git","url":"git+https://github.com/mafintosh/big-sparse-array.git"},"author":{"name":"Mathias Buus","url":"@mafintosh"},"license":"MIT","bugs":{"url":"https://github.com/mafintosh/big-sparse-array/issues"},"homepage":"https://github.com/mafintosh/big-sparse-array","gitHead":"398ca5a5db401dba1df881216ccdd2028e437e9b","_id":"big-sparse-array@1.0.1","_nodeVersion":"14.15.0","_npmVersion":"6.14.8","dist":{"shasum":"3c7e50ffed3fa7ee7765663e49ba28b82b0f0cce","size":2674,"noattachment":false,"key":"/big-sparse-array/-/big-sparse-array-1.0.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/big-sparse-array/download/big-sparse-array-1.0.1.tgz"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"directories":{},"maintainers":[{"name":"npm:mafintosh","email":""}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/big-sparse-array_1.0.1_1606385599096_0.5312702927000448"},"_hasShrinkwrap":false,"publish_time":1606385599232,"_cnpm_publish_time":1606385599232},"1.0.0":{"name":"big-sparse-array","version":"1.0.0","description":"A sparse array optimised for low memory whilst still being fast","main":"index.js","dependencies":{},"devDependencies":{"standard":"^16.0.3","tape":"^5.0.1"},"repository":{"type":"git","url":"git+https://github.com/mafintosh/big-sparse-array.git"},"author":{"name":"Mathias Buus","url":"@mafintosh"},"license":"MIT","bugs":{"url":"https://github.com/mafintosh/big-sparse-array/issues"},"homepage":"https://github.com/mafintosh/big-sparse-array","gitHead":"9082e21ad6b0c2a9598788c4fd9180da85caf4d2","_id":"big-sparse-array@1.0.0","_nodeVersion":"14.15.0","_npmVersion":"6.14.8","dist":{"shasum":"0e5919959636ff1bcc2624e7e2dbc55bc9da6360","size":2403,"noattachment":false,"key":"/big-sparse-array/-/big-sparse-array-1.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/big-sparse-array/download/big-sparse-array-1.0.0.tgz"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"directories":{},"maintainers":[{"name":"npm:mafintosh","email":""}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/big-sparse-array_1.0.0_1606384476325_0.4489177199478753"},"_hasShrinkwrap":false,"publish_time":1606384476451,"_cnpm_publish_time":1606384476451}},"readme":"# big-sparse-array\n\nA sparse array optimised for low memory whilst still being fast.\n\n```\nnpm install big-sparse-array\n```\n\nUses a shallow tree structure with a branching factor of 4096\nto index a series of small arrays that try to compress as much as possible\nto reduce the memory overhead needed.\n\nSimilar to a Map, except it is faster, but might use a bit more memory, ymmv.\n\n## Usage\n\n``` js\nconst BigSparseArray = require('big-sparse-array')\n\nconst b = new BigSparseArray()\n\nb.set(42422242525, true)\nb.get(42422242525) // returns true\nb.get(111111111) // returns undefined\n```\n\n## API\n\n#### `const b = new BigSparseArray()`\n\nMake a new sparse array.\n\n#### `b.set(index, value)`\n\nInsert a new value at an index. `index` must be a integer.\n\n#### `value = b.get(index)`\n\nGet a value out. Returns `undefined` if the value could not be found.\n\n## License\n\nMIT\n","_attachments":{},"homepage":"https://github.com/mafintosh/big-sparse-array","bugs":{"url":"https://github.com/mafintosh/big-sparse-array/issues"},"license":"MIT"}