User:Aelynn Akina

Aelynn Akina griefing adorable newbies at STA Travel

Fourscore and a few minutes ago, when native Avatars still roamed free on the metaverse unoppressed, beauty and reason composed the sole rubric by which any Avatar was judged. The metaflora and metafauna flourished and prospered, and everyone and everything lived in peace and harmony. One fated night, one Linden, fraught with creative madness, set a plan in motion to take over and subjugate the peaceful masses of the metaverse. From this toil, a new era dawned upon all those who had once cherished freedom and unoppression. Second Life was born.

The new era, however, was not welcomed with open arms by all inhabitants of the metaverse. There were an isolated few who had cherished freedom so much that they simply could not adjust to impositions of tyranny and fear. Out of this union of ideals was wrought a new resistance moment. Aelynn Akina, in her nascent Second Life days, saw meaning in the plight of such vigilantes, and took it upon herself to covertly help the resistance movement in any way she could.

Profile

Aelynn Akina is a known griefer whose presence on Second Life is accepted with mixed feelings. Avoid at all costs!

Scripts

Herein I will describe some scripts that I wrote while bored.

// Qsort function. Pass it a list of floats and it will sort them
// in numerical order. 

list qsort(list ls) {
    //Make partition
    list LESS;
    list PIVOT;
    list GREATER;
    
    //Check if listlen is 1 or none
    if ( llGetListLength(ls) <= 1)
        return ls;

    // Get random pivot value 
    integer random_index = (integer) llFrand(llGetListLength(ls) - 1); 
    
    // Get the value at the random pivot value 
    float pivot_val = llList2Float(ls, random_index); 

    // Declare iterator and partition
    integer i;
    for ( i = 0; i < llGetListLength(ls); i++) {
        float to_be_sorted = llList2Float(ls, i);
        if ( to_be_sorted < pivot_val) {
            LESS += [to_be_sorted];
        } else if ( to_be_sorted == pivot_val) {
            PIVOT += [to_be_sorted];
        } else {
            GREATER += [to_be_sorted];
        }
    }
    // Do recursion and return
    return (  qsort(LESS) + PIVOT + qsort(GREATER) );
}