private void fetchNext() { while (true) { fetchNextPossiblyDuplicate(); if (closed) { return; } if (pathContainsValue) { String value = PathUtils.elements(currentPath).iterator().next(); currentPath = PathUtils.relativize(value, currentPath); // don't return duplicate paths: // Set.add returns true if the entry was new, // so if it returns false, it was already known if (!knownPaths.add(currentPath)) { continue; } } break; } }
@Override public Iterator<String> iterator() { PathIterator it = new PathIterator(filter, indexName, pathPrefix, prependPathPrefix); if (values == null) { it.setPathContainsValue(true); it.enqueue(getChildNodeEntries(index).iterator()); } else { for (String p : values) { NodeState property = index.getChildNode(p); if (property.exists()) { // we have an entry for this value, so use it it.enqueue(Iterators.singletonIterator( new MemoryChildNodeEntry("", property))); } } } return it; } };
private void fetchNext() { while (true) { fetchNextPossiblyDuplicate(); if (closed) { return; } if (pathContainsValue) { String value = PathUtils.elements(currentPath).iterator().next(); currentPath = PathUtils.relativize(value, currentPath); // don't return duplicate paths: // Set.add returns true if the entry was new, // so if it returns false, it was already known if (!knownPaths.add(currentPath)) { continue; } } break; } }
private void fetchNext() { while (true) { fetchNextPossiblyDuplicate(); if (closed) { return; } if (pathContainsValue) { String value = PathUtils.elements(currentPath).iterator().next(); currentPath = PathUtils.relativize(value, currentPath); // don't return duplicate paths: // Set.add returns true if the entry was new, // so if it returns false, it was already known if (!knownPaths.add(currentPath)) { continue; } } break; } }
@Override public Iterator<String> iterator() { PathIterator it = new PathIterator(filter, indexName, pathPrefix, prependPathPrefix); if (values == null) { it.setPathContainsValue(true); it.enqueue(getChildNodeEntries(index).iterator()); } else { for (String p : values) { NodeState property = index.getChildNode(p); if (property.exists()) { // we have an entry for this value, so use it it.enqueue(Iterators.singletonIterator( new MemoryChildNodeEntry("", property))); } } } return it; } };
@Override public Iterator<String> iterator() { PathIterator it = new PathIterator(filter, indexName, pathPrefix, prependPathPrefix); if (values == null) { it.setPathContainsValue(true); it.enqueue(getChildNodeEntries(index).iterator()); } else { for (String p : values) { NodeState property = index.getChildNode(p); if (property.exists()) { // we have an entry for this value, so use it it.enqueue(Iterators.singletonIterator( new MemoryChildNodeEntry("", property))); } } } return it; } };
@Override public boolean hasNext() { if (!closed && !init) { fetchNext(); init = true; } return !closed; }
@Override public boolean hasNext() { if (!closed && !init) { fetchNext(); init = true; } return !closed; }
@Override public boolean hasNext() { if (!closed && !init) { fetchNext(); init = true; } return !closed; }