Home
last modified time | relevance | path

Searched refs:_Node (Results 1 – 10 of 10) sorted by relevance

/openbsd/src/gnu/lib/libstdc++/libstdc++/include/ext/
Dstl_hashtable.h118 typedef _Hashtable_node<_Val> _Node; typedef
127 _Node* _M_cur;
130 _Hashtable_iterator(_Node* __n, _Hashtable* __tab) in _Hashtable_iterator()
155 typedef _Hashtable_node<_Val> _Node; typedef
164 const _Node* _M_cur;
167 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab) in _Hashtable_const_iterator()
241 typedef _Hashtable_node<_Val> _Node; typedef
247 typename _Alloc_traits<_Node, _Alloc>::allocator_type _M_node_allocator;
248 _Node* _M_get_node() { return _M_node_allocator.allocate(1); } in _M_get_node()
249 void _M_put_node(_Node* __p) { _M_node_allocator.deallocate(__p, 1); } in _M_put_node()
[all …]
Dslist182 typedef _Slist_node<_Tp> _Node;
184 _Slist_iterator(_Node* __x) : _Slist_iterator_base(__x) {}
188 reference operator*() const { return ((_Node*) _M_node)->_M_data; }
327 typedef _Slist_node<_Tp> _Node;
331 _Node* _M_create_node(const value_type& __x) {
332 _Node* __node = this->_M_get_node();
345 _Node* _M_create_node() {
346 _Node* __node = this->_M_get_node();
410 iterator begin() { return iterator((_Node*)this->_M_head._M_next); }
412 { return const_iterator((_Node*)this->_M_head._M_next);}
[all …]
/openbsd/src/gnu/gcc/libstdc++-v3/include/ext/
Dhashtable.h118 typedef _Hashtable_node<_Val> _Node; typedef
126 _Node* _M_cur;
129 _Hashtable_iterator(_Node* __n, _Hashtable* __tab) in _Hashtable_iterator()
169 typedef _Hashtable_node<_Val> _Node; typedef
178 const _Node* _M_cur;
181 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab) in _Hashtable_const_iterator()
279 typedef _Hashtable_node<_Val> _Node; typedef
288 typedef typename _Alloc::template rebind<_Node>::other _Node_Alloc;
289 typedef typename _Alloc::template rebind<_Node*>::other _Nodeptr_Alloc;
290 typedef vector<_Node*, _Nodeptr_Alloc> _Vector_type;
[all …]
Dslist193 typedef _Slist_node<_Tp> _Node;
196 _Slist_iterator(_Node* __x)
207 { return ((_Node*) _M_node)->_M_data; }
322 typedef _Slist_node<_Tp> _Node;
326 _Node*
329 _Node* __node = this->_M_get_node();
343 _Node*
346 _Node* __node = this->_M_get_node();
427 { return iterator((_Node*)this->_M_head._M_next); }
431 { return const_iterator((_Node*)this->_M_head._M_next);}
[all …]
/openbsd/src/gnu/lib/libstdc++/libstdc++/include/bits/
Dlist.tcc71 typedef _List_node<_Tp> _Node; in __clear() typedef
72 _Node* __cur = static_cast<_Node*>(_M_node->_M_next); in __clear()
75 _Node* __tmp = __cur; in __clear()
76 __cur = static_cast<_Node*>(__cur->_M_next); in __clear()
89 _Node* __tmp = _M_create_node(__x); in insert()
104 _Node* __n = static_cast<_Node*>(__position._M_node); in erase()
109 return iterator(static_cast<_Node*>(__next_node)); in erase()
Dstl_list.h152 typedef _List_node<_Tp> _Node; typedef
154 _List_iterator(_Node* __x) in _List_iterator()
167 { return static_cast<_Node*>(_M_node)->_M_data; }
389 typedef _List_node<_Tp> _Node; typedef
408 _Node*
411 _Node* __p = _M_get_node(); in _M_create_node()
429 _Node*
432 _Node* __p = _M_get_node(); in _M_create_node()
569 begin() { return static_cast<_Node*>(_M_node->_M_next); } in begin()
576 begin() const { return static_cast<_Node*>(_M_node->_M_next); } in begin()
/openbsd/src/gnu/gcc/libstdc++-v3/include/tr1/
Dhashtable185 typedef __detail::_Hash_node<_Value, __cache_hash_code> _Node;
186 typedef typename _Allocator::template rebind<_Node>::other
188 typedef typename _Allocator::template rebind<_Node*>::other
195 _Node** _M_buckets;
200 _Node*
204 _M_deallocate_node(_Node* __n);
207 _M_deallocate_nodes(_Node**, size_type);
209 _Node**
213 _M_deallocate_buckets(_Node**, size_type __n);
376 _Node*
[all …]
Dhashtable_policy.h645 typename _Hashtable::_Node* __p = in _GLIBCXX_BEGIN_NAMESPACE()
/openbsd/src/gnu/gcc/libstdc++-v3/include/bits/
Dstl_list.h115 typedef _List_node<_Tp> _Node; typedef
133 { return static_cast<_Node*>(_M_node)->_M_data; }
137 { return &static_cast<_Node*>(_M_node)->_M_data; }
192 typedef const _List_node<_Tp> _Node; typedef
215 { return static_cast<_Node*>(_M_node)->_M_data; }
219 { return &static_cast<_Node*>(_M_node)->_M_data; }
434 typedef _List_node<_Tp> _Node; typedef
449 _Node*
452 _Node* __p = this->_M_get_node(); in _M_create_node()
1161 _Node* __tmp = _M_create_node(__x); in _M_insert()
[all …]
Dlist.tcc72 typedef _List_node<_Tp> _Node; in _GLIBCXX_BEGIN_NESTED_NAMESPACE() typedef
73 _Node* __cur = static_cast<_Node*>(this->_M_impl._M_node._M_next); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
76 _Node* __tmp = __cur; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
77 __cur = static_cast<_Node*>(__cur->_M_next); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
88 _Node* __tmp = _M_create_node(__x); in insert()