From 7c9730bcb62df7cbf8248c5db9a478aac52c60ea Mon Sep 17 00:00:00 2001 From: V3n3RiX Date: Fri, 17 Feb 2023 14:07:47 +0000 Subject: gentoo auto-resync : 17:02:2023 - 14:07:46 --- sci-mathematics/ginac/files/ginac-1.8.6-unicode.patch | 12 ++++++++++++ 1 file changed, 12 insertions(+) create mode 100644 sci-mathematics/ginac/files/ginac-1.8.6-unicode.patch (limited to 'sci-mathematics/ginac/files/ginac-1.8.6-unicode.patch') diff --git a/sci-mathematics/ginac/files/ginac-1.8.6-unicode.patch b/sci-mathematics/ginac/files/ginac-1.8.6-unicode.patch new file mode 100644 index 000000000000..d7e4491f7434 --- /dev/null +++ b/sci-mathematics/ginac/files/ginac-1.8.6-unicode.patch @@ -0,0 +1,12 @@ +diff -r -U3 ginac-1.8.6.orig/ginac/numeric.cpp ginac-1.8.6/ginac/numeric.cpp +--- ginac-1.8.6.orig/ginac/numeric.cpp 2023-02-08 06:02:38.000000000 +0700 ++++ ginac-1.8.6/ginac/numeric.cpp 2023-02-17 16:13:45.137824611 +0700 +@@ -2139,7 +2139,7 @@ + /** The Binomial coefficients. It computes the binomial coefficients. For + * integer n and k and positive n this is the number of ways of choosing k + * objects from n distinct objects. If n is a negative integer, the formula +- * binomial(n,k) == (-1)^k*binomial(k-n-1,k) (if k≥0) ++ * binomial(n,k) == (-1)^k*binomial(k-n-1,k) (if k>=0) + * binomial(n,k) == (-1)^(n-k)*binomial(-k-1,n-k) (otherwise) + * is used to compute the result. */ + const numeric binomial(const numeric &n, const numeric &k) -- cgit v1.2.3