[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Re: MemopMemmmmo
From: |
John Darrington |
Subject: |
Re: Re: MemopMemmmmo |
Date: |
Wed, 21 Mar 2012 06:55:04 +0000 |
User-agent: |
Mutt/1.5.18 (2008-05-17) |
I would indeed expect such a program to take a very long time to complete.
It would generate a table with approx 250000 * 50 lines.
J'
On Tue, Mar 20, 2012 at 09:20:58PM +0000, address@hidden wrote:
> If I run the syntax:
>
>> input program.
>> loop #i = 1 to 250000.
>> compute A = #i.
>> compute B = mod(#i, 2).
>> end case.
>> end loop.
>> end file.
>> end input program.
>
>> compute v = rv.uniform (0,1).
>
>> EXAMINE
>> v BY A
>> /statistics = descriptives
>
> the program seems to run forever on MSWindows. This with the build from
> 15-3-2012 and with the build from 20-3-2012.
> I didn't check this on GNU/Linux
>
>
> Have fun
>
>
>
> Op schreef Ben Pfaff <address@hidden>:
>> Harry Thijssen address@hidden> writes:
>
>
>
>> > 2012/3/20 John Darrington address@hidden>:
>
>> >> With the fix, or without it?
>
>> >
>
>> > I missed that it was fixed. But it happens on the 15-3-2012 version
>
>> > and the current version.
>
>
>
>> By that, do you mean that it is not fixed?
>
>> --
>
>> Ben Pfaff
>
>> http://benpfaff.org
>
>
--
PGP Public key ID: 1024D/2DE827B3
fingerprint = 8797 A26D 0854 2EAB 0285 A290 8A67 719C 2DE8 27B3
See http://keys.gnupg.net or any PGP keyserver for public key.
signature.asc
Description: Digital signature
- Re: Allocating many workspaces., (continued)
Re: MemopMemmmmo, Harry Thijssen, 2012/03/17
Re: Re: MemopMemmmmo, Harry Thijssen, 2012/03/20