Overview  Package  Class   Use  Tree  Deprecated  Index  Help 
 PREV   NEXT FRAMES    NO FRAMES    

Uses of Interface
edu.rice.cs.plt.collect.PredicateSet

Packages that use PredicateSet
edu.rice.cs.plt.collect Contains general-purpose extensions to and variations on the java.util collections framework. 
 

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

Subinterfaces of PredicateSet in edu.rice.cs.plt.collect
 interface FunctionalRelation<T1,T2>
          A functional relation: each first (of type T1) corresponds to at most one second (of type T2).
 interface InjectiveRelation<T1,T2>
          An injective relation: each second (of type T2) corresponds to at most one first (of type T1).
 interface OneToOneRelation<T1,T2>
          A injective functional relation: each first (of type T1) corresponds to at most one second (of type T2), and vice versa.
 interface Relation<T1,T2>
          A set of pairs representing a binary relation.
 interface Relation3<T1,T2,T3>
          A set of triples representing a ternary relation.
 interface Relation4<T1,T2,T3,T4>
          A set of quads representing a quaternary relation.
 

Classes in edu.rice.cs.plt.collect that implement PredicateSet
 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 AbstractPredicateSet<T>
          An extension of AbstractSet that implements the PredicateSet interface.
 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 DelegatingRelation<T1,T2>
          A relation that delegates all operations to a wrapped relation.
 class DelegatingSet<T>
          An implementation of PredicateSet that delegates all operations to a wrapped set.
 class EmptyRelation<T1,T2>
          An immutable, empty, one-to-one relation.
 class EmptySet<E>
          An immutable empty PredicateSet.
 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 ImmutableRelation<T1,T2>
          Wraps a relation in an immutable interface.
 class ImmutableSet<T>
          Wraps a set in an immutable interface.
 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 ListenerSet<T>
          A mutable set of listeners.
 class SingletonRelation<T1,T2>
          An immutable Relation containing a single pair.
 class SingletonSet<E>
          An immutable PredicateSet with a single element.
 class SnapshotSynchronizedSet<E>
          A synchronized set like Collections.synchronizedSet(java.util.Set), but one that returns a snapshot of the set contents on invocations of iterator().
 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.
 

Methods in edu.rice.cs.plt.collect that return PredicateSet
static
<T> PredicateSet<T>
CollectUtil.asPredicateSet(Iterable<T> iter)
          Convert the given Iterable to a PredicateSet.
 PredicateSet<T> Multiset.asSet()
          Produce a set view of the multiset (with only one entry for each unique instance).
 PredicateSet<T> HashMultiset.asSet()
          Produce a set view of the multiset.
static
<T> PredicateSet<T>
CollectUtil.complement(Set<? extends T> domain, Set<?> excluded)
          Produce the complement of a set in a domain, or, equivalently, the difference of two sets.
static
<T> PredicateSet<T>
CollectUtil.complement(Set<? extends T> domain, T excluded)
          Produce the complement of a singleton in a domain set, or, equivalently, a set with a certain element removed.
 PredicateSet<T2> AbstractRelation.excludeFirsts()
          Returns secondSet().
 PredicateSet<T1> AbstractRelation.InverseRelation.excludeFirsts()
           
 PredicateSet<T2> ImmutableRelation.excludeFirsts()
           
 PredicateSet<T2> Relation.excludeFirsts()
          The set of seconds for which there exists a (first, second) pair in the relation.
 PredicateSet<T2> DelegatingRelation.excludeFirsts()
           
 PredicateSet<T2> EmptyRelation.excludeFirsts()
           
 PredicateSet<T1> AbstractRelation.excludeSeconds()
          Returns firstSet().
 PredicateSet<T2> AbstractRelation.InverseRelation.excludeSeconds()
           
 PredicateSet<T1> ImmutableRelation.excludeSeconds()
           
 PredicateSet<T1> Relation.excludeSeconds()
          The set of firsts for which there exists a (first, second) pair in the relation.
 PredicateSet<T1> DelegatingRelation.excludeSeconds()
           
 PredicateSet<T1> EmptyRelation.excludeSeconds()
           
static
<T> PredicateSet<T>
CollectUtil.filter(Set<? extends T> set, Predicate<? super T> predicate)
          Lazily filter the given set.
 PredicateSet<T1> AbstractFunctionalRelation.firstSet()
          Returns functionMap().keySet().
 PredicateSet<T1> IndexedRelation.firstSet()
           
abstract  PredicateSet<T1> AbstractInjectiveRelation.firstSet()
           
abstract  PredicateSet<T1> AbstractRelation.firstSet()
           
 PredicateSet<T2> AbstractRelation.InverseRelation.firstSet()
           
 PredicateSet<T1> ImmutableRelation.firstSet()
           
 PredicateSet<T1> UnindexedRelation.firstSet()
           
 PredicateSet<T1> FilteredRelation.firstSet()
           
 PredicateSet<T1> Relation.firstSet()
          The set of firsts.
 PredicateSet<T1> CartesianRelation.firstSet()
           
 PredicateSet<T1> IndexedInjectiveRelation.firstSet()
           
 PredicateSet<T1> SingletonRelation.firstSet()
           
 PredicateSet<T1> UnionRelation.firstSet()
           
 PredicateSet<T1> Relation3.firstSet()
          The set of firsts.
 PredicateSet<T1> ComposedRelation.firstSet()
           
 PredicateSet<T1> DelegatingRelation.firstSet()
           
 PredicateSet<T1> EmptyRelation.firstSet()
           
