go-adaptive-radix-tree
Sorted Data Structure
A data structure implementation that combines the benefits of search and insertion operations in a sorted order, suitable for use cases where fast lookup and efficient insertion/deletion are necessary.
Adaptive Radix Trees implemented in Go
368 stars
9 watching
52 forks
Language: Go
last commit: 6 days ago
Linked from 2 awesome lists
gotrie
avelino/awesome-go
xwjdsh/awesome-go-extraRelated projects:
| Repository | Description | Stars |
|---|---|---|
 armon/libart | A C implementation of an efficient data structure for fast lookups and prefix matching in memory databases. | 771 |
 antirez/rax | An ANSI C implementation of a radix tree data structure | 1,121 |
 api7/lua-resty-radixtree | A library implementing an adaptive radix tree data structure to store and match routes for routing and filtering purposes. | 256 |
 luislavena/radix | Implementation of a Radix Tree data structure for efficient path-based routing and lookup in a programming language. | 102 |
 tidwall/rtree | An in-memory R-tree implementation designed for fast spatial searching and indexing | 314 |
 viant/ptrie | A Go library implementing a fast and efficient prefix tree data structure for storing and retrieving key-value pairs in various formats. | 42 |
 s0rg/quadtree | A data structure implementation that efficiently stores and retrieves spatial locations using a quadtree algorithm. | 37 |
 rtanno21609/adaptiveneuraltrees | An implementation of Adaptive Neural Trees in PyTorch for deep learning | 151 |
 arl/go-rquad | A Go library implementing various quadtree data structures for efficient point location and neighbor finding in 2D spaces. | 134 |
 sgrodriguez/ddt | A Go-based decision tree library allowing custom rule-based decision making | 37 |
 igrigorik/decisiontree | An implementation of the ID3 algorithm for building decision trees | 1,439 |
 sbourlon/go-lctree | Provides data structures and utilities for serializing and deserializing LeetCode-style binary trees | 4 |
 crusj/hierarchy-tree-go.nvim | Displays call chains and hierarchical relationships in Go source code | 29 |
 talgalili/dendextend | Enhances R's dendrogram functionality with additional features and functions | 153 |
 jblindsay/kdtree | An efficient spatial data structure for fast point query operations | 43 |