HomeSort by relevance Sort by last modified time
    Searched defs:_Node (Results 26 - 50 of 95) sorted by null

12 3 4

  /external/stlport/stlport/stl/
_slist.h 95 typedef _Slist_node<value_type> _Node;
102 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
150 typedef _Slist_node<_Tp> _Node;
151 typedef typename _Alloc_traits<_Node,_Alloc>::allocator_type _M_node_allocator_type;
155 typedef _STLP_alloc_proxy<_Slist_node_base, _Node, _M_node_allocator_type> _AllocProxy;
161 _M_head(_STLP_CONVERT_ALLOCATOR(__a, _Node), _Slist_node_base() )
174 _Node* __next = __STATIC_CAST(_Node*, __pos->_M_next);
246 typedef _STLP_PRIV _Slist_node<_Tp> _Node;
250 _Node* _M_create_node(const value_type& __x = _Tp())
    [all...]
_tree.h 235 typedef _Rb_tree_node<_Tp> _Node;
240 typedef typename _Alloc_traits<_Node, _Alloc>::allocator_type _M_node_allocator_type;
241 typedef _STLP_alloc_proxy<_Node_base, _Node, _M_node_allocator_type> _AllocProxy;
250 _M_header(_STLP_CONVERT_ALLOCATOR(__a, _Node), _Node_base() ) {
297 typedef _Rb_tree_node<_Value> _Node;
298 typedef _Node* _Link_type;
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_list.h 109 typedef _List_node<_Tp> _Node;
118 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
178 typedef _List_node<_Tp> _Node;
180 typedef typename _Alloc_traits<_Node, _Alloc>::allocator_type _Node_allocator_type;
182 typedef _STLP_alloc_proxy<_Node_base, _Node, _Node_allocator_type> _AllocProxy;
188 _List_base(const allocator_type& __a) : _M_node(_STLP_CONVERT_ALLOCATOR(__a, _Node), _Node_base())
260 typedef _STLP_PRIV _List_node<_Tp> _Node;
285 _Node* __p = this->_M_node.allocate(1);
295 _Node* __p = this->_M_node.allocate(1);
521 _Node* __n = __STATIC_CAST(_Node*, __pos._M_node)
    [all...]
_slist.h 95 typedef _Slist_node<value_type> _Node;
102 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
150 typedef _Slist_node<_Tp> _Node;
151 typedef typename _Alloc_traits<_Node,_Alloc>::allocator_type _M_node_allocator_type;
155 typedef _STLP_alloc_proxy<_Slist_node_base, _Node, _M_node_allocator_type> _AllocProxy;
161 _M_head(_STLP_CONVERT_ALLOCATOR(__a, _Node), _Slist_node_base() )
174 _Node* __next = __STATIC_CAST(_Node*, __pos->_M_next);
246 typedef _STLP_PRIV _Slist_node<_Tp> _Node;
250 _Node* _M_create_node(const value_type& __x = _Tp())
    [all...]
_tree.h 235 typedef _Rb_tree_node<_Tp> _Node;
240 typedef typename _Alloc_traits<_Node, _Alloc>::allocator_type _M_node_allocator_type;
241 typedef _STLP_alloc_proxy<_Node_base, _Node, _M_node_allocator_type> _AllocProxy;
250 _M_header(_STLP_CONVERT_ALLOCATOR(__a, _Node), _Node_base() ) {
297 typedef _Rb_tree_node<_Value> _Node;
298 typedef _Node* _Link_type;
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/backward/
hashtable.h 115 typedef _Hashtable_node<_Val> _Node;
123 _Node* _M_cur;
126 _Hashtable_iterator(_Node* __n, _Hashtable* __tab)
167 typedef _Hashtable_node<_Val> _Node;
176 const _Node* _M_cur;
179 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab)
293 typedef _Hashtable_node<_Val> _Node;
302 typedef typename _Alloc::template rebind<_Node>::other _Node_Alloc;
303 typedef typename _Alloc::template rebind<_Node*>::other _Nodeptr_Alloc;
304 typedef vector<_Node*, _Nodeptr_Alloc> _Vector_type
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/bits/
forward_list.h 120 typedef _Fwd_list_node<_Tp> _Node;
137 { return static_cast<_Node*>(this->_M_node)->_M_value; }
141 { return std::__addressof(static_cast<_Node*>
188 typedef const _Fwd_list_node<_Tp> _Node;
209 { return static_cast<_Node*>(this->_M_node)->_M_value; }
213 { return std::__addressof(static_cast<_Node*>
300 typedef _Fwd_list_node<_Tp> _Node;
337 _Node*
342 _Node*
345 _Node* __node = this->_M_get_node()
    [all...]
hashtable.h 168 typedef __detail::_Hash_node<_Value, __cache_hash_code> _Node;
169 typedef typename _Allocator::template rebind<_Node>::other
171 typedef typename _Allocator::template rebind<_Node*>::other
178 _Node** _M_buckets;
185 _Node*
189 _M_deallocate_node(_Node* __n);
192 _M_deallocate_nodes(_Node**, size_type);
194 _Node**
198 _M_deallocate_buckets(_Node**, size_type __n);
368 _Node*
    [all...]
stl_list.h 127 typedef _List_node<_Tp> _Node;
145 { return static_cast<_Node*>(_M_node)->_M_data; }
149 { return std::__addressof(static_cast<_Node*>(_M_node)->_M_data); }
202 typedef const _List_node<_Tp> _Node;
225 { return static_cast<_Node*>(_M_node)->_M_data; }
229 { return std::__addressof(static_cast<_Node*>(_M_node)->_M_data); }
454 // Note that pointers-to-_Node's can be ctor-converted to
456 typedef _List_node<_Tp> _Node;
470 _Node*
473 _Node* __p = this->_M_get_node()
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/tr1/
hashtable.h 163 typedef __detail::_Hash_node<_Value, __cache_hash_code> _Node;
164 typedef typename _Allocator::template rebind<_Node>::other
166 typedef typename _Allocator::template rebind<_Node*>::other
173 _Node** _M_buckets;
178 _Node*
182 _M_deallocate_node(_Node* __n);
185 _M_deallocate_nodes(_Node**, size_type);
187 _Node**
191 _M_deallocate_buckets(_Node**, size_type __n);
354 _Node*
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/backward/
hashtable.h 114 typedef _Hashtable_node<_Val> _Node;
122 _Node* _M_cur;
125 _Hashtable_iterator(_Node* __n, _Hashtable* __tab)
165 typedef _Hashtable_node<_Val> _Node;
174 const _Node* _M_cur;
177 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab)
291 typedef _Hashtable_node<_Val> _Node;
300 typedef typename _Alloc::template rebind<_Node>::other _Node_Alloc;
301 typedef typename _Alloc::template rebind<_Node*>::other _Nodeptr_Alloc;
302 typedef vector<_Node*, _Nodeptr_Alloc> _Vector_type
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/
forward_list.h 124 typedef _Fwd_list_node<_Tp> _Node;
141 { return *static_cast<_Node*>(this->_M_node)->_M_valptr(); }
145 { return static_cast<_Node*>(this->_M_node)->_M_valptr(); }
191 typedef const _Fwd_list_node<_Tp> _Node;
212 { return *static_cast<_Node*>(this->_M_node)->_M_valptr(); }
216 { return static_cast<_Node*>(this->_M_node)->_M_valptr(); }
310 typedef _Fwd_list_node<_Tp> _Node;
340 _Node*
345 _Node*
348 _Node* __node = this->_M_get_node()
    [all...]
stl_list.h 128 typedef _List_node<_Tp> _Node;
146 { return static_cast<_Node*>(_M_node)->_M_data; }
150 { return std::__addressof(static_cast<_Node*>(_M_node)->_M_data); }
203 typedef const _List_node<_Tp> _Node;
226 { return static_cast<_Node*>(_M_node)->_M_data; }
230 { return std::__addressof(static_cast<_Node*>(_M_node)->_M_data); }
464 // Note that pointers-to-_Node's can be ctor-converted to
466 typedef _List_node<_Tp> _Node;
481 _Node*
484 _Node* __p = this->_M_get_node()
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/tr1/
hashtable.h 163 typedef __detail::_Hash_node<_Value, __cache_hash_code> _Node;
164 typedef typename _Allocator::template rebind<_Node>::other
166 typedef typename _Allocator::template rebind<_Node*>::other
173 _Node** _M_buckets;
178 _Node*
182 _M_deallocate_node(_Node* __n);
185 _M_deallocate_nodes(_Node**, size_type);
187 _Node**
191 _M_deallocate_buckets(_Node**, size_type __n);
354 _Node*
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/backward/
hashtable.h 114 typedef _Hashtable_node<_Val> _Node;
122 _Node* _M_cur;
125 _Hashtable_iterator(_Node* __n, _Hashtable* __tab)
165 typedef _Hashtable_node<_Val> _Node;
174 const _Node* _M_cur;
177 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab)
291 typedef _Hashtable_node<_Val> _Node;
300 typedef typename _Alloc::template rebind<_Node>::other _Node_Alloc;
301 typedef typename _Alloc::template rebind<_Node*>::other _Nodeptr_Alloc;
302 typedef vector<_Node*, _Nodeptr_Alloc> _Vector_type
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/
forward_list.h 124 typedef _Fwd_list_node<_Tp> _Node;
141 { return *static_cast<_Node*>(this->_M_node)->_M_valptr(); }
145 { return static_cast<_Node*>(this->_M_node)->_M_valptr(); }
191 typedef const _Fwd_list_node<_Tp> _Node;
212 { return *static_cast<_Node*>(this->_M_node)->_M_valptr(); }
216 { return static_cast<_Node*>(this->_M_node)->_M_valptr(); }
310 typedef _Fwd_list_node<_Tp> _Node;
340 _Node*
345 _Node*
348 _Node* __node = this->_M_get_node()
    [all...]
stl_list.h 128 typedef _List_node<_Tp> _Node;
146 { return static_cast<_Node*>(_M_node)->_M_data; }
150 { return std::__addressof(static_cast<_Node*>(_M_node)->_M_data); }
203 typedef const _List_node<_Tp> _Node;
226 { return static_cast<_Node*>(_M_node)->_M_data; }
230 { return std::__addressof(static_cast<_Node*>(_M_node)->_M_data); }
464 // Note that pointers-to-_Node's can be ctor-converted to
466 typedef _List_node<_Tp> _Node;
481 _Node*
484 _Node* __p = this->_M_get_node()
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/
hashtable.h 163 typedef __detail::_Hash_node<_Value, __cache_hash_code> _Node;
164 typedef typename _Allocator::template rebind<_Node>::other
166 typedef typename _Allocator::template rebind<_Node*>::other
173 _Node** _M_buckets;
178 _Node*
182 _M_deallocate_node(_Node* __n);
185 _M_deallocate_nodes(_Node**, size_type);
187 _Node**
191 _M_deallocate_buckets(_Node**, size_type __n);
354 _Node*
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/backward/
hashtable.h 113 typedef _Hashtable_node<_Val> _Node;
121 _Node* _M_cur;
124 _Hashtable_iterator(_Node* __n, _Hashtable* __tab)
165 typedef _Hashtable_node<_Val> _Node;
174 const _Node* _M_cur;
177 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab)
275 typedef _Hashtable_node<_Val> _Node;
284 typedef typename _Alloc::template rebind<_Node>::other _Node_Alloc;
285 typedef typename _Alloc::template rebind<_Node*>::other _Nodeptr_Alloc;
286 typedef vector<_Node*, _Nodeptr_Alloc> _Vector_type
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/
forward_list.h 111 typedef _Fwd_list_node<_Tp, _Alloc> _Node;
128 { return __static_pointer_cast<_Node*>(_M_node)->_M_value; }
132 { return &__static_pointer_cast<_Node*>(_M_node)->_M_value; }
178 typedef const _Fwd_list_node<_Tp, _Alloc> _Node;
199 { return __static_pointer_cast<_Node*>(_M_node)->_M_value; }
203 { return &__static_pointer_cast<_Node*>(_M_node)->_M_value; }
290 typedef _Fwd_list_node<_Tp, _Tp_alloc_type> _Node;
326 typename _Node::_Pointer
331 typename _Node::_Pointer
334 typename _Node::_Pointer __node = this->_M_get_node()
    [all...]
stl_list.h 116 typedef _List_node<_Tp> _Node;
134 { return static_cast<_Node*>(_M_node)->_M_data; }
138 { return &static_cast<_Node*>(_M_node)->_M_data; }
191 typedef const _List_node<_Tp> _Node;
214 { return static_cast<_Node*>(_M_node)->_M_data; }
218 { return &static_cast<_Node*>(_M_node)->_M_data; }
442 // Note that pointers-to-_Node's can be ctor-converted to
444 typedef _List_node<_Tp> _Node;
458 _Node*
461 _Node* __p = this->_M_get_node()
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_list.h 109 typedef _List_node<_Tp> _Node;
118 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
178 typedef _List_node<_Tp> _Node;
180 typedef typename _Alloc_traits<_Node, _Alloc>::allocator_type _Node_allocator_type;
182 typedef _STLP_alloc_proxy<_Node_base, _Node, _Node_allocator_type> _AllocProxy;
188 _List_base(const allocator_type& __a) : _M_node(_STLP_CONVERT_ALLOCATOR(__a, _Node), _Node_base())
260 typedef _STLP_PRIV _List_node<_Tp> _Node;
285 _Node* __p = this->_M_node.allocate(1);
295 _Node* __p = this->_M_node.allocate(1);
521 _Node* __n = __STATIC_CAST(_Node*, __pos._M_node)
    [all...]
_slist.h 95 typedef _Slist_node<value_type> _Node;
102 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
150 typedef _Slist_node<_Tp> _Node;
151 typedef typename _Alloc_traits<_Node,_Alloc>::allocator_type _M_node_allocator_type;
155 typedef _STLP_alloc_proxy<_Slist_node_base, _Node, _M_node_allocator_type> _AllocProxy;
161 _M_head(_STLP_CONVERT_ALLOCATOR(__a, _Node), _Slist_node_base() )
174 _Node* __next = __STATIC_CAST(_Node*, __pos->_M_next);
246 typedef _STLP_PRIV _Slist_node<_Tp> _Node;
250 _Node* _M_create_node(const value_type& __x = _Tp())
    [all...]
_tree.h 235 typedef _Rb_tree_node<_Tp> _Node;
240 typedef typename _Alloc_traits<_Node, _Alloc>::allocator_type _M_node_allocator_type;
241 typedef _STLP_alloc_proxy<_Node_base, _Node, _M_node_allocator_type> _AllocProxy;
250 _M_header(_STLP_CONVERT_ALLOCATOR(__a, _Node), _Node_base() ) {
297 typedef _Rb_tree_node<_Value> _Node;
298 typedef _Node* _Link_type;
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/backward/
hashtable.h 113 typedef _Hashtable_node<_Val> _Node;
121 _Node* _M_cur;
124 _Hashtable_iterator(_Node* __n, _Hashtable* __tab)
165 typedef _Hashtable_node<_Val> _Node;
174 const _Node* _M_cur;
177 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab)
275 typedef _Hashtable_node<_Val> _Node;
284 typedef typename _Alloc::template rebind<_Node>::other _Node_Alloc;
285 typedef typename _Alloc::template rebind<_Node*>::other _Nodeptr_Alloc;
286 typedef vector<_Node*, _Nodeptr_Alloc> _Vector_type
    [all...]

Completed in 3770 milliseconds

12 3 4