Graal Forums - Sorting numerical data to index

Graal Forums (https://forums.graalonline.com/forums/index.php)

- NPC Scripting (https://forums.graalonline.com/forums/forumdisplay.php?f=8)

- - Sorting numerical data to index (https://forums.graalonline.com/forums/showthread.php?t=82852)

Sorting numerical data to index

I'm terrible with this sort of stuff - not just in GS2 but in Python aswell.

I'm basically after a function that sifts through a list file (probably not the right term for gs2, but basically what I mean) and resorts the list so the index of said list matches to the contents being sorted in a ascending or descending order.

So basically, I feed it a list with the contents [11,24,55,9,17] and the variable to sort ascending, and it returns:

list[0] = 9
list[1] = 11
list[2] = 17
list[3] = 24
etc, etc

But not only that, I'd need the function to be able to do this and reassign two pieces of data, so each number would be linked to a string. (list[0] = "9, raeiphon" - picture a scoreboard as such) This would be easy if GS2 supported tuples, but I've been gone from the scripting scene for so long I can barely remember anything about it.

I'm not asking for a script that does exactly this. I'm asking for advice on what methods I should take to properly learn how to do this - what to read up on, what to think, what to sort. A script would be nice if it was properly commented and whatnot, but I doubt anyone would be willing to spare the time to do that, if it's as hard as I think it is.

There's probably a really simple way to do this too. -sigh-

Copy a quicksort implementation or something from wikipedia, port it to gscript, replace the comparison with one that first splits the number out of that string and only orders by it?

Quote:

Originally Posted by Raeiphon (Post 1443798)

The best you can expect from this is O(n*log(n)).

PHP Code:


		
			
function sort_list( initial_list ) {
  sorted_list = {}; // Sorted List
  // For every element in the initial list
  for ( list_item: initial_list ) {
    // Find Index for new item
    low = 0;
    high = sorted_list.size();
    while ( low < high ) {
      mid = low + int( (high - low) / 2 );
      if ( sorted_list[mid] > list_item )
        high = mid;
      else if ( sorted_list[mid] < list_item )
        low = mid + 1;
      else low = high = mid;
    }

    // Add Item to appropriate index  
    sorted_list.insert( high, list_item );
  }
  // Return sorted list
  return sorted_list;
}

function onCreated() {
  initial_list = {11,24,55,9,17}; // To Sort
  sorted_list = sort_list( initial_list ); // output: {9,11,17,24,55}
}

If you want to create a mapped list... Have each list item such that key => value is a struct {key,value}. Namely, element[0] == key.

PHP Code:


		
			
function sort_list( initial_list ) {
  sorted_list = {}; // Sorted List
  // For every element in the initial list
  for ( list_item: initial_list ) {
    // Find Index for new item
    low = 0;
    high = sorted_list.size();
    while ( low < high ) {
      mid = low + int( (high - low) / 2 );
      if ( sorted_list[mid][0] > list_item[0] )
        high = mid;
      else if ( sorted_list[mid][0] < list_item[0] )
        low = mid + 1;
      else low = high = mid;
    }
  
    // Add Item to appropriate index  
    sorted_list.insert( high, list_item );
  }
  // Return sorted list
  return sorted_list;
}

function onCreated() {
  initial_list = {{11,"Foo"},{24,"Bar"},{55,"Bad"},{9,"Good"},{17,"Foo Foo"}}; // To Sort
  sorted_list = sort_list( initial_list ); // output: {{9,"Good"},{11,"Foo"},{17,"Foo Foo"},{24,"Bar"},{55,"Bad"}}
}

I actually am using a linear-search for my dictionary objects on my server, but a binary search on a sorted list is a lot more efficient... I was going to write this sometime this week anyways.

Hope this helps!

That does it perfectly, Novo.

Thanks a ton. I'll spend some time dissecting that script.

On a completely unrelated note, is it possible to call a string as a function - and on that train of thought, is it possible to use a string to mask an object so I can access that object's attributes?

Say foo = "calculate()", and I have a function of the same value. Is there any way of using foo to execute that function?

For the second one, say I had a string foo = "Command". This is in a class - and it's linked to a script with a gui element named Command. Is there some way of going foo.text (therefore linking Command.text)?

You can use ("string")() to call a function, and use ("string").attribute to access an object.

Quote:

Originally Posted by Crow (Post 1443810)

You can use ("string")() to call a function, and use ("string").attribute to access an object.

You don't really need the paranthesises, but I guess that's a personal preference or something like that

Quote:

Originally Posted by Chompy (Post 1443818)

You don't really need the paranthesises, but I guess that's a personal preference or something like that

Hm. I think last time time I tried without it didn't work. Not sure. But I think the code reads a lot better with parenthesises ;D

Quote:

Originally Posted by Chompy (Post 1443818)

You don't really need the paranthesises, but I guess that's a personal preference or something like that

To do it without parenthesis implies that the attribute is part of the string itself.

I don't think you're ready to experiment with dynamic executional programming. In the majority of the cases, you don't need dynamic execution. Using them makes debugging harder and encourages unconventional hacks rather than well-thought-out solutions.

Right, another question:

Does GS2 have some sort of semaphore I can use to tell a specific function to idle and wait until data from the server is received? I figured I could do this by setting a while loop which runs a 'idle' task until a onActionServerside -> onActionClientside bounce retrieves the data and updates the variable controlling the while loop, simultaneously ending the idling session and returning the function with the proper data.

Pretty rudimentary stuff, but I'm terrified of trying it out in fear that there's no anti-infinite loop control on the server end, and that ****ing around with this stuff will lag the server I'm currently on to ****. Normally in Python I'd just thread major functions or aspects and plonk semaphores whereever I needed them - I'm not sure if GS2 has the functionality with threading at all

Quote:

Originally Posted by Raeiphon (Post 1443899)

The object variable maxlooplimit prevents infinite loops on that object's script, the default loop limit is 10,000 but it can be changed.

And the function waitfor(object, eventname, time); may be what you're looking for. The function halts the function calling it and waits for the specified event on the specified object for the specified amount of time. If the time runs out then waitfor() returns false, otherwise returns true if the event it's waiting for happens.

I created a class for weapons that wraps triggerserver() and triggerclient() and allows functions to be called on the other side and wait for their return value. The script is in the Code Gallery.

Quote:

Originally Posted by Novo (Post 1443857)

What is this dynamic executional programming you're talking about?

Apparently no one appreciates my quicksort implementation (and introsort, which has an upper bound complexity of O(n log n) and average complexity of O(n log n) because it switches from quicksort to heapsort based on a certain threshold):
http://forums.graalonline.com/forums...ad.php?t=81279

Or maybe I just scared off everyone with the first function in that thread for efficient string searching.

Yea... WhiteDragon's code is marginally better than mine because I use an insertion (which has a O(n)... Making my code O(n^2) in worst case) while WhiteDragon's model uses qsort( which doesn't insert, but swaps values. No memory displacement ).

I think mine's easier to understand though, and for someone who isn't familiar with algorithms... Might be a start.