projects / platform / upstream / nasm.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 74cc5e5) | patch
phash.ph: use a bipartite graph to reduce the storage requirements
authorH. Peter Anvin <hpa@zytor.com>
Thu, 30 Aug 2007 23:42:39 +0000 (23:42 +0000)
committerH. Peter Anvin <hpa@zytor.com>
Thu, 30 Aug 2007 23:42:39 +0000 (23:42 +0000)
commitfb5a599c8ac2c67139e2d37c0b7031ea75e1da84
tree45de113bd4ee4e28f5436aaff65fdc6a92cd9ee4tree | snapshot
parent74cc5e569c1c8bcdd886734e1ce4c2df741b5b07commit | diff
phash.ph: use a bipartite graph to reduce the storage requirements

Since we fold the f- and g-functions together, if we guarantee that g is
bipartite, we can make g twice the size of f without cost.  This greatly
improves the odds of generating a smaller hash.
Makefile.in diff | blob | history
perllib/phash.ph diff | blob | history
Domain: System / Toolchain;