about summary refs log tree commit diff
diff options
context:
space:
mode:
authorGeoff Yoerger <geoffreyiy1@gmail.com>2017-01-20 09:25:03 -0600
committerGitHub <noreply@github.com>2017-01-20 09:25:03 -0600
commitc0a5b99f01df01341500d4c23a724bddb029a9cb (patch)
tree6c7faa1cf48e2e13284c6407fd490bc5ab1f9a89
parentdfa9736e9f5b9e5650fea5faed6dc7d446772eb4 (diff)
downloadrust-c0a5b99f01df01341500d4c23a724bddb029a9cb.tar.gz
rust-c0a5b99f01df01341500d4c23a724bddb029a9cb.zip
Revert previous commit
-rw-r--r--src/libcore/sync/atomic.rs4
1 files changed, 0 insertions, 4 deletions
diff --git a/src/libcore/sync/atomic.rs b/src/libcore/sync/atomic.rs
index 3d274d17c7c..a3cb1284477 100644
--- a/src/libcore/sync/atomic.rs
+++ b/src/libcore/sync/atomic.rs
@@ -140,10 +140,6 @@ unsafe impl<T> Sync for AtomicPtr<T> {}
 /// to be moved either before or after the atomic operation; on the other end
 /// "relaxed" atomics allow all reorderings.
 ///
-/// If you are confused or don't have enough time to research which ordering to use, use `SeqCst`.
-/// Of all the options it has the most unsurpising effect (see the nomicon for details. [1]) 
-/// The downside is you miss out on several optimizations the other orderings offer.
-///
 /// Rust's memory orderings are [the same as
 /// LLVM's](http://llvm.org/docs/LangRef.html#memory-model-for-concurrent-operations).
 ///