org.modeshape.jcr.value.PathNotFoundException Maven / Gradle / Ivy
/*
* ModeShape (http://www.modeshape.org)
* See the COPYRIGHT.txt file distributed with this work for information
* regarding copyright ownership. Some portions may be licensed
* to Red Hat, Inc. under one or more contributor license agreements.
* See the AUTHORS.txt file in the distribution for a full listing of
* individual contributors.
*
* ModeShape is free software. Unless otherwise indicated, all code in ModeShape
* is licensed to you under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation; either version 2.1 of
* the License, or (at your option) any later version.
*
* ModeShape 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this software; if not, write to the Free
* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
* 02110-1301 USA, or see the FSF site: http://www.fsf.org.
*/
package org.modeshape.jcr.value;
import org.modeshape.common.annotation.Immutable;
import org.modeshape.jcr.GraphI18n;
/**
* A runtime exception denoting that a node or property at a supplied {@link Path path} was not found. This exception does contain
* the lowest ancestor of the path that was found to exist.
*/
@Immutable
public class PathNotFoundException extends RuntimeException {
/**
*/
private static final long serialVersionUID = -3703984046286975978L;
private final Location location;
private final Path lowestAncestorThatDoesExist;
/**
* @param location the location of the node that does not exist
* @param lowestAncestorThatDoesExist the path of the lowest (closest) ancestor that does exist
*/
public PathNotFoundException( Location location,
Path lowestAncestorThatDoesExist ) {
this.location = location;
this.lowestAncestorThatDoesExist = lowestAncestorThatDoesExist;
}
/**
* @param location the location of the node that does not exist
* @param lowestAncestorThatDoesExist the path of the lowest (closest) ancestor that does exist
* @param message
*/
public PathNotFoundException( Location location,
Path lowestAncestorThatDoesExist,
String message ) {
super(message);
this.location = location;
this.lowestAncestorThatDoesExist = lowestAncestorThatDoesExist;
}
/**
* @param location the location of the node that does not exist
* @param lowestAncestorThatDoesExist the path of the lowest (closest) ancestor that does exist
* @param cause
*/
public PathNotFoundException( Location location,
Path lowestAncestorThatDoesExist,
Throwable cause ) {
super(cause);
this.location = location;
this.lowestAncestorThatDoesExist = lowestAncestorThatDoesExist;
}
/**
* @param location the location of the node that does not exist
* @param lowestAncestorThatDoesExist the path of the lowest (closest) ancestor that does exist
* @param message
* @param cause
*/
public PathNotFoundException( Location location,
Path lowestAncestorThatDoesExist,
String message,
Throwable cause ) {
super(message, cause);
this.location = location;
this.lowestAncestorThatDoesExist = lowestAncestorThatDoesExist;
}
@Override
public String toString() {
return super.toString();
}
@Override
public String getMessage() {
if (this.lowestAncestorThatDoesExist != null) {
String locationPart = location.hasPath() ? location.getPath().toString() : location.toString();
return GraphI18n.pathNotFoundExceptionLowestExistingLocationFound.text(locationPart, this.lowestAncestorThatDoesExist);
}
return super.getMessage();
}
/**
* Get the path that was not found
*
* @return the path that was not found
*/
public Location getLocation() {
return location;
}
/**
* Get the lowest (closest) existing {@link Path#getParent() ancestor} of the {@link #getLocation() non-existant location}.
*
* @return the lowest ancestor that does exist
*/
public Path getLowestAncestorThatDoesExist() {
return lowestAncestorThatDoesExist;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy