apple/swift-collections
Swift Collections
This library provides a collection of specialized data structures for the Swift language that extend the standard library with advanced container types. It includes implementations for double-ended queues using ring-buffers, priority queues based on min-max heaps, and memory-efficient bit-set and bit-array storage for boolean values.
The project features ordered collections that maintain elements in sorted order via B-tree implementations, as well as persistent sets and dictionaries that use compressed prefix trees to share data between mutated copies. It also provides specialized containers that preserve insertion order.
The library covers a range of capabilities including low-level memory management for C buffers and noncopyable values, fixed-capacity storage, and the use of robin hood hashing to optimize memory utilization and lookup speeds.
Features
- High-Performance Containers - Provides a comprehensive suite of high-performance Swift data structures, including priority queues and deques.
- Swift Collection Libraries - Provides a comprehensive suite of specialized data structures and advanced container types for the Swift language.
- Persistent Collections - Implements persistent collections using compressed prefix trees to share data between mutated copies.
- Priority Queues - Implements priority queues using a min-max heap backed by an array for efficient priority-based retrieval.
- Insertion-Order Maps - Provides specialized set and dictionary variants that preserve the original sequence of inserted elements.
- B-Tree - Implements B-tree based sorted sets and dictionaries for logarithmic search and mutation performance.
- Persistent - Ships persistent sets and dictionaries based on compressed prefix trees for efficient data sharing.
- C Memory Management - Provides low-level memory management for C buffers to enable safe data exchange with system components.
- Noncopyable Value Wrappers - Implements heap-allocated wrappers to manage the memory and ownership of noncopyable Swift values.
- Low-Level Swift Memory Management - Handles C buffers and noncopyable values to safely manage heap allocation and system interoperability.
- Double-Ended Queues - Implements double-ended queues using a ring-buffer to provide constant-time insertions and removals from both ends.
- Ordered Collections - Provides sequential data structures that maintain element order and support integer-based indexing.
- Persistent Data Structures - Implements collections and containers that preserve previous versions through structural sharing to ensure immutability.
- Sorted Collection Libraries - Offers collection types that maintain elements in strictly increasing order via B-tree implementations.
- Priority Queues - Provides a priority queue implementation based on a min-max heap for rapid retrieval of extremum values.
- Noncopyable Value Wrappers - Wraps noncopyable values in heap-allocated containers to manage their memory and ownership.
- Fixed-Capacity Containers - Provides arrays, sets, and dictionaries with strictly defined maximum capacities.
- Robin Hood Hashing - Uses a robin hood hashing strategy in hashed containers to optimize memory utilization and lookup speeds.
- Memory Optimization Strategies - Optimizes memory utilization and lookup stability using hashed containers with a robin hood distribution strategy.
- In-Memory B-Trees - Ships sorted sets and dictionaries powered by a B-tree implementation for efficient in-memory lookups.
- Memory Efficiency Strategies - Implements bit maps and specialized hashed containers to reduce memory overhead in Swift applications.
- Bit-Packed Storage - Provides memory-efficient bit-set and bit-array implementations for optimizing boolean storage.
Star history
How this analysis was created: This summary and feature list were written by an AI model that read the project's README and public documentation pages. Each feature links to the documentation it came from; stars, license and language come straight from the GitHub API. The model does not read the source code, and the analysis is refreshed when the project is re-analysed. Learn more on our About page.
