---

yaml
---
r: 82245
b: refs/heads/master
c: a836f13
h: refs/heads/master
i:
  82243: 78d88e3
v: v3

Author: huonw

[refs]

@@ -1,5 +1,5 @@
 ---
-refs/heads/master: 71addded64548ff845d9ef3852a2c1d2592ae39f
+refs/heads/master: a836f13dc0c2c636fd00b77d05f50a00cc3a7c55
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
 refs/heads/snap-stage3: 6c08cc2db4f98e9f07ae7d50338396c4123c2f0a
 refs/heads/try: 70152ff55722878cde684ee6462c14c65f2c4729

trunk/src/libstd/rand/mod.rs

@@ -535,8 +535,9 @@ pub trait SeedableRng<Seed>: Rng {
 ///
 /// This is a very expensive operation as it has to read randomness
 /// from the operating system and use this in an expensive seeding
-/// operation. If one does not require high performance, `task_rng`
-/// and/or `random` may be more appropriate.
+/// operation. If one does not require high performance generation of
+/// random numbers, `task_rng` and/or `random` may be more
+/// appropriate.
 pub fn rng() -> StdRng {
     StdRng::new()
 }
@@ -596,6 +597,9 @@ impl<'self> SeedableRng<&'self [uint]> for StdRng {
 /// consideration for cryptography or security. If you require a specifically
 /// seeded `Rng` for consistency over time you should pick one algorithm and
 /// create the `Rng` yourself.
+///
+/// This will read randomness from the operating system to seed the
+/// generator.
 pub fn weak_rng() -> XorShiftRng {
     XorShiftRng::new()
 }
@@ -667,8 +671,8 @@ impl XorShiftRng {
                 break;
             }
         }
-        let s: &[u32, ..4] = unsafe { cast::transmute(&s) };
-        SeedableRng::from_seed(*s)
+        let s: [u32, ..4] = unsafe { cast::transmute(s) };
+        SeedableRng::from_seed(s)
     }
 }