📄 wildcardhelper.java
字号:
/**
* Copyright (c) 2005, Paul Tuckey
* All rights reserved.
*
* Each copy or derived work must preserve the copyright notice and this
* notice unmodified.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*
*/
package org.tuckey.web.filters.urlrewrite.utils;
/**
* This class is a modified version of one found in Apache Cocoon.
*
* Copyright 2003-2004 The Apache Software Foundation.
*
* 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.
*
*/
/**
* This class is an utility class that perform wilcard-patterns matching and
* isolation.
*
* @author Paul Tuckey
* @version $Revision: 1.2 $ $Date: 2005/12/07 10:27:01 $
*/
public class WildcardHelper {
/**
* The int representing '*' in the pattern <code>int []</code>.
*/
protected static final int MATCH_FILE = -1;
/**
* The int representing '**' in the pattern <code>int []</code>.
*/
protected static final int MATCH_PATH = -2;
/**
* The int representing begin in the pattern <code>int []</code>.
*/
protected static final int MATCH_BEGIN = -4;
/**
* The int representing end in pattern <code>int []</code>.
*/
protected static final int MATCH_THEEND = -5;
/**
* The int value that terminates the pattern <code>int []</code>.
*/
protected static final int MATCH_END = -3;
/**
* Translate the given <code>String</code> into a <code>int []</code>
* representing the pattern matchable by this class.
* <br>
* This function translates a <code>String</code> into an int array
* converting the special '*' and '\' characters.
* <br>
* Here is how the conversion algorithm works:
* <ul>
* <li>The '*' character is converted to MATCH_FILE, meaning that zero
* or more characters (excluding the path separator '/') are to
* be matched.</li>
* <li>The '**' sequence is converted to MATCH_PATH, meaning that zero
* or more characters (including the path separator '/') are to
* be matched.</li>
* <li>The '\' character is used as an escape sequence ('\*' is
* translated in '*', not in MATCH_FILE). If an exact '\' character
* is to be matched the source string must contain a '\\'.
* sequence.</li>
* </ul>
* When more than two '*' characters, not separated by another character,
* are found their value is considered as '**' (MATCH_PATH).
* <br>
* The array is always terminated by a special value (MATCH_END).
* <br>
* All MATCH* values are less than zero, while normal characters are equal
* or greater.
*
* @param data The string to translate.
* @return The encoded string as an int array, terminated by the MATCH_END
* value (don't consider the array length).
* @throws NullPointerException If data is null.
*/
public int[] compilePattern(String data) {
// Prepare the arrays
int expr[] = new int[data.length() + 2];
char buff[] = data.toCharArray();
// Prepare variables for the translation loop
int y = 0;
boolean slash = false;
// Must start from beginning
expr[y++] = MATCH_BEGIN;
if (buff.length > 0) {
if (buff[0] == '\\') {
slash = true;
} else if (buff[0] == '*') {
expr[y++] = MATCH_FILE;
} else {
expr[y++] = buff[0];
}
// Main translation loop
for (int x = 1; x < buff.length; x++) {
// If the previous char was '\' simply copy this char.
if (slash) {
expr[y++] = buff[x];
slash = false;
// If the previous char was not '\' we have to do a bunch of
// checks
} else {
// If this char is '\' declare that and continue
if (buff[x] == '\\') {
slash = true;
// If this char is '*' check the previous one
} else if (buff[x] == '*') {
// If the previous character als was '*' match a path
if (expr[y - 1] <= MATCH_FILE) {
expr[y - 1] = MATCH_PATH;
} else {
expr[y++] = MATCH_FILE;
}
} else {
expr[y++] = buff[x];
}
}
}
}
// Must match end at the end
expr[y] = MATCH_THEEND;
return expr;
}
/**
* Match a pattern agains a string and isolates wildcard replacement into a
* <code>Stack</code>.
*
* @param data The string to match
* @param expr The compiled wildcard expression
* @return True if a match
* @throws NullPointerException If any parameters are null
*/
public boolean matchWithNoResults(String data, int[] expr) {
if (data == null) {
throw new NullPointerException("No data provided");
}
if (expr == null) {
throw new NullPointerException("No pattern expression provided");
}
char buff[] = data.toCharArray();
// The previous and current position of the expression character
// (MATCH_*)
int charpos = 0;
// The position in the expression, input, translation and result arrays
int exprpos = 0;
int buffpos = 0;
int offset;
// First check for MATCH_BEGIN
boolean matchBegin = false;
if (expr[charpos] == MATCH_BEGIN) {
matchBegin = true;
exprpos = ++charpos;
}
// Search the fist expression character (except MATCH_BEGIN - already
// skipped)
while (expr[charpos] >= 0) {
charpos++;
}
// The expression charater (MATCH_*)
int exprchr = expr[charpos];
while (true) {
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -