Hi!
While trying to answer some post on sage-support I found the following
four problems.
Definitions:
sage: R.<t> = GF(2^4)
sage: P.<x> = R[]
sage: C = [t, t + 1, t^3 + t + 1, t^3 + 1, t^3 + t^2]
sage: p = P(C)
Do you agree that these are bugs?
1)
When doing P?, the documenation of P.__call__ is included. But of
course, P.__call__ is generic, so it doesn't say anything specific.
Wouldn't it be better to include the documentation of
P._element_constructor_ instead?
2)
sage: P?
TESTS:
sage: from sage.rings.polynomial.polynomial_ring import
PolynomialRing_field as PRing sage: R = PRing(QQ, 'x'); R
Univariate Polynomial Ring in x over Rational Field sage:
type(R.gen()) <class
'sage.rings.polynomial.polynomial_element_g
eneric.Polynomial_rational_dense'> sage: R = PRing(QQ, 'x',
sparse=True); R Sparse Univariate Polynomial Ring in x over
Rational Field sage: type(R.gen()) <class
'sage.rings.polynomial
.polynomial_element_generic.Polynomial_generic_sparse_field'>
sage: R = PRing(CC, 'x'); R Univariate Polynomial Ring in x
over
Complex Field with 53 bits of precision sage: type(R.gen())
<class
'sage.rings.polynomial.polynomial_element_generic.Polynom
ial_generic_dense_field'>
etc.
This is not really a documentation.
3)
P._element_constructor_? does not mention that one can call P with a
list of coefficients (as I did above in the definition of the
polynomial p).
4)
sage: SR(p)
BOOM
Cheers,
Simon
--
To post to this group, send an email to [email protected]
To unsubscribe from this group, send an email to
[email protected]
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
