---

catamorphism · catamorphism · commit c48e08023386 · 2012-06-20T20:12:14.000-07:00
yaml --- r: 10612 b: refs/heads/snap-stage3 c: 1b4dcbe h: refs/heads/master v: v3
diff --git a/[refs] b/[refs]
@@ -1,6 +1,6 @@
 ---
 refs/heads/master: 2898dcc5d97da9427ac367542382b6239d9c0bbf
 refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
-refs/heads/snap-stage3: e7ce32310b90a4738452f2331e25d4815f2ab81f
+refs/heads/snap-stage3: 1b4dcbecac824796bf7cd49a1fbadc20e63c99ea
 refs/heads/try: 2898dcc5d97da9427ac367542382b6239d9c0bbf
 refs/tags/release-0.1: 1f5c5126e96c79d22cb7862f75304136e204f105
diff --git a/branches/snap-stage3/src/libcore/str.rs b/branches/snap-stage3/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/branches/snap-stage3/src/libstd/par.rs b/branches/snap-stage3/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/branches/snap-stage3/src/test/bench/graph500-bfs.rs b/branches/snap-stage3/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.
 
 */
 

Original file line number	Diff line number	Diff line change
`@@ -566,7 +566,7 @@ pure fn to_upper(s: str/&) -> str {`
`566`	`566`	`}`
`567`	`567`
`568`	`568`	`#[doc = "`
`569`		`-Replace all occurances of one string with another`
	`569`	`+Replace all occurrences of one string with another`
`570`	`570`
`571`	`571`	`# Arguments`
`572`	`572`
-Original file line number
+Diff line change
@@ @@ -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.
 */