parent
4b1e70039e
commit
d488388cfc
@ -0,0 +1,36 @@ |
||||
{ 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; |
||||
}; |
||||
} |
@ -1,23 +0,0 @@ |
||||
{ lib, stdenv, fetchFromGitHub, cmake }: |
||||
|
||||
stdenv.mkDerivation rec { |
||||
pname = "primesieve"; |
||||
version = "7.8"; |
||||
|
||||
nativeBuildInputs = [ cmake ]; |
||||
|
||||
src = fetchFromGitHub { |
||||
owner = "kimwalisch"; |
||||
repo = "primesieve"; |
||||
rev = "v${version}"; |
||||
sha256 = "sha256-M35CP/xEyC7mEh84kaGsgfsDI9fnanHraNPgTvpqimI="; |
||||
}; |
||||
|
||||
meta = with lib; { |
||||
description = "Fast C/C++ prime number generator"; |
||||
homepage = "https://primesieve.org/"; |
||||
license = licenses.bsd2; |
||||
platforms = platforms.unix; |
||||
maintainers = with maintainers; [ abbradar ]; |
||||
}; |
||||
} |
Loading…
Reference in new issue