The source text which should be searched.
The characters to locate in the source text.
The index to start the search.
The match result, or null if there is no match.
A lower score represents a stronger match.
Linear on sourceText.
This scoring algorithm uses a sum-of-squares approach to determine
the score. In order for there to be a match, all of the characters
in query must appear in source in order. The index of each
matching character is squared and added to the score. This means
that early and consecutive character matches are preferred, while
late matches are heavily penalized.
A string matcher which uses a sum-of-squares algorithm.