Is all this Invarient **** er... stuff, premature optimisation?

[Sean Kelly]

== Quote from Walter Bright (newshound1 at digitalmars.com)'s article
> Me Here wrote:
> > If that describes copy-swap then yes. Else no :)
> copy-swap is what lock free algorithms rely on for updating a data
> structure. It's at the root of STM, and even has its own TLA, CAS (Copy
> And Swap).

I believe CAS actually stands for "compare and swap" or "compare and set"
depending on who you talk to.  RCU is probably a more popular algorithm
for copy and swap--it's used in the Linux kernel quite a bit.  It stands for
"read, copy, update," I believe.


Sean