@@ -31,15 +31,14 @@ def to_fast_pickable(l):
31
31
It is converted to a tuple consisting of
32
32
- codes referring to the polynomials
33
33
- list of conversions of nodes.
34
- The nodes are sorted, that
35
- n occurs before n.else_branch(), n.then_branch()
36
- Nodes are only listed, if they are not constant.
34
+ The nodes are sorted, so that n occurs before n.else_branch(), n.then_branch()
35
+ nodes are only listed, if they are not constant.
37
36
38
37
A node is converted in this way:
39
- 0 -> 0
40
- 1 -> 1
41
- if_then_else(v,t,e) -> (v, index of then branch +2, index of else branch +2)
42
- The shift of +2 is for the constant values implicitly contained in the list.
38
+ 0 -> 0
39
+ 1 -> 1
40
+ if_then_else(v,t,e) -> (v, index of then branch +2, index of else branch +2)
41
+ the shift of +2 is for the constant values implicitly contained in the list.
43
42
Each code c refers to the c-2-th position in the conversion list, if c >=2, else to
44
43
the corresponding Boolean constant if c in {0, 1}
45
44
@@ -272,16 +271,17 @@ def groebner_basis_first_finished(I, *l):
272
271
273
272
OUTPUT:
274
273
275
- - tries to compute groebner_basis(I, **kwd) for kwd in l
274
+ - tries to compute `` groebner_basis(I, **kwd)`` for kwd in l
276
275
- returns the result of the first terminated computation
277
276
278
277
EXAMPLES::
279
278
280
279
sage: from sage.rings.polynomial.pbori.PyPolyBoRi import Ring
281
280
sage: r=Ring(1000)
282
281
sage: ideal = [r.variable(1)*r.variable(2)+r.variable(2)+r.variable(1)]
283
- sage: #groebner_basis_first_finished(ideal, dict(heuristic=True), dict(heuristic=False))
284
- [x(1), x(2)]
282
+ sage: from sage.rings.polynomial.pbori.parallel import groebner_basis_first_finished
283
+ sage: groebner_basis_first_finished(ideal, dict(heuristic=True), dict(heuristic=False))
284
+ [x1, x2]
285
285
"""
286
286
if not I :
287
287
return []
0 commit comments