Speed Comparison

[Alain.Mark]

I've been checking alot of sites i know but i cannot find a speed comparison table... so i decided to post here.

So is this a correct order of speed comparison? Since Im really confused about their speed. ("<" - means slower than)

Gamecaches < Structs < Hashtables < Arrays < 2D Arrays (in vJASS)

or you can just tell me which one works the fastest among them in terms of recovering and storing of values/data .

 

[D4RK_G4ND4LF]

structs compile to arrays imho so their speed is equal
gamecache is slowest
hashtables are second slowest and become slower with more data stored in them
2d arrays require normal arrays so they are slower than normal arrays (which should be fastest)

Speed:
1. Array
2. 2D-Array/Struct(not 100% sure)
3. hashtable
4. gamecache

it depends on how you want to store the data
if you want to attach it to handles your only way is to use hashtables or structs and some attachment stuff
if you want to store less than 8192 things with indexes less than 8192 you should use arrays
if you want to save/load data in campaigns you can use gamecaches

 

[Nestharus]

1. array/struct (as gandalf pointed out, a struct is a just a group of arrays)
2. 2D array (due to math offset in background)
3. hashtable
4. large sized array (40k etc, due to lots of function calls and if statement checks)
5. gamecache

 

[Bribe]

The fastest would be scalar variables, of course.

 

[Alain.Mark]

Scalar? what are they...

 

[Bribe]

Scalar variable on wikipedia: http://en.wikipedia.org/wiki/Scalar_(computing)

Google may sound like a monster from the Abyss but it is so useful.

If you need a World Editor comparison, it's a normal, non-arrayed variable.

 

[Alain.Mark]

The link does not work... but i only needed to know its WE equivalent anyway ^^

 

[Bribe]

Fixed the link, for some reason it cropped out the closing parenthesis.

 

[emjlr3]

if only Blizzard allowed timer callback functions to take arguments....

 

[Dr Super Good]

if only Blizzard allowed timer callback functions to take arguments....

It would make no sense from a programming point of view. How would they get stored? When would they get evaluated? How many would be supported?

The fastest is logically non array variables (scalar variables) as they are 1 memory lookup rather than 2 that an array needs.

Hashtables are prety slow compared to an array lookup due to the complexity of the underlying data structure but they provide an enormous scope range and keep an efficiency of mostly near O(1).

A gamecache is even slower as it is basically a hashtable but with string hashes and file syncronization.

 

[Bribe]

>> It would make no sense from a programming point of view. How would they get stored? When would they get evaluated? How many would be supported?

JavaScript supports it with their weird timer-system :-/

 

[Dr Super Good]

If arguments are evaluated when the timer is started, it would just need to store an accompany object to contain all the parameters. The timer system itself would need to store this reference but that can be done as an object variable for the timer itself.

The problem with JASS is the code argument that the timer takes does not support arguments at all. You can however make a system which stores a vJASS struct to a timer using simlar principles (although not the same).