<?xml version="1.0" encoding="windows-1252"?>
<node id="1008337" title="Re^6: better array to hash conversion (wrong metric)" created="2012-12-11 11:44:47" updated="2012-12-11 11:44:47">
<type id="11">
note</type>
<author id="22609">
tye</author>
<data>
<field name="doctext">
&lt;c&gt;
s/(?=significantly)/in/
&lt;/c&gt;&lt;p&gt;
In the unlikely event of having hundreds of thousands of entries, the run-time will be a fraction of a second faster (and nobody will notice or care).  In the very unlikely event of this particular operation being even as much as 10% of the total run-time, the difference between the worst and the best shown so far will result in a 5% reduction in total run-time (which nobody will notice or care about).
&lt;/p&gt;
&lt;div class="pmsig"&gt;&lt;div class="pmsig-22609"&gt;&lt;p align="right"&gt;
- [tye]&lt;tt&gt; &amp;nbsp; &amp;nbsp; &amp;nbsp; &amp;nbsp;&lt;/tt&gt;
&lt;/p&gt;&lt;/div&gt;&lt;/div&gt;</field>
<field name="root_node">
1008288</field>
<field name="parent_node">
1008335</field>
</data>
</node>
