sorta
Sorted data library
An implementation of sorted data structures using B-Trees in the Nim programming language
SortedTables in Nim, based on B-Trees
17 stars
6 watching
3 forks
Language: Nim
last commit: over 4 years ago
Linked from 1 awesome list
b-treebtreenimnim-langsortedsorted-datasorted-dictsorted-dictionarysorted-maptable
ringabout/awesome-nimRelated projects:
| Repository | Description | Stars |
|---|---|---|
| narimiran/itertools | A set of iterators and utilities for working with sequences in a Nim programming language | 134 |
 wildgums/orc.sort | Provides a collection of algorithms for sorting data in a programming language | 17 |
 igrmk/treemap | A generic sorted map implemented using a red-black tree under the hood | 61 |
 medhiwidjaja/nary_tree | An Elixir implementation of a generic tree data structure with node-based model and traversal APIs | 18 |
 scandum/blitsort | An in-place sorting algorithm that partitions arrays recursively using rotations and auxiliary memory management | 703 |
 mattreecebentley/plf_indiesort | A sorting algorithm that optimizes performance on non-random access containers and large data types | 19 |
 swenson/sort | A comprehensive C sorting library providing various stable and unstable algorithms with generic implementations | 464 |
 vrana/notorm | A PHP library for simple data access and manipulation in databases | 860 |
 dogweather/naturally | An algorithm to sort strings according to natural ordering with support for hierarchical identifiers and Unicode characters | 87 |
 yourbasic/radix | A fast string sorting algorithm implemented in Go. | 192 |
 omar-dulaimi/prisma-schema-sorter | Tools for organizing and structuring Prisma schema models | 23 |
 ndantam/sycamore | A fast and functional data structure library in Common Lisp. | 120 |
 sqve/sort.nvim | A plugin that simplifies text sorting in Neovim by providing an intuitive command-line interface for both line-wise and delimiter-based sorting. | 137 |
 shady831213/algorithms | A collection of algorithms and data structures implemented in Go. | 806 |
| scandum/quadsort | A branchless stable adaptive mergesort algorithm with minimal comparisons and optimal performance on ordered data | 2,136 |