Jeffrey Hellrung wrote:
Chad, what Joel is referring to as "multithreaded" is really "thread-safe" in the context of your library, right? I mean, not that Joel is using incorrect terminology on purpose, but maybe some terms and intents got confused during the discussion. You (Chad) don't actually implement any distributed arithmetic algorithms, right? Oh indeed. Yeah /s/multithreaded/thread-safe/ sorry for the miscommunications there. I thought the second but wrote the first.
Regarding COW specifically: I'm guessing COW will be a tough sell, and I'm having a hard time swallowing that COW is 2x faster than (even emulated) move semantics. Is the performance difference strictly from differing numbers of copy operations? Can you identify (i.e., give an example of a real algorithm) where a move-enabled xint::integer produces more copies than a COW-enabled xint::integer? I'm inerested in there too.
-- ___________________________________________ Joel Falcou - Assistant Professor PARALL Team - LRI - Universite Paris Sud XI Tel : (+33)1 69 15 66 35