/** * Pushes an item onto the top of this stack. * * @param item * the item to be pushed onto this stack. */ public final void push(final Object item) { add(item); }
/** * Looks at the object at the top of this stack without removing it. * * @return The object at the top of this stack * @exception EmptyStackException * If this stack is empty. */ public final Object peek() { int size = size(); if (size == 0) { throw new EmptyStackException(); } return get(size - 1); }
/** * Returns the 1-based position where an object is on this stack. If the object <tt>o</tt> * occurs as an item in this stack, this method returns the distance from the top of the stack * of the occurrence nearest the top of the stack; the topmost item on the stack is considered * to be at distance <tt>1</tt>. The <tt>equals</tt> method is used to compare <tt>o</tt> to the * items in this stack. * * @param o * the desired object. * @return the 1-based position from the top of the stack where the object is located; the * return value <code>-1</code> indicates that the object is not on the stack. */ public final int search(final T o) { int i = lastIndexOf(o); if (i >= 0) { return size() - i; } return -1; } }
/** * @param entry * Entry that was accessed */ private final void pushAccess(IPageMapEntry entry) { // Create new access entry final Access access = new Access(); access.id = entry.getNumericId(); access.version = versionOf(entry); if (accessStack.size() > 0) { if (peekAccess().equals(access)) { return; } int index = accessStack.indexOf(access); if (index >= 0) { accessStack.remove(index); } } accessStack.push(access); dirty(); }
if (changeListStack.size() > 0) ChangeList previous = (ChangeList)changeListStack.peek(); previous.add(changeList); changeListStack.push(changeList); changeListStack.trimToSize();
autolinkStatus = new ArrayListStack(); autolinkStatus.push(Boolean.valueOf(autolinking)); autolinking = ((Boolean)autolinkStatus.pop()).booleanValue();
/** * @see IPageVersionManager#getVersions() */ public int getVersions() { return changeListStack.size(); }
/** * Save the new open tag state and find the iterator to continue to use for processing. * * @param iteratorStack * The current stack of iterators * @param expectedElements * The current iterator of elements * @param tagNameStack * The stack of open tags * @return The iterator to continue to use */ private Iterator saveOpenTagState(ArrayListStack iteratorStack, Iterator expectedElements, ArrayListStack tagNameStack) { if (!isNonClosedTag(workingTag.getTag())) { iteratorStack.push(expectedElements); expectedElements = workingTag.getExpectedChildren().iterator(); tagNameStack.push(workingTag.getTag()); } return expectedElements; }
/** * @see IPageVersionManager#expireOldestVersion() */ public void expireOldestVersion() { changeListStack.remove(0); }
accessStack = new ArrayListStack<Access>();
/** * @see org.apache.wicket.extensions.wizard.IWizardModel#previous() */ public void previous() { IWizardStep step = history.pop(); setActiveStep(step); }
/** * @return Access entry on top of the access stack */ private final Access peekAccess() { return (Access)accessStack.peek(); }
/** * Checks if the previous button should be enabled. * * @return <tt>true</tt> if the previous button should be enabled, <tt>false</tt> otherwise. */ public boolean isPreviousAvailable() { return !history.isEmpty(); }