/*
 * $Id$
 */

package edu.jas.ps;


import java.util.Iterator;
import java.util.NoSuchElementException;
import java.util.List;
import java.util.ArrayList;


import edu.jas.poly.ExpVector;
import edu.jas.util.CartesianProductLong;
import edu.jas.util.LongIterable;


/**
 * Iterable for ExpVector, using total degree enumeration.
 * @author Heinz Kredel
 */
public class ExpVectorIterable implements Iterable {


    protected long upperBound;


    final boolean infinite;


    final int nvar;


    /**
     * Constructor.
     * @param nv number of variables.
     */
    public ExpVectorIterable(int nv) {
        this(nv,true,Long.MAX_VALUE);
    }


    /**
     * Constructor.
     * @param nv number of variables.
     * @param ub upper bound for the components.
     */
    public ExpVectorIterable(int nv, long ub) {
        this(nv,false,ub);
    }


    /**
     * Constructor.
     * @param nv number of variables.
     * @param all true, if all elements between 0 and upper bound are enumerated, 
                  false, if only elements of exact upper bund are to be processed.
     * @param ub upper bound for the components.
     */
    public ExpVectorIterable(int nv, boolean all, long ub) {
        upperBound = ub;
        infinite = all;
        nvar = nv;
    }


    /** Set the upper bound for the iterator.
     * @param ub an upper bound for the iterator elements. 
     */
    public void setUpperBound(long ub) {
        upperBound = ub;
    }


    /** Get the upper bound for the iterator.
     * @return the upper bound for the iterator elements. 
     */
    public long getUpperBound() {
        return upperBound;
    }


    /**
     * Get an iterator over ExpVector.
     * @return an iterator.
     */
    public Iterator iterator() {
        return new ExpVectorIterator(nvar,infinite,upperBound);
    }

}


/**
 * ExpVector iterator using CartesianProductLongIterator.
 * @author Heinz Kredel
 */
class ExpVectorIterator implements Iterator {


    /**
     * data structure.
     */
    ExpVector current;


    Iterator> liter;


    protected int totalDegree;


    protected boolean empty;


    final long upperBound;


    final boolean infinite;


    final int nvar;


    /**
     * ExpVector iterator constructor.
     * @param nv number of variables.
     */
    public ExpVectorIterator(int nv) {
        this(nv,true,Long.MAX_VALUE);
    }


    /**
     * ExpVector iterator constructor.
     * @param nv number of variables.
     * @param ub upper bound for the components.
     */
    public ExpVectorIterator(int nv,long ub) {
        this(nv,false,ub);
    }


    /**
     * ExpVector iterator constructor.
     * @param nv number of variables.
     * @param inf true, if all elements between 0 and upper bound are enumerated, 
                  false, if only elements of exact upper bund are to be processed.
     * @param ub an upper bound for the entrys.
     */
    protected ExpVectorIterator(int nv, boolean inf, long ub) {
        infinite = inf; 
        upperBound = ub;
        if (upperBound < 0L) {
            throw new IllegalArgumentException("negative upper bound not allowed");
        }
        totalDegree = 0;
        if ( !infinite ) {
            totalDegree = (int)upperBound;
        }
        //System.out.println("totalDegree = " + totalDegree + ", upperBound = " + upperBound);
        LongIterable li = new LongIterable();
        li.setNonNegativeIterator();
        li.setUpperBound(totalDegree);
        List tlist = new ArrayList(nv);
        for (int i = 0; i < nv; i++) {
            tlist.add(li); // can reuse li
        }
        Iterable> ib = new CartesianProductLong(tlist,totalDegree);
        liter = ib.iterator();
        empty = (totalDegree > upperBound) || !liter.hasNext();
        current = ExpVector.create(nv);
        if ( !empty ) {
            List el = liter.next();
            current = ExpVector.create(el);
            //System.out.println("current = " + current);
        }
        nvar = nv;
    }


    /**
     * Test for availability of a next long.
     * @return true if the iteration has more ExpVectors, else false.
     */
    public synchronized boolean hasNext() {
        return !empty;
    }


    /**
     * Get next ExpVector.
     * @return next ExpVector.
     */
    public synchronized ExpVector next() {
        ExpVector res = current;
        if ( liter.hasNext() ) {
            List el = liter.next();
            current = ExpVector.create(el);
            //System.out.println("current, liter = " + current);
            return res;
        } 
        if ( totalDegree >= upperBound ) {
            empty = true;
            return res;
        }
        totalDegree++;
        //System.out.println("totalDegree,b = " + totalDegree);
        if ( totalDegree >= upperBound && !infinite ) {
            throw new NoSuchElementException("invalid call of next()");
        }
        LongIterable li = new LongIterable();
        li.setNonNegativeIterator();
        li.setUpperBound(totalDegree);
        List tlist = new ArrayList(nvar);
        for (int i = 0; i < nvar; i++) {
            tlist.add(li); // can reuse li
        }
        Iterable> ib = new CartesianProductLong(tlist,totalDegree);
        liter = ib.iterator();
        List el = liter.next();
        current = ExpVector.create(el);
        return res;
    }


    /**
     * Remove a tuple if allowed.
     */
    public void remove() {
        throw new UnsupportedOperationException("cannnot remove elements");
    }

}