646b892680
Some checks failed
Periodic Merges (6h) / master → staging-nixos (push) Failing after 12m50s
Periodic Merges (6h) / master → staging-next (push) Failing after 12m54s
Periodic Merges (24h) / merge-base(master,staging) → haskell-updates (push) Failing after 11m54s
Periodic Merges (6h) / staging-next → staging (push) Failing after 12m13s
Periodic Merges (24h) / staging-next-25.05 → staging-25.05 (push) Failing after 13m24s
Periodic Merges (24h) / release-25.05 → staging-next-25.05 (push) Failing after 14m28s
42 lines
1.1 KiB
Nix
42 lines
1.1 KiB
Nix
{
|
|
lib,
|
|
stdenv,
|
|
fetchurl,
|
|
}:
|
|
|
|
stdenv.mkDerivation rec {
|
|
pname = "gperf";
|
|
version = "3.3";
|
|
|
|
src = fetchurl {
|
|
url = "mirror://gnu/${pname}/${pname}-${version}.tar.gz";
|
|
hash = "sha256-/Yfgq6fkOuBUg3r9bNTbA6PyaT3rNhkIXm7Z2NlgStg=";
|
|
};
|
|
|
|
enableParallelBuilding = true;
|
|
|
|
meta = {
|
|
description = "Perfect hash function generator";
|
|
|
|
longDescription = ''
|
|
GNU gperf is a perfect hash function generator. For a given
|
|
list of strings, it produces a hash function and hash table, in
|
|
form of C or C++ code, for looking up a value depending on the
|
|
input string. The hash function is perfect, which means that
|
|
the hash table has no collisions, and the hash table lookup
|
|
needs a single string comparison only.
|
|
|
|
GNU gperf is highly customizable. There are options for
|
|
generating C or C++ code, for emitting switch statements or
|
|
nested ifs instead of a hash table, and for tuning the algorithm
|
|
employed by gperf.
|
|
'';
|
|
|
|
license = lib.licenses.gpl3Plus;
|
|
|
|
homepage = "https://www.gnu.org/software/gperf/";
|
|
platforms = lib.platforms.unix;
|
|
mainProgram = "gperf";
|
|
};
|
|
}
|