mirror of
https://github.com/zrwusa/data-structure-typed.git
synced 2024-09-20 03:54:05 +00:00
407 lines
13 KiB
Markdown
407 lines
13 KiB
Markdown
# data-structure-typed
|
|
|
|
Javascript Data Structure, TypeScript Data Structure Library
|
|
|
|
## install
|
|
|
|
### yarn
|
|
|
|
```bash
|
|
yarn add data-structure-typed
|
|
```
|
|
|
|
### npm
|
|
|
|
```bash
|
|
npm install data-structure-typed
|
|
```
|
|
|
|
## Live Examples
|
|
|
|
[Live Examples](https://data-structure-typed-examples.vercel.app)
|
|
|
|
<a href="https://data-structure-typed-examples.vercel.app" target="_blank">Live Examples</a>
|
|
|
|
## Examples Repository
|
|
|
|
[Examples Repository](https://github.com/zrwusa/data-structure-typed-examples)
|
|
|
|
<a href="https://github.com/zrwusa/data-structure-typed-examples" target="_blank">Examples Repository</a>
|
|
|
|
## Data Structures
|
|
|
|
Meticulously crafted to empower developers with a versatile set of essential data structures. Our library includes a
|
|
wide range of data structures:
|
|
Binary Tree, Binary Search Tree (BST), AVL Tree, Tree Multiset, Segment Tree, Binary Indexed Tree, Graph, Directed
|
|
Graph, Undirected Graph, Linked List, Singly Linked List, Doubly Linked List, Queue, Object Deque, Array Deque, Stack,
|
|
Hash, Coordinate Set, Coordinate Map, Heap, Priority Queue, Max Priority Queue, Min Priority Queue, Trie
|
|
|
|
## API docs
|
|
|
|
[//]: # ([api docs](https://data-structure-typed-docs.vercel.app/))
|
|
|
|
<nav class="tsd-navigation"><a href="https://data-structure-typed-docs.vercel.app/modules.html" class="current"><span>data-<wbr/>structure-<wbr/>typed</span></a>
|
|
<ul class="tsd-small-nested-navigation">
|
|
|
|
[//]: # (<li><a href="https://data-structure-typed-docs.vercel.app/enums/CP.html"><span>CP</span></a></li>)
|
|
|
|
[//]: # (<li><a href="https://data-structure-typed-docs.vercel.app/enums/FamilyPosition.html"><span>Family<wbr/>Position</span></a></li>)
|
|
|
|
[//]: # (<li><a href="https://data-structure-typed-docs.vercel.app/enums/LoopType.html"><span>Loop<wbr/>Type</span></a></li>)
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/AVLTree.html"><span>AVLTree</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/AVLTreeNode.html"><span>AVLTree<wbr/>Node</span></a></li>
|
|
|
|
[//]: # (<li><a href="https://data-structure-typed-docs.vercel.app/classes/AaTree.html"><span>Aa<wbr/>Tree</span></a></li>)
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/AbstractEdge.html"><span>Abstract<wbr/>Edge</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/AbstractGraph.html"><span>Abstract<wbr/>Graph</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/AbstractVertex.html"><span>Abstract<wbr/>Vertex</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/ArrayDeque.html"><span>Array<wbr/>Deque</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/BST.html"><span>BST</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/BSTNode.html"><span>BSTNode</span></a></li>
|
|
|
|
[//]: # (<li><a href="https://data-structure-typed-docs.vercel.app/classes/BTree.html"><span>BTree</span></a></li>)
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryIndexedTree.html"><span>Binary<wbr/>Indexed<wbr/>Tree</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryTree.html"><span>Binary<wbr/>Tree</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryTreeNode.html"><span>Binary<wbr/>Tree<wbr/>Node</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/Character.html"><span>Character</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/CoordinateMap.html"><span>Coordinate<wbr/>Map</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/CoordinateSet.html"><span>Coordinate<wbr/>Set</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/Deque.html"><span>Deque</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/DirectedEdge.html"><span>Directed<wbr/>Edge</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/DirectedGraph.html"><span>Directed<wbr/>Graph</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/DirectedVertex.html"><span>Directed<wbr/>Vertex</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/DoublyLinkedList.html"><span>Doubly<wbr/>Linked<wbr/>List</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/DoublyLinkedListNode.html"><span>Doubly<wbr/>Linked<wbr/>List<wbr/>Node</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/Heap.html"><span>Heap</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/Matrix2D.html"><span>Matrix2D</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/MatrixNTI2D.html"><span>MatrixNTI2D</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/MaxHeap.html"><span>Max<wbr/>Heap</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/MaxPriorityQueue.html"><span>Max<wbr/>Priority<wbr/>Queue</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/MinHeap.html"><span>Min<wbr/>Heap</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/MinPriorityQueue.html"><span>Min<wbr/>Priority<wbr/>Queue</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/Navigator.html"><span>Navigator</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/ObjectDeque.html"><span>Object<wbr/>Deque</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/PriorityQueue.html"><span>Priority<wbr/>Queue</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/Queue.html"><span>Queue</span></a></li>
|
|
|
|
[//]: # (<li><a href="https://data-structure-typed-docs.vercel.app/classes/RBTree.html"><span>RBTree</span></a></li>)
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/SegmentTree.html"><span>Segment<wbr/>Tree</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/SegmentTreeNode.html"><span>Segment<wbr/>Tree<wbr/>Node</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/SinglyLinkedList.html"><span>Singly<wbr/>Linked<wbr/>List</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/SinglyLinkedListNode.html"><span>Singly<wbr/>Linked<wbr/>List<wbr/>Node</span></a></li>
|
|
|
|
[//]: # (<li><a href="https://data-structure-typed-docs.vercel.app/classes/SplayTree.html"><span>Splay<wbr/>Tree</span></a></li>)
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/Stack.html"><span>Stack</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/TreeMultiSet.html"><span>Tree<wbr/>Multi<wbr/>Set</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/Trie.html"><span>Trie</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/TrieNode.html"><span>Trie<wbr/>Node</span></a></li>
|
|
|
|
[//]: # (<li><a href="https://data-structure-typed-docs.vercel.app/classes/TwoThreeTree.html"><span>Two<wbr/>Three<wbr/>Tree</span></a></li>)
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/UndirectedEdge.html"><span>Undirected<wbr/>Edge</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/UndirectedGraph.html"><span>Undirected<wbr/>Graph</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/UndirectedVertex.html"><span>Undirected<wbr/>Vertex</span></a></li>
|
|
<li><a href="https://data-structure-typed-docs.vercel.app/classes/Vector2D.html"><span>Vector2D</span></a></li></ul></nav>
|
|
|
|
## Complexities
|
|
|
|
### performance of Big O
|
|
|
|
<table>
|
|
<thead>
|
|
<tr>
|
|
<th>Big O Notation</th>
|
|
<th>Type</th>
|
|
<th>Computations for 10 elements</th>
|
|
<th>Computations for 100 elements</th>
|
|
<th>Computations for 1000 elements</th>
|
|
</tr>
|
|
</thead>
|
|
<tbody>
|
|
<tr>
|
|
<td><strong>O(1)</strong></td>
|
|
<td>Constant</td>
|
|
<td>1</td>
|
|
<td>1</td>
|
|
<td>1</td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>O(log N)</strong></td>
|
|
<td>Logarithmic</td>
|
|
<td>3</td>
|
|
<td>6</td>
|
|
<td>9</td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>O(N)</strong></td>
|
|
<td>Linear</td>
|
|
<td>10</td>
|
|
<td>100</td>
|
|
<td>1000</td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>O(N log N)</strong></td>
|
|
<td>n log(n)</td>
|
|
<td>30</td>
|
|
<td>600</td>
|
|
<td>9000</td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>O(N^2)</strong></td>
|
|
<td>Quadratic</td>
|
|
<td>100</td>
|
|
<td>10000</td>
|
|
<td>1000000</td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>O(2^N)</strong></td>
|
|
<td>Exponential</td>
|
|
<td>1024</td>
|
|
<td>1.26e+29</td>
|
|
<td>1.07e+301</td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>O(N!)</strong></td>
|
|
<td>Factorial</td>
|
|
<td>3628800</td>
|
|
<td>9.3e+157</td>
|
|
<td>4.02e+2567</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
|
|
### Data Structure Complexity
|
|
|
|
<table>
|
|
<thead>
|
|
<tr>
|
|
<th>Data Structure</th>
|
|
<th>Access</th>
|
|
<th>Search</th>
|
|
<th>Insertion</th>
|
|
<th>Deletion</th>
|
|
<th>Comments</th>
|
|
</tr>
|
|
</thead>
|
|
<tbody>
|
|
<tr>
|
|
<td><strong>Array</strong></td>
|
|
<td>1</td>
|
|
<td>n</td>
|
|
<td>n</td>
|
|
<td>n</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>Stack</strong></td>
|
|
<td>n</td>
|
|
<td>n</td>
|
|
<td>1</td>
|
|
<td>1</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>Queue</strong></td>
|
|
<td>n</td>
|
|
<td>n</td>
|
|
<td>1</td>
|
|
<td>1</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>Linked List</strong></td>
|
|
<td>n</td>
|
|
<td>n</td>
|
|
<td>1</td>
|
|
<td>n</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>Hash Table</strong></td>
|
|
<td>-</td>
|
|
<td>n</td>
|
|
<td>n</td>
|
|
<td>n</td>
|
|
<td>In case of perfect hash function costs would be O(1)</td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>Binary Search Tree</strong></td>
|
|
<td>n</td>
|
|
<td>n</td>
|
|
<td>n</td>
|
|
<td>n</td>
|
|
<td>In case of balanced tree costs would be O(log(n))</td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>B-Tree</strong></td>
|
|
<td>log(n)</td>
|
|
<td>log(n)</td>
|
|
<td>log(n)</td>
|
|
<td>log(n)</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>Red-Black Tree</strong></td>
|
|
<td>log(n)</td>
|
|
<td>log(n)</td>
|
|
<td>log(n)</td>
|
|
<td>log(n)</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>AVL Tree</strong></td>
|
|
<td>log(n)</td>
|
|
<td>log(n)</td>
|
|
<td>log(n)</td>
|
|
<td>log(n)</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>Bloom Filter</strong></td>
|
|
<td>-</td>
|
|
<td>1</td>
|
|
<td>1</td>
|
|
<td>-</td>
|
|
<td>False positives are possible while searching</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
|
|
### Sorting Complexity
|
|
|
|
<table>
|
|
<thead>
|
|
<tr>
|
|
<th>Name</th>
|
|
<th>Best</th>
|
|
<th>Average</th>
|
|
<th>Worst</th>
|
|
<th>Memory</th>
|
|
<th>Stable</th>
|
|
<th>Comments</th>
|
|
</tr>
|
|
</thead>
|
|
<tbody>
|
|
<tr>
|
|
<td><strong>Bubble sort</strong></td>
|
|
<td>n</td>
|
|
<td>n<sup>2</sup></td>
|
|
<td>n<sup>2</sup></td>
|
|
<td>1</td>
|
|
<td>Yes</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>Insertion sort</strong></td>
|
|
<td>n</td>
|
|
<td>n<sup>2</sup></td>
|
|
<td>n<sup>2</sup></td>
|
|
<td>1</td>
|
|
<td>Yes</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>Selection sort</strong></td>
|
|
<td>n<sup>2</sup></td>
|
|
<td>n<sup>2</sup></td>
|
|
<td>n<sup>2</sup></td>
|
|
<td>1</td>
|
|
<td>No</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>Heap sort</strong></td>
|
|
<td>n log(n)</td>
|
|
<td>n log(n)</td>
|
|
<td>n log(n)</td>
|
|
<td>1</td>
|
|
<td>No</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>Merge sort</strong></td>
|
|
<td>n log(n)</td>
|
|
<td>n log(n)</td>
|
|
<td>n log(n)</td>
|
|
<td>n</td>
|
|
<td>Yes</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>Quick sort</strong></td>
|
|
<td>n log(n)</td>
|
|
<td>n log(n)</td>
|
|
<td>n<sup>2</sup></td>
|
|
<td>log(n)</td>
|
|
<td>No</td>
|
|
<td>Quicksort is usually done in-place with O(log(n)) stack space</td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>Shell sort</strong></td>
|
|
<td>n log(n)</td>
|
|
<td>depends on gap sequence</td>
|
|
<td>n (log(n))<sup>2</sup></td>
|
|
<td>1</td>
|
|
<td>No</td>
|
|
<td></td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>Counting sort</strong></td>
|
|
<td>n + r</td>
|
|
<td>n + r</td>
|
|
<td>n + r</td>
|
|
<td>n + r</td>
|
|
<td>Yes</td>
|
|
<td>r - biggest number in array</td>
|
|
</tr>
|
|
<tr>
|
|
<td><strong>Radix sort</strong></td>
|
|
<td>n * k</td>
|
|
<td>n * k</td>
|
|
<td>n * k</td>
|
|
<td>n + k</td>
|
|
<td>Yes</td>
|
|
<td>k - length of longest key</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
[//]: # ()
|
|
|
|
[//]: # ()
|
|
|
|
[//]: # ()
|
|
|
|
|
|
|
|
|
|
|