---

yaml
---
r: 274701
b: refs/heads/stable
c: dd0133d
h: refs/heads/master
i:
  274699: 55809f8

Author: steveklabnik

[refs]

@@ -29,7 +29,7 @@ refs/heads/tmp: e06d2ad9fcd5027bcaac5b08fc9aa39a49d0ecd3
 refs/tags/1.0.0-alpha.2: 4c705f6bc559886632d3871b04f58aab093bfa2f
 refs/tags/homu-tmp: c0221c8897db309a79990367476177b1230bb264
 refs/tags/1.0.0-beta: 8cbb92b53468ee2b0c2d3eeb8567005953d40828
-refs/heads/stable: 4c50d76298c1e945887fcc1400daac1a849ebf53
+refs/heads/stable: dd0133d8362f0e1fca6f4346c620dd13c7e18dbc
 refs/tags/1.0.0: 55bd4f8ff2b323f317ae89e254ce87162d52a375
 refs/tags/1.1.0: bc3c16f09287e5545c1d3f76b7abd54f2eca868b
 refs/tags/1.2.0: f557861f822c34f07270347b94b5280de20a597e

branches/stable/src/doc/book/error-handling.md

@@ -265,7 +265,7 @@ fn map<F, T, A>(option: Option<T>, f: F) -> Option<A> where F: FnOnce(T) -> A {
 ```
 
 Indeed, `map` is [defined as a method][2] on `Option<T>` in the standard library.
-As a method, it has a slightly different signature: methods take `self`, `&self`,
+As a method, it has a slighly different signature: methods take `self`, `&self`,
 or `&mut self` as their first argument.
 
 Armed with our new combinator, we can rewrite our `extension_explicit` method
@@ -1592,7 +1592,7 @@ fn print_usage(program: &str, opts: Options) {
 
 fn main() {
     let args: Vec<String> = env::args().collect();
-    let program = &args[0];
+    let program = args[0].clone();
 
     let mut opts = Options::new();
     opts.optflag("h", "help", "Show this usage message.");
@@ -1605,10 +1605,10 @@ fn main() {
         print_usage(&program, opts);
         return;
     }
-    let data_path = &args[1];
-    let city = &args[2];
+    let data_path = args[1].clone();
+    let city = args[2].clone();
 
-    // Do stuff with information
+	// Do stuff with information
 }
 ```
 
@@ -1640,6 +1640,7 @@ sure to add `extern crate csv;` to the top of your file.)
 
 ```rust,ignore
 use std::fs::File;
+use std::path::Path;
 
 // This struct represents the data in each row of the CSV file.
 // Type based decoding absolves us of a lot of the nitty gritty error
@@ -1665,7 +1666,7 @@ fn print_usage(program: &str, opts: Options) {
 
 fn main() {
     let args: Vec<String> = env::args().collect();
-    let program = &args[0];
+    let program = args[0].clone();
 
     let mut opts = Options::new();
     opts.optflag("h", "help", "Show this usage message.");
@@ -1677,24 +1678,25 @@ fn main() {
 
     if matches.opt_present("h") {
         print_usage(&program, opts);
-        return;
-    }
+		return;
+	}
 
-    let data_path = &args[1];
-    let city: &str = &args[2];
+	let data_file = args[1].clone();
+	let data_path = Path::new(&data_file);
+	let city = args[2].clone();
 
-    let file = File::open(data_path).unwrap();
-    let mut rdr = csv::Reader::from_reader(file);
+	let file = File::open(data_path).unwrap();
+	let mut rdr = csv::Reader::from_reader(file);
 
-    for row in rdr.decode::<Row>() {
-        let row = row.unwrap();
+	for row in rdr.decode::<Row>() {
+		let row = row.unwrap();
 
-        if row.city == city {
-            println!("{}, {}: {:?}",
-                row.city, row.country,
-                row.population.expect("population count"));
-        }
-    }
+		if row.city == city {
+			println!("{}, {}: {:?}",
+				row.city, row.country,
+				row.population.expect("population count"));
+		}
+	}
 }
 ```
 
