From: Keith Burton (kb_at_[hidden])
Date: 2002-11-26 03:39:08
For the ignorant like me , would you care to explain under what
circumstances this is true.
I can see the case that a one off virtual function call is much slower
because the called code needs to loaded into ( cache ) memory but I
assume you are referring to more than this.
> -----Original Message-----
> No, Robert, one virtual function call can be much slower than changing
> byte order when copying integers.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk