mirror of
https://github.com/rust-lang/rust.git
synced 2025-06-22 20:47:48 +00:00
Comments only: typos
This commit is contained in:
parent
e7ce32310b
commit
1b4dcbecac
@ -566,7 +566,7 @@ pure fn to_upper(s: str/&) -> str {
|
|||||||
}
|
}
|
||||||
|
|
||||||
#[doc = "
|
#[doc = "
|
||||||
Replace all occurances of one string with another
|
Replace all occurrences of one string with another
|
||||||
|
|
||||||
# Arguments
|
# Arguments
|
||||||
|
|
||||||
|
@ -7,7 +7,7 @@ import future::future;
|
|||||||
export map, mapi, alli, any, mapi_factory;
|
export map, mapi, alli, any, mapi_factory;
|
||||||
|
|
||||||
#[doc="The maximum number of tasks this module will spawn for a single
|
#[doc="The maximum number of tasks this module will spawn for a single
|
||||||
operationg."]
|
operation."]
|
||||||
const max_tasks : uint = 32u;
|
const max_tasks : uint = 32u;
|
||||||
|
|
||||||
#[doc="The minimum number of elements each task will process."]
|
#[doc="The minimum number of elements each task will process."]
|
||||||
|
@ -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.
|
||||||
|
|
||||||
*/
|
*/
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user