static
<T> PredicateSet<T>
CollectUtil.immutable(Set<? extends T> set)
          Wrap a set in an immutable wrapper.
static
<T> PredicateSet<T>
CollectUtil.intersection(Set<?> s1, Set<? extends T> s2)
          Produce a lazy intersection of two sets.
 PredicateSet<K> LazyRelationIndex.keys()
           
 PredicateSet<K> RelationIndex.keys()
          A dynamically-updating view of all keys mapping to at least one value.
 PredicateSet<K> ConcreteRelationIndex.keys()
           
 PredicateSet<K> ComposedMap.keySet()
           
 PredicateSet<K> DictionaryMap.keySet()
           
 PredicateSet<K> UnionMap.keySet()
           
 PredicateSet<K> SingletonMap.keySet()
           
 PredicateSet<K> DelegatingMap.keySet()
           
 PredicateSet<K> MappedMap.keySet()
           
 PredicateSet<K> LambdaMap.keySet()
           
 PredicateSet<K> ImmutableMap.keySet()
           
abstract  PredicateSet<K> AbstractKeyBasedMap.keySet()
           
static
<T> PredicateSet<T>
CollectUtil.makeSet(Iterable<? extends T> elements)
          Create an immutable PredicateSet based on the given elements.
static
<T> PredicateSet<T>
CollectUtil.makeSet(Option<? extends T> opt)
          Produce an empty or singleton set based on the given Option.
static
<T> PredicateSet<T>
CollectUtil.makeSet(T... elements)
          Create an immutable PredicateSet based on the given elements.
 PredicateSet<V> LazyRelationIndex.match(K key)
           
 PredicateSet<V> RelationIndex.match(K key)
          A dynamically-updating view of all values matching key.
 PredicateSet<V> ConcreteRelationIndex.match(K key)
           
 PredicateSet<T2> ComplementRelation.matchFirst(T1 first)
           
 PredicateSet<T2> AbstractFunctionalRelation.matchFirst(T1 first)
          Returns a set that queries and manipulates the mapping from first in functionMap().
 PredicateSet<T2> IndexedRelation.matchFirst(T1 first)
           
abstract  PredicateSet<T2> AbstractInjectiveRelation.matchFirst(T1 first)
           
 PredicateSet<T2> IntersectionRelation.matchFirst(T1 first)
           
abstract  PredicateSet<T2> AbstractRelation.matchFirst(T1 first)
           
 PredicateSet<T2> ImmutableRelation.matchFirst(T1 first)
           
 PredicateSet<T2> UnindexedRelation.matchFirst(T1 first)
           
 PredicateSet<T2> FilteredRelation.matchFirst(T1 first)
           
 PredicateSet<T2> Relation.matchFirst(T1 first)
          The set of seconds corresponding to a specific first.
 PredicateSet<T2> CartesianRelation.matchFirst(T1 first)
           
 PredicateSet<T2> IndexedInjectiveRelation.matchFirst(T1 first)
           
 PredicateSet<T2> SingletonRelation.matchFirst(T1 match)
           
 PredicateSet<T2> FunctionalRelation.matchFirst(T1 first)
          The set of seconds corresponding to a specific first.
 PredicateSet<T2> UnionRelation.matchFirst(T1 first)
           
 PredicateSet<T3> ComposedRelation.matchFirst(T1 first)
           
 PredicateSet<T2> DelegatingRelation.matchFirst(T1 first)
           
 PredicateSet<T2> EmptyRelation.matchFirst(T1 first)
           
 PredicateSet<T1> AbstractRelation.InverseRelation.matchFirst(T2 f)
           
 PredicateSet<T2> AbstractRelation.InverseRelation.matchSecond(T1 s)
           
 PredicateSet<T1> ComplementRelation.matchSecond(T2 second)
           
abstract  PredicateSet<T1> AbstractFunctionalRelation.matchSecond(T2 second)
           
 PredicateSet<T1> IndexedFunctionalRelation.matchSecond(T2 second)
           
 PredicateSet<T1> IndexedRelation.matchSecond(T2 second)
           
 PredicateSet<T1> AbstractInjectiveRelation.matchSecond(T2 second)
          Returns a set that queries and manipulates the mapping from second in injectionMap().
 PredicateSet<T1> IntersectionRelation.matchSecond(T2 second)
           
