BTree
by attaswift
Fast sorted collections for Swift using in-memory B-trees
AI summary
B-tree collection library
A package that provides fast and efficient in-memory data structures using B-tree technology
- stars
- 1.3K
- forks
- 76
- watching
- 31
- awesome lists
- 2
Similar projects
Found by comparing what the projects do, not just their names.
B+Tree index
A minimal B+Tree indexing structure implementation for efficient key-value storage
B-tree library
An implementation of an immutable B-tree data structure optimized for disk storage and efficient querying.
Big integer library
A pure Swift implementation of arbitrary-precision arithmetic for integers and floating-point numbers
BTree
An implementation of a BTree data structure for use in Smalltalk programming
BTree library
A library implementing a functional BTree data structure
Tree Segmentation Library
A Pythonic library for semantic tree segmentation from aerial imagery
Binary tree viewer
A tool for visualizing and manipulating binary trees in Swift
Bit tree library
An implementation of crit-bit trees for efficient key/value storage and lookup in Haskell
KD tree library
A C library implementation of a data structure for fast searching and nearest neighbor queries in k-dimensional space
Swipe cell library
A Swift library for creating swipeable table cells with customizable interactions and animations.
Spatial tree
An efficient spatial data structure for fast point query operations
Swift snippets
A collection of reusable code snippets for Swift development
Binary Tree Tutorial
An interactive tutorial on Binary Search Trees designed for the Swift Playgrounds application on iPads
Spatial index library
An in-memory R-tree implementation designed for fast spatial searching and indexing
Payment processor
A Ruby library providing access to the Braintree payment gateway
Featured in 2 awesome lists
Each link jumps to the spot where the list mentions BTree.
