BTree
B-tree collection library
A package that provides fast and efficient in-memory data structures using B-tree technology
Fast sorted collections for Swift using in-memory B-trees
1k stars
31 watching
76 forks
Language: Swift
last commit: almost 3 years ago
Linked from 2 awesome lists
btreecollectionorderedcollectionsearch-treesswift
Related projects:
Repository | Description | Stars |
---|---|---|
| A minimal B+Tree indexing structure implementation for efficient key-value storage | 1,866 |
| An implementation of an immutable B-tree data structure optimized for disk storage and efficient querying. | 116 |
| A pure Swift implementation of arbitrary-precision arithmetic for integers and floating-point numbers | 768 |
| An implementation of a BTree data structure for use in Smalltalk programming | 0 |
| A library implementing a functional BTree data structure | 5 |
| A Pythonic library for semantic tree segmentation from aerial imagery | 243 |
| A tool for visualizing and manipulating binary trees in Swift | 58 |
| An implementation of crit-bit trees for efficient key/value storage and lookup in Haskell | 138 |
| A C library implementation of a data structure for fast searching and nearest neighbor queries in k-dimensional space | 396 |
| A Swift library for creating swipeable table cells with customizable interactions and animations. | 68 |
| An efficient spatial data structure for fast point query operations | 43 |
| A collection of reusable code snippets for Swift development | 1,755 |
| An interactive tutorial on Binary Search Trees designed for the Swift Playgrounds application on iPads | 24 |
| An in-memory R-tree implementation designed for fast spatial searching and indexing | 316 |
| A Ruby library providing access to the Braintree payment gateway | 446 |