- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for getMaxSegments (0.2 sec)
-
platforms/core-runtime/files/src/main/java/org/gradle/api/internal/file/pattern/GreedyPathMatcher.java
this.next = next; } @Override public String toString() { return "{greedy next: " + next + "}"; } @Override public int getMaxSegments() { return Integer.MAX_VALUE; } @Override public int getMinSegments() { return next.getMinSegments(); } @Override
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:55:52 UTC 2023 - 1.6K bytes - Viewed (0) -
platforms/core-runtime/files/src/test/groovy/org/gradle/api/internal/file/pattern/FixedStepPathMatcherTest.groovy
class FixedStepPathMatcherTest extends Specification { def "calculates min and max number of segments"() { def next = Stub(PathMatcher) { getMinSegments() >> 2 getMaxSegments() >> 3 } def matcher = new FixedStepPathMatcher(Stub(PatternStep), next) expect: matcher.minSegments == 3 matcher.maxSegments == 4 }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:55:52 UTC 2023 - 3.8K bytes - Viewed (0) -
platforms/core-runtime/files/src/main/java/org/gradle/api/internal/file/pattern/FixedStepPathMatcher.java
maxSegments = next.getMaxSegments() == Integer.MAX_VALUE ? Integer.MAX_VALUE : next.getMaxSegments() + 1; } @Override public String toString() { return "{fixed-step: " + step + ", next: " + next + "}"; } @Override public int getMinSegments() { return minSegments; } @Override public int getMaxSegments() { return maxSegments; }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:55:52 UTC 2023 - 2.4K bytes - Viewed (0) -
platforms/core-runtime/files/src/main/java/org/gradle/api/internal/file/pattern/AnythingMatcher.java
package org.gradle.api.internal.file.pattern; public class AnythingMatcher implements PathMatcher { @Override public String toString() { return "{anything}"; } @Override public int getMaxSegments() { return Integer.MAX_VALUE; } @Override public int getMinSegments() { return 0; } @Override public boolean matches(String[] segments, int startIndex) {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:55:52 UTC 2023 - 1.1K bytes - Viewed (0) -
platforms/core-runtime/files/src/test/groovy/org/gradle/api/internal/file/pattern/GreedyPathMatcherTest.groovy
class GreedyPathMatcherTest extends Specification { def "calculates min and max number of segments"() { def next = Stub(PathMatcher) { getMinSegments() >> 2 getMaxSegments() >> 3 } def matcher = new GreedyPathMatcher(next) expect: matcher.minSegments == 2 matcher.maxSegments == Integer.MAX_VALUE }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:55:52 UTC 2023 - 2.3K bytes - Viewed (0) -
platforms/core-runtime/files/src/main/java/org/gradle/api/internal/file/pattern/EndOfPathMatcher.java
public class EndOfPathMatcher implements PathMatcher { @Override public String toString() { return "{end-of-path}"; } @Override public int getMaxSegments() { return 0; } @Override public int getMinSegments() { return 0; } @Override public boolean matches(String[] segments, int startIndex) {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:55:52 UTC 2023 - 1.2K bytes - Viewed (0) -
platforms/core-runtime/files/src/main/java/org/gradle/api/internal/file/pattern/PathMatcher.java
*/ int getMinSegments(); /** * Returns the maximum number of segments a path must have to satisfy this matcher. */ int getMaxSegments(); /** * Returns true if the path starting at the given offset satisfies this pattern. */ boolean matches(String[] segments, int startIndex); /**
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:55:52 UTC 2023 - 1.3K bytes - Viewed (0)