Finds longest (almost) plain substring in the pattern. Implementation is conservative to avoid false positives. The result is not used to optimize `GlobPattern::match()` so it's calculated on request. For * https://github.com/llvm/llvm-project/pull/164545 --------- Co-authored-by: Luke Lau <luke@igalia.com>
9.5 KiB
9.5 KiB