auto merge of #8551 : huonw/rust/speling, r=alexcrichton

(This doesn't add/remove `u`s or change `ize` to `ise`, or anything like that.)
This commit is contained in:
bors 2013-08-18 05:11:58 -07:00
commit 3bc6858428
41 changed files with 80 additions and 79 deletions

View file

@ -39,14 +39,14 @@ pub struct AtomicBool {
}
/**
* A signed atomic integer type, supporting basic atomic aritmetic operations
* A signed atomic integer type, supporting basic atomic arithmetic operations
*/
pub struct AtomicInt {
priv v: int
}
/**
* An unsigned atomic integer type, supporting basic atomic aritmetic operations
* An unsigned atomic integer type, supporting basic atomic arithmetic operations
*/
pub struct AtomicUint {
priv v: uint
@ -497,7 +497,7 @@ pub unsafe fn atomic_xor<T>(dst: &mut T, val: T, order: Ordering) -> T {
* A fence 'A' which has `Release` ordering semantics, synchronizes with a
* fence 'B' with (at least) `Acquire` semantics, if and only if there exists
* atomic operations X and Y, both operating on some atomic object 'M' such
* that A is sequenced before X, Y is synchronized before B and Y obsevers
* that A is sequenced before X, Y is synchronized before B and Y observers
* the change to M. This provides a happens-before dependence between A and B.
*
* Atomic operations with `Release` or `Acquire` semantics can also synchronize

View file

@ -18,7 +18,7 @@ stack closures that emulates Java-style try/finally blocks.
do || {
...
}.finally {
alway_run_this();
always_run_this();
}
~~~
*/

View file

@ -22,7 +22,7 @@ semantics as C++11. See the LLVM documentation on [[atomics]].
A quick refresher on memory ordering:
* Acquire - a barrier for aquiring a lock. Subsequent reads and writes
* Acquire - a barrier for acquiring a lock. Subsequent reads and writes
take place after the barrier.
* Release - a barrier for releasing a lock. Preceding reads and writes
take place before the barrier.