Package com.exigen.ie.constrainer

Examples of com.exigen.ie.constrainer.IntExp.min()

203
204
205
206
207
208
209
210
211
212
213
    IntExp[] vars = _vars.data();

    for(int i=0; i < vars.length; i++)
    {
      IntExp vari = vars[i];
      int maxi = max - (min_sum - vari.min());
      if (maxi < vari.max())
      {
        vari.setMax(maxi);
      }
    }
View Full Code Here
232
233
234
235
236
237
238
239
240
241
242
    for(int i=0; i < vars.length; i++)
    {
      IntExp vari = vars[i];
      int mini = min - (max_sum - vari.max());
      if (mini > vari.min())
      {
        vari.setMin(mini);
      }
    }
//    System.out.println("---- set min:" + min + " in " + this);
View Full Code Here
257
258
259
260
261
262
263
264
265
266
267
    IntExp[] vars = _vars.data();

    for(int i=0; i < vars.length; i++)
    {
      IntExp vari = (IntExp)vars[i];
      int mini = vari.min();
      int maxi = vari.max();

      int new_min = value - (sum_max - maxi);
      if (new_min > mini)
      {
View Full Code Here
315
316
317
318
319
320
321
322
323
324
325
    IntExp[] vars = _vars.data();

    for(int i=0; i < vars.length; i++)
    {
      IntExp vari = vars[i];
      int mini = vari.min();
      int maxi = vari.max();

      int new_min = minC - (maxE - maxi);
      if (new_min > mini)
      {
View Full Code Here
191
192
193
194
195
196
197
198
199
200
201
    IntExp[] vars = _vars.data();

    for(int i=0; i < vars.length; i++)
    {
      IntExp vari = (IntExp)vars[i];
      int maxi = max - (min_sum - vari.min());
      if (maxi < vari.max())
      {
        vari.setMax(maxi);
      }
    }
View Full Code Here
218
219
220
221
222
223
224
225
226
227
228
    for(int i=0; i < vars.length; i++)
    {
      IntExp vari = (IntExp)vars[i];
      int mini = min - (max_sum - vari.max());
      if (mini > vari.min())
      {
        vari.setMin(mini);
      }
    }
//    System.out.println("---- set min:" + min + " in " + this);
View Full Code Here
253
254
255
256
257
258
259
260
261
262
263
    IntExp[] vars = _vars.data();

    for(int i=0; i < vars.length; i++)
    {
      IntExp vari = (IntExp)vars[i];
      int mini = vari.min();
      int maxi = vari.max();

      int new_min = value - (sum_max - maxi);
      if (new_min > mini)
      {
View Full Code Here
133
134
135
136
137
138
139
140
141
142
143
  void reduceDomains() throws Failure
  {
    for (int I=0; I < _vars.size(); ++I)
    {
      IntExp exp = _vars.elementAt(I);
      for (int i=exp.min(); i <= exp.max(); ++i)
      {
        if(!_domains[I].contains(i))
          exp.removeValue(i);
      }
    }
View Full Code Here
121
122
123
124
125
126
127
128
129
130
131
  /**
   * @return current minimum for the domain of this variable
   */
  public final int getMin() {
    IntExp myVar = (IntExp) getImpl();
    return myVar.min();
  }

  /**
   * Removes a value from the domain of this variable. May throw an exception.
   *
 
View Full Code Here
935
936
937
938
939
940
941
942
943
944
945
  }

  for(int i=1; i < tmp.size(); i++)
  {
    IntExp curElem = tmp.get(i);
    int min = curElem.min();
    int max = curElem.max();
    if (min < values[valCounter-1])
      min = values[valCounter-1]+1;
    for (int j=min;j<max;j++){  //== Changed: j<=max replaced to j<max
        if (curElem.contains(j))
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.