mirror of
https://github.com/netwide-assembler/nasm.git
synced 2025-03-31 18:20:22 +08:00
fb5a599c8a
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.
This directory contains the following Perl modules from CPAN: Graph-0.84 See the .pod documentation for copyright and license terms.