Package gnu.trove.map.hash

Examples of gnu.trove.map.hash.TIntIntHashMap$TIntIntValueHashIterator

96
97
98
99
100
101
102
103
104
105
106
        this.idms = new IIntDeltaMonitor[this.vars.length];
        for (int i = 0; i < this.vars.length; i++) {
            idms[i] = this.vars[i].monitorDelta(this);
        }
        n = variables.length;
        map = new TIntIntHashMap();
        IntVar v;
        int ub;
        int idx = n;
        for (int i = 0; i < n; i++) {
            v = vars[i];
View Full Code Here
310
311
312
313
314
315
316
317
            IntVar[] Y = new IntVar[size];
            for (int i = 0; i < size; i++) {
                this.vars[i + n].duplicate(solver, identitymap);
                Y[i] = (IntVar) identitymap.get(this.vars[i + n]);
            }
            identitymap.put(this, new PropFastGCC(X, this.values.clone(), new TIntIntHashMap(this.map), Y));
        }
    }
View Full Code Here
55
56
57
58
59
60
61
62
63
64
        PDF, EPS, SVG
    }

    public MatrixOutput(Solver solver, String name, Output op) {
        this.solver = solver;
        v2idx = new TIntIntHashMap();
        p2idx = new TIntIntHashMap();
        type = op;
        this.name = name;
    }
View Full Code Here
42
43
44
45
46
47
48
49
50
    protected TIntIntHashMap p2w;


    public FailPerPropagator(Constraint[] constraints, Solver solver) {
        p2w = new TIntIntHashMap();
        init(constraints);
        solver.plugMonitor(this);
    }
View Full Code Here
31
32
33
34
35
36
37
public class MId2AbId implements IId2AbId {

    final TIntIntHashMap map;

    public MId2AbId(int size, int noValue) {
        this.map = new TIntIntHashMap(size, 0.5f, noValue, noValue);
    }
View Full Code Here
44
45
46
47
48
49
50
    protected TIntIntHashMap map;

    public Set_Swap_Hash(int n) {
        super(n);
        map = new TIntIntHashMap();
    }
View Full Code Here
154
155
156
157
158
159
160
161
162
163
164
        mA = new double[vars.length];
        sA = new double[vars.length];
        vAct = new IVal[vars.length];
        affected = new BitSet(vars.length);

        this.v2i = new TIntIntHashMap(vars.length);
        for (int i = 0; i < vars.length; i++) {
            v2i.put(vars[i].getId(), i);
            vars[i].addMonitor(this);
        }
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
        super(variables);
        this.variables = variables.clone();
        Solver solver = variables[0].getSolver();
        counter = new FailPerPropagator(solver.getCstrs(), solver);
        pid2ari = new TIntObjectHashMap<>();
        pid2arity = new TIntIntHashMap(10, 0.5F, -1, -1);
        bests = new TIntArrayList();
        this.valueSelector = valueSelector;
        decisionPool = new PoolManager<>();
        random = new java.util.Random(seed);
    }
View Full Code Here
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
            raw_map.put( keys[i], vals[i] );
        }
        Map<Integer,Long> map = TDecorators.wrap( raw_map );
        assertEquals( map, map );

        TIntIntMap raw_int_map = new TIntIntHashMap();
        for ( int i = 0; i < keys.length; i++ ) {
            raw_int_map.put( keys[i], (int) vals[i] );
        }
        Map<Integer,Integer> int_map = TDecorators.wrap( raw_int_map );
        assertFalse( map.equals( int_map ) );

        // Change a value..
View Full Code Here
134
135
136
137
138
139
140
141
142
143
144
            int_java_map.put( i, i );
          }
        }
        break;
      case "testInt_TPrimitiveHashMap":
        int_t_primitive_map = new TIntIntHashMap( Constants.INTS.length );
        if ( fill_maps ) {
          for( int i : Constants.INTS ) {
            int_t_primitive_map.put( i, i );
          }
        }
View Full Code Here
TOP

Related Classes of gnu.trove.map.hash.TIntIntHashMap$TIntIntValueHashIterator

  • com.carrotsearch.hppc.BigramCountingBase
  • com.carrotsearch.hppc.caliper.TroveMap
  • com.guokr.simbase.store.DenseVectorSet
  • com.guokr.simbase.store.SparseVectorSet
  • de.jungblut.classification.tree.DecisionTree
  • edu.ucla.sspace.graph.CompactSparseTypedEdgeSet
  • edu.ucla.sspace.graph.Graphs
  • edu.ucla.sspace.graph.isomorphism.AbstractIsomorphismTester
  • edu.ucla.sspace.graph.SparseDirectedTypedEdgeSet
  • edu.ucla.sspace.util.IndexedCounter
    • Copyright © 2018 www.massapicom. 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.