On Tue, Dec 7, 2010 at 9:18 PM, Dan Drake wrote:
> Count me as another person really excited about the automatic trac
> ticket test bot. It's great work. Good job, Robert!
>
> First, my proposal: we should call that bit of software "patchbot",
> since it automatically deals with patches; the other
On Tue, 07 Dec 2010 at 09:20PM -0800, William Stein wrote:
> On Tuesday, December 7, 2010, Dan Drake wrote:
> > First, my proposal: we should call that bit of software "patchbot",
> > since it automatically deals with patches; the other buildbot
> > (http://build.sagemath.org/sage/) takes tarballs
On Tuesday, December 7, 2010, Dan Drake wrote:
> Count me as another person really excited about the automatic trac
> ticket test bot. It's great work. Good job, Robert!
>
> First, my proposal: we should call that bit of software "patchbot",
> since it automatically deals with patches; the other b
On Tuesday, December 7, 2010, Dan Drake wrote:
> Count me as another person really excited about the automatic trac
> ticket test bot. It's great work. Good job, Robert!
>
> First, my proposal: we should call that bit of software "patchbot",
> since it automatically deals with patches; the other b
Count me as another person really excited about the automatic trac
ticket test bot. It's great work. Good job, Robert!
First, my proposal: we should call that bit of software "patchbot",
since it automatically deals with patches; the other buildbot
(http://build.sagemath.org/sage/) takes tarballs
Sorry, I didn't know about that. I searched through Google but I got
nothing...
Thank you.
On Dec 7, 5:35 pm, Jason Grout wrote:
> On 12/7/10 6:58 PM, Eviatar wrote:
>
> > Hello,
>
> > It seems Degree-Radian conversion doesn't exist in Sage. Of course, it
> > can easily be performed by multiplyi
Hi,
On Wed, Dec 8, 2010 at 1:11 PM, mhs wrote:
> Now I think it really is a bug. Is there already a ticket for this?
I don't think so. Please open a ticket to track the issue you reported
and ensure you provide a link to the current email thread. Thank you
for your bug report.
--
Regards
Minh
Hi Rob,
On Wed, Dec 8, 2010 at 10:49 AM, Rob Beezer wrote:
> I think it is important that a graph has hundreds of methods, since
> Sage can do hundreds of things to a graph. Tab-completion is great,
> and more robust wild-cards on tab-completion would be even better
> (isn't this one of Jason's
On 12/7/10 8:06 PM, Minh Nguyen wrote:
Hi Jason,
On Wed, Dec 8, 2010 at 10:26 AM, Jason Grout
wrote:
I think maybe I was too brief in my suggestion to be clear. I would favor
refactoring the code out to a spanning_tree.py(x) file. My point was that
your propositions seemed to indicate that
Even stranger: The same happens for Graph as well.
It seems constructing an empty graph or digraph with
G=Graph(multiple_edges=True)
or
G=Graph([],multiple_edges=True)
does not set the property of being a multi-graph.
E.g. doing
G
afterwards gives the information
Graph on 0 vertices
inste
Hi Jason,
On Wed, Dec 8, 2010 at 10:26 AM, Jason Grout
wrote:
> I think maybe I was too brief in my suggestion to be clear. I would favor
> refactoring the code out to a spanning_tree.py(x) file. My point was that
> your propositions seemed to indicate that the graph class methods that would
>
Hi Nathann,
On Wed, Dec 8, 2010 at 4:22 AM, Nathann Cohen wrote:
> Would there be any way to ask Sphinx to produce one page per method
> instead of having them all on one page ?
I'm not aware of any way to get Sphinx to do what you're describing.
Essentially you want something similar to how the
On 12/7/10 6:58 PM, Eviatar wrote:
Hello,
It seems Degree-Radian conversion doesn't exist in Sage. Of course, it
can easily be performed by multiplying by pi/180 (or its reciprocal),
but a function is more convenient. The Python has it in the math
module, but it will not work with symbolics. Mat
Hello,
It seems Degree-Radian conversion doesn't exist in Sage. Of course, it
can easily be performed by multiplying by pi/180 (or its reciprocal),
but a function is more convenient. The Python has it in the math
module, but it will not work with symbolics. Mathematica has the
Degree constant, (ht
I think it is important that a graph has hundreds of methods, since
Sage can do hundreds of things to a graph. Tab-completion is great,
and more robust wild-cards on tab-completion would be even better
(isn't this one of Jason's favorite suggestions?).
That said, not only is graph.py so big that
Seems like I didn't dig deep enough.
So it isn't actively developed by the TACC
anymore, it is given to the community to
maintain and take over development.
It only provides f77blas. I guess it would
be possible to create a cblas interface using
f2c but it is not really something anyone would
wan
On 12/7/10 9:34 AM, Minh Nguyen wrote:
Hi Jason,
On Wed, Dec 8, 2010 at 12:15 AM, Jason Grout
wrote:
I worry that it is too confusing to have a min_spanning_tree function in the
documentation of the spanning_tree module that is different than the
min_spanning_tree method of a graph (different
Hi,
I encountered a strange behaviour of the add_edges method for DiGraphs
(using SAGE 4.5.1). Perhaps this is intended behaviour, but as it
seems quiet odd to me I would like to hear the opinion of more
experienced (di)graph-users. Maybe this is a real bug...
If I define a looped, multi-edge emp
-Original Message-
From: sage-devel@googlegroups.com on behalf of Jason Grout
Sent: Wed 12/8/2010 2:19 AM
To: sage-devel@googlegroups.com
Subject: [sage-devel] Re: Goto Blas.
On 12/7/10 12:05 AM, Thierry Dumont wrote:
> The Goto Blas are now under BSD license.
>
> http://www.tacc.utexas.e
I read this thread once and I will have to think about this subject
again before coming up with anything interesting. One thing though
:
Would there be any way to ask Sphinx to produce one page per method
instead of having them all on one page ? Having such a long page
containing all our metho
Le 07/12/2010 14:22, Jason Grout a écrit :
On 12/7/10 12:05 AM, Thierry Dumont wrote:
The Goto Blas are now under BSD license.
http://www.tacc.utexas.edu/tacc-projects/gotoblas2/
This could be a replacement for Atlas (these blas are supposed to be
faster).
According to the developer's wikipe
> Goodies like algorithms for randomized spanning tree constructions
> should go into another module like sage/graphs/trees.pyx. I feel this
> is really a time to declare a serious moratorium on adding new methods
> to any of the following modules, unless there is a good reason to do
> so:
>
> * sa
Hi Jason,
On Wed, Dec 8, 2010 at 12:15 AM, Jason Grout
wrote:
> I worry that it is too confusing to have a min_spanning_tree function in the
> documentation of the spanning_tree module that is different than the
> min_spanning_tree method of a graph (different interface, more checks,
> etc.).
Th
On 12/7/10 12:05 AM, Thierry Dumont wrote:
The Goto Blas are now under BSD license.
http://www.tacc.utexas.edu/tacc-projects/gotoblas2/
This could be a replacement for Atlas (these blas are supposed to be
faster).
According to the developer's wikipedia page [1], Kazushige Gotō joined
Microso
On 12/7/10 12:05 AM, Thierry Dumont wrote:
The Goto Blas are now under BSD license.
http://www.tacc.utexas.edu/tacc-projects/gotoblas2/
This could be a replacement for Atlas (these blas are supposed to be
faster).
How active is the project? The second sentence in the above page is:
"This pr
http://ask.sagemath.org/question/229/when-does-notebook-save-worksheets-persistently
Has anyone else ever seen this? Hopefully the OP will say what
version is being used. Anyway, this is the first time I've heard of
this, but I do remember that several of our participants in the summer
workshop
On 12/7/10 5:25 AM, Minh Nguyen wrote:
Hi Robert,
On Tue, Dec 7, 2010 at 9:56 PM, Robert Miller wrote:
I think you can accomplish all these goals without "unbloating"
graphs.
Of course it can be done without unbloating the various graph classes.
I think Sage users have gotten used to (ple
On 12/7/10 4:41 AM, Robert Bradshaw wrote:
That's an interesting idea, but it's not easy to expose that
information. The way it works is that a build slave requests a list of
tickets, rates them according to its own internal settings (which may
be different for each bot), and then starts on a tic
On Sat, Dec 4, 2010 at 12:18 PM, Niles wrote:
>
>> > On Fri, Dec 3, 2010 at 11:38 AM, Robert Bradshaw
>> > > Apply foo.pyx, foo2.pyx
>>
>> > I mean of course foo.patch, foo2.patch :).
>>
>> > > This will "reset" the patch list at that point, any added patches will
>> > > get (semi-intellegently
Hi Robert,
On Tue, Dec 7, 2010 at 9:56 PM, Robert Miller wrote:
> I think you can accomplish all these goals without "unbloating"
> graphs.
Of course it can be done without unbloating the various graph classes.
> I think Sage users have gotten used to (please feel free to
> correct me on this,
On Tue, Dec 7, 2010 at 2:41 AM, Robert Bradshaw
wrote:
> On Mon, Dec 6, 2010 at 8:43 PM, Niles wrote:
>>
>>
>> On Dec 6, 10:53 pm, Jason Grout wrote:
>>> Robert (and whoever else is working on the buildbot [1]),
>>>
>>> First of all, THANK YOU!!! This is amazing! I love how it is hooked up
>>>
I'm not sure it is a good idea to *remove* the methods from the object
of which they are a natural function. I've seen this argument many
times before, and I really like this as an organizing method.
Everything else you say seems like a good idea to me: improving the
documentation, having the actua
On Mon, Dec 6, 2010 at 8:43 PM, Niles wrote:
>
>
> On Dec 6, 10:53 pm, Jason Grout wrote:
>> Robert (and whoever else is working on the buildbot [1]),
>>
>> First of all, THANK YOU!!! This is amazing! I love how it is hooked up
>> to show the status on trac.
>
> Indeed -- THANKS ! ! !
Your wel
33 matches
Mail list logo
