The version of Apache log4j used by SoundHelix.
Clone
HTTPS:
git clone https://vervis.peers.community/repos/aEp6o
SSH:
git clone USERNAME@vervis.peers.community:aEp6o
Branches
Tags
- 1.3alpha-7
- CHAINSAW_2_SANDBOX_MERGE
- CORE_VERSION
- LEVEL_REPLACES_PRIORITY
- PREALPHA_1_3_AS_OF_2004_05_12
- PRE_CHAINSAW_MODEL_CONVERSION
- PRE_UGLI_MOVE
- TAG_CHAINSAW2_MOVE
- log4j-1.2.17
- log4j-1.2.17-rc1
- v1.3alpha8
- v1.3alpha8-temp
- v1_2_1
- v1_2_10-recalled
- v1_2_11
- v1_2_11_rc1
- v1_2_11rc3
- v1_2_12
- v1_2_12_rc1
- v1_2_12_rc2
- v1_2_12_rc3
- v1_2_12_rc4
- v1_2_12_rc5
- v1_2_12_rc6
- v1_2_13
- v1_2_13_rc1
- v1_2_13_rc2
- v1_2_13_site_update
- v1_2_14
- v1_2_14_maven
- v1_2_14_rc1
- v1_2_14_site_update
- v1_2_15
- v1_2_15_rc1
- v1_2_15_rc2
- v1_2_15_rc3
- v1_2_15_rc4
- v1_2_15_rc5
- v1_2_15_rc6
- v1_2_16
- v1_2_16_rc1
- v1_2_16_rc2
- v1_2_17
- v1_2_17-rc1
- v1_2_17_rc1
- v1_2_17_rc2
- v1_2_17_rc3
- v1_2_2
- v1_2_3
- v1_2_4
- v1_2_6
- v1_2_7
- v1_2_9
- v1_2_alpha0
- v1_2_alpha7
- v1_2beta1
- v1_2final
- v1_3alpha_1
- v1_3alpha_6
- v_1_0
- v_1_0_1
- v_1_0_4
- v_1_1
- v_1_1_1
- v_1_1_2
- v_1_1_3
- v_1_1_b1
- v_1_1b2
- v_1_1b3
- v_1_1b5
- v_1_1b6
- v_1_1b7
- v_1_2beta3
Pattern.java
/*
* Copyright 1999,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.
*/
package org.apache.log4j.joran.spi;
import java.util.ArrayList;
public class Pattern {
// contains String instances
ArrayList components;
public Pattern() {
components = new ArrayList();
}
public Object clone() {
Pattern p = new Pattern();
p.components.addAll(this.components);
return p;
}
/**
* Build a pattern from a string.
*
* Note that "/x" is considered equivalent to "x" and to "x/"
*
*/
public Pattern(String p) {
this();
if (p == null) {
return;
}
int lastIndex = 0;
//System.out.println("p is "+ p);
while (true) {
int k = p.indexOf('/', lastIndex);
//System.out.println("k is "+ k);
if (k == -1) {
components.add(p.substring(lastIndex));
break;
} else {
String c = p.substring(lastIndex, k);
if (c.length() > 0) {
components.add(c);
}
lastIndex = k + 1;
}
}
//System.out.println(components);
}
public void push(String s) {
components.add(s);
}
public int size() {
return components.size();
}
public String get(int i) {
return (String) components.get(i);
}
public void pop() {
if (!components.isEmpty()) {
components.remove(components.size() - 1);
}
}
public String peekLast() {
if (!components.isEmpty()) {
int size = components.size();
return (String) components.get(size - 1);
} else {
return null;
}
}
/**
* Returns the number of "tail" components that this pattern has in common
* with the pattern p passed as parameter. By "tail" components we mean the
* components at the end of the pattern.
*/
public int tailMatch(Pattern p) {
if (p == null) {
return 0;
}
int lSize = this.components.size();
int rSize = p.components.size();
// no match possible for empty sets
if ((lSize == 0) || (rSize == 0)) {
return 0;
}
int minLen = (lSize <= rSize) ? lSize : rSize;
int match = 0;
// loop from the end to the front
for (int i = 1; i <= minLen; i++) {
String l = (String) this.components.get(lSize - i);
String r = (String) p.components.get(rSize - i);
if (l.equals(r)) {
match++;
} else {
break;
}
}
return match;
}
public boolean equals(Object o) {
//System.out.println("in equals:" +this+ " vs. " + o);
if ((o == null) || !(o instanceof Pattern)) {
return false;
}
//System.out.println("both are Patterns");
Pattern r = (Pattern) o;
if (r.size() != size()) {
return false;
}
//System.out.println("both are size compatible");
int len = size();
for (int i = 0; i < len; i++) {
if (!(get(i).equals(r.get(i)))) {
return false;
}
}
// if everything matches, then the twp patterns are equal
return true;
}
public int hashCode() {
int hc = 0;
int len = size();
for (int i = 0; i < len; i++) {
hc ^= get(i).hashCode();
//System.out.println("i = "+i+", hc="+hc);
}
return hc;
}
public String toString() {
int size = components.size();
String result = "";
for(int i = 0; i < size; i++) {
result += "/" + components.get(i);
}
return result;
}
}