1
Fork 0

It was added FOOTER.t2t file

This commit is contained in:
fc_botelho 2005-01-27 16:21:49 +00:00
parent 7d3d1248d3
commit 1e67ed9f88
7 changed files with 15 additions and 26 deletions

View File

@ -16,8 +16,5 @@ BMZ Algorithm
---------------------------------------- ----------------------------------------
[Home index.html] [Home index.html]
---------------------------------------- ----------------------------------------
Enjoy!
Davi de Castro Reis %!include: FOOTER.t2t
Fabiano Cupertino Botelho

Before

Width:  |  Height:  |  Size: 303 B

After

Width:  |  Height:  |  Size: 271 B

View File

@ -14,8 +14,5 @@ CHM Algorithm
---------------------------------------- ----------------------------------------
[Home index.html] [Home index.html]
---------------------------------------- ----------------------------------------
Enjoy!
Davi de Castro Reis %!include: FOOTER.t2t
Fabiano Cupertino Botelho

View File

@ -17,8 +17,5 @@ Comparison Between BMZ And CHM Algorithms
---------------------------------------- ----------------------------------------
[Home index.html] [Home index.html]
---------------------------------------- ----------------------------------------
Enjoy!
Davi de Castro Reis %!include: FOOTER.t2t
Fabiano Cupertino Botelho

View File

@ -22,6 +22,4 @@ CMPH FAQ
[Home index.html] [Home index.html]
---------------------------------------- ----------------------------------------
Davi de Castro Reis %!include: FOOTER.t2t
Fabiano Cupertino Botelho

8
FOOTER.t2t Normal file
View File

@ -0,0 +1,8 @@
Enjoy!
[Davi de Castro Reis davi@users.sourceforge.net]
[Fabiano Cupertino Botelho fc_botelho@users.sourceforge.net]

View File

@ -35,6 +35,4 @@ the compiler programming area (detect reserved keywords).
[Home index.html] [Home index.html]
---------------------------------------- ----------------------------------------
Davi de Castro Reis %!include: FOOTER.t2t
Fabiano Cupertino Botelho

View File

@ -54,7 +54,7 @@ of the distinguishable features of cmph:
- New heuristic added to the bmz algorithm permits to generate a mphf with only - New heuristic added to the bmz algorithm permits to generate a mphf with only
24.61*n + O(1) bytes. The resulting function can be stored in 3.72*n bytes. 24.61*n + O(1) bytes. The resulting function can be stored in 3.72*n bytes.
[click here bmz.html] for details. %html% [click here bmz.html] for details.
---------------------------------------- ----------------------------------------
@ -146,9 +146,7 @@ utility.
-f hash function (may be used multiple times) - valid values are -f hash function (may be used multiple times) - valid values are
* djb2 * djb2
* fnv * fnv
* glib
* jenkins * jenkins
* pjw
* sdbm * sdbm
-V print version number and exit -V print version number and exit
-v increase verbosity (may be used multiple times) -v increase verbosity (may be used multiple times)
@ -173,11 +171,7 @@ Use the project page at sourceforge: http://sf.net/projects/cmph
Code is under the LGPL. Code is under the LGPL.
---------------------------------------- ----------------------------------------
Enjoy! %!include: FOOTER.t2t
Davi de Castro Reis davi@users.sourceforge.net
Fabiano Cupertino Botelho fc_botelho@users.sourceforge.net
%!include(html): ''LOGO.html'' %!include(html): ''LOGO.html''
Last Updated: %%date(%c) Last Updated: %%date(%c)