org.semanticweb.HermiT.hierarchy.HierarchyNode Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of org.semanticweb.hermit Show documentation

HermiT is reasoner for ontologies written using the Web Ontology Language (OWL). Given an OWL file, HermiT can determine whether or not the ontology is consistent, identify subsumption relationships between classes, and much more. This is the maven build of HermiT and is designed for people who wish to use HermiT from within the OWL API. It is now versioned in the main HermiT version repository, although not officially supported by the HermiT developers. The version number of this package is a composite of the HermiT version and an value representing releases of this packaged version. So, 1.3.7.1 is the first release of the mavenized version of HermiT based on the 1.3.7 release of HermiT. This package includes the Jautomata library (http://jautomata.sourceforge.net/), and builds with it directly. This library appears to be no longer under active development, and so a "fork" seems appropriate. No development is intended or anticipated on this code base.

There is a newer version: 1.3.8.4

Show newest version

/* Copyright 2008, 2009, 2010 by the Oxford University Computing Laboratory

   This file is part of HermiT.

   HermiT is free software: you can redistribute it and/or modify
   it under the terms of the GNU Lesser General Public License as published by
   the Free Software Foundation, either version 3 of the License, or
   (at your option) any later version.

   HermiT 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 Lesser General Public License for more details.

   You should have received a copy of the GNU Lesser General Public License
   along with HermiT.  If not, see .
*/
package org.semanticweb.HermiT.hierarchy;

import java.util.Collections;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Set;

public class HierarchyNode {
    protected final E m_representative;
    protected final Set m_equivalentElements;
    protected final Set> m_parentNodes;
    protected final Set> m_childNodes;

    public HierarchyNode(E representative) {
        m_representative=representative;
        m_equivalentElements=new HashSet();
        m_equivalentElements.add(m_representative);
        m_parentNodes=new HashSet>();
        m_childNodes=new HashSet>();
    }
    public HierarchyNode(E element,Set equivalentElements,Set> parentNodes,Set> childNodes) {
        m_representative=element;
        m_equivalentElements=equivalentElements;
        m_parentNodes=parentNodes;
        m_childNodes=childNodes;
    }
    public E getRepresentative() {
        return m_representative;
    }
    public boolean isEquivalentElement(E element) {
        return m_equivalentElements.contains(element);
    }
    public boolean isAncestorElement(E ancestor) {
        for (HierarchyNode node : getAncestorNodes())
            if (node.isEquivalentElement(ancestor))
                return true;
        return false;
    }
    public boolean isDescendantElement(E descendant) {
        for (HierarchyNode node : getDescendantNodes())
            if (node.isEquivalentElement(descendant))
                return true;
        return false;
    }
    public Set getEquivalentElements() {
        return Collections.unmodifiableSet(m_equivalentElements);
    }
    public Set> getParentNodes() {
        return Collections.unmodifiableSet(m_parentNodes);
    }
    public Set> getChildNodes() {
        return Collections.unmodifiableSet(m_childNodes);
    }
    public Set> getAncestorNodes() {
        return getAncestorNodes(Collections.singleton(this));
    }
    public Set> getDescendantNodes() {
        return getDescendantNodes(Collections.singleton(this));
    }
    public String toString() {
        return m_equivalentElements.toString();
    }
    public static  Set> getAncestorNodes(Set> inputNodes) {
        Set> result=new HashSet>();
        Queue> toVisit=new LinkedList>(inputNodes);
        while (!toVisit.isEmpty()) {
            HierarchyNode current=toVisit.poll();
            if (result.add(current))
                toVisit.addAll(current.getParentNodes());
        }
        return result;
    }
    public static  Set> getDescendantNodes(Set> inputNodes) {
        Set> result=new HashSet>();
        Queue> toVisit=new LinkedList>(inputNodes);
        while (!toVisit.isEmpty()) {
            HierarchyNode current=toVisit.poll();
            if (result.add(current))
                toVisit.addAll(current.getChildNodes());
        }
        return result;
    }
}