Searched refs:__z (Results 1 - 4 of 4) sorted by relevance

/macosx-10.9.5/libstdcxx-60/src/
H A Dtree.cc257 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z, argument
263 _Rb_tree_node_base* __y = __z;
267 if (__y->_M_left == 0) // __z has at most one non-null child. y == z.
270 if (__y->_M_right == 0) // __z has exactly one non-null child. y == z.
274 // __z has two non-null children. Set __y to
275 __y = __y->_M_right; // __z's successor. __x might be null.
280 if (__y != __z)
283 __z->_M_left->_M_parent = __y;
284 __y->_M_left = __z->_M_left;
285 if (__y != __z
[all...]
H A Dvalarray-inst.cc83 const size_t __z = __i.size(); local
85 for (size_t __j = 0; __j < __z; ++__j)
/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/bits/
H A Dstl_tree.h325 _Rb_tree_rebalance_for_erase(_Rb_tree_node_base* const __z,
840 _Link_type __z = _M_create_node(__v); local
842 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
845 return iterator(__z);
858 _Link_type __z = _M_create_node(__v); local
860 _Rb_tree_insert_and_rebalance(__insert_left, __z, __p,
863 return iterator(__z);
876 _Link_type __z = _M_create_node(__v); local
878 _Rb_tree_insert_and_rebalance(__insert_left, __z,
882 return const_iterator(__z);
[all...]
/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/tr1/
H A Dhashtable_policy.h492 _Prime_rehash_policy(float __z = 1.0);
520 _Prime_rehash_policy(float __z) argument
521 : _M_max_load_factor(__z), _M_growth_factor(2.f), _M_next_resize(0)
669 max_load_factor(float __z) argument
672 __this->__rehash_policy(_Prime_rehash_policy(__z));

Completed in 124 milliseconds