Files
Dark Steveneq 646b892680
Some checks failed
Periodic Merges (6h) / master → staging-nixos (push) Failing after 12m50s
Periodic Merges (6h) / master → staging-next (push) Failing after 12m54s
Periodic Merges (24h) / merge-base(master,staging) → haskell-updates (push) Failing after 11m54s
Periodic Merges (6h) / staging-next → staging (push) Failing after 12m13s
Periodic Merges (24h) / staging-next-25.05 → staging-25.05 (push) Failing after 13m24s
Periodic Merges (24h) / release-25.05 → staging-next-25.05 (push) Failing after 14m28s
push sheeet
2025-10-09 14:15:47 +02:00

41 lines
1.2 KiB
Nix

{
buildOctavePackage,
lib,
fetchurl,
mpfr,
}:
buildOctavePackage rec {
pname = "interval";
version = "3.2.1";
src = fetchurl {
url = "mirror://sourceforge/octave/${pname}-${version}.tar.gz";
sha256 = "sha256-OOUmQnN1cTIpqz2Gpf4/WghVB0fYQgVBcG/eqQk/3Og=";
};
propagatedBuildInputs = [
mpfr
];
meta = {
homepage = "https://gnu-octave.github.io/packages/interval/";
license = lib.licenses.gpl3Plus;
maintainers = with lib.maintainers; [ KarlJoad ];
description = "Interval arithmetic to evaluate functions over subsets of their domain";
longDescription = ''
The interval package for real-valued interval arithmetic allows one to
evaluate functions over subsets of their domain. All results are verified,
because interval computations automatically keep track of any errors.
These concepts can be used to handle uncertainties, estimate arithmetic
errors and produce reliable results. Also it can be applied to
computer-assisted proofs, constraint programming, and verified computing.
The implementation is based on interval boundaries represented by
binary64 numbers and is conforming to IEEE Std 1788-2015, IEEE standard
for interval arithmetic.
'';
};
}