tmp/tmpwcbe4zw2/{from.md → to.md}
RENAMED
|
@@ -91,11 +91,11 @@ unique_lock(unique_lock&& u) noexcept;
|
|
| 91 |
*Postconditions:* `pm == u_p.pm` and `owns == u_p.owns` (where `u_p` is
|
| 92 |
the state of `u` just prior to this construction), `u.pm == 0` and
|
| 93 |
`u.owns == false`.
|
| 94 |
|
| 95 |
``` cpp
|
| 96 |
-
unique_lock& operator=(unique_lock&& u)
|
| 97 |
```
|
| 98 |
|
| 99 |
*Effects:* If `owns` calls `pm->unlock()`.
|
| 100 |
|
| 101 |
*Postconditions:* `pm == u_p.pm` and `owns == u_p.owns` (where `u_p` is
|
|
@@ -104,10 +104,12 @@ the state of `u` just prior to this construction), `u.pm == 0` and
|
|
| 104 |
|
| 105 |
With a recursive mutex it is possible for both `*this` and `u` to own
|
| 106 |
the same mutex before the assignment. In this case, `*this` will own the
|
| 107 |
mutex after the assignment and `u` will not.
|
| 108 |
|
|
|
|
|
|
|
| 109 |
``` cpp
|
| 110 |
~unique_lock();
|
| 111 |
```
|
| 112 |
|
| 113 |
*Effects:* If `owns` calls `pm->unlock()`.
|
|
|
|
| 91 |
*Postconditions:* `pm == u_p.pm` and `owns == u_p.owns` (where `u_p` is
|
| 92 |
the state of `u` just prior to this construction), `u.pm == 0` and
|
| 93 |
`u.owns == false`.
|
| 94 |
|
| 95 |
``` cpp
|
| 96 |
+
unique_lock& operator=(unique_lock&& u);
|
| 97 |
```
|
| 98 |
|
| 99 |
*Effects:* If `owns` calls `pm->unlock()`.
|
| 100 |
|
| 101 |
*Postconditions:* `pm == u_p.pm` and `owns == u_p.owns` (where `u_p` is
|
|
|
|
| 104 |
|
| 105 |
With a recursive mutex it is possible for both `*this` and `u` to own
|
| 106 |
the same mutex before the assignment. In this case, `*this` will own the
|
| 107 |
mutex after the assignment and `u` will not.
|
| 108 |
|
| 109 |
+
*Throws:* Nothing.
|
| 110 |
+
|
| 111 |
``` cpp
|
| 112 |
~unique_lock();
|
| 113 |
```
|
| 114 |
|
| 115 |
*Effects:* If `owns` calls `pm->unlock()`.
|