public NodeCounter setStartNode(int node) { _node = node; _nodeType = _document.getExpandedTypeID(node); return this; }
public int getExpandedTypeID(final int node) { if (node != DTM.NULL) { return _adapters[node >>> DTMManager.IDENT_DTM_NODE_BITS].getExpandedTypeID(node); } else { return DTM.NULL; } }
/** * Returns true if <tt>node</tt> matches the count pattern. By * default a node matches the count patterns if it is of the * same type as the starting node. */ public boolean matchesCount(int node) { return _nodeType == _document.getExpandedTypeID(node); }
public NodeCounter setStartNode(int node) { _node = node; _nodeType = _document.getExpandedTypeID(node); _countSiblings = _document.getTypedAxisIterator(Axis.PRECEDINGSIBLING, _document.getExpandedTypeID(node)); return this; }
public NodeCounter setStartNode(int node) { _node = node; _nodeType = _document.getExpandedTypeID(node); _precSiblings = _document.getAxisIterator(Axis.PRECEDINGSIBLING); return this; }
public NodeCounter setStartNode(int node) { _node = node; _nodeType = _document.getExpandedTypeID(node); _countSiblings = _document.getAxisIterator(Axis.PRECEDINGSIBLING); return this; }
public int getExpandedTypeID(final int node) { final short[] mapping = getMapping(); final int type; if (_enhancedDOM != null) { type = mapping[_enhancedDOM.getExpandedTypeID2(node)]; } else { if(null != mapping) { type = mapping[_dom.getExpandedTypeID(node)]; } else { type = _dom.getExpandedTypeID(node); } } return type; }
int next = _node; result = 0; final int ntype = _document.getExpandedTypeID(_node); final int root = _document.getDocument(); while (next >= 0) { if (ntype == _document.getExpandedTypeID(next)) { result++;
public NodeCounter setStartNode(int node) { _node = node; _nodeType = _document.getExpandedTypeID(node); return this; }
public NodeCounter setStartNode(int node) { _node = node; _nodeType = _document.getExpandedTypeID(node); return this; }
public int getExpandedTypeID(final int node) { if (node != DTM.NULL) { return _adapters[node >>> DTMManager.IDENT_DTM_NODE_BITS].getExpandedTypeID(node); } else { return DTM.NULL; } }
/** * Returns true if <tt>node</tt> matches the count pattern. By * default a node matches the count patterns if it is of the * same type as the starting node. */ public boolean matchesCount(int node) { return _nodeType == _document.getExpandedTypeID(node); }
public int getExpandedTypeID(final int node) { if (node != DTM.NULL) { return _adapters[node >>> DTMManager.IDENT_DTM_NODE_BITS].getExpandedTypeID(node); } else { return DTM.NULL; } }
/** * Returns true if <tt>node</tt> matches the count pattern. By * default a node matches the count patterns if it is of the * same type as the starting node. */ public boolean matchesCount(int node) { return _nodeType == _document.getExpandedTypeID(node); }
public NodeCounter setStartNode(int node) { _node = node; _nodeType = _document.getExpandedTypeID(node); _countSiblings = _document.getTypedAxisIterator(Axis.PRECEDINGSIBLING, _document.getExpandedTypeID(node)); return this; }
public NodeCounter setStartNode(int node) { _node = node; _nodeType = _document.getExpandedTypeID(node); _countSiblings = _document.getAxisIterator(Axis.PRECEDINGSIBLING); return this; }
public NodeCounter setStartNode(int node) { _node = node; _nodeType = _document.getExpandedTypeID(node); _countSiblings = _document.getAxisIterator(Axis.PRECEDINGSIBLING); return this; }
public NodeCounter setStartNode(int node) { _node = node; _nodeType = _document.getExpandedTypeID(node); _precSiblings = _document.getAxisIterator(Axis.PRECEDINGSIBLING); return this; }
public NodeCounter setStartNode(int node) { _node = node; _nodeType = _document.getExpandedTypeID(node); _countSiblings = _document.getAxisIterator(Axis.PRECEDINGSIBLING); return this; }
public NodeCounter setStartNode(int node) { _node = node; _nodeType = _document.getExpandedTypeID(node); _precSiblings = _document.getAxisIterator(Axis.PRECEDINGSIBLING); return this; }