JuliaRandom / JuliaRandom/RandomNumbers.jl

Conversion to Float

未关闭
#8 3 条评论 0 个 reaction 已指派 0 人 在 GitHub 查看
主要语言
Julia
星标
100
派生
23
PR 合并指标
30 天内没有已合并 PR

描述

The "obvious" approach of converting to a float, then multiplying by a scale factor is slow, and has the potential to give an answer of `1.0`.

The easiest option is:

``` julia
import Base: significand_mask, exponent_one
f1(u::UInt64) = reinterpret(Float64, exponent_one(Float64) | significand_mask(Float64) & u) - 1.0
```

unfortunately this has the downside that the last bit will always be zero, so you only get 52 bits of randomness per float: see https://github.com/JuliaLang/julia/issues/16344.

A slightly more advanced option (based on [this proposal](http://stackoverflow.com/a/35351145/392585)) is:

``` julia
import Base: significand_mask, significand_bits, exponent_half
function f2(u::UInt64)
f = reinterpret(Float64, exponent_half(Float64) | 0x001f_ffff_ffff_ffff & u)
if (u >> significand_bits(Float64)) &1 == 1
f-= 0.5
end
f
end
```

This gets us 53 bits, but introduces a branch. There might be some clever stuff we can do here though.

贡献指南

这个仓库没有索引到贡献指南

调研方向

Start with the current float-conversion approach described in the issue and compare the f1 and f2 alternatives, including the linked Julia issue about the lost last bit. The change is complete when conversion avoids producing 1.0 while preserving 53 bits of randomness without an unacceptable performance cost.

由索引模型根据 Issue 内容生成。

评估

技术栈
julia
领域
performance
Issue 类型
重构
难度
4/5
预计耗时
3-5 天
活跃度
停滞
描述清晰度
基本清楚
新手友好度
35/100

把新 issue 发到你的邮箱

精选适合新手参与的 GitHub issue 摘要。