本文整理匯總了Java中jpaul.DataStructs.UnionFind.find方法的典型用法代碼示例。如果您正苦於以下問題：Java UnionFind.find方法的具體用法？Java UnionFind.find怎麽用？Java UnionFind.find使用的例子？那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在類jpaul.DataStructs.UnionFind的用法示例。
在下文中一共展示了UnionFind.find方法的5個代碼示例，這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚，您的評價將有助於係統推薦出更棒的Java代碼示例。
示例1: rewrite
import jpaul.DataStructs.UnionFind; //導入方法依賴的package包/類
public Constraint<V,Info> rewrite(UnionFind<V> uf) {
V vs2 = uf.find(vs);
V vd2 = uf.find(vd);
// remove superfluous constraints
if(vs2.equals(vd2)) return null;
// nothing changed, so why generate a new constraint ?
if(vs.equals(vs2) && vd.equals(vd2)) return this;
return new LtConstraint<V,Info>(vs2, vd2);
}
示例2: rewrite
import jpaul.DataStructs.UnionFind; //導入方法依賴的package包/類
/** We implemented {@link #rewrite}, {@link #equals}, and {@link
#hashCode}, such that constraints that are identical after
variable unification are not duplicated needlessly. */
public Constraint<SVar<T>,Set<T>> rewrite(UnionFind<SVar<T>> uf) {
SVar<T> vIn1_p = uf.find(vIn1);
SVar<T> vIn2_p = uf.find(vIn2);
SVar<T> vDest_p = uf.find(vDest);
return new IntersectConstraint<T>(vIn1_p, vIn2_p, vDest_p);
}
示例3: rewrite
import jpaul.DataStructs.UnionFind; //導入方法依賴的package包/類
/** We implemented {@link #rewrite}, {@link #equals}, and {@link
#hashCode}, such that constraints that are identical after
variable unification are not duplicated needlessly. */
public Constraint<SVar<T>,Set<T>> rewrite(UnionFind<SVar<T>> uf) {
SVar<T> vIn1_p = uf.find(vIn1);
SVar<T> vIn2_p = uf.find(vIn2);
SVar<T> vDest_p = uf.find(vDest);
return new IntersectConstraint(vIn1_p, vIn2_p, vDest_p);
}
示例4: rewrite
import jpaul.DataStructs.UnionFind; //導入方法依賴的package包/類
public Constraint<V,Info> rewrite(UnionFind<V> uf) {
V vd2 = uf.find(vd);
// nothing changed, so why generate a new constraint ?
if(vd.equals(vd2)) return this;
return new CtConstraint<V,Info>(ct, vd2);
}
示例5: rewrite
import jpaul.DataStructs.UnionFind; //導入方法依賴的package包/類
/** We implemented {@link #rewrite}, {@link #equals}, and {@link
#hashCode}, such that constraints that are identical after
variable unification are not duplicated needlessly. */
public Constraint<SVar<T>,Set<T>> rewrite(UnionFind<SVar<T>> uf) {
SVar<T> vIn_p = uf.find(vIn);
SVar<T> vDest_p = uf.find(vDest);
return new CtDiffConstraint<T>(vIn_p, ctSet, vDest_p);
}