> On Mar 22, 10:42 am, "Joel B. Mohler" <[EMAIL PROTECTED]> wrote: > > This feels just a bit pedantic to me, but I think it might be a bug from > > some > > viewpoint. > > > > I'm looking at the polynomial function quo_rem and I see that it does it's > > own > > coercion manually. This feels a little wrong to me. I think it should go > > through the standard coercion routines. Here's a "bug" that results: > > > > sage: x=ZZ['x'].0 > > sage: y=QQ['x'].0 > > sage: (y+1).quo_rem(1/2*x) > > (2, 1) > > sage: (x+1).quo_rem(1/2*y) > > ... > > <type 'exceptions.TypeError'>: no coercion of this rational to integer > > > > The bug is that I don't see why these two things are treated substantially > > differently. The reason I found this is because the simple "TypeError" > > exception did not provide the usual message about parents being > > mis-matched -- I think this is a bug in itself. > > > > Any comments?
quo_rem was written long before there was any standard coercion system. It makes sense to rewrite it now to use the canonical coercion model. Feel free to do so, or at least add something to trac. William --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://sage.scipy.org/sage/ and http://modular.math.washington.edu/sage/ -~----------~----~----~----~------~----~------~--~---
