Easy Bugs

[Claudio L.]

(10-15-2014 05:41 AM)Tim Wessman Wrote:  Right now, the logic is basically go backwards skipping over ( until it finds a match or hits an invalid name character. If it didn't find anything, move forward to see if there is another match in front of the cursor.

I think with minimal changes you could do a "longest match". Keep all your logic the same, but when you find a match, just record the position and length of the match and keep searching. If you find a longer match, record its length and position, otherwise ignore it.
This way, if the user types acos2asin, it will find it instead of just asin regardless of where the cursor is.
Longest match will probably provide a better user experience. On the other hand, it can potentially get slow, versus interrupting the search at first hit.

Just a thought.