[Potential Performance Issue] Specific input cause inefficiency in AntPathMatcher.Java

[yinxiL]

We are working on the Algorithmic Complexity Denial-of-Service problem and detected a performance bug from your code.

In AntPathMatcher.Java the method matchStrings and doMatch would take a long time for some particular patterns.

e.g., matchStrings would take long for a pattern like "a*?*?*?*?*?*?*?*?b*...c" due to its inefficient logic in handling the match between the first and the last asterisks.

We suggest you to update AntPathMatcher.Java following the recent implementation in spring-framework for fixing this problem.