Lines Matching refs:cache
53 * A cache of a list of nodes obtained from the iterator so far.
55 * the cache is complete.
57 * Multiple NodeSequence objects may share the same cache.
62 * If this iterator needs to cache nodes that are fetched, they
71 * Get the cache (if any) of nodes obtained from
72 * the iterator so far. Note that the cache keeps
74 * at which point the cache is "complete".
90 * If the iterator needs to cache nodes as they are fetched,
100 * If this NodeSequence has a cache, and that cache is
102 * if there is no cache or it is not complete it returns false.
115 * If this NodeSequence has a cache, mark that it is complete.
312 // If the cache is on, and the node has already been found, then
317 // There is a cache
320 // The node is in the cache, so just return it.
357 // We have exhausted the iterator, and if there is a cache
358 // it must have all nodes in it by now, so let the cache
546 * to a different value, and the cache is shared
548 * then make a copy of the cache and use it
550 * users of the cache.
570 /* When we get to here the new cache has
589 IteratorCache cache = getCache();
591 if(cache != null)
594 if (cache.isComplete()) {
596 // so just return the number of nodes in the cache
597 NodeVector nv = cache.getVector();
636 // NodeSequence object shares the cache.
661 // NodeSequence object shares the cache.
768 * cache associated with this NodeSequence, but
792 IteratorCache cache = (IteratorCache) obj;
793 m_cache = cache;
797 super.setObject(cache.getVector());
809 * This field (m_cache) is a reference to such a cache,
813 * reference to the same cache, and also
815 * The iterator and its cache may be shared among
819 * of the others it fills in the cache.
822 * the cache rather than the iterator itself, so
824 * benefits from the cache.
826 * At some point the cache may be
828 * the copies of the iterator, and the cache is
830 * and the cache will have no more nodes added to it.
840 * Both an iterator and its corresponding cache can
851 * in the cache.
854 * 33 and 11 from the cache, leaving the iterator alone.
857 * 33 and 11 from the cache, then get 44, 22, 55 from
858 * the iterator, and appending 44, 22, 55 to the cache.
860 * exhausted and the cache is marked complete.
863 * know that the cache is complete, and they will
864 * obtain all subsequent nodes from the cache.
873 * all nodes obtained from it are in the cache.
897 * this same cache.
935 * Returns true if no cache is complete