Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/* This file is part of the OWL API.
* The contents of this file are subject to the LGPL License, Version 3.0.
* Copyright 2014, The University of Manchester
*
* This program is free software: you can redistribute it and/or modify it under the terms of the GNU 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 General Public License for more details.
* You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.
*
* Alternatively, the contents of this file may be used under the terms of the Apache License, Version 2.0 in which case, the provisions of the Apache License Version 2.0 are applicable instead of those above.
* Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at
* http://www.apache.org/licenses/LICENSE-2.0
* Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. */
package org.semanticweb.owlapi.rdf.model;
import static org.semanticweb.owlapi.util.CollectionFactory.createLinkedSet;
import static org.semanticweb.owlapi.util.CollectionFactory.createMap;
import static org.semanticweb.owlapi.util.OWLAPIPreconditions.checkNotNull;
import static org.semanticweb.owlapi.util.OWLAPIStreamUtils.asList;
import java.io.IOException;
import java.io.Serializable;
import java.io.Writer;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.HashSet;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.stream.Collectors;
import java.util.stream.Stream;
import javax.annotation.Nullable;
import org.semanticweb.owlapi.io.RDFNode;
import org.semanticweb.owlapi.io.RDFResource;
import org.semanticweb.owlapi.io.RDFResourceBlankNode;
import org.semanticweb.owlapi.io.RDFTriple;
import org.semanticweb.owlapi.model.IRI;
import org.semanticweb.owlapi.model.OWLEntity;
import org.semanticweb.owlapi.vocab.OWLRDFVocabulary;
/**
* @author Matthew Horridge, The University Of Manchester, Bio-Health Informatics Group
* @since 2.0.0
*/
public class RDFGraph implements Serializable {
private static final String LINE = ",\n ";
private static final Set skippedPredicates =
Collections.singleton(OWLRDFVocabulary.OWL_ANNOTATED_TARGET.getIRI());
private final Map> triplesBySubject = createMap();
private final Set rootAnonymousNodes = createLinkedSet();
private final Set rootIRIs = new HashSet<>();
private final Set triples = createLinkedSet();
private final Map remappedNodes = createMap();
@Nullable
private RDFResource ontology;
/**
* Determines if this graph is empty (i.e. whether or not it contains any triples).
*
* @return {@code true} if the graph contains triples, otherwise {@code false}
* @since 3.5
*/
public boolean isEmpty() {
return triples.isEmpty();
}
/**
* @param triple triple to add
*/
public void addTriple(RDFTriple triple) {
checkNotNull(triple, "triple cannot be null");
// Reset the computation of root anon nodes
rootAnonymousNodes.clear();
triples.add(triple);
Set tripleSet = triplesBySubject.get(triple.getSubject());
if (tripleSet == null) {
tripleSet = new LinkedHashSet<>();
triplesBySubject.put(triple.getSubject(), tripleSet);
}
tripleSet.add(triple);
}
/**
* @param subject subject
* @return sorted triples
*/
public Collection getTriplesForSubject(RDFNode subject) {
Set set = triplesBySubject.get(subject);
if (set == null) {
// check if the node is remapped
RDFNode rdfNode = remappedNodes.get(subject);
if (rdfNode == null) {
return Collections.emptyList();
}
// else return the triples for the remapped node
return getTriplesForSubject(rdfNode);
}
return set;
}
/** Ensure ids are output for reused individuals and annotated expressions. */
public void forceIdOutput() {
// Some individuals might need to appear in multiple triples although they do not appear in
// multiple positions in the axioms.
// An example of such a situation is an anonymous individual as object of an annotated
// annotation - in the RDF graph, this individual will appear in two places because of
// reification.
Map> anonIndividualsInMultipleTriples =
createMap();
for (RDFTriple t : triples) {
if (t.getObject().isAnonymous() && t.getObject().isIndividual()) {
List list =
anonIndividualsInMultipleTriples.get(t.getObject());
if (list == null) {
list = new ArrayList<>(2);
anonIndividualsInMultipleTriples.put((RDFResourceBlankNode) t.getObject(),
list);
}
list.add((RDFResourceBlankNode) t.getObject());
}
if (skippedPredicates.contains(t.getPredicate().getIRI())
&& t.getObject().isAnonymous()) {
((RDFResourceBlankNode) t.getObject()).setIdRequired(true);
}
}
for (Map.Entry> e : anonIndividualsInMultipleTriples
.entrySet()) {
if (e.getValue().size() > 1) {
// individuals that need their id output
e.getValue().forEach(o -> o.setIdRequired(true));
}
}
}
/**
* @return root anonymous nodes
*/
public Set getRootAnonymousNodes() {
if (rootAnonymousNodes.isEmpty()) {
rebuildAnonRoots();
}
return rootAnonymousNodes;
}
private void rebuildAnonRoots() {
rootAnonymousNodes.clear();
for (RDFTriple triple : triples) {
if (triple.getSubject().isAnonymous()) {
rootAnonymousNodes.add((RDFResourceBlankNode) triple.getSubject());
}
}
for (RDFTriple triple : triples) {
if (triple.getObject().isAnonymous() && !triple.isSubjectSameAsObject()) {
rootAnonymousNodes.remove(triple.getObject());
}
}
}
/**
* @param w writer to write to
* @throws IOException if exceptions happen
*/
public void dumpTriples(Writer w) throws IOException {
checkNotNull(w, "w cannot be null");
for (Set set : triplesBySubject.values()) {
for (RDFTriple triple : set) {
w.write(triple.toString());
w.write("\n");
}
}
w.flush();
}
/**
* @return all triples in an unmodifiable set
*/
public Set getAllTriples() {
return Collections.unmodifiableSet(triples);
}
@Override
public String toString() {
return triples.stream().map(Object::toString)
.collect(Collectors.joining(LINE, "triples : ", "\n"))
+ triplesBySubject.entrySet().stream().map(Object::toString)
.collect(Collectors.joining(LINE, "triplesBySubject : ", "\n"))
+ rootAnonymousNodes.stream().map(Object::toString)
.collect(Collectors.joining(LINE, "rootAnonymousNodes : ", "\n"))
+ remappedNodes.entrySet().stream().map(Object::toString)
.collect(Collectors.joining(LINE, "remappedNodes : ", ""));
}
/**
* @param node node to search
* @return list of subjects of triples that include the object
*/
public List getSubjectsForObject(RDFResource node) {
List current = asList(
triples.stream().filter(p -> p.getObject().equals(node)).map(RDFTriple::getSubject));
Set visited = new HashSet<>();
List next = new ArrayList<>();
boolean change = true;
while (change) {
change = false;
for (RDFResource n : current) {
if (visited.add(n)) {
List l = asList(triples.stream()
.filter(p -> p.getObject().equals(n)).map(RDFTriple::getSubject));
if (!l.isEmpty()) {
change = true;
next.addAll(l);
} else {
next.add(n);
}
}
}
current = next;
next = new ArrayList<>();
}
return current;
}
/** @param mappedNode ontology node */
public void setOntology(@Nullable RDFResource mappedNode) {
ontology = mappedNode;
}
/** @return ontology node */
@Nullable
public RDFResource getOntology() {
return ontology;
}
/**
* Some graphs have multiple root entities, i.e., sameAs(a1, a2, a3) axioms are turned to
* {@code (a1 sameAs a2), (a2 sameAs a3)} because of RDF limitations. To render all triples, a1
* and a2 must be rendered; usual process would render only a1, and so a3 would be lost.
*
* @param i root IRI for this graph
*/
public void addRootIRIs(OWLEntity i) {
rootIRIs.add(i);
}
/**
* @param toSkip entity to skip
* @return root entities, minus the one to be skipped, sorted
*/
public Stream getRootIRIs(OWLEntity toSkip) {
return rootIRIs.stream().filter(x -> !toSkip.equals(x)).sorted();
}
}
