On Nov 6, 7:14 am, Jason Grout wrote:
> What about a[None] returning a? That's a little awkward, I guess.
>
> Thanks,
>
> Jason
I would never think that a[None] would return a, whatever a is! I'd
expect something "empty"...
Andrey
--
You received this message because you are subscribed to the
I don't know any library that supports it natively. Though perhaps one
could pick a lower/upper rational approximation for sqrt(5), say, and
extract some information that way? I never thought about it, though.
My own patch queue is full with polyhedron-related code that has in some
cases been l
On 2012-11-05, Nicolas M. Thiery wrote:
> Hi Marshall, Volker!
>
> During the Sage Days here in Bobo about dynamics, we have been using
> quite some the Polyhedron code. Thanks so much for it! We have a
> couple little suggestions for which I'll create tickets when I have a
> proper Internet
On 11/5/12 11:56 PM, Rob Beezer wrote:
Like Volker, I'd like to keep the matrix dimension checks in the "over
eager" error-checking. While building the class for vector space
morphisms (aka linear transformations), I discovered several bogus
doctests for free module morphisms which were passing
On 11/5/12 7:40 PM, Michael Orlitzky wrote:
On 11/05/2012 05:05 PM, Jason Grout wrote:
Very nice!
In the spirit of Python [1], "There should be one-- and preferably only
one --obvious way to do it.", may I suggest that you pick one indexing
convention (e.g., round or square brackets) and use t
Hi Marshall, Volker!
During the Sage Days here in Bobo about dynamics, we have been using
quite some the Polyhedron code. Thanks so much for it! We have a
couple little suggestions for which I'll create tickets when I have a
proper Internet access.
In the mean time, I have a question: it
