1 // Copyright 2013 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! A wrapper around any Read to treat it as an RNG.
18 /// An RNG that reads random bytes straight from a `Read`. This will
19 /// work best with an infinite reader, but this is not required.
23 /// It will panic if it there is insufficient data to fulfill a request.
24 pub struct ReaderRng
<R
> {
28 impl<R
: Read
> ReaderRng
<R
> {
29 /// Create a new `ReaderRng` from a `Read`.
30 pub fn new(r
: R
) -> ReaderRng
<R
> {
37 impl<R
: Read
> Rng
for ReaderRng
<R
> {
38 fn next_u32(&mut self) -> u32 {
39 // This is designed for speed: reading a LE integer on a LE
40 // platform just involves blitting the bytes into the memory
41 // of the u32, similarly for BE on BE; avoiding byteswapping.
42 let mut bytes
= [0; 4];
43 self.fill_bytes(&mut bytes
);
44 unsafe { *(bytes.as_ptr() as *const u32) }
46 fn next_u64(&mut self) -> u64 {
47 // see above for explanation.
48 let mut bytes
= [0; 8];
49 self.fill_bytes(&mut bytes
);
50 unsafe { *(bytes.as_ptr() as *const u64) }
52 fn fill_bytes(&mut self, mut v
: &mut [u8]) {
55 match self.reader
.read(t
) {
56 Ok(0) => panic
!("ReaderRng.fill_bytes: EOF reached"),
57 Ok(n
) => v
= t
.split_at_mut(n
).1,
58 Err(e
) => panic
!("ReaderRng.fill_bytes: {}", e
),
72 fn test_reader_rng_u64() {
73 // transmute from the target to avoid endianness concerns.
74 let v
= &[0, 0, 0, 0, 0, 0, 0, 1,
75 0, 0, 0, 0, 0, 0, 0, 2,
76 0, 0, 0, 0, 0, 0, 0, 3][..];
77 let mut rng
= ReaderRng
::new(v
);
79 assert_eq
!(rng
.next_u64(), 1u64.to_be());
80 assert_eq
!(rng
.next_u64(), 2u64.to_be());
81 assert_eq
!(rng
.next_u64(), 3u64.to_be());
84 fn test_reader_rng_u32() {
85 let v
= &[0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 3][..];
86 let mut rng
= ReaderRng
::new(v
);
88 assert_eq
!(rng
.next_u32(), 1u32.to_be());
89 assert_eq
!(rng
.next_u32(), 2u32.to_be());
90 assert_eq
!(rng
.next_u32(), 3u32.to_be());
93 fn test_reader_rng_fill_bytes() {
94 let v
= [1, 2, 3, 4, 5, 6, 7, 8];
97 let mut rng
= ReaderRng
::new(&v
[..]);
98 rng
.fill_bytes(&mut w
);
105 fn test_reader_rng_insufficient_bytes() {
106 let mut rng
= ReaderRng
::new(&[][..]);
108 rng
.fill_bytes(&mut v
);