The PerfectHash package

[ Tags: bsd3, data, data-structures, library ] [ Propose Tags ]

A perfect hashing library for mapping bytestrings to values. Insertion is not supported (by design): this is just a binding to the C-based CMPH library ( Only fromList and lookup operations are supported, but in many circumstances this is all that's required.

[Skip to Readme]


Versions 0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.1.5
Dependencies array, base, binary, bytestring, bytestring-trie, containers, digest, haskell98, HUnit, QuickCheck, time [details]
License BSD3
Author Mark Wotton <>
Maintainer Mark Wotton <>
Category Data, Data Structures
Bug tracker
Uploaded Sun Feb 8 20:36:09 UTC 2009 by MarkWotton
Distributions NixOS:0.1.5
Executables test, benchmark_trie, benchmark
Downloads 2441 total (56 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI




Maintainer's Corner

For package maintainers and hackage trustees

Readme for PerfectHash-0.1.2

[back to package description]
This is a thin haskell wrapper around the CMPH library, obtainable at
I assume you have it installed in /usr/local/lib.

The motivation is mostly speed, and wren thornton's bytestring-trie seems to be the main competition:

% ./dist/build/benchmark_trie/benchmark_trie
* trie lookup:   1.136ns per iteration / 880403.98 per second.

% ./dist/build/benchmark/benchmark          
* perfect lookup:   0.687ns per iteration / 1456455.69 per second.

it also uses less space in the haskell heap, building once and doing the same number of lookups:

	total alloc = 2,525,223,964 bytes  (excludes profiling overheads)

	total alloc = 9,806,202,096 bytes  (excludes profiling overheads)

although this is not an entirely fair comparison given how much PerfectHash stores on the C side.