3 | | {{{ |
4 | | File "sage/rings/polynomial/multi_polynomial_ideal.py", line 604, in __call__ |
5 | | return self.f(self._instance, *args, **kwds) |
6 | | File "sage/rings/polynomial/multi_polynomial_ideal.py", line 2671, in variety |
7 | | V.sort() |
8 | | File "sage/rings/qqbar.py", line 3889, in __cmp__ |
9 | | rcmp = cmp(self.real(), other.real()) |
10 | | File "sage/rings/qqbar.py", line 4529, in __cmp__ |
11 | | return self._sub_(other).sign() |
12 | | File "sage/rings/qqbar.py", line 4864, in sign |
13 | | return self.sign() |
14 | | File "sage/rings/qqbar.py", line 4867, in sign |
15 | | self.exactify() |
16 | | File "sage/rings/qqbar.py", line 3600, in exactify |
17 | | self._set_descr(self._descr.exactify()) |
18 | | File "sage/rings/qqbar.py", line 7849, in exactify |
19 | | left.exactify() |
20 | | File "sage/rings/qqbar.py", line 3600, in exactify |
21 | | self._set_descr(self._descr.exactify()) |
22 | | File "sage/rings/qqbar.py", line 7594, in exactify |
23 | | rv.exactify() |
24 | | File "sage/rings/qqbar.py", line 3600, in exactify |
25 | | self._set_descr(self._descr.exactify()) |
26 | | File "sage/rings/qqbar.py", line 7849, in exactify |
27 | | left.exactify() |
28 | | File "sage/rings/qqbar.py", line 3600, in exactify |
29 | | self._set_descr(self._descr.exactify()) |
30 | | File "sage/rings/qqbar.py", line 7851, in exactify |
31 | | gen = left._exact_field().union(right._exact_field()) |
32 | | File "sage/rings/qqbar.py", line 2362, in union |
33 | | newpol, self_pol, k = pari_nf.rnfequation(my_factor, 1) |
34 | | File "gen.pyx", line 7454, in sage.libs.pari.gen.gen.rnfequation (build/cythonized/sage/libs/pari/gen.c:37964) |
35 | | File "handle_error.pyx", line 90, in sage.libs.pari.handle_error._pari_handle_exception (build/cythonized/sage/libs/pari/handle_error.c:1181) |
36 | | sage.libs.pari.gen.PariError: not enough precomputed primes |
37 | | }}} |
38 | | |
39 | | This is extremely annoying, since apparently the result of the computation was available at that point, and it was only sorting the result which failed. |
| 3 | Originally the computation even resulted in a Pari exception (“not enough precomputed primes”). This no longer occurs (since the pari upgrade from #15767). So the focus of this ticket is now the excessive amount of time required for comparisons, even without an exception. |