|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use IVecInt | |
|---|---|
| org.sat4j.core | Implementation of the data structures available in org.sat4j.specs. |
| org.sat4j.maxsat | MAXSAT and Weighted Max SAT framework. |
| org.sat4j.minisat.constraints | Implementations of various constraints for MiniSAT. |
| org.sat4j.minisat.constraints.card | Implementations of cardinality contraints. |
| org.sat4j.minisat.constraints.cnf | Implementations of clausal contraints. |
| org.sat4j.minisat.core | Implementation of the MiniSAT solver skeleton. |
| org.sat4j.opt | Built-in optimization framework. |
| org.sat4j.pb | |
| org.sat4j.pb.constraints | |
| org.sat4j.pb.constraints.pb | Implementations of pseudo boolean contraints. |
| org.sat4j.pb.core | |
| org.sat4j.pb.reader | |
| org.sat4j.pb.tools | |
| org.sat4j.reader | Some utility classes to read problems from plain text files. |
| org.sat4j.specs | Those classes are intented for users dealing with SAT solvers as blackboxes. |
| org.sat4j.tools | Tools to be used on top of an ISolver. |
| org.sat4j.tools.encoding | |
| org.sat4j.tools.xplain | Implementation of an explanation engine in case of unsatisfiability. |
| Uses of IVecInt in org.sat4j.core |
|---|
| Classes in org.sat4j.core that implement IVecInt | |
|---|---|
class |
ReadOnlyVecInt
Utility class to allow Read Only access only to an IVecInt. |
class |
VecInt
A vector specific for primitive integers, widely used in the solver. |
| Fields in org.sat4j.core declared as IVecInt | |
|---|---|
static IVecInt |
VecInt.EMPTY
|
| Methods in org.sat4j.core that return IVecInt | |
|---|---|
IVecInt |
ReadOnlyVecInt.pop()
|
IVecInt |
VecInt.pop()
depile le dernier element du vecteur. |
IVecInt |
ReadOnlyVecInt.push(int elem)
|
IVecInt |
VecInt.push(int elem)
|
IVecInt[] |
VecInt.subset(int cardinal)
|
| Methods in org.sat4j.core with parameters of type IVecInt | |
|---|---|
void |
ReadOnlyVecInt.copyTo(IVecInt copy)
|
void |
VecInt.copyTo(IVecInt copy)
Copy the content of this vector into another one. |
void |
ReadOnlyVecInt.moveTo(IVecInt dest)
|
void |
VecInt.moveTo(IVecInt dest)
|
void |
ReadOnlyVecInt.moveTo2(IVecInt dest)
|
void |
VecInt.moveTo2(IVecInt dest)
|
void |
VecInt.pushAll(IVecInt vec)
|
| Constructors in org.sat4j.core with parameters of type IVecInt | |
|---|---|
ReadOnlyVecInt(IVecInt vec)
|
|
| Uses of IVecInt in org.sat4j.maxsat |
|---|
| Methods in org.sat4j.maxsat with parameters of type IVecInt | |
|---|---|
IConstr |
WeightedMaxSatDecorator.addClause(IVecInt literals)
Add a soft clause to the solver. |
IConstr |
WeightedMaxSatDecorator.addHardClause(IVecInt literals)
Add a hard clause in the solver, i.e. a clause that must be satisfied. |
void |
WeightedMaxSatDecorator.addLiteralsToMinimize(IVecInt literals)
Set some literals whose sum must be minimized. |
IConstr |
WeightedMaxSatDecorator.addSoftAtLeast(BigInteger weight,
IVecInt literals,
int degree)
Allow adding a new soft cardinality constraint in the solver. |
IConstr |
WeightedMaxSatDecorator.addSoftAtLeast(int weight,
IVecInt literals,
int degree)
Allow adding a new soft cardinality constraint in the solver. |
IConstr |
WeightedMaxSatDecorator.addSoftAtLeast(IVecInt literals,
int degree)
Allow adding a new soft cardinality constraint in the solver. |
IConstr |
WeightedMaxSatDecorator.addSoftAtMost(BigInteger weight,
IVecInt literals,
int degree)
Allow adding a new soft cardinality constraint in the solver. |
IConstr |
WeightedMaxSatDecorator.addSoftAtMost(int weight,
IVecInt literals,
int degree)
Allow adding a new soft cardinality constraint in the solver. |
IConstr |
WeightedMaxSatDecorator.addSoftAtMost(IVecInt literals,
int degree)
Allow adding a new soft cardinality constraint in the solver. |
IConstr |
WeightedMaxSatDecorator.addSoftClause(BigInteger weight,
IVecInt literals)
|
IConstr |
WeightedMaxSatDecorator.addSoftClause(int weight,
IVecInt literals)
Add a soft clause to the solver. |
IConstr |
WeightedMaxSatDecorator.addSoftClause(IVecInt literals)
Add a soft clause in the solver, i.e. a clause with a weight of 1. |
void |
WeightedMaxSatDecorator.addWeightedLiteralsToMinimize(IVecInt literals,
IVec<BigInteger> coefficients)
Set some literals whose sum must be minimized. |
void |
WeightedMaxSatDecorator.addWeightedLiteralsToMinimize(IVecInt literals,
IVecInt coefficients)
Set some literals whose sum must be minimized. |
boolean |
MinCostDecorator.admitABetterSolution(IVecInt assumps)
|
| Uses of IVecInt in org.sat4j.minisat.constraints |
|---|
| Methods in org.sat4j.minisat.constraints with parameters of type IVecInt | |
|---|---|
Constr |
AbstractDataStructureFactory.createCardinalityConstraint(IVecInt literals,
int degree)
|
Constr |
MixedDataStructureSingleWL.createCardinalityConstraint(IVecInt literals,
int degree)
|
Constr |
CardinalityDataStructure.createCardinalityConstraint(IVecInt literals,
int degree)
|
Constr |
MixedDataStructureDanielHT.createCardinalityConstraint(IVecInt literals,
int degree)
|
Constr |
MixedDataStructureDanielWL.createCardinalityConstraint(IVecInt literals,
int degree)
|
Constr |
CardinalityDataStructureYanMin.createCardinalityConstraint(IVecInt literals,
int degree)
|
Constr |
CardinalityDataStructureYanMax.createCardinalityConstraint(IVecInt literals,
int degree)
|
Constr |
ClausalDataStructureWL.createClause(IVecInt literals)
|
Constr |
MixedDataStructureSingleWL.createClause(IVecInt literals)
|
Constr |
CardinalityDataStructure.createClause(IVecInt literals)
|
Constr |
MixedDataStructureDanielHT.createClause(IVecInt literals)
|
Constr |
MixedDataStructureDanielWL.createClause(IVecInt literals)
|
Constr |
CardinalityDataStructureYanMin.createClause(IVecInt literals)
|
Constr |
CardinalityDataStructureYanMax.createClause(IVecInt literals)
|
Constr |
ClausalDataStructureWL.createUnregisteredClause(IVecInt literals)
|
Constr |
MixedDataStructureSingleWL.createUnregisteredClause(IVecInt literals)
|
Constr |
CardinalityDataStructure.createUnregisteredClause(IVecInt literals)
|
Constr |
MixedDataStructureDanielHT.createUnregisteredClause(IVecInt literals)
|
Constr |
MixedDataStructureDanielWL.createUnregisteredClause(IVecInt literals)
|
Constr |
CardinalityDataStructureYanMin.createUnregisteredClause(IVecInt literals)
|
Constr |
CardinalityDataStructureYanMax.createUnregisteredClause(IVecInt literals)
|
| Uses of IVecInt in org.sat4j.minisat.constraints.card |
|---|
| Methods in org.sat4j.minisat.constraints.card with parameters of type IVecInt | |
|---|---|
static Constr |
AtLeast.atLeastNew(UnitPropagationListener s,
ILits voc,
IVecInt ps,
int n)
|
void |
MaxWatchCard.calcReason(int p,
IVecInt outReason)
Calcule la cause de l'affection d'un litt? |
void |
AtLeast.calcReason(int p,
IVecInt outReason)
|
void |
MinWatchCard.calcReason(int p,
IVecInt outReason)
computes the reason for a literal |
protected static int |
MinWatchCard.linearisation(ILits voc,
IVecInt ps)
Simplifies the constraint w.r.t. the assignments of the literals |
static Constr |
MaxWatchCard.maxWatchCardNew(UnitPropagationListener s,
ILits voc,
IVecInt ps,
boolean moreThan,
int degree)
Permet la cr? |
static Constr |
MinWatchCard.minWatchCardNew(UnitPropagationListener s,
ILits voc,
IVecInt ps,
boolean moreThan,
int degree)
Constructs a cardinality constraint with a minimal set of watched literals Permet la cr? |
protected static int |
AtLeast.niceParameters(UnitPropagationListener s,
ILits voc,
IVecInt ps,
int deg)
|
| Constructors in org.sat4j.minisat.constraints.card with parameters of type IVecInt | |
|---|---|
AtLeast(ILits voc,
IVecInt ps,
int degree)
|
|
MinWatchCard(ILits voc,
IVecInt ps,
boolean moreThan,
int degree)
Constructs and normalizes a cardinality constraint. used by minWatchCardNew in the non-normalized case. |
|
MinWatchCard(ILits voc,
IVecInt ps,
int degree)
Constructs and normalizes a cardinality constraint. used by MinWatchCardPB.normalizedMinWatchCardNew() in the normalized case. |
|
| Uses of IVecInt in org.sat4j.minisat.constraints.cnf |
|---|
| Methods in org.sat4j.minisat.constraints.cnf that return IVecInt | |
|---|---|
static IVecInt |
Clauses.sanityCheck(IVecInt ps,
ILits voc,
UnitPropagationListener s)
Perform some sanity check before constructing a clause a) if a literal is assigned true, return null (the clause is satisfied) b) if a literal is assigned false, remove it c) if a clause contains a literal and its opposite (tautology) return null d) remove duplicate literals e) if the clause is empty, return null f) if the clause if unit, transmit it to the object responsible for unit propagation |
| Methods in org.sat4j.minisat.constraints.cnf with parameters of type IVecInt | |
|---|---|
static OriginalWLClause |
OriginalWLClause.brandNewClause(UnitPropagationListener s,
ILits voc,
IVecInt literals)
Creates a brand new clause, presumably from external data. |
static OriginalHTClause |
OriginalHTClause.brandNewClause(UnitPropagationListener s,
ILits voc,
IVecInt literals)
Creates a brand new clause, presumably from external data. |
static OriginalBinaryClause |
OriginalBinaryClause.brandNewClause(UnitPropagationListener s,
ILits voc,
IVecInt literals)
Creates a brand new clause, presumably from external data. |
void |
HTClause.calcReason(int p,
IVecInt outReason)
|
void |
UnitClause.calcReason(int p,
IVecInt outReason)
|
void |
UnitClauses.calcReason(int p,
IVecInt outReason)
|
void |
WLClause.calcReason(int p,
IVecInt outReason)
|
void |
BinaryClause.calcReason(int p,
IVecInt outReason)
|
static IVecInt |
Clauses.sanityCheck(IVecInt ps,
ILits voc,
UnitPropagationListener s)
Perform some sanity check before constructing a clause a) if a literal is assigned true, return null (the clause is satisfied) b) if a literal is assigned false, remove it c) if a clause contains a literal and its opposite (tautology) return null d) remove duplicate literals e) if the clause is empty, return null f) if the clause if unit, transmit it to the object responsible for unit propagation |
| Constructors in org.sat4j.minisat.constraints.cnf with parameters of type IVecInt | |
|---|---|
BinaryClause(IVecInt ps,
ILits voc)
Creates a new basic clause |
|
HTClause(IVecInt ps,
ILits voc)
Creates a new basic clause |
|
LearntBinaryClause(IVecInt ps,
ILits voc)
|
|
LearntHTClause(IVecInt ps,
ILits voc)
|
|
LearntWLClause(IVecInt ps,
ILits voc)
|
|
OriginalBinaryClause(IVecInt ps,
ILits voc)
|
|
OriginalHTClause(IVecInt ps,
ILits voc)
|
|
OriginalWLClause(IVecInt ps,
ILits voc)
|
|
UnitClauses(IVecInt values)
|
|
WLClause(IVecInt ps,
ILits voc)
Creates a new basic clause |
|
| Uses of IVecInt in org.sat4j.minisat.core |
|---|
| Fields in org.sat4j.minisat.core declared as IVecInt | |
|---|---|
protected IVecInt |
Solver.trail
affectation en ordre chronologique |
protected IVecInt |
Solver.trailLim
indice des s? |
| Methods in org.sat4j.minisat.core that return IVecInt | |
|---|---|
IVecInt |
Solver.analyzeFinalConflictInTermsOfAssumptions(Constr confl,
IVecInt assumps,
int conflictingLiteral)
Derive a subset of the assumptions causing the inconistency. |
protected IVecInt |
Solver.dimacs2internal(IVecInt in)
|
IVecInt |
Solver.getOutLearnt()
|
IVecInt |
Solver.unsatExplanation()
|
| Methods in org.sat4j.minisat.core with parameters of type IVecInt | |
|---|---|
IConstr |
Solver.addAtLeast(IVecInt literals,
int degree)
|
IConstr |
Solver.addAtMost(IVecInt literals,
int degree)
|
IConstr |
Solver.addBlockingClause(IVecInt literals)
|
IConstr |
Solver.addClause(IVecInt literals)
|
IConstr |
Solver.addExactly(IVecInt literals,
int n)
|
IVecInt |
Solver.analyzeFinalConflictInTermsOfAssumptions(Constr confl,
IVecInt assumps,
int conflictingLiteral)
Derive a subset of the assumptions causing the inconistency. |
void |
Constr.calcReason(int p,
IVecInt outReason)
Compute the reason for a given assignment. |
Constr |
DataStructureFactory.createCardinalityConstraint(IVecInt literals,
int degree)
Create a cardinality constraint of the form sum li >= degree. |
Constr |
DataStructureFactory.createClause(IVecInt literals)
|
Constr |
DataStructureFactory.createUnregisteredClause(IVecInt literals)
|
protected IVecInt |
Solver.dimacs2internal(IVecInt in)
|
int[] |
Solver.findModel(IVecInt assumps)
|
boolean |
Solver.isSatisfiable(IVecInt assumps)
|
boolean |
Solver.isSatisfiable(IVecInt assumps,
boolean global)
|
| Method parameters in org.sat4j.minisat.core with type arguments of type IVecInt | |
|---|---|
void |
Solver.addAllClauses(IVec<IVecInt> clauses)
|
| Uses of IVecInt in org.sat4j.opt |
|---|
| Methods in org.sat4j.opt with parameters of type IVecInt | |
|---|---|
IConstr |
MaxSatDecorator.addClause(IVecInt literals)
|
boolean |
AbstractSelectorVariablesDecorator.admitABetterSolution(IVecInt assumps)
|
boolean |
MaxSatDecorator.admitABetterSolution(IVecInt assumps)
|
boolean |
MinOneDecorator.admitABetterSolution(IVecInt assumps)
|
| Uses of IVecInt in org.sat4j.pb |
|---|
| Methods in org.sat4j.pb that return IVecInt | |
|---|---|
IVecInt |
ObjectiveFunction.getVars()
|
| Methods in org.sat4j.pb with parameters of type IVecInt | |
|---|---|
IConstr |
UserFriendlyPBStringSolver.addAtLeast(IVecInt literals,
int degree)
|
IConstr |
OPBStringSolver.addAtLeast(IVecInt literals,
int degree)
|
IConstr |
PseudoBitsAdderDecorator.addAtLeast(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
IPBSolver.addAtLeast(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
Create a pseudo-boolean constraint of the type "at least". |
IConstr |
UserFriendlyPBStringSolver.addAtLeast(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
PBSolverDecorator.addAtLeast(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
OPBStringSolver.addAtLeast(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
PseudoBitsAdderDecorator.addAtLeast(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
IPBSolver.addAtLeast(IVecInt literals,
IVecInt coeffs,
int degree)
Create a pseudo-boolean constraint of the type "at least". |
IConstr |
UserFriendlyPBStringSolver.addAtLeast(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
PBSolverDecorator.addAtLeast(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
OPBStringSolver.addAtLeast(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
UserFriendlyPBStringSolver.addAtMost(IVecInt literals,
int degree)
|
IConstr |
OPBStringSolver.addAtMost(IVecInt literals,
int degree)
|
IConstr |
PseudoBitsAdderDecorator.addAtMost(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
IPBSolver.addAtMost(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
Create a pseudo boolean constraint of the type "at most". |
IConstr |
UserFriendlyPBStringSolver.addAtMost(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
PBSolverDecorator.addAtMost(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
OPBStringSolver.addAtMost(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
PseudoBitsAdderDecorator.addAtMost(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
IPBSolver.addAtMost(IVecInt literals,
IVecInt coeffs,
int degree)
Create a pseudo boolean constraint of the type "at most". |
IConstr |
UserFriendlyPBStringSolver.addAtMost(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
PBSolverDecorator.addAtMost(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
OPBStringSolver.addAtMost(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
UserFriendlyPBStringSolver.addClause(IVecInt literals)
|
IConstr |
OPBStringSolver.addClause(IVecInt literals)
|
IConstr |
PseudoBitsAdderDecorator.addExactly(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger weight)
|
IConstr |
IPBSolver.addExactly(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger weight)
Create a pseudo-boolean constraint of the type "subset sum". |
IConstr |
UserFriendlyPBStringSolver.addExactly(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger weight)
|
IConstr |
PBSolverDecorator.addExactly(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger weight)
|
IConstr |
OPBStringSolver.addExactly(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger weight)
|
IConstr |
PseudoBitsAdderDecorator.addExactly(IVecInt literals,
IVecInt coeffs,
int weight)
|
IConstr |
IPBSolver.addExactly(IVecInt literals,
IVecInt coeffs,
int weight)
Create a pseudo-boolean constraint of the type "subset sum". |
IConstr |
UserFriendlyPBStringSolver.addExactly(IVecInt literals,
IVecInt coeffs,
int weight)
|
IConstr |
PBSolverDecorator.addExactly(IVecInt literals,
IVecInt coeffs,
int weight)
|
IConstr |
OPBStringSolver.addExactly(IVecInt literals,
IVecInt coeffs,
int weight)
|
IConstr |
PseudoBitsAdderDecorator.addPseudoBoolean(IVecInt lits,
IVec<BigInteger> coeffs,
boolean moreThan,
BigInteger d)
|
IConstr |
IPBSolver.addPseudoBoolean(IVecInt lits,
IVec<BigInteger> coeffs,
boolean moreThan,
BigInteger d)
Create a Pseudo-Boolean constraint of the type "at least n or at most n of those literals must be satisfied" |
IConstr |
UserFriendlyPBStringSolver.addPseudoBoolean(IVecInt lits,
IVec<BigInteger> coeffs,
boolean moreThan,
BigInteger d)
|
IConstr |
PBSolverDecorator.addPseudoBoolean(IVecInt lits,
IVec<BigInteger> coeffs,
boolean moreThan,
BigInteger d)
|
IConstr |
OPBStringSolver.addPseudoBoolean(IVecInt lits,
IVec<BigInteger> coeffs,
boolean moreThan,
BigInteger d)
|
boolean |
ConstraintRelaxingPseudoOptDecorator.admitABetterSolution(IVecInt assumps)
|
boolean |
PseudoOptDecorator.admitABetterSolution(IVecInt assumps)
|
boolean |
ConstraintRelaxingPseudoOptDecorator.isSatisfiable(IVecInt assumps)
|
boolean |
PseudoOptDecorator.isSatisfiable(IVecInt assumps)
|
boolean |
PseudoBitsAdderDecorator.isSatisfiable(IVecInt assumps)
|
boolean |
OptToPBSATAdapter.isSatisfiable(IVecInt myAssumps)
|
boolean |
OPBStringSolver.isSatisfiable(IVecInt assumps)
|
boolean |
ConstraintRelaxingPseudoOptDecorator.isSatisfiable(IVecInt assumps,
boolean global)
|
boolean |
PseudoOptDecorator.isSatisfiable(IVecInt assumps,
boolean global)
|
boolean |
OptToPBSATAdapter.isSatisfiable(IVecInt myAssumps,
boolean global)
|
boolean |
OPBStringSolver.isSatisfiable(IVecInt assumps,
boolean global)
|
void |
UserFriendlyPBStringSolver.setListOfVariablesForExplanation(IVecInt listOfVariables)
|
void |
OPBStringSolver.setListOfVariablesForExplanation(IVecInt listOfVariables)
|
| Constructors in org.sat4j.pb with parameters of type IVecInt | |
|---|---|
ObjectiveFunction(IVecInt vars,
IVec<BigInteger> coeffs)
|
|
| Uses of IVecInt in org.sat4j.pb.constraints |
|---|
| Methods in org.sat4j.pb.constraints with parameters of type IVecInt | |
|---|---|
protected Constr |
AbstractPBClauseCardConstrDataStructure.constructCard(IVecInt theLits,
int degree)
|
Constr |
MinCardConstructor.constructCard(UnitPropagationListener solver,
ILits voc,
IVecInt theLits,
int degree)
|
Constr |
ICardConstructor.constructCard(UnitPropagationListener solver,
ILits voc,
IVecInt theLits,
int degree)
|
Constr |
AtLeastCardPBConstructor.constructCard(UnitPropagationListener solver,
ILits voc,
IVecInt theLits,
int degree)
|
Constr |
MinCardPBConstructor.constructCard(UnitPropagationListener solver,
ILits voc,
IVecInt theLits,
int degree)
|
Constr |
AtLeastCardConstructor.constructCard(UnitPropagationListener solver,
ILits voc,
IVecInt theLits,
int degree)
|
protected Constr |
AbstractPBClauseCardConstrDataStructure.constructClause(IVecInt v)
|
Constr |
UnitBinaryHTClauseConstructor.constructClause(UnitPropagationListener solver,
ILits voc,
IVecInt v)
|
Constr |
UnitBinaryWLClauseConstructor.constructClause(UnitPropagationListener solver,
ILits voc,
IVecInt v)
|
Constr |
UnitBinaryHTClausePBConstructor.constructClause(UnitPropagationListener solver,
ILits voc,
IVecInt v)
|
Constr |
IClauseConstructor.constructClause(UnitPropagationListener solver,
ILits voc,
IVecInt v)
|
Constr |
UnitBinaryHTClauseConstructor.constructLearntClause(ILits voc,
IVecInt literals)
|
Constr |
UnitBinaryWLClauseConstructor.constructLearntClause(ILits voc,
IVecInt literals)
|
Constr |
UnitBinaryHTClausePBConstructor.constructLearntClause(ILits voc,
IVecInt literals)
|
Constr |
IClauseConstructor.constructLearntClause(ILits voc,
IVecInt literals)
|
protected Constr |
AbstractPBClauseCardConstrDataStructure.constructLearntClause(IVecInt literals)
|
Constr |
AbstractPBDataStructureFactory.createCardinalityConstraint(IVecInt literals,
int degree)
|
Constr |
AbstractPBDataStructureFactory.createClause(IVecInt literals)
|
Constr |
AbstractPBClauseCardConstrDataStructure.createClause(IVecInt literals)
|
Constr |
PuebloPBMinClauseCardConstrDataStructure.createClause(IVecInt literals)
|
Constr |
AbstractPBDataStructureFactory.createPseudoBooleanConstraint(IVecInt literals,
IVec<BigInteger> coefs,
boolean moreThan,
BigInteger degree)
|
Constr |
AbstractPBDataStructureFactory.createUnregisteredClause(IVecInt literals)
|
Constr |
AbstractPBClauseCardConstrDataStructure.createUnregisteredClause(IVecInt literals)
|
| Uses of IVecInt in org.sat4j.pb.constraints.pb |
|---|
| Methods in org.sat4j.pb.constraints.pb that return IVecInt | |
|---|---|
IVecInt |
MinWatchCardPB.computeAnImpliedClause()
|
IVecInt |
WatchPbLongCP.computeAnImpliedClause()
compute an implied clause on the literals with the greater coefficients. |
IVecInt |
AtLeastPB.computeAnImpliedClause()
|
IVecInt |
WatchPb.computeAnImpliedClause()
compute an implied clause on the literals with the greater coefficients. |
IVecInt |
OriginalBinaryClausePB.computeAnImpliedClause()
|
IVecInt |
PBConstr.computeAnImpliedClause()
|
IVecInt |
UnitClausesPB.computeAnImpliedClause()
|
IVecInt |
LearntBinaryClausePB.computeAnImpliedClause()
|
IVecInt |
WatchPbLong.computeAnImpliedClause()
compute an implied clause on the literals with the greater coefficients. |
IVecInt |
OriginalHTClausePB.computeAnImpliedClause()
|
IVecInt |
LearntHTClausePB.computeAnImpliedClause()
|
IVecInt |
UnitClausePB.computeAnImpliedClause()
|
| Methods in org.sat4j.pb.constraints.pb with parameters of type IVecInt | |
|---|---|
static AtLeastPB |
AtLeastPB.atLeastNew(ILits voc,
IVecInt ps,
int n)
|
static PBConstr |
AtLeastPB.atLeastNew(UnitPropagationListener s,
ILits voc,
IVecInt ps,
int n)
|
static OriginalBinaryClausePB |
OriginalBinaryClausePB.brandNewClause(UnitPropagationListener s,
ILits voc,
IVecInt literals)
Creates a brand new clause, presumably from external data. |
static OriginalHTClausePB |
OriginalHTClausePB.brandNewClause(UnitPropagationListener s,
ILits voc,
IVecInt literals)
Creates a brand new clause, presumably from external data. |
void |
MapPb.buildConstraintFromConflict(IVecInt resLits,
IVec<BigInteger> resCoefs)
|
void |
IDataStructurePB.buildConstraintFromConflict(IVecInt resLits,
IVec<BigInteger> resCoefs)
|
void |
WatchPbLongCP.calcReason(int p,
IVecInt outReason)
compute the reason for the assignment of a literal |
void |
WatchPb.calcReason(int p,
IVecInt outReason)
compute the reason for the assignment of a literal |
void |
WatchPbLong.calcReason(int p,
IVecInt outReason)
compute the reason for the assignment of a literal |
static PBConstr |
MinWatchCardPB.minWatchCardPBNew(UnitPropagationListener s,
ILits voc,
IVecInt ps,
boolean moreThan,
int degree)
Permet la cr? |
static IDataStructurePB |
Pseudos.niceCheckedParameters(IVecInt ps,
IVec<BigInteger> bigCoefs,
boolean moreThan,
BigInteger bigDeg,
ILits voc)
|
static IDataStructurePB |
Pseudos.niceParameters(IVecInt ps,
IVec<BigInteger> bigCoefs,
boolean moreThan,
BigInteger bigDeg,
ILits voc)
|
static PBConstr |
MinWatchCardPB.normalizedMinWatchCardPBNew(UnitPropagationListener s,
ILits voc,
IVecInt ps,
int degree)
Permet la cr? |
static IVec<BigInteger> |
Pseudos.toVecBigInt(IVecInt vec)
|
| Constructors in org.sat4j.pb.constraints.pb with parameters of type IVecInt | |
|---|---|
LearntBinaryClausePB(IVecInt ps,
ILits voc)
|
|
LearntHTClausePB(IVecInt ps,
ILits voc)
|
|
MinWatchCardPB(ILits voc,
IVecInt ps,
boolean moreThan,
int degree)
|
|
MinWatchCardPB(ILits voc,
IVecInt ps,
int degree)
|
|
OriginalBinaryClausePB(IVecInt ps,
ILits voc)
|
|
OriginalHTClausePB(IVecInt ps,
ILits voc)
|
|
UnitClausesPB(IVecInt values)
|
|
| Uses of IVecInt in org.sat4j.pb.core |
|---|
| Methods in org.sat4j.pb.core with parameters of type IVecInt | |
|---|---|
IConstr |
PBSolver.addAtLeast(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
PBSolver.addAtLeast(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
PBSolver.addAtMost(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
PBSolver.addAtMost(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
PBSolver.addExactly(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger weight)
|
IConstr |
PBSolver.addExactly(IVecInt literals,
IVecInt coeffs,
int weight)
|
IConstr |
PBSolver.addPseudoBoolean(IVecInt literals,
IVec<BigInteger> coeffs,
boolean moreThan,
BigInteger degree)
|
IConstr |
PBSolverWithImpliedClause.addPseudoBoolean(IVecInt literals,
IVec<BigInteger> coeffs,
boolean moreThan,
BigInteger degree)
|
Constr |
PBDataStructureFactory.createPseudoBooleanConstraint(IVecInt literals,
IVec<BigInteger> coefs,
boolean moreThan,
BigInteger degree)
|
| Uses of IVecInt in org.sat4j.pb.reader |
|---|
| Fields in org.sat4j.pb.reader declared as IVecInt | |
|---|---|
protected IVecInt |
OPBReader2005.lits
|
| Methods in org.sat4j.pb.reader that return IVecInt | |
|---|---|
IVecInt |
OPBReader2005.getListOfVariables()
|
IVecInt |
OPBEclipseReader2007.getListOfVariables()
|
IVecInt |
OPBReader2005.getVars()
|
| Methods in org.sat4j.pb.reader with parameters of type IVecInt | |
|---|---|
protected void |
OPBReader2007.literalInAProduct(String var,
IVecInt lits)
callback called when we read a term of a constraint |
protected void |
OPBReader2007.negateLiteralInAProduct(String var,
IVecInt lits)
callback called when we read a term of a constraint |
| Uses of IVecInt in org.sat4j.pb.tools |
|---|
| Methods in org.sat4j.pb.tools with parameters of type IVecInt | |
|---|---|
IConstr |
XplainPB.addAtLeast(IVecInt literals,
int degree)
|
IConstr |
ClausalConstraintsDecorator.addAtLeast(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
XplainPB.addAtLeast(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
ManyCorePB.addAtLeast(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
LexicoDecoratorPB.addAtLeast(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
ClausalConstraintsDecorator.addAtLeast(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
XplainPB.addAtLeast(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
ManyCorePB.addAtLeast(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
LexicoDecoratorPB.addAtLeast(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
XplainPB.addAtMost(IVecInt literals,
int degree)
|
IConstr |
ClausalConstraintsDecorator.addAtMost(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
XplainPB.addAtMost(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
ManyCorePB.addAtMost(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
LexicoDecoratorPB.addAtMost(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger degree)
|
IConstr |
ClausalConstraintsDecorator.addAtMost(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
XplainPB.addAtMost(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
ManyCorePB.addAtMost(IVecInt literals,
IVecInt coeffs,
int degree)
|
IConstr |
LexicoDecoratorPB.addAtMost(IVecInt literals,
IVecInt coeffs,
int degree)
|
void |
LexicoDecoratorPB.addCriterion(IVecInt literals)
|
void |
LexicoDecoratorPB.addCriterion(IVecInt literals,
IVec<BigInteger> coefs)
|
IConstr |
XplainPB.addExactly(IVecInt literals,
int n)
|
IConstr |
ClausalConstraintsDecorator.addExactly(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger weight)
|
IConstr |
XplainPB.addExactly(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger weight)
|
IConstr |
ManyCorePB.addExactly(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger weight)
|
IConstr |
LexicoDecoratorPB.addExactly(IVecInt literals,
IVec<BigInteger> coeffs,
BigInteger weight)
|
IConstr |
ClausalConstraintsDecorator.addExactly(IVecInt literals,
IVecInt coeffs,
int weight)
|
IConstr |
XplainPB.addExactly(IVecInt literals,
IVecInt coeffs,
int weight)
|
IConstr |
ManyCorePB.addExactly(IVecInt literals,
IVecInt coeffs,
int weight)
|
IConstr |
LexicoDecoratorPB.addExactly(IVecInt literals,
IVecInt coeffs,
int weight)
|
IConstr |
ClausalConstraintsDecorator.addPseudoBoolean(IVecInt lits,
IVec<BigInteger> coeffs,
boolean moreThan,
BigInteger d)
|
IConstr |
XplainPB.addPseudoBoolean(IVecInt lits,
IVec<BigInteger> coeffs,
boolean moreThan,
BigInteger d)
|
IConstr |
ManyCorePB.addPseudoBoolean(IVecInt lits,
IVec<BigInteger> coeffs,
boolean moreThan,
BigInteger d)
|
IConstr |
LexicoDecoratorPB.addPseudoBoolean(IVecInt lits,
IVec<BigInteger> coeffs,
boolean moreThan,
BigInteger d)
|
boolean |
LexicoDecoratorPB.admitABetterSolution(IVecInt assumps)
|
| Constructors in org.sat4j.pb.tools with parameters of type IVecInt | |
|---|---|
DisjunctionRHS(DependencyHelper<T,C> helper,
IVecInt literals)
|
|
ImplicationAnd(DependencyHelper<T,C> helper,
IVecInt clause)
|
|
ImplicationRHS(DependencyHelper<T,C> helper,
IVecInt clause)
|
|
| Uses of IVecInt in org.sat4j.reader |
|---|
| Fields in org.sat4j.reader declared as IVecInt | |
|---|---|
protected IVecInt |
DimacsReader.literals
|
| Uses of IVecInt in org.sat4j.specs |
|---|
| Methods in org.sat4j.specs that return IVecInt | |
|---|---|
IVecInt |
IVecInt.pop()
depile le dernier element du vecteur. |
IVecInt |
IVecInt.push(int elem)
|
IVecInt[] |
IVecInt.subset(int k)
Compute all subsets of cardinal k of the vector. |
IVecInt |
ISolver.unsatExplanation()
Retrieve an explanation of the inconsistency in terms of assumption literals. |
| Methods in org.sat4j.specs with parameters of type IVecInt | |
|---|---|
IConstr |
ISolver.addAtLeast(IVecInt literals,
int degree)
Create a cardinality constraint of the type "at least n of those literals must be satisfied" |
IConstr |
ISolver.addAtMost(IVecInt literals,
int degree)
Create a cardinality constraint of the type "at most n of those literals must be satisfied" |
IConstr |
ISolver.addBlockingClause(IVecInt literals)
Add a clause in order to prevent an assignment to occur. |
IConstr |
ISolver.addClause(IVecInt literals)
Create a clause from a set of literals The literals are represented by non null integers such that opposite literals a represented by opposite values. |
IConstr |
ISolver.addExactly(IVecInt literals,
int n)
Create a cardinality constraint of the type "exactly n of those literals must be satisfied". |
boolean |
IOptimizationProblem.admitABetterSolution(IVecInt assumps)
Look for a solution of the optimization problem when some literals are satisfied. |
void |
IVecInt.copyTo(IVecInt copy)
C'est operations devraient se faire en temps constant. |
int[] |
IProblem.findModel(IVecInt assumps)
Look for a model satisfying all the clauses available in the problem. |
boolean |
IProblem.isSatisfiable(IVecInt assumps)
Check the satisfiability of the set of constraints contained inside the solver. |
boolean |
IProblem.isSatisfiable(IVecInt assumps,
boolean globalTimeout)
Check the satisfiability of the set of constraints contained inside the solver. |
void |
IVecInt.moveTo(IVecInt dest)
|
void |
IVecInt.moveTo2(IVecInt dest)
|
| Method parameters in org.sat4j.specs with type arguments of type IVecInt | |
|---|---|
void |
ISolver.addAllClauses(IVec<IVecInt> clauses)
Create clauses from a set of set of literals. |
| Uses of IVecInt in org.sat4j.tools |
|---|
| Fields in org.sat4j.tools with type parameters of type IVecInt | |
|---|---|
protected List<IVecInt> |
LexicoDecorator.criteria
|
| Methods in org.sat4j.tools that return IVecInt | |
|---|---|
static IVecInt |
RemiUtils.backbone(ISolver s)
Compute the set of literals common to all models of the formula. |
IVecInt |
AbstractOutputSolver.unsatExplanation()
|
IVecInt |
ManyCore.unsatExplanation()
|
IVecInt |
SolverDecorator.unsatExplanation()
|
| Methods in org.sat4j.tools with parameters of type IVecInt | |
|---|---|
IConstr |
ManyCore.addAtLeast(IVecInt literals,
int degree)
|
IConstr |
ClausalCardinalitiesDecorator.addAtLeast(IVecInt literals,
int k)
|
IConstr |
DimacsOutputSolver.addAtLeast(IVecInt literals,
int degree)
|
IConstr |
DimacsStringSolver.addAtLeast(IVecInt literals,
int degree)
|
IConstr |
SolverDecorator.addAtLeast(IVecInt literals,
int degree)
|
IConstr |
ManyCore.addAtMost(IVecInt literals,
int degree)
|
IConstr |
ClausalCardinalitiesDecorator.addAtMost(IVecInt literals,
int k)
|
IConstr |
DimacsOutputSolver.addAtMost(IVecInt literals,
int degree)
|
IConstr |
DimacsStringSolver.addAtMost(IVecInt literals,
int degree)
|
IConstr |
SolverDecorator.addAtMost(IVecInt literals,
int degree)
|
IConstr |
AbstractOutputSolver.addBlockingClause(IVecInt literals)
|
IConstr |
ManyCore.addBlockingClause(IVecInt literals)
|
IConstr |
SolverDecorator.addBlockingClause(IVecInt literals)
|
IConstr |
ManyCore.addClause(IVecInt literals)
|
IConstr |
DimacsOutputSolver.addClause(IVecInt literals)
|
IConstr |
DimacsStringSolver.addClause(IVecInt literals)
|
IConstr |
SolverDecorator.addClause(IVecInt literals)
|
void |
LexicoDecorator.addCriterion(IVecInt literals)
|
IConstr |
ManyCore.addExactly(IVecInt literals,
int n)
|
IConstr |
ClausalCardinalitiesDecorator.addExactly(IVecInt literals,
int k)
|
IConstr |
DimacsOutputSolver.addExactly(IVecInt literals,
int n)
|
IConstr |
DimacsStringSolver.addExactly(IVecInt literals,
int n)
|
IConstr |
SolverDecorator.addExactly(IVecInt literals,
int n)
|
boolean |
LexicoDecorator.admitABetterSolution(IVecInt assumps)
|
IConstr[] |
GateTranslator.and(int y,
IVecInt literals)
Translate y <=> x1 /\ x2 /\ ... /\ xn into clauses. |
int[] |
AbstractOutputSolver.findModel(IVecInt assumps)
|
int[] |
ManyCore.findModel(IVecInt assumps)
|
int[] |
SolverDecorator.findModel(IVecInt assumps)
|
IConstr[] |
GateTranslator.halfOr(int y,
IVecInt literals)
translate y <= x1 \/ x2 \/ ... \/ xn into clauses. |
boolean |
SingleSolutionDetector.hasASingleSolution(IVecInt assumptions)
Please use that method only after a positive answer from isSatisfiable(assumptions) (else a runtime exception will be launched). |
IConstr[] |
GateTranslator.iff(int y,
IVecInt literals)
translate y <=> (x1 <=> x2 <=> ... <=> xn) into clauses. |
boolean |
AbstractOutputSolver.isSatisfiable(IVecInt assumps)
|
boolean |
ManyCore.isSatisfiable(IVecInt assumps)
|
boolean |
OptToSatAdapter.isSatisfiable(IVecInt assumps)
|
boolean |
ModelIterator.isSatisfiable(IVecInt assumps)
|
boolean |
SolverDecorator.isSatisfiable(IVecInt assumps)
|
boolean |
AbstractOutputSolver.isSatisfiable(IVecInt assumps,
boolean global)
|
boolean |
ManyCore.isSatisfiable(IVecInt assumps,
boolean globalTimeout)
|
boolean |
OptToSatAdapter.isSatisfiable(IVecInt assumps,
boolean global)
|
boolean |
SolverDecorator.isSatisfiable(IVecInt assumps,
boolean global)
|
void |
GateTranslator.optimisationFunction(IVecInt literals,
IVec<BigInteger> coefs,
IVecInt result)
Translate an optimization function into constraints and provides the binary literals in results. |
IConstr[] |
GateTranslator.or(int y,
IVecInt literals)
translate y <=> x1 \/ x2 \/ ... \/ xn into clauses. |
IConstr[] |
GateTranslator.xor(int y,
IVecInt literals)
translate y <=> x1 xor x2 xor ... xor xn into clauses. |
| Method parameters in org.sat4j.tools with type arguments of type IVecInt | |
|---|---|
void |
AbstractOutputSolver.addAllClauses(IVec<IVecInt> clauses)
|
void |
ManyCore.addAllClauses(IVec<IVecInt> clauses)
|
void |
SolverDecorator.addAllClauses(IVec<IVecInt> clauses)
|
| Uses of IVecInt in org.sat4j.tools.encoding |
|---|
| Methods in org.sat4j.tools.encoding with parameters of type IVecInt | |
|---|---|
IConstr |
EncodingStrategyAdapter.addAtLeast(ISolver solver,
IVecInt literals,
int degree)
|
IConstr |
EncodingStrategyAdapter.addAtLeastOne(ISolver solver,
IVecInt literals)
|
IConstr |
Sequential.addAtMost(ISolver solver,
IVecInt literals,
int k)
This encoding adds (n-1)*k variables (n is the number of variables in the at most constraint and k is the degree of the constraint) and 2nk+n-3k-1 clauses. |
IConstr |
Policy.addAtMost(ISolver solver,
IVecInt literals,
int k)
|
IConstr |
EncodingStrategyAdapter.addAtMost(ISolver solver,
IVecInt literals,
int degree)
|
IConstr |
Product.addAtMost(ISolver solver,
IVecInt literals,
int k)
|
IConstr |
Commander.addAtMost(ISolver solver,
IVecInt literals,
int degree)
|
IConstr |
Binary.addAtMost(ISolver solver,
IVecInt literals,
int degree)
|
IConstr |
Binomial.addAtMost(ISolver solver,
IVecInt literals,
int degree)
|
IConstr |
Product.addAtMostNonOpt(ISolver solver,
IVecInt literals,
int k)
|
IConstr |
Ladder.addAtMostOne(ISolver solver,
IVecInt literals)
|
IConstr |
EncodingStrategyAdapter.addAtMostOne(ISolver solver,
IVecInt literals)
|
IConstr |
Product.addAtMostOne(ISolver solver,
IVecInt literals)
|
IConstr |
Commander.addAtMostOne(ISolver solver,
IVecInt literals)
In this encoding, variables are partitioned in groups. |
IConstr |
Binary.addAtMostOne(ISolver solver,
IVecInt literals)
p being the smaller integer greater than log_2(n), this encoding adds p variables and n*p clauses. |
IConstr |
Binomial.addAtMostOne(ISolver solver,
IVecInt literals)
|
IConstr |
Policy.addExactly(ISolver solver,
IVecInt literals,
int n)
|
IConstr |
EncodingStrategyAdapter.addExactly(ISolver solver,
IVecInt literals,
int degree)
|
IConstr |
Ladder.addExactlyOne(ISolver solver,
IVecInt literals)
|
IConstr |
EncodingStrategyAdapter.addExactlyOne(ISolver solver,
IVecInt literals)
|
| Uses of IVecInt in org.sat4j.tools.xplain |
|---|
| Fields in org.sat4j.tools.xplain declared as IVecInt | |
|---|---|
protected IVecInt |
Xplain.assump
|
protected IVecInt |
HighLevelXplain.assump
|
| Methods in org.sat4j.tools.xplain that return IVecInt | |
|---|---|
IVecInt |
QuickXplainStrategy.explain(ISolver solver,
Map<Integer,?> constrs,
IVecInt assumps)
|
IVecInt |
QuickXplain2001Strategy.explain(ISolver solver,
Map<Integer,?> constrs,
IVecInt assumps)
|
IVecInt |
MinimizationStrategy.explain(ISolver solver,
Map<Integer,?> constrs,
IVecInt assumps)
|
IVecInt |
DeletionStrategy.explain(ISolver solver,
Map<Integer,?> constrs,
IVecInt assumps)
|
IVecInt |
InsertionStrategy.explain(ISolver solver,
Map<Integer,?> constrs,
IVecInt assumps)
|
| Methods in org.sat4j.tools.xplain with parameters of type IVecInt | |
|---|---|
IConstr |
Xplain.addAtLeast(IVecInt literals,
int degree)
|
IConstr |
HighLevelXplain.addAtLeast(IVecInt literals,
int degree)
|
IConstr |
Xplain.addAtMost(IVecInt literals,
int degree)
|
IConstr |
HighLevelXplain.addAtMost(IVecInt literals,
int degree)
|
IConstr |
Xplain.addClause(IVecInt literals)
|
IConstr |
HighLevelXplain.addClause(IVecInt literals,
int desc)
|
IConstr |
Xplain.addExactly(IVecInt literals,
int n)
|
protected int |
Xplain.createNewVar(IVecInt literals)
|
protected int |
HighLevelXplain.createNewVar(IVecInt literals)
|
IVecInt |
QuickXplainStrategy.explain(ISolver solver,
Map<Integer,?> constrs,
IVecInt assumps)
|
IVecInt |
QuickXplain2001Strategy.explain(ISolver solver,
Map<Integer,?> constrs,
IVecInt assumps)
|
IVecInt |
MinimizationStrategy.explain(ISolver solver,
Map<Integer,?> constrs,
IVecInt assumps)
|
IVecInt |
DeletionStrategy.explain(ISolver solver,
Map<Integer,?> constrs,
IVecInt assumps)
|
IVecInt |
InsertionStrategy.explain(ISolver solver,
Map<Integer,?> constrs,
IVecInt assumps)
|
int[] |
Xplain.findModel(IVecInt assumps)
|
int[] |
HighLevelXplain.findModel(IVecInt assumps)
|
boolean |
Xplain.isSatisfiable(IVecInt assumps)
|
boolean |
HighLevelXplain.isSatisfiable(IVecInt assumps)
|
boolean |
Xplain.isSatisfiable(IVecInt assumps,
boolean global)
|
boolean |
HighLevelXplain.isSatisfiable(IVecInt assumps,
boolean global)
|
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||