/** * If the iterator needs to cache nodes as they are fetched, * then this method returns true. */ public boolean hasCache() { final NodeVector nv = getVector(); return (nv != null); }
/** * If this NodeSequence has a cache, mark that it is complete. * This method should be called after the iterator is exhausted. */ private void markCacheComplete() { NodeVector nv = getVector(); if (nv != null) { m_cache.setCacheComplete(true); } }
/** * If this NodeSequence has a cache, mark that it is complete. * This method should be called after the iterator is exhausted. */ private void markCacheComplete() { NodeVector nv = getVector(); if (nv != null) { m_cache.setCacheComplete(true); } }
/** * If the iterator needs to cache nodes as they are fetched, * then this method returns true. */ public boolean hasCache() { final NodeVector nv = getVector(); return (nv != null); }
/** * @see DTMIterator#getCurrentNode() */ public int getCurrentNode() { if(hasCache()) { int currentIndex = m_next-1; NodeVector vec = getVector(); if((currentIndex >= 0) && (currentIndex < vec.size())) return vec.elementAt(currentIndex); else return DTM.NULL; } if(null != m_iter) { return m_iter.getCurrentNode(); } else return DTM.NULL; }
/** * @see DTMIterator#getCurrentNode() */ public int getCurrentNode() { if(hasCache()) { int currentIndex = m_next-1; NodeVector vec = getVector(); if((currentIndex >= 0) && (currentIndex < vec.size())) return vec.elementAt(currentIndex); else return DTM.NULL; } if(null != m_iter) { return m_iter.getCurrentNode(); } else return DTM.NULL; }
NodeVector vec = getVector(); if(null != vec)
NodeVector vec = getVector(); if(null != vec)
NodeVector vec = getVector();
NodeVector vec = getVector();
/** * If this NodeSequence has a cache, mark that it is complete. * This method should be called after the iterator is exhausted. */ private void markCacheComplete() { NodeVector nv = getVector(); if (nv != null) { m_cache.setCacheComplete(true); } }
/** * If this NodeSequence has a cache, mark that it is complete. * This method should be called after the iterator is exhausted. */ private void markCacheComplete() { NodeVector nv = getVector(); if (nv != null) { m_cache.setCacheComplete(true); } }
/** * If the iterator needs to cache nodes as they are fetched, * then this method returns true. */ public boolean hasCache() { final NodeVector nv = getVector(); return (nv != null); }
/** * If the iterator needs to cache nodes as they are fetched, * then this method returns true. */ public boolean hasCache() { final NodeVector nv = getVector(); return (nv != null); }
/** * If this NodeSequence has a cache, mark that it is complete. * This method should be called after the iterator is exhausted. */ private void markCacheComplete() { NodeVector nv = getVector(); if (nv != null) { m_cache.setCacheComplete(true); } }
/** * If this NodeSequence has a cache, mark that it is complete. * This method should be called after the iterator is exhausted. */ private void markCacheComplete() { NodeVector nv = getVector(); if (nv != null) { m_cache.setCacheComplete(true); } }