Revone
6ef4b47b0b
docs: Complete the documentation for the print method in BinaryTree. Correct the unit tests for the print method.
2024-10-31 16:44:01 +13:00
Revone
9ace395564
fix: Fix bug in BinaryTree.print to support undefined, null, and NIL. Fix #106
2024-10-31 16:18:51 +13:00
Revone
0a8b9265cc
fix : #110
2024-10-31 13:26:45 +13:00
Revone
761c1c6af4
fix : #110
2024-10-31 13:20:00 +13:00
Revone
5992ae5d0d
release: v1.52.8 wiht ci flow fixed
2024-10-31 09:41:03 +13:00
Revone
9e62968e3d
release: v1.52.8
2024-10-30 21:28:20 +13:00
Revone
487f45f6b2
release: v1.52.7
2024-10-30 21:00:03 +13:00
Revone
6428e0f228
fix: Bug fix #103 : Fixed an issue where all binary tree clone methods lost constructor parameters. Optimized variable names. Standardized access modifiers for binary tree member variables.
2024-10-30 20:52:23 +13:00
Revone
fc0d157295
refactor: Test coverage increased to 95.63%.
...
Upgraded all dependencies.
Added a toVisual method while retaining the print method.
Replaced all short-circuit evaluations with logical expressions.
2024-10-30 15:30:28 +13:00
Revone
aece11bd01
release: v1.52.6
2024-10-29 17:27:40 +13:00
Revone
a29dc270e6
Change the print method to return a value instead of directly calling console.log.Unify the logic of all keyValueOrEntryOrRawElementToNode methods in BinaryTree.
...
Use a generic isComparable method to determine if a value is comparable in size when using the isKey method in the BinaryTree.
Fix the boundary value bug in the getNodes method of BinaryTree.
Support callback functions in getLeftMost and getRightMost to support returning results with different properties.
If a comparator is specified for BST, the isKey method will force the object type to be comparable.
The isComparable method has been implemented based on JavaScript's comparison principles.
2024-10-29 16:23:24 +13:00
Revone
9f197d48b0
fix: import * as console from 'console' removed
2024-10-21 21:41:56 +13:00
Revone
18fe006652
style: Remove unnecessary comments.
2024-10-21 21:34:51 +13:00
Revone
5a492c1801
refactor: To standardize the _dfs method of the BinaryTree to achieve full generalization.
2024-10-21 20:55:48 +13:00
Revone
e271f73de0
feat: Refactor the BinaryTree's dfs method into a private helper function _dfs to prepare for a more generic implementation.
2024-10-21 19:14:36 +13:00
Revone
42235802c3
fix: The default value for the iterationType parameter in all binary tree methods is the member variable this.iterationType.
2024-10-20 17:22:45 +13:00
Revone
a699b097c7
feat: The leaves method of the binary tree supports both RECURSIVE and ITERATIVE modes.
2024-10-20 16:59:01 +13:00
Revone
85b79ff1ad
feat: All binary tree data structures support the leaves method. It is used to find all leaf nodes.
2024-10-20 15:40:02 +13:00
Revone
ea0d4272df
fix: Fix #100 the return type error in the find method's callback function in IterableEntryBase.
...
Add test cases for HashMap and Stack.
2024-10-19 19:51:49 +13:00
Revone
07dd75de70
test: The test cases have been added, though slightly tricky. The overall test coverage is currently at 93.27%.
2024-10-16 21:55:48 +13:00
Revone
e6acc0f8f1
docs: diagram width
2024-10-11 22:50:11 +13:00
Revone
68d4ca3b10
docs: Merging colloquial descriptions with data structure selection
2024-10-11 22:47:06 +13:00
Revone
2acd0fe366
release: version 1.52.4
2024-10-11 11:07:43 +13:00
zrwusa
e5bdaec771
Merge pull request #95 from philipplentzen/main
...
docs(queue): fix mismatch between typings and jsdoc
2024-10-11 10:33:46 +13:00
Philipp Lentzen
b90da5cf82
docs(queue): fix mismatch between typings and jsdoc
2024-10-10 13:34:19 +02:00
zrwusa
bf37a4df7f
style: optimization of code style of HashMap
2024-09-19 17:20:58 +12:00
Revone
986e7cfd8f
release: v1.52.3
2024-09-03 10:22:22 +12:00
Revone
93981f6932
Merge branch 'main' of https://github.com/zrwusa/data-structure-typed
2024-09-03 09:45:06 +12:00
zrwusa
022c337ca9
Merge pull request #94 from sjunepark/trie
...
fix(trie): trie returns invalid string when only the fist character m…
2024-09-03 09:31:09 +12:00
Revone
f2bbba8a9b
chore: loop to check if remote package is exist
2024-09-03 09:28:46 +12:00
June Park
59cf685395
fix(trie): trie returns invalid string when only the fist character matches, and the second doesn't match
2024-09-03 00:49:53 +09:00
Revone
7e45aaf609
style: Prettier version updated. Code style adhered to Prettier strictly.
2024-08-27 10:56:04 +12:00
Revone
ac1712ba04
feat: supports compact method to save memory. #91
2024-08-27 10:24:38 +12:00
Revone
5ff8eb97d9
release: v1.52.1
2024-08-04 19:41:40 +12:00
Revone
6710e9d41e
release: v1.52.1
2024-08-04 19:20:21 +12:00
Revone
3e91a97987
fix : #89 . Supports maxLen for max length of the Deque
2024-08-04 19:19:14 +12:00
Revone
c7dbfd54f1
fix : #87
2024-08-04 19:05:19 +12:00
Revone
abfb441bc7
docs: priority queue is heap
2024-08-02 10:15:56 +12:00
Revone
6642f8b66b
docs: plain language explanations
2024-07-31 21:04:20 +12:00
Revone
5d146cbfc2
docs: refined the table of deferences of data structures
2024-07-31 14:33:55 +12:00
Revone
7f32fee19a
docs: Added a document detailing the differences between various data structures, including schematic diagrams of the data structures.
2024-07-31 14:10:32 +12:00
Revone
5dc132cb2a
fix : #86
2024-03-16 09:59:48 +08:00
Revone
ec8242044a
refactor: Renamed some type aliases
2024-03-16 09:47:22 +08:00
Revone
94d34e61e7
Merge branch 'main' of https://github.com/zrwusa/data-structure-typed
2024-02-01 23:26:49 +08:00
Revone
8616e4ddc4
release: 1.52.0
2024-02-01 23:26:45 +08:00
Revone
1ae9e929b1
feat: Provide the toElementFn method during instantiation for the entire data structure series, allowing the mapping of raw data to the desired data type and direct insertion of data into the data structure to be completed within a single loop.
...
fix: Override the corresponding clone, filter, and map methods in the Heap and PriorityQueue data structures, ensuring the accurate return of the respective data structures. #84 fixed.
2024-02-01 21:05:10 +08:00
Revone
6539e50598
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
Revone
8051850331
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
Revone
3028a78985
Refactor: Abandon the use of Comparable types as keys for the binary tree, as the '>', '>=', '<', '<=' operators are supported by the any type. The heap also adopts the same comparator as the binary tree.
2024-01-29 11:35:24 +08:00
zrwusa
6fccb57f1b
Update README.md
2024-01-27 11:10:38 +08:00