attaswift/BTree

Health v2 · maintenance only

Adoption not part of the score

1323 stars · 73 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

A pure Swift library providing efficient in-memory B-tree implementations and sorted collection types like Map, List, SortedSet, and SortedBag. It offers logarithmic-complexity alternatives to Swift's standard Dictionary, Array, and Set with strong worst-case performance guarantees.

Use cases

• sorted dictionary in Swift without hashable keys
• fast insertion and removal at arbitrary indices in a list
• sorted set with efficient set operations
• sorted multiset (bag) implementation
• persistent ordered collections with O(log n) operations

When to choose

• you need sorted collections with guaranteed logarithmic worst-case performance in Swift
• your keys are comparable but not hashable
• you frequently concatenate, splice, or extract subranges of large lists

When to avoid

• you only need simple dictionaries or arrays with typical small data sizes
• you need actively maintained dependencies with recent Swift concurrency support
• you require on-disk or database-backed B-trees rather than in-memory structures

Facets

library · maturity maintenance

search-engine developer-tools performance cross-platform btree sorted-collections swift-package data-structures algorithms macos ios swift

Member repositories

For agents

markdown · JSON · MCP: product_card(name="attaswift/BTree")