Restore previous issue state upon request of submitter

Author: Dani-Hub

xml/issue4320.xml

@@ -86,8 +86,9 @@ This issue has some overlap to LWG <iref ref="4323"/>, and it would
 affect the outcome wording of that issue for `unique`.
 </p>
 </blockquote>
+</discussion>
 
-<superseded>
+<resolution>
 <p>
 This wording is relative to <paper num="N5014"/>.
 </p>
@@ -341,45 +342,6 @@ at worst <tt>&#x1d4aa;(log n)</tt> in the capacity of each block containing the
 
 </li>
 
-</ol>
-</superseded>
-
-<note>2025-09-17; Matt comments and provides improved wording</note>
-<p>
-Having looked at this in more detail, I believe only a blanket wording change to the 
-hive.overview is necessary, specifically <sref ref="[hive.overview]"/> p3, such that 
-the time complexity is limited to "techniques to identify the memory locations of 
-erased elements"
-</p>
-</discussion>
-
-<resolution>
-<p>
-This wording is relative to <paper num="N5014"/>.
-</p>
-
-<ol>
-
-<li><p>Modify <sref ref="[hive.overview]"/> as indicated:</p>
-
-<blockquote>
-<p>
--1- A `hive` is a type of sequence container that provides constant-time insertion and erasure 
-operations. Storage is automatically managed in multiple memory blocks, referred 
-to as element blocks. Insertion position is determined by the container, and may re-use the memory 
-locations of erased elements.
-<p/>
--2- [&hellip;]
-<p/>
--3- Erasures use unspecified techniques <del>of constant time complexity</del> to identify the memory 
-locations of erased elements, which are subsequently skipped during iteration <ins>in constant time</ins>, 
-as opposed to relocating subsequent elements during erasure. <ins>These techniques may be at worst 
-logarithmic in the capacity of the element block erased from.</ins>
-</p>
-</blockquote>
-
-</li>
-
 </ol>
 </resolution>