本文整理汇总了Java中com.carrotsearch.hppc.IntOpenHashSet.remove方法的典型用法代码示例。如果您正苦于以下问题：Java IntOpenHashSet.remove方法的具体用法？Java IntOpenHashSet.remove怎么用？Java IntOpenHashSet.remove使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类com.carrotsearch.hppc.IntOpenHashSet的用法示例。
在下文中一共展示了IntOpenHashSet.remove方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: find
import com.carrotsearch.hppc.IntOpenHashSet; //导入方法依赖的package包/类
private void find(BronPartial candidate, IntOpenHashSet toCheck, IntOpenHashSet toExclude) {
if (toCheck.isEmpty() && toExclude.isEmpty()) {
if (candidate.getWeight() > best.getWeight()) {
best = candidate;
}
return;
}
IntOpenHashSet newToCheck = SetUtils.copy(toCheck);
for (IntCursor cursor : toCheck) {
int v = cursor.value;
BronPartial maybePartial = candidate.tryWith(v, graph);
if (maybePartial == null) continue;
IntOpenHashSet recurseToCheck = graph.intersectionWithNeighbors(newToCheck, v);
IntOpenHashSet recurseToExclude = graph.intersectionWithNeighbors(toExclude, v);
find(maybePartial, recurseToCheck, recurseToExclude);
newToCheck.remove(v);
toExclude.add(v);
}
}
示例2: copyAndRemove
import com.carrotsearch.hppc.IntOpenHashSet; //导入方法依赖的package包/类
public static IntOpenHashSet copyAndRemove(IntOpenHashSet set, int vToRemove) {
IntOpenHashSet copy = set.clone();
copy.remove(vToRemove);
return copy;
}