2D arrays vs hashtable ?

Considering theses assumptions :

- the hashtable is already initialized.
- i don't need to flush any member of it
- index 0 to 8190 are enough (i mean the size limitation of 2d arrays which depends of width and height doesn't matter, and only one variable will be used, no extra calling of function, since i only need few low index.)

What would be the fastest solution ?
I ask it, since i can't benchmark it for the moment.

hashtables are 2x slower then arrays, there is benchmark on forum.

most custom made systems will be slower then natives.

slow gamecache is gone, hashtables maked for this.

But with 2d array there are some simple mathematics operations, i don't know if it would be faster or not.

2d arrays would be slightly faster. idk if one array is enough you should use them if not so hashtable.

I think it doesn't matter anymore, because hashtables are much faster than gamecache, so the speed isn't so important, because you can't make vJass lag anymore, except if you make a really horrible code.

I think you don't answer properly to the question.

@Toadcop : Ok, that was i thought.

I expect 2d arrays will be slightly faster, but limited to 8191. Hashtables, therefore, for a very slight performance hit, give you a very large improvement.