本文整理汇总了Java中com.sun.org.apache.xpath.internal.patterns.UnionPattern类的典型用法代码示例。如果您正苦于以下问题:Java UnionPattern类的具体用法?Java UnionPattern怎么用?Java UnionPattern使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
UnionPattern类属于com.sun.org.apache.xpath.internal.patterns包,在下文中一共展示了UnionPattern类的2个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的Java代码示例。
示例1: matchPattern
import com.sun.org.apache.xpath.internal.patterns.UnionPattern; //导入依赖的package包/类
/**
* Compile an entire match pattern expression.
*
* @param opPos The current position in the m_opMap array.
*
* @return reference to {@link com.sun.org.apache.xpath.internal.patterns.UnionPattern} instance.
*
* @throws TransformerException if a error occurs creating the Expression.
*/
protected Expression matchPattern(int opPos) throws TransformerException
{
locPathDepth++;
try
{
// First, count...
int nextOpPos = opPos;
int i;
for (i = 0; getOp(nextOpPos) == OpCodes.OP_LOCATIONPATHPATTERN; i++)
{
nextOpPos = getNextOpPos(nextOpPos);
}
if (i == 1)
return compile(opPos);
UnionPattern up = new UnionPattern();
StepPattern[] patterns = new StepPattern[i];
for (i = 0; getOp(opPos) == OpCodes.OP_LOCATIONPATHPATTERN; i++)
{
nextOpPos = getNextOpPos(opPos);
patterns[i] = (StepPattern) compile(opPos);
opPos = nextOpPos;
}
up.setPatterns(patterns);
return up;
}
finally
{
locPathDepth--;
}
}
开发者ID:SunburstApps,项目名称:OpenJSharp,代码行数:46,代码来源:Compiler.java
示例2: visitUnionPattern
import com.sun.org.apache.xpath.internal.patterns.UnionPattern; //导入依赖的package包/类
/**
* Visit a union pattern.
* @param owner The owner of the expression, to which the expression can
* be reset if rewriting takes place.
* @param pattern The union pattern object.
* @return true if the sub expressions should be traversed.
*/
public boolean visitUnionPattern(ExpressionOwner owner, UnionPattern pattern)
{
return true;
}
开发者ID:SunburstApps,项目名称:OpenJSharp,代码行数:12,代码来源:XPathVisitor.java
注:本文中的com.sun.org.apache.xpath.internal.patterns.UnionPattern类示例整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。 |
请发表评论