382383384385386387388389390391392
if(m_predicates[i].isStableNumber() && i == nPredicates - 1) { m_foundLast = true; } } else if (!pred.bool()) return false; countProximityPosition(++m_predicateIndex); } }
141142143144145146147148149150151
// iteration; changing xsl:if to fire one regardless of true/false if (TransformerImpl.S_DEBUG) transformer.getTraceManager().fireTraceEvent(this); if (test.bool()) { transformer.executeChildTemplates(this, true); } if (TransformerImpl.S_DEBUG)
754755756757758759760761762763764
{ return xobj.str(); } else if(javaClass == Boolean.TYPE) { return new Boolean(xobj.bool()); } else if(javaClass.isPrimitive()) { return convertDoubleToNumber(xobj.num(), javaClass); }
813814815816817818819820821822823
108109110111112113114115116117118
if (TransformerImpl.S_DEBUG) transformer.getTraceManager().fireSelectedEvent(sourceNode, when, "test", when.getTest(), test); if (test.bool()) { transformer.getTraceManager().fireTraceEvent(when); transformer.executeChildTemplates(when, true);
683684685686687688689690691692693
case XObject.CLASS_BOOLEAN: { if(javaClass == java.lang.String.class) return xobj.str(); else return new Boolean(xobj.bool()); } // break; Unreachable case XObject.CLASS_NUMBER: { if(javaClass == java.lang.String.class)
691692693694695696697698699700701
case XObject.CLASS_NUMBER: { if(javaClass == java.lang.String.class) return xobj.str(); else if(javaClass == Boolean.TYPE) return new Boolean(xobj.bool()); else { return convertDoubleToNumber(xobj.num(), javaClass); } }
713714715716717718719720721722723
return new Character(str.charAt(0)); else return null; // ?? } else if(javaClass == Boolean.TYPE) return new Boolean(xobj.bool()); else { return convertDoubleToNumber(xobj.num(), javaClass); } }
6566676869707172737475
*/ public static boolean isMatch(Node context, String xpath) throws TransformerException { XObject result = XPathAPI.eval(context, xpath); return result.bool(); } /** * * Returns the first Node that matches the given XPath expression. The
350351352353354355356357358359360
if(m_predicates[i].isStableNumber()) { m_foundLast = true; } } else if (!pred.bool()) return false; countProximityPosition(++m_predicateIndex); } }