public void reset() { firstTime = true; tree = root; nodes.clear(); }
public void reset() { firstTime = true; tree = root; nodes.clear(); }
public void reset() { firstTime = true; tree = root; nodes.clear(); }
public void reset() { firstTime = true; tree = root; nodes.clear(); }
public void reset() { firstTime = true; tree = root; nodes.clear(); }
public void reset() { firstTime = true; tree = root; nodes.clear(); }
public void reset() { clear(); } public void clear() { p = 0; data.clear(); }
public void reset() { clear(); } public void clear() { p = 0; data.clear(); }
public void reset() { clear(); } public void clear() { p = 0; data.clear(); }
public void reset() { clear(); } public void clear() { p = 0; data.clear(); }
public void reset() { clear(); } public void clear() { p = 0; data.clear(); }
public void reset() { clear(); } public void clear() { p = 0; data.clear(); }
/** Get and remove first element in queue */ public T remove() { T o = elementAt(0); p++; // have we hit end of buffer? if ( p == data.size() ) { // if so, it's an opportunity to start filling at index 0 again clear(); // size goes to 0, but retains memory } return o; }
/** Get and remove first element in queue */ public T remove() { T o = elementAt(0); p++; // have we hit end of buffer? if ( p == data.size() ) { // if so, it's an opportunity to start filling at index 0 again clear(); // size goes to 0, but retains memory } return o; }
/** Get and remove first element in queue */ public T remove() { T o = elementAt(0); p++; // have we hit end of buffer? if ( p == data.size() ) { // if so, it's an opportunity to start filling at index 0 again clear(); // size goes to 0, but retains memory } return o; }
/** Get and remove first element in queue */ public T remove() { T o = elementAt(0); p++; // have we hit end of buffer? if ( p == data.size() ) { // if so, it's an opportunity to start filling at index 0 again clear(); // size goes to 0, but retains memory } return o; }
/** Get and remove first element in queue */ public T remove() { T o = elementAt(0); p++; // have we hit end of buffer? if ( p == data.size() ) { // if so, it's an opportunity to start filling at index 0 again clear(); // size goes to 0, but retains memory } return o; }
/** Get and remove first element in queue */ public T remove() { T o = elementAt(0); p++; // have we hit end of buffer? if ( p == data.size() ) { // if so, it's an opportunity to start filling at index 0 again clear(); // size goes to 0, but retains memory } return o; }