- Add the Codota plugin to your IDE and get smart completions
private void myMethod () {SimpleDateFormat s =
String pattern;new SimpleDateFormat(pattern)
- Smart code suggestions by Codota
}
/** * Tests if this stack is empty. * * @return <code>true</code> if and only if this stack contains no items; <code>false</code> * otherwise. */ public final boolean empty() { return size() == 0; }
/** * Tests if this stack is empty. * * @return <code>true</code> if and only if this stack contains no items; <code>false</code> * otherwise. */ public final boolean empty() { return size() == 0; }
/** * @return Number of page versions stored in this page map */ public final int getVersions() { return accessStack.size(); }
/** * @see IPageVersionManager#getVersions() */ public int getVersions() { return changeListStack.size(); }
/** * @see IPageVersionManager#getVersions() */ public int getVersions() { return changeListStack.size(); }
/** * @return Number of page versions stored in this page map */ public final int getVersions() { return accessStack.size(); }
/** * Tests if this stack is empty. * * @return <code>true</code> if and only if this stack contains no items; <code>false</code> * otherwise. */ public final boolean empty() { return size() == 0; }
/** * 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); }
/** * 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 T peek() { int size = size(); if (size == 0) { throw new EmptyStackException(); } return get(size - 1); }
/** * 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 T 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; } }
/** * 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; } }
/** * 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 Object o) { int i = lastIndexOf(o); if (i >= 0) { return size() - i; } return -1; } }
/** * Removes the object at the top of this stack and returns that object. * * @return The object at the top of this stack * @exception EmptyStackException * If this stack is empty. */ public final T pop() { final T top = peek(); remove(size() - 1); return top; }
/** * Removes the object at the top of this stack and returns that object. * * @return The object at the top of this stack * @exception EmptyStackException * If this stack is empty. */ public final T pop() { final T top = peek(); remove(size() - 1); return top; }
/** * Removes the object at the top of this stack and returns that object. * * @return The object at the top of this stack * @exception EmptyStackException * If this stack is empty. */ public final Object pop() { final Object top = peek(); remove(size() - 1); return top; }
if (changeListStack.size() > 0)
if (changeListStack.size() > 0)
/** * @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(); }
/** * @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(); }