| Methods Summary |
|---|
| public void | calcScore()Static calc of match score.
if ((getPredicateCount() > 0) || (null != m_relativePathPattern))
{
m_score = SCORE_OTHER;
}
else
super.calcScore();
if (null == m_targetString)
calcTargetString();
|
| public void | calcTargetString()Calculate the local name or psuedo name of the node that this pattern will test,
for hash table lookup optimization.
int whatToShow = getWhatToShow();
switch (whatToShow)
{
case DTMFilter.SHOW_COMMENT :
m_targetString = PsuedoNames.PSEUDONAME_COMMENT;
break;
case DTMFilter.SHOW_TEXT :
case DTMFilter.SHOW_CDATA_SECTION :
case (DTMFilter.SHOW_TEXT | DTMFilter.SHOW_CDATA_SECTION) :
m_targetString = PsuedoNames.PSEUDONAME_TEXT;
break;
case DTMFilter.SHOW_ALL :
m_targetString = PsuedoNames.PSEUDONAME_ANY;
break;
case DTMFilter.SHOW_DOCUMENT :
case DTMFilter.SHOW_DOCUMENT | DTMFilter.SHOW_DOCUMENT_FRAGMENT :
m_targetString = PsuedoNames.PSEUDONAME_ROOT;
break;
case DTMFilter.SHOW_ELEMENT :
if (this.WILD == m_name)
m_targetString = PsuedoNames.PSEUDONAME_ANY;
else
m_targetString = m_name;
break;
default :
m_targetString = PsuedoNames.PSEUDONAME_ANY;
break;
}
|
| protected void | callSubtreeVisitors(com.sun.org.apache.xpath.internal.XPathVisitor visitor)Call the visitors on the subtree. Factored out from callVisitors
so it may be called by derived classes.
if (null != m_predicates)
{
int n = m_predicates.length;
for (int i = 0; i < n; i++)
{
ExpressionOwner predOwner = new PredOwner(i);
if (visitor.visitPredicate(predOwner, m_predicates[i]))
{
m_predicates[i].callVisitors(predOwner, visitor);
}
}
}
if (null != m_relativePathPattern)
{
m_relativePathPattern.callVisitors(this, visitor);
}
|
| public void | callVisitors(com.sun.org.apache.xpath.internal.ExpressionOwner owner, com.sun.org.apache.xpath.internal.XPathVisitor visitor)
if(visitor.visitMatchPattern(owner, this))
{
callSubtreeVisitors(visitor);
}
|
| public boolean | canTraverseOutsideSubtree()Tell if this expression or it's subexpressions can traverse outside
the current subtree.
NOTE: Ancestors tests with predicates are problematic, and will require
special treatment.
int n = getPredicateCount();
for (int i = 0; i < n; i++)
{
if (getPredicate(i).canTraverseOutsideSubtree())
return true;
}
return false;
|
| private final boolean | checkProximityPosition(com.sun.org.apache.xpath.internal.XPathContext xctxt, int predPos, com.sun.org.apache.xml.internal.dtm.DTM dtm, int context, int pos)New Method to check whether the current node satisfies a position predicate
try
{
DTMAxisTraverser traverser =
dtm.getAxisTraverser(Axis.PRECEDINGSIBLING);
for (int child = traverser.first(context); DTM.NULL != child;
child = traverser.next(context, child))
{
try
{
xctxt.pushCurrentNode(child);
if (NodeTest.SCORE_NONE != super.execute(xctxt, child))
{
boolean pass = true;
try
{
xctxt.pushSubContextList(this);
for (int i = 0; i < predPos; i++)
{
xctxt.pushPredicatePos(i);
try
{
XObject pred = m_predicates[i].execute(xctxt);
try
{
if (XObject.CLASS_NUMBER == pred.getType())
{
throw new Error("Why: Should never have been called");
}
else if (!pred.boolWithSideEffects())
{
pass = false;
break;
}
}
finally
{
pred.detach();
}
}
finally
{
xctxt.popPredicatePos();
}
}
}
finally
{
xctxt.popSubContextList();
}
if (pass)
pos--;
if (pos < 1)
return false;
}
}
finally
{
xctxt.popCurrentNode();
}
}
}
catch (javax.xml.transform.TransformerException se)
{
// TODO: should keep throw sax exception...
throw new java.lang.RuntimeException(se.getMessage());
}
return (pos == 1);
|
| public boolean | deepEquals(com.sun.org.apache.xpath.internal.Expression expr)
if(!super.deepEquals(expr))
return false;
StepPattern sp = (StepPattern)expr;
if (null != m_predicates)
{
int n = m_predicates.length;
if ((null == sp.m_predicates) || (sp.m_predicates.length != n))
return false;
for (int i = 0; i < n; i++)
{
if (!m_predicates[i].deepEquals(sp.m_predicates[i]))
return false;
}
}
else if (null != sp.m_predicates)
return false;
if(null != m_relativePathPattern)
{
if(!m_relativePathPattern.deepEquals(sp.m_relativePathPattern))
return false;
}
else if(sp.m_relativePathPattern != null)
return false;
return true;
|
| public com.sun.org.apache.xpath.internal.objects.XObject | execute(com.sun.org.apache.xpath.internal.XPathContext xctxt, int currentNode)Execute this pattern step, including predicates.
DTM dtm = xctxt.getDTM(currentNode);
if (dtm != null)
{
int expType = dtm.getExpandedTypeID(currentNode);
return execute(xctxt, currentNode, dtm, expType);
}
return NodeTest.SCORE_NONE;
|
| public com.sun.org.apache.xpath.internal.objects.XObject | execute(com.sun.org.apache.xpath.internal.XPathContext xctxt)Execute this pattern step, including predicates.
return execute(xctxt, xctxt.getCurrentNode());
|
| public com.sun.org.apache.xpath.internal.objects.XObject | execute(com.sun.org.apache.xpath.internal.XPathContext xctxt, int currentNode, com.sun.org.apache.xml.internal.dtm.DTM dtm, int expType)Execute an expression in the XPath runtime context, and return the
result of the expression.
if (m_whatToShow == NodeTest.SHOW_BYFUNCTION)
{
if (null != m_relativePathPattern)
{
return m_relativePathPattern.execute(xctxt);
}
else
return NodeTest.SCORE_NONE;
}
XObject score;
score = super.execute(xctxt, currentNode, dtm, expType);
if (score == NodeTest.SCORE_NONE)
return NodeTest.SCORE_NONE;
if (getPredicateCount() != 0)
{
if (!executePredicates(xctxt, dtm, currentNode))
return NodeTest.SCORE_NONE;
}
if (null != m_relativePathPattern)
return m_relativePathPattern.executeRelativePathPattern(xctxt, dtm,
currentNode);
return score;
|
| protected final boolean | executePredicates(com.sun.org.apache.xpath.internal.XPathContext xctxt, com.sun.org.apache.xml.internal.dtm.DTM dtm, int currentNode)Execute the predicates on this step to determine if the current node
should be filtered or accepted.
boolean result = true;
boolean positionAlreadySeen = false;
int n = getPredicateCount();
try
{
xctxt.pushSubContextList(this);
for (int i = 0; i < n; i++)
{
xctxt.pushPredicatePos(i);
try
{
XObject pred = m_predicates[i].execute(xctxt);
try
{
if (XObject.CLASS_NUMBER == pred.getType())
{
int pos = (int) pred.num();
if (positionAlreadySeen)
{
result = (pos == 1);
break;
}
else
{
positionAlreadySeen = true;
if (!checkProximityPosition(xctxt, i, dtm, currentNode, pos))
{
result = false;
break;
}
}
}
else if (!pred.boolWithSideEffects())
{
result = false;
break;
}
}
finally
{
pred.detach();
}
}
finally
{
xctxt.popPredicatePos();
}
}
}
finally
{
xctxt.popSubContextList();
}
return result;
|
| protected final com.sun.org.apache.xpath.internal.objects.XObject | executeRelativePathPattern(com.sun.org.apache.xpath.internal.XPathContext xctxt, com.sun.org.apache.xml.internal.dtm.DTM dtm, int currentNode)Execute the match pattern step relative to another step.
XObject score = NodeTest.SCORE_NONE;
int context = currentNode;
DTMAxisTraverser traverser;
traverser = dtm.getAxisTraverser(m_axis);
for (int relative = traverser.first(context); DTM.NULL != relative;
relative = traverser.next(context, relative))
{
try
{
xctxt.pushCurrentNode(relative);
score = execute(xctxt);
if (score != NodeTest.SCORE_NONE)
break;
}
finally
{
xctxt.popCurrentNode();
}
}
return score;
|
| public void | fixupVariables(java.util.Vector vars, int globalsSize)This function is used to fixup variables from QNames to stack frame
indexes at stylesheet build time.
super.fixupVariables(vars, globalsSize);
if (null != m_predicates)
{
for (int i = 0; i < m_predicates.length; i++)
{
m_predicates[i].fixupVariables(vars, globalsSize);
}
}
if (null != m_relativePathPattern)
{
m_relativePathPattern.fixupVariables(vars, globalsSize);
}
|
| public int | getAxis()Get the axis that this step follows.
return m_axis;
|
| public com.sun.org.apache.xpath.internal.Expression | getExpression()
return m_relativePathPattern;
|
| public int | getLastPos(com.sun.org.apache.xpath.internal.XPathContext xctxt)Get the count of the nodes that match the test, which is the proximity
position of the last node that can pass this test in the sub context
selection. In XSLT 1-based indexing, this count is the index of the last
node.
return getProximityPosition(xctxt, xctxt.getPredicatePos(), true);
|
| public double | getMatchScore(com.sun.org.apache.xpath.internal.XPathContext xctxt, int context)Get the match score of the given node.
xctxt.pushCurrentNode(context);
xctxt.pushCurrentExpressionNode(context);
try
{
XObject score = execute(xctxt);
return score.num();
}
finally
{
xctxt.popCurrentNode();
xctxt.popCurrentExpressionNode();
}
// return XPath.MATCH_SCORE_NONE;
|
| public com.sun.org.apache.xpath.internal.Expression | getPredicate(int i)Get a predicate expression.
return m_predicates[i];
|
| public final int | getPredicateCount()Get the number of predicates for this match pattern step.
return (null == m_predicates) ? 0 : m_predicates.length;
|
| public com.sun.org.apache.xpath.internal.Expression[] | getPredicates()Set the list of predicate expressions for this pattern step.
return m_predicates;
|
| private final int | getProximityPosition(com.sun.org.apache.xpath.internal.XPathContext xctxt, int predPos, boolean findLast)Get the proximity position index of the current node based on this
node test.
int pos = 0;
int context = xctxt.getCurrentNode();
DTM dtm = xctxt.getDTM(context);
int parent = dtm.getParent(context);
try
{
DTMAxisTraverser traverser = dtm.getAxisTraverser(Axis.CHILD);
for (int child = traverser.first(parent); DTM.NULL != child;
child = traverser.next(parent, child))
{
try
{
xctxt.pushCurrentNode(child);
if (NodeTest.SCORE_NONE != super.execute(xctxt, child))
{
boolean pass = true;
try
{
xctxt.pushSubContextList(this);
for (int i = 0; i < predPos; i++)
{
xctxt.pushPredicatePos(i);
try
{
XObject pred = m_predicates[i].execute(xctxt);
try
{
if (XObject.CLASS_NUMBER == pred.getType())
{
if ((pos + 1) != (int) pred.numWithSideEffects())
{
pass = false;
break;
}
}
else if (!pred.boolWithSideEffects())
{
pass = false;
break;
}
}
finally
{
pred.detach();
}
}
finally
{
xctxt.popPredicatePos();
}
}
}
finally
{
xctxt.popSubContextList();
}
if (pass)
pos++;
if (!findLast && child == context)
{
return pos;
}
}
}
finally
{
xctxt.popCurrentNode();
}
}
}
catch (javax.xml.transform.TransformerException se)
{
// TODO: should keep throw sax exception...
throw new java.lang.RuntimeException(se.getMessage());
}
return pos;
|
| public int | getProximityPosition(com.sun.org.apache.xpath.internal.XPathContext xctxt)Get the proximity position index of the current node based on this
node test.
return getProximityPosition(xctxt, xctxt.getPredicatePos(), false);
|
| public com.sun.org.apache.xpath.internal.patterns.StepPattern | getRelativePathPattern()Get the reference to nodetest and predicate for
parent or ancestor.
return m_relativePathPattern;
|
| public java.lang.String | getTargetString()Get the local name or psuedo name of the node that this pattern will test,
for hash table lookup optimization.
return m_targetString;
|
| public void | setAxis(int axis)Set the axis that this step should follow.
m_axis = axis;
|
| public void | setExpression(com.sun.org.apache.xpath.internal.Expression exp)
exp.exprSetParent(this);
m_relativePathPattern = (StepPattern)exp;
|
| public void | setPredicates(com.sun.org.apache.xpath.internal.Expression[] predicates)Set the predicates for this match pattern step.
m_predicates = predicates;
if(null != predicates)
{
for(int i = 0; i < predicates.length; i++)
{
predicates[i].exprSetParent(this);
}
}
calcScore();
|
| public void | setRelativePathPattern(com.sun.org.apache.xpath.internal.patterns.StepPattern expr)Set the reference to nodetest and predicate for
parent or ancestor.
m_relativePathPattern = expr;
expr.exprSetParent(this);
calcScore();
|
| public java.lang.String | toString()Get the string represenentation of this step for diagnostic purposes.
StringBuffer buf = new StringBuffer();
for (StepPattern pat = this; pat != null; pat = pat.m_relativePathPattern)
{
if (pat != this)
buf.append("/");
buf.append(Axis.names[pat.m_axis]);
buf.append("::");
if (0x000005000 == pat.m_whatToShow)
{
buf.append("doc()");
}
else if (DTMFilter.SHOW_BYFUNCTION == pat.m_whatToShow)
{
buf.append("function()");
}
else if (DTMFilter.SHOW_ALL == pat.m_whatToShow)
{
buf.append("node()");
}
else if (DTMFilter.SHOW_TEXT == pat.m_whatToShow)
{
buf.append("text()");
}
else if (DTMFilter.SHOW_PROCESSING_INSTRUCTION == pat.m_whatToShow)
{
buf.append("processing-instruction(");
if (null != pat.m_name)
{
buf.append(pat.m_name);
}
buf.append(")");
}
else if (DTMFilter.SHOW_COMMENT == pat.m_whatToShow)
{
buf.append("comment()");
}
else if (null != pat.m_name)
{
if (DTMFilter.SHOW_ATTRIBUTE == pat.m_whatToShow)
{
buf.append("@");
}
if (null != pat.m_namespace)
{
buf.append("{");
buf.append(pat.m_namespace);
buf.append("}");
}
buf.append(pat.m_name);
}
else if (DTMFilter.SHOW_ATTRIBUTE == pat.m_whatToShow)
{
buf.append("@");
}
else if ((DTMFilter.SHOW_DOCUMENT | DTMFilter.SHOW_DOCUMENT_FRAGMENT)
== pat.m_whatToShow)
{
buf.append("doc-root()");
}
else
{
buf.append("?" + Integer.toHexString(pat.m_whatToShow));
}
if (null != pat.m_predicates)
{
for (int i = 0; i < pat.m_predicates.length; i++)
{
buf.append("[");
buf.append(pat.m_predicates[i]);
buf.append("]");
}
}
}
return buf.toString();
|
