org.modeshape.jcr.value.basic.IdentifierPath 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.basic;
import java.util.Collections;
import java.util.Iterator;
import java.util.List;
import org.modeshape.common.annotation.Immutable;
import org.modeshape.common.collection.SingleIterator;
import org.modeshape.common.text.Inflector;
import org.modeshape.common.text.TextEncoder;
import org.modeshape.common.util.CheckArg;
import org.modeshape.jcr.GraphI18n;
import org.modeshape.jcr.value.InvalidPathException;
import org.modeshape.jcr.value.Name;
import org.modeshape.jcr.value.NamespaceRegistry;
import org.modeshape.jcr.value.Path;
/**
* Optimized implementation of {@link Path} that serves as a JCR identifier path.
*/
@Immutable
public class IdentifierPath extends AbstractPath {
/**
* The serializable version. Version {@value}
*/
private static final long serialVersionUID = 1L;
private final IdentifierPathSegment idSegment;
private transient List segments;
public IdentifierPath( IdentifierPathSegment idSegment ) {
this.idSegment = idSegment;
}
@Override
public Path getAncestor( int degree ) {
CheckArg.isNonNegative(degree, "degree");
if (degree == 0) {
return this;
}
String msg = GraphI18n.pathAncestorDegreeIsInvalid.text(this.getString(), Inflector.getInstance().ordinalize(degree));
throw new InvalidPathException(msg);
}
@Override
protected Iterator getSegmentsOfParent() {
return new SingleIterator(idSegment);
}
@Override
public Path getCanonicalPath() {
return this;
}
@Override
public Path getCommonAncestor( Path that ) {
CheckArg.isNotNull(that, "that");
return this.equals(that) ? this : RootPath.INSTANCE;
}
@Override
public Segment getLastSegment() {
return idSegment;
}
@Override
public boolean endsWith( Name nameOfLastSegment ) {
return idSegment.getName().equals(nameOfLastSegment);
}
@Override
public boolean endsWith( Name nameOfLastSegment,
int snsIndex ) {
return snsIndex == 1 && idSegment.getName().equals(nameOfLastSegment);
}
@Override
public Path getNormalizedPath() {
return this; // already normalized
}
@Override
public Path relativeToRoot() {
return new BasicPath(getSegmentsList(), false);
}
@Override
public Path getParent() {
return RootPath.INSTANCE;
}
@Override
public Segment getSegment( int index ) {
CheckArg.isNonNegative(index, "index");
if (index == 0) return idSegment;
throw new IndexOutOfBoundsException();
}
@Override
public Segment[] getSegmentsArray() {
return new Segment[] {idSegment};
}
@Override
public List getSegmentsList() {
if (segments == null) {
// Idempotent, so can do this without locking ...
segments = Collections.singletonList((Segment)idSegment);
}
return segments;
}
@Override
public String getString() {
return idSegment.getString();
}
@Override
public String getString( TextEncoder encoder ) {
return idSegment.getString(encoder);
}
@Override
public String getString( NamespaceRegistry namespaceRegistry ) {
CheckArg.isNotNull(namespaceRegistry, "namespaceRegistry");
return idSegment.getString(namespaceRegistry);
}
@Override
public String getString( NamespaceRegistry namespaceRegistry,
TextEncoder encoder ) {
CheckArg.isNotNull(namespaceRegistry, "namespaceRegistry");
return idSegment.getString(namespaceRegistry, encoder);
}
@Override
public String getString( NamespaceRegistry namespaceRegistry,
TextEncoder encoder,
TextEncoder delimiterEncoder ) {
return (delimiterEncoder == null) ? getString(namespaceRegistry, encoder) : delimiterEncoder.encode(getString(namespaceRegistry,
encoder));
}
@Override
public boolean hasSameAncestor( Path that ) {
CheckArg.isNotNull(that, "that");
return true;
}
@Override
public boolean isAbsolute() {
return true;
}
@Override
public boolean isIdentifier() {
return true;
}
@Override
public boolean isNormalized() {
return true;
}
@Override
public boolean isRoot() {
return false;
}
@Override
public boolean isSameAs( Path other ) {
CheckArg.isNotNull(other, "other");
return other.isIdentifier() && idSegment.equals(other.getLastSegment());
}
@Override
public boolean isAncestorOf( Path descendant ) {
CheckArg.isNotNull(descendant, "descendant");
return false;
}
@Override
public boolean isDescendantOf( Path ancestor ) {
CheckArg.isNotNull(ancestor, "ancestor");
return false;
}
@Override
public boolean isAtOrAbove( Path other ) {
CheckArg.isNotNull(other, "other");
return this.isSameAs(other);
}
@Override
public boolean isAtOrBelow( Path other ) {
CheckArg.isNotNull(other, "other");
return this.isSameAs(other);
}
@Override
public Path resolve( Path relativePath ) {
CheckArg.isNotNull(relativePath, "relative path");
String msg = GraphI18n.unableToResolvePathRelativeToIdentifierPath.text(relativePath, this);
throw new InvalidPathException(msg);
}
@Override
public Iterator iterator() {
return new SingleIterator(idSegment);
}
@Override
public int size() {
return 1;
}
@Override
public Path subpath( int beginIndex ) {
CheckArg.isNonNegative(beginIndex, "beginIndex");
if (beginIndex == 0) return this;
throw new IndexOutOfBoundsException();
}
@Override
public Path subpath( int beginIndex,
int endIndex ) {
CheckArg.isNonNegative(beginIndex, "beginIndex");
CheckArg.isNonNegative(endIndex, "endIndex");
if (beginIndex != 0) {
throw new IndexOutOfBoundsException();
}
if (endIndex >= 1) {
throw new IndexOutOfBoundsException();
}
return this;
}
@Override
public int compareTo( Path other ) {
return other.isIdentifier() ? idSegment.compareTo(other.getLastSegment()) : super.compareTo(other);
}
@Override
public boolean equals( Object obj ) {
if (obj == this) return true;
if (obj instanceof Path) {
Path that = (Path)obj;
return that.isIdentifier() && idSegment.equals(that.getLastSegment());
}
return false;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy