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

  /external/stlport/stlport/stl/
_tree.h 333 _Compare _M_key_compare;
383 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(_Compare())
387 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(__comp)
391 : _Rb_tree_base<_Value, _Alloc>(__a), _M_node_count(0), _M_key_compare(__comp)
396 _M_node_count(0), _M_key_compare(__x._M_key_compare) {
410 _M_key_compare(_AsMoveSource(src.get()._M_key_compare))
419 _Compare key_comp() const { return _M_key_compare; }
453 _STLP_STD::swap(_M_key_compare, __t._M_key_compare)
    [all...]
_tree.c 327 _M_key_compare = __x._M_key_compare;
355 // _M_key_compare that can throw an exception.
366 _M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) {
392 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__x))) {
411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x));
421 if (_M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__val))) {
440 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__position._M_node))) {
445 bool __comp_pos_v = _M_key_compare( _S_key(__position._M_node), _KeyOfValue()(__val) );
468 if (_M_key_compare( _KeyOfValue()(__val), _S_key(__after._M_node) ))
    [all...]
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_tree.h 333 _Compare _M_key_compare;
383 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(_Compare())
387 : _Rb_tree_base<_Value, _Alloc>(allocator_type()), _M_node_count(0), _M_key_compare(__comp)
391 : _Rb_tree_base<_Value, _Alloc>(__a), _M_node_count(0), _M_key_compare(__comp)
396 _M_node_count(0), _M_key_compare(__x._M_key_compare) {
410 _M_key_compare(_AsMoveSource(src.get()._M_key_compare))
419 _Compare key_comp() const { return _M_key_compare; }
453 _STLP_STD::swap(_M_key_compare, __t._M_key_compare)
    [all...]
_tree.c 327 _M_key_compare = __x._M_key_compare;
355 // _M_key_compare that can throw an exception.
366 _M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) {
392 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__x))) {
411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x));
421 if (_M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__val))) {
440 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__position._M_node))) {
445 bool __comp_pos_v = _M_key_compare( _S_key(__position._M_node), _KeyOfValue()(__val) );
468 if (_M_key_compare( _KeyOfValue()(__val), _S_key(__after._M_node) ))
    [all...]
  /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/
stl_tree.h 428 _Key_compare _M_key_compare;
433 : _Node_allocator(), _M_key_compare(), _M_header(),
438 : _Node_allocator(__a), _M_key_compare(__comp), _M_header(),
460 mutable _KeyCompare _M_key_compare;
462 _CheckedCompare(): _M_key_compare() { }
463 _CheckedCompare(const _KeyCompare & __comp): _M_key_compare(__comp) { }
466 if (_M_key_compare(__x, __x))
468 if (_M_key_compare(__y, __y))
470 bool lt = _M_key_compare(__x, __y);
471 if (lt && _M_key_compare(__y, __x)
    [all...]

Completed in 565 milliseconds