x/data-structure-typed
1
0
Fork 0
mirror of https://github.com/zrwusa/data-structure-typed.git synced 2024-11-23 21:04:04 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity
550 commits 11 branches 7 tags 40 MiB
Commit graph

289 commits

Author SHA1 Message Date
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
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
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 3e91a97987 fix: #89. Supports maxLen for max length of the Deque 2024-08-04 19:19:14 +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 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
Revone 02d71a23ba 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
Revone 3c26538c2e release: 1.51.8 2024-01-25 10:55:59 +08:00
Revone 0013242189 Refactor: In the binary search tree data structure, use a comparator instead of a variant configuration for comparison. 2024-01-25 10:24:25 +08:00
Revone 89dadfccc2 Refactor: Remove the unnecessary design of the extractor in the Binary Search Tree (BST). Utilize 1, -1, and 0 to replace the original comparison results GT, LT, and EQ. 2024-01-25 09:38:03 +08:00
Revone 1303aba070 refactor: Use Comparable type constraint for the key in the binary tree to improve comparator performance. 2024-01-24 18:38:34 +08:00
Revone ae11bca83c Refactor: Added the _ensureCallback method to eliminate redundant code. 2024-01-19 18:02:56 +08:00
Revone 3fa7155c97 fix: #82. refactor: Minor performance optimization, rewrite the _compare method within the Red-Black Tree. test: Change the test sequence in binary-tree-overall.test. 2024-01-19 17:13:25 +08:00
Revone 18b1fab16d feat: Restore the TreeNode data structure. Add number utilities to the utils module. docs: Update POSTS_zh-CN.md. 2024-01-17 22:27:38 +08:00
Revone 25e9f36577 feat: Remove the meaningless Tree data structure. 
refactor: Adjust the logic of isRealNode for a slight performance improvement.
docs: table fixed
 2024-01-16 11:26:43 +08:00
Revone 56f1fabfca refactor: Renaming SENTINEL to NIL and placing the NIL node in the BinaryTree allows for direct equality checks in isNIL and isRealNode, avoiding excessive operations to improve performance. As a result, the performance of the get method in AVLTree has tripled. 2024-01-15 21:05:42 +08:00
Revone 9915ce9a0d Refactor: Rename _defaultOneParamCallback to _DEFAULT_CALLBACK. Adopt early return code style in the ensureNode method. Rename some internal recursive method names. 2024-01-15 12:12:01 +08:00
Revone 76df347da5 efactor: completely eliminate the use of enumerations 2024-01-14 19:49:50 +08:00
Revone 25de27cf6c fix: Explicitly specify IterationType. 2024-01-14 18:59:28 +08:00
Revone a11c104dff refactor: Replace all enumerations with union types for significant performance improvements in BST, AVLTree, and RedBlackTree. 2024-01-14 03:04:07 +08:00
Revone a653d465fa Refactor: Use 'this.isRealNode' instead of explicit null checks in getHeight, getMinHeight, and getNodeByKey methods in the binary tree. In the red-black tree, directly invoke the parent class getNode method, significantly improving the speed of red-black tree node deletion and retrieval. 2024-01-12 14:15:05 +08:00
Revone 644ce69190 Refactor: Review methods in the binary tree that require explicit 'override' annotation. Feat: Add the 'getMutableCount' method to AVLMultiMap. 2024-01-12 11:28:15 +08:00
Revone e1631a8e3e refactor: Define a generic CRUD enum to represent operational states. 2024-01-12 11:07:33 +08:00
Revone 1f8fc1487c Refactor: Due to critical issues in the previous implementation of the Red-Black Tree, it has been deprecated and replaced with a new implementation of both the Red-Black Tree and TreeMultiMap. 2024-01-11 20:13:02 +08:00
Revone f8832a04c0 refactor: Constrain the getter size() from the base class. Refactor some inappropriate performance tests. 
feat: Add sorting capability to performance test reports.
 2024-01-09 15:57:30 +08:00
Revone 4747839d88 Refactor: Standardize addition and removal methods for all sequential data structures to push, pop, shift, unshift. 2024-01-09 12:04:50 +08:00
Revone 465744c2ec feat: Replace the AVLTree with a Red-Black Tree to implement TreeMultiMap, preserving the implementation of TreeMultiMap using AVLTree and renaming it as AVLTreeMultiMap. 2024-01-08 22:22:41 +08:00
Revone 5c9f4fd483 fix: #74 . Refactor: Implement the Tarjan algorithm separately for DirectedGraph and UndirectedGraph. In the previous design, the tarjan method was placed in the AbstractGraph class. However, Tarjan algorithm is used to find connected components in directed graphs and to solve bridges, articulation points, determine the presence of cycles (though not all), and biconnected components in undirected graphs. The algorithm for finding all cycles in the graph can be shared between directed and undirected graphs using the getCycles method. 2024-01-07 22:25:25 +08:00
Revone e91970c09f refactor: Directly constrain the methods clear, map, and filter in the base class. 
feat: Implement the clear method in DirectedGraph, UndirectedGraph, and Trie.
docs: Add SPECIFICATION.md, SPONSOR.md, and SPONSOR_zh-CN.md. Adjust badge order and add a new contributor count badge.
 2024-01-06 17:50:00 +08:00
Revone ba16f311c3 Refactor: Organize the access permissions of all member variables. Docs: Partial documentation for time and space complexity. 2024-01-05 15:37:28 +08:00
Revone eaf8912746 docs: Verify the time and space complexity for each method. 
feat: Add the cutRest method to Deque.
refactor: Update the cut method in Deque to support the isCutSelf parameter.
 2024-01-04 16:28:17 +08:00
Revone ecf4d6ad11 fix: Fix bug #71. 
feat: Define abstract methods through a base class to add clone and isEmpty methods to all data structures. Add delete and deleteAt methods to Deque, Queue, and Stack data structures.
refactor: Optimize the type definition N to NODE for alignment with the design of TREE.
 2024-01-03 15:52:10 +08:00
Revone 58ea2cb3c3 docs: Complete all code comments. 2024-01-01 10:45:32 +08:00
Revone 831ad3bd98 refactor: rename method 'getAt' to 'at' 2023-12-30 20:36:11 +08:00
Revone ff8f907192 feat: In the IterableEntryBase and IterableElementBase classes, add find, get, and has methods so that all inheriting data structures can have access to these methods. Also, override these methods in the necessary data structures as needed. 2023-12-30 18:44:24 +08:00
Revone c28deb8d81 refactor: Rename exemplarToNode to keyValueOrEntryToNode. feat: Implement the clone method for all data structures. 2023-12-30 17:50:57 +08:00
Revone baf1be4035 release: 1.50.0. docs: traversal methods 2023-12-29 11:24:25 +08:00
Revone 34d4abd9e6 fix: #38 Removed includeNull parameter from traversal methods. 
feat: Removed unnecessary methods isNotNodeInstance and subTreeTraverse.
refactor: Organized the overloads of traversal methods.
 2023-12-29 11:15:19 +08:00