{"_id":"@acagastya/dsts","_rev":"1-0d3ccee7f2a8ab8073690aa34cf53159","name":"@acagastya/dsts","dist-tags":{"latest":"0.0.1"},"versions":{"0.0.1":{"name":"@acagastya/dsts","version":"0.0.1","description":"A data structures, ADTs, and algorithms library in TypeScript","main":"dist/index.js","author":{"name":"Agastya","email":"acagastya@outlook.com","url":"https://hanabi.in"},"maintainers":[{"name":"acagastya","email":"acagastya@outlook.com"}],"license":"BSD-3-Clause","dependencies":{},"devDependencies":{"@babel/cli":"^7.10.1","@babel/core":"^7.10.2","@babel/preset-env":"^7.10.2","@babel/preset-typescript":"^7.10.1","@types/jest":"^26.0.0","babel-jest":"^26.0.1","better-docs":"^2.0.1","jest":"^26.0.1","jsdoc":"^3.6.4","prettier":"^2.0.5","serve":"^11.3.2","typescript":"^3.9.5"},"scripts":{"babel-build":"babel --extensions '.ts' src --out-dir dist","build":"tsc","check-type":"tsc --noEmit --watch","clean":"rm -rf dist types docs","cov":"serve -d coverage/lcov-report","format":"prettier --write \"{src,tests}/**/*.{js,ts}\"","gen-doc":"jsdoc -c jsdoc.json","gen-type":"tsc --declaration --emitDeclarationOnly","preinstall":"tsc","show-doc":"serve docs","test":"jest --watch","test:cov":"jest --coverage --watch","tsc":"tsc"},"jest":{"transform":{"^.+\\.jsx?$":"babel-jest"},"collectCoverageFrom":["./test/**/*"],"coverageThreshold":{"global":{"branches":100,"functions":100,"lines":100,"statements":100}}},"types":"types/index.d.ts","licenseText":"Copyright 2020 Agastya Chandrakant\n\nRedistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:\n\n1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n\n2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.\n\n3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.","_id":"@acagastya/dsts@0.0.1","dist":{"shasum":"0c3c58d90f869e7f2b31d519cc270acb34cc9bb6","integrity":"sha512-61nbmek5eSxoW8+ZyHss4j8p3INXvOQ4t0iHVT9DFwmhbF7FoesLJg9hqYaSqE2izG+K/ho9eg1lSSuHdgGh7g==","tarball":"https://registry.npmjs.org/@acagastya/dsts/-/dsts-0.0.1.tgz","fileCount":30,"unpackedSize":17629,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.4\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJe9NrVCRA9TVsSAnZWagAAd50P+QGXPVTDYMov8DO+17fQ\nhHm+7D+Y4Zf2VrEnpwpHUIhllHSUhpYfa8yizdN0iJ/3JejV7quUhTUO7TTY\nSMuwBGQbOM6YuXeKX482OM4S/eMUA3VH2t9NCwzgZFi+U0Za9Yf7nhGDdKd7\nnEDIRd/9cvtOLX7+ugWJR0l80SDCwBeBAGYGXns/E7m7UjXM7AZ4UZAnIwmg\nzCuS2f0Vgp3quab6fCZmLyg1vEcLn1bxzthe08PYObnLJddwY/VMO7QOFeAK\niSxxZBbapxr78K+J3sXRo5w4611QZVcSjQtX7c+XWbJ532kEkANgmJVWZBlq\nZcvMRvgZsMf7eAjGy9umKhp5oleW3zP66GhZAzDYZGZooAq09X3yUCNxyIoH\nWCKR7s/27HmRg1PO9eSlSXAt4LFGMgc9WfPMezvpQlkhi1M986PXu/njSqM5\nEn2l5FO9TYvjXO1qlHoL0ARSOn0Jv5N5G6IEQWoQNpf7/1KoX8Yex8ZsZNqB\n7T5fybxBtuXEMiUfwk8JJkyrlmTeaZXLlGIqXFZyyhKIpJiWIAuaDI7nklys\nTw7WWp2XgtiFA9PuPZigvvwcGIRa0exhNTk/FXSqoy/KKA+fGigE8r6pTaZu\nBjvyZCdCFGMNw9s+iQWQx48uXLf4u3M3qyqAfEnynFGRR0W3bFW9pGQq0FEI\nWbd/\r\n=1QFI\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIBm85twrC+jEryUdDoVydjJ1fNZL35tn03S6E8Dw1JeDAiEAh0XfSWD4Iq5HpmEnBHXAoeNp26PMucytpFmzDCHA194="}]},"_npmUser":{"name":"acagastya","email":"acagastya@outlook.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/dsts_0.0.1_1593105109032_0.8166850988484802"},"_hasShrinkwrap":false}},"time":{"created":"2020-06-25T17:11:48.985Z","0.0.1":"2020-06-25T17:11:49.146Z","modified":"2022-04-04T11:05:04.132Z"},"maintainers":[{"name":"acagastya","email":"acagastya@outlook.com"}],"description":"A data structures, ADTs, and algorithms library in TypeScript","author":{"name":"Agastya","email":"acagastya@outlook.com","url":"https://hanabi.in"},"license":"BSD-3-Clause","readme":"# DSTS\n\n**TL;DR** Data structures implemented in TypeScript.\n\n[toc]\n\n## Usage note\n\nConsider you would like to use the `Stack` and `Queue` data structure.\n\n```ts\nimport { ds } from \"dsts\";\n// or\nconst { ds } = require(\"dsts\").default;\n\nconst { Stack, Queue } = ds;\n```\n\n## Folder structure\n\n```bash\nsrc\n├── adt\n│   └── interfaces\n├── ds\n│   └── data structures\n├── extended\n│   └── DS with some added functionalities.\n└── index.ts ➡️ the file from where everything is imported.\n```\n\n## Documentation\n\n### Abstract Data Types\n\n#### `NodeItem`\n\n**`type`** &mdash; `NodeItem | null | undefined`\n\n**`interface`**:\n+ `value` &mdash; type: `any`.  The value to save in the node.\n+ `next` &mdash; type: `NodeType`.  Reference to the next node.\n+ `prev?` &mdash; (optional).  type: `NodeType`.  Reference to the previous node.\n+ `key?` &mdash; (optional).  type: `any`.  The key to the value.\n\n### Vanilla Data Structures\n\n#### SingleNode\n\n**implements** &mdash; [`NodeItem`](#NodeItem)\n\n**properties**\n+ `value` &mdash; (required).  type: `any`.  The value to be saved in the Node.\n+ `next` &mdash; (optional).  type: `NodeType`.  Reference to the next node.  (default) `null`.\n\n### Extended Data Structures\n\n#### SingleNode\n\n**methods**\n+ `toString` &mdash; returns `string`.  Returns string representation of the node's `value`.","readmeFilename":"README.md"}