/** * The number of nodes in the list. The range of valid child node indices * is 0 to <code>length-1</code> inclusive. */ public int getLength() { if (m_last == -1) { int node; while ((node = m_iter.next()) != DTMAxisIterator.END) { m_cachedNodes.addElement(node); } m_last = m_cachedNodes.size(); } return m_last; } }
/** * The number of nodes in the list. The range of valid child node indices * is 0 to <code>length-1</code> inclusive. */ public int getLength() { if (m_last == -1) { int node; while ((node = m_iter.next()) != DTMAxisIterator.END) { m_cachedNodes.addElement(node); } m_last = m_cachedNodes.size(); } return m_last; } }
if (m_iter != null) { int node; int count = m_cachedNodes.size();
if (m_iter != null) { int node; int count = m_cachedNodes.size();
/** * Returns where an object is on this stack. * * @param o the desired object. * @return the distance from the top of the stack where the object is] * located; the return value <code>-1</code> indicates that the * object is not on the stack. * @since JDK1.0 */ public int search(int o) { int i = lastIndexOf(o); if (i >= 0) { return size() - i; } return -1; }
/** * Returns where an object is on this stack. * * @param o the desired object. * @return the distance from the top of the stack where the object is] * located; the return value <code>-1</code> indicates that the * object is not on the stack. * @since JDK1.0 */ public int search(int o) { int i = lastIndexOf(o); if (i >= 0) { return size() - i; } return -1; }
/** * The number of nodes in the list. The range of valid child node indices * is 0 to <code>length-1</code> inclusive. */ public int getLength() { if (m_last == -1) { int node; while ((node = m_iter.next()) != DTMAxisIterator.END) { m_cachedNodes.addElement(node); } m_last = m_cachedNodes.size(); } return m_last; } }
/** * The number of nodes in the list. The range of valid child node indices * is 0 to <code>length-1</code> inclusive. */ public int getLength() { if (m_last == -1) { int node; while ((node = m_iter.next()) != DTMAxisIterator.END) { m_cachedNodes.addElement(node); } m_last = m_cachedNodes.size(); } return m_last; } }
/** * The number of nodes in the list. The range of valid child node indices * is 0 to <code>length-1</code> inclusive. */ public int getLength() { if (m_last == -1) { int node; while ((node = m_iter.next()) != DTMAxisIterator.END) { m_cachedNodes.addElement(node); } m_last = m_cachedNodes.size(); } return m_last; } }
/** * The number of nodes in the list. The range of valid child node indices * is 0 to <code>length-1</code> inclusive. */ public int getLength() { if (m_last == -1) { int node; while ((node = m_iter.next()) != DTMAxisIterator.END) { m_cachedNodes.addElement(node); } m_last = m_cachedNodes.size(); } return m_last; } }
/** * The number of nodes in the list. The range of valid child node indices * is 0 to <code>length-1</code> inclusive. */ public int getLength() { if (m_last == -1) { int node; while ((node = m_iter.next()) != DTMAxisIterator.END) { m_cachedNodes.addElement(node); } m_last = m_cachedNodes.size(); } return m_last; } }
/** * The number of nodes in the list. The range of valid child node indices * is 0 to <code>length-1</code> inclusive. */ public int getLength() { if (m_last == -1) { int node; while ((node = m_iter.next()) != DTMAxisIterator.END) { m_cachedNodes.addElement(node); } m_last = m_cachedNodes.size(); } return m_last; } }
/** * The number of nodes in the list. The range of valid child node indices * is 0 to <code>length-1</code> inclusive. */ public int getLength() { if (m_last == -1) { int node; while ((node = m_iter.next()) != DTMAxisIterator.END) { m_cachedNodes.addElement(node); } m_last = m_cachedNodes.size(); } return m_last; } }
/** * The number of nodes in the list. The range of valid child node indices * is 0 to <code>length-1</code> inclusive. */ public int getLength() { if (m_last == -1) { int node; while ((node = m_iter.next()) != DTMAxisIterator.END) { m_cachedNodes.addElement(node); } m_last = m_cachedNodes.size(); } return m_last; } }
/** * The number of nodes in the list. The range of valid child node indices * is 0 to <code>length-1</code> inclusive. */ public int getLength() { if (m_last == -1) { int node; while ((node = m_iter.next()) != DTMAxisIterator.END) { m_cachedNodes.addElement(node); } m_last = m_cachedNodes.size(); } return m_last; } }
if (m_iter != null) { int node; int count = m_cachedNodes.size();
if (m_iter != null) { int node; int count = m_cachedNodes.size();
if (m_iter != null) { int node; int count = m_cachedNodes.size();
if (m_iter != null) { int node; int count = m_cachedNodes.size();
if (m_iter != null) { int node; int count = m_cachedNodes.size();