/*
 * Copyright 2014 the original author or authors.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package org.gradle.api.internal.file.pattern;

/**
 * A pattern step for a pattern segment a the common case with a '*' prefix on the pattern. e.g. '*.java'
 */
public class HasSuffixPatternStep implements PatternStep {
    private final String suffix;
    private final boolean caseSensitive;
    private final int suffixLength;
    private final int prefixLength;

    public HasSuffixPatternStep(String suffix, boolean caseSensitive) {
        this(suffix, caseSensitive, 0);
    }

    // Used by HasPrefixAndSuffixPatternStep to ensure the suffix isn't matching any part of the prefix.
    HasSuffixPatternStep(String suffix, boolean caseSensitive, int prefixLength) {
        this.suffix = suffix;
        suffixLength = suffix.length();
        this.caseSensitive = caseSensitive;
        this.prefixLength = prefixLength;
    }

    public boolean matches(String candidate) {
        return prefixLength + suffixLength <= candidate.length() && candidate.regionMatches(!caseSensitive, candidate.length() - suffixLength, suffix, 0, suffixLength);
    }
}

@@ -1513,39 +1513,21 @@
 urn 
-prefixLength + suffixLength %3C= 
+isLongEnough(
 cand
@@ -1531,24 +1531,16 @@
 andidate
-.length(
 ) && can
@@ -1642,11 +1642,219 @@
 );%0A    %7D
+%0A%0A    // Confirms there is enough space in candidate to fit both suffix and prefix.%0A    private boolean isLongEnough(String candidate) %7B%0A        return prefixLength + suffixLength %3C= candidate.length();%0A    %7D
 %0A%7D%0A

Add a method to clarify how prefixLength and suffixLengh are used.