StableHeapBTreeMap
BTree library
A library implementing a functional BTree data structure
A functional BTreeMap that can be used with a stable variable in heap memory
5 stars
4 watching
3 forks
Language: Motoko
last commit: over 2 years agoLinked from 1 awesome list
Related projects:
| Repository | Description | Stars |
|---|---|---|
| Provides persistent, stable hash map implementations in Motoko | 14 | |
| An implementation of a stable data structure based on Red Black Trees in the Motoko programming language. | 3 | |
| A Motoko library implementing stable, persistent buffers with a standardized API | 12 | |
| An implementation of a BTree data structure for use in Smalltalk programming | 0 | |
| A package that provides fast and efficient in-memory data structures using B-tree technology | 1,312 | |
| A data structure library for efficient bitset management | 770 | |
| A library providing stable and mutable singly and doubly linked list implementations in Motoko. | 2 | |
| A minimal B+Tree indexing structure implementation for efficient key-value storage | 1,866 | |
| A C++ library that provides simple and fast bitmap manipulation functionality. | 36 | |
| An implementation of the C++20 Ranges proposals in a single header library | 359 | |
| A C library for loading and manipulating bitmap raster graphics | 70 | |
| A C++ implementation of fast hash maps and sets using robin hood hashing | 1,294 | |
| An optimized C library for compressing and manipulating bitmaps to improve performance on modern hardware | 1,582 | |
| A library providing a data structure for bidirectional mappings between two sets of keys and values | 7 | |
| Provides data structures and utilities for working with stable, persistent data in multiple programming languages. | 1 |