minmaxheap
Heap data structure
An implementation of a heap data structure with minimum and maximum access
Heap with minimum and maximum access
2 stars
1 watching
0 forks
Language: Nim
last commit: almost 6 years ago
Linked from 1 awesome list
ringabout/awesome-nimRelated projects:
| Repository | Description | Stars |
|---|---|---|
 qiao/heap.js | A binary heap data structure implementation in CoffeeScript/JavaScript for efficient priority management | 126 |
 bluenote10/nim-heap | A binary heap data structure implementation in Nim language | 20 |
 sirherrbatka/cl-data-structures | A collection of reusable data structures and streaming algorithms in Common Lisp. | 48 |
 takscape/elixir-heapq | A priority queue implementation in Elixir using a heap data structure. | 8 |
 orium/rpds | A Rust implementation of persistent data structures with structural sharing | 1,299 |
 garro95/priority-queue | A data structure for efficiently managing items with priorities | 177 |
 hardikp/cpp-mempool | A C++ library for managing memory pools with efficient allocation and deallocation | 19 |
 recp/ds | A collection of common data structures and algorithms implemented in C. | 51 |
 michaeljwelsh/cdsa | A collection of generic, intrusive data structures and algorithms implemented in ANSI C. | 602 |
 viking-sudo-rm/stacknn | This project provides differentiable stacks and queues in PyTorch to facilitate the integration of data structures into models. | 142 |
 thenumbat/rpp | A C++20-inspired library providing basic data structures and memory management utilities with a focus on performance and explicit control | 168 |
 josh-hemphill/maxminddb-deno | A WASM module that enables geoIP database lookups | 8 |
 primlabs/bucket | A library providing a simple storage solution using stable memory, allowing canisters to store data without GC costs and upgradeability. | 31 |
 justcoding121/advanced-algorithms | A comprehensive C# library implementing various data structures and algorithms | 1,320 |
| stefansalewski/rtree | A data structure for efficient spatial searching and indexing of objects in high-dimensional space. | 26 |