tmp/tmp1cju67ca/{from.md → to.md}
RENAMED
|
@@ -21,11 +21,11 @@ namespace std {
|
|
| 21 |
|
| 22 |
unique_lock(unique_lock const&) = delete;
|
| 23 |
unique_lock& operator=(unique_lock const&) = delete;
|
| 24 |
|
| 25 |
unique_lock(unique_lock&& u) noexcept;
|
| 26 |
-
unique_lock& operator=(unique_lock&& u)
|
| 27 |
|
| 28 |
// [thread.lock.unique.locking], locking:
|
| 29 |
void lock();
|
| 30 |
bool try_lock();
|
| 31 |
|
|
@@ -165,11 +165,11 @@ unique_lock(unique_lock&& u) noexcept;
|
|
| 165 |
*Postconditions:* `pm == u_p.pm` and `owns == u_p.owns` (where `u_p` is
|
| 166 |
the state of `u` just prior to this construction), `u.pm == 0` and
|
| 167 |
`u.owns == false`.
|
| 168 |
|
| 169 |
``` cpp
|
| 170 |
-
unique_lock& operator=(unique_lock&& u)
|
| 171 |
```
|
| 172 |
|
| 173 |
*Effects:* If `owns` calls `pm->unlock()`.
|
| 174 |
|
| 175 |
*Postconditions:* `pm == u_p.pm` and `owns == u_p.owns` (where `u_p` is
|
|
@@ -178,10 +178,12 @@ the state of `u` just prior to this construction), `u.pm == 0` and
|
|
| 178 |
|
| 179 |
With a recursive mutex it is possible for both `*this` and `u` to own
|
| 180 |
the same mutex before the assignment. In this case, `*this` will own the
|
| 181 |
mutex after the assignment and `u` will not.
|
| 182 |
|
|
|
|
|
|
|
| 183 |
``` cpp
|
| 184 |
~unique_lock();
|
| 185 |
```
|
| 186 |
|
| 187 |
*Effects:* If `owns` calls `pm->unlock()`.
|
|
|
|
| 21 |
|
| 22 |
unique_lock(unique_lock const&) = delete;
|
| 23 |
unique_lock& operator=(unique_lock const&) = delete;
|
| 24 |
|
| 25 |
unique_lock(unique_lock&& u) noexcept;
|
| 26 |
+
unique_lock& operator=(unique_lock&& u);
|
| 27 |
|
| 28 |
// [thread.lock.unique.locking], locking:
|
| 29 |
void lock();
|
| 30 |
bool try_lock();
|
| 31 |
|
|
|
|
| 165 |
*Postconditions:* `pm == u_p.pm` and `owns == u_p.owns` (where `u_p` is
|
| 166 |
the state of `u` just prior to this construction), `u.pm == 0` and
|
| 167 |
`u.owns == false`.
|
| 168 |
|
| 169 |
``` cpp
|
| 170 |
+
unique_lock& operator=(unique_lock&& u);
|
| 171 |
```
|
| 172 |
|
| 173 |
*Effects:* If `owns` calls `pm->unlock()`.
|
| 174 |
|
| 175 |
*Postconditions:* `pm == u_p.pm` and `owns == u_p.owns` (where `u_p` is
|
|
|
|
| 178 |
|
| 179 |
With a recursive mutex it is possible for both `*this` and `u` to own
|
| 180 |
the same mutex before the assignment. In this case, `*this` will own the
|
| 181 |
mutex after the assignment and `u` will not.
|
| 182 |
|
| 183 |
+
*Throws:* Nothing.
|
| 184 |
+
|
| 185 |
``` cpp
|
| 186 |
~unique_lock();
|
| 187 |
```
|
| 188 |
|
| 189 |
*Effects:* If `owns` calls `pm->unlock()`.
|