Searched defs:__node (Results 1 - 25 of 52) sorted by relevance

123

/prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/
H A D_slist_base.c40 const _Slist_node_base* __node) {
41 while (__head && __head->_M_next != __node)
74 _Sl_global<_Dummy>::__reverse(_Slist_node_base* __node) { argument
75 _Slist_node_base* __result = __node;
76 __node = __node->_M_next;
78 while(__node) {
79 _Slist_node_base* __next = __node->_M_next;
80 __node->_M_next = __result;
81 __result = __node;
39 __previous(_Slist_node_base* __head, const _Slist_node_base* __node) argument
89 size(_Slist_node_base* __node) argument
[all...]
H A D_slist_base.h56 static size_t _STLP_CALL size(_Slist_node_base* __node);
57 static _Slist_node_base* _STLP_CALL __reverse(_Slist_node_base* __node);
65 const _Slist_node_base* __node);
67 const _Slist_node_base* __node) {
68 return _Sl_global<_Dummy>::__previous(__CONST_CAST(_Slist_node_base*, __head), __node);
66 __previous(const _Slist_node_base* __head, const _Slist_node_base* __node) argument
H A D_slist.c93 _Node_base* __node = this->_M_head._M_data._M_next; local
94 for ( ; __node != 0 && __n > 0 ; --__n) {
95 __STATIC_CAST(_Node*, __node)->_M_data = __val;
96 __prev = __node;
97 __node = __node->_M_next;
H A D_tree.c668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) { argument
669 if (__node == 0)
672 int __bc = __node->_M_color == _S_rb_tree_black ? 1 : 0;
673 if (__node == __root)
676 return __bc + __black_count(__node->_M_parent, __root);
/prebuilts/ndk/r10/sources/cxx-stl/stlport/stlport/stl/
H A D_slist_base.c40 const _Slist_node_base* __node) {
41 while (__head && __head->_M_next != __node)
74 _Sl_global<_Dummy>::__reverse(_Slist_node_base* __node) { argument
75 _Slist_node_base* __result = __node;
76 __node = __node->_M_next;
78 while(__node) {
79 _Slist_node_base* __next = __node->_M_next;
80 __node->_M_next = __result;
81 __result = __node;
39 __previous(_Slist_node_base* __head, const _Slist_node_base* __node) argument
89 size(_Slist_node_base* __node) argument
[all...]
H A D_slist_base.h56 static size_t _STLP_CALL size(_Slist_node_base* __node);
57 static _Slist_node_base* _STLP_CALL __reverse(_Slist_node_base* __node);
65 const _Slist_node_base* __node);
67 const _Slist_node_base* __node) {
68 return _Sl_global<_Dummy>::__previous(__CONST_CAST(_Slist_node_base*, __head), __node);
66 __previous(const _Slist_node_base* __head, const _Slist_node_base* __node) argument
H A D_slist.c93 _Node_base* __node = this->_M_head._M_data._M_next; local
94 for ( ; __node != 0 && __n > 0 ; --__n) {
95 __STATIC_CAST(_Node*, __node)->_M_data = __val;
96 __prev = __node;
97 __node = __node->_M_next;
H A D_tree.c668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) { argument
669 if (__node == 0)
672 int __bc = __node->_M_color == _S_rb_tree_black ? 1 : 0;
673 if (__node == __root)
676 return __bc + __black_count(__node->_M_parent, __root);
/prebuilts/ndk/r11/sources/cxx-stl/stlport/stlport/stl/
H A D_slist_base.c40 const _Slist_node_base* __node) {
41 while (__head && __head->_M_next != __node)
74 _Sl_global<_Dummy>::__reverse(_Slist_node_base* __node) { argument
75 _Slist_node_base* __result = __node;
76 __node = __node->_M_next;
78 while(__node) {
79 _Slist_node_base* __next = __node->_M_next;
80 __node->_M_next = __result;
81 __result = __node;
39 __previous(_Slist_node_base* __head, const _Slist_node_base* __node) argument
89 size(_Slist_node_base* __node) argument
[all...]
H A D_slist_base.h56 static size_t _STLP_CALL size(_Slist_node_base* __node);
57 static _Slist_node_base* _STLP_CALL __reverse(_Slist_node_base* __node);
65 const _Slist_node_base* __node);
67 const _Slist_node_base* __node) {
68 return _Sl_global<_Dummy>::__previous(__CONST_CAST(_Slist_node_base*, __head), __node);
66 __previous(const _Slist_node_base* __head, const _Slist_node_base* __node) argument
H A D_slist.c93 _Node_base* __node = this->_M_head._M_data._M_next; local
94 for ( ; __node != 0 && __n > 0 ; --__n) {
95 __STATIC_CAST(_Node*, __node)->_M_data = __val;
96 __prev = __node;
97 __node = __node->_M_next;
H A D_tree.c668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) { argument
669 if (__node == 0)
672 int __bc = __node->_M_color == _S_rb_tree_black ? 1 : 0;
673 if (__node == __root)
676 return __bc + __black_count(__node->_M_parent, __root);
/prebuilts/ndk/r13/sources/cxx-stl/stlport/stlport/stl/
H A D_slist_base.c40 const _Slist_node_base* __node) {
41 while (__head && __head->_M_next != __node)
74 _Sl_global<_Dummy>::__reverse(_Slist_node_base* __node) { argument
75 _Slist_node_base* __result = __node;
76 __node = __node->_M_next;
78 while(__node) {
79 _Slist_node_base* __next = __node->_M_next;
80 __node->_M_next = __result;
81 __result = __node;
39 __previous(_Slist_node_base* __head, const _Slist_node_base* __node) argument
89 size(_Slist_node_base* __node) argument
[all...]
H A D_slist_base.h56 static size_t _STLP_CALL size(_Slist_node_base* __node);
57 static _Slist_node_base* _STLP_CALL __reverse(_Slist_node_base* __node);
65 const _Slist_node_base* __node);
67 const _Slist_node_base* __node) {
68 return _Sl_global<_Dummy>::__previous(__CONST_CAST(_Slist_node_base*, __head), __node);
66 __previous(const _Slist_node_base* __head, const _Slist_node_base* __node) argument
H A D_slist.c93 _Node_base* __node = this->_M_head._M_data._M_next; local
94 for ( ; __node != 0 && __n > 0 ; --__n) {
95 __STATIC_CAST(_Node*, __node)->_M_data = __val;
96 __prev = __node;
97 __node = __node->_M_next;
H A D_tree.c668 __black_count(_Rb_tree_node_base* __node, _Rb_tree_node_base* __root) { argument
669 if (__node == 0)
672 int __bc = __node->_M_color == _S_rb_tree_black ? 1 : 0;
673 if (__node == __root)
676 return __bc + __black_count(__node->_M_parent, __root);
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/profile/
H A Dunordered_base.h44 const __detail::_Hash_node<_Value, true>* __node)
45 { return __node->_M_hash_code % __uc.bucket_count(); }
53 const __detail::_Hash_node<_Value, false>* __node)
54 { return __uc.bucket(__node->_M_v); }
65 const __detail::_Hash_node<_Value, false>* __node)
66 { return __uc.bucket(__node->_M_v.first); }
72 const __detail::_Hash_node<_Value, _Cache_hash_code>* __node)
76 return __bucket_index_helper::bucket(__uc, __node);
43 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, true>* __node) argument
52 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument
64 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument
71 __get_bucket_index(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, _Cache_hash_code>* __node) argument
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/profile/
H A Dunordered_base.h44 const __detail::_Hash_node<_Value, true>* __node)
45 { return __node->_M_hash_code % __uc.bucket_count(); }
53 const __detail::_Hash_node<_Value, false>* __node)
54 { return __uc.bucket(__node->_M_v); }
65 const __detail::_Hash_node<_Value, false>* __node)
66 { return __uc.bucket(__node->_M_v.first); }
72 const __detail::_Hash_node<_Value, _Cache_hash_code>* __node)
76 return __bucket_index_helper::bucket(__uc, __node);
43 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, true>* __node) argument
52 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument
64 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument
71 __get_bucket_index(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, _Cache_hash_code>* __node) argument
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/c++/4.8.3/profile/
H A Dunordered_base.h44 const __detail::_Hash_node<_Value, true>* __node)
45 { return __node->_M_hash_code % __uc.bucket_count(); }
53 const __detail::_Hash_node<_Value, false>* __node)
54 { return __uc.bucket(__node->_M_v); }
65 const __detail::_Hash_node<_Value, false>* __node)
66 { return __uc.bucket(__node->_M_v.first); }
72 const __detail::_Hash_node<_Value, _Cache_hash_code>* __node)
76 return __bucket_index_helper::bucket(__uc, __node);
43 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, true>* __node) argument
52 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument
64 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument
71 __get_bucket_index(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, _Cache_hash_code>* __node) argument
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/profile/
H A Dunordered_base.h44 const __detail::_Hash_node<_Value, true>* __node)
45 { return __node->_M_hash_code % __uc.bucket_count(); }
53 const __detail::_Hash_node<_Value, false>* __node)
54 { return __uc.bucket(__node->_M_v); }
65 const __detail::_Hash_node<_Value, false>* __node)
66 { return __uc.bucket(__node->_M_v.first); }
72 const __detail::_Hash_node<_Value, _Cache_hash_code>* __node)
76 return __bucket_index_helper::bucket(__uc, __node);
43 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, true>* __node) argument
52 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument
64 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument
71 __get_bucket_index(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, _Cache_hash_code>* __node) argument
/prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/
H A Dunordered_base.h44 const __detail::_Hash_node<_Value, true>* __node)
45 { return __node->_M_hash_code % __uc.bucket_count(); }
53 const __detail::_Hash_node<_Value, false>* __node)
54 { return __uc.bucket(__node->_M_v()); }
65 const __detail::_Hash_node<_Value, false>* __node)
66 { return __uc.bucket(__node->_M_v().first); }
72 const __detail::_Hash_node<_Value, _Cache_hash_code>* __node)
76 return __bucket_index_helper::bucket(__uc, __node);
43 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, true>* __node) argument
52 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument
64 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument
71 __get_bucket_index(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, _Cache_hash_code>* __node) argument
/prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/
H A Dunordered_base.h44 const __detail::_Hash_node<_Value, true>* __node)
45 { return __node->_M_hash_code % __uc.bucket_count(); }
53 const __detail::_Hash_node<_Value, false>* __node)
54 { return __uc.bucket(__node->_M_v()); }
65 const __detail::_Hash_node<_Value, false>* __node)
66 { return __uc.bucket(__node->_M_v().first); }
72 const __detail::_Hash_node<_Value, _Cache_hash_code>* __node)
76 return __bucket_index_helper::bucket(__uc, __node);
43 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, true>* __node) argument
52 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument
64 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument
71 __get_bucket_index(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, _Cache_hash_code>* __node) argument
/prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/
H A Dunordered_base.h44 const __detail::_Hash_node<_Value, true>* __node)
45 { return __node->_M_hash_code % __uc.bucket_count(); }
53 const __detail::_Hash_node<_Value, false>* __node)
54 { return __uc.bucket(__node->_M_v()); }
65 const __detail::_Hash_node<_Value, false>* __node)
66 { return __uc.bucket(__node->_M_v().first); }
72 const __detail::_Hash_node<_Value, _Cache_hash_code>* __node)
76 return __bucket_index_helper::bucket(__uc, __node);
43 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, true>* __node) argument
52 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument
64 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument
71 __get_bucket_index(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, _Cache_hash_code>* __node) argument
/prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/profile/
H A Dunordered_base.h44 const __detail::_Hash_node<_Value, true>* __node)
45 { return __node->_M_hash_code % __uc.bucket_count(); }
53 const __detail::_Hash_node<_Value, false>* __node)
54 { return __uc.bucket(__node->_M_v()); }
65 const __detail::_Hash_node<_Value, false>* __node)
66 { return __uc.bucket(__node->_M_v().first); }
72 const __detail::_Hash_node<_Value, _Cache_hash_code>* __node)
76 return __bucket_index_helper::bucket(__uc, __node);
43 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, true>* __node) argument
52 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument
64 bucket(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, false>* __node) argument
71 __get_bucket_index(const _UnorderedCont& __uc, const __detail::_Hash_node<_Value, _Cache_hash_code>* __node) argument
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/
H A Dforward_list.h348 _Node* __node = this->_M_get_node(); local
353 ::new ((void*)__node) _Node();
354 _Alloc_traits::construct(__a, __node->_M_valptr(),
359 this->_M_put_node(__node);
362 return __node;

Completed in 400 milliseconds

123