evanlivingston

I'm trying to generate some massive lists of mathematical data, the problem is the list I'm working with are so large max crashes if I bang for it do it instantly, (coll objects don't take kindly to 100,000,000 uzi bangs) and metro is limited to a bang every millisecond as far as I understand. I'm trying to work with java for this but it's just over my head.

Is there a way to get these patches to run at a lower machine level or something?

I'm trying to generate some massive lists of mathematical data, the problem is the list I'm working with are so large max crashes if I bang for it do it instantly, (coll objects don't take kindly to 100,000,000 uzi bangs) and metro is limited to a bang every millisecond as far as I understand. I'm trying to work with java for this but it's just over my head. 

Is there a way to get these patches to run at a lower machine level or something?


bypass-maxs-computational-speed-limits

If you can formalize your list processing as a matrix processing, you would probably benefit greatly from using Jitter to process your data.

[defer] will move the bangs of [uzi] from the high priority thread to the

that is what the helpfile of [uzi] basically is about.

if [defer] and [deferlow] wont help, then nothing will. :)

[defer] will move the bangs of [uzi] from the high priority thread to the
main thread.

that is what the helpfile of [uzi] basically is about.
if [defer] and [deferlow] wont help, then nothing will. :)

or consider to use [metro 1] - [uzi 50].
-110

bypass Max's computational speed limits