bjoli/PersistentMap
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Update PersistentMap/Readme.org

Browse source
This commit is contained in:
Linus Björnstam 2026-04-25 16:26:37 +00:00
parent d21b9cbe06
commit 06e5144d82
1 changed files with 1 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

2
PersistentMap/Readme.org
View file

@ -2,7 +2,7 @@
A high-performance, persistent (Copy-on-Write) B+ Tree implemented in C#. A high-performance, persistent (Copy-on-Write) B+ Tree implemented in C#.
It is designed for zero-overhead reads, SIMD-accelerated key routing, and allocation-free range queries. It supports both fully immutable usage and "Transient" mode for high-throughput bulk mutations. It is designed for zero-overhead reads, SIMD-accelerated key routing, and allocation-free range queries. It supports both fully immutable usage and "Transient" mode for high-throughput bulk mutations. The primary use case is for when editing operations are in bulk. Updating single elements many times will fail to distinguish this collection from other more mature collections. Bulk writes are very fast using transient interfaces, random reads are fastish depending on key type and entropy, Sequential reads and min/max queries are very fast.
** Features ** Features
- *Copy-on-Write Semantics*: Thread-safe, immutable tree states. Modifying the tre yields a new version while sharing unmodified nodes. - *Copy-on-Write Semantics*: Thread-safe, immutable tree states. Modifying the tre yields a new version while sharing unmodified nodes.