projects / perl.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: c1abd56) | patch
Make it possible to simulate old style one-at-a-time hashing
authorYves Orton <demerphq@gmail.com>
Mon, 3 Dec 2012 10:49:00 +0000 (11:49 +0100)
committerYves Orton <demerphq@gmail.com>
Mon, 3 Dec 2012 10:49:00 +0000 (11:49 +0100)
commit8c9e24c7f6088cb5fe0779c2c11c1fb4ca8ae693
tree581f3bfeccb0e1921e7ab9ddd401971face6ea43tree | snapshot
parentc1abd561a0a322ca22ba5ef8301a708c37336afbcommit | diff
Make it possible to simulate old style one-at-a-time hashing

With a 0 seed and ONE_AT_A_TIME_OLD hashing enabled one can simulate
older perls (with the exception there is no rehashing at play).

This includes a modest tweak to reduce ops per character by comparing
the string pointer to the end of the string, instead of maintaining
a position counter.
hv.h diff | blob | blame | history
Perl5 Master Repository