本文整理汇总了Java中org.sat4j.specs.IVecInt.pop方法的典型用法代码示例。如果您正苦于以下问题：Java IVecInt.pop方法的具体用法？Java IVecInt.pop怎么用？Java IVecInt.pop使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类org.sat4j.specs.IVecInt的用法示例。
在下文中一共展示了IVecInt.pop方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: primeImplicant
import org.sat4j.specs.IVecInt; //导入方法依赖的package包/类
public int[] primeImplicant() {
IVecInt currentD = new VecInt(decisions.size());
decisions.copyTo(currentD);
IVecInt assumptions = new VecInt(implied.size() + decisions.size());
implied.copyTo(assumptions);
decisions.copyTo(assumptions);
IVecInt prime = new VecInt(assumptions.size());
implied.copyTo(prime);
for (int i = 0; i < currentD.size(); i++) {
int p = currentD.get(i);
assumptions.remove(p);
assumptions.push(-p);
try {
if (isSatisfiable(assumptions)) {
assumptions.pop();
assumptions.push(-p);
} else {
prime.push(p);
assumptions.pop();
assumptions.push(p);
}
} catch (TimeoutException e) {
throw new IllegalStateException("Should not timeout here", e);
}
}
int[] implicant = new int[prime.size()];
prime.copyTo(implicant);
return implicant;
}
示例2: MaxWatchCard
import org.sat4j.specs.IVecInt; //导入方法依赖的package包/类
/**
* Constructeur de base cr?ant des contraintes vides
*
* @param size
* nombre de litt?raux de la contrainte
* @param learnt
* indique si la contrainte est apprise
*/
private MaxWatchCard(ILits voc, IVecInt ps, boolean moreThan, int degree) {
// On met en place les valeurs
this.voc = voc;
this.degree = degree;
this.moreThan = moreThan;
// On simplifie ps
int[] index = new int[voc.nVars() * 2 + 2];
for (int i = 0; i < index.length; i++)
index[i] = 0;
// On repertorie les litt?raux utiles
for (int i = 0; i < ps.size(); i++) {
if (index[ps.get(i) ^ 1] == 0) {
index[ps.get(i)]++;
} else {
index[ps.get(i) ^ 1]--;
}
}
// On supprime les litt?raux inutiles
int ind = 0;
while (ind < ps.size()) {
if (index[ps.get(ind)] > 0) {
index[ps.get(ind)]--;
ind++;
} else {
if ((ps.get(ind) & 1) != 0)
this.degree--;
ps.set(ind, ps.last());
ps.pop();
}
}
// On copie les litt?raux de la contrainte
lits = new int[ps.size()];
ps.moveTo(lits);
// On normalise la contrainte au sens de Barth
normalize();
// Mise en place de l'observation maximale
watchCumul = 0;
// On observe les litt?raux non falsifi?
for (int i = 0; i < lits.length; i++) {
// Rappel: les ?l?ments falsifi?s ne seront jamais d?pil?s
if (!voc.isFalsified(lits[i])) {
watchCumul++;
voc.watch(lits[i] ^ 1, this);
}
}
}