Using the holidays for a 2-week coding session. Writing a new transactional memory manager that’s O(1) for all operations, completely non-blocking and progress-guaranteeing, and uses atomics only for writes.
-
-
For large data structures like arrays and dictionaries, I provide a std alternative that uses mostly functional data structures so that you can essentially create low-cost (O log n) forks.
-
Think of LMDB as fast transactions for sparsely updated pages of uniform data, and what I’m attempting as fast transactions in ordinary C++ or script style code.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.