32 Thread support library [thread]

32.5 Mutual exclusion [thread.mutex]

32.5.4 Locks [thread.lock]

32.5.4.3 Class template unique_­lock [thread.lock.unique]

32.5.4.3.1 Constructors, destructor, and assignment [thread.lock.unique.cons]

🔗
unique_lock() noexcept;
1
#
Postconditions: pm == 0 and owns == false.
🔗
explicit unique_lock(mutex_type& m);
2
#
Preconditions: If mutex_­type is not a recursive mutex the calling thread does not own the mutex.
3
#
Effects: Calls m.lock().
4
#
Postconditions: pm == addressof(m) and owns == true.
🔗
unique_lock(mutex_type& m, defer_lock_t) noexcept;
5
#
Postconditions: pm == addressof(m) and owns == false.
🔗
unique_lock(mutex_type& m, try_to_lock_t);
6
#
Preconditions: The supplied Mutex type meets the Cpp17Lockable requirements ([thread.req.lockable.req]).
If mutex_­type is not a recursive mutex the calling thread does not own the mutex.
7
#
Effects: Calls m.try_­lock().
8
#
Postconditions: pm == addressof(m) and owns == res, where res is the value returned by the call to m.try_­lock().
🔗
unique_lock(mutex_type& m, adopt_lock_t);
9
#
Preconditions: The calling thread owns the mutex.
10
#
Postconditions: pm == addressof(m) and owns == true.
11
#
Throws: Nothing.
🔗
template<class Clock, class Duration> unique_lock(mutex_type& m, const chrono::time_point<Clock, Duration>& abs_time);
12
#
Preconditions: If mutex_­type is not a recursive mutex the calling thread does not own the mutex.
The supplied Mutex type meets the Cpp17TimedLockable requirements ([thread.req.lockable.timed]).
13
#
Effects: Calls m.try_­lock_­until(abs_­time).
14
#
Postconditions: pm == addressof(m) and owns == res, where res is the value returned by the call to m.try_­lock_­until(abs_­time).
🔗
template<class Rep, class Period> unique_lock(mutex_type& m, const chrono::duration<Rep, Period>& rel_time);
15
#
Preconditions: If mutex_­type is not a recursive mutex the calling thread does not own the mutex.
The supplied Mutex type meets the Cpp17TimedLockable requirements ([thread.req.lockable.timed]).
16
#
Effects: Calls m.try_­lock_­for(rel_­time).
17
#
Postconditions: pm == addressof(m) and owns == res, where res is the value returned by the call to m.try_­lock_­for(rel_­time).
🔗
unique_lock(unique_lock&& u) noexcept;
18
#
Postconditions: pm == u_­p.pm and owns == u_­p.owns (where u_­p is the state of u just prior to this construction), u.pm == 0 and u.owns == false.
🔗
unique_lock& operator=(unique_lock&& u);
19
#
Effects: If owns calls pm->unlock().
20
#
Postconditions: pm == u_­p.pm and owns == u_­p.owns (where u_­p is the state of u just prior to this construction), u.pm == 0 and u.owns == false.
21
#
[ Note
:
With a recursive mutex it is possible for both *this and u to own the same mutex before the assignment.
In this case, *this will own the mutex after the assignment and u will not.
— end note
 ]
22
#
Throws: Nothing.
🔗
~unique_lock();
23
#
Effects: If owns calls pm->unlock().