const node = tree.add(x);
...
tree.unlink(node);

This is currently not possible because, among other potential problems, rotations swap keys of references to save operations.

• predecessor
• successor
• link
• unlink
• _search ~ query or fetch
• and others in https://github.com/aureooms/js-search-tree-spec and #2
• Move all traversal methods to dedicated package.

There is an error with this repository's Renovate configuration that needs to be fixed. As a precaution, Renovate will stop PRs until it is resolved.

Error type: undefined. Note: this is a nested preset so please contact the preset author if you are unable to fix it yourself.

This avoids using multiple Hidden Classes and enables inline caching.

This involves only creating the leaves whose parent pointer is accessed and hard-coding the black color of implicit null leaves in the code somehow. This should be possible because the former is only required at the beginning of a deletion balancing operation, and the latter can be done by breaking symmetry, which is already done to some extent.

This issue provides visibility into Renovate updates and their statuses. Learn more

Open

These updates have all been created already. Click a checkbox below to force a retry/rebase of any.

• ⬆️ deps: Upgrade dependency xo to v0.45.0

• Check this box to trigger a request for Renovate to run again on this repository

• Evaluate whether instanceof checks are faster than isLeaf() calls. Not necessary since we do not use Leaf anymore.
• Rewrite delete_caseX cascade to forward precomputed sibling.
• Find out whether dummy Leaf nodes _color field can be removed. Not necessary since we do not use Leaf anymore.
• Find out whether dummy Leaf nodes can be easily replaced by null (see #104).
• Rewrite insert_caseX cascade to forward precomputed grandparent, potentiall rewritting uncle = (n) => _uncle(n, grandparent(n));
• Break tail recursion of delete_caseX and insert_caseX cascades somehow.