According to the answer to this question
http://www.velocityreviews.com/forums/t713549-check-for-null-before-calling-free.html
it is save since it is part of the c language spec that free(NULL) should do
nothing. So also the debugging replacements Dima is worried about should give
no problem.
Hi Niles,
On 2012-04-19, Niles Johnson wrote:
> --=_Part_2051_3724501.1334804120645
> Content-Type: text/plain; charset=ISO-8859-1
>
> Someone should also mention Simon's article on implementing algebraic
> structures. It's comprehensive and well-written!
>
> http://flask.sagenb.org/home/pu
On Thursday, 19 April 2012 11:33:36 UTC+8, Stephen Montgomery-Smith wrote:
>
> I think I have found the problem with sympow. It is nothing to do with
> elliptic curves. It is simply a malloc/free error.
>
> In util.c there is a function free_data, which frees TACKS[0]. TACKS[0]
> is meant to
I think I have found the problem with sympow. It is nothing to do with
elliptic curves. It is simply a malloc/free error.
In util.c there is a function free_data, which frees TACKS[0]. TACKS[0]
is meant to be allocated in disk.c, but there are circumstances when
TACKS[0] is not allocated.
Someone should also mention Simon's article on implementing algebraic
structures. It's comprehensive and well-written!
http://flask.sagenb.org/home/pub/82/
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubs
Hi Marco,
On 18 Apr., 21:28, mmarco wrote:
> I am trying to implement free groups in sage. I try to inherit from
> ParentWithGens, and seems to work.
I recommend to use sage.structure.parent.Parent, which also supports
generators. If I recall correctly, ParentWithGens is very old stuff
that does
I am trying to implement free groups in sage. I try to inherit from
ParentWithGens, and seems to work. But when i call the .hom procedure
passing the image of the generators, it fails.
This is the declartion of my class:
class FreeGroup(UniqueRepresentation, group.Group,ParentWithGens):
E
On Apr 17, 6:26 pm, kcrisman wrote:
> The 4.8 stuff is probably due to a previous Maxima.
>
> In the 5.0 betas, I suspect this particular one is related to things
> like
>
> http://trac.sagemath.org/sage_trac/ticket/8321
Some of the comments on that ticket also point out that in sage there
doesn'
On 18 April 2012 19:11, Stephen Montgomery-Smith wrote:
> On 04/18/12 12:14, Dima Pasechnik wrote:
>
>> The complex_double.pyx problem seems to be PARI-related. Is there a PARI
>> port of FreeBSD?
>
>
> Yes there is. it is version 2.3.5, which is several versions earlier than
> sage is using.
>
>
On 18 Apr., 19:08, Marco Streng wrote:
> I think it is sage.structure.coerce_actions.fast_mul in
> sage/structure/coerce_actions.pyx
>
> That function is called when I do
> sage: 100*P
>
> And it is a double-and-add.
Yes, that is it. Many thanks
Daniel
--
To post to this group, send an
On 04/18/12 12:14, Dima Pasechnik wrote:
The complex_double.pyx problem seems to be PARI-related. Is there a PARI
port of FreeBSD?
Yes there is. it is version 2.3.5, which is several versions earlier
than sage is using.
What pari commands can I use to test if the problem is the same for pa
On Monday, 16 April 2012 03:09:47 UTC+8, Stephen Montgomery-Smith wrote:
>
> On 04/15/2012 12:14 AM, Stephen Montgomery-Smith wrote:
> > On 04/14/2012 09:33 PM, kcrisman wrote:
> >
> >>> I would appreciate any help understanding the cause of the remaining
> >>> errors.
> >>
> >> Luckily, first we
I think it is sage.structure.coerce_actions.fast_mul in
sage/structure/coerce_actions.pyx
That function is called when I do
sage: 100*P
And it is a double-and-add.
2012/4/18 Daniel Krenn :
> If I perform a scalar multiplication e.g. of an integer with a module
> element, it seems that
On 18 Apr., 18:07, Florent Hivert wrote:
> On Wed, Apr 18, 2012 at 09:03:25AM -0700, Daniel Krenn wrote:
> > If I perform a scalar multiplication e.g. of an integer with a module
> > element, it seems that a double-and-add algorithm is used. Where (in
> > which file/class) is that algorithm exactl
On Wed, Apr 18, 2012 at 09:03:25AM -0700, Daniel Krenn wrote:
> If I perform a scalar multiplication e.g. of an integer with a module
> element, it seems that a double-and-add algorithm is used. Where (in
> which file/class) is that algorithm exactly implemented?
>
> It is called, for example by
>
If I perform a scalar multiplication e.g. of an integer with a module
element, it seems that a double-and-add algorithm is used. Where (in
which file/class) is that algorithm exactly implemented?
It is called, for example by
sage: E = EllipticCurve('37a')
sage: P = E(0,0)
sage: 5*P
On Wed, Apr 18, 2012 at 8:24 AM, John Cremona wrote:
> There's a new spkg for eclib at #10993 which has passed tests on
> various linuxes, MacOS and Solaris. Does it need to be tested on
> Cygwin before getting a positive review, and if so who will do that?
No. We are dropping the Cygwin requir
There's a new spkg for eclib at #10993 which has passed tests on
various linuxes, MacOS and Solaris. Does it need to be tested on
Cygwin before getting a positive review, and if so who will do that?
The old spkg-install had some Cygwin-specific code, but the new build
system may not need anything
On 2012-04-17 22:53, Jeroen Demeyer wrote:
> I started getting MemoryErrors while merging Sage releases and it was
> also mentioned at #12313. Building the Sage documentation needs a lot
> of memory. On 64-bit machines at least, you need *more than 2GB* of
> virtual memory to build the documentat
19 matches
Mail list logo
