red_black_tree_collection 1.3.1

High performance Red-Black Tree based Set and Map data structures that provide ordered collections with efficient search, insertion, and deletion operations.

1.3.1

• Ensure root to be black after deletion to maintain red-black property.

1.3.0

• Optimize deletion fixup logic.

1.2.0

• Update deletion operation to satisfy the strict lower bound complexity.

1.1.1

• Lint fix.
• README update.

1.1.0

• README and api doc update.
• Support RBTreeMap concurrent update error detection.
• More tests and some minor fixes.

1.0.0

• Custom iterable exception.
• Set concurrent modification detection.

0.0.1

• Initial release of RBTreeSet and RBTreeMap