1 /*******************************************************************************
\r
2 * Copyright (c) 2007, 2010 Association for Decentralized Information Management
\r
3 * in Industry THTH ry.
\r
4 * All rights reserved. This program and the accompanying materials
\r
5 * are made available under the terms of the Eclipse Public License v1.0
\r
6 * which accompanies this distribution, and is available at
\r
7 * http://www.eclipse.org/legal/epl-v10.html
\r
10 * VTT Technical Research Centre of Finland - initial API and implementation
\r
11 *******************************************************************************/
\r
12 package org.simantics.layer0.utils.binaryPredicates;
\r
14 import java.util.ArrayDeque;
\r
15 import java.util.Collection;
\r
16 import java.util.Deque;
\r
17 import java.util.HashSet;
\r
18 import java.util.Set;
\r
20 import org.simantics.db.Resource;
\r
21 import org.simantics.db.ReadGraph;
\r
22 import org.simantics.db.WriteGraph;
\r
23 import org.simantics.db.exception.DatabaseException;
\r
24 import org.simantics.utils.datastructures.Pair;
\r
26 public class TransitiveClosure extends BinaryPredicate {
\r
27 IBinaryPredicate predicate;
\r
30 public TransitiveClosure(IBinaryPredicate predicate) {
\r
31 this.predicate = predicate;
\r
35 public void add(WriteGraph g, Resource subject, Resource object) throws DatabaseException {
\r
36 if(!has(g, subject, object))
\r
37 predicate.add(g, subject, object);
\r
41 public Collection<Resource> getObjects(ReadGraph g, Resource subject) throws DatabaseException {
\r
42 Deque<Resource> unprocessed = new ArrayDeque<Resource>();
\r
43 unprocessed.add(subject);
\r
44 Set<Resource> result = new HashSet<Resource>();
\r
45 while(!unprocessed.isEmpty())
\r
46 for(Resource r : predicate.getObjects(g, unprocessed.pop()))
\r
48 unprocessed.push(r);
\r
53 public Collection<Pair<Resource, Resource>> getStatements(ReadGraph g) {
\r
54 // TODO Auto-generated method stub
\r
59 public Collection<Resource> getSubjects(ReadGraph g, Resource object) throws DatabaseException {
\r
60 Deque<Resource> unprocessed = new ArrayDeque<Resource>();
\r
61 unprocessed.add(object);
\r
62 Set<Resource> result = new HashSet<Resource>();
\r
63 while(!unprocessed.isEmpty())
\r
64 for(Resource r : predicate.getSubjects(g, unprocessed.pop()))
\r
66 unprocessed.push(r);
\r
71 public boolean has(ReadGraph g, Resource subject, Resource object) throws DatabaseException {
\r
72 Deque<Resource> unprocessed = new ArrayDeque<Resource>();
\r
73 unprocessed.add(subject);
\r
74 Set<Resource> objects = new HashSet<Resource>();
\r
75 while(!unprocessed.isEmpty())
\r
76 for(Resource r : predicate.getObjects(g, unprocessed.pop()))
\r
77 if(r.equals(object))
\r
79 else if(objects.add(r))
\r
80 unprocessed.push(r);
\r
85 public void remove(WriteGraph g, Resource subject, Resource object) {
\r
86 throw new UnsupportedOperationException();
\r
90 public boolean supportsAdditions() {
\r
91 return predicate.supportsAdditions();
\r
95 public boolean supportsGetObjects() {
\r
96 return predicate.supportsGetObjects();
\r
100 public boolean supportsGetStatements() {
\r
101 return false; // FIXME: just unimplemented
\r
105 public boolean supportsGetSubjects() {
\r
106 return predicate.supportsGetSubjects();
\r
110 public boolean supportsRemovals() {
\r
115 public int hashCode() {
\r
116 final int prime = 31;
\r
118 result = prime * result
\r
119 + ((predicate == null) ? 0 : predicate.hashCode());
\r
124 public boolean equals(Object obj) {
\r
129 if (getClass() != obj.getClass())
\r
131 TransitiveClosure other = (TransitiveClosure) obj;
\r
132 if (predicate == null) {
\r
133 if (other.predicate != null)
\r
135 } else if (!predicate.equals(other.predicate))
\r