Java tutorial
//package com.java2s; /* * RapidMiner * * Copyright (C) 2001-2013 by Rapid-I and the contributors * * Complete list of developers available at our web site: * * http://rapid-i.com * * This program is free software: you can redistribute it and/or modify * it under the terms of the GNU Affero General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Affero General Public License for more details. * * You should have received a copy of the GNU Affero General Public License * along with this program. If not, see http://www.gnu.org/licenses/. */ import java.util.HashSet; import java.util.Set; import org.w3c.dom.Element; public class Main { /** * Returns a set of the direct ancestors of each element in elements. * If one element does not have an ancestor, the whole set will be empty. */ public static Set<Element> getDirectAncestors(Set<Element> elements) { Set<Element> directAncestors = new HashSet<Element>(); for (Element element : elements) { if (element.getParentNode() != null && element.getParentNode() instanceof Element) { directAncestors.add((Element) element.getParentNode()); } else { return new HashSet<Element>(); } } return directAncestors; } }