A hash array-mapped trie implementation in C
Postmodern immutable and persistent data structures for C++ — value semantics at scale (by arximboldi)
How does this compare to https://github.com/arximboldi/immer (other than the C/C++ difference)?
Also, it's my understanding that, in practice, persistent data structures require a garbage collector in order to handle deallocation when used in a general-purpose way. How does your implementation handle that?
Learn any GitHub repo in 59 seconds. Onboard AI learns any GitHub repo in minutes and lets you chat with it to locate functionality, understand different parts, and generate new code. Use it for free at www.getonboard.dev.
value semantics and spans/views
1 project | /r/cpp | 11 Jun 2023
Purely Functional Data Structure by Chris Okasaki [pdf]
3 projects | news.ycombinator.com | 30 May 2023
Persistent and immutable data structures written in C++14
1 project | news.ycombinator.com | 10 May 2023
What are some architectural patterns for creating a game editor.
1 project | /r/gameenginedevs | 11 Mar 2023
TypeScript Without Side Effects
4 projects | /r/typescript | 22 Feb 2023