Package java.util

Examples of java.util.BitSet.cardinality()

51
52
53
54
55
56
57
58
59
60
      immutableRoaring[i] = makeImmutableRoaring(r);
      offheapRoaring[i] = makeOffheapRoaring(r);
      genericConcise[i] = new WrappedImmutableConciseBitmap(offheapConcise[i]);
      genericRoaring[i] = new WrappedImmutableRoaringBitmap(offheapRoaring[i]);
    }
    unionCount = expectedUnion.cardinality();
    minIntersection = knownTrue.length;
    printSizeStats(DENSITY, "Uniform Bitmap");
  }
}
View Full Code Here
55
56
57
58
59
60
61
62
63
      immutableRoaring[i] = makeImmutableRoaring(r);
      offheapRoaring[i] = makeOffheapRoaring(r);
      genericConcise[i] = new WrappedImmutableConciseBitmap(offheapConcise[i]);
      genericRoaring[i] = new WrappedImmutableRoaringBitmap(offheapRoaring[i]);
    }
    unionCount = expectedUnion.cardinality();
    printSizeStats(DENSITY, "Random Alternating Bitmap");
  }
}
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
  private BitSet valInMIS;

  public void filter(IntVar[] vars, UndirectedGraph graph, F heur, Propagator aCause) throws ContradictionException{
    int n = vars.length-1;
    BitSet mis = heur.getMIS();
    if(mis.cardinality()==vars[n].getUB()){
      if(valInMIS == null) valInMIS = new BitSet();
      valInMIS.clear();
      for (int i = mis.nextSetBit(0); i >= 0; i = mis.nextSetBit(i + 1)) {
        int ub = vars[i].getUB();
        for (int k = vars[i].getLB(); k <= ub; k = vars[i].nextValue(k)) {
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
  //***********************************************************************************

  public void filter(IntVar[] vars, UndirectedGraph graph, F heur, Propagator aCause) throws ContradictionException{
    assert  n == vars.length-1;
    BitSet mis = heur.getMIS();
    if(mis.cardinality()==vars[n].getUB()){
      ISet nei;
      for (int i = mis.nextClearBit(0); i>=0 && i < n; i = mis.nextClearBit(i + 1)) {
        int mate = -1;
        int last = 0;
        if(valToRem.length<vars[i].getDomainSize()){
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
  private AlgoAllDiffBC filter;

  public void filter(IntVar[] vars, UndirectedGraph graph, F heur, Propagator aCause) throws ContradictionException{
    int n = vars.length-1;
    BitSet mis = heur.getMIS();
    if(mis.cardinality()==vars[n].getUB()){
      IntVar[] vs = new IntVar[mis.cardinality()];
      int idx = 0;
      for(int x=mis.nextSetBit(0);x>=0;x=mis.nextSetBit(x+1)){
        vs[idx++] = vars[x];
      }
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
  public void filter(IntVar[] vars, UndirectedGraph graph, F heur, Propagator aCause) throws ContradictionException{
    int n = vars.length-1;
    BitSet mis = heur.getMIS();
    if(mis.cardinality()==vars[n].getUB()){
      IntVar[] vs = new IntVar[mis.cardinality()];
      int idx = 0;
      for(int x=mis.nextSetBit(0);x>=0;x=mis.nextSetBit(x+1)){
        vs[idx++] = vars[x];
      }
      if(filter==null)filter=new AlgoAllDiffBC(aCause);
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
          values.set(v.getValue());
        }
        if(!N.isInstantiated()){
          throw new UnsupportedOperationException();
        }
        if(values.cardinality()<N.getValue()){
          throw new UnsupportedOperationException();
        }
      }
    });
    solver.findAllSolutions();
View Full Code Here
93
94
95
96
97
98
99
100
101
102
103
          values.set(v.getValue());
        }
        if(!N.isInstantiated()){
          throw new UnsupportedOperationException();
        }
        if(values.cardinality()>N.getValue()){
          throw new UnsupportedOperationException();
        }
      }
    });
    solver.findAllSolutions();
View Full Code Here
120
121
122
123
124
125
126
127
128
129
130
            encoder.encode( "X" + j, Arrays.asList( "A" ) );
        }

        assertEquals( N, encoder.size() );
        BitSet code = encoder.getCode( "X" + ( N -1 ) );
        assertEquals( 1, code.cardinality() );
        assertTrue( code.get( N - 2 ) );
    }


View Full Code Here
121
122
123
124
125
126
127
128
129
130
131
            encoder.encode( "X" + j, Arrays.asList( "A" ) );
        }

        assertEquals( N, encoder.size() );
        BitSet code = encoder.getCode( "X" + ( N -1 ) );
        assertEquals( 1, code.cardinality() );
        assertTrue( code.get( N - 2 ) );
    }


View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.