diff options
| author | bors <bors@rust-lang.org> | 2013-11-24 21:32:13 -0800 |
|---|---|---|
| committer | bors <bors@rust-lang.org> | 2013-11-24 21:32:13 -0800 |
| commit | 2cc1e16ac0ee1fe5ea07125215e2ee1d39e63c12 (patch) | |
| tree | 456081dd6cdf57c5e1b7cc14e509e89d8a184fea /src/libstd/rand | |
| parent | ca3274336e9d61b29f6862b4706a2a105a208f0a (diff) | |
| parent | acca9e3834842ee8d8104abe9b8b9bb88861793c (diff) | |
auto merge of #10603 : alexcrichton/rust/no-linked-failure, r=brson
The reasons for doing this are: * The model on which linked failure is based is inherently complex * The implementation is also very complex, and there are few remaining who fully understand the implementation * There are existing race conditions in the core context switching function of the scheduler, and possibly others. * It's unclear whether this model of linked failure maps well to a 1:1 threading model Linked failure is often a desired aspect of tasks, but we would like to take a much more conservative approach in re-implementing linked failure if at all. Closes #8674 Closes #8318 Closes #8863
Diffstat (limited to 'src/libstd/rand')
| -rw-r--r-- | src/libstd/rand/os.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/libstd/rand/os.rs b/src/libstd/rand/os.rs index 60fc1e0c6bc..cd90af113ec 100644 --- a/src/libstd/rand/os.rs +++ b/src/libstd/rand/os.rs @@ -162,7 +162,7 @@ mod test { for _ in range(0, 20) { let (p, c) = comm::stream(); chans.push(c); - do task::spawn_with(p) |p| { + do task::spawn { // wait until all the tasks are ready to go. p.recv(); |
