private static int sepsetSize(BitVarSet[] pair) { assert pair.length == 2; return pair[0].intersectionSize(pair[1]); }
public Variable[] toVariableArray() { return (Variable[]) toArray (new Variable[0]); }
public String getLabel() { return toString (); }
public VarSet intersection (VarSet c) { if (c instanceof BitVarSet) { // Efficient implementation BitVarSet bsc = (BitVarSet) c; BitSet newBitSet = (BitSet) bitset.clone(); newBitSet.and (bsc.bitset); return new BitVarSet (universe, newBitSet); } else { return Utils.defaultIntersection (this, c); } }
public void testEqualsHashCode () { Variable[] vars = new Variable [4]; for (int i = 0; i < vars.length; i++) { vars[i] = new Variable(3); } Universe uni = vars[0].getUniverse (); BitVarSet c1 = new BitVarSet (uni, Arrays.asList (vars)); BitVarSet c2 = new BitVarSet (uni, Arrays.asList (vars)); assertTrue(c1.equals (c2)); assertTrue(c2.equals (c1)); assertEquals (c1.hashCode(), c2.hashCode ()); }
public void testAddAllOrdering2 () { for (int rep = 0; rep < 1000; rep++) { Variable[] vars = new Variable[] { new Variable(2), new Variable (2) }; Universe uni = vars[0].getUniverse (); BitVarSet vs = new BitVarSet (uni, new ArrayList ()); vs.addAll (Arrays.asList (vars)); checkOrdering (vs, vars); } }
public boolean containsAll(Collection c) { if (c instanceof BitVarSet) { return containsAll ((BitVarSet) c); } else { return super.containsAll (c); } }
public VarSet intersection (VarSet c) { if (c instanceof BitVarSet) { // Efficient implementation BitVarSet bsc = (BitVarSet) c; BitSet newBitSet = (BitSet) bitset.clone(); newBitSet.and (bsc.bitset); return new BitVarSet (universe, newBitSet); } else { return Utils.defaultIntersection (this, c); } }
public void testEqualsHashCode () { Variable[] vars = new Variable [4]; for (int i = 0; i < vars.length; i++) { vars[i] = new Variable(3); } Universe uni = vars[0].getUniverse (); BitVarSet c1 = new BitVarSet (uni, Arrays.asList (vars)); BitVarSet c2 = new BitVarSet (uni, Arrays.asList (vars)); assertTrue(c1.equals (c2)); assertTrue(c2.equals (c1)); assertEquals (c1.hashCode(), c2.hashCode ()); }
public void testAddAllOrdering2 () { for (int rep = 0; rep < 1000; rep++) { Variable[] vars = new Variable[] { new Variable(2), new Variable (2) }; Universe uni = vars[0].getUniverse (); BitVarSet vs = new BitVarSet (uni, new ArrayList ()); vs.addAll (Arrays.asList (vars)); checkOrdering (vs, vars); } }
public boolean containsAll(Collection c) { if (c instanceof BitVarSet) { return containsAll ((BitVarSet) c); } else { return super.containsAll (c); } }
public VarSet intersection (VarSet c) { if (c instanceof BitVarSet) { // Efficient implementation BitVarSet bsc = (BitVarSet) c; BitSet newBitSet = (BitSet) bitset.clone(); newBitSet.and (bsc.bitset); return new BitVarSet (universe, newBitSet); } else { return Utils.defaultIntersection (this, c); } }
public boolean containsAll(Collection c) { if (c instanceof BitVarSet) { return containsAll ((BitVarSet) c); } else { return super.containsAll (c); } }
private static int sepsetSize(BitVarSet[] pair) { assert pair.length == 2; return pair[0].intersectionSize(pair[1]); }
public String getLabel() { return toString (); }
public Variable[] toVariableArray() { return (Variable[]) toArray (new Variable[0]); }
public void testAddAllOrdering3 () { for (int rep = 0; rep < 1000; rep++) { Variable[] vars = new Variable[] { new Variable(2), new Variable (2) }; Universe uni = vars[0].getUniverse (); BitVarSet vsOld = new BitVarSet (uni, Arrays.asList (vars)); BitVarSet vs = new BitVarSet (vsOld); checkOrdering (vs, vars); } }
private static int sepsetSize(BitVarSet[] pair) { assert pair.length == 2; return pair[0].intersectionSize(pair[1]); }
public String getLabel() { return toString (); }
public Variable[] toVariableArray() { return (Variable[]) toArray (new Variable[0]); }