Rollup merge of #61715 - RalfJung:test-ascii-lowercase, r=varkor

[rust.git] / src / librustc / ty / steal.rs

diff --git a/src/librustc/ty/steal.rs b/src/librustc/ty/steal.rs
index 336a4c3bf22799795c7ba793e2ef8c1a62dfad80..711e59dbcc9d2752b3c35b9a1b7bbcdb36fdc787 100644 (file)
--- a/src/librustc/ty/steal.rs
+++ b/src/librustc/ty/steal.rs
@@ -7,19 +7,19 @@
 /// optimization, but that'd be expensive. And yet we don't just want
 /// to mutate it in place, because that would spoil the idea that
 /// queries are these pure functions that produce an immutable value
-/// (since if you did the query twice, you could observe the
-/// mutations). So instead we have the query produce a `&'tcx
-/// Steal<Mir<'tcx>>` (to be very specific). Now we can read from this
+/// (since if you did the query twice, you could observe the mutations).
+/// So instead we have the query produce a `&'tcx Steal<mir::Body<'tcx>>`
+/// (to be very specific). Now we can read from this
 /// as much as we want (using `borrow()`), but you can also
 /// `steal()`. Once you steal, any further attempt to read will panic.
-/// Therefore we know that -- assuming no ICE -- nobody is observing
+/// Therefore, we know that -- assuming no ICE -- nobody is observing
 /// the fact that the MIR was updated.
 ///
 /// Obviously, whenever you have a query that yields a `Steal` value,
 /// you must treat it with caution, and make sure that you know that
 /// -- once the value is stolen -- it will never be read from again.
-///
-/// FIXME(#41710) -- what is the best way to model linear queries?
+//
+// FIXME(#41710): what is the best way to model linear queries?
 pub struct Steal<T> {
     value: RwLock<Option<T>>
 }