<html>
    <head>
      <base href="https://bugs.documentfoundation.org/">
    </head>
    <body><span class="vcard"><a class="email" href="mailto:telesto@surfxs.nl" title="Telesto <telesto@surfxs.nl>"> <span class="fn">Telesto</span></a>
</span> changed
          <a class="bz_bug_link 
          bz_status_NEW "
   title="NEW - Crash Writer MacOS"
   href="https://bugs.documentfoundation.org/show_bug.cgi?id=134629">bug 134629</a>
          <br>
             <table border="1" cellspacing="0" cellpadding="8">
          <tr>
            <th>What</th>
            <th>Removed</th>
            <th>Added</th>
          </tr>

         <tr>
           <td style="text-align:right;">Keywords</td>
           <td>bibisectRequest
           </td>
           <td>bibisected, bisected
           </td>
         </tr></table>
      <p>
        <div>
            <b><a class="bz_bug_link 
          bz_status_NEW "
   title="NEW - Crash Writer MacOS"
   href="https://bugs.documentfoundation.org/show_bug.cgi?id=134629#c4">Comment # 4</a>
              on <a class="bz_bug_link 
          bz_status_NEW "
   title="NEW - Crash Writer MacOS"
   href="https://bugs.documentfoundation.org/show_bug.cgi?id=134629">bug 134629</a>
              from <span class="vcard"><a class="email" href="mailto:telesto@surfxs.nl" title="Telesto <telesto@surfxs.nl>"> <span class="fn">Telesto</span></a>
</span></b>
        <pre>Bisected to
author  Jan-Marek Glogowski <<a href="mailto:glogow@fbihome.de">glogow@fbihome.de</a>> 2015-03-29 03:04:37 +0200
committer       Jan-Marek Glogowski <<a href="mailto:glogow@fbihome.de">glogow@fbihome.de</a>> 2016-08-29 13:13:13
+0200
commit  9c3d9e9fb49318ceda69f060a8e847b15d679245 (patch)
tree    1568981f7c88841226bec91c1808b11103599e95
parent  9dd45f9e314d6c28fdeecbe559b33615b0ed1a2d (diff)
Convert SwPageDescs to boost::multi_index
Page descriptions are exported via XIndexAccess, so they need a
stable array, currently a vector. On the other hand they are
referred by a unique name, so the lookup in the unsorted array is
O(n), not taking into account the amount of string comparisons.

The multi index container adds an ordered unique index, which
gets the lookup time down to O(log(n)) at the cost of a bit more
management overhead for most operations, which is largely
outweighted by the amount of lookup calls. These anyway have to be
done on insert to guarantee the unique naming.

<a href="https://cgit.freedesktop.org/libreoffice/core/commit/?id=9c3d9e9fb49318ceda69f060a8e847b15d679245">https://cgit.freedesktop.org/libreoffice/core/commit/?id=9c3d9e9fb49318ceda69f060a8e847b15d679245</a></pre>
        </div>
      </p>


      <hr>
      <span>You are receiving this mail because:</span>

      <ul>
          <li>You are the assignee for the bug.</li>
      </ul>
    </body>
</html>