From 1b4dcbecac824796bf7cd49a1fbadc20e63c99ea Mon Sep 17 00:00:00 2001 From: Tim Chevalier Date: Mon, 18 Jun 2012 13:34:15 -0700 Subject: [PATCH] Comments only: typos --- src/libcore/str.rs | 2 +- src/libstd/par.rs | 2 +- src/test/bench/graph500-bfs.rs | 2 +- 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. */