#include <pplcancellation_token.h>
Concurrency::details::_CancellationTokenState::TokenRegistrationContainer::TokenRegistrationContainer |
( |
| ) |
|
|
inline |
Node * _M_begin
Definition: pplcancellation_token.h:317
Node * _M_last
Definition: pplcancellation_token.h:318
Concurrency::details::_CancellationTokenState::TokenRegistrationContainer::~TokenRegistrationContainer |
( |
| ) |
|
|
inline |
231 while (node !=
nullptr)
_CRTIMP _CRTNOALIAS void __cdecl free(_Pre_maybenull_ _Post_invalid_ void *_Memory)
Node * _M_begin
Definition: pplcancellation_token.h:317
struct Concurrency::details::_CancellationTokenState::TokenRegistrationContainer::_Node Node
_Node * _M_next
Definition: pplcancellation_token.h:220
bool Concurrency::details::_CancellationTokenState::TokenRegistrationContainer::empty |
( |
| ) |
|
|
inline |
Node * _M_begin
Definition: pplcancellation_token.h:317
template<typename T >
void Concurrency::details::_CancellationTokenState::TokenRegistrationContainer::for_each |
( |
T |
lambda | ) |
|
|
inline |
255 while (node !=
nullptr)
257 lambda(node->_M_token);
258 node = node->_M_next;
Node * _M_begin
Definition: pplcancellation_token.h:317
struct Concurrency::details::_CancellationTokenState::TokenRegistrationContainer::_Node Node
264 Node* node =
reinterpret_cast<Node*
>(::malloc(
sizeof(
Node)));
267 throw ::std::bad_alloc();
270 node->_M_token = token;
271 node->_M_next =
nullptr;
Node * _M_begin
Definition: pplcancellation_token.h:317
struct Concurrency::details::_CancellationTokenState::TokenRegistrationContainer::_Node Node
Node * _M_last
Definition: pplcancellation_token.h:318
_Node * _M_next
Definition: pplcancellation_token.h:220
290 while (node !=
nullptr)
292 if (node->_M_token == token) {
302 if (node->_M_next ==
nullptr)
312 node = node->_M_next;
_CRTIMP _CRTNOALIAS void __cdecl free(_Pre_maybenull_ _Post_invalid_ void *_Memory)
Node * _M_begin
Definition: pplcancellation_token.h:317
struct Concurrency::details::_CancellationTokenState::TokenRegistrationContainer::_Node Node
_BidIt prev(_BidIt _First, typename iterator_traits< _BidIt >::difference_type _Off=1)
Definition: xutility:784
Node * _M_last
Definition: pplcancellation_token.h:318
_Node * _M_next
Definition: pplcancellation_token.h:220
Node * _M_begin
Definition: pplcancellation_token.h:317
Node * _M_last
Definition: pplcancellation_token.h:318
void swap(array< _Ty, _Size > &_Left, array< _Ty, _Size > &_Right) _NOEXCEPT_OP(_NOEXCEPT_OP(_Left.swap(_Right)))
Definition: array:429
Node* Concurrency::details::_CancellationTokenState::TokenRegistrationContainer::_M_begin |
|
private |
Node* Concurrency::details::_CancellationTokenState::TokenRegistrationContainer::_M_last |
|
private |
The documentation for this class was generated from the following file: