Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

fix(data-structures): ensure size consistency in BinarySearchTree.from #6272

Merged
merged 1 commit into from
Dec 16, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions data_structures/binary_search_tree.ts
Original file line number Diff line number Diff line change
Expand Up @@ -281,6 +281,7 @@ export class BinarySearchTree<T> implements Iterable<T> {
nodes.push(right);
}
}
result.#size = collection.#size;
}
} else {
result = (options?.compare
Expand Down
2 changes: 2 additions & 0 deletions data_structures/binary_search_tree_test.ts
Original file line number Diff line number Diff line change
Expand Up @@ -392,6 +392,7 @@ Deno.test("BinarySearchTree.from() handles default ascend comparator", () => {
let tree: BinarySearchTree<number> = BinarySearchTree.from(originalTree);
assertEquals([...originalTree], expected);
assertEquals([...tree], expected);
assertEquals(tree.size, originalTree.size);
assertEquals([...tree.nlrValues()], [...originalTree.nlrValues()]);
assertEquals([...tree.lvlValues()], [...originalTree.lvlValues()]);

Expand Down Expand Up @@ -443,6 +444,7 @@ Deno.test("BinarySearchTree.from() handles descend comparator", () => {
let tree: BinarySearchTree<number> = BinarySearchTree.from(originalTree);
assertEquals([...originalTree], expected);
assertEquals([...tree], expected);
assertEquals(tree.size, originalTree.size);
assertEquals([...tree.nlrValues()], [...originalTree.nlrValues()]);
assertEquals([...tree.lvlValues()], [...originalTree.lvlValues()]);

Expand Down
Loading