Performs atomic waiting operations. Behaves as if it repeatedly performs the following steps:
These functions are guaranteed to return only if value has changed, even if the underlying implementation unblocks spuriously.
1,2) Equivalent to object->wait(old).
3,4) Equivalent to object->wait(old, order).
If order is one of std::memory_order::release and std::memory_order::acq_rel, the behavior is undefined.
[edit] Parameters object - pointer to the atomic object to check and wait on old - the value to check the atomic object no longer contains order - the memory synchronization ordering [edit] Return value(none)
[edit] NotesThis form of change-detection is often more efficient than simple polling or pure spinlocks.
Due to the ABA problem, transient changes from old to another value and back to old might be missed, and not unblock.
The comparison is bitwise (similar to std::memcmp); no comparison operator is used. Padding bits that never participate in an object's value representation are ignored.
[edit] Example [edit] See also blocks the thread until notified and the atomic value changesstd::atomic<T>
) [edit] notifies at least one thread waiting on the atomic object
std::atomic<T>
) [edit] notifies all threads blocked waiting on the atomic object
std::atomic<T>
) [edit] notifies a thread blocked in atomic_wait
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4