@@ -1743,8 +1745,6 @@ Note that we opt to handle the possibility of a missing population count by
 simply ignoring that row.
 
 ```rust,ignore
-use std::path::Path;
-
 struct Row {
     // unchanged
 }
@@ -1782,26 +1782,27 @@ fn search<P: AsRef<Path>>(file_path: P, city: &str) -> Vec<PopulationCount> {
 }
 
 fn main() {
-    let args: Vec<String> = env::args().collect();
-    let program = &args[0];
+	let args: Vec<String> = env::args().collect();
+	let program = args[0].clone();
 
-    let mut opts = Options::new();
-    opts.optflag("h", "help", "Show this usage message.");
+	let mut opts = Options::new();
+	opts.optflag("h", "help", "Show this usage message.");
 
-    let matches = match opts.parse(&args[1..]) {
-        Ok(m)  => { m }
-        Err(e) => { panic!(e.to_string()) }
-    };
-    if matches.opt_present("h") {
-        print_usage(&program, opts);
-        return;
-    }
+	let matches = match opts.parse(&args[1..]) {
+		Ok(m)  => { m }
+		Err(e) => { panic!(e.to_string()) }
+	};
+	if matches.opt_present("h") {
+		print_usage(&program, opts);
+		return;
+	}
 
-    let data_path = &args[1];
-    let city = &args[2];
-    for pop in search(data_path, city) {
-        println!("{}, {}: {:?}", pop.city, pop.country, pop.count);
-    }
+	let data_file = args[1].clone();
+	let data_path = Path::new(&data_file);
+	let city = args[2].clone();
+	for pop in search(&data_path, &city) {
+		println!("{}, {}: {:?}", pop.city, pop.country, pop.count);
+	}
 }
 
 ```
@@ -1911,7 +1912,7 @@ First, here's the new usage:
 
 ```rust,ignore
 fn print_usage(program: &str, opts: Options) {
-    println!("{}", opts.usage(&format!("Usage: {} [options] <city>", program)));
+	println!("{}", opts.usage(&format!("Usage: {} [options] <city>", program)));
 }
 ```
 The next part is going to be only a little harder:
