|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectjava.util.AbstractCollection<E>
java.util.AbstractSet<T>
edu.rice.cs.plt.collect.AbstractPredicateSet<Pair<T1,T2>>
edu.rice.cs.plt.collect.AbstractRelation<T1,T3>
edu.rice.cs.plt.collect.ComposedRelation<T1,T2,T3>
public class ComposedRelation<T1,T2,T3>
The transitive composition of two relations, lazily constructed and dynamically-updated. An entry
(x, y) appears in the relation if and only if there is an entry (x, z) in the first
relation and (z, y) in the second.
| Nested Class Summary |
|---|
| Nested classes/interfaces inherited from class edu.rice.cs.plt.collect.AbstractRelation |
|---|
AbstractRelation.InverseRelation |
| Constructor Summary | |
|---|---|
ComposedRelation(Relation<T1,T2> rel1,
Relation<T2,T3> rel2)
|
|
| Method Summary | |
|---|---|
int |
compositeHeight()
|
int |
compositeSize()
|
boolean |
contains(Object o)
Test whether the set contains an object. |
boolean |
contains(T1 first,
T3 second)
Tests whether the given objects appear as a pair in this relation. |
PredicateSet<T1> |
firstSet()
The set of firsts. |
boolean |
hasFixedSize()
true if this iterable is known to have a fixed size. |
boolean |
isEmpty()
Returns size(1) == 0. |
boolean |
isInfinite()
true if the iterable is known to have infinite size. |
boolean |
isStatic()
true if this iterable is unchanging. |
Iterator<Pair<T1,T3>> |
iterator()
For each element of rel1.firstSet(), iterate over all transitive matches. |
PredicateSet<T3> |
matchFirst(T1 first)
The set of seconds corresponding to a specific first. |
PredicateSet<T1> |
matchSecond(T3 second)
The set of firsts corresponding to a specific second. |
PredicateSet<T3> |
secondSet()
The set of seconds. |
| Methods inherited from class edu.rice.cs.plt.collect.AbstractRelation |
|---|
add, add, containsFirst, containsSecond, excludeFirsts, excludeSeconds, inverse, remove, remove |
| Methods inherited from class edu.rice.cs.plt.collect.AbstractPredicateSet |
|---|
size, size |
| Methods inherited from class java.util.AbstractSet |
|---|
equals, hashCode, removeAll |
| Methods inherited from class java.util.AbstractCollection |
|---|
addAll, clear, containsAll, retainAll, toArray, toArray, toString |
| Methods inherited from class java.lang.Object |
|---|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface java.util.Set |
|---|
addAll, clear, containsAll, equals, hashCode, removeAll, retainAll, size, toArray, toArray |
| Methods inherited from interface edu.rice.cs.plt.iter.SizedIterable |
|---|
size, size |
| Constructor Detail |
|---|
public ComposedRelation(Relation<T1,T2> rel1,
Relation<T2,T3> rel2)
| Method Detail |
|---|
public int compositeHeight()
public int compositeSize()
public boolean isEmpty()
AbstractPredicateSetsize(1) == 0.
isEmpty in interface SizedIterable<Pair<T1,T3>>isEmpty in interface Collection<Pair<T1,T3>>isEmpty in interface Set<Pair<T1,T3>>isEmpty in class AbstractPredicateSet<Pair<T1,T3>>public boolean isInfinite()
SizedIterabletrue if the iterable is known to have infinite size. If true, an iterator over the iterable in its
current state will never return false from hasNext().
isInfinite in interface SizedIterable<Pair<T1,T3>>isInfinite in class AbstractRelation<T1,T3>public boolean hasFixedSize()
SizedIterabletrue if this iterable is known to have a fixed size. This is the case if the iterable is immutable,
or if changes can only replace values, not remove or add them. An infinite iterable may be fixed if it
is guaranteed to never become finite.
hasFixedSize in interface SizedIterable<Pair<T1,T3>>hasFixedSize in class AbstractRelation<T1,T3>public boolean isStatic()
SizedIterabletrue if this iterable is unchanging. This implies that hasFixedSize() is true, and that
iterator() will always return the same (either == or equal() and immutable) elements
in the same order. ("Immutable" here means that equals() invocations are consistent over time -- if
two objects are equal, they will never become inequal, and vice versa.)
isStatic in interface SizedIterable<Pair<T1,T3>>isStatic in class AbstractRelation<T1,T3>
public boolean contains(T1 first,
T3 second)
AbstractRelationT1 and T2 because the Collection.contains(java.lang.Object)
method allows arbitrary objects.
contains in interface Relation<T1,T3>contains in interface Predicate2<T1,T3>contains in class AbstractRelation<T1,T3>public boolean contains(Object o)
AbstractPredicateSetAbstractCollection.contains(java.lang.Object)) is a linear search,
which is almost always unreasonable for a set.
contains in interface Relation<T1,T3>contains in interface Predicate<Object>contains in interface Collection<Pair<T1,T3>>contains in interface Set<Pair<T1,T3>>contains in class AbstractRelation<T1,T3>public Iterator<Pair<T1,T3>> iterator()
rel1.firstSet(), iterate over all transitive matches.
iterator in interface Iterable<Pair<T1,T3>>iterator in interface Collection<Pair<T1,T3>>iterator in interface Set<Pair<T1,T3>>iterator in class AbstractRelation<T1,T3>public PredicateSet<T1> firstSet()
Relation
firstSet in interface Relation<T1,T3>firstSet in class AbstractRelation<T1,T3>public PredicateSet<T3> matchFirst(T1 first)
Relation
matchFirst in interface Relation<T1,T3>matchFirst in class AbstractRelation<T1,T3>public PredicateSet<T3> secondSet()
Relation
secondSet in interface Relation<T1,T3>secondSet in class AbstractRelation<T1,T3>public PredicateSet<T1> matchSecond(T3 second)
Relation
matchSecond in interface Relation<T1,T3>matchSecond in class AbstractRelation<T1,T3>
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||