Re: [q-lang-users] Memory fun (was Re: Speeding up Q)

[Albert G. <Dr....@t-...>]

Tim Haynes wrote:
> Am I right in thinking that the generation of error strings including
> object-dumps is non-lazy?

Well, if you use a non-lazy data structure (lists rather than streams)
then that's what you get...

> It's a bit of a PITA trying to find the one or two list-elements on which
> it can't do some function or other in the middle of such a large list.

I guess that you should really take a look at the new bytestring
operations in clib which allow you to treat a bytestring as a mutable
integer vector with fast random access. That should probably work much
better for the application at hand. Or maybe tuples of references would
be helpful (reftypes.q).

In Pure you'll hopefully be able to do serious number crunching like
this, although it still won't be quite as fast as Fortran. ;-)

> Is there any way to speed the process up a bit? Maybe set a few exceptions
> or something?

Yup, that's what they're for. Just add a few default rules throwing
exceptions to the suspicious functions.

HTH,
Albert

-- 
Dr. Albert Gr"af
Dept. of Music-Informatics, University of Mainz, Germany
Email:  Dr....@t-..., ag...@mu...
WWW:    http://www.musikinformatik.uni-mainz.de/ag