Remove useless 'use crate;' in favor of the crate prelude

examples/cpu_monitor.rs

@@ -2,7 +2,6 @@
 extern crate serde_derive;
 
 use docopt::Docopt;
-use rayon;
 use std::io;
 use std::process;
 

rayon-core/src/lib.rs

@@ -64,8 +64,6 @@ pub use self::thread_pool::current_thread_has_pending_tasks;
 pub use self::thread_pool::current_thread_index;
 pub use self::thread_pool::ThreadPool;
 
-use crossbeam_utils;
-use num_cpus;
 use self::registry::{CustomSpawn, DefaultSpawn, ThreadSpawn};
 
 /// Returns the number of threads in the current registry. If this

rayon-core/tests/scope_join.rs

@@ -1,5 +1,3 @@
-use rayon_core;
-
 /// Test that one can emulate join with `scope`:
 fn pseudo_join<F, G>(f: F, g: G)
 where

rayon-demo/src/factorial/mod.rs

@@ -1,10 +1,8 @@
 //! Benchmark Factorial N! = 1×2×⋯×N
 
 use num::{BigUint, One};
-use rayon;
 use rayon::prelude::*;
 use std::ops::Mul;
-use test;
 
 const N: u32 = 9999;
 

rayon-demo/src/fibonacci/mod.rs

@@ -15,8 +15,6 @@
 
 extern crate test;
 
-use rayon;
-
 const N: u32 = 32;
 const FN: u32 = 2_178_309;
 

rayon-demo/src/join_microbench.rs

@@ -1,6 +1,5 @@
 //! Some microbenchmarks that stress test a pure `join` path.
 
-use rayon;
 use rayon::prelude::*;
 use std::usize;
 use test::Bencher;

rayon-demo/src/life/mod.rs

@@ -21,7 +21,6 @@ use std::iter::repeat;
 use std::num::Wrapping;
 use std::sync::Arc;
 use std::thread;
-use time;
 
 use docopt::Docopt;
 use rayon::iter::ParallelBridge;

rayon-demo/src/main.rs

@@ -47,9 +47,6 @@ extern crate winapi; // life
 #[cfg(test)]
 extern crate test;
 
-use rand;
-use rand_xorshift;
-
 const USAGE: &str = "
 Usage: rayon-demo bench
        rayon-demo <demo-name> [ options ]

rayon-demo/src/matmul/bench.rs

@@ -1,5 +1,3 @@
-use test;
-
 const ROW_SIZE: usize = 256;
 
 #[bench]

rayon-demo/src/matmul/mod.rs

@@ -17,7 +17,6 @@ pub struct Args {
 }
 
 use docopt::Docopt;
-use rayon;
 use rayon::prelude::*;
 
 use std::time::Instant;

rayon-demo/src/mergesort/bench.rs

@@ -1,5 +1,3 @@
-use test;
-
 // Size to use when doing `cargo bench`; extensively tuned to run in
 // "not too long" on my laptop -nmatsakis
 const BENCH_SIZE: usize = 250_000_000 / 512;

rayon-demo/src/mergesort/mod.rs

@@ -25,7 +25,6 @@ pub struct Args {
 }
 
 use docopt::Docopt;
-use rayon;
 
 use std::cmp::max;
 use std::time::Instant;

rayon-demo/src/nbody/bench.rs

@@ -1,5 +1,3 @@
-use test;
-
 use super::nbody::NBodyBenchmark;
 
 // Because benchmarks run iteratively, use smaller constants by default:

rayon-demo/src/nbody/mod.rs

@@ -1,5 +1,4 @@
 use docopt::Docopt;
-use time;
 
 #[cfg(test)]
 mod bench;

rayon-demo/src/pythagoras/mod.rs

@@ -6,7 +6,6 @@ use rayon::prelude::*;
 use rayon::range::Iter;
 use std::ops::Add;
 use std::usize;
-use test;
 
 /// Use Euclid's formula to count Pythagorean triples
 ///

rayon-demo/src/quicksort/bench.rs

@@ -1,5 +1,3 @@
-use test;
-
 use super::{Parallel, Sequential};
 
 // Size to use when doing `cargo bench`; extensively tuned to run in

rayon-demo/src/quicksort/mod.rs

@@ -25,7 +25,6 @@ pub struct Args {
 use docopt::Docopt;
 use rand::distributions::Standard;
 use rand::Rng;
-use rayon;
 use std::time::Instant;
 
 pub trait Joiner {

rayon-demo/src/sieve/bench.rs

@@ -1,5 +1,3 @@
-use test;
-
 use super::NUM_PRIMES;
 
 const MAGNITUDE: usize = 7;

rayon-demo/src/sieve/mod.rs

@@ -42,7 +42,6 @@ mod bench;
 use docopt::Docopt;
 use odds::stride::StrideMut;
 use rayon::prelude::*;
-use time;
 
 const CHUNK_SIZE: usize = 100_000;
 

rayon-demo/src/tsp/bench.rs

@@ -1,5 +1,4 @@
 use std::path::Path;
-use test;
 
 use super::graph::Node;
 use super::parse_solver;

rayon-demo/src/tsp/solver.rs

@@ -1,4 +1,3 @@
-use rayon;
 use std::collections::BinaryHeap;
 use std::sync::atomic::{AtomicUsize, Ordering};
 use std::sync::{Arc, Mutex};

src/iter/empty.rs

@@ -1,7 +1,6 @@
 use crate::iter::plumbing::*;
 use crate::iter::*;
 
-use std;
 use std::fmt;
 use std::marker::PhantomData;
 

src/option.rs

@@ -7,7 +7,6 @@
 
 use crate::iter::plumbing::*;
 use crate::iter::*;
-use std;
 use std::sync::atomic::{AtomicBool, Ordering};
 
 /// A parallel iterator over the value in [`Some`] variant of an [`Option`].

src/slice/mergesort.rs

@@ -5,7 +5,6 @@
 //! `MergesortResult` and leaves descending arrays intact.
 
 use crate::iter::*;
-use rayon_core;
 use crate::slice::ParallelSliceMut;
 use std::mem;
 use std::mem::size_of;

src/slice/quicksort.rs

@@ -4,7 +4,6 @@
 //! The only difference from the original is that calls to `recurse` are executed in parallel using
 //! `rayon_core::join`.
 
-use rayon_core;
 use std::cmp;
 use std::mem;
 use std::ptr;

src/vec.rs

@@ -7,7 +7,6 @@
 
 use crate::iter::plumbing::*;
 use crate::iter::*;
-use std;
 
 /// Parallel iterator that moves out of a vector.
 #[derive(Debug, Clone)]