Hello,
Many thanks to all for their advice. Converting to a shared library
seems to have worked. After extracting members from a PIC'd
libpython2.5.a, I did
gcc -shared *.o -o libpython.so -lm -lpthread -lutil -ldl ,
copied the .so to $SAGE_LOCAL/lib, and changed spkg-install accordingly:
Dear Ronan,
On Sat, Feb 28, 2009 at 08:32:10PM -0300, Ronan Paixão wrote:
> > Given such a set S, the "position" of an element in the enumeration is
> > called
> > it's rank. So that S.unrank(n) returns the n-th element of S and S.rank(el)
> > returns it's rank in S.
>
> I know nothing
Hello folks,
finally there goes 3.4.rc0. Compared to alpha0 there have been plenty
of ReST fixes, improvements to the quadratic forms code and -sdist
fixes. We also finally did remove the doc repo and thereby reduced the
size of the source tarball by 12 MB. This broke various bits in the
notebook
Hi Fidel,
On Tue, Mar 3, 2009 at 4:19 AM, Fidel wrote:
>
>> Absolutely, getting a "small" patch into Sage is a great way to get
>> more familiar with the whole process before going off and doing a
>> larger project. And we like small and incremental improvements over
>> "patch bombs".
>>
>
>
Hi Michael,
On Mar 2, 2:28 pm, mabshoff wrote:
> On Mar 2, 10:43 am, Fidel wrote:
>
> > On Mar 2, 12:33 pm, Jason Grout wrote:
>
>
>
> Hi Fidel,
>
> > > It sounds like you already have code that you've written. I think it
> > > may be easiest to get the code that you've already written into
Hello all,
>> I would think S.index(x) would be more intuitive to a non-
>> combinatorist like me.
I agree. I am well aware that 'rank' and 'unrank' are very common in
some places, but I found them non-intuitive at first. I would prefer
something like index/[] which I find more natural. (Th
On Mon, Mar 2, 2009 at 3:35 PM, William Stein wrote:
>
> On Mon, Mar 2, 2009 at 2:07 PM, Ryan Hinton wrote:
>> ...
>> So I'm trying to implement a search
>> algorithm similar to [1] for arbitrary word widths. Since the theory is
>> based on matrices and polynomials over GF(2), Sage seems a good
On Mon, Mar 2, 2009 at 2:07 PM, Ryan Hinton wrote:
>
> Here's the quick story. I'm working on a pseudo-random number
> generator, and I'm open to suggestions on where to put the resulting
> file(s). I am more interested in the theory for finding new generators
> than in making this generator av
On Mar 2, 12:09 pm, Robert Miller wrote:
> My timings are showing different results than yours.
> ...
> What platform were you running your tests on?
Hey,
Just got back from a day of fun in the snow.
I can confirm your timing comparisons, when I run your code
on my machine. Makes me wonder if
On Mar 1, 2009, at 9:26 AM, William Stein wrote:
>
> On Fri, Feb 13, 2009 at 2:34 AM, Robert Bradshaw
> wrote:
>>
>> I have written up extensive documentation on the coercion model at
>> http://wiki.sagemath.org/coercion . If you find coercion baffling,
>> confusing, or unuseful, this is especia
Yes, that's it. I think my way of expressing a constant was much nicer
than the one in the bug report, though. ;)
Thanks for pointing this out, Carl! Maybe I don't need to plot this
after all!
Stan
Rob Beezer wrote:
> This might be it.
>
> http://trac.sagemath.org/sage_trac/ticket/4384
>
> On
On Mar 2, 2009, at 10:45 AM, Robert Miller wrote:
> I have implemented some speedups at #5421.
>
> First, let me remark that switching to c_graphs when possible is
> advisable, even for graphs as small as 7 vertices.
Then I'd say let's do this by default. (Perhaps add a "don't change"
implemen
> ... Judging from the patch the overhead was killing you there...
Entirely.
The new patch also allows the following notation:
sage: G = list(graphs(7, implementation='c_graph'))
sage: def test(G):
: for i in xrange(len(G)):
: for j in xrange(i+1,len(G)):
: i
On Mar 2, 10:43 am, Fidel wrote:
> On Mar 2, 12:33 pm, Jason Grout wrote:
Hi Fidel,
> > It sounds like you already have code that you've written. I think it
> > may be easiest to get the code that you've already written into Sage.
> > Can you post it and we can give suggestions on what ne
Here's the quick story. I'm working on a pseudo-random number
generator, and I'm open to suggestions on where to put the resulting
file(s). I am more interested in the theory for finding new generators
than in making this generator available for general use -- unless
someone else has an appl
On Mar 2, 11:02 am, Robert Miller wrote:
> > Well, I don't know if Graphs7 is that interesting of a problem set
> > size wise (I assume it isn't if 1000+ tests can be done in less than
> > 30 seconds)
>
> Actually, it's 1000+ choose 2, or about 544K.
Yeah, I see that now since I guess it does
> Well, I don't know if Graphs7 is that interesting of a problem set
> size wise (I assume it isn't if 1000+ tests can be done in less than
> 30 seconds)
Actually, it's 1000+ choose 2, or about 544K.
--~--~-~--~~~---~--~~
To post to this group, send email to sage-d
I have implemented some speedups at #5421.
First, let me remark that switching to c_graphs when possible is
advisable, even for graphs as small as 7 vertices. I tested the
is_isomorphic function on all pairs of such graphs, and used the
longest one as a case study. In particular, with c_graph alr
On Mar 2, 12:33 pm, Jason Grout wrote:
> Fidel wrote:
> > Sorry for explaining so little about myself. During my undergrad I
> > took 5 courses which involved programming (structured programming,
> > OOP, data structures, computer graphics, cryptography) and a graph
> > theory course. I impleme
I have updated the spkg at
http://trac.sagemath.org/sage_trac/ticket/5310
On Feb 19, 3:34 pm, William Stein wrote:
> On Thu, Feb 19, 2009 at 12:54 AM, mabshoff wrote:
>
> > On Feb 19, 12:51 am, William Stein wrote:
> >> On Thu, Feb 19, 2009 at 12:48 AM, jeffblakeslee wrote:
>
> >> > Hello a
Fidel wrote:
> Sorry for explaining so little about myself. During my undergrad I
> took 5 courses which involved programming (structured programming,
> OOP, data structures, computer graphics, cryptography) and a graph
> theory course. I implemented a small program called QGraphs (http://
> fidel
Phaedon Sinis wrote:
> After this, I'll stop prefacing all my questions with apologies for
> being a beginner.
>
> import matplotlib.dateutil works fine within sage
> but dateutil seems to be empty. dir(dateutil) doesn't contain
> anything -- and I am looking specificalliy for relativedelta. Wha
I recently ran into an error I thought was -fPIC related (similar
errors) but the libs and the program I was compiling were all compiled
with -fPIC. Turns out gcc -G was causing problems and changing to gcc -
shared fixed the issue. The exact same build process worked on solaris-
i386 and the issu
Mark,
My timings are showing different results than yours.
(I'm running these tests on my idle MacBook, OS X 10.5.6, 2.4 GHz Core
2 Duo)
--
| Sage Version 3.3, Release Date: 2009-02-21 |
| Type notebook(
This might be it.
http://trac.sagemath.org/sage_trac/ticket/4384
On Mar 2, 7:47 am, Carl Witty wrote:
> On Mon, Mar 2, 2009 at 7:35 AM, mabshoff wrote:
> > On Mar 2, 6:15 am, Stan Schymanski wrote:
> >> Dear all,
>
> >> I get a ZeroDivisionError: float division if I try to plot the
> >> follo
On Mon, Mar 2, 2009 at 7:35 AM, mabshoff wrote:
> On Mar 2, 6:15 am, Stan Schymanski wrote:
>> Dear all,
>>
>> I get a ZeroDivisionError: float division if I try to plot the
>> following function:
>>
>> var('kab')
>> fun = kab*((2*kab + 1)/(600*kab + 200) - (2*kab + 1)/(400*(kab + 1) +
>> 200*ka
On Mar 2, 6:09 am, Phaedon Sinis wrote:
> Thanks Carl,
Hi Phaedon,
> I am pretty sure I used a relative pathname...
No, you didn't: "hg_sage.add('/finance/FinanceDate.py')" - i.e. don't
use the '/' at the start.
> the only command I
> typed was the first line. The "cd" command was produced
On Mar 2, 6:15 am, Stan Schymanski wrote:
> Dear all,
>
> I get a ZeroDivisionError: float division if I try to plot the
> following function:
>
> var('kab')
> fun = kab*((2*kab + 1)/(600*kab + 200) - (2*kab + 1)/(400*(kab + 1) +
> 200*kab))*((400*(kab + 1) + 200*kab)/(2*kab + 1) - (600*kab + 2
Dear all,
I get a ZeroDivisionError: float division if I try to plot the
following function:
var('kab')
fun = kab*((2*kab + 1)/(600*kab + 200) - (2*kab + 1)/(400*(kab + 1) +
200*kab))*((400*(kab + 1) + 200*kab)/(2*kab + 1) - (600*kab + 200)/
(2*kab + 1)) + 400*((2*kab + 1)/(400*(kab + 1) + 200*k
Thanks Carl,
I am pretty sure I used a relative pathname... the only command I
typed was the first line. The "cd" command was produced by sage; this
was in fact the only pathname that would actually find the file.
When I use an absolute pathname instead, the error is:
"finance/FinanceDate.py d
> We need a name for this concept.
It looks like it's a `sequence', isn't it?
--
Matthias
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to
sage-devel-unsubscr...@googlegroups.c
On Sun, Mar 1, 2009 at 11:12 PM, Phaedon Sinis wrote:
>
> ---
> sage: hg_sage.add('/finance/FinanceDate.py')
> Adding file /finance/FinanceDate.py
> cd "/Users/phaedonsinis/sage/devel/sage" && hg add "/finance/
> FinanceDate.py"
> abort: /finance/FinanceDate.py not under root
> -
32 matches
Mail list logo
