| java.lang.Object
 com.hp.hpl.jena.xmloutput.impl.Relation
| Relation | | class Relation (Code) | | A sparse 2 dimensional array of boolean indexed by Object.
Complete with transitive closure algorithm.
author:
jjc
version:
Release='$Name: $' Revision='$Revision: 1.9 $' Date='$Date: 2008/01/02 12:09:33 $' |
| Constructor Summary | |
| public | Relation()
The empty Relation. |
| Relation | | public Relation()(Code) | | The empty Relation.
|
| backward | | public Set backward(Object b)(Code) | | The set of a such that a is related to b.
|
| forward | | public Set forward(Object a)(Code) | | The set of b such that a is related to b.
|
| getDiagonal | | public synchronized Set getDiagonal()(Code) | | The set of a such that a is related to a.
|
| iterator | | public Iterator iterator()(Code) | | An Iterator over the pairs of the Relation.
Each pair is returned as a java.util.Map.Entry.
The first element is accessed through getKey(),
the second through getValue().
See Also: java.util.Map.Entry |
| set11 | | public synchronized void set11(Object a, Object b)(Code) | | Uniquely a is now related to uniquely b.
When this is called any other a related to this b is removed.
When this is called any other b related to this a is removed.
|
| set1N | | public synchronized void set1N(Object a, Object b)(Code) | | Uniquely a is now related to b.
Many b's can be related to each a.
When this is called any other a related to this b is removed.
|
| setN1 | | public synchronized void setN1(Object a, Object b)(Code) | | a is now related to uniquely b.
Many a's can be related to each b.
When this is called any other b related to this a is removed.
|
| transitiveClosure | | public synchronized void transitiveClosure()(Code) | | Takes this to its transitive closure.
See B. Roy. Transitivité et connexité. C.R. Acad. Sci. Paris 249, 1959 pp 216-218.
or
S. Warshall, A theorem on Boolean matrices, Journal of the ACM, 9(1), 1962, pp11-12
|
|
|