include/bits/stl_tree.h

652       insert_unique(iterator __position, const value_type& __x);
655       insert_unique(const_iterator __position, const value_type& __x);
658       insert_equal(iterator __position, const value_type& __x);
661       insert_equal(const_iterator __position, const value_type& __x);
672       erase(iterator __position);
675       erase(const_iterator __position);
941     insert_unique(iterator __position, const _Val& __v)
944       if (__position._M_node == _M_end())
954 				      _S_key(__position._M_node)))
957 	  iterator __before = __position;
958 	  if (__position._M_node == _M_leftmost()) // begin()
966 		return _M_insert(__position._M_node,
967 				 __position._M_node, __v);
972       else if (_M_impl._M_key_compare(_S_key(__position._M_node),
976 	  iterator __after = __position;
977 	  if (__position._M_node == _M_rightmost())
982 	      if (_S_right(__position._M_node) == 0)
983 		return _M_insert(0, __position._M_node, __v);
991 	return __position; // Equivalent keys.
998     insert_unique(const_iterator __position, const _Val& __v)
1001       if (__position._M_node == _M_end())
1011 				      _S_key(__position._M_node)))
1014 	  const_iterator __before = __position;
1015 	  if (__position._M_node == _M_leftmost()) // begin()
1023 		return _M_insert(__position._M_node,
1024 				 __position._M_node, __v);
1029       else if (_M_impl._M_key_compare(_S_key(__position._M_node),
1033 	  const_iterator __after = __position;
1034 	  if (__position._M_node == _M_rightmost())
1039 	      if (_S_right(__position._M_node) == 0)
1040 		return _M_insert(0, __position._M_node, __v);
1048 	return __position; // Equivalent keys.
1055     insert_equal(iterator __position, const _Val& __v)
1058       if (__position._M_node == _M_end())
1067       else if (!_M_impl._M_key_compare(_S_key(__position._M_node),
1071 	  iterator __before = __position;
1072 	  if (__position._M_node == _M_leftmost()) // begin()
1080 		return _M_insert(__position._M_node,
1081 				 __position._M_node, __v);
1089 	  iterator __after = __position;
1090 	  if (__position._M_node == _M_rightmost())
1095 	      if (_S_right(__position._M_node) == 0)
1096 		return _M_insert(0, __position._M_node, __v);
1109     insert_equal(const_iterator __position, const _Val& __v)
1112       if (__position._M_node == _M_end())
1121       else if (!_M_impl._M_key_compare(_S_key(__position._M_node),
1125 	  const_iterator __before = __position;
1126 	  if (__position._M_node == _M_leftmost()) // begin()
1134 		return _M_insert(__position._M_node,
1135 				 __position._M_node, __v);
1143 	  const_iterator __after = __position;
1144 	  if (__position._M_node == _M_rightmost())
1149 	      if (_S_right(__position._M_node) == 0)
1150 		return _M_insert(0, __position._M_node, __v);
1185     erase(iterator __position)
1189 				(__position._M_node,
1199     erase(const_iterator __position)
1203 				(const_cast<_Base_ptr>(__position._M_node),