[JASS] 100 string checks vs 1000 boolean checks?

[MrApples]

100 string checks (in array) vs 1000 boolean checks? (in array), which one would be faster NOT including string leaks.

I need to know for this...

A indefinite # of strings in a array must be checked first. If the target string is not found, a 2nd, much larger ( 10X would be a good estimate ) array of strings must be checked which contains all of the values in the first array. Using a attached boolean array, I would be able to stop strings from being checked twice, but would it be worth it?

 

[PurplePoot]

No idea, that's a good question.

Try using Grimoire's StopWatch natives to test it out.

 

[Captain Griffen]

No difference between a string check and a boolean check. Both merely check if the bits (4 bytes) are the same.

 

[PurplePoot]

Booleans are 4 byte? Wow...

Meh, guess you learn something new (and sorta retarded) every day.

 

[MrApples]

Ok so checking something which only has 2 different outcomes as opposed to something that has billions of outcomes takes the same processing? Wow...

 

[PurplePoot]

You could always StopWatch it just in case, it still sounds unlikely to me. (well, knowing blizzard I take that last bit back ><)

 

[Captain Griffen]

Ok so checking something which only has 2 different outcomes as opposed to something that has billions of outcomes takes the same processing? Wow...

Booleans are 4 bytes. Retarded? Yes. Actually I think it might be even more retarded in that true == 1, rather than true != 0.