summaryrefslogtreecommitdiff
path: root/sci-mathematics/ginac/files/ginac-1.8.6-unicode.patch
diff options
context:
space:
mode:
Diffstat (limited to 'sci-mathematics/ginac/files/ginac-1.8.6-unicode.patch')
-rw-r--r--sci-mathematics/ginac/files/ginac-1.8.6-unicode.patch12
1 files changed, 12 insertions, 0 deletions
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)