L’amico IntSet (implementazione)
private Vector els; // la rep
public IntSet ( ) { els = new Vector( ); }
public void insert (int x) {
Integer y = new Integer(x); if (getIndex(y) < 0) els.add(y); }
public void remove (int x) {
int i = getIndex(new Integer(x));
els.set (i, els.lastElement( ));
els.remove (els.size( ) -1); }
public boolean isIn (int x) {return getIndex (new Integer(x)) >= 0;}
private int getIndex (Integer x)
// EFFECTS: se x occorre in this ritorna la posizione in cui occorre // altrimenti ritorna -1
{for (int i = 0; i < els.size( ); i++)
if (x.equals(els.get(i))) return i;
public int size ( ) { return els.size( ); }