Alexander Bolz

This looks great! Thanks for letting me know! Actually, this repository started out as an implementation of the Girsu2 algorithm. I have since tried to modify Grisu2 such that it...

>> The formatting procedure is actually cheating a little bit :-) I have chosen an output format specifically to print small integers as quickly as possible. So, for small integers...

> Let me ask you to clarify a bit more. So, by constants, do you mean the constants used for the approximations of the logarithms, or something else? Yes, the...

>> That being said, as you might have noticed, the bench directory currently does not contain the actual code I have used to produce the benchmarks... (And the Grisu2 implementation...

First of all, sorry for the delay, but I have been quite busy the last weeks... > Could you elaborate on how you can possibly merge two paths by doing...

> Wow, you implemented Dragonbox! Well, it is still _your_ implementation. I have just removed a bit of code :-) And possibly introduced some bugs ;-) > it seems you...

> It is simply impossible to implement division-by-1000 as one multiplication plus one shift, but in our case it is possible because we are not using the full range of...

Sorry for the late reply... I have been quite busy and I simply forgot to answer :-( Do you have a specific versioning system in mind? Something like a "GitHub...

Thanks! Looks like renaming `random` to something like `rng` should fix the problem?

> We have three values vm, vr, and vp. For vm and vp, the code checks whether all q removed digits were 0, so it needs to check if they...