com.bluenimble.platform.regex.WildcardCompiler Maven / Gradle / Ivy
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You 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 com.bluenimble.platform.regex;
import java.util.HashMap;
import java.util.Map;
public class WildcardCompiler {
protected static final int MATCH_FILE = -1;
protected static final int MATCH_PATH = -2;
protected static final int MATCH_BEGIN = -4;
protected static final int MATCH_THEEND = -5;
protected static final int MATCH_END = -3;
private static final Map Compiled = new HashMap ();
public static int [] compile (String data) {
if (data == null) {
return null;
}
if (Compiled.containsKey (data)) {
return Compiled.get (data);
}
int expr[] = new int[data.length() + 2];
char buff[] = data.toCharArray();
int y = 0;
boolean slash = false;
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];
}
for (int x = 1; x < buff.length; x++) {
if (slash) {
expr[y++] = buff[x];
slash = false;
} else {
if (buff[x] == '\\') {
slash = true;
} else if (buff[x] == '*') {
if (expr[y - 1] <= MATCH_FILE) {
expr[y - 1] = MATCH_PATH;
} else {
expr[y++] = MATCH_FILE;
}
} else {
expr[y++] = buff[x];
}
}
}
}
expr[y] = MATCH_THEEND;
Compiled.put (data, expr);
return expr;
}
public static boolean match (Map map, String data, int[] expr) {
if (map == null) {
throw new NullPointerException ("No map provided");
}
if (data == null) {
throw new NullPointerException ("No data provided");
}
if (expr == null) {
throw new NullPointerException ("No pattern expression provided");
}
char buff[] = data.toCharArray();
char rslt[] = new char[expr.length + buff.length];
int charpos = 0;
int exprpos = 0;
int buffpos = 0;
int rsltpos = 0;
int offset;
int mcount = 0;
map.put (Integer.toString (mcount), data);
boolean matchBegin = false;
if (expr[charpos] == MATCH_BEGIN) {
matchBegin = true;
exprpos = ++charpos;
}
while (expr [charpos] >= 0) {
charpos++;
}
int exprchr = expr [charpos];
while (true) {
if (matchBegin) {
if (!matchArray (expr, exprpos, charpos, buff, buffpos)) {
return false;
}
matchBegin = false;
} else {
offset = indexOfArray(expr, exprpos, charpos, buff,
buffpos);
if (offset < 0) {
return false;
}
}
buffpos += (charpos - exprpos);
if (exprchr == MATCH_END) {
if (rsltpos > 0) {
map.put (Integer.toString (++mcount), new String (rslt, 0, rsltpos));
}
return true;
} else if (exprchr == MATCH_THEEND) {
if (rsltpos > 0) {
map.put (Integer.toString (++mcount), new String (rslt, 0, rsltpos));
}
return (buffpos == buff.length);
}
exprpos = ++charpos;
while (expr[charpos] >= 0) {
charpos++;
}
int prevchr = exprchr;
exprchr = expr[charpos];
offset = (prevchr == MATCH_FILE)
? indexOfArray(expr, exprpos, charpos, buff, buffpos)
: lastIndexOfArray(expr, exprpos, charpos, buff,
buffpos);
if (offset < 0) {
return false;
}
if (prevchr == MATCH_PATH) {
while (buffpos < offset) {
rslt[rsltpos++] = buff[buffpos++];
}
} else {
while (buffpos < offset) {
if (buff[buffpos] == '/') {
return false;
}
rslt[rsltpos++] = buff[buffpos++];
}
}
map.put (Integer.toString (++mcount), new String (rslt, 0, rsltpos));
rsltpos = 0;
}
}
protected static int indexOfArray (int r[], int rpos, int rend,
char d[], int dpos) {
if (rend < rpos) {
throw new IllegalArgumentException ("rend < rpos");
}
if (rend == rpos) {
return (d.length); //?? dpos?
}
if ((rend - rpos) == 1) {
for (int x = dpos; x < d.length; x++) {
if (r[rpos] == d[x]) {
return (x);
}
}
}
while ((dpos + rend - rpos) <= d.length) {
int y = dpos;
for (int x = rpos; x <= rend; x++) {
if (x == rend) {
return (dpos);
}
if (r[x] != d[y++]) {
break;
}
}
dpos++;
}
return -1;
}
protected static int lastIndexOfArray (int r[], int rpos, int rend,
char d[], int dpos) {
if (rend < rpos) {
throw new IllegalArgumentException("rend < rpos");
}
if (rend == rpos) {
return (d.length); //?? dpos?
}
if ((rend - rpos) == 1) {
for (int x = d.length - 1; x > dpos; x--) {
if (r[rpos] == d[x]) {
return (x);
}
}
}
int l = d.length - (rend - rpos);
while (l >= dpos) {
int y = l;
for (int x = rpos; x <= rend; x++) {
if (x == rend) {
return (l);
}
if (r[x] != d[y++]) {
break;
}
}
l--;
}
return -1;
}
protected static boolean matchArray(int r[], int rpos, int rend,
char d[], int dpos) {
if (d.length - dpos < rend - rpos) {
return false;
}
for (int i = rpos; i < rend; i++) {
if (r[i] != d[dpos++]) {
return false;
}
}
return true;
}
} © 2015 - 2025 Weber Informatics LLC | Privacy Policy