motiejus/turbonss
1
Fork 0
Code Releases Activity

Updated documentation.

Browse Source
This commit is contained in:
Davi de Castro Reis 2010-09-09 16:28:20 -07:00
parent 7f4a877e93
commit bfdcc3a3a1
5 changed files with 36 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
NEWSLOG.t2t
View File

@ -5,6 +5,13 @@ News Log
---------------------------------------- ----------------------------------------
==News for version 1.0==
This is a bugfix only version, after which a revamp of the cmph code and
algorithms will be done.
----------------------------------------
==News for version 0.9== ==News for version 0.9==
- [The CHD algorithm chd.html], which is an algorithm that can be tuned to generate MPHFs that require approximately 2.07 bits per key to be stored. The algorithm outperforms [the BDZ algorithm bdz.html] and therefore is the fastest one available in the literature for sets that can be treated in internal memory. - [The CHD algorithm chd.html], which is an algorithm that can be tuned to generate MPHFs that require approximately 2.07 bits per key to be stored. The algorithm outperforms [the BDZ algorithm bdz.html] and therefore is the fastest one available in the literature for sets that can be treated in internal memory.
@ -71,4 +78,4 @@ News Log
%!include: FOOTER.t2t %!include: FOOTER.t2t
%!include(html): ''GOOGLEANALYTICS.t2t'' %!include(html): ''GOOGLEANALYTICS.t2t''

7
README.t2t
View File

@ -88,6 +88,11 @@ The CMPH Library encapsulates the newest and more efficient algorithms in an eas
---------------------------------------- ----------------------------------------
==News for version 1.0==
This is a bugfix only version, after which a revamp of the cmph code and
algorithms will be done.
==News for version 0.9== ==News for version 0.9==
- [The CHD algorithm chd.html], which is an algorithm that can be tuned to generate MPHFs that require approximately 2.07 bits per key to be stored. The algorithm outperforms [the BDZ algorithm bdz.html] and therefore is the fastest one available in the literature for sets that can be treated in internal memory. - [The CHD algorithm chd.html], which is an algorithm that can be tuned to generate MPHFs that require approximately 2.07 bits per key to be stored. The algorithm outperforms [the BDZ algorithm bdz.html] and therefore is the fastest one available in the literature for sets that can be treated in internal memory.
@ -294,4 +299,4 @@ Code is under the LGPL and the MPL 1.1.
%!include(html): ''LOGO.t2t'' %!include(html): ''LOGO.t2t''
Last Updated: %%date(%c) Last Updated: %%date(%c)
%!include(html): ''GOOGLEANALYTICS.t2t'' %!include(html): ''GOOGLEANALYTICS.t2t''

2
configure.ac
View File

@ -1,6 +1,6 @@
dnl Process this file with autoconf to produce a configure script. dnl Process this file with autoconf to produce a configure script.
AC_INIT(Makefile.am) AC_INIT(Makefile.am)
AM_INIT_AUTOMAKE(cmph, 0.9) AM_INIT_AUTOMAKE(cmph, 1.0)
AM_CONFIG_HEADER(config.h) AM_CONFIG_HEADER(config.h)
AC_CONFIG_MACRO_DIR([m4]) AC_CONFIG_MACRO_DIR([m4])

20
portage/dev-libs/cmph/cmph-1.0.ebuild Normal file
View File

@ -0,0 +1,20 @@
DESCRIPTION="Library for building large minimal perfect hashes"
HOMEPAGE="http://cmph.sf.net/"
SRC_URI="mirror://sourceforge/cmph/${PN}/${P}/${P}.tar.gz"
LICENSE="LGPL-2"
SLOT="0"
KEYWORDS="~x86"
IUSE=""
DEPEND="gcc libtool libc"
RDEPEND="libc"
S=${WORKDIR}/${P}
src_compile() {
econf || die "econf failed"
emake || die "emake failed"
}
src_install() {
emake DESTDIR=${D} install || die
}

2
src/Makefile
View File

@ -148,7 +148,7 @@ SED = /usr/bin/sed
SET_MAKE = SET_MAKE =
SHELL = /bin/sh SHELL = /bin/sh
STRIP = strip STRIP = strip
VERSION = 0.9 VERSION = 1.0
abs_builddir = /Users/davi/vc/cmphsf/src abs_builddir = /Users/davi/vc/cmphsf/src
abs_srcdir = /Users/davi/vc/cmphsf/src abs_srcdir = /Users/davi/vc/cmphsf/src
abs_top_builddir = /Users/davi/vc/cmphsf abs_top_builddir = /Users/davi/vc/cmphsf