Merge pull request #294869 from atorres1985-contrib/primecount

primecount, primesieve: refactor

2 files changed, 0 insertions, 93 deletions

diff --git a/pkgs/applications/science/math/primecount/default.nix b/pkgs/applications/science/math/primecount/default.nix
deleted file mode 100644
index c3e2565989ed..000000000000
--- a/pkgs/applications/science/math/primecount/default.nix
+++ /dev/null
@@ -1,56 +0,0 @@
-{ lib
-, stdenv
-, fetchFromGitHub
-, cmake
-, primesieve
-}:
-
-stdenv.mkDerivation rec {
-  pname = "primecount";
-  version = "7.10";
-
-  src = fetchFromGitHub {
-    owner = "kimwalisch";
-    repo = "primecount";
-    rev = "v${version}";
-    hash = "sha256-z7sHGR6zZSTV1PbL0WPGHf52CYQ572KC1yznCuIEJbQ=";
-  };
-
-  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";
-    changelog = "https://github.com/kimwalisch/primecount/blob/v${version}/ChangeLog";
-    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;
-  };
-}
diff --git a/pkgs/applications/science/math/primesieve/default.nix b/pkgs/applications/science/math/primesieve/default.nix
deleted file mode 100644
index 4d3c06bd9287..000000000000
--- a/pkgs/applications/science/math/primesieve/default.nix
+++ /dev/null
@@ -1,37 +0,0 @@
-{ lib
-, stdenv
-, fetchFromGitHub
-, cmake
-}:
-
-stdenv.mkDerivation rec {
-  pname = "primesieve";
-  version = "12.1";
-
-  src = fetchFromGitHub {
-    owner = "kimwalisch";
-    repo = "primesieve";
-    rev = "v${version}";
-    hash = "sha256-AHl2GfZ1oJ8ZyjJzvg10AqN7TA7HFZ+qa6N2v51Qa78=";
-  };
-
-  nativeBuildInputs = [ cmake ];
-
-  meta = with lib; {
-    homepage = "https://primesieve.org/";
-    changelog = "https://github.com/kimwalisch/primesieve/blob/v${version}/ChangeLog";
-    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;
-  };
-}