Re: How multiprecision optimizes allocation?

From: John Maddock (jz.maddock_at_[hidden])
Date: 2019-11-05 08:36:50

On 05/11/2019 06:12, Andy via Boost-users wrote:
> I have tested boost::mulitprecision::cpp_int
> and have tested simplest algorithm for int multiplication
> My test method is several times slower than boost multiplication 
> because I resized product vector to size fist + size second. This 
> allocation take most time, if I use static array on stack, it will be 
> fast for small numbers. What is the riddle of fast comnputing z = x*y 
> in loop for quite small x and y in Boost cpp_int?

There's no allocation for small numbers.

John.

-- 
This email has been checked for viruses by Avast antivirus software.
https://www.avast.com/antivirus