Whoops, intended this for the list and sent it to Matthew instead.
Original Message
Matthew Sherborne wrote:
> It must be to do with memory allocation. Any other ideas?
>
Well, let's see -- we're trying to allocate over 8 million lists
of six integers. Even if each of those
[EMAIL PROTECTED] wrote:
>Thanks guys. I'm still waiting for a response.
>
>Sorry if it was too simple for ya,
>
>edh
>
>
>
>ps this is not a peeing contest. I'm still learning how to do it - but smarter
>
>
>
>>>I'll be curious to see what someone more familiar with NumPy (I assume
>>>David
> "MS" == Matthew Sherborne <[EMAIL PROTECTED]> writes:
MS> Attached is a small set of tests that go about the problem in different
MS> ways, but I couldn't get anywhere near the GBA time. I think that GBA gets
MS> around it by forward checking that the certain members of the array aren'
AIL PROTECTED]>
> Cc: <[EMAIL PROTECTED]>
> Sent: Saturday, May 11, 2002 5:50 AM
> Subject: Re: Conversion from GFA Basic to Python for SpeedTest
>
>
> > On Tue, 9 Apr 2002, Bob Kline wrote:
> >
> > > On Tue, 9 Apr 2002, Ed Hopkins wrote:
&
t;[EMAIL PROTECTED]>
Cc: <[EMAIL PROTECTED]>
Sent: Saturday, May 11, 2002 5:50 AM
Subject: Re: Conversion from GFA Basic to Python for SpeedTest
> On Tue, 9 Apr 2002, Bob Kline wrote:
>
> > On Tue, 9 Apr 2002, Ed Hopkins wrote:
> >
> > >
> > > The result
Thanks guys. I'm still waiting for a response.
Sorry if it was too simple for ya,
edh
ps this is not a peeing contest. I'm still learning how to do it - but smarter
On 10 May 2002 at 13:50, Bob Kline wrote:
> On Tue, 9 Apr 2002, Bob Kline wrote:
>
> > On Tue, 9 Apr 2002, Ed Hopkins
On Tue, 9 Apr 2002, Bob Kline wrote:
> On Tue, 9 Apr 2002, Ed Hopkins wrote:
>
> >
> > The result of this code:
> >
> > starting time :10:06:30
> > finished time:10:06:41
> > i = 8145060
> > 814506040 41 42 43 44 45
> >
> > Within 11 seconds all 8145060 combinations of 6 o
Please replace my line
R = [[0]*(7+1)]*(8145060+1)
with
R = [[None]*(7+1) for x in xrange(8145060+1)]
Else you get an list with 8145061 references
of one (!) inner list.
sorry. Markus
___
ActivePython mailing list
[EMAIL PROTECTED]
To unsubscribe:
- Original Message -
From: "Ed Hopkins" <[EMAIL PROTECTED]>
To: <[EMAIL PROTECTED]>
Sent: Tuesday, April 09, 2002 5:39 AM
Subject: Conversion from GFA Basic to Python for SpeedTest
> Hi,
>
> I'm new to Python and am very impressed with it. Unfortunately
On Tue, 9 Apr 2002, Ed Hopkins wrote:
>
> The result of this code:
>
> starting time :10:06:30
> finished time:10:06:41
> i = 8145060
> 814506040 41 42 43 44 45
>
> Within 11 seconds all 8145060 combinations of 6 of 45 have been
> written into a table together with a line
Hi,
I'm new to Python and am very impressed with it. Unfortunately I am not yet
at the stage where I can convert the GFA Basic code below into Python. Can
anyone help please? Any response appreciated and will certainly help me to
understand more about Python. BTW This is not a challenge to Py
11 matches
Mail list logo
