public NodeCounter setStartNode(int node) { _node = node; _nodeType = _document.getExpandedTypeID(node); _precSiblings = _document.getAxisIterator(Axis.PRECEDINGSIBLING); return this; }
public DTMAxisIterator getAxisIterator(final int axis) { if (_enhancedDOM != null) { return _enhancedDOM.getAxisIterator(axis); } else { return _dom.getAxisIterator(axis); } }
public NodeCounter setStartNode(int node) { _node = node; _nodeType = _document.getExpandedTypeID(node); _countSiblings = _document.getAxisIterator(Axis.PRECEDINGSIBLING); return this; }
public DTMAxisIterator setStartNode(final int node) { if (node == DTM.NULL) { return this; } int dom = node >>> DTMManager.IDENT_DTM_NODE_BITS; // Get a new source first time and when mask changes if (_source == null || _dtmId != dom) { if (_type == NO_TYPE) { _source = _adapters[dom].getAxisIterator(_axis); } else if (_axis == Axis.CHILD) { _source = _adapters[dom].getTypedChildren(_type); } else { _source = _adapters[dom].getTypedAxisIterator(_axis, _type); } } _dtmId = dom; _source.setStartNode(node); return this; }
int rootHandle = _dom.getAxisIterator(Axis.ROOT) .setStartNode(node).next();
/** * <p>Given a context node and the second argument to the XSLT * <code>key</code> function, checks whether the context node is in the * set of nodes that results from that reference to the <code>key</code> * function. This is used in the implementation of key patterns.</p> * <p>This particular {@link KeyIndex} object is the result evaluating the * first argument to the <code>key</code> function, so it's not taken into * any further account.</p> * * @param node The context node * @param value The second argument to the <code>key</code> function * @return <code>1</code> if and only if the context node is in the set of * nodes returned by the reference to the <code>key</code> function; * <code>0</code>, otherwise */ public int containsKey(int node, Object value) { int rootHandle = _dom.getAxisIterator(Axis.ROOT) .setStartNode(node).next(); // Get the mapping table for the document containing the context node Hashtable index = (Hashtable) _rootToIndexMap.get(new Integer(rootHandle)); // Check whether the context node is present in the set of nodes // returned by the key function if (index != null) { final IntegerArray nodes = (IntegerArray) index.get(value); return (nodes != null && nodes.indexOf(node) >= 0) ? 1 : 0; } // The particular key name identifies no nodes in this document return 0; }
multiDOM.addDOMAdapter(domAdapter); DTMAxisIterator iter1 = idom.getAxisIterator(Axis.CHILD); DTMAxisIterator iter2 = idom.getAxisIterator(Axis.CHILD); iter = new AbsoluteIterator( new StepIterator(iter1, iter2)); childIter = idom.getAxisIterator(Axis.CHILD); attrIter = idom.getAxisIterator(Axis.ATTRIBUTE);
int rootHandle = _dom.getAxisIterator(Axis.ROOT) .setStartNode(_startNode).next();
public DTMAxisIterator getAxisIterator(final int axis) { if (_enhancedDOM != null) { return _enhancedDOM.getAxisIterator(axis); } else { return _dom.getAxisIterator(axis); } }
public DTMAxisIterator getAxisIterator(final int axis) { if (_enhancedDOM != null) { return _enhancedDOM.getAxisIterator(axis); } else { return _dom.getAxisIterator(axis); } }
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; }
public NodeCounter setStartNode(int node) { _node = node; _nodeType = _document.getExpandedTypeID(node); _precSiblings = _document.getAxisIterator(Axis.PRECEDINGSIBLING); return this; }
public DTMAxisIterator getAxisIterator(final int axis) { if (_enhancedDOM != null) { return _enhancedDOM.getAxisIterator(axis); } else { return _dom.getAxisIterator(axis); } }
public DTMAxisIterator setStartNode(final int node) { if (node == DTM.NULL) { return this; } int dom = node >>> DTMManager.IDENT_DTM_NODE_BITS; // Get a new source first time and when mask changes if (_source == null || _dtmId != dom) { if (_type == NO_TYPE) { _source = _adapters[dom].getAxisIterator(_axis); } else if (_axis == Axis.CHILD) { _source = _adapters[dom].getTypedChildren(_type); } else { _source = _adapters[dom].getTypedAxisIterator(_axis, _type); } } _dtmId = dom; _source.setStartNode(node); return this; }
public DTMAxisIterator setStartNode(final int node) { if (node == DTM.NULL) { return this; } int dom = node >>> DTMManager.IDENT_DTM_NODE_BITS; // Get a new source first time and when mask changes if (_source == null || _dtmId != dom) { if (_type == NO_TYPE) { _source = _adapters[dom].getAxisIterator(_axis); } else if (_axis == Axis.CHILD) { _source = _adapters[dom].getTypedChildren(_type); } else { _source = _adapters[dom].getTypedAxisIterator(_axis, _type); } } _dtmId = dom; _source.setStartNode(node); return this; }
public DTMAxisIterator setStartNode(final int node) { if (node == DTM.NULL) { return this; } int dom = node >>> DTMManager.IDENT_DTM_NODE_BITS; // Get a new source first time and when mask changes if (_source == null || _dtmId != dom) { if (_type == NO_TYPE) { _source = _adapters[dom].getAxisIterator(_axis); } else if (_axis == Axis.CHILD) { _source = _adapters[dom].getTypedChildren(_type); } else { _source = _adapters[dom].getTypedAxisIterator(_axis, _type); } } _dtmId = dom; _source.setStartNode(node); return this; }