I've switched the Sage buildbot to use git, you can see the progress of the
first build here:
http://build.sagemath.org/sage/waterfall
The UGent moufang bulid slave does not have git installed, somebody needs
to fix that. Paul-Olivier Dehaye should be in charge, who knows how to
reach him?
Fu
Hi Ivan,
No worries! I was cc:ed on the ticket, so I already saw that you had posted
an updated version of the spkg.
Everything works again for me.
Thanks,
Anne
On Friday, November 15, 2013 11:00:24 AM UTC-8, Ivan Andrus wrote:
>
> Anne,
>
> I'm really sorry. I meant to get back to you soone
Has anyone else been looking into this?
Where I've gotten:
scipy:
easy fix, just add "-D__ACCELERATE__" to CPPFLAGS
polybori:
this is a phantom bug that I can no longer reproduce (and I don't know
what changed in my environment)
r:
seems less like an issue with r, than with sqlite -- in p
Would it be possible to make this more prominent on the sagemath.org main
site? Especially the new guide and switch to git.
The information there is very out of date and I only found this post after
looking around for quite a while on how to submit code to sage, the
prospect of having to learn
Parallel building is covered here:
http://www.sagemath.org/doc/installation/source.html#general-procedure
The more you do in parallel, the more ram you need obviously.
On Friday, November 15, 2013 9:59:50 PM UTC-5, Darij Grinberg wrote:
>
> Thanks -- though I'd have preferred more about the nu
Thanks -- though I'd have preferred more about the number of CPUs (I
still don't know whether anything in Sage is parallelized).
On Thu, Nov 14, 2013 at 10:42 PM, Volker Braun wrote:
> http://www.sagemath.org/doc/installation/source.html#general-requirements
>
>
> On Thursday, November 14, 2013 1
On Fri, Nov 15, 2013 at 02:43:29PM -0500, Vincent Delecroix wrote:
> Thanks for taking care of it. I would like cartesian products to be
> smarter about iteration... especially when one of the factor is
> infinite. I have a working implementation of the iterator that you can
> use on the sage-combi
Salut Nicolas,
Thanks for taking care of it. I would like cartesian products to be
smarter about iteration... especially when one of the factor is
infinite. I have a working implementation of the iterator that you can
use on the sage-combinat misc repo.
Best,
Vincent
2013/11/15, Nicolas M. Thier
Anne,
I'm really sorry. I meant to get back to you sooner, but your email got lost
in my inbox. Anyway, when you install the sage_mode spkg it should tell you
what to put in your .emacs. You can always install it again if you need to
remember. Anyhow, in this case the directory should be
On Wed, Nov 06, 2013 at 06:41:28PM +0100, Nathann Cohen wrote:
> ...
> a) G.cartesian_product()
> b) G.CartesianProduct() (yes, it has a .cartesian_product method
> c) The global CartesianProduct function
>
> sage: G2=CartesianProduct(G,G)
> sage: G2((1,1))
> [1
Salut Vincent,
On Thu, Nov 14, 2013 at 10:43:19PM -0500, Vincent Delecroix wrote:
> For me it is a bug: the behavior of cartesian_product (not
> CartesianProduct) is not symmetric...
> {{{
> sage: C1 = cartesian_product([FiniteEnumeratedSet('abc'),ZZ])
> The cartesian product of ({'a', 'b'
(and about the [Cc]artesian(_)?[Pp]roduct function, there are some other
issues there
: https://groups.google.com/d/msg/sage-devel/tyAxhqxk3ZI/rff7pTrGIQ4J Of
course I don't want to abusively take the reader's attention off this
symmetry bug, which definitely has to be fixed >_<)
On Friday, No
12 matches
Mail list logo
