/** * Returns an iterator of the nodes of the sub-tree rooted at * <code>node</code>. */ @SuppressWarnings("unchecked") private Iterator<Node> iterator(Node node) { if (inclusionPolicy.include(node)) { return chain(singleton(node), chain(childIterators(node))); } else { return chain(childIterators(node)); } }
/** * Returns an iterator of the nodes of the sub-tree rooted at * <code>node</code>. */ @SuppressWarnings("unchecked") private Iterator<Node> iterator(Node node) { if (inclusionPolicy.include(node)) { return chain(singleton(node), chain(childIterators(node))); } else { return chain(childIterators(node)); } }
@SuppressWarnings("unchecked") public boolean evaluate(Object object) { return inclusionPolicy.include((T) object); } });
@SuppressWarnings("unchecked") public boolean evaluate(Object object) { return inclusionPolicy.include((T) object); } });
@SuppressWarnings("unchecked") public boolean evaluate(Object object) { return inclusionPolicy.include((T) object); } });
/** * Returns an iterator of the nodes of the sub-tree rooted at * <code>node</code>. */ @SuppressWarnings("unchecked") private Iterator<Node> iterator(Node node) { if (inclusionPolicy.include(node)) { return chain(singleton(node), chain(childIterators(node))); } else { return chain(childIterators(node)); } }