On Sep 9, 2008, at 7:50 PM, Nick Alexander wrote:
>
> {{{
> sage: ZZ['x'].0.reverse()
> 1
> sage: ZZ['x'].0.reverse().reverse()
> 1
> }}}
>
> I think that reverse is it's own inverse. Does anyone else agree?
> (The issue is probably just reversing the coefficient list and not
> considering degre
Hi, Mike,
On Sep 9, 2008, at 9:34 PM, Mike Hansen wrote:
>> What's the difference between "==" and "is" (or, more to the point:
>> where is this discussed)?
>
> This is a Python thing as "==" is equality testing and "is" is memory
> address testing. For example,
Thanks for the quick tutorial;
Hi Justin,
> What's the difference between "==" and "is" (or, more to the point:
> where is this discussed)?
This is a Python thing as "==" is equality testing and "is" is memory
address testing. For example,
sage: a = 2
sage: b = 2
sage: a == b
True
sage: id(a)
54737440
sage: id(b)
54735856
s
On Sep 9, 2008, at 4:36 PM, Jason Merrill wrote:
> On Sep 9, 6:35 pm, Justin Walker <[EMAIL PROTECTED]> wrote:
>>
[snip]
>> I can't tell if this is just an artifact of some funky debugging
>> interaction (am I debugging the debugger?), or whether this is really
>> where the code goes.
>>
>> Anyon
On Sep 9, 2008, at 7:25 PM, Jason Grout wrote:
>
> Jason Merrill wrote:
>> On Sep 9, 6:35 pm, Justin Walker <[EMAIL PROTECTED]> wrote:
>>> Hi, all,
>>>
>> There may be a more pythonic way to do this--I'm just trying to
>> translate something I saw in Ruby. I think I've seen at least one
>> pers
Hey, Mike,
Thanks for this...
On Sep 9, 2008, at 3:42 PM, Mike Hansen wrote:
> I'm not sure about the other stuff, but you should do "is None"
> instead of "== None" since your times are so low.
>
> sage: a = 2
> sage: timeit("a == None")
> 625 loops, best of 3: 420 µs per loop
> sage: timeit("
{{{
sage: ZZ['x'].0.reverse()
1
sage: ZZ['x'].0.reverse().reverse()
1
}}}
I think that reverse is it's own inverse. Does anyone else agree?
(The issue is probably just reversing the coefficient list and not
considering degrees.) Thanks for opening tickets mabshoff.
Nick
--~--~-~-
On Sep 9, 7:27 pm, Jason Grout <[EMAIL PROTECTED]> wrote:
> David Harvey wrote:
>
> > On Sep 9, 2008, at 10:20 PM, mabshoff wrote:
>
> >>> Could a ticket be opened?
> >> #4095 it is.
>
> > You all know what this means.
>
> ooh, ooh...it's still open! /me thinks really hard for a bug :).
I
David Harvey wrote:
>
> On Sep 9, 2008, at 10:20 PM, mabshoff wrote:
>
>>> Could a ticket be opened?
>> #4095 it is.
>
> You all know what this means.
ooh, ooh...it's still open! /me thinks really hard for a bug :).
Jason
--~--~-~--~~~---~--~~
To post t
Jason Merrill wrote:
> On Sep 9, 6:35 pm, Justin Walker <[EMAIL PROTECTED]> wrote:
>> Hi, all,
>>
> There may be a more pythonic way to do this--I'm just trying to
> translate something I saw in Ruby. I think I've seen at least one
> person define an @cache decorator somewhere on the web.
I beli
On Sep 9, 2008, at 10:20 PM, mabshoff wrote:
>> Could a ticket be opened?
>
> #4095 it is.
You all know what this means.
david
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email
On Sep 9, 7:13 pm, Nick Alexander <[EMAIL PROTECTED]> wrote:
> This is double plus not good.
>
> {{{
> sage: GF(109)['x', 'y'](-10)
> -10
> sage: GF(109)['x'](-10)
> 99
>
> }}}
>
> Could a ticket be opened?
#4095 it is.
> Nick
Cheers,
Michael
--~--~-~--~~~---~--~-
This is double plus not good.
{{{
sage: GF(109)['x', 'y'](-10)
-10
sage: GF(109)['x'](-10)
99
}}}
Could a ticket be opened?
Nick
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
On Sep 9, 6:35 pm, Justin Walker <[EMAIL PROTECTED]> wrote:
> Hi, all,
>
> Whilst looking at some code, I noticed that a computation was being
> repeated on each call, although the inputs to the computation never
> changed (these were values used to define an instance of a class). I
> decid
The wiki page for the Youth Hostel accomodation in Nancy is on-line:
http://wiki.sagemath.org/Days_10_Youth_Hostel_Page
Please sign up before september 16, by editing your name and dates on
it, so we can make the booking soon enough.
Cheers,
Clément
Robert Bradshaw a écrit :
> On Tue, 9 Sep 2
Hi Justin,
I'm not sure about the other stuff, but you should do "is None"
instead of "== None" since your times are so low.
sage: a = 2
sage: timeit("a == None")
625 loops, best of 3: 420 µs per loop
sage: timeit("a is None")
625 loops, best of 3: 143 ns per loop
--Mike
--~--~-~--~---
Hi, all,
Whilst looking at some code, I noticed that a computation was being
repeated on each call, although the inputs to the computation never
changed (these were values used to define an instance of a class). I
decided to cache the value and return it rather than recomputing it.
To s
On Tue, Sep 9, 2008 at 2:59 PM, John Cremona <[EMAIL PROTECTED]> wrote:
>
> Is there a difference between doctests in a .py and .pyx file? I put
> the exact same doctest into a .py file where it runs fine, and in a
> .pyx file where it goes into an infinite recursion and then crashes.
> The funct
Is there a difference between doctests in a .py and .pyx file? I put
the exact same doctest into a .py file where it runs fine, and in a
.pyx file where it goes into an infinite recursion and then crashes.
The function begin tested is recursive (but in the doctest example it
does not loop endless
Hi,
maybe there's an easy fix for #4090 (the polybori / OS X 10.4 issue).
It is visible only for Darwin, and even then do no harm to OS X 10.5.
But please test ...
For more info see the trac entry.
Cheers,
gsw
On 9 Sep., 20:37, mabshoff <[EMAIL PROTECTED]> wrote:
> On Sep 9, 11:29 am, mabshoff
Ah, it is because I was trying to get an Ada compiler working and that
copy of gcc was in my path. Sorry about that. I am rebuilding rc1
now.
-M. Hampton
On Sep 9, 12:47 pm, mabshoff <[EMAIL PROTECTED]> wrote:
> On Sep 9, 8:16 am, mhampton <[EMAIL PROTECTED]> wrote:
>
>
>
> > I seem to be get
Ooops I only got as far as: make sure you're using better than gcc
4.0.0! I Didn't read the small print.
I have Xcode 2.2.1 mea culpa.
Component versions
Xcode IDE: 656.0
Xcode Core: 660.0
ToolSupport: 651.0
On Sep 9, 7:58 am, "Georg S. Weber" <[EMAIL PROTECTED]>
wrote:
> Looks like we're gett
On Tue, Sep 9, 2008 at 11:50 AM, mabshoff <[EMAIL PROTECTED]> wrote:
>
>
>
> > checking the number of available CPUs... 1
> > checking the number of available CPUs... 1
> > checking for x86 cpuid 0x0 output... unknown
> > checking for the processor vendor... Unknown
> > 262144
> > 32768
> > secon
On Tue, 9 Sep 2008, Martin Albrecht wrote:
>
>> I'll update the wiki to broadcast this proposition to people outside of
>> sage-devel.
>
> Thanks! Shall we say: we give everyone until the September 16 to 'sign up' on
> the Wiki (on a to-be-created page). If we feel that we achieved a critical
> m
2008/9/9 mabshoff <[EMAIL PROTECTED]>:
>
>
>
> On Sep 9, 12:05 pm, "John Cremona" <[EMAIL PROTECTED]> wrote:
>> 2008/9/9 mabshoff <[EMAIL PROTECTED]>:
>>
>> > You don't need to add the three dots everywhere since we really don't
>> > want to wipe out low order digits just for the fun of it. The ".
On Sep 9, 12:05 pm, "John Cremona" <[EMAIL PROTECTED]> wrote:
> 2008/9/9 mabshoff <[EMAIL PROTECTED]>:
>
> > You don't need to add the three dots everywhere since we really don't
> > want to wipe out low order digits just for the fun of it. The "..."
> > means "match anything", so if only the la
2008/9/9 mabshoff <[EMAIL PROTECTED]>:
> You don't need to add the three dots everywhere since we really don't
> want to wipe out low order digits just for the fun of it. The "..."
> means "match anything", so if only the last digit or two are different
> replace them by "..." - there is no need t
On Sep 9, 10:12 am, "Georg S. Weber" <[EMAIL PROTECTED]>
wrote:
> build error
> on my PPC PowerBook Mac OS X 10.4 / Xcode 2.4.1 in
> libm4ri-20080904
> (I had replaced the PolyBoRi spkg with the one from Sage 3.1.1 in
> order to get this far ... but still, after almost 10 hours,
> the PPC box d
On Sep 9, 8:16 am, mhampton <[EMAIL PROTECTED]> wrote:
> I seem to be getting somewhat different errors when building
> gmp-4.2.2.p1.fake. Here's a snippet, I can put the log online if it
> helps:
>
> tmp-add_n.s:213:Invalid mnemonic 'movl'
> tmp-add_n.s:215:Invalid mnemonic 'andl'
> tmp-add_n.
On Sep 9, 7:36 am, Jason Merrill <[EMAIL PROTECTED]> wrote:
> On Sep 9, 5:22 am, mabshoff <[EMAIL PROTECTED]> wrote:
>
> > Arg, I know what is wrong and it was a dumb mistake of mine. The spkg
> > at
>
> >http://sage.math.washington.edu/home/mabshoff/release-cycles-3.1.2/rc...
>
> > fixes the is
On Sep 9, 7:02 am, "John Cremona" <[EMAIL PROTECTED]> wrote:
> Build report on the second 3.1.2.rc1:
Hi John,
> On 64-bit Suse, all ok and all tests pass.
>
> On 32-bit ubuntu (): build ok, some test failures:
>
> sage -t devel/sage/sage/stats/hmm/chmm.pyx
> sage -t devel/sa
On Sep 9, 4:57 am, "Georg S. Weber" <[EMAIL PROTECTED]>
wrote:
> Sigh, it seems that we have (had) two different build errors here.
> One directly after "Done installing PolyBoRi.", which was healed by
> updating to the .p4 polybori 0.5 spkg.
> The other error seems to be OS X specific and occur
On Sep 9, 11:29 am, mabshoff <[EMAIL PROTECTED]> wrote:
> On Sep 9, 4:08 am, "Georg S. Weber" <[EMAIL PROTECTED]>
> wrote:
>
>
>
> > sorry,
> > but the "polybori-05rc.p4.spkg" you pointed to (http://
> > sage.math.washington.edu/home/mabshoff/release-cycles-3.1.2/rc... )
> > throws exactly the s
On Sep 9, 4:08 am, "Georg S. Weber" <[EMAIL PROTECTED]>
wrote:
> sorry,
> but the "polybori-05rc.p4.spkg" you pointed to (http://
> sage.math.washington.edu/home/mabshoff/release-cycles-3.1.2/rc... )
> throws exactly the same build error as before:
>
> ...
> /usr/bin/libtool: unknown option char
> I'll update the wiki to broadcast this proposition to people outside of
> sage-devel.
Thanks! Shall we say: we give everyone until the September 16 to 'sign up' on
the Wiki (on a to-be-created page). If we feel that we achieved a critical
mass by then we go ahead and book it.
Thoughts?
Mart
On Mon, Sep 8, 2008 at 3:39 AM, Martin Albrecht
<[EMAIL PROTECTED]> wrote:
>
> Hi there,
>
> Sage Days 10 is coming up
>
> http://wiki.sagemath.org/days10
>
> and it seems about time to organise some accommodation. According to
>
> http://www.ot-nancy.fr/uk/centre_historique/index.php
>
> I see
Hi,
I have called the Youth hostel "Un petit coin de Paradis" that Martin
pointed out.
They only have 2 individual rooms that they don't usually book in advance.
However, the dorms are rather small: several of 3 to 4 bedrooms, and a
few larger ones.
The cost is 14 euros/night, including bed-she
hi! Michael,
It(CPU overheating) could be the problem as I was running some apps on
the host and guest when this compilation was taking place. I will try
it again without running any other applications.
Thanks,
Rajanikanth
On Mon, Sep 8, 2008 at 10:36 PM, mabshoff <[EMAIL PROTECTED]> wrote:
>
build error
on my PPC PowerBook Mac OS X 10.4 / Xcode 2.4.1 in
libm4ri-20080904
(I had replaced the PolyBoRi spkg with the one from Sage 3.1.1 in
order to get this far ... but still, after almost 10 hours,
the PPC box didn't even get near the sage-3.1.2.rc1.spkg ... but the
error seems to be PPC
On Tue, Sep 9, 2008 at 6:20 AM, Georg S. Weber
<[EMAIL PROTECTED]> wrote:
>
> Oops,
> several misunderstandings, and perhaps on my side, too.
>
> First of all: my intention is to lower the current overall complexity,
> certainly not to increase it ...
>
> My understanding is that "everything" that
> The last one is this:
>
>
> **
> File "/home/john/sage-3.1.2.rc1/tmp/matrix_real_double_dense.py", line 493:
>sage: b = e * v
> Exception raised:
>Traceback (most recent call last):
> File "/home/john/sage-3.1.2.rc1/local/lib/python2.5/doctest
On Sep 9, 2008, at 2:30 AM, Martin Albrecht wrote:
>
> On Tuesday 09 September 2008, William Stein wrote:
>>> On a related note, recently I wrote a simple loop that went
>>> something
>>> like this:
>>>
>>> while abs(err) < 1e-6:
>>> ...
>>>
>>> The most expensive part of the operation, by
>> Since this is so short, in practice there is probably no need to
>> define the function is_constant.
No! This function declares intent, and that is always valuable.
Nick
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To
I seem to be getting somewhat different errors when building
gmp-4.2.2.p1.fake. Here's a snippet, I can put the log online if it
helps:
tmp-add_n.s:213:Invalid mnemonic 'movl'
tmp-add_n.s:215:Invalid mnemonic 'andl'
tmp-add_n.s:218:Invalid mnemonic 'call'
tmp-add_n.s:221:Invalid mnemonic 'negl'
yeah, but I have already found the problem, Magma does what my program
does in a different way, so it gets a different result
On Sep 8, 1:43 am, Willem Jan Palenstijn <[EMAIL PROTECTED]> wrote:
> On Sun, Sep 07, 2008 at 10:47:59PM -0700, cesarnda wrote:
>
> > I do the following in cython:
>
> >
On Sep 9, 5:22 am, mabshoff <[EMAIL PROTECTED]> wrote:
> Arg, I know what is wrong and it was a dumb mistake of mine. The spkg
> at
>
> http://sage.math.washington.edu/home/mabshoff/release-cycles-3.1.2/rc...
>
> fixes the issue. My apologies, it seems that everything that can go
> wrong will go w
Build report on the second 3.1.2.rc1:
On 64-bit Suse, all ok and all tests pass.
On 32-bit ubuntu (): build ok, some test failures:
sage -t devel/sage/sage/stats/hmm/chmm.pyx
sage -t devel/sage/sage/stats/hmm/hmm.pyx
sage -t devel/sage/sage/schemes/elliptic_curves/pe
Oops,
several misunderstandings, and perhaps on my side, too.
First of all: my intention is to lower the current overall complexity,
certainly not to increase it ...
My understanding is that "everything" that a new spkg "foo" adds to
the current Sage installation
that it is added too, will be do
Hi,
> http://www.mathworks.com/support/faq/mupad.html?s_cid=0908_depa_mupadfaq_219534&s_v1=1-73N6RL_0.582110014
> This is amazing. I think that it means that if the Mupad-combinat
> group hadn't switched from Mupad to Sage, they would be switching to
> Matlab in the near future, which c
Hi,
even if you have such a loop;
while x > 1e-6:
pass
it will be preparsed to
while x > RealNumber('1e-6'):
pass
and thus 1e-6 will be regenerated in every iteration.
However, in .py files this shouldn't be an issue.
I suppose you knew what I just wrote already, but it is sometimes wo
2008/9/9 Martin Albrecht <[EMAIL PROTECTED]>
>
> > I had thought that the job of not repeatedly evaluating constants
> > which appear in the loop termination conditions should be a *python*
> > issue, not a Sage preprocessing one. Can we not ask the python people
> > to fix it and wait?
>
> AFAIK
Mike,
Here is another function to add to axiom.py:
def compile(self,code, filename="temp.spad", verbose=False):
"""
Compiles a library module written in spad
EXAMPLES:
sage: axiom.compile('''
)abbrev package FOO foo
Foo():with
Hi there,
I'm putting this thread on [sage-devel] because it isn't a support question
anymore. First, some background:
On Friday 05 September 2008, phil wrote on [sage-support]:
> I have a matrix that is composed of multivariant polynomial
> entries. I want to compute its determinant. The pro
> I had thought that the job of not repeatedly evaluating constants
> which appear in the loop termination conditions should be a *python*
> issue, not a Sage preprocessing one. Can we not ask the python people
> to fix it and wait?
AFAIK, they already do that if there is a real constant in the
Sigh, it seems that we have (had) two different build errors here.
One directly after "Done installing PolyBoRi.", which was healed by
updating to the .p4 polybori 0.5 spkg.
The other error seems to be OS X specific and occurs even before
PolyBoRi can be fully installed.
I'll try now a run with th
I like this idea but it provides another layer of complexity. What if
someone simply
forgets to add a license subdirectory? Does that make their package invalid
or does sage -i foo.spkg fail?
In the case of gap_packages*, a number of Gap packages are bundled,
with varying
licenses (mostly GPL but
For the record, replacing polybori-05rc.p3.spkg with the new p4 version and
continuing the build process worked for me (dell laptop running ubuntu).
Alex
Georg S. Weber wrote:
> sorry,
> but the "polybori-05rc.p4.spkg" you pointed to (http://
> sage.math.washington.edu/home/mabshoff/release-cy
sorry,
but the "polybori-05rc.p4.spkg" you pointed to (http://
sage.math.washington.edu/home/mabshoff/release-cycles-3.1.2/rc... )
throws exactly the same build error as before:
...
/usr/bin/libtool: unknown option character `d' in: -dylib_install_name
Usage: /usr/bin/libtool -static [-] file [..
2008/9/9 Martin Albrecht <[EMAIL PROTECTED]>:
>
> On Tuesday 09 September 2008, William Stein wrote:
>> > On a related note, recently I wrote a simple loop that went something
>> > like this:
>> >
>> > while abs(err) < 1e-6:
>> > ...
>> >
>> > The most expensive part of the operation, by far,
Ok, I respun the tarball with the upgraded polybori.spkg and replaced
it. The new md5sum is
076093a7a8f5fc81a4579d708d807f46 sage-3.1.2.rc1.tar
Cheers,
Michael
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe
On Sep 9, 2:39 am, "Georg S. Weber" <[EMAIL PROTECTED]>
wrote:
Hi,
> gmp-4.2.2.p1-fake spkg problem? (already in the 3.1.1 build install
> log):
>
> ...
> gmp-4.2.2.p1.fake/.hgignore
> Finished extraction
>
> Host system
> uname -a:
> Darwin s
gmp-4.2.2.p1-fake spkg problem? (already in the 3.1.1 build install
log):
...
gmp-4.2.2.p1.fake/.hgignore
Finished extraction
Host system
uname -a:
Darwin susanne-webers-computer.local 8.11.1 Darwin Kernel Version
8.11.1: Wed Oct 10 18:23:28 P
On Tuesday 09 September 2008, William Stein wrote:
> > On a related note, recently I wrote a simple loop that went something
> > like this:
> >
> > while abs(err) < 1e-6:
> > ...
> >
> > The most expensive part of the operation, by far, was computing
> > RealNumber('1e-6') in every iteration o
Arg, I know what is wrong and it was a dumb mistake of mine. The spkg
at
http://sage.math.washington.edu/home/mabshoff/release-cycles-3.1.2/rc2/polybori-0.5rc.p4.spkg
fixes the issue. My apologies, it seems that everything that can go
wrong will go wrong in the 3.1.2 release cycle :(
Cheers,
M
same problem on my dell laptop running ubuntu.
Alex
ghtdak wrote:
> build error:
>
> Done installing PolyBoRi.
> Removing dynamic libraries...
> Done removing dynamic libraries.
> touch: cannot touch `/home/tarbox/projects/sage-3.1.2.rc1/devel/sage/
> sage/rings/polynomial/pbori.pyx': No such
Mike,
Here's a minor issue with your patch to axiom.py.
I noticed that you included a hack for Axiom function names with ? and
! suffixes. As you know Sage/Python does not permit these characters
in identifiers. The Axiom convention is that functions with names
ending in ? return True or False a
build error in polybori for Sage 3.1.2.rc.1 on my
Intel Core2 Duo Mac OS X 10.4 / Xcode 2.4.1:
...
g++ -o polybori/src/BlockDegRevLexAscOrder.os -c -O3 -Wno-long-long -
Wreturn-type -g -fPIC -ftemplate-depth-100 -g -fPIC -
fvisibility=hidden -fPIC -DNDEBUG -DPACKED -DHAVE_M4RI -DHAVE_IEEE_754
-I/
build error:
Done installing PolyBoRi.
Removing dynamic libraries...
Done removing dynamic libraries.
touch: cannot touch `/home/tarbox/projects/sage-3.1.2.rc1/devel/sage/
sage/rings/polynomial/pbori.pyx': No such file or directory
real4m46.438s
user4m26.737s
sys 0m18.829s
sage: An e
Hi Michael,
On Thu, Sep 4, 2008 at 4:59 AM, mabshoff <[EMAIL PROTECTED]> wrote:
> On Sep 3, 2:37 am, "Johannes Ring" <[EMAIL PROTECTED]> wrote:
>> Hello Sage developers,
>
> Hi Johannes,
>
>> I am one of the developers of the Python package SciTools
>> (http://scitools.googlecode.com) and for som
2008/9/9 Jason Merrill <[EMAIL PROTECTED]>:
>
>
> def is_constant(f):
>return SR(f).number_of_arguments() == 0
>
> Since this is so short, in practice there is probably no need to
> define the function is_constant. If f can't be coerced to the
> symbolic ring, this will throw a TypeError, but
On Sep 8, 11:58 pm, "Georg S. Weber" <[EMAIL PROTECTED]>
wrote:
Hi,
> Looks like we're getting closer.
>
> In the file "README.txt" in the toplevel directory of the Sage source
> dist
> it is said:
>
> OS X: Make sure you have XCode version >= 2.4, i.e., gcc -v
> should o
71 matches
Mail list logo