Is it possible to get upper and lower bounds?

[I_H8_U_M8]

I am wondering if in WE if there is something for getting the upper and lower (0 in almost all cases for we) bounds of an array. If you know how can you post how below? thanks anyways if not.

 

[Bribe]

Stacks, 0(N) searches and linked lists are the ways we track array positions in JASS. They are not nearly as efficient and simple as, say, the JavaScript method, which has a native to just run through the entire array.

 

[I_H8_U_M8]

thanks.

 

[Berb]

Well the lower bounds of an array is always 0, the only variable component of an array is its size; which in JASS, is always 8191.

If you're going to be using an array for a "stack" as Bribe mentioned, then you'll have to use an integer to keep track of the used array bounds; this value will need to be updated when parts are added/removed from the array.