@@ -1923,16 +1924,16 @@ opts.optopt("f", "file", "Choose an input file, instead of using STDIN.", "NAME"
 opts.optflag("h", "help", "Show this usage message.");
 ...
 let file = matches.opt_str("f");
-let data_file = &file.as_ref().map(Path::new);
+let data_file = file.as_ref().map(Path::new);
 
 let city = if !matches.free.is_empty() {
-    &matches.free[0]
+	matches.free[0].clone()
 } else {
-    print_usage(&program, opts);
-    return;
+	print_usage(&program, opts);
+	return;
 };
 
-match search(data_file, city) {
+match search(&data_file, &city) {
     Ok(pops) => {
         for pop in pops {
             println!("{}, {}: {:?}", pop.city, pop.country, pop.count);

branches/stable/src/libbacktrace/ansidecl.h

@@ -1,4 +1,4 @@
-/* ANSI and traditional C compatibility macros
+/* ANSI and traditional C compatability macros
    Copyright (C) 1991-2015 Free Software Foundation, Inc.
    This file is part of the GNU C Library.
 

branches/stable/src/libcollections/btree/node.rs

@@ -28,7 +28,7 @@
 // }
 // ```
 //
-// Since Rust doesn't actually have dependent types and polymorphic recursion,
+// Since Rust doesn't acutally have dependent types and polymorphic recursion,
 // we make do with lots of unsafety.
 
 use alloc::heap;

branches/stable/src/libcollections/str.rs

@@ -1808,7 +1808,7 @@ impl str {
                 // Σ maps to σ, except at the end of a word where it maps to ς.
                 // This is the only conditional (contextual) but language-independent mapping
                 // in `SpecialCasing.txt`,
-                // so hard-code it rather than have a generic "condition" mechanism.
+                // so hard-code it rather than have a generic "condition" mechanim.
                 // See https://github.com/rust-lang/rust/issues/26035
                 map_uppercase_sigma(self, i, &mut s)
             } else {

branches/stable/src/libcollections/string.rs

@@ -193,7 +193,7 @@ use boxed::Box;
 /// mem::forget(story);
 ///
 /// // We can re-build a String out of ptr, len, and capacity. This is all
-/// // unsafe because we are responsible for making sure the components are
+/// // unsafe becuase we are responsible for making sure the components are
 /// // valid:
 /// let s = unsafe { String::from_raw_parts(ptr as *mut _, len, capacity) } ;
 ///
@@ -1842,12 +1842,6 @@ impl fmt::Write for String {
 }
 
 /// A draining iterator for `String`.
-///
-/// This struct is created by the [`drain()`] method on [`String`]. See its
-/// documentation for more.
-///
-/// [`drain()`]: struct.String.html#method.drain
-/// [`String`]: struct.String.html
 #[stable(feature = "drain", since = "1.6.0")]
 pub struct Drain<'a> {
     /// Will be used as &'a mut String in the destructor

branches/stable/src/libcore/cmp.rs

@@ -165,8 +165,9 @@ impl Ordering {
 /// - total and antisymmetric: exactly one of `a < b`, `a == b` or `a > b` is true; and
 /// - transitive, `a < b` and `b < c` implies `a < c`. The same must hold for both `==` and `>`.
 ///
-/// This trait can be used with `#[derive]`. When `derive`d, it will produce a lexicographic
-/// ordering based on the top-to-bottom declaration order of the struct's members.
+/// When this trait is `derive`d, it produces a lexicographic ordering.
+///
+/// This trait can be used with `#[derive]`.
 #[stable(feature = "rust1", since = "1.0.0")]
 pub trait Ord: Eq + PartialOrd<Self> {
     /// This method returns an `Ordering` between `self` and `other`.
@@ -224,8 +225,7 @@ impl PartialOrd for Ordering {
 /// total order. For example, for floating point numbers, `NaN < 0 == false` and `NaN >= 0 ==
 /// false` (cf. IEEE 754-2008 section 5.11).
 ///
-/// This trait can be used with `#[derive]`. When `derive`d, it will produce an ordering
-/// based on the top-to-bottom declaration order of the struct's members.
+/// This trait can be used with `#[derive]`.
 #[lang = "ord"]
 #[stable(feature = "rust1", since = "1.0.0")]
 pub trait PartialOrd<Rhs: ?Sized = Self>: PartialEq<Rhs> {

branches/stable/src/libcore/convert.rs

@@ -19,7 +19,7 @@
 //!
 //! - Impl the `As*` traits for reference-to-reference conversions
 //! - Impl the `Into` trait when you want to consume the value in the conversion
-//! - The `From` trait is the most flexible, useful for values _and_ references conversions
+//! - The `From` trait is the most flexible, usefull for values _and_ references conversions
 //!
 //! As a library writer, you should prefer implementing `From<T>` rather than
 //! `Into<U>`, as `From` provides greater flexibility and offer the equivalent `Into`

branches/stable/src/libcore/num/dec2flt/mod.rs

@@ -149,6 +149,13 @@ from_str_float_impl!(f32);
 from_str_float_impl!(f64);
 
 /// An error which can be returned when parsing a float.
+///
+/// This error is used as the error type for the [`FromStr`] implementation
+/// for [`f32`] and [`f64`].
+///
+/// [`FromStr`]: ../str/trait.FromStr.html
+/// [`f32`]: ../primitive.f32.html
+/// [`f64`]: ../primitive.f64.html
 #[derive(Debug, Clone, PartialEq)]
 #[stable(feature = "rust1", since = "1.0.0")]
 pub struct ParseFloatError {

branches/stable/src/libcore/num/mod.rs

@@ -2160,7 +2160,13 @@ impl usize {
         intrinsics::mul_with_overflow }
 }
 
-/// Used for representing the classification of floating point numbers
+/// A classification of floating point numbers.
+///
+/// This `enum` is used as the return type for [`f32::classify()`] and [`f64::classify()`]. See
+/// their documentation for more.
+///
+/// [`f32::classify()`]: ../primitive.f32.html#method.classify
+/// [`f64::classify()`]: ../primitive.f64.html#method.classify
 #[derive(Copy, Clone, PartialEq, Debug)]
 #[stable(feature = "rust1", since = "1.0.0")]
 pub enum FpCategory {
@@ -2387,6 +2393,11 @@ fn from_str_radix<T: FromStrRadixHelper>(src: &str, radix: u32)
 }
 
 /// An error which can be returned when parsing an integer.
+///
+/// This error is used as the error type for the `from_str_radix()` functions
+/// on the primitive integer types, such as [`i8::from_str_radix()`].
+///
+/// [`i8::from_str_radix()`]: ../std/primitive.i8.html#method.from_str_radix
 #[derive(Debug, Clone, PartialEq)]
 #[stable(feature = "rust1", since = "1.0.0")]
 pub struct ParseIntError { kind: IntErrorKind }

branches/stable/src/libcore/str/mod.rs

@@ -1740,7 +1740,7 @@ impl StrExt for str {
         let mut matcher = pat.into_searcher(self);
         if let Some((a, b)) = matcher.next_reject() {
             i = a;
-            j = b; // Remember earliest known match, correct it below if
+            j = b; // Rember earliest known match, correct it below if
                    // last match is different
         }
         if let Some((_, b)) = matcher.next_reject_back() {

branches/stable/src/libcore/tuple.rs

@@ -8,7 +8,24 @@
 // option. This file may not be copied, modified, or distributed
 // except according to those terms.
 
-// See src/libstd/primitive_docs.rs for documentation.
+//! A finite heterogeneous sequence, `(T, U, ..)`
+//!
+//! To access a single element of a tuple one can use the `.0`
+//! field access syntax.
+//!
+//! Indexing starts from zero, so `.0` returns first value, `.1`
+//! returns second value, and so on. In general, a tuple with *N*
+//! elements has field accessors from 0 to *N* - 1.
+//!
+//! If every type inside a tuple implements one of the following
+//! traits, then a tuple itself also implements it.
+//!
+//! * `Clone`
+//! * `PartialEq`
+//! * `Eq`
+//! * `PartialOrd`
+//! * `Ord`
+//! * `Default`
 
 use clone::Clone;
 use cmp::*;

branches/stable/src/librbml/lib.rs

@@ -107,7 +107,7 @@
 //!
 //! - `Opaque` (`17`): An opaque, custom-format tag.
 //!   Used to wrap ordinary custom tags or data in the auto-serialized context.
-//!   Rustc typically uses this to encode type information.
+//!   Rustc typically uses this to encode type informations.
 //!
 //! First 0x20 tags are reserved by RBML; custom tags start at 0x20.
 

branches/stable/src/librustc/middle/pat_util.rs

@@ -153,7 +153,7 @@ pub fn pat_contains_bindings(dm: &DefMap, pat: &hir::Pat) -> bool {
 }
 
 /// Checks if the pattern contains any `ref` or `ref mut` bindings,
-/// and if yes whether its containing mutable ones or just immutables ones.
+/// and if yes wether its containing mutable ones or just immutables ones.
 pub fn pat_contains_ref_binding(dm: &RefCell<DefMap>, pat: &hir::Pat) -> Option<hir::Mutability> {
     let mut result = None;
     pat_bindings(dm, pat, |mode, _, _, _| {
@@ -172,7 +172,7 @@ pub fn pat_contains_ref_binding(dm: &RefCell<DefMap>, pat: &hir::Pat) -> Option<
 }
 
 /// Checks if the patterns for this arm contain any `ref` or `ref mut`
-/// bindings, and if yes whether its containing mutable ones or just immutables ones.
+/// bindings, and if yes wether its containing mutable ones or just immutables ones.
 pub fn arm_contains_ref_binding(dm: &RefCell<DefMap>, arm: &hir::Arm) -> Option<hir::Mutability> {
     arm.pats.iter()
             .filter_map(|pat| pat_contains_ref_binding(dm, pat))

branches/stable/src/librustc/middle/ty/mod.rs

@@ -2236,7 +2236,7 @@ impl<'tcx> ctxt<'tcx> {
     /// Given the did of an ADT, return a reference to its definition.
     pub fn lookup_adt_def(&self, did: DefId) -> AdtDef<'tcx> {
         // when reverse-variance goes away, a transmute::<AdtDefMaster,AdtDef>
-        // would be needed here.
+        // woud be needed here.
         self.lookup_adt_def_master(did)
     }
 

branches/stable/src/librustc/mir/visit.rs

@@ -92,7 +92,7 @@ macro_rules! make_mir_visitor {
             }
 
             // The `super_xxx` methods comprise the default behavior and are
-            // not meant to be overridden.
+            // not meant to be overidden.
 
             fn super_mir(&mut self,
                          mir: & $($mutability)* Mir<'tcx>) {

branches/stable/src/librustc_trans/trans/common.rs

@@ -541,7 +541,7 @@ impl<'a, 'tcx> FunctionContext<'a, 'tcx> {
     }
 
     // Returns a ValueRef of the "eh_unwind_resume" lang item if one is defined,
-    // otherwise declares it as an external function.
+    // otherwise declares it as an external funtion.
     pub fn eh_unwind_resume(&self) -> ValueRef {
         use trans::attributes;
         assert!(self.ccx.sess().target.target.options.custom_unwind_resume);

branches/stable/src/librustc_typeck/check/mod.rs

@@ -1809,7 +1809,7 @@ impl<'a, 'tcx> FnCtxt<'a, 'tcx> {
             debug!("select_all_obligations_and_apply_defaults: defaults={:?}", default_map);
 
             // We loop over the unsolved variables, resolving them and if they are
-            // and unconstrainted numeric type we add them to the set of unbound
+            // and unconstrainted numberic type we add them to the set of unbound
             // variables. We do this so we only apply literal fallback to type
             // variables without defaults.
             for ty in &unsolved_variables {