if (recursive) {
// The root cannot be queued directly.
// We need to queue each child individually.
Enumeration<?> e = rootNode.children();
while (e.hasMoreElements()) {
BasicNode child = (BasicNode)e.nextElement();
startRefreshNode(child, null, true);
}
}
}
else {
refreshQueue.queue(new NodeRefresher(node, this, localEntry, recursive));
// The task does not *see* suffixes.
// So we need to propagate the refresh on
// the sub-suffixes if any.
if (recursive && (node instanceof SuffixNode)) {
Enumeration<?> e = node.children();
while (e.hasMoreElements()) {
BasicNode child = (BasicNode)e.nextElement();
if (child instanceof SuffixNode) {
startRefreshNode(child, null, true);
}
}
}