Class CamelCaseMatcher
- java.lang.Object
-
- net.sourceforge.pmd.util.fxdesigner.util.autocomplete.matchers.CamelCaseMatcher
-
public final class CamelCaseMatcher extends Object
This works ok for single camel-case words, but- Since:
- 7.0.0
- Author:
- Clément Fournier
-
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method Description static <T> MatchSelector<T>
allQueryStarts()
Scans several times from left to right, once for each of the possible match starts, and keeps the best result.static <T> MatchSelector<T>
onlyWordStarts()
Breaks some ties, by only matching the input words.static <T> MatchSelector<T>
sparseCamelMatcher()
Scans once left-to-right from the start, picking up on any character in scan order.
-
-
-
Method Detail
-
onlyWordStarts
public static <T> MatchSelector<T> onlyWordStarts()
Breaks some ties, by only matching the input words.
-
sparseCamelMatcher
public static <T> MatchSelector<T> sparseCamelMatcher()
Scans once left-to-right from the start, picking up on any character in scan order.Enough when the candidate is a single word, but still scans only once so it may miss some opportunities.
onlyWordStarts()
can be used to break ties (they look stupid with this matcher).
-
allQueryStarts
public static <T> MatchSelector<T> allQueryStarts()
Scans several times from left to right, once for each of the possible match starts, and keeps the best result. This IMO gives the best results, especially when the candidate may be composed of several words. It's quite costly when there are many suggestions though.
-
-