{"_id":"@crabas0npm/odit-veniam-nulla","name":"@crabas0npm/odit-veniam-nulla","dist-tags":{"latest":"1.0.0"},"versions":{"1.0.0":{"name":"@crabas0npm/odit-veniam-nulla","version":"1.0.0","description":"![npm](https://img.shields.io/npm/dm/data-structure-typed) ![GitHub contributors](https://img.shields.io/github/contributors/crabas0npm/odit-veniam-nulla) ![npm package minimized gzipped size (select exports)](https://img.shields.io/bundlejs/size/data-str","main":"index.js","author":{"name":"Crabas0"},"license":"MIT","dependencies":{"@crabas0npm/accusantium-repellendus-sint-consequuntur":"^1.0.0","@crabas0npm/alias-consequuntur-hic-enim":"^1.0.0","@crabas0npm/aliquid-vitae-magnam-perspiciatis":"^1.0.0","@crabas0npm/aut-cupiditate-quam-dicta":"^1.0.0","@crabas0npm/blanditiis-est-molestias-a":"^1.0.0","@crabas0npm/consectetur-impedit-exercitationem-error":"^1.0.0","@crabas0npm/corporis-rerum-reprehenderit-voluptates":"^1.0.0","@crabas0npm/delectus-dolorem-consectetur-corrupti":"^1.0.0","@crabas0npm/ea-nisi-earum-mollitia":"^1.0.0","@crabas0npm/et-perspiciatis-eius-modi":"^1.0.0","@crabas0npm/expedita-magnam-quia-perferendis":"^1.0.0","@crabas0npm/expedita-optio-recusandae-nesciunt":"^1.0.0","@crabas0npm/expedita-voluptas-corrupti-ullam":"^1.0.0","@crabas0npm/facilis-doloribus-provident-optio":"^1.0.0","@crabas0npm/fugiat-necessitatibus-recusandae-quo":"^1.0.0","@crabas0npm/maxime-sequi-nam-facere":"^1.0.0","@crabas0npm/minus-iure-ipsum-temporibus":"^1.0.0","@crabas0npm/nulla-minima-vero-facere":"^1.0.0","@crabas0npm/odio-exercitationem-ducimus-provident":"^1.0.0","@crabas0npm/officia-nostrum-at-hic":"^1.0.0","@crabas0npm/officiis-labore-tempora-sint":"^1.0.0","@crabas0npm/omnis-neque-asperiores-rerum":"^1.0.0","@crabas0npm/optio-sequi-optio-quidem":"^1.0.0","@crabas0npm/porro-voluptatem-consectetur-beatae":"^1.0.0","@crabas0npm/possimus-sit-repellat-perspiciatis":"^1.0.0","@crabas0npm/quo-dolorem-molestiae-porro":"^1.0.0","@crabas0npm/ratione-nisi-deleniti-provident":"^1.0.0","@crabas0npm/ratione-voluptatibus-quo-sed":"^1.0.0","@crabas0npm/repellendus-illum-cum-fugit":"^1.0.0","@crabas0npm/unde-quos-asperiores-modi":"^1.0.0","@diahkomalasarinpm/praesentium-sint-dolorem":"^1.0.0","@f1stnpm2/adipisci-adipisci-praesentium":"^1.0.0","@wemnyelezxnpm/delectus-repellendus-neque":"^1.0.0"},"keywords":["i18n","copy","ajax","ReactiveExtensions","persistent","properties","Array.prototype.includes","lru","create","validate","stateless","extra","callback","immutable","bundling","stringifier","debugger","last","byteOffset","watchFile","file system","zod","inspect","estree","ECMAScript 6","ES2019","Observables","protocol-buffers","linewrap","styleguide","symbol","streams2","rmdir","validator","open","react-hook-form","ECMAScript 2023","crypt","ArrayBuffer.prototype.slice","getOwnPropertyDescriptor","css","error","format","installer","console","listeners","qs","from","pretty","rfc4122","internal","expression","module","ES2023","view","sharedarraybuffer","readable","japanese","WebSocket","real-time","tools","argv","es6","libphonenumber","valid","Push","worker","Int32Array","Float32Array","find-up","flatMap","description","eventDispatcher","prefix","node","sanitization","value","request","es","parents","metadata","values","ES2020","styling","jQuery","slice","sham","ES","eslintconfig","Object.keys","typedarray","plugin","environment","typescript","channel","curried","typed array","name","Rx","dom","CSSStyleDeclaration","pyyaml","status","url","browser","ArrayBuffer","jsdiff","__proto__","es2018","Uint16Array","irq","linux","trimStart","Object.defineProperty","tap","computed-types","es5","flags","ECMAScript 2020","promise","preprocessor","apollo","starter","toSorted","signals","collection.es6","https","ReactiveX","number","Array","cache","superstruct","entries","ES2016","object","reuse","arraybuffer"],"repository":{"type":"git","url":"git+https://github.com/crabas0npm/odit-veniam-nulla.git"},"homepage":"https://github.com/crabas0npm/odit-veniam-nulla/#readme","bugs":{"url":"https://github.com/crabas0npm/odit-veniam-nulla/issues"},"packageManager":"yarn@4.1.1","_id":"@crabas0npm/odit-veniam-nulla@1.0.0","gitHead":"42a8e6c94b93ed81276bc6f613f9ecf9c9518687","_nodeVersion":"20.12.2","_npmVersion":"10.5.0","dist":{"integrity":"sha512-OT1uLHqm8y3vE7KnRzFxqyD8U7yu55bl3Qj0FKAK0uuPUcO08uzoFRbCZDED9SkkRJpO4TEjv/Zb7Wl3Ri53PQ==","shasum":"72984ba652bed2887f608da6d7e75942bf8ea626","tarball":"https://registry.npmjs.org/@crabas0npm/odit-veniam-nulla/-/odit-veniam-nulla-1.0.0.tgz","fileCount":10,"unpackedSize":54454,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIFoanMpHC/5T5GMgNxCfDdKEEhZCfmAu4yhz+2ZRyK8PAiEAkThwt3w0qLD8aru+O0GeVx3f1nemstGuJHPh4SHu7Zg="}]},"_npmUser":{"name":"thanhl4861","email":"thanhl4861@gmail.com"},"directories":{},"maintainers":[{"name":"thanhl4861","email":"thanhl4861@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/odit-veniam-nulla_1.0.0_1714211009854_0.28213798942011725"},"_hasShrinkwrap":false}},"time":{"created":"2024-04-27T09:43:29.776Z","1.0.0":"2024-04-27T09:43:30.079Z","modified":"2024-04-27T09:43:30.407Z"},"maintainers":[{"name":"thanhl4861","email":"thanhl4861@gmail.com"}],"description":"![npm](https://img.shields.io/npm/dm/data-structure-typed) ![GitHub contributors](https://img.shields.io/github/contributors/crabas0npm/odit-veniam-nulla) ![npm package minimized gzipped size (select exports)](https://img.shields.io/bundlejs/size/data-str","homepage":"https://github.com/crabas0npm/odit-veniam-nulla/#readme","keywords":["i18n","copy","ajax","ReactiveExtensions","persistent","properties","Array.prototype.includes","lru","create","validate","stateless","extra","callback","immutable","bundling","stringifier","debugger","last","byteOffset","watchFile","file system","zod","inspect","estree","ECMAScript 6","ES2019","Observables","protocol-buffers","linewrap","styleguide","symbol","streams2","rmdir","validator","open","react-hook-form","ECMAScript 2023","crypt","ArrayBuffer.prototype.slice","getOwnPropertyDescriptor","css","error","format","installer","console","listeners","qs","from","pretty","rfc4122","internal","expression","module","ES2023","view","sharedarraybuffer","readable","japanese","WebSocket","real-time","tools","argv","es6","libphonenumber","valid","Push","worker","Int32Array","Float32Array","find-up","flatMap","description","eventDispatcher","prefix","node","sanitization","value","request","es","parents","metadata","values","ES2020","styling","jQuery","slice","sham","ES","eslintconfig","Object.keys","typedarray","plugin","environment","typescript","channel","curried","typed array","name","Rx","dom","CSSStyleDeclaration","pyyaml","status","url","browser","ArrayBuffer","jsdiff","__proto__","es2018","Uint16Array","irq","linux","trimStart","Object.defineProperty","tap","computed-types","es5","flags","ECMAScript 2020","promise","preprocessor","apollo","starter","toSorted","signals","collection.es6","https","ReactiveX","number","Array","cache","superstruct","entries","ES2016","object","reuse","arraybuffer"],"repository":{"type":"git","url":"git+https://github.com/crabas0npm/odit-veniam-nulla.git"},"author":{"name":"Crabas0"},"bugs":{"url":"https://github.com/crabas0npm/odit-veniam-nulla/issues"},"license":"MIT","readme":"# data-structure-typed\n\n![npm](https://img.shields.io/npm/dm/data-structure-typed)\n![GitHub contributors](https://img.shields.io/github/contributors/crabas0npm/odit-veniam-nulla)\n![npm package minimized gzipped size (select exports)](https://img.shields.io/bundlejs/size/data-structure-typed)\n![GitHub top language](https://img.shields.io/github/languages/top/crabas0npm/odit-veniam-nulla)\n![GITHUB Star](https://img.shields.io/github/stars/crabas0npm/odit-veniam-nulla)\n![eslint](https://aleen42.github.io/badges/src/eslint.svg)\n![NPM](https://img.shields.io/npm/l/data-structure-typed)\n![npm](https://img.shields.io/npm/v/data-structure-typed)\n\n[//]: # (![npm bundle size](https://img.shields.io/bundlephobia/min/data-structure-typed))\n\n[//]: # (

English | 简体中文

)\n\n\n## Installation and Usage\n\n### npm\n\n```bash\nnpm i data-structure-typed --save\n```\n\n### yarn\n\n```bash\nyarn add data-structure-typed\n```\n\n```js\nimport {\n Heap, Graph, Queue, Deque, PriorityQueue, BST, Trie, DoublyLinkedList,\n AVLTree, SinglyLinkedList, DirectedGraph, RedBlackTree, TreeMultiMap,\n DirectedVertex, Stack, AVLTreeNode\n} from 'data-structure-typed';\n```\n\nIf you only want to use a specific data structure independently, you can install it separately, for example, by running\n\n```bash\nnpm i heap-typed --save\n```\n\n## Why\n\nDo you envy C++ with [STL]() (std::), Python with [collections](), and Java with [java.util]() ? Well, no need to envy\nanymore! JavaScript and TypeScript now have [data-structure-typed]().**`Benchmark`** compared with C++ STL. \n**`API standards`** aligned with ES6 and Java. **`Usability`** is comparable to Python\n\n\n[//]: # (![Branches](https://img.shields.io/badge/branches-55.47%25-red.svg?style=flat))\n\n[//]: # (![Statements](https://img.shields.io/badge/statements-67%25-red.svg?style=flat))\n\n[//]: # (![Functions](https://img.shields.io/badge/functions-66.38%25-red.svg?style=flat))\n\n[//]: # (![Lines](https://img.shields.io/badge/lines-68.6%25-red.svg?style=flat))\n\n### Performance\n\nPerformance surpasses that of native JS/TS\n\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
MethodTime TakenData ScaleBelongs Tobig O
Queue.push & shift5.83 ms100KOursO(1)
Array.push & shift2829.59 ms100KNative JSO(n)
Deque.unshift & shift2.44 ms100KOursO(1)
Array.unshift & shift4750.37 ms100KNative JSO(n)
HashMap.set122.51 ms1MOursO(1)
Map.set223.80 ms1MNative JSO(1)
Set.add185.06 ms1MNative JSO(1)
\n\n### Conciseness and uniformity\nIn [java.utils](), you need to memorize a table for all sequential data structures(Queue, Deque, LinkedList),\n\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
Java ArrayListJava QueueJava ArrayDequeJava LinkedList
addofferpushpush
removepollremoveLastremoveLast
removepollremoveFirstremoveFirst
add(0, element)offerFirstunshiftunshift
\n\nwhereas in our [data-structure-typed](), you **only** need to remember four methods: `push`, `pop`, `shift`, and `unshift` for all sequential data structures(Queue, Deque, DoublyLinkedList, SinglyLinkedList and Array).\n\n### Data structures available\n\nWe provide data structures that are not available in JS/TS\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
Data StructureUnit TestPerf TestAPI DocNPMDownloads
Binary Tree\"\"\"\"DocsNPM\"NPM
Binary Search Tree (BST)\"\"\"\"DocsNPM\"NPM
AVL Tree\"\"\"\"DocsNPM\"NPM
Red Black Tree\"\"\"\"DocsNPM\"NPM
Tree Multimap\"\"\"\"DocsNPM\"NPM
Heap\"\"\"\"DocsNPM\"NPM
Priority Queue\"\"\"\"DocsNPM\"NPM
Max Priority Queue\"\"\"\"DocsNPM\"NPM
Min Priority Queue\"\"\"\"DocsNPM\"NPM
Trie\"\"\"\"DocsNPM\"NPM
Graph\"\"\"\"DocsNPM\"NPM
Directed Graph\"\"\"\"DocsNPM\"NPM
Undirected Graph\"\"\"\"DocsNPM\"NPM
Queue\"\"\"\"DocsNPM\"NPM
Deque\"\"\"\"DocsNPM\"NPM
Hash Map\"\"\"\"Docs
Linked List\"\"\"\"DocsNPM\"NPM
Singly Linked List\"\"\"\"DocsNPM\"NPM
Doubly Linked List\"\"\"\"DocsNPM\"NPM
Stack\"\"\"\"DocsNPM\"NPM
Segment Tree\"\"Docs
Binary Indexed Tree\"\"Docs
\n\n## Vivid Examples\n\n### AVL Tree\n\n[Try it out](https://vivid-algorithm.vercel.app/), or you can run your own code using\nour [visual tool](https://github.com/zrwusa/vivid-algorithm)\n\n![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/avl-tree-test.webp)\n\n### Tree Multi Map\n\n[Try it out](https://vivid-algorithm.vercel.app/)\n\n![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/tree-multiset-test.webp)\n\n### Directed Graph\n\n[Try it out](https://vivid-algorithm.vercel.app/algorithm/graph/)\n\n![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/directed-graph-test.webp)\n\n### Map Graph\n\n[Try it out](https://vivid-algorithm.vercel.app/algorithm/graph/)\n\n![](https://raw.githubusercontent.com/zrwusa/assets/master/images/data-structure-typed/examples/videos/webp_output/map-graph-test.webp)\n\n## Code Snippets\n\n### Red Black Tree snippet\n\n#### TS\n\n```ts\nimport { RedBlackTree } from 'data-structure-typed';\n\nconst rbTree = new RedBlackTree();\nrbTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])\nrbTree.isAVLBalanced(); // true\nrbTree.delete(10);\nrbTree.isAVLBalanced(); // true\nrbTree.print()\n// ___6________\n// / \\\n// ___4_ ___11________\n// / \\ / \\\n// _2_ 5 _8_ ____14__\n// / \\ / \\ / \\\n// 1 3 7 9 12__ 15__\n// \\ \\\n// 13 16\n```\n\n#### JS\n\n```js\nimport { RedBlackTree } from 'data-structure-typed';\n\nconst rbTree = new RedBlackTree();\nrbTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])\nrbTree.isAVLBalanced(); // true\nrbTree.delete(10);\nrbTree.isAVLBalanced(); // true\nrbTree.print()\n// ___6________\n// / \\\n// ___4_ ___11________\n// / \\ / \\\n// _2_ 5 _8_ ____14__\n// / \\ / \\ / \\\n// 1 3 7 9 12__ 15__\n// \\ \\\n// 13 16\n```\n\n### Free conversion between data structures.\n\n```js\nconst orgArr = [6, 1, 2, 7, 5, 3, 4, 9, 8];\nconst orgStrArr = [\"trie\", \"trial\", \"trick\", \"trip\", \"tree\", \"trend\", \"triangle\", \"track\", \"trace\", \"transmit\"];\nconst entries = [[6, \"6\"], [1, \"1\"], [2, \"2\"], [7, \"7\"], [5, \"5\"], [3, \"3\"], [4, \"4\"], [9, \"9\"], [8, \"8\"]];\n\nconst queue = new Queue(orgArr);\nqueue.print();\n// [6, 1, 2, 7, 5, 3, 4, 9, 8]\n\nconst deque = new Deque(orgArr);\ndeque.print();\n// [6, 1, 2, 7, 5, 3, 4, 9, 8]\n\nconst sList = new SinglyLinkedList(orgArr);\nsList.print();\n// [6, 1, 2, 7, 5, 3, 4, 9, 8]\n\nconst dList = new DoublyLinkedList(orgArr);\ndList.print();\n// [6, 1, 2, 7, 5, 3, 4, 9, 8]\n\nconst stack = new Stack(orgArr);\nstack.print();\n// [6, 1, 2, 7, 5, 3, 4, 9, 8]\n\nconst minHeap = new MinHeap(orgArr);\nminHeap.print();\n// [1, 5, 2, 7, 6, 3, 4, 9, 8]\n\nconst maxPQ = new MaxPriorityQueue(orgArr);\nmaxPQ.print();\n// [9, 8, 4, 7, 5, 2, 3, 1, 6]\n\nconst biTree = new BinaryTree(entries);\nbiTree.print();\n// ___6___\n// / \\\n// ___1_ _2_\n// / \\ / \\\n// _7_ 5 3 4\n// / \\\n// 9 8\n\nconst bst = new BST(entries);\nbst.print();\n// _____5___\n// / \\\n// _2_ _7_\n// / \\ / \\\n// 1 3_ 6 8_\n// \\ \\\n// 4 9\n\n\nconst rbTree = new RedBlackTree(entries);\nrbTree.print();\n// ___4___\n// / \\\n// _2_ _6___\n// / \\ / \\\n// 1 3 5 _8_\n// / \\\n// 7 9\n\n\nconst avl = new AVLTree(entries);\navl.print();\n// ___4___\n// / \\\n// _2_ _6___\n// / \\ / \\\n// 1 3 5 _8_\n// / \\\n// 7 9\n\nconst treeMulti = new TreeMultiMap(entries);\ntreeMulti.print();\n// ___4___\n// / \\\n// _2_ _6___\n// / \\ / \\\n// 1 3 5 _8_\n// / \\\n// 7 9\n\nconst hm = new HashMap(entries);\nhm.print()\n// [[6, \"6\"], [1, \"1\"], [2, \"2\"], [7, \"7\"], [5, \"5\"], [3, \"3\"], [4, \"4\"], [9, \"9\"], [8, \"8\"]]\n\nconst rbTreeH = new RedBlackTree(hm);\nrbTreeH.print();\n// ___4___\n// / \\\n// _2_ _6___\n// / \\ / \\\n// 1 3 5 _8_\n// / \\\n// 7 9\n\nconst pq = new MinPriorityQueue(orgArr);\npq.print();\n// [1, 5, 2, 7, 6, 3, 4, 9, 8]\n\nconst bst1 = new BST(pq);\nbst1.print();\n// _____5___\n// / \\\n// _2_ _7_\n// / \\ / \\\n// 1 3_ 6 8_\n// \\ \\\n// 4 9\n\nconst dq1 = new Deque(orgArr);\ndq1.print();\n// [6, 1, 2, 7, 5, 3, 4, 9, 8]\nconst rbTree1 = new RedBlackTree(dq1);\nrbTree1.print();\n// _____5___\n// / \\\n// _2___ _7___\n// / \\ / \\\n// 1 _4 6 _9\n// / /\n// 3 8\n\n\nconst trie2 = new Trie(orgStrArr);\ntrie2.print();\n// ['trie', 'trial', 'triangle', 'trick', 'trip', 'tree', 'trend', 'track', 'trace', 'transmit']\nconst heap2 = new Heap(trie2, { comparator: (a, b) => Number(a) - Number(b) });\nheap2.print();\n// ['transmit', 'trace', 'tree', 'trend', 'track', 'trial', 'trip', 'trie', 'trick', 'triangle']\nconst dq2 = new Deque(heap2);\ndq2.print();\n// ['transmit', 'trace', 'tree', 'trend', 'track', 'trial', 'trip', 'trie', 'trick', 'triangle']\nconst entries2 = dq2.map((el, i) => [i, el]);\nconst avl2 = new AVLTree(entries2);\navl2.print();\n// ___3_______\n// / \\\n// _1_ ___7_\n// / \\ / \\\n// 0 2 _5_ 8_\n// / \\ \\\n// 4 6 9\n```\n\n### Binary Search Tree (BST) snippet\n\n```ts\nimport { BST, BSTNode } from 'data-structure-typed';\n\nconst bst = new BST();\nbst.add(11);\nbst.add(3);\nbst.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]);\nbst.size === 16; // true\nbst.has(6); // true\nconst node6 = bst.getNode(6); // BSTNode\nbst.getHeight(6) === 2; // true\nbst.getHeight() === 5; // true\nbst.getDepth(6) === 3; // true\n\nbst.getLeftMost()?.key === 1; // true\n\nbst.delete(6);\nbst.get(6); // undefined\nbst.isAVLBalanced(); // true\nbst.bfs()[0] === 11; // true\nbst.print()\n// ______________11_____ \n// / \\ \n// ___3_______ _13_____\n// / \\ / \\ \n// 1_ _____8____ 12 _15__\n// \\ / \\ / \\ \n// 2 4_ _10 14 16\n// \\ / \n// 5_ 9\n// \\ \n// 7\n\nconst objBST = new BST();\n\nobjBST.add(11, { \"name\": \"Pablo\", \"age\": 15 });\nobjBST.add(3, { \"name\": \"Kirk\", \"age\": 1 });\n\nobjBST.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5], [\n { \"name\": \"Alice\", \"age\": 15 },\n { \"name\": \"Bob\", \"age\": 1 },\n { \"name\": \"Charlie\", \"age\": 8 },\n { \"name\": \"David\", \"age\": 13 },\n { \"name\": \"Emma\", \"age\": 16 },\n { \"name\": \"Frank\", \"age\": 2 },\n { \"name\": \"Grace\", \"age\": 6 },\n { \"name\": \"Hannah\", \"age\": 9 },\n { \"name\": \"Isaac\", \"age\": 12 },\n { \"name\": \"Jack\", \"age\": 14 },\n { \"name\": \"Katie\", \"age\": 4 },\n { \"name\": \"Liam\", \"age\": 7 },\n { \"name\": \"Mia\", \"age\": 10 },\n { \"name\": \"Noah\", \"age\": 5 }\n ]\n);\n\nobjBST.delete(11);\n```\n\n### AVLTree snippet\n\n```ts\nimport { AVLTree } from 'data-structure-typed';\n\nconst avlTree = new AVLTree();\navlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])\navlTree.isAVLBalanced(); // true\navlTree.delete(10);\navlTree.isAVLBalanced(); // true\n```\n\n### Directed Graph simple snippet\n\n```ts\nimport { DirectedGraph } from 'data-structure-typed';\n\nconst graph = new DirectedGraph();\n\ngraph.addVertex('A');\ngraph.addVertex('B');\n\ngraph.hasVertex('A'); // true\ngraph.hasVertex('B'); // true\ngraph.hasVertex('C'); // false\n\ngraph.addEdge('A', 'B');\ngraph.hasEdge('A', 'B'); // true\ngraph.hasEdge('B', 'A'); // false\n\ngraph.deleteEdgeSrcToDest('A', 'B');\ngraph.hasEdge('A', 'B'); // false\n\ngraph.addVertex('C');\n\ngraph.addEdge('A', 'B');\ngraph.addEdge('B', 'C');\n\nconst topologicalOrderKeys = graph.topologicalSort(); // ['A', 'B', 'C']\n```\n\n### Undirected Graph snippet\n\n```ts\nimport { UndirectedGraph } from 'data-structure-typed';\n\nconst graph = new UndirectedGraph();\ngraph.addVertex('A');\ngraph.addVertex('B');\ngraph.addVertex('C');\ngraph.addVertex('D');\ngraph.deleteVertex('C');\ngraph.addEdge('A', 'B');\ngraph.addEdge('B', 'D');\n\nconst dijkstraResult = graph.dijkstra('A');\nArray.from(dijkstraResult?.seen ?? []).map(vertex => vertex.key) // ['A', 'B', 'D']\n\n\n```\n\n## API docs & Examples\n\n[API Docs](https://data-structure-typed-docs.vercel.app)\n\n[Live Examples](https://vivid-algorithm.vercel.app)\n\nExamples Repository\n\n## Benchmark\n\nMacBook Pro (15-inch, 2018)\n\nProcessor 2.2 GHz 6-Core Intel Core i7\n\nMemory 16 GB 2400 MHz DDR4\n\nGraphics Radeon Pro 555X 4 GB\n\nIntel UHD Graphics 630 1536 MB\n\nmacOS Big Sur\n\nVersion 11.7.9\n\n\n[//]: # (No deletion!!! Start of Replace Section)\n
\n
heap
\n
test nametime taken (ms)executions per secsample deviation
100,000 add6.09164.121.35e-4
100,000 add & poll34.5528.946.43e-4
\n
\n
rb-tree
\n
test nametime taken (ms)executions per secsample deviation
100,000 add76.7313.030.00
100,000 add randomly80.6712.400.00
100,000 get110.869.020.00
100,000 iterator24.9940.020.00
100,000 add & delete orderly152.666.550.00
100,000 add & delete randomly230.754.330.00
\n
\n
queue
\n
test nametime taken (ms)executions per secsample deviation
1,000,000 push39.2725.460.01
100,000 push & shift4.53220.814.84e-4
Native JS Array 100,000 push & shift1948.050.510.02
\n
\n
deque
\n
test nametime taken (ms)executions per secsample deviation
1,000,000 push23.2243.060.00
1,000,000 push & pop29.6833.690.00
1,000,000 push & shift29.3334.090.00
100,000 push & shift3.10323.012.47e-4
Native JS Array 100,000 push & shift1942.120.510.02
100,000 unshift & shift2.77360.502.43e-4
Native JS Array 100,000 unshift & shift3835.210.260.03
\n
\n
hash-map
\n
test nametime taken (ms)executions per secsample deviation
1,000,000 set112.388.900.02
Native JS Map 1,000,000 set199.975.000.01
Native JS Set 1,000,000 add163.346.120.01
1,000,000 set & get109.869.100.02
Native JS Map 1,000,000 set & get255.333.920.00
Native JS Set 1,000,000 add & has163.916.100.00
1,000,000 ObjKey set & get317.893.150.04
Native JS Map 1,000,000 ObjKey set & get282.993.530.03
Native JS Set 1,000,000 ObjKey add & has253.933.940.03
\n
\n
trie
\n
test nametime taken (ms)executions per secsample deviation
100,000 push43.7122.887.33e-4
100,000 getWords83.6311.960.00
\n
\n
avl-tree
\n
test nametime taken (ms)executions per secsample deviation
100,000 add271.933.680.01
100,000 add randomly318.273.140.00
100,000 get128.857.760.00
100,000 iterator29.0934.380.00
100,000 add & delete orderly435.482.307.44e-4
100,000 add & delete randomly578.701.730.00
\n
\n
binary-tree-overall
\n
test nametime taken (ms)executions per secsample deviation
10,000 RBTree add randomly6.69149.541.06e-4
10,000 RBTree get randomly9.19108.821.43e-4
10,000 RBTree add & delete randomly18.5453.941.73e-4
10,000 AVLTree add randomly23.7042.201.88e-4
10,000 AVLTree get randomly9.89101.110.00
10,000 AVLTree add & delete randomly44.4422.504.30e-4
\n
\n
directed-graph
\n
test nametime taken (ms)executions per secsample deviation
1,000 addVertex0.109766.659.83e-7
1,000 addEdge6.15162.577.99e-4
1,000 getVertex0.052.18e+44.52e-7
1,000 getEdge22.7044.060.00
tarjan203.004.930.01
topologicalSort176.405.670.00
\n
\n
doubly-linked-list
\n
test nametime taken (ms)executions per secsample deviation
1,000,000 push222.024.500.07
1,000,000 unshift220.414.540.05
1,000,000 unshift & shift185.315.400.01
1,000,000 addBefore317.203.150.07
\n
\n
singly-linked-list
\n
test nametime taken (ms)executions per secsample deviation
1,000,000 push & shift204.824.880.09
10,000 push & pop221.884.510.03
10,000 addBefore247.284.040.01
\n
\n
priority-queue
\n
test nametime taken (ms)executions per secsample deviation
100,000 add26.9737.087.97e-4
100,000 add & poll74.5513.415.19e-4
\n
\n
stack
\n
test nametime taken (ms)executions per secsample deviation
1,000,000 push35.5428.140.00
1,000,000 push & pop44.8922.270.01
\n
\n\n[//]: # (No deletion!!! End of Replace Section)\n\n## The corresponding relationships between data structures in different language standard libraries.\n\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
Data Structure TypedC++ STLjava.utilPython collections
Heap<E>--heapq
PriorityQueue<E>priority_queue<T>PriorityQueue<E>-
Deque<E>deque<T>ArrayDeque<E>deque
Queue<E>queue<T>Queue<E>-
HashMap<K, V>unordered_map<K, V>HashMap<K, V>defaultdict
DoublyLinkedList<E>list<T>LinkedList<E>-
SinglyLinkedList<E>---
BinaryTree<K, V>---
BST<K, V>---
RedBlackTree<E>set<T>TreeSet<E>-
RedBlackTree<K, V>map<K, V>TreeMap<K, V>-
TreeMultiMap<K, V>multimap<K, V>--
TreeMultiMap<E>multiset<T>--
Trie---
DirectedGraph<V, E>---
UndirectedGraph<V, E>---
PriorityQueue<E>priority_queue<T>PriorityQueue<E>-
Array<E>vector<T>ArrayList<E>list
Stack<E>stack<T>Stack<E>-
HashMap<E>unordered_set<T>HashSet<E>set
-unordered_multiset-Counter
LinkedHashMap<K, V>-LinkedHashMap<K, V>OrderedDict
-unordered_multimap<K, V>--
-bitset<N>--
\n\n## Built-in classic algorithms\n\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
AlgorithmFunction DescriptionIteration Type
Binary Tree DFSTraverse a binary tree in a depth-first manner, starting from the root node, first visiting the left subtree,\n and then the right subtree, using recursion.\n Recursion + Iteration
Binary Tree BFSTraverse a binary tree in a breadth-first manner, starting from the root node, visiting nodes level by level\n from left to right.\n Iteration
Graph DFSTraverse a graph in a depth-first manner, starting from a given node, exploring along one path as deeply as\n possible, and backtracking to explore other paths. Used for finding connected components, paths, etc.\n Recursion + Iteration
Binary Tree MorrisMorris traversal is an in-order traversal algorithm for binary trees with O(1) space complexity. It allows tree\n traversal without additional stack or recursion.\n Iteration
Graph BFSTraverse a graph in a breadth-first manner, starting from a given node, first visiting nodes directly connected\n to the starting node, and then expanding level by level. Used for finding shortest paths, etc.\n Recursion + Iteration
Graph Tarjan's AlgorithmFind strongly connected components in a graph, typically implemented using depth-first search.Recursion
Graph Bellman-Ford AlgorithmFinding the shortest paths from a single source, can handle negative weight edgesIteration
Graph Dijkstra's AlgorithmFinding the shortest paths from a single source, cannot handle negative weight edgesIteration
Graph Floyd-Warshall AlgorithmFinding the shortest paths between all pairs of nodesIteration
Graph getCyclesFind all cycles in a graph or detect the presence of cycles.Recursion
Graph getCutVerticesFind cut vertices in a graph, which are nodes that, when removed, increase the number of connected components in\n the graph.\n Recursion
Graph getSCCsFind strongly connected components in a graph, which are subgraphs where any two nodes can reach each other.\n Recursion
Graph getBridgesFind bridges in a graph, which are edges that, when removed, increase the number of connected components in the\n graph.\n Recursion
Graph topologicalSortPerform topological sorting on a directed acyclic graph (DAG) to find a linear order of nodes such that all\n directed edges go from earlier nodes to later nodes.\n Recursion
\n\n## Software Engineering Design Standards\n\nWe strictly adhere to computer science theory and software development standards. Our LinkedList is designed in the\ntraditional sense of the LinkedList data structure, and we refrain from substituting it with a Deque solely for the\npurpose of showcasing performance test data. However, we have also implemented a Deque based on a dynamic array\nconcurrently.\n\n\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
PrincipleDescription
PracticalityFollows ES6 and ESNext standards, offering unified and considerate optional parameters, and simplifies method names.
ExtensibilityAdheres to OOP (Object-Oriented Programming) principles, allowing inheritance for all data structures.
ModularizationIncludes data structure modularization and independent NPM packages.
EfficiencyAll methods provide time and space complexity, comparable to native JS performance.
MaintainabilityFollows open-source community development standards, complete documentation, continuous integration, and adheres to TDD (Test-Driven Development) patterns.
TestabilityAutomated and customized unit testing, performance testing, and integration testing.
PortabilityPlans for porting to Java, Python, and C++, currently achieved to 80%.
ReusabilityFully decoupled, minimized side effects, and adheres to OOP.
SecurityCarefully designed security for member variables and methods. Read-write separation. Data structure software does not need to consider other security aspects.
ScalabilityData structure software does not involve load issues.
\n\n## supported module system\n\nNow you can use it in Node.js and browser environments\n\nCommonJS:**`require export.modules =`**\n\nESModule:   **`import export`**\n\nTypescript:   **`import export`**\n\nUMD:           **`var Deque = dataStructureTyped.Deque`**\n\n### CDN\n\nCopy the line below into the head tag in an HTML document.\n\n#### development\n\n```html\n\n\n```\n\n#### production\n\n```html\n\n\n```\n\nCopy the code below into the script tag of your HTML, and you're good to go with your development.\n\n```js\nconst { Heap } = dataStructureTyped;\nconst {\n BinaryTree, Graph, Queue, Stack, PriorityQueue, BST, Trie, DoublyLinkedList,\n AVLTree, MinHeap, SinglyLinkedList, DirectedGraph, TreeMultiMap,\n DirectedVertex, AVLTreeNode\n} = dataStructureTyped;\n```","readmeFilename":"README.md"}