public class KTypeStack<KType> extends KTypeArrayList<KType>
KTypeArrayList adding stack-related utility methods. The top of
the stack is at the KTypeArrayList.size() - 1 element.
#if ($TemplateOptions.KTypeGeneric)
A brief comparison of the API against the Java Collections framework:
| java.util.Stack | ObjectStack |
|---|---|
| push | push |
| pop | pop, discard |
| peek | peek |
| removeRange, removeElementAt | removeRange, remove, discard |
| size | size |
| clear | clear, release |
+ other methods from ObjectArrayList |
See ObjectArrayList class for API similarities and differences against Java
Collections.
#end
buffer, DEFAULT_CAPACITY, elementsCount, resizer| Constructor and Description |
|---|
KTypeStack()
Create with default sizing strategy and initial capacity.
|
KTypeStack(int initialCapacity)
Create with default sizing strategy and the given initial capacity.
|
KTypeStack(int initialCapacity,
ArraySizingStrategy resizer)
Create with a custom buffer resizing strategy.
|
KTypeStack(KTypeContainer<KType> container)
Create a stack by pushing all elements of another container to it.
|
| Modifier and Type | Method and Description |
|---|---|
KTypeStack<KType> |
clone()
Clone this object.
|
void |
discard()
Discard the top element from the stack.
|
void |
discard(int count)
Discard an arbitrary number of elements from the top of the stack.
|
static <KType> KTypeStack<KType> |
from(KType... elements)
Create a stack by pushing a variable number of arguments to it.
|
static <KType> KTypeStack<KType> |
from(KTypeContainer<KType> container)
Create a stack by pushing all elements of another container to it.
|
static <KType> KTypeStack<KType> |
newInstance()
Returns a new object of this class with no need to declare generic type (shortcut
instead of using a constructor).
|
static <KType> KTypeStack<KType> |
newInstanceWithCapacity(int initialCapacity)
Returns a new object of this list with no need to declare generic type (shortcut
instead of using a constructor).
|
KType |
peek()
Peek at the top element on the stack.
|
KType |
pop()
Remove the top element from the stack and return it.
|
void |
push(KType... elements)
Vararg-signature method for pushing elements at the top of the stack.
|
void |
push(KType e1)
Adds one KType to the stack.
|
void |
push(KType[] elements,
int start,
int len)
Add a range of array elements to the stack.
|
void |
push(KType e1,
KType e2)
Adds two KTypes to the stack.
|
void |
push(KType e1,
KType e2,
KType e3)
Adds three KTypes to the stack.
|
void |
push(KType e1,
KType e2,
KType e3,
KType e4)
Adds four KTypes to the stack.
|
int |
pushAll(java.lang.Iterable<? extends KTypeCursor<? extends KType>> iterable)
Pushes all elements from another iterable to the top of the stack.
|
int |
pushAll(KTypeContainer<? extends KType> container)
Pushes all elements from another container to the top of the stack.
|
int |
removeAll(KTypeLookupContainer<? extends KType> c)
Default implementation uses a predicate for removal.
|
int |
retainAll(KTypeLookupContainer<? extends KType> c)
Default implementation uses a predicate for retaining.
|
int |
retainAll(KTypePredicate<? super KType> predicate)
Default implementation redirects to
KTypeCollection.removeAll(KTypePredicate)
and negates the predicate. |
KType[] |
toArray(java.lang.Class<? super KType> clazz)
Default implementation of copying to an array.
|
java.lang.String |
toString()
Convert the contents of this container to a human-friendly string.
|
add, add, add, add, addAll, addAll, clear, contains, ensureBufferSpace, ensureCapacity, equals, forEach, forEach, forEach, forEach, get, hashCode, indexOf, insert, isEmpty, iterator, lastIndexOf, release, remove, removeAll, removeAllOccurrences, removeFirstOccurrence, removeLastOccurrence, removeRange, resize, set, size, toArray, trimToSizefinalize, getClass, notify, notifyAll, wait, wait, waitremoveAll, retainAll, retainAlltoArraypublic KTypeStack()
public KTypeStack(int initialCapacity)
public KTypeStack(int initialCapacity,
ArraySizingStrategy resizer)
public KTypeStack(KTypeContainer<KType> container)
public void push(KType e1)
public void push(KType[] elements, int start, int len)
public void push(KType... elements)
This method is handy, but costly if used in tight loops (anonymous array passing)
public int pushAll(KTypeContainer<? extends KType> container)
public int pushAll(java.lang.Iterable<? extends KTypeCursor<? extends KType>> iterable)
public void discard(int count)
public void discard()
public KType pop()
public KType peek()
public static <KType> KTypeStack<KType> newInstance()
public static <KType> KTypeStack<KType> newInstanceWithCapacity(int initialCapacity)
public static <KType> KTypeStack<KType> from(KType... elements)
public static <KType> KTypeStack<KType> from(KTypeContainer<KType> container)
public KTypeStack<KType> clone()
clone in class KTypeArrayList<KType>public int removeAll(KTypeLookupContainer<? extends KType> c)
removeAll in interface KTypeCollection<KType>public int retainAll(KTypeLookupContainer<? extends KType> c)
retainAll in interface KTypeCollection<KType>public int retainAll(KTypePredicate<? super KType> predicate)
KTypeCollection.removeAll(KTypePredicate)
and negates the predicate.retainAll in interface KTypeCollection<KType>public KType[] toArray(java.lang.Class<? super KType> clazz)
toArray in interface KTypeContainer<KType>public java.lang.String toString()
toString in class java.lang.ObjectCopyright © 2014 Carrot Search s.c.. All rights reserved.