List of Free Megaprim Packs from Forums, SLExchange, & Onrez

mind if I ask why you haven't got a mono version released yet? (or you got but didn't update the text for the linked product?)

You sure did. Sorry 'bout that!

lol, it's alright, I was just checking

A couple of reasons RE: mono versions. I released the product about 1 week before mono was deployed on Agni.


One of the first things I tried was a re-compile to mono. At that time, I didn't discern any improvement with the mono compilation of this product. I plan to have a mono version available, eventually, but I am currently busy with several other scripting projects that have a higher priority.

The current version's slow speed is due to it's dependency on response time from the asset server as it searches the inventory in the prims. Since the product first came out, it seems like the asset server has been getting slower every month.

Just some interesting math

(255 X 255 X 255) - (10 X 10 X 10) = 16,580,375

which is how many prims it would take to represent every size between <1,1,1> and <255, 255, 255) not including the first 10X10X10 or any decimal fractions.

OMG what a daunting task. How many are we up to so far?

Some interesting math

In an array of 3 numbers like <x,y,z>, there are 6 possible combinations that two different values can make, in addition to one combination of the higher number by itself.

Ex,

1x1x1 (1)
2x1x1 1x2x1 1x1x2 2x2x1 1x2x2 2x1x2 2x2x2 (7)

Every possible value has 6 additional possible combinations than the number before it

EX
3x1x1 1x3x1 1x1x3 3x3x1 1x3x3 3x1x3 3x2x2 2x3x2 2x2x3 3x3x2 2x3x3 3x2x3 3x3x3 (13)

So to figure out the number of possible combinations that exist between <1,1,1> and <255,255,255> you would need to calculate something like the following

[1 + (6 * 0)] + [1 + (6 * 1)] + [1 + (6 * 2)] + ....... + [1 + (6 * n)]
where n = the number of values.

Unfortunately I don't know how to make that into a convenient formula
But I do know how to put it into a computer program!

default
{
    state_entry()
    {
        integer result;
        integer n;
        for (n = 0; n < 255; n++)
        {
            result =  result + 1 + (6 * n);
        }
        
        llSay(0, (string)result);  
    }

}

The result is 194,565. Subtract 280, and that is how many prims it would take to represent every size between <11,1,1> to <255,255,255>, not counting fractional values.

So .... how many are we up to so far?

That is a lot, but I find that a lot of the megaprims I need have a fractional-size