Changes between Initial Version and Version 1 of Ticket #23061, comment 16


Ignore:
Timestamp:
Aug 25, 2017, 2:47:08 AM (2 years ago)
Author:
teor
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #23061, comment 16

    initial v1  
    22
    33For example, if we used the naïve algorithm that divides [0, UINT64_MAX] by (UINT64_MAX+1), I think we get a pattern like:
    4 0, 1/2^64^, 2/2^64^, 3/2^64^, ... , 2^53^/2^64, 2^53^/2^64, (2^53^+2)/2^64, ... , (2^64^ - 2^11^ - 2^10^)/2^64^ (~2^11^ times), 1.0 (~2^10^ times)
     40, 1/2^64^, 2/2^64^, 3/2^64^, ... , 2^53^/2^64^, 2^53^/2^64^, (2^53^+2)/2^64^, ... , (2^64^ - 2^11^ - 2^10^)/2^64^ (~2^11^ times), 1.0 (~2^10^ times)
    55due to representation limits (the details would vary depending on the rounding mode and possibly the hardware).
    66