Uses of Class
edu.rice.cs.plt.collect.AbstractPredicateSet

Packages that use AbstractPredicateSet

edu.rice.cs.plt.collect

Contains general-purpose extensions to and variations on the java.util collections framework.

Uses of AbstractPredicateSet in edu.rice.cs.plt.collect

Subclasses of AbstractPredicateSet in edu.rice.cs.plt.collect

class	AbstractFunctionalRelation<T1,T2> An abstract parent class for implementations of FunctionalRelation.
protected class	AbstractFunctionalRelation.InverseFunctionalRelation An inverse of the enclosing relation.
class	AbstractInjectiveRelation<T1,T2> An abstract parent class for implementations of InjectiveRelation.
protected class	AbstractInjectiveRelation.InverseInjectiveRelation An inverse of the enclosing relation.
protected class	AbstractKeyBasedMap.EntrySet An entry set defined in terms of the enclosing map's other methods.
class	AbstractOneToOneRelation<T1,T2> An abstract parent class for implementations of OneToOneRelation.
protected class	AbstractOneToOneRelation.InverseOneToOneRelation An inverse of the enclosing relation.
class	AbstractRelation<T1,T2> An abstract parent class for implementations of Relation.
protected class	AbstractRelation.InverseRelation An inverse of the enclosing relation, defined in terms of Pair.inverse().
class	CartesianRelation<T1,T2> A Relation representing the cartesian (or cross) product of two sets.
class	ComplementRelation<T1,T2> The complement of a relation excluded in a domain domain (alternatively, domain - excluded), constructed lazily and updated dynamically.
class	ComplementSet<E> The complement of a set excluded in a domain domain (alternatively, domain - excluded), constructed lazily and updated dynamically.
class	ComposedRelation<T1,T2,T3> The transitive composition of two relations, lazily constructed and dynamically-updated.
class	FilteredRelation<T1,T2> A relation that contains only those pairs contained by both the given relation and the given predicate.
class	FilteredSet<T> A set that contains only those elements contained by both the given set and the given predicate.
class	IndexedFunctionalRelation<T1,T2> An implementation of the FunctionalRelation interface based on indexing maps.
class	IndexedInjectiveRelation<T1,T2> A hash code-based implementation of the InjectiveRelation interface.
class	IndexedOneToOneRelation<T1,T2> A implementation of OneToOneRelation based on indexing maps.
class	IndexedRelation<T1,T2> An implementation of the Relation interface based on indexing maps.
class	IntersectionRelation<T1,T2> The intersection of two relations, lazily constructed and updated dynamically.
class	IntersectionSet<E> The intersection of two sets, lazily constructed and updated dynamically.
class	IterableSet<E> A Set wrapping an Iterable.
class	SingletonRelation<T1,T2> An immutable Relation containing a single pair.
class	SingletonSet<E> An immutable PredicateSet with a single element.
class	UnindexedRelation<T1,T2> A mutable relation implemented by wrapping a set of pairs.
class	UnionRelation<T1,T2> The union of two relations, lazily constructed and updated dynamically.
class	UnionSet<E> The union of two sets, lazily constructed and updated dynamically.