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

  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/
stl_tree.h 513 _M_rightmost()
517 _M_rightmost() const
644 _M_rightmost() = _S_maximum(_M_root());
769 _M_rightmost() = _M_end();
876 _M_rightmost() = __x._M_rightmost();
881 __x._M_rightmost() = __x._M_end();
904 _M_rightmost() = _S_maximum(_M_root());
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/
stl_tree.h 524 _M_rightmost()
528 _M_rightmost() const
669 _M_rightmost() = _S_maximum(_M_root());
852 _M_rightmost() = _M_end();
959 _M_rightmost() = __x._M_rightmost();
964 __x._M_rightmost() = __x._M_end();
987 _M_rightmost() = _S_maximum(_M_root());
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/
stl_tree.h 524 _M_rightmost()
528 _M_rightmost() const
669 _M_rightmost() = _S_maximum(_M_root());
852 _M_rightmost() = _M_end();
959 _M_rightmost() = __x._M_rightmost();
964 __x._M_rightmost() = __x._M_end();
987 _M_rightmost() = _S_maximum(_M_root());
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_tree.h 513 _M_rightmost()
517 _M_rightmost() const
644 _M_rightmost() = _S_maximum(_M_root());
769 _M_rightmost() = _M_end();
876 _M_rightmost() = __x._M_rightmost();
881 __x._M_rightmost() = __x._M_end();
904 _M_rightmost() = _S_maximum(_M_root());
    [all...]
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_tree.h 513 _M_rightmost()
517 _M_rightmost() const
644 _M_rightmost() = _S_maximum(_M_root());
769 _M_rightmost() = _M_end();
876 _M_rightmost() = __x._M_rightmost();
881 __x._M_rightmost() = __x._M_end();
904 _M_rightmost() = _S_maximum(_M_root());
    [all...]
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_tree.h 513 _M_rightmost()
517 _M_rightmost() const
644 _M_rightmost() = _S_maximum(_M_root());
769 _M_rightmost() = _M_end();
876 _M_rightmost() = __x._M_rightmost();
881 __x._M_rightmost() = __x._M_end();
904 _M_rightmost() = _S_maximum(_M_root());
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_tree.h 513 _M_rightmost()
517 _M_rightmost() const
644 _M_rightmost() = _S_maximum(_M_root());
769 _M_rightmost() = _M_end();
876 _M_rightmost() = __x._M_rightmost();
881 __x._M_rightmost() = __x._M_end();
904 _M_rightmost() = _S_maximum(_M_root());
    [all...]
  /external/stlport/stlport/stl/
