import choco.kernel.solver.Solver;
import choco.kernel.memory.IStateIntVector;
import choco.kernel.memory.trailing.StoredIntVector;

public class ReversibleVector {  

    private IStateIntVector V;
	

    public ReversibleVector(Solver s,int n) { 
	V = s.getEnvironment().makeIntVector();
	for (int i=0;i<n;i++) V.add(i);
    }

    public ReversibleVector(Solver s) { 
	V  = s.getEnvironment().makeIntVector();
    }

    public int size(){return V.size();}
    public void add(int i){V.add(i);}
    public int get(int i){return V.get(i);}

    public void remove(int i){
	int location = 0;
	for (int j=0;j<V.size();j++) if (V.get(j) == i) {location = j; break;}
	V.set(location,V.get(V.size()-1));
	V.removeLast();
    }
    //
    // find the location of element with value i
    // swap the contents with the last element
    // remove the last element
    //
}