[associative.reqmts.general], [unord.req.general] Simplify specifications for try_emplace

Author: Eisenwave

source/containers.tex

@@ -3227,21 +3227,12 @@
 \end{itemdecl}
 
 \begin{itemdescr}
-\pnum
-\result
-\tcode{iterator}
-
 \pnum
 \effects
-Equivalent to \tcode{a.emplace(std::forward<Args>(args)...)},
+Equivalent to: \tcode{return a.emplace(std::forward<Args>(args)...).first},
 except that the element is inserted as close as possible to
 the position just prior to \tcode{p}.
 
-\pnum
-\returns
-An iterator pointing to the element
-with the key equivalent to the newly inserted element.
-
 \pnum
 \complexity
 Logarithmic in general, but
@@ -4937,30 +4928,11 @@
 \end{itemdecl}
 
 \begin{itemdescr}
-\pnum
-\result
-\tcode{iterator}
-
-\pnum
-\expects
-\tcode{value_type} is
-\oldconcept{EmplaceConstructible} into \tcode{X} from \tcode{args}.
-
 \pnum
 \effects
-Equivalent to \tcode{a.emplace(std::forward<Args>(args)...)}.
-
-\pnum
-\returns
-An iterator pointing to the element
-with the key equivalent to the newly inserted element.
-The \tcode{const_iterator} \tcode{p} is a hint
+Equivalent to: \tcode{return a.emplace(std::forward<Args>(args)...).first},
+expect that the \tcode{const_iterator} \tcode{p} is an ignorable hint
 pointing to where the search should start.
-Implementations are permitted to ignore the hint.
-
-\pnum
-\complexity
-Average case \bigoh{1}, worst case \bigoh{\tcode{a.size()}}.
 \end{itemdescr}
 
 \indexunordmem{insert}%