about summary refs log tree commit diff
path: root/pkgs/applications/science/math/primesieve/default.nix
diff options
context:
space:
mode:
Diffstat (limited to 'pkgs/applications/science/math/primesieve/default.nix')
-rw-r--r--pkgs/applications/science/math/primesieve/default.nix37
1 files changed, 0 insertions, 37 deletions
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;
-  };
-}