I actually have been poking around that code already. I also found https://github.com/vperron/python-superfasthash/blob/master/superfasthash.py in case of interest.
But it still seems like library authors with this use case should keep their library code free of implementation details like this, and instead use a higher-level API provided by Python. Thanks, Josh On Tue, Dec 27, 2016 at 10:28 PM, Ryan Gonzalez <rym...@gmail.com> wrote: > You could always try to make a Python version of the C tuple hashing > function[1] (requires the total # of elements) or PyPy's[2] (seems like it > would allow true incremental hashing). API idea: > > > hasher = IncrementalHasher() > hasher.add(one_item_to_hash) # updates hasher.hash property with result > # repeat > return hasher.hash > > > [1]: https://hg.python.org/cpython/file/dcced3bd22fe/ > Objects/tupleobject.c#l331 > [2]: https://bitbucket.org/pypy/pypy/src/d8febc18447e1f785a384d52413a34 > 5d7b3db423/rpython/rlib/objectmodel.py#objectmodel.py-562 > > -- > Ryan (ライアン) > Yoko Shimomura > ryo (supercell/EGOIST) > Hiroyuki Sawano >> everyone else > http://kirbyfan64.github.io/ >
_______________________________________________ Python-ideas mailing list Python-ideas@python.org https://mail.python.org/mailman/listinfo/python-ideas Code of Conduct: http://python.org/psf/codeofconduct/
