Hi Paul
Please see
https://groups.google.com/forum/#!msg/sage-devel/ui9G8kSW-q0/fy_03p7G08UJ
Regards ,
Jan
On 16 May 2014 04:05, paulo lesgaz wrote:
> Hello,
>
> At first, thanks for your great job for the communauty. However, my
> university still uses 32 bits computers.
>
> Can you upload t
Nathan Dunfield wrote:
The optional package ChomP installs cleanly but then does not actually
work on Sage 6.1.1 on OS X Mavericks.
Seems this is fixed in Sage 6.2.
-leif
/pkgs/sage-6.1/local/lib/python2.7/site-packages/sage/interfaces/chomp.pyc
in __call__(self, program, complex, subcomple
Sorry, my original message had a typo. I have observed this only with Sage
6.1.1 on OS X Mavericks not "both platforms".
> The optional package ChomP installs cleanly but then does not actually
> work on Sage 6.1.1 on OS X Mavericks. The specific error I get on both
> platforms is below.
The optional package ChomP installs cleanly but then does not actually work
on Sage 6.1.1 on OS X Mavericks. The specific error I get on both
platforms is below.
Best,
Nathan
sage: from sage.interfaces.chomp import CHomP
sage: T = cubical_complexes.Torus()
sage: CHomP()('homcubes'
Nathann Cohen wrote:
Ah, the @grow_bushy_tail^TM decorator?
Yes. That.
~/sage$ grep "@combinatorial_map" * -R | wc -l
93
To be fair:
$ grep -R "@combinatorial_map" src/sage/ --include \*.py --exclude
combinatorial_map.py | wc -l
84
-leif
--
() The ASCII Ribbon Campaign
/\ Help Cure H
Here's an update on the Sage days in June in Seattle.
We will have a large house near UW June 19 - 30:
http://www.homeaway.com/vacation-rental/p906894
On Fri, Apr 4, 2014 at 2:25 PM, William Stein wrote:
> Hi,
>
> I plan to have basically a long Sage development workshop for the last
> two
2014-05-15 22:22 UTC+02:00, Nathann Cohen :
>> Ah, the @grow_bushy_tail^TM decorator?
>
> Yes. That.
>
> ~/sage$ grep "@combinatorial_map" * -R | wc -l
> 93
>
>> IIRC there were a couple of people complaining about that, but were more
>> or
>> less ignored as well.
>
> Yep
Still time to po
> Ah, the @grow_bushy_tail^TM decorator?
Yes. That.
~/sage$ grep "@combinatorial_map" * -R | wc -l
93
> IIRC there were a couple of people complaining about that, but were more or
> less ignored as well.
Yep
Nathann
--
You received this message because you are subscribed to the Googl
Nathann Cohen wrote:
I would have liked to see you all so fierce when I complained about
the combinatorial_map decorator.
Ah, the @grow_bushy_tail^TM decorator?
IIRC there were a couple of people complaining about that, but were more
or less ignored as well.
-leif
P.S.: Awaiting the @goo
Hell !
> If an method is *extremely* performance critical, one might want to give it
> its own custom cache to avoid as much overhead as possible. I don't think
> the utility cached_function and cached_method can be expected to have
> shining performance for all types of functions and inpu
If an method is *extremely* performance critical, one might want to give it
its own custom cache to avoid as much overhead as possible. I don't think
the utility cached_function and cached_method can be expected to have
shining performance for all types of functions and inputs.
Also, if one nee
Y !!
> It's a potentially valid point that the introduction of the "key" parameter
> might have affected normal operation, but I just checked: it does not.
H... I first thought that fix_to_pos was part of this "key" stuff,
but you seem to consider it something different. My thoughts
On Thursday, May 15, 2014 12:11:31 AM UTC-7, Nathann Cohen wrote:
>
> I would accept the argument of "speed issue", but of course you cannot use
> that one AND defend the "key" parameter, which has an easier workaround
> than my problem here and a higher cost. So it is both or none, see ? :-P
>
On 15 May 2014 15:25, William Stein wrote:
> On Thu, May 15, 2014 at 1:55 AM, Volker Braun
> wrote:
> > Of course I'm not going to say no to free stuff, but hosting your own
> > unlimited number of private repos (and/or a gitolite installation, as we
> do
> > for Sage) is pretty simple ;-)
>
> F
On Thu, May 15, 2014 at 1:55 AM, Volker Braun wrote:
> Of course I'm not going to say no to free stuff, but hosting your own
> unlimited number of private repos (and/or a gitolite installation, as we do
> for Sage) is pretty simple ;-)
>From my perspective there is a little bit more going on, I'm
You can make a caching function that returns a decorator depending on your
condition, that you subsequently apply to your function:
def conditional_caching(condition):
def decorator(f):
cache = {}
def cached_f(n):
if n in cache:
return cache[n]
On 15 May 2014 13:36, Dima Pasechnik wrote:
> And, by the way, should Sage get a DOI?
>
See http://en.wikipedia.org/wiki/Digital_object_identifier if you, like me,
had forgotten what a DOI might be...
> This looks doable, only one probably needs to be an "Owner" of
> https://github.com/sagemat
And, by the way, should Sage get a DOI?
This looks doable, only one probably needs to be an "Owner" of
https://github.com/sagemath/sage
and not just "team member".
I suggest we look into this when 6.3 is released, cause the process
might actually need a release to be made to get a DOI, i.e. it's
Yoo !
> Well, that's essentially what I suggested earlier modulo using
>
> _a_cached = cached_function(_a_noncached)
True, true. I just liked the trick of having only one version of the
function and calling .f() directly ^^;
> So, depending on how smart the Python compiler is (...), you
Nathann Cohen wrote:
> The answer is yes, and the solution is indeed wrapping as proposed,
> but this can be done with less code repetition than I have seen on this
> thread up to now:
Argg ! Of course !!! Well thought !!!
Well, that's essentially what I suggested earlier modulo using
_a_
> How do you know what the user considers "small" and "large"?
In my case it is straightforward, but I could want to use this feature
is my own personal code anyway.
> And if you really need to decide whether to cache or not based on the
> arguments, you have to manage your own cache.
Well, I h
How do you know what the user considers "small" and "large"? It depends on
what the user is trying to do. The user can easily avoid caching by calling
the .f attribute.
And if you really need to decide whether to cache or not based on the
arguments, you have to manage your own cache. Using som
On 05/15/2014 10:55 AM, Volker Braun wrote:
> Of course I'm not going to say no to free stuff, but hosting your own
> unlimited number of private repos (and/or a gitolite installation, as we do
> for Sage) is pretty simple ;-)
Bsst! Not so loud! ;-)
If people knew how easy it is to share gi
> It is not. The problem is your 4 pages of if/else branches with
interspersed
> computations. All other problems that you are encountering are a corollary
> of that one.
How can you only cache the output of "small" values (the most used in any
recursion) and not the larger ones ? That's the use c
On Thursday, May 15, 2014 8:11:31 AM UTC+1, Nathann Cohen wrote:
>
> On the other hand the best for me would be that you would all come to your
> senses and accept the idea that filtering what you want to cache is a good
> idea.
>
It is not. The problem is your 4 pages of if/else branches with
Of course I'm not going to say no to free stuff, but hosting your own
unlimited number of private repos (and/or a gitolite installation, as we do
for Sage) is pretty simple ;-)
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from
On 15 May 2014 08:31, Jan Groenewald wrote:
> Hi
>
> There is also bitbucket.org, which had unlimited private repositories
> since the start. Instead limitation is on number of collaborators. However,
> academic accounts do not have that limitation... registering with an
> academic email address
It may be possible to test newer package versions in patchbot without
official ticket by forking Sage on github, installing the package in the
local
Sage, publish the changed branch on github, and use that branch as
base_repo with patchbot. This may work also with unsafe tickets because
the clonin
Hi
There is also bitbucket.org, which had unlimited private repositories since
the start. Instead limitation is on number of collaborators. However,
academic accounts do not have that limitation... registering with an
academic email address should activate this automatically.
https://confluence.a
in case you didn't hear:
https://github.com/blog/1840-improving-github-for-science#Awesome_science_happening_on_Github
"we've created a discount where individual academic
researchers can receive a free micro plan with 5 private repos, while
research groups can receive a free silver plan with 20 re
> No, you haven't read what I wrote. In English, "is possible" asks for a
> boolean outcome, so is_possible() shall return a boolean.
>
> Here is again what I originally wrote, maybe you'll read it this time:
Oh. Well it does work, but if I need to introduce a specific wrapper function
to be ca
31 matches
Mail list logo