Searched refs:_Node (Results 1 – 6 of 6) sorted by relevance
132 typedef _Slist_node<_Tp> _Node; typedef134 _Slist_iterator(_Node* __x) : _Slist_iterator_base(__x) {} in _Slist_iterator()138 reference operator*() const { return ((_Node*) _M_node)->_M_data; }320 typedef _Slist_node<_Tp> _Node; typedef324 _Node* _M_create_node(const value_type& __x) { in _M_create_node()325 _Node* __node = _M_get_node(); in _M_create_node()334 _Node* _M_create_node() { in _M_create_node()335 _Node* __node = _M_get_node(); in _M_create_node()414 iterator begin() { return iterator((_Node*)_M_head._M_next); } in begin()416 { return const_iterator((_Node*)_M_head._M_next);} in begin()[all …]
79 typedef _Hashtable_node<_Val> _Node; typedef88 _Node* _M_cur;91 _Hashtable_iterator(_Node* __n, _Hashtable* __tab) in _Hashtable_iterator()118 typedef _Hashtable_node<_Val> _Node; typedef127 const _Node* _M_cur;130 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab) in _Hashtable_const_iterator()205 typedef _Hashtable_node<_Val> _Node; typedef212 typename _Alloc_traits<_Node, _Alloc>::allocator_type _M_node_allocator;213 _Node* _M_get_node() { return _M_node_allocator.allocate(1); } in _M_get_node()214 void _M_put_node(_Node* __p) { _M_node_allocator.deallocate(__p, 1); } in _M_put_node()[all …]
59 typedef _List_node<_Tp> _Node; typedef63 _Node* _M_node;65 _List_iterator(_Node* __x) : _M_node(__x) {} in _List_iterator()78 _M_node = (_Node*)(_M_node->_M_next);87 _M_node = (_Node*)(_M_node->_M_prev);258 typedef _List_node<_Tp> _Node; typedef289 _Node* _M_create_node(const _Tp& __x) in _M_create_node()291 _Node* __p = _M_get_node(); in _M_create_node()299 _Node* _M_create_node() in _M_create_node()301 _Node* __p = _M_get_node(); in _M_create_node()[all …]
90 media_connection::_Node() const in _Node() function in media_connection
566 handle._Node().node, handle.destination); in _DisconnectConnection()569 handle._Node().node, handle.source, in _DisconnectConnection()
77 media_node _Node() const;