4 ms·

I'm not sure about any, but a lot of the persistent data structures seem to fit within that limit, and it's what's used in FP languages like Clojure. There's al

I'm not sure about any, but a lot of the persistent data structures seem to fit within that limit, and it's what's used in FP languages like Clojure. There's also some compiler research of identifying when something won't be used anymore and simply doing the mutation in-place, which can reduce even further the costs incurred by immutability

_a_a_a_ 3y ago
Cost of addition: 1 cycle (I think). Cost of a read or write to RAM: 150 to 200 cycles, and it gets worse from there if you have a TLB miss It gets complex, but basically don't believe me or anything else you read without digging into it and asking why and what.