data-structure-typed/test/unit/data-structures
2024-01-31 10:04:21 +08:00
..
binary-tree feat: When comparing two values in the Heap and binary search tree, if one of the values is of object type, it is mandatory to pass a custom comparator function. 2024-01-29 20:23:06 +08:00
graph Refactor: All binary tree data structures now support the toEntryFn for extracting key and value from raw data at once, avoiding users from having to traverse data multiple times, thus improving performance. Chore: Explicitly use the override keyword. 2024-01-26 18:20:15 +08:00
hash fix: Fix bug #71. 2024-01-03 15:52:10 +08:00
heap feat: Provide custom toElementFn in Heap configuration options to transform user raw data into a specified element type within a single loop. 2024-01-31 10:04:21 +08:00
linked-list Refactor: Standardize addition and removal methods for all sequential data structures to push, pop, shift, unshift. 2024-01-09 12:04:50 +08:00
matrix refactor: Remove the _addTo method from BinaryTree and TreeMultiMap. 2023-12-22 19:59:38 +08:00
priority-queue feat: Provide custom toElementFn in Heap configuration options to transform user raw data into a specified element type within a single loop. 2024-01-31 10:04:21 +08:00
queue Refactor: Standardize addition and removal methods for all sequential data structures to push, pop, shift, unshift. 2024-01-09 12:04:50 +08:00
stack fix: Fix bug #71. 2024-01-03 15:52:10 +08:00
trie fix: Fix bug #71. 2024-01-03 15:52:10 +08:00