com.hazelcast.org.codehaus.janino.util.StringPattern Maven / Gradle / Ivy
/*
* Janino - An embedded Java[TM] compiler
*
* Copyright (c) 2001-2010 Arno Unkrig. All rights reserved.
* Copyright (c) 2015-2016 TIBCO Software Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification, are permitted provided that the
* following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the
* following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the
* following disclaimer in the documentation and/or other materials provided with the distribution.
* 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote
* products derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package com.hazelcast.org.codehaus.janino.util;
import java.util.ArrayList;
import java.util.List;
import com.hazelcast.org.codehaus.commons.nullanalysis.Nullable;
/**
* Implementation of a UNIX shell-like string pattern algorithm.
*
* Additionally, the concept of the "combined pattern" is supported (see {@link #matches(StringPattern[], String)}.
*
*/
public
class StringPattern {
/**
* @see #matches(StringPattern[], String)
*/
public static final int INCLUDE = 0;
/**
* @see #matches(StringPattern[], String)
*/
public static final int EXCLUDE = 1;
private final int mode;
@Nullable private final String pattern;
/**
* @param mode {@link #INCLUDE} or {@link #EXCLUDE}
*/
public
StringPattern(int mode, String pattern) {
this.mode = mode;
this.pattern = pattern;
}
public
StringPattern(@Nullable String pattern) {
this.mode = StringPattern.INCLUDE;
this.pattern = pattern;
}
/**
* @return Whether this {@link StringPattern} represents inclusion ({@link #INCLUDE}) or exclusion
* exclusion ({@link #EXCLUDE}) of subjects
*/
public int
getMode() { return this.mode; }
/**
* Matches the given {@code text} against the pattern represented by the current instance,
* as follows:
*
* -
* A {@code *} in the pattern matches any sequence of zero or more characters in the
* {@code text}
*
* -
* A {@code ?} in the pattern matches exactly one character in the {@code text}
*
* -
* Any other character in the pattern must appear exactly as it is in the {@code text}
*
*
* Notice: The {@code mode} flag of the current instance does not take any effect here.
*
*/
public boolean
matches(String text) { return StringPattern.wildmatch(this.pattern, text); }
/**
* Parses a "combined pattern" into an array of {@link StringPattern}s. A combined pattern
* string is structured as follows:
*
* combined-pattern :=
* [ '+' | '-' ] pattern
* { ( '+' | '-' ) pattern }
*
*
* If a pattern is preceeded with a '-', then the {@link StringPattern} is created with mode {@link #EXCLUDE},
* otherwise with mode {@link #INCLUDE}.
*
*/
public static StringPattern[]
parseCombinedPattern(String combinedPattern) {
List al = new ArrayList();
for (int k = 0, l; k < combinedPattern.length(); k = l) {
int patternMode;
char c = combinedPattern.charAt(k);
if (c == '+') {
patternMode = StringPattern.INCLUDE;
++k;
} else
if (c == '-') {
patternMode = StringPattern.EXCLUDE;
++k;
} else {
patternMode = StringPattern.INCLUDE;
}
for (l = k; l < combinedPattern.length(); ++l) {
c = combinedPattern.charAt(l);
if (c == '+' || c == '-') break;
}
al.add(new StringPattern(patternMode, combinedPattern.substring(k, l)));
}
return (StringPattern[]) al.toArray(new StringPattern[al.size()]);
}
/**
* Matchs a given {@code text} against an array of {@link StringPattern}s (which was typically created by {@link
* #parseCombinedPattern(String)}.
*
* The last matching pattern takes effect; if its mode is {@link #INCLUDE}, then {@code true} is returned, if its
* mode is {@link #EXCLUDE}, then {@code false} is returned.
*
*
* If {@code patterns} is {@link #PATTERNS_NONE}, or empty, or none of its patterns matches, then {@code false}
* is returned.
*
*
* If {@code patterns} is {@link #PATTERNS_ALL}, then {@code true} is returned.
*
*
* For backwards compatibility, {@code null} patterns are treated like {@link #PATTERNS_NONE}.
*
*/
@SuppressWarnings({ "unused", "null" })
public static boolean
matches(StringPattern[] patterns, String text) {
// Backwards compatibility -- previously, "null" was officially documented.
if (patterns == null) return false;
for (int i = patterns.length - 1; i >= 0; --i) {
if (patterns[i].matches(text)) {
return patterns[i].getMode() == StringPattern.INCLUDE;
}
}
return false; // No patterns defined or no pattern matches.
}
/**
* A {@link StringPattern} that matches any subject.
*/
public static final StringPattern[] PATTERNS_ALL = { new StringPattern("*") };
/**
* A {@link StringPattern} that matches no subject whatsoever.
*/
public static final StringPattern[] PATTERNS_NONE = new StringPattern[0];
@Override public String
toString() {
return (
this.mode == StringPattern.INCLUDE ? '+' :
this.mode == StringPattern.EXCLUDE ? '-' :
'?'
) + this.pattern;
}
private static boolean
wildmatch(@Nullable String pattern, String text) {
if (pattern == null) return true;
int i;
for (i = 0; i < pattern.length(); ++i) {
char c = pattern.charAt(i);
switch (c) {
case '?':
if (i == text.length()) return false;
break;
case '*':
if (pattern.length() == i + 1) return true; // Optimization for trailing '*'.
pattern = pattern.substring(i + 1);
for (; i <= text.length(); ++i) {
if (StringPattern.wildmatch(pattern, text.substring(i))) return true;
}
return false;
default:
if (i == text.length()) return false;
if (text.charAt(i) != c) return false;
break;
}
}
return text.length() == i;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy