37 lines
1.1 KiB
Nix
37 lines
1.1 KiB
Nix
|
{ lib
|
||
|
|
, stdenv
|
||
|
|
, fetchFromGitHub
|
||
|
|
, cmake
|
||
|
|
}:
|
||
|
|
|
||
|
|
stdenv.mkDerivation rec {
|
||
|
|
pname = "primesieve";
|
||
|
|
version = "7.9";
|
||
|
|
|
||
|
|
src = fetchFromGitHub {
|
||
|
|
owner = "kimwalisch";
|
||
|
|
repo = "primesieve";
|
||
|
|
rev = "v${version}";
|
||
|
|
hash = "sha256-lwT+adKFoNI125y5FuJMovtMh8sFi9oqMLYGLabzrCI=";
|
||
|
|
};
|
||
|
|
|
||
|
|
nativeBuildInputs = [ cmake ];
|
||
|
|
|
||
|
|
meta = with lib; {
|
||
|
|
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.
|
||
|
|
'';
|
||
|
|
license = licenses.bsd2;
|
||
|
|
maintainers = teams.sage.members ++
|
||
|
|
(with maintainers; [ abbradar AndersonTorres ]);
|
||
|
|
platforms = platforms.unix;
|
||
|
|
};
|
||
|
|
}
|