nixpkgs/pkgs/by-name/pr/primesieve/package.nix

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

57 lines
1.4 KiB
Nix
Raw Normal View History

2024-08-02 15:27:10 +00:00
{
lib,
cmake,
fetchFromGitHub,
2024-08-02 15:31:01 +00:00
gitUpdater,
2024-08-02 15:27:10 +00:00
stdenv,
primecount,
2022-05-14 13:56:13 +00:00
}:
stdenv.mkDerivation (finalAttrs: {
2022-05-14 13:56:13 +00:00
pname = "primesieve";
2024-12-09 15:01:50 +00:00
version = "12.6";
2022-05-14 13:56:13 +00:00
src = fetchFromGitHub {
owner = "kimwalisch";
repo = "primesieve";
rev = "v${finalAttrs.version}";
2024-12-09 15:01:50 +00:00
hash = "sha256-XbHZDB6QbzS/+8wbgXIwWWla0nt5fCGbW3MAQvxavTk=";
2022-05-14 13:56:13 +00:00
};
2024-08-02 15:27:10 +00:00
outputs = [
"out"
"dev"
"lib"
"man"
];
2022-05-14 13:56:13 +00:00
nativeBuildInputs = [ cmake ];
strictDeps = true;
passthru = {
tests = {
inherit primecount; # dependent
};
2024-08-02 15:31:01 +00:00
updateScript = gitUpdater { rev-prefix = "v"; };
};
meta = {
2022-05-14 13:56:13 +00:00
homepage = "https://primesieve.org/";
description = "Fast C/C++ prime number generator";
longDescription = ''
primesieve is a command-line program and C/C++ library for quickly
generating prime numbers. It is very cache efficient, it detects your
CPU's L1 & L2 cache sizes and allocates its main data structures
accordingly. It is also multi-threaded by default, it uses all available
CPU cores whenever possible i.e. if sequential ordering is not
required. primesieve can generate primes and prime k-tuplets up to 264.
'';
changelog = "https://github.com/kimwalisch/primesieve/blob/${finalAttrs.src.rev}/ChangeLog";
license = lib.licenses.bsd2;
mainProgram = "primesieve";
maintainers = lib.teams.sage.members;
platforms = lib.platforms.unix;
2022-05-14 13:56:13 +00:00
};
})