abstract  PredicateSet<T1> AbstractRelation.matchSecond(T2 second)
           
 PredicateSet<T1> ImmutableRelation.matchSecond(T2 second)
           
 PredicateSet<T1> InjectiveRelation.matchSecond(T2 second)
          The set of firsts corresponding to a specific second.
 PredicateSet<T1> UnindexedRelation.matchSecond(T2 second)
           
 PredicateSet<T1> FilteredRelation.matchSecond(T2 second)
           
 PredicateSet<T1> Relation.matchSecond(T2 second)
          The set of firsts corresponding to a specific second.
 PredicateSet<T1> CartesianRelation.matchSecond(T2 second)
           
 PredicateSet<T1> AbstractOneToOneRelation.matchSecond(T2 second)
          Returns a set that queries and manipulates the mapping from second in injectionMap().
 PredicateSet<T1> SingletonRelation.matchSecond(T2 match)
           
 PredicateSet<T1> UnionRelation.matchSecond(T2 second)
           
 PredicateSet<T1> DelegatingRelation.matchSecond(T2 second)
           
 PredicateSet<T1> EmptyRelation.matchSecond(T2 second)
           
 PredicateSet<T1> ComposedRelation.matchSecond(T3 second)
           
abstract  PredicateSet<T2> AbstractFunctionalRelation.secondSet()
           
 PredicateSet<T2> IndexedFunctionalRelation.secondSet()
           
 PredicateSet<T2> IndexedRelation.secondSet()
           
 PredicateSet<T2> AbstractInjectiveRelation.secondSet()
          Returns injectionMap().keySet().
abstract  PredicateSet<T2> AbstractRelation.secondSet()
           
 PredicateSet<T1> AbstractRelation.InverseRelation.secondSet()
           
 PredicateSet<T2> ImmutableRelation.secondSet()
           
 PredicateSet<T2> UnindexedRelation.secondSet()
           
 PredicateSet<T2> FilteredRelation.secondSet()
           
 PredicateSet<T2> Relation.secondSet()
          The set of seconds.
 PredicateSet<T2> CartesianRelation.secondSet()
           
 PredicateSet<T2> AbstractOneToOneRelation.secondSet()
          Returns injectionMap().keySet().
 PredicateSet<T2> SingletonRelation.secondSet()
           
 PredicateSet<T2> UnionRelation.secondSet()
           
 PredicateSet<T2> Relation3.secondSet()
          The set of seconds.
 PredicateSet<T3> ComposedRelation.secondSet()
           
 PredicateSet<T2> DelegatingRelation.secondSet()
           
 PredicateSet<T2> EmptyRelation.secondSet()
           
static
<T> PredicateSet<T>
CollectUtil.snapshot(Set<? extends T> set)
          Alias for CollectUtil.makeSet(T...).
 PredicateSet<T3> Relation3.thirdSet()
          The set of thirds.
static
<T> PredicateSet<T>
CollectUtil.union(Set<? extends T> s1, Set<? extends T> s2)
          Produce a lazy union of two sets.
static
<T> PredicateSet<T>
CollectUtil.union(Set<? extends T> set, T elt)
          Produce a lazy union of a set with an additional singleton element.
 

Methods in edu.rice.cs.plt.collect with parameters of type PredicateSet
protected  void ConcreteRelationIndex.validateRemoveKey(K key, PredicateSet<V> vals)
          Checks that the given key, which appears with at least one value in this index, can be removed with all associated values from the relation.
 

Constructor parameters in edu.rice.cs.plt.collect with type arguments of type PredicateSet
ConcreteRelationIndex(Thunk<? extends Map<K,PredicateSet<V>>> mapFactory, Thunk<? extends Set<V>> setFactory)
          Create an empty ConcreteRelationIndex.
IndexedFunctionalRelation(Thunk<Map<T1,T2>> firstIndexFactory, Thunk<Map<T2,PredicateSet<T1>>> secondIndexFactory, Thunk<Set<T1>> secondIndexEntryFactory)
          Create indices based on the given factories.
IndexedInjectiveRelation(Thunk<Map<T2,T1>> secondIndexFactory, Thunk<Map<T1,PredicateSet<T2>>> firstIndexFactory, Thunk<Set<T2>> firstIndexEntryFactory)
          Create indices based on the given factories.
IndexedRelation(Thunk<Map<T1,PredicateSet<T2>>> firstIndexFactory, Thunk<Set<T2>> firstIndexEntryFactory)
          Create an index based on the given factories.
IndexedRelation(Thunk<Map<T1,PredicateSet<T2>>> firstIndexFactory, Thunk<Set<T2>> firstIndexEntryFactory, Thunk<Map<T2,PredicateSet<T1>>> secondIndexFactory, Thunk<Set<T1>> secondIndexEntryFactory)
          Create indices based on the given factories.
IndexedRelation(Thunk<Map<T1,PredicateSet<T2>>> firstIndexFactory, Thunk<Set<T2>> firstIndexEntryFactory, Thunk<Map<T2,PredicateSet<T1>>> secondIndexFactory, Thunk<Set<T1>> secondIndexEntryFactory)
          Create indices based on the given factories.
 

Overview  Package  Class   Use  Tree  Deprecated  Index  Help 
 PREV   NEXT FRAMES    NO FRAMES