Skip to content

ChaosTree v1.0.0

Choose a tag to compare

View all tags
@Chaos-vy Chaos-vy released this 25 Jun 17:31
· 44 commits to main since this release
v1.0.0
1951426

🎉 ChaosTree v1.0.0 — Initial Release

The first stable public release of ChaosTree.

ChaosTree is a zero-dependency Java search tree library focused on correctness, performance, and clean API design. This release introduces complete Binary and N-ary search tree families, backed by extensive testing, benchmarking, and architectural documentation.

Highlights

Binary Family

  • Binary Search Tree (BST)
  • AVL Tree
  • Red-Black Tree (RBT)
  • Treap
  • Splay Tree

N-ary Family

  • B-Tree
  • B+ Tree

Core API

  • ITree abstraction
  • ISearchTree contract
  • BinaryTree API
  • NaryTree API

Features

  • Collection-style operations
  • Java Stream support
  • Range queries
  • Priority operations (pollMin, pollMax)
  • Multiple traversal strategies
  • ASCII tree visualization

Engineering

  • 579 automated tests
  • Randomized fuzz testing
  • Concurrent-access validation
  • JPMS module support
  • JavaDoc documentation
  • Cross-platform CI (Ubuntu, Windows, macOS)
  • Verified on JDK 17, 21, 25, and 26

Documentation

  • Architecture documentation
  • 11 Architecture Decision Records (ADRs)
  • Binary & N-ary API guides
  • Complexity and implementation notes
  • JMH benchmark suite
  • Hardware-counter-backed performance analysis

Thank you for checking out ChaosTree. This release marks the beginning of the project, and future versions will continue expanding its capabilities while maintaining a strong focus on correctness, performance, and maintainability.

Assets 2
Loading