hi,all
after a week's work,I finally finish this patch.it is the most complicated patch I had made.
as we know,the current cc use FindAIMatch function to get the matched tokens.people complain its low efficiency.
that is true because it use recursive calls.and I found it is hard to understand ,not mention to maintain it.at least for me,it is so.
so I rewrite FindAIMatch function.of course ,I abandon recursive calls.
I am not going to explain the whole search process, just started from what I changed.
1.first I use
GenerateResultSet to get the tokens from search scope
set.it is the same story as before.but a little different here.
I directly get the matched search text from the tree and then eliminate those which are not under the search scope set.
2.
ResolveAutualTypethis function is used to resolve the function/variable's actual type.
3.
ResolveExpressionjust the name said,it is used to resolve the expression. it is used to replace the FindAIMatch function.
if you want to ask what is the biggest different?
here is the answer.try the complained thing.you can see how fast it is. :lol:
string::append.append.append.append.append.append.
patch for it.