Lines Matching defs:_M_impl

346       { return *static_cast<_Node_allocator*>(&this->_M_impl); }
350 { return *static_cast<const _Node_allocator*>(&this->_M_impl); }
359 { return _M_impl._Node_allocator::allocate(1); }
363 { _M_impl._Node_allocator::deallocate(__p, 1); }
453 _Rb_tree_impl<_Compare> _M_impl;
458 { return this->_M_impl._M_header._M_parent; }
462 { return this->_M_impl._M_header._M_parent; }
466 { return this->_M_impl._M_header._M_left; }
470 { return this->_M_impl._M_header._M_left; }
474 { return this->_M_impl._M_header._M_right; }
478 { return this->_M_impl._M_header._M_right; }
482 { return static_cast<_Link_type>(this->_M_impl._M_header._M_parent); }
488 (this->_M_impl._M_header._M_parent);
493 { return static_cast<_Link_type>(&this->_M_impl._M_header); }
497 { return static_cast<_Const_Link_type>(&this->_M_impl._M_header); }
595 : _M_impl(__comp, __a) { }
598 : _M_impl(__x._M_impl._M_key_compare, __x._M_get_Node_allocator())
605 _M_impl._M_node_count = __x._M_impl._M_node_count;
622 { return _M_impl._M_key_compare; }
628 (this->_M_impl._M_header._M_left));
635 (this->_M_impl._M_header._M_left));
640 { return iterator(static_cast<_Link_type>(&this->_M_impl._M_header)); }
646 (&this->_M_impl._M_header));
667 { return _M_impl._M_node_count == 0; }
671 { return _M_impl._M_node_count; }
748 _M_impl._M_node_count = 0;
848 : _M_impl(__x._M_impl._M_key_compare, __x._M_get_Node_allocator())
861 this->_M_impl._M_node_count = __x._M_impl._M_node_count;
862 __x._M_impl._M_node_count = 0;
877 _M_impl._M_key_compare = __x._M_impl._M_key_compare;
883 _M_impl._M_node_count = __x._M_impl._M_node_count;
896 || _M_impl._M_key_compare(_KeyOfValue()(__v),
903 this->_M_impl._M_header);
904 ++_M_impl._M_node_count;
915 || !_M_impl._M_key_compare(_S_key(__p),
921 this->_M_impl._M_header);
922 ++_M_impl._M_node_count;
937 __x = !_M_impl._M_key_compare(_S_key(__x), _KeyOfValue()(__v)) ?
1004 if (!_M_impl._M_key_compare(_S_key(__x), __k))
1020 if (!_M_impl._M_key_compare(_S_key(__x), __k))
1036 if (_M_impl._M_key_compare(__k, _S_key(__x)))
1052 if (_M_impl._M_key_compare(__k, _S_key(__x)))
1072 if (_M_impl._M_key_compare(_S_key(__x), __k))
1074 else if (_M_impl._M_key_compare(__k, _S_key(__x)))
1103 if (_M_impl._M_key_compare(_S_key(__x), __k))
1105 else if (_M_impl._M_key_compare(__k, _S_key(__x)))
1162 std::swap(this->_M_impl._M_node_count, __t._M_impl._M_node_count);
1163 std::swap(this->_M_impl._M_key_compare, __t._M_impl._M_key_compare);
1184 __comp = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x));
1195 if (_M_impl._M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__v)))
1211 __x = _M_impl._M_key_compare(_KeyOfValue()(__v), _S_key(__x)) ?
1227 && _M_impl._M_key_compare(_S_key(_M_rightmost()),
1233 else if (_M_impl._M_key_compare(_KeyOfValue()(__v),
1240 else if (_M_impl._M_key_compare(_S_key((--__before)._M_node),
1252 else if (_M_impl._M_key_compare(_S_key(__position._M_node),
1259 else if (_M_impl._M_key_compare(_KeyOfValue()(__v),
1286 && !_M_impl._M_key_compare(_KeyOfValue()(__v),
1292 else if (!_M_impl._M_key_compare(_S_key(__position._M_node),
1299 else if (!_M_impl._M_key_compare(_KeyOfValue()(__v),
1317 else if (!_M_impl._M_key_compare(_S_key((++__after)._M_node),
1366 this->_M_impl._M_header));
1368 --_M_impl._M_node_count;
1385 this->_M_impl._M_header));
1387 --_M_impl._M_node_count;
1400 this->_M_impl._M_header));
1402 --_M_impl._M_node_count;
1414 this->_M_impl._M_header));
1416 --_M_impl._M_node_count;
1521 || _M_impl._M_key_compare(__k,
1534 || _M_impl._M_key_compare(__k,
1558 if (_M_impl._M_node_count == 0 || begin() == end())
1559 return _M_impl._M_node_count == 0 && begin() == end()
1560 && this->_M_impl._M_header._M_left == _M_end()
1561 && this->_M_impl._M_header._M_right == _M_end();
1575 if (__L && _M_impl._M_key_compare(_S_key(__x), _S_key(__L)))
1577 if (__R && _M_impl._M_key_compare(_S_key(__R), _S_key(__x)))