Thank you for your answer.
Seems I found original discussionand it seems that was just optimization of previous algorithm overhead:
Perl currently has a defense against attacks on its hash algorithm
where it conditionally enables the use of a random hash seed when it
calculates the hash value for a string. This mode is triggered by
encountering an overly long bucket chain during insert. Once this bit
is set all further hash operations have to go through additional
layers of logic. All of this support has a per-operation cost.
The rehash mechanism more or less works around the problem of hash
order expectations by only enabling the randomization in degenerate
hashes. But it achieves this at the cost of added per operation
overhead in hot code paths and additional complexity in the code.
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|