github-actions[bot]
2 years ago
committed by
GitHub
commit
7e7fb6332c
@ -1,9 +1,9 @@ |
||||
{ |
||||
"version": "1.10.4-sc.1", |
||||
"rev": "v1.10.4-sc.1", |
||||
"srcHash": "0sxibzskbw9pa6wmbk1y3n7p74cfj9zvm2hsw76sp6wfac1wnbwl", |
||||
"webYarnHash": "1z8xr35gh74y2iv9kfk6d6b6f3iclcrpkdds5q7rh2irpf14fwpw", |
||||
"jsSdkYarnHash": "1cwvb0hwq19dh2937fmcbfvnkkfmalk9wrxf1yv81nsbyjnx86di", |
||||
"reactSdkYarnHash": "0j4rxg11q35idfzvjrpmyrwkz9yqgzpwps3xqx1k4qcs844jjs9f", |
||||
"desktopYarnHash": "0akmgib212gkygvs2snn9c43k3ika3ipg85d480j3hqyb6yxwqmn" |
||||
"version": "1.10.12-sc.1", |
||||
"rev": "v1.10.12-sc.1", |
||||
"srcHash": "1rpfax6xx731w59a2i7v6jr17l3rnrn79d666f0cjchg36nkqqg9", |
||||
"webYarnHash": "0m5dnz3m68iz94siwmavzj50wxd6w6wanjsm1zhq76lgymgcbqc2", |
||||
"jsSdkYarnHash": "1k1jvavbqr7vcbdaxc6yqiq5254kxhywn1s2zndrfny7ap8z5c1c", |
||||
"reactSdkYarnHash": "0cz7pgrbysljmhpf4m0wqwqjqijxahl3wz5qhczlkj46dvq6qyxb", |
||||
"desktopYarnHash": "09ri87ynfgxrv22sykggiy6nlcf20qwj7zj9qq0rz3c2acr6g9mn" |
||||
} |
||||
|
||||
@ -0,0 +1,51 @@ |
||||
{ lib |
||||
, stdenv |
||||
, fetchFromGitHub |
||||
, cmake |
||||
, primesieve |
||||
}: |
||||
|
||||
stdenv.mkDerivation rec { |
||||
pname = "primecount"; |
||||
version = "7.3"; |
||||
|
||||
src = fetchFromGitHub { |
||||
owner = "kimwalisch"; |
||||
repo = "primecount"; |
||||
rev = "v${version}"; |
||||
hash = "sha256-hxnn1uiGSB6XRC7yK+SXTwTsJfjhemWXsMNhhL7Ghek="; |
||||
}; |
||||
|
||||
nativeBuildInputs = [ cmake ]; |
||||
|
||||
buildInputs = [ primesieve ]; |
||||
|
||||
cmakeFlags = [ |
||||
"-DBUILD_LIBPRIMESIEVE=ON" |
||||
"-DBUILD_PRIMECOUNT=ON" |
||||
"-DBUILD_SHARED_LIBS=ON" |
||||
"-DBUILD_STATIC_LIBS=OFF" |
||||
"-DBUILD_TESTS=ON" |
||||
]; |
||||
|
||||
meta = with lib; { |
||||
homepage = "https://github.com/kimwalisch/primecount"; |
||||
description = "Fast prime counting function implementations"; |
||||
longDescription = '' |
||||
primecount is a command-line program and C/C++ library that counts the |
||||
primes below an integer x ≤ 10^31 using highly optimized implementations |
||||
of the combinatorial prime counting algorithms. |
||||
|
||||
primecount includes implementations of all important combinatorial prime |
||||
counting algorithms known up to this date all of which have been |
||||
parallelized using OpenMP. primecount contains the first ever open source |
||||
implementations of the Deleglise-Rivat algorithm and Xavier Gourdon's |
||||
algorithm (that works). primecount also features a novel load balancer |
||||
that is shared amongst all implementations and that scales up to hundreds |
||||
of CPU cores. primecount has already been used to compute several prime |
||||
counting function world records. |
||||
''; |
||||
license = licenses.bsd2; |
||||
inherit (primesieve.meta) maintainers platforms; |
||||
}; |
||||
} |
||||
@ -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,33 +0,0 @@ |
||||
{ lib, stdenv, fetchFromGitHub, cmake, primesieve }: |
||||
|
||||
stdenv.mkDerivation rec { |
||||
pname = "primecount"; |
||||
version = "7.2"; |
||||
|
||||
nativeBuildInputs = [ cmake ]; |
||||
|
||||
buildInputs = [ primesieve ]; |
||||
|
||||
src = fetchFromGitHub { |
||||
owner = "kimwalisch"; |
||||
repo = "primecount"; |
||||
rev = "v${version}"; |
||||
sha256 = "sha256-/Cb/HkD4UQ9gXsRpvRiEuQBoRd0THxNHsBaAAa+CqQo="; |
||||
}; |
||||
|
||||
cmakeFlags = [ |
||||
"-DBUILD_STATIC_LIBS=OFF" |
||||
"-DBUILD_SHARED_LIBS=ON" |
||||
"-DBUILD_TESTS=ON" |
||||
"-DBUILD_PRIMECOUNT=ON" |
||||
"-DBUILD_LIBPRIMESIEVE=ON" |
||||
]; |
||||
|
||||
meta = with lib; { |
||||
description = "Fast prime counting function implementations"; |
||||
homepage = "https://github.com/kimwalisch/primecount"; |
||||
license = licenses.bsd2; |
||||
platforms = platforms.unix; |
||||
maintainers = teams.sage.members; |
||||
}; |
||||
} |
||||
@ -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