Package memory

Examples of memory.IEnvironment

172
173
174
175
176
177
178
179
180
181
182
183
        final int[] removed = new int[list.length - end];
        System.arraycopy(list, end, removed, 0, list.length - end);

        this.list = newList;
        this.position = newPosition;
        final IEnvironment env = last.getEnvironment();
        this.last = null;
        this.last = env.makeInt(list.length - 1);
        for (int i = 0; i < removed.length; i++) {
            remove(removed[i]);
        }
    }
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
85
        this.offset = offset;
        this.length = length;
        origin = new IStateInt[n];
        end = new IStateInt[n];
        size = new IStateInt[n];
        IEnvironment environment = solver.getEnvironment();
        for (int i = 0; i < n; i++) {
            origin[i] = environment.makeInt(i);
            end[i] = environment.makeInt(i);
            size[i] = environment.makeInt(1);
        }
    }
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
        nb_vars = variables.length - 1;
        this.idms = new IIntDeltaMonitor[vars.length];
        for (int i = 0; i < vars.length; i++) {
            idms[i] = vars[i].hasEnumeratedDomain() ? vars[i].monitorDelta(this) : IIntDeltaMonitor.Default.NONE;
        }
        IEnvironment environment = solver.getEnvironment();
        both = environment.makeBitSet(nb_vars);
        LB = environment.makeInt(0);
        UB = environment.makeInt(0);
        this.setValues = new TIntHashSet(values);
        this.values = setValues.toArray();
        Arrays.sort(this.values);
        this.occs = new IStateInt[nb_vars];
        for (int i = 0; i < nb_vars; i++) {
            occs[i] = environment.makeInt(0);
        }
        rem_proc = new RemProc(this);
    }
View Full Code Here
477
478
479
480
481
482
483
484
485
486
            intLayer[i] = th.toArray();
        }
        intLayer[n + 1] = new int[]{tink.id};

        if (intLayer[0].length > 0) {
      IEnvironment environment = solver.getEnvironment();
            this.graph = new StoredDirectedMultiGraph(environment, graph, intLayer, starts, offsets, totalSizes, pi, z);
            this.graph.makePathFinder();
        }
    }
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
90
91
        super(variables, PropagatorPriority.UNARY, true);
        n = vars.length;
        origin = new IStateInt[n];
        end = new IStateInt[n];
        size = new IStateInt[n];
        IEnvironment environment = solver.getEnvironment();
        for (int i = 0; i < n; i++) {
            origin[i] = environment.makeInt(i);
            end[i] = environment.makeInt(i);
            size[i] = environment.makeInt(1);
        }
        this.offset = offset;
    }
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
92
93
    public PropIntMemberSet(SetVar setVar, IntVar intVar) {
        super(new Variable[]{setVar, intVar}, PropagatorPriority.BINARY, true);
    this.set = (SetVar) vars[0];
        this.iv = (IntVar) vars[1];
        this.sdm = set.monitorDelta(this);
        IEnvironment environment = solver.getEnvironment();
        watchLit1 = environment.makeInt(iv.getLB() - 1);
        watchLit2 = environment.makeInt(iv.getLB() - 1);
        elemRem = new IntProcedure() {
            @Override
            public void execute(int i) throws ContradictionException {
                iv.removeValue(i, aCause);
            }
View Full Code Here
74
75
76
77
78
79
80
81
82
83
    //////////////////////////////////////////////////////////////////////////////////////

    public IntervalIntVarImpl(String name, int min, int max, Solver solver) {
        super(name, solver);
        IEnvironment env = solver.getEnvironment();
        this.LB = env.makeInt(min);
        this.UB = env.makeInt(max);
        this.SIZE = env.makeInt(max - min + 1);
    }
View Full Code Here
74
75
76
77
78
79
80
81
82
     */
    public PropBoolSumIncremental(BoolVar[] variables, IntVar sum) {
        super(ArrayUtils.append(variables, new IntVar[]{sum}), PropagatorPriority.UNARY, true);
        n = variables.length;
        this.sum = vars[n];
        IEnvironment environment = solver.getEnvironment();
        min = environment.makeInt();
        max = environment.makeInt();
    }
View Full Code Here
65
66
67
68
69
70
71
72
73
74
        this.x = Arrays.copyOfRange(vars, 0, X.length);
        this.y = Arrays.copyOfRange(vars, X.length, vars.length);

        this.strict = strict;
        this.n = X.length;
        IEnvironment environment = solver.getEnvironment();
        alpha = environment.makeInt(0);
        beta = environment.makeInt(0);
        entailed = false;
    }
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
90
     * @param values    input value set
     */
    public PropAmongGAC_GoodImpl(IntVar[] variables, int[] values) {
        super(variables, PropagatorPriority.LINEAR, true);
        nb_vars = variables.length - 1;
        IEnvironment environment = solver.getEnvironment();
        this.setValues = new TIntHashSet(values);
        this.values = setValues.toArray();
        Arrays.sort(this.values);
    poss = SetFactory.makeStoredSet(SetType.BIPARTITESET,nb_vars,solver);
    nbSure = environment.makeInt(0);
    }
View Full Code Here
TOP

Related Classes of memory.IEnvironment

  • choco.explanations.SimpleExplanationTest
  • choco.strategy.StrategyTest
  • memory.structure.IndexedBipartiteSet
  • solver.constraints.binary.PropElement
  • solver.constraints.extension.binary.PropBinAC2001
  • solver.constraints.extension.nary.PropLargeGAC2001
  • solver.constraints.extension.nary.PropLargeGAC2001Positive
  • solver.constraints.nary.among.PropAmongGAC
  • solver.constraints.nary.among.PropAmongGAC_GoodImpl
  • solver.constraints.nary.automata.CostRegular
    • 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.