motiejus/turbonss
1
Fork 0
Code Releases Activity

It was included the PreProc macro through the CONFIG.t2t file and the LOGO through the LOGO.html file

Browse Source
This commit is contained in:
fc_botelho 2005-01-25 20:33:08 +00:00
parent 8221293106
commit b6124cfb22
4 changed files with 25 additions and 45 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
BMZ.t2t
View File

@ -1,6 +1,8 @@
BMZ Algorithm BMZ Algorithm
%!includeconf: CONFIG.t2t
---------------------------------------- ----------------------------------------
**History** **History**
@ -12,7 +14,7 @@ BMZ Algorithm
**Papers** **Papers**
---------------------------------------- ----------------------------------------
[Home README.html] [Home index.html]
---------------------------------------- ----------------------------------------
Enjoy! Enjoy!
@ -20,7 +22,5 @@ Davi de Castro Reis
Fabiano Cupertino Botelho Fabiano Cupertino Botelho
%!include(html): ''LOGO.html''
%preproc(html): '^%html% ' ''
%html% <a href="http://sourceforge.net"><img src="http://sourceforge.net/sflogo.php?group_id=96251&amp;type=1" width="88" height="31" border="0" alt="SourceForge.net Logo" /></a>
Last Updated: %%date(%c) Last Updated: %%date(%c)

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 513 B

After

Width:  |  Height:  |  Size: 360 B

10
COMPARISON.t2t
View File

@ -1,6 +1,8 @@
Comparison Between BMZ And CZECH Algorithms Comparison Between BMZ And CHM Algorithms
%!includeconf: CONFIG.t2t
---------------------------------------- ----------------------------------------
**Features** **Features**
@ -13,7 +15,7 @@ Comparison Between BMZ And CZECH Algorithms
**Run times** **Run times**
---------------------------------------- ----------------------------------------
[Home README.html] [Home index.html]
---------------------------------------- ----------------------------------------
Enjoy! Enjoy!
@ -21,7 +23,5 @@ Davi de Castro Reis
Fabiano Cupertino Botelho Fabiano Cupertino Botelho
%!include(html): ''LOGO.html''
%preproc(html): '^%html% ' ''
%html% <a href="http://sourceforge.net"><img src="http://sourceforge.net/sflogo.php?group_id=96251&amp;type=1" width="88" height="31" border="0" alt="SourceForge.net Logo" /></a>
Last Updated: %%date(%c) Last Updated: %%date(%c)

24
CZECH.t2t
View File

@ -1,24 +0,0 @@
CZECH Algorithm
----------------------------------------
**History**
**The Algorithm**
**Papers**
----------------------------------------
[Home README.html]
----------------------------------------
Enjoy!
Davi de Castro Reis
Fabiano Cupertino Botelho
%preproc(html): '^%html% ' ''
%html% <a href="http://sourceforge.net"><img src="http://sourceforge.net/sflogo.php?group_id=96251&amp;type=1" width="88" height="31" border="0" alt="SourceForge.net Logo" /></a>
Last Updated: %%date(%c)

28
README.t2t
View File

@ -1,6 +1,8 @@
CMPH - C Minimal Perfect Hashing Library CMPH - C Minimal Perfect Hashing Library
%!includeconf: CONFIG.t2t
---------------------------------------- ----------------------------------------
**Description** **Description**
@ -9,7 +11,7 @@ C Minimal Perfect Hashing Library is a portable LGPLed library to create and
to work with minimal perfect hashing functions. The cmph library encapsulates the newest to work with minimal perfect hashing functions. The cmph library encapsulates the newest
and more efficient algorithms (available in the literature) in an easy-to-use, and more efficient algorithms (available in the literature) in an easy-to-use,
production-quality and fast API. The library is designed to work with big entries that production-quality and fast API. The library is designed to work with big entries that
can not be fit in the main memory. It has been used successfully for constructing minimal perfect can not fit in the main memory. It has been used successfully for constructing minimal perfect
hashing functions for sets with more than 100 million of keys. hashing functions for sets with more than 100 million of keys.
Although there is a lack of similar libraries Although there is a lack of similar libraries
in the free software world, we can point out some of the distinguishable in the free software world, we can point out some of the distinguishable
@ -31,15 +33,19 @@ features of cmph:
**Supported Algorithms** **Supported Algorithms**
- [BMZ Algorithm BMZ.html]. A very fast algorithm based on cyclic random graphs to construct minimal
%html% - [BMZ Algorithm bmz.html].
%txt% - BMZ Algorithm.
A very fast algorithm based on cyclic random graphs to construct minimal
perfect hash functions in linear time. The resulting functions are not order preserving and perfect hash functions in linear time. The resulting functions are not order preserving and
can be stored in only 4cn bytes, where c is between 0.93 and 1.15. can be stored in only 4cn bytes, where c is between 0.93 and 1.15.
%html% - [CHM Algorithm chm.html].
- [CZECH Algorithm CZECH.html]. An algorithm based on acyclic random graphs to construct minimal %txt% - CHM Algorithm.
An algorithm based on acyclic random graphs to construct minimal
perfect hash functions in linear time. The resulting functions are order preserving and perfect hash functions in linear time. The resulting functions are order preserving and
are stored in 4cn bytes, where c is greater than 2. are stored in 4cn bytes, where c is greater than 2.
[Click Here COMPARISON.html] to see a comparison of the supported algorithms. %html% [Click Here comparison.html] to see a comparison of the supported algorithms.
---------------------------------------- ----------------------------------------
@ -48,7 +54,7 @@ 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. [click here bmz.html] for details.
---------------------------------------- ----------------------------------------
@ -68,7 +74,7 @@ Using cmph is quite simple. Take a look.
//Fill vector //Fill vector
//... //...
//Create minimal perfect hashing function using the default(czech) algorithm. //Create minimal perfect hashing function using the default(chm) algorithm.
cmph_config_t *config = cmph_config_new(cmph_io_vector_adapter(vector, nkeys)); cmph_config_t *config = cmph_config_new(cmph_io_vector_adapter(vector, nkeys));
cmph_t *hash = cmph_new(config); cmph_t *hash = cmph_new(config);
cmph_config_destroy(config); cmph_config_destroy(config);
@ -117,7 +123,7 @@ comes with a number of flags, but it is very simple to create and to query
minimal perfect hashing functions: minimal perfect hashing functions:
``` ```
$ # Using the czech algorithm (default one) for constructing a mphf for keys in file keys_file $ # Using the chm algorithm (default one) for constructing a mphf for keys in file keys_file
$ ./cmph -g keys_file $ ./cmph -g keys_file
$ # Query id of keys in the file keys_query $ # Query id of keys in the file keys_query
$ ./cmph -m keys_file.mph keys_query $ ./cmph -m keys_file.mph keys_query
@ -136,7 +142,7 @@ utility.
-c c value that determines the number of vertices in the graph -c c value that determines the number of vertices in the graph
-a algorithm - valid values are -a algorithm - valid values are
* bmz * bmz
* czech * chm
-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
@ -169,7 +175,5 @@ Davi de Castro Reis
Fabiano Cupertino Botelho Fabiano Cupertino Botelho
%!include(html): ''LOGO.html''
%preproc(html): '^%html% ' ''
%html% <a href="http://sourceforge.net"><img src="http://sourceforge.net/sflogo.php?group_id=96251&amp;type=1" width="88" height="31" border="0" alt="SourceForge.net Logo" /></a>
Last Updated: %%date(%c) Last Updated: %%date(%c)