Search the Community
Showing results for tags 'mono'.
Hi Linden people ? 1- SUMMARY I have performed a memory benchmark on LSL Mono scripts (see below for details). It shows that on average, for each global variable of type integer, more than 22 bytes are consumed from the script memory. 22 bytes is a lot, compared to the actual integer payload (4 bytes). Considering that LSL Mono scripts have only 64K bytes available, it would be nice to spare them... - What accounts for the 20+ bytes per integer? - Is there a way to reduce this memory consumption ? 2
It would be useful to have an open source benchmark for scripts in SL. Something that could be rezzed / worn, run through a few tests and then give results that can be meaningfully compared over time and to other regions. It must be able to give a consistent result over sequential runs in the same location assuming nothing else changes. Is this even possible? What should be tested and how? What results should be generated? What should be done with the data? Thoughts, ideas, code to test ?
So a little while back, while the forums were offline for the new site update, I had a question I wanted answered: what loops are fastest in mono, and what stipulations should be taken into account when scripting them? As it turns out, this is quite an interesting topic that has a lot of commentators scratching their heads. Well, I'm not here to talk about efficiency, but I am here to definitively conclude which loops appear to be fastest (and when they usually are). Using a simple script that can be found below, I conducted some tests (in mono) to see what loops finish fastest with no ar