public void push(int v) { add(v); }
@Override public void reset() { p = 0; lastMarker = 0; if (calls != null) { calls.clear(); } }
public void add(int v) { ensureCapacity(p+1); data[++p] = v; }
/** Seek back to previous index saved during last {@link #push} call. * Return top of stack (return index). */ public int pop() { int ret = calls.pop(); seek(ret); return ret; }
/** Seek back to previous index saved during last push() call. * Return top of stack (return index). */ public int pop() { int ret = calls.pop(); seek(ret); return ret; }
@Override public void reset() { p = 0; lastMarker = 0; if (calls != null) { calls.clear(); } }
/** Seek back to previous index saved during last push() call. * Return top of stack (return index). */ public int pop() { int ret = calls.pop(); seek(ret); return ret; }
public void add(int v) { ensureCapacity(p+1); data[++p] = v; }
public void push(int v) { add(v); }
@Override public void reset() { p = 0; lastMarker = 0; if (calls != null) { calls.clear(); } }
/** Seek back to previous index saved during last push() call. * Return top of stack (return index). */ public int pop() { int ret = calls.pop(); seek(ret); return ret; }
public void add(int v) { ensureCapacity(p+1); data[++p] = v; }
public void push(int v) { add(v); }
@Override public void reset() { p = 0; lastMarker = 0; if (calls != null) { calls.clear(); } }
/** Seek back to previous index saved during last {@link #push} call. * Return top of stack (return index). */ public int pop() { int ret = calls.pop(); seek(ret); return ret; }