about summary refs log tree commit diff
diff options
context:
space:
mode:
authorTim Chevalier <chevalier@alum.wellesley.edu>2012-06-18 13:34:15 -0700
committerTim Chevalier <chevalier@alum.wellesley.edu>2012-06-20 20:12:14 -0700
commit1b4dcbecac824796bf7cd49a1fbadc20e63c99ea (patch)
tree8f04f7d4a00d2a037ad9f15a16c062c4618d52bb
parente7ce32310b90a4738452f2331e25d4815f2ab81f (diff)
downloadrust-1b4dcbecac824796bf7cd49a1fbadc20e63c99ea.tar.gz
rust-1b4dcbecac824796bf7cd49a1fbadc20e63c99ea.zip
Comments only: typos
-rw-r--r--src/libcore/str.rs2
-rw-r--r--src/libstd/par.rs2
-rw-r--r--src/test/bench/graph500-bfs.rs2
3 files changed, 3 insertions, 3 deletions
diff --git a/src/libcore/str.rs b/src/libcore/str.rs
index 8f68ff8d4da..f1136fde5e2 100644
--- a/src/libcore/str.rs
+++ b/src/libcore/str.rs
@@ -566,7 +566,7 @@ pure fn to_upper(s: str/&) -> str {
 }
 
 #[doc = "
-Replace all occurances of one string with another
+Replace all occurrences of one string with another
 
 # Arguments
 
diff --git a/src/libstd/par.rs b/src/libstd/par.rs
index ffca5989857..e621fd78724 100644
--- a/src/libstd/par.rs
+++ b/src/libstd/par.rs
@@ -7,7 +7,7 @@ import future::future;
 export map, mapi, alli, any, mapi_factory;
 
 #[doc="The maximum number of tasks this module will spawn for a single
-operationg."]
+operation."]
 const max_tasks : uint = 32u;
 
 #[doc="The minimum number of elements each task will process."]
diff --git a/src/test/bench/graph500-bfs.rs b/src/test/bench/graph500-bfs.rs
index e51cb6c98b2..6c6466017ef 100644
--- a/src/test/bench/graph500-bfs.rs
+++ b/src/test/bench/graph500-bfs.rs
@@ -1,6 +1,6 @@
 /**
 
-An implementation of the Graph500 Bread First Search problem in Rust.
+An implementation of the Graph500 Breadth First Search problem in Rust.
 
 */