diff --git a/README.md b/README.md index 3c2eab3..c018c02 100644 --- a/README.md +++ b/README.md @@ -7,12 +7,6 @@ ![npm](https://aleen42.github.io/badges/src/npm.svg) ![eslint](https://aleen42.github.io/badges/src/eslint.svg) -[//]: # (![Typescript](https://img.shields.io/github/package-json/dependency-version/zrwusa/data-structure-typed/dev/typescript)) - -[//]: # (![TypeDoc](https://img.shields.io/github/package-json/dependency-version/zrwusa/data-structure-typed/dev/typedoc)) - -[//]: # (![Total Downloads](https://img.shields.io/github/downloads/zrwusa/data-structure-typed/total)) - ## Brief Data Structures of Javascript & TypeScript. @@ -78,7 +72,6 @@ const {Heap, MinHeap, SinglyLinkedList, Stack, AVLTreeNode, BST, Trie, DirectedG bst.get(6); // null bst.isAVLBalanced(); // true bst.BFS()[0] === 11; // true - const objBST = new BST>(); objBST.add(11, {id: 11, keyA: 11}); @@ -128,13 +121,11 @@ const {Heap, MinHeap, SinglyLinkedList, Stack, AVLTreeNode, BST, Trie, DirectedG objBST.remove(11); - const avlTree = new AVLTree(); avlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]) avlTree.isAVLBalanced(); // true avlTree.remove(10); avlTree.isAVLBalanced(); // true - ``` ### AVLTree snippet @@ -330,20 +321,6 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D Stack - -[//]: # () - -[//]: # (Hash) - -[//]: # () - -[//]: # () - -[//]: # (HashTable) - -[//]: # () - -[//]: # () Coordinate Set @@ -396,107 +373,6 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D -[//]: # (## API docs) - -[//]: # () - - -[//]: # (![Statements](https://img.shields.io/badge/statements-55.31%25-red.svg?style=flat)) - -[//]: # (![Branches](https://img.shields.io/badge/branches-47.04%25-red.svg?style=flat)) - -[//]: # (![Functions](https://img.shields.io/badge/functions-48.29%25-red.svg?style=flat)) - -[//]: # (![Lines](https://img.shields.io/badge/lines-56.92%25-red.svg?style=flat)) - ## Code design By strictly adhering to object-oriented design (BinaryTree -> BST -> AVLTree -> TreeMultiset), you can seamlessly inherit the existing data structures to implement the customized ones you need. Object-oriented design stands as the optimal approach to data structure design. @@ -759,7 +635,3 @@ By strictly adhering to object-oriented design (BinaryTree -> BST -> AVLTree -> - -![complexities](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/complexities-diff.jpg?raw=true) - -![complexities of data structures](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/data-structure-complexities.jpg?raw=true)