Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched defs:__y (Results 1 - 25 of 33) sorted by null

1 2

/external/stlport/stlport/stl/
_tree.c	62 _Rb_tree_node_base* __y = __x->_M_right; local 63 __x->_M_right = __y->_M_left; 64 if (__y->_M_left != 0) 65 __y->_M_left->_M_parent = __x; 66 __y->_M_parent = __x->_M_parent; 69 __root = __y; 71 __x->_M_parent->_M_left = __y; 73 __x->_M_parent->_M_right = __y; 74 __y->_M_left = __x; 75 __x->_M_parent = __y; 81 _Rb_tree_node_base* __y = __x->_M_left; local 103 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_right; local 121 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_left; local 147 _Rb_tree_node_base* __y = __z; local 285 _Base_ptr __y = _M_node->_M_parent; local 301 _Base_ptr __y = _M_node->_M_parent; local 388 _Base_ptr __y = &this->_M_header._M_data; local 406 _Base_ptr __y = &this->_M_header._M_data; local 637 _Base_ptr __y = _M_clone_node(__x); local 659 _Base_ptr __y = _S_left(__x); local     [all...]
_tree.h	549 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); // Last node which is not less than __k. local 554 __y = __x, __x = _S_left(__x); 558 if (__y != &this->_M_header._M_data) { 559 if (_M_key_compare(__k, _S_key(__y))) { 560 __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); 563 return __y; 568 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is not less than __k. */ local 573 __y = __x, __x = _S_left(__x); 577 return __y; 582 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is greater than __k. * local     [all...]
concept_checks.h	143 __ret (*__y)( const __first&, const __second& ) = \ 146 __y = __y; __x = __x; } while (0) 250 _TypeY __y = __x; local 251 __sink_unused_warning(__y);
/ndk/sources/cxx-stl/stlport/stlport/stl/
_tree.c	62 _Rb_tree_node_base* __y = __x->_M_right; local 63 __x->_M_right = __y->_M_left; 64 if (__y->_M_left != 0) 65 __y->_M_left->_M_parent = __x; 66 __y->_M_parent = __x->_M_parent; 69 __root = __y; 71 __x->_M_parent->_M_left = __y; 73 __x->_M_parent->_M_right = __y; 74 __y->_M_left = __x; 75 __x->_M_parent = __y; 81 _Rb_tree_node_base* __y = __x->_M_left; local 103 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_right; local 121 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_left; local 147 _Rb_tree_node_base* __y = __z; local 285 _Base_ptr __y = _M_node->_M_parent; local 301 _Base_ptr __y = _M_node->_M_parent; local 388 _Base_ptr __y = &this->_M_header._M_data; local 406 _Base_ptr __y = &this->_M_header._M_data; local 637 _Base_ptr __y = _M_clone_node(__x); local 659 _Base_ptr __y = _S_left(__x); local     [all...]
_tree.h	549 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); // Last node which is not less than __k. local 554 __y = __x, __x = _S_left(__x); 558 if (__y != &this->_M_header._M_data) { 559 if (_M_key_compare(__k, _S_key(__y))) { 560 __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); 563 return __y; 568 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is not less than __k. */ local 573 __y = __x, __x = _S_left(__x); 577 return __y; 582 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is greater than __k. * local     [all...]
concept_checks.h	143 __ret (*__y)( const __first&, const __second& ) = \ 146 __y = __y; __x = __x; } while (0) 250 _TypeY __y = __x; local 251 __sink_unused_warning(__y);
/prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_tree.c	62 _Rb_tree_node_base* __y = __x->_M_right; local 63 __x->_M_right = __y->_M_left; 64 if (__y->_M_left != 0) 65 __y->_M_left->_M_parent = __x; 66 __y->_M_parent = __x->_M_parent; 69 __root = __y; 71 __x->_M_parent->_M_left = __y; 73 __x->_M_parent->_M_right = __y; 74 __y->_M_left = __x; 75 __x->_M_parent = __y; 81 _Rb_tree_node_base* __y = __x->_M_left; local 103 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_right; local 121 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_left; local 147 _Rb_tree_node_base* __y = __z; local 285 _Base_ptr __y = _M_node->_M_parent; local 301 _Base_ptr __y = _M_node->_M_parent; local 388 _Base_ptr __y = &this->_M_header._M_data; local 406 _Base_ptr __y = &this->_M_header._M_data; local 637 _Base_ptr __y = _M_clone_node(__x); local 659 _Base_ptr __y = _S_left(__x); local     [all...]
_tree.h	549 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); // Last node which is not less than __k. local 554 __y = __x, __x = _S_left(__x); 558 if (__y != &this->_M_header._M_data) { 559 if (_M_key_compare(__k, _S_key(__y))) { 560 __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); 563 return __y; 568 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is not less than __k. */ local 573 __y = __x, __x = _S_left(__x); 577 return __y; 582 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is greater than __k. * local     [all...]
concept_checks.h	143 __ret (*__y)( const __first&, const __second& ) = \ 146 __y = __y; __x = __x; } while (0) 250 _TypeY __y = __x; local 251 __sink_unused_warning(__y);
/prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_tree.c	62 _Rb_tree_node_base* __y = __x->_M_right; local 63 __x->_M_right = __y->_M_left; 64 if (__y->_M_left != 0) 65 __y->_M_left->_M_parent = __x; 66 __y->_M_parent = __x->_M_parent; 69 __root = __y; 71 __x->_M_parent->_M_left = __y; 73 __x->_M_parent->_M_right = __y; 74 __y->_M_left = __x; 75 __x->_M_parent = __y; 81 _Rb_tree_node_base* __y = __x->_M_left; local 103 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_right; local 121 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_left; local 147 _Rb_tree_node_base* __y = __z; local 285 _Base_ptr __y = _M_node->_M_parent; local 301 _Base_ptr __y = _M_node->_M_parent; local 388 _Base_ptr __y = &this->_M_header._M_data; local 406 _Base_ptr __y = &this->_M_header._M_data; local 637 _Base_ptr __y = _M_clone_node(__x); local 659 _Base_ptr __y = _S_left(__x); local     [all...]
_tree.h	549 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); // Last node which is not less than __k. local 554 __y = __x, __x = _S_left(__x); 558 if (__y != &this->_M_header._M_data) { 559 if (_M_key_compare(__k, _S_key(__y))) { 560 __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); 563 return __y; 568 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is not less than __k. */ local 573 __y = __x, __x = _S_left(__x); 577 return __y; 582 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is greater than __k. * local     [all...]
concept_checks.h	143 __ret (*__y)( const __first&, const __second& ) = \ 146 __y = __y; __x = __x; } while (0) 250 _TypeY __y = __x; local 251 __sink_unused_warning(__y);
/prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/
_tree.c	62 _Rb_tree_node_base* __y = __x->_M_right; local 63 __x->_M_right = __y->_M_left; 64 if (__y->_M_left != 0) 65 __y->_M_left->_M_parent = __x; 66 __y->_M_parent = __x->_M_parent; 69 __root = __y; 71 __x->_M_parent->_M_left = __y; 73 __x->_M_parent->_M_right = __y; 74 __y->_M_left = __x; 75 __x->_M_parent = __y; 81 _Rb_tree_node_base* __y = __x->_M_left; local 103 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_right; local 121 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_left; local 147 _Rb_tree_node_base* __y = __z; local 285 _Base_ptr __y = _M_node->_M_parent; local 301 _Base_ptr __y = _M_node->_M_parent; local 388 _Base_ptr __y = &this->_M_header._M_data; local 406 _Base_ptr __y = &this->_M_header._M_data; local 637 _Base_ptr __y = _M_clone_node(__x); local 659 _Base_ptr __y = _S_left(__x); local     [all...]
_tree.h	549 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); // Last node which is not less than __k. local 554 __y = __x, __x = _S_left(__x); 558 if (__y != &this->_M_header._M_data) { 559 if (_M_key_compare(__k, _S_key(__y))) { 560 __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); 563 return __y; 568 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is not less than __k. */ local 573 __y = __x, __x = _S_left(__x); 577 return __y; 582 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is greater than __k. * local     [all...]
concept_checks.h	143 __ret (*__y)( const __first&, const __second& ) = \ 146 __y = __y; __x = __x; } while (0) 250 _TypeY __y = __x; local 251 __sink_unused_warning(__y);
/prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/
_tree.c	62 _Rb_tree_node_base* __y = __x->_M_right; local 63 __x->_M_right = __y->_M_left; 64 if (__y->_M_left != 0) 65 __y->_M_left->_M_parent = __x; 66 __y->_M_parent = __x->_M_parent; 69 __root = __y; 71 __x->_M_parent->_M_left = __y; 73 __x->_M_parent->_M_right = __y; 74 __y->_M_left = __x; 75 __x->_M_parent = __y; 81 _Rb_tree_node_base* __y = __x->_M_left; local 103 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_right; local 121 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_left; local 147 _Rb_tree_node_base* __y = __z; local 285 _Base_ptr __y = _M_node->_M_parent; local 301 _Base_ptr __y = _M_node->_M_parent; local 388 _Base_ptr __y = &this->_M_header._M_data; local 406 _Base_ptr __y = &this->_M_header._M_data; local 637 _Base_ptr __y = _M_clone_node(__x); local 659 _Base_ptr __y = _S_left(__x); local     [all...]
_tree.h	549 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); // Last node which is not less than __k. local 554 __y = __x, __x = _S_left(__x); 558 if (__y != &this->_M_header._M_data) { 559 if (_M_key_compare(__k, _S_key(__y))) { 560 __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); 563 return __y; 568 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is not less than __k. */ local 573 __y = __x, __x = _S_left(__x); 577 return __y; 582 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is greater than __k. * local     [all...]
concept_checks.h	143 __ret (*__y)( const __first&, const __second& ) = \ 146 __y = __y; __x = __x; } while (0) 250 _TypeY __y = __x; local 251 __sink_unused_warning(__y);
/prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/
_tree.c	62 _Rb_tree_node_base* __y = __x->_M_right; local 63 __x->_M_right = __y->_M_left; 64 if (__y->_M_left != 0) 65 __y->_M_left->_M_parent = __x; 66 __y->_M_parent = __x->_M_parent; 69 __root = __y; 71 __x->_M_parent->_M_left = __y; 73 __x->_M_parent->_M_right = __y; 74 __y->_M_left = __x; 75 __x->_M_parent = __y; 81 _Rb_tree_node_base* __y = __x->_M_left; local 103 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_right; local 121 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_left; local 147 _Rb_tree_node_base* __y = __z; local 285 _Base_ptr __y = _M_node->_M_parent; local 301 _Base_ptr __y = _M_node->_M_parent; local 388 _Base_ptr __y = &this->_M_header._M_data; local 406 _Base_ptr __y = &this->_M_header._M_data; local 637 _Base_ptr __y = _M_clone_node(__x); local 659 _Base_ptr __y = _S_left(__x); local     [all...]
_tree.h	549 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); // Last node which is not less than __k. local 554 __y = __x, __x = _S_left(__x); 558 if (__y != &this->_M_header._M_data) { 559 if (_M_key_compare(__k, _S_key(__y))) { 560 __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); 563 return __y; 568 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is not less than __k. */ local 573 __y = __x, __x = _S_left(__x); 577 return __y; 582 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is greater than __k. * local     [all...]
concept_checks.h	143 __ret (*__y)( const __first&, const __second& ) = \ 146 __y = __y; __x = __x; } while (0) 250 _TypeY __y = __x; local 251 __sink_unused_warning(__y);
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_tree.h	310 const _Rb_tree_const_iterator<_Val>& __y) 311 { return __x._M_node == __y._M_node; } 316 const _Rb_tree_const_iterator<_Val>& __y) 317 { return __x._M_node != __y._M_node; } 576 _M_insert_(_Const_Base_ptr __x, _Const_Base_ptr __y, _Arg&& __v); 580 _M_insert_lower(_Base_ptr __x, _Base_ptr __y, _Arg&& __v); 587 _M_insert_(_Const_Base_ptr __x, _Const_Base_ptr __y, 593 _M_insert_lower(_Base_ptr __x, _Base_ptr __y, const value_type& __v); 606 _M_lower_bound(_Link_type __x, _Link_type __y, 610 _M_lower_bound(_Const_Link_type __x, _Const_Link_type __y, 1027 _Link_type __y = _M_end(); local 1056 _Link_type __y = _M_clone_node(__x); local 1083 _Link_type __y = _S_left(__x); local 1163 _Link_type __y = _M_end(); local 1194 _Const_Link_type __y = _M_end(); local 1280 _Link_type __y = _M_end(); local 1317 _Link_type __y = _M_end(); local 1494 _Link_type __y = local     [all...]
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_tree.h	310 const _Rb_tree_const_iterator<_Val>& __y) 311 { return __x._M_node == __y._M_node; } 316 const _Rb_tree_const_iterator<_Val>& __y) 317 { return __x._M_node != __y._M_node; } 576 _M_insert_(_Const_Base_ptr __x, _Const_Base_ptr __y, _Arg&& __v); 580 _M_insert_lower(_Base_ptr __x, _Base_ptr __y, _Arg&& __v); 587 _M_insert_(_Const_Base_ptr __x, _Const_Base_ptr __y, 593 _M_insert_lower(_Base_ptr __x, _Base_ptr __y, const value_type& __v); 606 _M_lower_bound(_Link_type __x, _Link_type __y, 610 _M_lower_bound(_Const_Link_type __x, _Const_Link_type __y, 1027 _Link_type __y = _M_end(); local 1056 _Link_type __y = _M_clone_node(__x); local 1083 _Link_type __y = _S_left(__x); local 1163 _Link_type __y = _M_end(); local 1194 _Const_Link_type __y = _M_end(); local 1280 _Link_type __y = _M_end(); local 1317 _Link_type __y = _M_end(); local 1494 _Link_type __y = local     [all...]
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/
stl_tree.h	300 const _Rb_tree_const_iterator<_Val>& __y) 301 { return __x._M_node == __y._M_node; } 306 const _Rb_tree_const_iterator<_Val>& __y) 307 { return __x._M_node != __y._M_node; } 469 static bool _M_compare_with(_KeyCompareT& __comp, const _Key& __x, const _Key& __y) { 472 if (__comp(__y, __y)) 473 __throw_runtime_error("strict weak ordering: (__y LT __y) != false"); 474 bool lt = __comp(__x, __y); 955 _Link_type __y = _M_end(); local 984 _Link_type __y = _M_clone_node(__x); local 1011 _Link_type __y = _S_left(__x); local 1091 _Link_type __y = _M_end(); local 1122 _Const_Link_type __y = _M_end(); local 1205 _Link_type __y = _M_end(); local 1233 _Link_type __y = _M_end(); local 1384 _Link_type __y = local 1398 _Link_type __y = local     [all...]
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/
stl_tree.h	310 const _Rb_tree_const_iterator<_Val>& __y) 311 { return __x._M_node == __y._M_node; } 316 const _Rb_tree_const_iterator<_Val>& __y) 317 { return __x._M_node != __y._M_node; } 480 static bool _M_compare_with(_KeyCompareT& __comp, const _Key& __x, const _Key& __y) { 483 if (__comp(__y, __y)) 484 __throw_runtime_error("strict weak ordering: (__y LT __y) != false"); 485 bool lt = __comp(__x, __y); 1059 _Link_type __y = _M_end(); local 1088 _Link_type __y = _M_clone_node(__x); local 1115 _Link_type __y = _S_left(__x); local 1195 _Link_type __y = _M_end(); local 1226 _Const_Link_type __y = _M_end(); local 1312 _Link_type __y = _M_end(); local 1349 _Link_type __y = _M_end(); local 1526 _Link_type __y = local     [all...]

Completed in 659 milliseconds

1 2