auto merge of #16180 : jbcrail/rust/fix-comments, r=steveklabnik

Author: bors

src/compiletest/common.rs

@@ -136,7 +136,7 @@ pub struct Config {
     // Extra parameter to run adb on arm-linux-androideabi
     pub adb_path: String,
 
-    // Extra parameter to run test sute on arm-linux-androideabi
+    // Extra parameter to run test suite on arm-linux-androideabi
     pub adb_test_dir: String,
 
     // status whether android device available or not

src/compiletest/runtest.rs

@@ -325,7 +325,7 @@ fn run_debuginfo_gdb_test(config: &Config, props: &TestProps, testfile: &Path) {
     let DebuggerCommands { commands, check_lines, .. } = parse_debugger_commands(testfile, "gdb");
     let mut cmds = commands.connect("\n");
 
-    // compile test file (it shoud have 'compile-flags:-g' in the header)
+    // compile test file (it should have 'compile-flags:-g' in the header)
     let compiler_run_result = compile_test(config, props, testfile);
     if !compiler_run_result.status.success() {
         fatal_proc_rec("compilation failed!", &compiler_run_result);
@@ -520,7 +520,7 @@ fn run_debuginfo_lldb_test(config: &Config, props: &TestProps, testfile: &Path)
 
     let config = &mut config;
 
-    // compile test file (it shoud have 'compile-flags:-g' in the header)
+    // compile test file (it should have 'compile-flags:-g' in the header)
     let compile_result = compile_test(config, props, testfile);
     if !compile_result.status.success() {
         fatal_proc_rec("compilation failed!", &compile_result);

src/libcollections/bitv.rs

@@ -1532,7 +1532,7 @@ pub struct BitPositions<'a> {
     next_idx: uint
 }
 
-/// An iterator combining wo `BitvSet` iterators.
+/// An iterator combining two `BitvSet` iterators.
 pub struct TwoBitPositions<'a> {
     set: &'a BitvSet,
     other: &'a BitvSet,

src/libcollections/priority_queue.rs

@@ -119,7 +119,7 @@
 //!     //           10      |               |
 //!     //                   +---------------+
 //!     //
-//!     // The graph is represented as an adjecency list where each index,
+//!     // The graph is represented as an adjacency list where each index,
 //!     // corresponding to a node value, has a list of outgoing edges.
 //!     // Chosen for it's efficiency.
 //!     let graph = vec![

src/libcollections/string.rs

@@ -842,7 +842,7 @@ pub mod raw {
     /// Create a `String` from a null-terminated *u8 buffer
     ///
     /// This function is unsafe because we dereference memory until we find the NUL character,
-    /// which is not guaranteed to be present. Additionaly, the slice is not checked to see
+    /// which is not guaranteed to be present. Additionally, the slice is not checked to see
     /// whether it contains valid UTF-8
     pub unsafe fn from_buf(buf: *const u8) -> String {
         let mut len = 0;

src/libcore/cell.rs

@@ -449,7 +449,7 @@ pub struct UnsafeCell<T> {
 }
 
 impl<T> UnsafeCell<T> {
-    /// Construct a new instance of `UnsafeCell` which will wrapp the specified
+    /// Construct a new instance of `UnsafeCell` which will wrap the specified
     /// value.
     ///
     /// All access to the inner value through methods is `unsafe`, and it is

src/libgreen/task.rs

@@ -118,7 +118,7 @@ extern fn bootstrap_green_task(task: uint, code: *mut (), env: *mut ()) -> ! {
     // preserving a handle to the GreenTask down to this point, this
     // unfortunately must call `GreenTask::convert`. In order to avoid
     // this we could add a `terminate` function to the `Runtime` trait
-    // in libstd, but that seems less appropriate since the coversion
+    // in libstd, but that seems less appropriate since the conversion
     // method exists.
     GreenTask::convert(task).terminate();
 }

src/libnative/io/net.rs

@@ -769,7 +769,7 @@ impl rtio::RtioUdpSocket for UdpSocket {
 // It turns out that there's this nifty MSG_DONTWAIT flag which can be passed to
 // send/recv, but the niftiness wears off once you realize it only works well on
 // linux [1] [2]. This means that it's pretty easy to get a nonblocking
-// operation on linux (no flag fidding, no affecting other objects), but not on
+// operation on linux (no flag fiddling, no affecting other objects), but not on
 // other platforms.
 //
 // To work around this constraint on other platforms, we end up using the

src/libnative/io/pipe_win32.rs

@@ -311,7 +311,7 @@ impl UnixStream {
                     }
                 }
 
-                // An example I found on microsoft's website used 20
+                // An example I found on Microsoft's website used 20
                 // seconds, libuv uses 30 seconds, hence we make the
                 // obvious choice of waiting for 25 seconds.
                 None => {

src/librustc/metadata/loader.rs

@@ -11,7 +11,7 @@
 //! Finds crate binaries and loads their metadata
 //!
 //! Might I be the first to welcome you to a world of platform differences,
-//! version requirements, dependency graphs, conficting desires, and fun! This
+//! version requirements, dependency graphs, conflicting desires, and fun! This
 //! is the major guts (along with metadata::creader) of the compiler for loading
 //! crates and resolving dependencies. Let's take a tour!
 //!
@@ -83,7 +83,7 @@
 //! 5. Does the target in the metadata agree with the current target?
 //! 6. Does the SVH match? (more on this later)
 //!
-//! If the file answeres `yes` to all these questions, then the file is
+//! If the file answers `yes` to all these questions, then the file is
 //! considered as being *candidate* for being accepted. It is illegal to have
 //! more than two candidates as the compiler has no method by which to resolve
 //! this conflict. Additionally, rlib/dylib candidates are considered
@@ -173,7 +173,7 @@
 //! ## Loading transitive dependencies
 //!
 //! Dealing with same-named-but-distinct crates is not just a local problem, but
-//! one that also needs to be dealt with for transitive dependences. Note that
+//! one that also needs to be dealt with for transitive dependencies. Note that
 //! in the letter above `--extern` flags only apply to the *local* set of
 //! dependencies, not the upstream transitive dependencies. Consider this
 //! dependency graph:
@@ -660,7 +660,7 @@ impl<'a> Context<'a> {
             false
         });
 
-        // Now that we have an itertor of good candidates, make sure there's at
+        // Now that we have an iterator of good candidates, make sure there's at
         // most one rlib and at most one dylib.
         let mut rlibs = HashSet::new();
         let mut dylibs = HashSet::new();