Skip to content

feat: Add cached size to internal nodes #49

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.

Sign up for GitHub

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

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

feat: Add cached size to internal nodes #49

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
b282902
add cached size and more robust checkValid
taylorsw04 Nov 21, 2025
21f63ce
cleanup from BTreeEx
taylorsw04 Nov 25, 2025
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
4 changes: 1 addition & 3 deletions b+tree.d.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -105,7 +105,6 @@ export declare function simpleComparator(a: (number | string)[], b: (number | st
*/
export default class BTree<K = any, V = any> implements ISortedMapF<K, V>, ISortedMap<K, V> {
private _root;
_size: number;
_maxNodeSize: number;
/**
* provides a total order over keys (and a strict partial order over the type K)
Expand Down Expand Up @@ -416,8 +415,7 @@ export default class BTree<K = any, V = any> implements ISortedMapF<K, V>, ISort
/** Scans the tree for signs of serious bugs (e.g. this.size doesn't match
* number of elements, internal nodes not caching max element properly...)
* Computational complexity: O(number of nodes), i.e. O(size). This method
* skips the most expensive test - whether all keys are sorted - but it
* does check that maxKey() of the children of internal nodes are sorted. */
* validates ordering of keys (including leaves) and cached size information. */
checkValid(): void;
}
/** A TypeScript helper function that simply returns its argument, typed as
Expand Down
172 changes: 137 additions & 35 deletions b+tree.js
View file
Open in desktop

Large diffs are not rendered by default.

Loading