Revone 93201bddba 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
..
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: renamed variables	2023-12-06 11:32:04 +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
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
priority-queue
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
tree
trie