Replace HTTP links with HTTPS

CHANGELOG.md

@@ -2,7 +2,7 @@
 All notable changes to this project will be documented in this file.
 
 The format is based on [Keep a Changelog](http://keepachangelog.com/en/1.0.0/)
-and this project adheres to [Semantic Versioning](http://semver.org/spec/v2.0.0.html).
+and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
 
 ## [0.4.2] - 2018-01-05
 ### Changed
@@ -262,4 +262,3 @@ and this project adheres to [Semantic Versioning](http://semver.org/spec/v2.0.0.
 ## [0.10-pre] - 2014-03-02
 ### Added
 - Seperate `rand` out of the standard library
-

LICENSE-APACHE

@@ -1,6 +1,6 @@
                               Apache License
                         Version 2.0, January 2004
-                     http://www.apache.org/licenses/
+                     https://www.apache.org/licenses/
 
 TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
 
@@ -192,7 +192,7 @@ Licensed under the Apache License, Version 2.0 (the "License");
 you may not use this file except in compliance with the License.
 You may obtain a copy of the License at
 
-	http://www.apache.org/licenses/LICENSE-2.0
+	https://www.apache.org/licenses/LICENSE-2.0
 
 Unless required by applicable law or agreed to in writing, software
 distributed under the License is distributed on an "AS IS" BASIS,

README.md

@@ -72,7 +72,7 @@ optional features are available:
 -   `nightly` enables all unstable features (`i128_support`)
 -   `std` enabled by default; by setting "default-features = false" `no_std`
     mode is activated; this removes features depending on `std` functionality:
-    
+
         -   `OsRng` is entirely unavailable
         -   `JitterRng` code is still present, but a nanosecond timer must be
             provided via `JitterRng::new_with_timer`

src/distributions/exponential.rs

@@ -1,10 +1,10 @@
 // Copyright 2013 The Rust Project Developers. See the COPYRIGHT
 // file at the top-level directory of this distribution and at
-// http://rust-lang.org/COPYRIGHT.
+// https://rust-lang.org/COPYRIGHT.
 //
 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
-// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
-// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
+// https://www.apache.org/licenses/LICENSE-2.0> or the MIT license
+// <LICENSE-MIT or https://opensource.org/licenses/MIT>, at your
 // option. This file may not be copied, modified, or distributed
 // except according to those terms.
 
@@ -23,7 +23,7 @@ use distributions::{ziggurat, ziggurat_tables, Sample, IndependentSample};
 ///
 /// [1]: Jurgen A. Doornik (2005). [*An Improved Ziggurat Method to
 /// Generate Normal Random
-/// Samples*](http://www.doornik.com/research/ziggurat.pdf). Nuffield
+/// Samples*](https://www.doornik.com/research/ziggurat.pdf). Nuffield
 /// College, Oxford
 ///
 /// # Example

src/distributions/gamma.rs

@@ -1,10 +1,10 @@
 // Copyright 2013 The Rust Project Developers. See the COPYRIGHT
 // file at the top-level directory of this distribution and at
-// http://rust-lang.org/COPYRIGHT.
+// https://rust-lang.org/COPYRIGHT.
 //
 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
-// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
-// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
+// https://www.apache.org/licenses/LICENSE-2.0> or the MIT license
+// <LICENSE-MIT or https://opensource.org/licenses/MIT>, at your
 // option. This file may not be copied, modified, or distributed
 // except according to those terms.
 //
@@ -48,7 +48,7 @@ use super::{IndependentSample, Sample, Exp};
 /// [1]: George Marsaglia and Wai Wan Tsang. 2000. "A Simple Method
 /// for Generating Gamma Variables" *ACM Trans. Math. Softw.* 26, 3
 /// (September 2000),
-/// 363-372. DOI:[10.1145/358407.358414](http://doi.acm.org/10.1145/358407.358414)
+/// 363-372. DOI:[10.1145/358407.358414](https://doi.acm.org/10.1145/358407.358414)
 #[derive(Clone, Copy, Debug)]
 pub struct Gamma {
     repr: GammaRepr,

src/distributions/mod.rs

@@ -1,10 +1,10 @@
 // Copyright 2013 The Rust Project Developers. See the COPYRIGHT
 // file at the top-level directory of this distribution and at
-// http://rust-lang.org/COPYRIGHT.
+// https://rust-lang.org/COPYRIGHT.
 //
 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
-// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
-// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
+// https://www.apache.org/licenses/LICENSE-2.0> or the MIT license
+// <LICENSE-MIT or https://opensource.org/licenses/MIT>, at your
 // option. This file may not be copied, modified, or distributed
 // except according to those terms.
 
@@ -301,7 +301,7 @@ mod tests {
         fn next_u64(&mut self) -> u64 {
             self.next_u32() as u64
         }
-        
+
         fn fill_bytes(&mut self, dest: &mut [u8]) {
             impls::fill_bytes_via_u32(self, dest)
         }

src/distributions/normal.rs

@@ -1,10 +1,10 @@
 // Copyright 2013 The Rust Project Developers. See the COPYRIGHT
 // file at the top-level directory of this distribution and at
-// http://rust-lang.org/COPYRIGHT.
+// https://rust-lang.org/COPYRIGHT.
 //
 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
-// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
-// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
+// https://www.apache.org/licenses/LICENSE-2.0> or the MIT license
+// <LICENSE-MIT or https://opensource.org/licenses/MIT>, at your
 // option. This file may not be copied, modified, or distributed
 // except according to those terms.
 
@@ -22,7 +22,7 @@ use distributions::{ziggurat, ziggurat_tables, Sample, IndependentSample};
 ///
 /// [1]: Jurgen A. Doornik (2005). [*An Improved Ziggurat Method to
 /// Generate Normal Random
-/// Samples*](http://www.doornik.com/research/ziggurat.pdf). Nuffield
+/// Samples*](https://www.doornik.com/research/ziggurat.pdf). Nuffield
 /// College, Oxford
 ///
 /// # Example

src/distributions/range.rs

@@ -1,10 +1,10 @@
 // Copyright 2013 The Rust Project Developers. See the COPYRIGHT
 // file at the top-level directory of this distribution and at
-// http://rust-lang.org/COPYRIGHT.
+// https://rust-lang.org/COPYRIGHT.
 //
 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
-// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
-// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
+// https://www.apache.org/licenses/LICENSE-2.0> or the MIT license
+// <LICENSE-MIT or https://opensource.org/licenses/MIT>, at your
 // option. This file may not be copied, modified, or distributed
 // except according to those terms.
 

src/distributions/ziggurat_tables.rs

@@ -1,10 +1,10 @@
 // Copyright 2013 The Rust Project Developers. See the COPYRIGHT
 // file at the top-level directory of this distribution and at
-// http://rust-lang.org/COPYRIGHT.
+// https://rust-lang.org/COPYRIGHT.
 //
 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
-// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
-// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
+// https://www.apache.org/licenses/LICENSE-2.0> or the MIT license
+// <LICENSE-MIT or https://opensource.org/licenses/MIT>, at your
 // option. This file may not be copied, modified, or distributed
 // except according to those terms.
 

src/impls.rs

@@ -1,20 +1,20 @@
 // Copyright 2013-2017 The Rust Project Developers. See the COPYRIGHT
 // file at the top-level directory of this distribution and at
-// http://rust-lang.org/COPYRIGHT.
+// https://rust-lang.org/COPYRIGHT.
 //
 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
-// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
-// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
+// https://www.apache.org/licenses/LICENSE-2.0> or the MIT license
+// <LICENSE-MIT or https://opensource.org/licenses/MIT>, at your
 // option. This file may not be copied, modified, or distributed
 // except according to those terms.
 
 //! Helper functions for implementing `Rng` functions.
-//! 
+//!
 //! For cross-platform reproducibility, these functions all use Little Endian:
 //! least-significant part first. For example, `next_u64_via_u32` takes `u32`
 //! values `x, y`, then outputs `(y << 32) | x`. To implement `next_u32`
 //! from `next_u64` in little-endian order, one should use `next_u64() as u32`.
-//! 
+//!
 //! Byte-swapping (like the std `to_le` functions) is only needed to convert
 //! to/from byte sequences, and since its purpose is reproducibility,
 //! non-reproducible sources (e.g. `OsRng`) need not bother with it.

src/jitter.rs

@@ -1,10 +1,10 @@
 // Copyright 2017 The Rust Project Developers. See the COPYRIGHT
 // file at the top-level directory of this distribution and at
-// http://rust-lang.org/COPYRIGHT.
+// https://rust-lang.org/COPYRIGHT.
 //
 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
-// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
-// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
+// https://www.apache.org/licenses/LICENSE-2.0> or the MIT license
+// <LICENSE-MIT or https://opensource.org/licenses/MIT>, at your
 // option. This file may not be copied, modified, or distributed
 // except according to those terms.
 //

src/lib.rs

@@ -1,10 +1,10 @@
 // Copyright 2013-2017 The Rust Project Developers. See the COPYRIGHT
 // file at the top-level directory of this distribution and at
-// http://rust-lang.org/COPYRIGHT.
+// https://rust-lang.org/COPYRIGHT.
 //
 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
-// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
-// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
+// https://www.apache.org/licenses/LICENSE-2.0> or the MIT license
+// <LICENSE-MIT or https://opensource.org/licenses/MIT>, at your
 // option. This file may not be copied, modified, or distributed
 // except according to those terms.
 
@@ -149,7 +149,7 @@
 //! This program will simulate the game show and with large enough simulation
 //! steps it will indeed confirm that it is better to switch.
 //!
-//! [Monty Hall Problem]: http://en.wikipedia.org/wiki/Monty_Hall_problem
+//! [Monty Hall Problem]: https://en.wikipedia.org/wiki/Monty_Hall_problem
 //!
 //! ```
 //! use rand::Rng;
@@ -339,7 +339,7 @@ pub trait Rand : Sized {
 /// A random number generator.
 pub trait Rng {
     /// Return the next random `u32`.
-    /// 
+    ///
     /// Implementations of this trait must implement at least one of
     /// `next_u32`, `next_u64` and `fill_bytes` directly. In the case this
     /// function is not implemented directly, it can be implemented using
@@ -348,14 +348,14 @@ pub trait Rng {
     fn next_u32(&mut self) -> u32;
 
     /// Return the next random `u64`.
-    /// 
+    ///
     /// Implementations of this trait must implement at least one of
     /// `next_u32`, `next_u64` and `fill_bytes` directly. In the case this
     /// function is not implemented directly, the default implementation will
     /// generate values via `next_u32` in little-endian fashion, or this
     /// function can be implemented via `fill_bytes` (TODO: expose helper
     /// function).
-    /// 
+    ///
     /// Types wrapping an inner RNG must not use the default implementation,
     /// since the inner RNG's implementation may produce different values.
     fn next_u64(&mut self) -> u64 {
@@ -415,22 +415,22 @@ pub trait Rng {
     }
 
     /// Fill `dest` with random data.
-    /// 
+    ///
     /// Implementations of this trait must implement at least one of
     /// `next_u32`, `next_u64` and `fill_bytes` directly. In the case this
     /// function is not implemented directly, the default implementation will
     /// generate values via `next_u64` in little-endian fashion.
     /// (TODO: expose helper function to allow implementation via `next_u32`.)
-    /// 
+    ///
     /// There is no requirement on how this method generates values relative to
     /// `next_u32` or `next_u64`; e.g. a `u64` cast to bytes is not required to
     /// have the same value as eight bytes filled via this function. There *is*
     /// a requirement of portability for reproducible generators which implies
     /// that any seedable generator must fix endianness when generating bytes.
-    /// 
+    ///
     /// Types wrapping an inner RNG must not use the default implementation,
     /// since the inner RNG's implementation may produce different values.
-    /// 
+    ///
     /// This method should guarantee that `dest` is entirely filled
     /// with new data, and may panic if this is impossible
     /// (e.g. reading past the end of a file that is being used as the
@@ -802,7 +802,7 @@ impl Rng for StdRng {
     fn next_u64(&mut self) -> u64 {
         self.rng.next_u64()
     }
-    
+
     #[inline]
     fn fill_bytes(&mut self, dest: &mut [u8]) {
         self.rng.fill_bytes(dest)
@@ -1007,7 +1007,7 @@ mod test {
     impl Rng for ConstRng {
         fn next_u32(&mut self) -> u32 { self.i as u32 }
         fn next_u64(&mut self) -> u64 { self.i }
-        
+
         fn fill_bytes(&mut self, dest: &mut [u8]) {
             impls::fill_bytes_via_u64(self, dest)
         }

src/os.rs

@@ -1,10 +1,10 @@
 // Copyright 2013-2015 The Rust Project Developers. See the COPYRIGHT
 // file at the top-level directory of this distribution and at
-// http://rust-lang.org/COPYRIGHT.
+// https://rust-lang.org/COPYRIGHT.
 //
 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
-// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
-// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
+// https://www.apache.org/licenses/LICENSE-2.0> or the MIT license
+// <LICENSE-MIT or https://opensource.org/licenses/MIT>, at your
 // option. This file may not be copied, modified, or distributed
 // except according to those terms.
 

src/prng/chacha.rs

@@ -1,10 +1,10 @@
 // Copyright 2014 The Rust Project Developers. See the COPYRIGHT
 // file at the top-level directory of this distribution and at
-// http://rust-lang.org/COPYRIGHT.
+// https://www.rust-lang.org/COPYRIGHT.
 //
 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
-// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
-// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
+// https://www.apache.org/licenses/LICENSE-2.0> or the MIT license
+// <LICENSE-MIT or https://opensource.org/licenses/MIT>, at your
 // option. This file may not be copied, modified, or distributed
 // except according to those terms.
 
@@ -26,7 +26,7 @@ const CHACHA_ROUNDS: u32 = 20; // Cryptographically secure from 8 upwards as of
 /// the operating system for cases that need high security.
 ///
 /// [1]: D. J. Bernstein, [*ChaCha, a variant of
-/// Salsa20*](http://cr.yp.to/chacha.html)
+/// Salsa20*](https://cr.yp.to/chacha.html)
 #[derive(Clone)]
 pub struct ChaChaRng {
     buffer:  [u32; STATE_WORDS], // Internal buffer of output
@@ -153,7 +153,7 @@ impl ChaChaRng {
     /// counter  counter  counter  counter
     /// ```
     /// [1]: Daniel J. Bernstein. [*Extending the Salsa20
-    /// nonce.*](http://cr.yp.to/papers.html#xsalsa)
+    /// nonce.*](https://cr.yp.to/papers.html#xsalsa)
     fn init(&mut self, key: &[u32; KEY_WORDS]) {
         self.state[0] = 0x61707865;
         self.state[1] = 0x3320646E;
@@ -207,7 +207,7 @@ impl Rng for ChaChaRng {
         impls::next_u64_via_u32(self)
     }
 
-    
+
     fn fill_bytes(&mut self, bytes: &mut [u8]) {
         impls::fill_bytes_via_u32(self, bytes)
     }
@@ -290,7 +290,7 @@ mod test {
     #[test]
     fn test_rng_true_values() {
         // Test vectors 1 and 2 from
-        // http://tools.ietf.org/html/draft-nir-cfrg-chacha20-poly1305-04
+        // https://tools.ietf.org/html/draft-nir-cfrg-chacha20-poly1305-04
         let seed : &[_] = &[0u32; 8];
         let mut ra: ChaChaRng = SeedableRng::from_seed(seed);
 
@@ -342,7 +342,7 @@ mod test {
                     189, 210, 25, 184, 160, 141, 237, 26,
                     168, 54, 239, 204, 139, 119, 13, 199]);
     }
-    
+
     #[test]
     fn test_rng_clone() {
         let seed : &[_] = &[0u32; 8];