Skip to content

Commit 90ba29f

Browse files
committed
---
yaml --- r: 13592 b: refs/heads/master c: 1b4dcbe h: refs/heads/master v: v3
1 parent 7a72138 commit 90ba29f

File tree

4 files changed

+4
-4
lines changed

4 files changed

+4
-4
lines changed

[refs]

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
---
2-
refs/heads/master: e7ce32310b90a4738452f2331e25d4815f2ab81f
2+
refs/heads/master: 1b4dcbecac824796bf7cd49a1fbadc20e63c99ea
33
refs/heads/snap-stage1: e33de59e47c5076a89eadeb38f4934f58a3618a6
44
refs/heads/snap-stage3: 4a81779abd786ff22d71434c6d9a5917ea4cdfff
55
refs/heads/try: 2898dcc5d97da9427ac367542382b6239d9c0bbf

trunk/src/libcore/str.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -566,7 +566,7 @@ pure fn to_upper(s: str/&) -> str {
566566
}
567567

568568
#[doc = "
569-
Replace all occurances of one string with another
569+
Replace all occurrences of one string with another
570570
571571
# Arguments
572572

trunk/src/libstd/par.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -7,7 +7,7 @@ import future::future;
77
export map, mapi, alli, any, mapi_factory;
88

99
#[doc="The maximum number of tasks this module will spawn for a single
10-
operationg."]
10+
operation."]
1111
const max_tasks : uint = 32u;
1212

1313
#[doc="The minimum number of elements each task will process."]

trunk/src/test/bench/graph500-bfs.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
/**
22
3-
An implementation of the Graph500 Bread First Search problem in Rust.
3+
An implementation of the Graph500 Breadth First Search problem in Rust.
44
55
*/
66

0 commit comments

Comments
 (0)