Merge pull request #118 from lpbak/typos

Fixes for typos in comments

Author: maciejhirsz

src/lib.rs

@@ -215,7 +215,7 @@ pub use value::JsonValue::Null;
 /// Result type used by this crate.
 ///
 ///
-/// *Note:* Since 0.9.0 the old `JsonResult` type is depreacted. Always use
+/// *Note:* Since 0.9.0 the old `JsonResult` type is deprecated. Always use
 /// `json::Result` instead.
 pub type Result<T> = result::Result<T, Error>;
 

src/number.rs

@@ -34,7 +34,7 @@ pub struct Number {
     // A byte describing the sign and NaN-ness of the number.
     //
     // category == 0 (NEGATIVE constant)         -> negative sign
-    // category == 1 (POSITIVE constnat)         -> positive sign
+    // category == 1 (POSITIVE constant)         -> positive sign
     // category >  1 (matches NAN_MASK constant) -> NaN
     category: u8,
 

src/object.rs

@@ -16,7 +16,7 @@ static NULL: JsonValue = JsonValue::Null;
 //
 // Additionally this "randomizes" the keys a bit. Should the keys in an object
 // be inserted in alphabetical order (an example of such a use case would be
-// using an object as a store for entires by ids, where ids are sorted), this
+// using an object as a store for entries by ids, where ids are sorted), this
 // will prevent the tree from being constructed in a way where the same branch
 // of each node is always used, effectively producing linear lookup times. Bad!
 //
@@ -149,7 +149,7 @@ impl Drop for Key {
 }
 
 // Just like with `Drop`, `Clone` needs a custom implementation that accounts
-// for the fact that key _can_ be separately heap allcated.
+// for the fact that key _can_ be separately heap allocated.
 impl Clone for Key {
     fn clone(&self) -> Self {
         if self.len > KEY_BUF_LEN {

src/parser.rs

@@ -32,7 +32,7 @@ const DEPTH_LIMIT: usize = 512;
 
 
 // The `Parser` struct keeps track of indexing over our buffer. All niceness
-// has been abandonned in favor of raw pointer magic. Does that make you feel
+// has been abandoned in favor of raw pointer magic. Does that make you feel
 // dirty? _Good._
 struct Parser<'a> {
     // Helper buffer for parsing strings that can't be just memcopied from
@@ -48,7 +48,7 @@ struct Parser<'a> {
     // Current index
     index: usize,
 
-    // Lenght of the source
+    // Length of the source
     length: usize,
 }
 
@@ -183,7 +183,7 @@ static ALLOWED: [bool; 256] = [
 ];
 
 
-// Expect a string. This is called after encontering, and consuming, a
+// Expect a string. This is called after encountering, and consuming, a
 // double quote character. This macro has a happy path variant where it
 // does almost nothing as long as all characters are allowed (as described
 // in the look up table above). If it encounters a closing quote without

src/value/implements.rs

@@ -1,4 +1,4 @@
-// This is a private module that contans `PartialEq` and `From` trait
+// This is a private module that contains `PartialEq` and `From` trait
 // implementations for `JsonValue`.
 
 use std::collections::{ BTreeMap, HashMap };
@@ -112,7 +112,7 @@ impl From<BTreeMap<String, JsonValue>> for JsonValue {
         for (key, value) in val.iter_mut() {
             // Since BTreeMap has no `drain` available, we can use
             // the mutable iterator and replace all values by nulls,
-            // taking ownership and transfering it to the new `Object`.
+            // taking ownership and transferring it to the new `Object`.
             let value = mem::replace(value, Null);
             object.insert(key, value);
         }