I complained on the slow compilation of 40 functions like
e1 =
[(-3,(1,0,1),[3,0,0,0]), (-2,(0,1,0),[3,0,0,0]), (1,(0,0,3),[]),
(1,(0,0,2),[2,0,0,0]) ...
]
I do not know now, probably, I have to withdraw the complaint ...
Simon Marlow <[EMAIL PROTECTED]> writes on 17 Apr 2000
> --- blocking versions
> takeMVar :: MVar a -> IO a
> putMVar :: MVar a -> a -> IO ()
>
> --- non-blocking versions
> tryTakeMVar :: MVar a -> IO (Maybe a)
> tryPutMVar :: MVar a -> a -> IO Bool
>
> --- current putMVar:
> putMVarMayFail :: MVar a -> a -> IO ()
> putMVarMayFail m a
> = b <- tr
Sergey writes:
> You compile the following program for several minutes, with -Onot.
> But is it really a hard business to parse them 40 expressions below,
> of which e1 is the largest one?
> I need this as just reading of the input data for other program.
I tried to reconstruct your example
I'm having some trouble with my mailbox here at MS. If anyone has sent mail
to me since Saturday and it bounced, please re-try.
If it still doesn't get through, I can be reached at [EMAIL PROTECTED]
Cheers,
Simon
Hi, Marc,
Yes, I needed to read them from file. But then - to parse.
The parsing program will be simple. But why should I write it if
GHC has the parser inside the compiler? I simply compile a thing
with -Onot ...
S.D.Mechveliani ([EMAIL PROTECTED]) wrote:
:
: yFields = [e1, e2, e3, e4, e5, e6, e7, e8, e9, e10,
:e11,e12,e13,e14,e15,e16,e17,e18,e19,e20,
:e21,e22,e23,e24,e25,e26,e27,e28,e29,e30,
:e31,e32,
I'm a bit reluctant to do this. People (including me) often say things
like:
data Foo = Camel Camel
| Rat Rat
| ...
data Camel = Short ..
| Tall ..
So here Foo introduces a constructor for a type that
already exisits (and might be imported). You might say
Dear GHC,
You compile the following program for several minutes, with -Onot.
But is it really a hard business to parse them 40 expressions below,
of which e1 is the largest one?
I need this as just reading of the input data for other program.
Only please, do not write the compiler in C !
Wh
