Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
package com.exigen.ie.constrainer;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Vector;
import com.exigen.ie.constrainer.impl.IntExpAddArray1;
import com.exigen.ie.constrainer.impl.IntExpArrayElement1;
import com.exigen.ie.constrainer.impl.IntExpCardIntExp;
import com.exigen.ie.tools.FastVector;
/**
* An implementation of the array of the conatraint integer expressions.
*/
public final class IntExpArray extends ConstrainerObjectImpl
{
private IntExp[] _data;
private IntArrayCards _cards = null;
/**
* Returns an array of cardinalities for the expressions.
* If such an array doesn't exist it will be created using
* invokation IntArrayCards(this.constrainer(),this)
*
* @see IntArrayCards
*/
public IntArrayCards cards() throws Failure
{
if (_cards == null)
_cards = new IntArrayCards(_constrainer, this);
return _cards;
}
/**
* Sorts the internal array of the expressions using given comparator.
*/
public void sort(Comparator c)
{
Arrays.sort(_data, c);
}
/**
* Sorts the internal array of the expressions by number of dependents.
*/
public void sortByDependents() // not optimized
{
sort(
new Comparator()
{
public int compare(Object o1, Object o2)
{
return ((Subject) o2).allDependents().size() - ((Subject) o1).allDependents().size();
}
}
);
}
/**
* Returns the internal array of the expressions.
*/
public IntExp[] data()
{
return _data;
}
/**
* Creates an array of "size" constrained integer variables defined from "min" to "max".
*
* @param size size of the new array
* @param min minimal value of each constrained variable
* @param max maximal value of each constrained variable
*/
public IntExpArray(Constrainer c, int size, int min, int max, String array_name)
{
this(c, size);
name(array_name);
for(int i = 0; i < _data.length; ++i)
_data[i] = c.addIntVar(min,max,array_name+"("+i+")");
}
/**
* Constructor from the Vector.
*/
public IntExpArray(Constrainer c, Vector v)
{
this(c, v.size());
for(int i = 0; i < _data.length; ++i)
_data[i] = (IntExp) v.elementAt(i);
}
/**
* Constructor from the FastVector.
*/
public IntExpArray(Constrainer c, FastVector v)
{
this(c, v.size());
for(int i = 0; i < _data.length; ++i)
_data[i] = (IntExp) v.elementAt(i);
}
/**
* Constructor for "size" unitialized expressions.
* Call set() to initialize all the expressions in this array.
*/
public IntExpArray(Constrainer c, int size)
{
super(c);
_data = new IntExp[size];
}
/**
* Convenience constructor from one expression.
*/
public IntExpArray(Constrainer c, IntExp e0)
{
this(c, 1);
_data[0] = e0;
}
/**
* Convenience constructor from 2 expressions.
*/
public IntExpArray(Constrainer c, IntExp e0, IntExp e1)
{
this(c, 2);
_data[0] = e0;
_data[1] = e1;
}
/**
* Convenience constructor from 3 expressions.
*/
public IntExpArray(Constrainer c, IntExp e0, IntExp e1, IntExp e2)
{
this(c, 3);
_data[0] = e0;
_data[1] = e1;
_data[2] = e2;
}
/**
* Convenience constructor from 4 expressions.
*/
public IntExpArray(Constrainer c, IntExp e0, IntExp e1, IntExp e2, IntExp e3)
{
this(c, 4);
_data[0] = e0;
_data[1] = e1;
_data[2] = e2;
_data[3] = e3;
}
/**
* Convenience constructor from 5 expressions.
*/
public IntExpArray(Constrainer c, IntExp e0, IntExp e1, IntExp e2, IntExp e3, IntExp e4)
{
this(c, 5);
_data[0] = e0;
_data[1] = e1;
_data[2] = e2;
_data[3] = e3;
_data[4] = e4;
}
/**
* Convenience constructor from 6 expressions.
*/
public IntExpArray(Constrainer c, IntExp e0, IntExp e1, IntExp e2,
IntExp e3, IntExp e4, IntExp e5)
{
this(c, 6);
_data[0] = e0;
_data[1] = e1;
_data[2] = e2;
_data[3] = e3;
_data[4] = e4;
_data[5] = e5;
}
/**
* Convenience constructor from 7 expressions.
*/
public IntExpArray(Constrainer c, IntExp e0, IntExp e1, IntExp e2,
IntExp e3, IntExp e4, IntExp e5,
IntExp e6)
{
this(c, 7);
_data[0] = e0;
_data[1] = e1;
_data[2] = e2;
_data[3] = e3;
_data[4] = e4;
_data[5] = e5;
_data[6] = e6;
}
/**
* Convenience constructor from 8 expressions.
*/
public IntExpArray(Constrainer c, IntExp e0, IntExp e1, IntExp e2,
IntExp e3, IntExp e4, IntExp e5,
IntExp e6, IntExp e7)
{
this(c, 8);
_data[0] = e0;
_data[1] = e1;
_data[2] = e2;
_data[3] = e3;
_data[4] = e4;
_data[5] = e5;
_data[6] = e6;
_data[7] = e7;
}
/**
* Convenience constructor from 9 expressions.
*/
public IntExpArray(Constrainer c, IntExp e0, IntExp e1, IntExp e2,
IntExp e3, IntExp e4, IntExp e5,
IntExp e6, IntExp e7, IntExp e8)
{
this(c, 9);
_data[0] = e0;
_data[1] = e1;
_data[2] = e2;
_data[3] = e3;
_data[4] = e4;
_data[5] = e5;
_data[6] = e6;
_data[7] = e7;
_data[8] = e8;
}
/**
* Returns the number of elements in this array.
*/
public int size()
{
return _data.length;
}
/**
* Returns the cardinality of the cartesian product of the expression domains.
*/
public long domainsProductCard()
{
int size = size();
if(size==0) return 0;
long total = _data[0].size();
for(int i=1; i < size; ++i)
{
total *= _data[i].size();
}
return total;
}
/**
* Returns the minimal value for all expressions in this array.
*/
public int min()
{
int min = Integer.MAX_VALUE;
for(int i = 0; i < _data.length; ++i)
{
int mini = _data[i].min();
if (mini < min)
min = mini;
}
return min;
}
/**
* Returns the maximal value for all expressions in this array.
*/
public int max()
{
int max = Integer.MIN_VALUE;
for(int i = 0; i < _data.length; ++i)
{
int maxi = _data[i].max();
if (maxi > max)
max = maxi;
}
return max;
}
/**
* Sets up the i-th element of this array.
*/
public void set(IntExp exp, int idx)
{
_data[idx] = exp;
}
/**
* Returns the i-th element of this array.
*/
public IntExp get(int idx)
{
return _data[idx];
}
/**
* Returns the i-th element of this array.
*/
public IntExp elementAt(int idx)
{
return _data[idx];
}
/**
* Returns an expression for the sum of all expressions in this array.
*/
public IntExp sum()
{
switch(size())
{
case 0:
// return new IntExpConst(constrainer(),0);
return (IntExp)_constrainer.expressionFactory().getExpression(
IntExpConst.class,
new Object[]{_constrainer, new Integer(0)} );
case 1:
return _data[0];
case 2:
return _data[0].add(_data[1]);
default:
// return new IntExpAddArray(_constrainer, this);
return (IntExp)_constrainer.expressionFactory().getExpression(
// IntExpAddArray.class,
IntExpAddArray1.class,
new Object[]{_constrainer, this} );
}
}
/**
* Returns a String representation of this array.
* @return a String representation of this array.
*/
public String toString()
{
StringBuffer buf = new StringBuffer();
buf.append("[");
for(int i= 0; i < _data.length; ++i)
{
if (i > 0)
buf.append(" ");
buf.append(_data[i]);
}
buf.append("]");
return buf.toString();
}
public void name(String name)
{
symbolicName(name);
}
/*
extending to 5.1.0
added by S. Vanskov
*/
/**
* The function returns subarray of the array consisting
* of the given array elements which indeses more or
* equal to min_index and more or equal to
* max_index
*
* @param min_index index lower bound
* @param max_index index upper bound
*
* @return subarray of array from min_index to
* max_index
*/
public IntExpArray subarray (int min_index, int max_index) {
if (min_index > max_index) {
return new IntExpArray (constrainer (), 0);
}
Vector sub_data = new Vector (max_index - min_index + 1);
for (int i = min_index; i <= max_index; i++) {
sub_data.addElement (_data [i]);
}
return new IntExpArray (constrainer (), sub_data);
}
/**
* The function returns subarray of the array according to
* the mask array.
*
* @param mask is the mask array
*
* @return the subarray according the mask array
*/
public IntExpArray subarrayByMask (boolean [] mask) {
int size = Math.min (_data.length, mask.length);
Vector sub_data = new Vector ();
for (int i = 0; i < size; i++) {
if (mask [i]) {
sub_data.addElement (_data [i]);
}
}
return new IntExpArray (constrainer (), sub_data);
}
/**
* The function merges this array and the array provided as
* parameter and returns the resulted array.
*
* @param array the array to be merged
*
* @return the merged array
*/
public IntExpArray merge (IntExpArray array) {
int i;
Vector new_data = new Vector (this._data.length + array._data.length);
for (i = 0; i < _data.length; i++) {
new_data.addElement (_data [i]);
}
for (i = 0; i < array._data.length; i++) {
new_data.addElement (array._data [i]);
}
return new IntExpArray (constrainer (), new_data);
}
/**
* The function provides the scalar production of this array by the
* array provided as the parameter and returns the resulted expression.
*
* @param array the array to be multiplied
* NOTE: the arrays should be of the same size.
*
* @return scalar product expression
*/
public IntExp mul (IntArray array) {
if (this.size () != array.size ()) {
throw new RuntimeException("IntExpArray.mul(IntArray) arrays have different sizes");
}
int [] factors = array.data ();
switch (size ()) {
case 0:
return (IntExp) _constrainer.expressionFactory().getExpression(
IntExpConst.class,
new Object[]{_constrainer, new Integer(0)}
);
case 1:
return _data[0].mul (factors [0]);
default:
{
IntExpArray products = new IntExpArray(constrainer (), this.size ());
for(int i = 0; i < this.size (); i ++) {
products.set (_data [i].mul ( factors [i]), i);
}
return products.sum ();
}
}
}
/**
* The function provides the scalar production of this array by the
* array provided as the parameter and returns the resulted expression.
*
* @param array the array to be multiplied
* NOTE: the arrays should be of the same size.
*
* @return scalar product expression
*/
public IntExp mul (IntExpArray array) {
if (this.size () != array.size ()) {
throw new RuntimeException("IntExpArray.mul(IntExpArray) arrays have different sizes");
}
switch (size ()) {
case 0:
return (IntExp) _constrainer.expressionFactory().getExpression(
IntExpConst.class,
new Object[]{_constrainer, new Integer(0)}
);
case 1:
return _data[0].mul (array._data [0]);
default:
{
IntExpArray products = new IntExpArray(constrainer (), this.size ());
for(int i = 0; i < this.size (); i ++) {
products.set (_data [i].mul (array._data [i]), i);
}
return products.sum ();
}
}
}
/**
* Returns the expression that corresponds to the cardinality of
* value specified by the parameter expressions.
*
* @param exp expressions that specifies the value that cardinality
* is required.
* NOTE: The expression is not required to be bound.
*
* @return The expression that corresponds the cardinality of exp
*/
public IntExp cardinality (IntExp exp) throws Failure {
return new IntExpCardIntExp (this, exp);
}
/**
* Returns the expression that corresponds to the array item
* where indes is specified by the parameter expressions.
*
* @param exp expressions that specifies array element index.
* NOTE: The expression is not required to be bound.
*
* @return this[exp]
*/
public IntExp elementAt (IntExp exp) throws Failure {
return new IntExpArrayElement1 (this, exp);
}
/* EO additions */
} // ~IntExpArray
