|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface Path
The Path
interface defines the SPI level representation of
a JCR path. It consists of an ordered list of Path.Element
objects
and is immutable.
Path.Element
is either named
or one of the following special elements:
current
element (Notation: "."),parent
element (Notation: ".."),root
element (Notation: {}), which can
only occur as the first element in a path.Path
is defined to have the following characteristics:
Equality:length
of a path is the number of its elements.
Depth:depth
of a path is
is absolute
if its first element is the root
element. A path is relative if it is not absolute.
is normalized
if P has minimal length
amongst the set of all paths Q which are equivalent to P.equivalent
to path Q (in the above sense)
if the normalization of P is equal to the normalization of Q. This is
an equivalence relation (i.e. reflexive, transitive,
and symmetric).
Canonical Paths:is canonical
if its absolute and normalized.
Hierarchical Relationship:ancestor
of path Q if
descendant
of path Q if
Nested Class Summary | |
---|---|
static interface |
Path.Element
Object representation of a single JCR path element. |
Field Summary | |
---|---|
static char |
DELIMITER
Delimiter used in order to concatenate the Path.Element objects upon getString() . |
static int |
INDEX_DEFAULT
Constant representing the default (initial) index value. |
static int |
INDEX_UNDEFINED
Constant representing an undefined index value |
static int |
ROOT_DEPTH
Constant defining the depth of the root path |
Method Summary | |
---|---|
Path |
computeRelativePath(Path other)
Computes the relative path from this absolute path to
other . |
boolean |
denotesIdentifier()
Test if this path represents an unresolved identifier-based path. |
boolean |
denotesRoot()
Tests whether this path represents the root path, i.e. |
Path |
getAncestor(int degree)
Normalizes this path and returns the ancestor path of the specified relative degree. |
int |
getAncestorCount()
Returns the number of ancestors of this path. |
Path |
getCanonicalPath()
Returns the canonical path representation of this path. |
int |
getDepth()
Returns the depth of this path. |
Path.Element[] |
getElements()
Returns the elements of this path. |
int |
getLength()
Returns the length of this path, i.e. |
Path.Element |
getNameElement()
Returns the name element (i.e. |
Path |
getNormalizedPath()
Returns the normalized path representation of this path. |
String |
getString()
Returns the String representation of this Path as it is used by PathFactory.create(String) .
The String representation must consist of the String representation of
its elements separated by DELIMITER . |
boolean |
isAbsolute()
Tests whether this path is absolute, i.e. |
boolean |
isAncestorOf(Path other)
Determines if this path is an ancestor of the specified path, based on their (absolute or relative) hierarchy level as returned by . |
boolean |
isCanonical()
Tests whether this path is canonical, i.e. |
boolean |
isDescendantOf(Path other)
Determines if this path is a descendant of the specified path, based on their (absolute or relative) hierarchy level as returned by . |
boolean |
isEquivalentTo(Path other)
Determines if the the other path would be equal to this
path if both of them are normalized. |
boolean |
isNormalized()
Tests whether this path is normalized, i.e. |
Path |
subPath(int from,
int to)
Returns a new Path consisting of those Path.Element objects
between the given from , inclusive, and the given to ,
exclusive. |
Field Detail |
---|
static final int INDEX_UNDEFINED
static final int INDEX_DEFAULT
static final int ROOT_DEPTH
static final char DELIMITER
getString()
.
Method Detail |
---|
boolean denotesRoot()
boolean denotesIdentifier()
true
if this path represents an unresolved
identifier-based path.boolean isAbsolute()
boolean isCanonical()
isAbsolute()
boolean isNormalized()
getNormalizedPath()
Path getNormalizedPath() throws RepositoryException
RepositoryException
- if the path cannot be normalized.isNormalized()
Path getCanonicalPath() throws RepositoryException
RepositoryException
- if this path can not be canonicalized
(e.g. if it is relative).Path computeRelativePath(Path other) throws RepositoryException
this
absolute path to
other
.
other
- an absolute path.
this
path to other
path.
RepositoryException
- if either this
or
other
path is not absolute.Path getAncestor(int degree) throws IllegalArgumentException, PathNotFoundException, RepositoryException
degree
exists. Such an implementation
should properly build the ancestor (i.e. parent of .. is ../..) and
leave if it the caller to throw PathNotFoundException
.
degree
- the relative degree of the requested ancestor.
IllegalArgumentException
- if degree
is negative.
PathNotFoundException
- if the implementation is able to determine
that there is no ancestor of the specified degree. In case of this
being an absolute path, this would be the case if degree
is
greater that the depth
of this path.
RepositoryException
- If the implementation is not able to determine
the ancestor of the specified degree for some other reason.int getAncestorCount()
getDepth()
in case of a absolute path.
For relative path the number of ancestors cannot be determined and
-1 should be returned.
getDepth()
,
getLength()
,
isCanonical()
int getLength()
getDepth()
.
getDepth()
,
getAncestorCount()
int getDepth() throws RepositoryException
RepositoryException
- If the depths cannot be determined.getLength()
,
getAncestorCount()
boolean isEquivalentTo(Path other) throws IllegalArgumentException, RepositoryException
other
path would be equal to this
path if both of them are normalized.
other
- Another path.
IllegalArgumentException
- if the given path is null
or if not both paths are either absolute or relative.
RepositoryException
- if any of the path cannot be normalized.boolean isAncestorOf(Path other) throws IllegalArgumentException, RepositoryException
getDepth()
. In case of undefined ancestor/descendant
relationship that might occur with relative paths, the return value
should be false
.
true
if other
is a descendant;
otherwise false
.
IllegalArgumentException
- if the given path is null
or if not both paths are either absolute or relative.
RepositoryException
- if any of the path cannot be normalized.getDepth()
boolean isDescendantOf(Path other) throws IllegalArgumentException, RepositoryException
getDepth()
. In case of undefined ancestor/descendant
relationship that might occur with relative paths, the return value
should be false
.
true
if other
is an ancestor;
otherwise false
.
IllegalArgumentException
- if the given path is null
or if not both paths are either absolute or relative.
RepositoryException
- if any of the path cannot be normalized.isAncestorOf(Path)
Path subPath(int from, int to) throws IllegalArgumentException, RepositoryException
Path
consisting of those Path.Element objects
between the given from
, inclusive, and the given to
,
exclusive. An IllegalArgumentException
is thrown if from
is greater or equal than to
or if any of both params is
out of the possible range. A RepositoryException
is thrown
if this Path
is not normalized.
from
- index of the element to start with and low endpoint
(inclusive) within the list of elements to use for the sub-path.to
- index of the element outside of the range i.e. high endpoint
(exclusive) within the list of elements to use for the sub-path.
Path
consisting of those Path.Element objects
between the given from
, inclusive, and the given
to
, exclusive.
IllegalArgumentException
- if from
is greater or equal than to
or if any of both params is
out of the possible range.
RepositoryException
- If this Path is not normalized.Path.Element[] getElements()
Path.Element getNameElement()
String getString()
PathFactory.create(String)
.
The String representation must consist of the String representation of
its elements separated by DELIMITER
.
Path.Element.getString()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |