3 ms·
Well luckily, Haskell is full of said "specialized structures." containers and unordered-containers handle most of your needs and they only copy their trees' s
by whateveracct 2y ago
Well luckily, Haskell is full of said "specialized structures."
containers and unordered-containers handle most of your needs and they only copy their trees' spines (O log n) on update.
- eru 2y agoHaskell also support eg arrays with O(1) in-place updates just fine.