data-structure-typed/test/unit/data-structures
2023-11-30 10:20:12 +08:00
..
binary-tree feat: Add keys, values, and clone methods to all binary tree data structures. 2023-11-27 18:01:59 +08:00
graph feat: Implement the [Symbol.iterator], forEach, filter, map, and reduce methods for Graph, specifically targeting the nodes. fix: type error fixed 2023-11-27 11:24:23 +08:00
hash feat: print method has been added in HashMap. chore: reformated HashMap test. docs: high-performance HashMap benchmark 2023-11-30 10:20:12 +08:00
heap feat: To support conversion between data structures, Heap, PriorityQueue, Queue, Deque, SinglyLinkedList, DoublyLinkedList, and Stack have all added an 'elements' parameter for initializing the elements of the data structure. 2023-11-23 18:40:30 +08:00
linked-list refactor: In Linked List data structures, only use 'undefined' and abandon the design where both 'null' and 'undefined' coexist. 2023-11-27 09:31:11 +08:00
matrix style: reformated codebase 2023-11-16 10:14:14 +08:00
priority-queue feat: To support conversion between data structures, Heap, PriorityQueue, Queue, Deque, SinglyLinkedList, DoublyLinkedList, and Stack have all added an 'elements' parameter for initializing the elements of the data structure. 2023-11-23 18:40:30 +08:00
queue refactor: In Stack data structures, only use 'undefined' and abandon the design where both 'null' and 'undefined' coexist. 2023-11-27 09:38:03 +08:00
stack refactor: In Stack data structures, only use 'undefined' and abandon the design where both 'null' and 'undefined' coexist. 2023-11-27 09:38:03 +08:00
tree style: reformated codebase 2023-11-16 10:14:14 +08:00
trie feat: All data structures except Graph have implemented *[Symbol.iterator], forEach, filter, map, reduce methods. 2023-11-23 13:19:13 +08:00