HomeSort by relevance Sort by last modified time
    Searched refs:_M_leftmost (Results 1 - 5 of 5) sorted by null

  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/
stl_tree.h 493 _M_leftmost()
497 _M_leftmost() const
631 _M_leftmost() = _S_minimum(_M_root());
755 _M_leftmost() = _M_end();
863 _M_leftmost() = __x._M_leftmost();
868 __x._M_leftmost() = __x._M_end();
891 _M_leftmost() = _S_minimum(_M_root());
    [all...]
  /external/stlport/stlport/stl/
_tree.h 337 _Base_ptr _M_leftmost() const
344 _Base_ptr& _M_leftmost()
400 _M_leftmost() = _S_minimum(_M_root());
421 iterator begin() { return iterator(_M_leftmost()); }
422 const_iterator begin() const { return const_iterator(_M_leftmost()); }
533 _M_leftmost() = &this->_M_header._M_data;
_tree.c 330 _M_leftmost() = &this->_M_header._M_data;
335 _M_leftmost() = _S_minimum(_M_root());
360 _S_left(__parent) = __new_node; // also makes _M_leftmost() = __new_node
369 if (__parent == _M_leftmost())
370 _M_leftmost() = __new_node; // maintain _M_leftmost() pointing to min node
689 int __len = __black_count(_M_leftmost(), _M_root());
709 if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_tree.h 337 _Base_ptr _M_leftmost() const
344 _Base_ptr& _M_leftmost()
400 _M_leftmost() = _S_minimum(_M_root());
421 iterator begin() { return iterator(_M_leftmost()); }
422 const_iterator begin() const { return const_iterator(_M_leftmost()); }
533 _M_leftmost() = &this->_M_header._M_data;
_tree.c 330 _M_leftmost() = &this->_M_header._M_data;
335 _M_leftmost() = _S_minimum(_M_root());
360 _S_left(__parent) = __new_node; // also makes _M_leftmost() = __new_node
369 if (__parent == _M_leftmost())
370 _M_leftmost() = __new_node; // maintain _M_leftmost() pointing to min node
689 int __len = __black_count(_M_leftmost(), _M_root());
709 if (_M_leftmost() != _Rb_tree_node_base::_S_minimum(_M_root()))

Completed in 269 milliseconds