include/bits/stl_tree.h

688       _M_insert_unique(iterator __position, const value_type& __x);
691       _M_insert_unique(const_iterator __position, const value_type& __x);
694       _M_insert_equal(iterator __position, const value_type& __x);
697       _M_insert_equal(const_iterator __position, const value_type& __x);
708       erase(iterator __position);
711       erase(const_iterator __position);
1017     _M_insert_unique(iterator __position, const _Val& __v)
1020       if (__position._M_node == _M_end())
1030 				      _S_key(__position._M_node)))
1033 	  iterator __before = __position;
1034 	  if (__position._M_node == _M_leftmost()) // begin()
1042 		return _M_insert(__position._M_node,
1043 				 __position._M_node, __v);
1048       else if (_M_impl._M_key_compare(_S_key(__position._M_node),
1052 	  iterator __after = __position;
1053 	  if (__position._M_node == _M_rightmost())
1058 	      if (_S_right(__position._M_node) == 0)
1059 		return _M_insert(0, __position._M_node, __v);
1067 	return __position; // Equivalent keys.
1074     _M_insert_unique(const_iterator __position, const _Val& __v)
1077       if (__position._M_node == _M_end())
1087 				      _S_key(__position._M_node)))
1090 	  const_iterator __before = __position;
1091 	  if (__position._M_node == _M_leftmost()) // begin()
1099 		return _M_insert(__position._M_node,
1100 				 __position._M_node, __v);
1105       else if (_M_impl._M_key_compare(_S_key(__position._M_node),
1109 	  const_iterator __after = __position;
1110 	  if (__position._M_node == _M_rightmost())
1115 	      if (_S_right(__position._M_node) == 0)
1116 		return _M_insert(0, __position._M_node, __v);
1124 	return __position; // Equivalent keys.
1131     _M_insert_equal(iterator __position, const _Val& __v)
1134       if (__position._M_node == _M_end())
1143       else if (!_M_impl._M_key_compare(_S_key(__position._M_node),
1147 	  iterator __before = __position;
1148 	  if (__position._M_node == _M_leftmost()) // begin()
1156 		return _M_insert(__position._M_node,
1157 				 __position._M_node, __v);
1165 	  iterator __after = __position;
1166 	  if (__position._M_node == _M_rightmost())
1171 	      if (_S_right(__position._M_node) == 0)
1172 		return _M_insert(0, __position._M_node, __v);
1185     _M_insert_equal(const_iterator __position, const _Val& __v)
1188       if (__position._M_node == _M_end())
1197       else if (!_M_impl._M_key_compare(_S_key(__position._M_node),
1201 	  const_iterator __before = __position;
1202 	  if (__position._M_node == _M_leftmost()) // begin()
1210 		return _M_insert(__position._M_node,
1211 				 __position._M_node, __v);
1219 	  const_iterator __after = __position;
1220 	  if (__position._M_node == _M_rightmost())
1225 	      if (_S_right(__position._M_node) == 0)
1226 		return _M_insert(0, __position._M_node, __v);
1261     erase(iterator __position)
1265 				(__position._M_node,
1275     erase(const_iterator __position)
1279 				(const_cast<_Base_ptr>(__position._M_node),