All Downloads are FREE. Search and download functionalities are using the official Maven repository.

net.logstash.logback.marker.LogstashBasicMarker Maven / Gradle / Ivy

There is a newer version: 8.0
Show newest version
/**
 * 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 net.logstash.logback.marker;

import org.slf4j.Marker;

import java.util.Collections;
import java.util.Iterator;
import java.util.List;
import java.util.Vector;

/* Copy of {@link org.slf4j.helpers.BasicMarker} from slf4j-api v1.7.12,
 * with a minor change to make the constructor public,
 * so that it can be extended in other packages.
 * 

* slf4j-api, {@link org.slf4j.helpers.BasicMarker}, and the portions * of this class that have been copied from BasicMarker are provided under * the MIT License copied here: * * Copyright (c) 2004-2011 QOS.ch * All rights reserved. * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * */ /** * A simple implementation of the {@link Marker} interface. * * @author Ceki Gülcü * @author Joern Huxhorn */ @SuppressWarnings("serial") public class LogstashBasicMarker implements Marker { private final String name; private List refereceList; /* * BEGIN Modification in logstash-logback-encoder to make this constructor public */ public LogstashBasicMarker(String name) { /* * END Modification in logstash-logback-encoder to make this constructor public */ if (name == null) { throw new IllegalArgumentException("A marker name cannot be null"); } this.name = name; } public String getName() { return name; } public synchronized void add(Marker reference) { if (reference == null) { throw new IllegalArgumentException( "A null value cannot be added to a Marker as reference."); } // no point in adding the reference multiple times if (this.contains(reference)) { return; } else if (reference.contains(this)) { // avoid recursion // a potential reference should not its future "parent" as a reference return; } else { // let's add the reference if (refereceList == null) { refereceList = new Vector(); } refereceList.add(reference); } } public synchronized boolean hasReferences() { return ((refereceList != null) && (refereceList.size() > 0)); } public boolean hasChildren() { return hasReferences(); } public synchronized Iterator iterator() { if (refereceList != null) { return refereceList.iterator(); } else { return Collections.EMPTY_LIST.iterator(); } } public synchronized boolean remove(Marker referenceToRemove) { if (refereceList == null) { return false; } int size = refereceList.size(); for (int i = 0; i < size; i++) { Marker m = (Marker) refereceList.get(i); if (referenceToRemove.equals(m)) { refereceList.remove(i); return true; } } return false; } public boolean contains(Marker other) { if (other == null) { throw new IllegalArgumentException("Other cannot be null"); } if (this.equals(other)) { return true; } if (hasReferences()) { for (int i = 0; i < refereceList.size(); i++) { Marker ref = (Marker) refereceList.get(i); if (ref.contains(other)) { return true; } } } return false; } /** * This method is mainly used with Expression Evaluators. */ public boolean contains(String name) { if (name == null) { throw new IllegalArgumentException("Other cannot be null"); } if (this.name.equals(name)) { return true; } if (hasReferences()) { for (int i = 0; i < refereceList.size(); i++) { Marker ref = (Marker) refereceList.get(i); if (ref.contains(name)) { return true; } } } return false; } private static String OPEN = "[ "; private static String CLOSE = " ]"; private static String SEP = ", "; public boolean equals(Object obj) { if (this == obj) return true; if (obj == null) return false; if (!(obj instanceof Marker)) return false; final Marker other = (Marker) obj; return name.equals(other.getName()); } public int hashCode() { return name.hashCode(); } public String toString() { if (!this.hasReferences()) { return this.getName(); } Iterator it = this.iterator(); Marker reference; StringBuffer sb = new StringBuffer(this.getName()); sb.append(' ').append(OPEN); while (it.hasNext()) { reference = (Marker) it.next(); sb.append(reference.getName()); if (it.hasNext()) { sb.append(SEP); } } sb.append(CLOSE); return sb.toString(); } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy