22 Feb
2012
22 Feb
'12
7:04 p.m.
On 22/02/12 02:00, Ben Robinson wrote:
On Tue, Feb 21, 2012 at 9:18 AM, Antony Polukhin <antoshkka@gmail.com>wrote:
How fast is your library? Does it support unsigned long long int overflow detection?
The library is meta-programmed with respect to the data types involved in each overloaded math operation, taking advantage is performance savings, such as when both data types are unsigned (see my more complete performance response above to a previous email).
Addition overflow detection for example involves a single subtract, along with from one to three compares.
Would you be open to providing assembly implementations to supplement the existing portable implementation if there was demand and they were faster? John Bytheway