Cross Reference: /src/usr.bin/nbperf/graph2.h

History log of /src/usr.bin/nbperf/graph2.h
Revision	Date	Author	Comments
1.2	07-Jan-2021	joerg	Optimize nbperf - add fudge mode which gives a slightly slower hash function, but works almost always in the first iteration by avoiding degenerate edges - avoid keeping incidence lists around reducing the memory foot print by 30% - split edge processing from hashing as in the non-fudge case it is a reasonable costly part that often gets thrown away - merge graph2 and graph3 routines now that they are mostly the same
1.1	15-Aug-2009	joerg	Add nbperf(1), a minimal perfect hash function generator. Implemented are the 3-graph BDZ algorithm as well as the 2-graph and 3-graph CHM algorithms. All algorithms have expected linear run time and the smallest functions need around 2.85 bit/key.

OpenGrok