Revone 9d4228c9fe refactor: Represent the optional parameters in the dijkstraWithoutHeap and dijkstra methods using default arguments. Use the Heap data structure instead of PriorityQueue.		2023-12-11 09:41:24 +08:00
..
binary-tree	perf: The add method of BinaryTree doesn't need to check for existence first, it can detect and add in a single traversal. Feat: Discard the ObjectDeque data structure. test: Increased test coverage for Deque and Queue.	2023-12-08 19:54:13 +08:00
graph	refactor: Represent the optional parameters in the dijkstraWithoutHeap and dijkstra methods using default arguments. Use the Heap data structure instead of PriorityQueue.	2023-12-11 09:41:24 +08:00
hash	refactor: Extract all methods such as 'some', 'every', 'entries', 'keys', 'values', 'forEach', 'reduce' into the base classes 'IterableElementBase' and 'IterablePairBase'.	2023-12-02 22:15:18 +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: Rewrite the lastKey method. The BinaryTree.add method filters out duplicate additions. Rename popLast and popFirst to pollLast and pollFirst.	2023-12-07 19:34:20 +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	perf: The add method of BinaryTree doesn't need to check for existence first, it can detect and add in a single traversal. Feat: Discard the ObjectDeque data structure. test: Increased test coverage for Deque and Queue.	2023-12-08 19:54:13 +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