|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use IntSet | |
---|---|
kodkod.engine.bool | Provides classes for constructing and composing boolean matrices, boolean circuits, and boolean representations of integers. |
kodkod.engine.fol2sat | Provides a facade for translating, evaluating, and approximating Kodkod formulas, expressions, and int expressions with respect to a given Bounds (or Instance) and Options. |
kodkod.engine.satlab | Provides access to various Java and C++ SAT solvers through a common SAT Solver interface. |
kodkod.engine.ucore | Contains strategies for minimizing unsatisfiable cores generated by SAT provers. |
kodkod.instance | Contains classes for creating tuples, sets of tuples, bounds, and instances drawn from a finite universe of uninterpreted atoms. |
kodkod.util.ints | Provides implementations of ordered collections for storing integer primitives. |
Uses of IntSet in kodkod.engine.bool |
---|
Methods in kodkod.engine.bool that return IntSet | |
---|---|
IntSet |
BooleanMatrix.denseIndices()
Returns the set of all indices in this matrix that contain non-FALSE values. |
Methods in kodkod.engine.bool with parameters of type IntSet | |
---|---|
BooleanMatrix |
BooleanFactory.matrix(Dimensions d,
IntSet allIndices,
IntSet trueIndices)
Returns a BooleanMatrix m with the given dimensions, this as its factory, and the indices from the set trueIndices initialized to TRUE. |
Uses of IntSet in kodkod.engine.fol2sat |
---|
Methods in kodkod.engine.fol2sat that return IntSet | |
---|---|
IntSet |
Translation.primaryVariables(Relation relation)
Returns the set of primary variable literals that represent the tuples in the given relation. |
Uses of IntSet in kodkod.engine.satlab |
---|
Methods in kodkod.engine.satlab that return IntSet | |
---|---|
IntSet |
ResolutionTrace.axioms()
Returns the indices of the axioms in this trace. |
IntSet |
ResolutionTrace.backwardReachable(IntSet indices)
Returns the indices of all clauses reachable from the clauses at the given indices by following the transpose of the antecedent relation zero or more times. |
IntSet |
ResolutionTrace.core()
Returns the indices of the axioms that form the unsatisfiable core of this trace. |
IntSet |
ReductionStrategy.next(ResolutionTrace trace)
Returns the next subtrace of the specified trace to be analyzed, given as a set of indices into the trace. |
IntSet |
ResolutionTrace.reachable(IntSet indices)
Returns the indices of all clauses reachable from the clauses at the given indices by following the antecedent relation zero or more times. |
IntSet |
ResolutionTrace.resolvents()
Returns the indices of the resolvents in this trace. |
Methods in kodkod.engine.satlab with parameters of type IntSet | |
---|---|
IntSet |
ResolutionTrace.backwardReachable(IntSet indices)
Returns the indices of all clauses reachable from the clauses at the given indices by following the transpose of the antecedent relation zero or more times. |
java.util.Iterator<Clause> |
ResolutionTrace.iterator(IntSet indices)
Returns an iterator over the elements at the given indices in this trace, in proper sequence. |
IntSet |
ResolutionTrace.reachable(IntSet indices)
Returns the indices of all clauses reachable from the clauses at the given indices by following the antecedent relation zero or more times. |
java.util.Iterator<Clause> |
ResolutionTrace.reverseIterator(IntSet indices)
Returns an iterator over the elements at the given indices in this trace, in the reverse order of indices. |
Uses of IntSet in kodkod.engine.ucore |
---|
Methods in kodkod.engine.ucore that return IntSet | |
---|---|
static IntSet |
StrategyUtils.coreWithVar(ResolutionTrace trace,
int maxVariable)
Returns the indices of the clauses in the unsatifiable core of the given trace that have the specified maximum variable. |
static IntSet |
StrategyUtils.maxCoreVars(ResolutionTrace trace)
Returns the maximum variables of the clauses in the unsatisfiable core of the given trace. |
IntSet |
NaiveStrategy.next(ResolutionTrace trace)
Returns the next subtrace of the specified trace to be analyzed, given as a set of indices into the trace. |
IntSet |
MinTopStrategy.next(ResolutionTrace trace)
Returns the next subtrace of the specified trace to be analyzed, given as a set of indices into the trace. |
IntSet |
HybridStrategy.next(ResolutionTrace trace)
Returns the next subtrace of the specified trace to be analyzed, given as a set of indices into the trace. |
IntSet |
EmptyClauseConeStrategy.next(ResolutionTrace trace)
Returns the next subtrace of the specified trace to be analyzed, given as a set of indices into the trace. |
IntSet |
CRRStrategy.next(ResolutionTrace trace)
Returns the next subset of clauses in the given trace to be analyzed. |
static IntSet |
StrategyUtils.topVars(TranslationLog log)
Returns the variables that correspond to the top-level subformulas of log.formula |
Uses of IntSet in kodkod.instance |
---|
Methods in kodkod.instance that return IntSet | |
---|---|
IntSet |
TupleSet.indexView()
Returns an unmodifiable int set view of the tuples stored in this set. |
IntSet |
Instance.ints()
Returns the integers mapped by this instance. |
IntSet |
Bounds.ints()
Returns the set of all integers bound by this Bounds. |
Methods in kodkod.instance with parameters of type IntSet | |
---|---|
TupleSet |
TupleFactory.setOf(int arity,
IntSet tupleIndices)
Returns a set of the given arity that contains all tuples whose indeces are contained in the given int set. |
Uses of IntSet in kodkod.util.ints |
---|
Classes in kodkod.util.ints that implement IntSet | |
---|---|
class |
AbstractIntSet
A skeletal implementation of the IntSet interface. |
class |
ArrayIntSet
An immutable set of integers, stored in a sorted array. |
class |
IntBitSet
An implementation of the IntSet interface based on a bit map. |
class |
IntTreeSet
An implementation of the IntTreeSet interface based on a balanced binary search tree. |
Fields in kodkod.util.ints declared as IntSet | |
---|---|
static IntSet |
Ints.EMPTY_SET
An immutable empty int set. |
Methods in kodkod.util.ints that return IntSet | |
---|---|
static IntSet |
Ints.asSet(int[] ints)
Returns an IntSet that is backed by the given array of integers. |
static IntSet |
Ints.bestSet(int max)
Returns an implementation of the int set interface that offers the best time/space trade-off for a set that can store all elements in the half open range [0..max). |
static IntSet |
Ints.bestSet(int min,
int max)
Returns an implementation of the int set interface that offers the best time/space trade-off for a set that can store all elements in the closed range [min..max]. |
IntSet |
IntSet.clone()
Returns a copy of this IntSet. |
IntSet |
AbstractIntSet.clone()
Returns the result of calling super.clone(). |
IntSet |
SparseSequence.indices()
Returns the set of all indices mapped by this sparse sequence. |
IntSet |
HomogenousSequence.indices()
Returns the set of all indices mapped by this sparse sequence. |
IntSet |
AbstractSparseSequence.indices()
Returns the set of all indices mapped by this sparse sequence. |
static IntSet |
Ints.rangeSet(IntRange range)
Returns an unmodifiable IntSet that contains all the elements in the given range. |
static IntSet |
Ints.singleton(int i)
Returns an unmodifiable IntSet whose sole element is the given integer. |
static IntSet |
Ints.unmodifiableIntSet(IntSet s)
Returns an unmodifiable view of the specified set. |
Methods in kodkod.util.ints with parameters of type IntSet | |
---|---|
static IntSet |
Ints.unmodifiableIntSet(IntSet s)
Returns an unmodifiable view of the specified set. |
Constructors in kodkod.util.ints with parameters of type IntSet | |
---|---|
ArrayIntSet(IntSet s)
Constructs an ArrayIntSet that is equal to the given set. |
|
ArraySequence(IntSet indices)
Constructs an array sequence that contains the given indeces. |
|
HomogenousSequence(V value,
IntSet indices)
Constructs a new homogenous sequence for the given value, backed by the specified intset. |
|
IntTreeSet(IntSet s)
Constructs a new int set containing the elements in the specified set. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |