Home | History | Annotate | Download | only in nbperf
History log of /src/usr.bin/nbperf/nbperf-chm.c
RevisionDateAuthorComments
 1.5  26-Jan-2021  joerg Fix potential off-by-one error when using hash fudging. It needs to
round up to 2/4 and not one less to guarantee that the adjusted hash
fits into array.
 1.4  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.3  21-Oct-2011  joerg Add support for build as part of the toolchain. Add option for
deterministic output (-p), which replaces the random seed with a
incremental counter.
 1.2  24-Aug-2009  joerg Use a more compact presentation for g if the size is small enough.
 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.

RSS XML Feed