_tree.c 331 _M_rightmost() = &this->_M_header._M_data;
336 _M_rightmost() = _S_maximum(_M_root());
362 _M_rightmost() = __new_node;
375 if (__parent == _M_rightmost())
376 _M_rightmost() = __new_node; // maintain _M_rightmost() pointing to max node
480 if (_M_key_compare(_S_key(_M_rightmost()), _KeyOfValue()(__val))) {
483 return _M_insert(_M_rightmost(), __val, 0, __position._M_node); // Last argument only needs to be non-null
578 if (!_M_key_compare(_KeyOfValue()(__val), _S_key(_M_rightmost())))
579 return _M_insert(_M_rightmost(), __val, 0, __position._M_node); // Last argument only needs to be non-nul
    [all...]
_tree.h 339 _Base_ptr _M_rightmost() const
346 _Base_ptr& _M_rightmost()
401 _M_rightmost() = _S_maximum(_M_root());
535 _M_rightmost() = &this->_M_header._M_data;
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_tree.c 331 _M_rightmost() = &this->_M_header._M_data;
336 _M_rightmost() = _S_maximum(_M_root());
362 _M_rightmost() = __new_node;
375 if (__parent == _M_rightmost())
376 _M_rightmost() = __new_node; // maintain _M_rightmost() pointing to max node
480 if (_M_key_compare(_S_key(_M_rightmost()), _KeyOfValue()(__val))) {
483 return _M_insert(_M_rightmost(), __val, 0, __position._M_node); // Last argument only needs to be non-null
578 if (!_M_key_compare(_KeyOfValue()(__val), _S_key(_M_rightmost())))
579 return _M_insert(_M_rightmost(), __val, 0, __position._M_node); // Last argument only needs to be non-nul
    [all...]
_tree.h 339 _Base_ptr _M_rightmost() const
346 _Base_ptr& _M_rightmost()
401 _M_rightmost() = _S_maximum(_M_root());
535 _M_rightmost() = &this->_M_header._M_data;
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_tree.c 331 _M_rightmost() = &this->_M_header._M_data;
336 _M_rightmost() = _S_maximum(_M_root());
362 _M_rightmost() = __new_node;
375 if (__parent == _M_rightmost())
376 _M_rightmost() = __new_node; // maintain _M_rightmost() pointing to max node
480 if (_M_key_compare(_S_key(_M_rightmost()), _KeyOfValue()(__val))) {
483 return _M_insert(_M_rightmost(), __val, 0, __position._M_node); // Last argument only needs to be non-null
578 if (!_M_key_compare(_KeyOfValue()(__val), _S_key(_M_rightmost())))
579 return _M_insert(_M_rightmost(), __val, 0, __position._M_node); // Last argument only needs to be non-nul
    [all...]
_tree.h 339 _Base_ptr _M_rightmost() const
346 _Base_ptr& _M_rightmost()
401 _M_rightmost() = _S_maximum(_M_root());
535 _M_rightmost() = &this->_M_header._M_data;
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_tree.c 331 _M_rightmost() = &this->_M_header._M_data;
336 _M_rightmost() = _S_maximum(_M_root());
362 _M_rightmost() = __new_node;
375 if (__parent == _M_rightmost())
376 _M_rightmost() = __new_node; // maintain _M_rightmost() pointing to max node
480 if (_M_key_compare(_S_key(_M_rightmost()), _KeyOfValue()(__val))) {
483 return _M_insert(_M_rightmost(), __val, 0, __position._M_node); // Last argument only needs to be non-null
578 if (!_M_key_compare(_KeyOfValue()(__val), _S_key(_M_rightmost())))
579 return _M_insert(_M_rightmost(), __val, 0, __position._M_node); // Last argument only needs to be non-nul
    [all...]
_tree.h 339 _Base_ptr _M_rightmost() const
346 _Base_ptr& _M_rightmost()
401 _M_rightmost() = _S_maximum(_M_root());
535 _M_rightmost() = &this->_M_header._M_data;
  /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/
_tree.c 331 _M_rightmost() = &this->_M_header._M_data;
336 _M_rightmost() = _S_maximum(_M_root());
362 _M_rightmost() = __new_node;
375 if (__parent == _M_rightmost())
376 _M_rightmost() = __new_node; // maintain _M_rightmost() pointing to max node
480 if (_M_key_compare(_S_key(_M_rightmost()), _KeyOfValue()(__val))) {
483 return _M_insert(_M_rightmost(), __val, 0, __position._M_node); // Last argument only needs to be non-null
578 if (!_M_key_compare(_KeyOfValue()(__val), _S_key(_M_rightmost())))
579 return _M_insert(_M_rightmost(), __val, 0, __position._M_node); // Last argument only needs to be non-nul
    [all...]
_tree.h 339 _Base_ptr _M_rightmost() const
346 _Base_ptr& _M_rightmost()
401 _M_rightmost() = _S_maximum(_M_root());
535 _M_rightmost() = &this->_M_header._M_data;
  /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/
_tree.c 331 _M_rightmost() = &this->_M_header._M_data;
336 _M_rightmost() = _S_maximum(_M_root());
362 _M_rightmost() = __new_node;
375 if (__parent == _M_rightmost())
376 _M_rightmost() = __new_node; // maintain _M_rightmost() pointing to max node
480 if (_M_key_compare(_S_key(_M_rightmost()), _KeyOfValue()(__val))) {
483 return _M_insert(_M_rightmost(), __val, 0, __position._M_node); // Last argument only needs to be non-null
578 if (!_M_key_compare(_KeyOfValue()(__val), _S_key(_M_rightmost())))
579 return _M_insert(_M_rightmost(), __val, 0, __position._M_node); // Last argument only needs to be non-nul
    [all...]
_tree.h 339 _Base_ptr _M_rightmost() const
346 _Base_ptr& _M_rightmost()
401 _M_rightmost() = _S_maximum(_M_root());
535 _M_rightmost() = &this->_M_header._M_data;

Completed in 44 milliseconds