about summary refs log tree commit diff
path: root/src/rt/rust_run_program.cpp
diff options
context:
space:
mode:
authorbors <bors@rust-lang.org>2013-04-29 18:24:37 -0700
committerbors <bors@rust-lang.org>2013-04-29 18:24:37 -0700
commit868b7c153ce6797c768cc2c43a564f34615f6f2d (patch)
tree0f8cfeca16e6d929fabd3c387295d08669e9fa86 /src/rt/rust_run_program.cpp
parentf1ddb8d5cc66941763039d3f727465b7cc34a100 (diff)
parentd4b934bdce53107a0270f97985bc3152c638183e (diff)
downloadrust-868b7c153ce6797c768cc2c43a564f34615f6f2d.tar.gz
rust-868b7c153ce6797c768cc2c43a564f34615f6f2d.zip
auto merge of #6073 : huonw/rust/core-rust-isaac, r=pcwalton
This replaces the wrapper around the runtime RNG with a pure Rust implementation of the same algorithm. This is much faster (up to 5x), and is hopefully safer.

There is still (a little) room for optimisation: testing by summing 100,000,000 random `u32`s indicates this is about ~~40-50%~~ 10% slower than the pure C implementation (running as standalone executable, not in the runtime).

(Only 6d50d55 is part of this PR, the first two are from #6058, but are required for the rt rng to be correct to compare against in the tests.)
Diffstat (limited to 'src/rt/rust_run_program.cpp')
0 files changed, 0 insertions, 0 deletions