[Dayrion]

Quote:

Originally Posted by Y_Less Unfortunately, that's currently the gist of it, yes. I am looking in to making that function faster, but it needs a serious think. Maybe I should do something like this (which I considered last time, but believed was too much effort for the payoff): https://en.wikipedia.org/wiki/Knuth%...ratt_algorithm Edit: I started looking at the jump targets code, trying to speed it up with a binary search or something else. Then I realised it was TOTALLY unneeded! Even without it, the code will still report the correct stack in 99.999% of cases, and the other cases would be ambiguous even in the server VM anyway, so may as well go with the other version of that ambiguity and report it semi accurate always. So I just deleted all the code dealing with jump targets entirely!

Should I do the same thing?