Modifier and Type	Class and Description
private class	_Private_RecyclingStack.$Iterator
public static interface	_Private_RecyclingStack.ElementFactory< the type of element. T> Factory for new stack elements.
public static interface	_Private_RecyclingStack.Recycler<T>

Modifier and Type	Field and Description
private int	currentIndex
private final _Private_RecyclingStack.ElementFactory<T>	elementFactory
private final List<T>	elements
public _Private_RecyclingStack<T>.$Iterator	stackIterator
private T	top

Access	Constructor and Description
public	_Private_RecyclingStack(int the initial capacity of the underlying collection. initialCapacity, _Private_RecyclingStack.ElementFactory<T> the factory used to create a new element on `push(Recycler)` when the stack has not previously grown to the new depth. elementFactory)

Modifier and Type	Method and Description
public boolean	Returns: true if the stack is empty; otherwise, false. isEmpty()
public ListIterator<T>	iterator() Implements java.lang.Iterable.iterator. Returns an iterator over elements of type `T`.
public T	Returns: the element at the top of the stack, or null if the stack is empty. peek()
public T	Returns: the element that was at the top of the stack before the pop, or null if the stack was empty. pop() Pops an element from the stack, retaining a reference to the element so that it can be reused the next time the stack grows to the element's depth.
public T	Returns: the element at the top of the stack after the push. This element must be initialized by the caller. push(_Private_RecyclingStack.Recycler<T> recycler) Pushes an element onto the top of the stack, instantiating a new element only if the stack has not previously grown to the new depth.
public int	Returns: the number of elements on the stack. size()

currentIndex	back to summary
private int currentIndex

elementFactory	back to summary
private final _Private_RecyclingStack.ElementFactory<T> elementFactory

elements	back to summary
private final List<T> elements

stackIterator	back to summary
public _Private_RecyclingStack<T>.$Iterator stackIterator

top	back to summary
private T top

_Private_RecyclingStack	back to summary
public _Private_RecyclingStack(int initialCapacity, _Private_RecyclingStack.ElementFactory<T> elementFactory) Parameters initialCapacity:int the initial capacity of the underlying collection. elementFactory:_Private_RecyclingStack.ElementFactory<T> the factory used to create a new element on `push(Recycler)` when the stack has not previously grown to the new depth.

isEmpty	back to summary
public boolean isEmpty() Returns:boolean true if the stack is empty; otherwise, false.

iterator	back to summary
public ListIterator<T> iterator() Implements java.lang.Iterable.iterator. Doc from java.lang.Iterable.iterator. Returns an iterator over elements of type `T`. Returns:ListIterator<T> an Iterator. Annotations @Override

peek	back to summary
public T peek() Returns:T the element at the top of the stack, or null if the stack is empty.

pop	back to summary
public T pop() Pops an element from the stack, retaining a reference to the element so that it can be reused the next time the stack grows to the element's depth. Returns:T the element that was at the top of the stack before the pop, or null if the stack was empty.

push	back to summary
public T push(_Private_RecyclingStack.Recycler<T> recycler) Pushes an element onto the top of the stack, instantiating a new element only if the stack has not previously grown to the new depth. Returns:T the element at the top of the stack after the push. This element must be initialized by the caller.

size	back to summary
public int size() Returns:int the number of elements on the stack.

private Class _Private_RecyclingStack.$Iterator

Class Inheritance

extends Object
implements ListIterator<T>

java.lang.Object
com.amazon.ion.impl._Private_RecyclingStack.$Iterator

All Implemented Interfaces

java.util.ListIterator, java.util.Iterator

Field Summary

Modifier and Type	Field and Description
private int	cursor

Constructor Summary

Access	Constructor and Description
private	$Iterator()

Method Summary

Modifier and Type	Method and Description
public void	add(T the element to insert t) Implements java.util.ListIterator.add. Inserts the specified element into the list (optional operation).
public boolean	hasNext() Implements java.util.ListIterator.hasNext. Returns `true` if this list iterator has more elements when traversing the list in the forward direction.
public boolean	hasPrevious() Implements java.util.ListIterator.hasPrevious. Returns `true` if this list iterator has more elements when traversing the list in the reverse direction.
public T	next() Implements java.util.ListIterator.next. Returns the next element in the list and advances the cursor position.
public int	nextIndex() Implements java.util.ListIterator.nextIndex. Returns the index of the element that would be returned by a subsequent call to `next`.
public T	previous() Implements java.util.ListIterator.previous. Returns the previous element in the list and moves the cursor position backwards.
public int	previousIndex() Implements java.util.ListIterator.previousIndex. Returns the index of the element that would be returned by a subsequent call to `previous`.
public void	remove() Implements java.util.ListIterator.remove. Removes from the list the last element that was returned by `next` or `previous` (optional operation).
public void	set(T the element with which to replace the last element returned by `next` or `previous` t) Implements java.util.ListIterator.set. Replaces the last element returned by `next` or `previous` with the specified element (optional operation).

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

cursor	back to summary
private int cursor

Constructor Detail

$Iterator	back to summary
private $Iterator()

Method Detail

add back to summary

add	back to summary
public void add(T t) Implements java.util.ListIterator.add. Doc from java.util.ListIterator.add. Inserts the specified element into the list (optional operation). The element is inserted immediately before the element that would be returned by `next`, if any, and after the element that would be returned by `previous`, if any. (If the list contains no elements, the new element becomes the sole element on the list.) The new element is inserted before the implicit cursor: a subsequent call to `next` would be unaffected, and a subsequent call to `previous` would return the new element. (This call increases by one the value that would be returned by a call to `nextIndex` or `previousIndex`.) Parameters t:T the element to insert Annotations @Override

public void add(T t)

Implements java.util.ListIterator.add.

Doc from java.util.ListIterator.add.

Inserts the specified element into the list (optional operation). The element is inserted immediately before the element that would be returned by next, if any, and after the element that would be returned by previous, if any. (If the list contains no elements, the new element becomes the sole element on the list.) The new element is inserted before the implicit cursor: a subsequent call to next would be unaffected, and a subsequent call to previous would return the new element. (This call increases by one the value that would be returned by a call to nextIndex or previousIndex.)

Parameters

t:T: the element to insert

Annotations

@Override

hasNext back to summary

hasNext	back to summary
public boolean hasNext() Implements java.util.ListIterator.hasNext. Doc from java.util.ListIterator.hasNext. Returns `true` if this list iterator has more elements when traversing the list in the forward direction. (In other words, returns `true` if `next` would return an element rather than throwing an exception.) Returns:boolean `true` if the list iterator has more elements when traversing the list in the forward direction Annotations @Override

public boolean hasNext()

Implements java.util.ListIterator.hasNext.

Doc from java.util.ListIterator.hasNext.

Returns true if this list iterator has more elements when traversing the list in the forward direction. (In other words, returns true if next would return an element rather than throwing an exception.)

Returns:boolean

true if the list iterator has more elements when traversing the list in the forward direction

Annotations

@Override

hasPrevious back to summary

hasPrevious	back to summary
public boolean hasPrevious() Implements java.util.ListIterator.hasPrevious. Doc from java.util.ListIterator.hasPrevious. Returns `true` if this list iterator has more elements when traversing the list in the reverse direction. (In other words, returns `true` if `previous` would return an element rather than throwing an exception.) Returns:boolean `true` if the list iterator has more elements when traversing the list in the reverse direction Annotations @Override

public boolean hasPrevious()

Implements java.util.ListIterator.hasPrevious.

Doc from java.util.ListIterator.hasPrevious.

Returns true if this list iterator has more elements when traversing the list in the reverse direction. (In other words, returns true if previous would return an element rather than throwing an exception.)

Returns:boolean

true if the list iterator has more elements when traversing the list in the reverse direction

Annotations

@Override

next back to summary

next	back to summary
public T next() Implements java.util.ListIterator.next. Doc from java.util.ListIterator.next. Returns the next element in the list and advances the cursor position. This method may be called repeatedly to iterate through the list, or intermixed with calls to `previous` to go back and forth. (Note that alternating calls to `next` and `previous` will return the same element repeatedly.) Returns:T the next element in the list Annotations @Override

public T next()

Implements java.util.ListIterator.next.

Doc from java.util.ListIterator.next.

Returns the next element in the list and advances the cursor position. This method may be called repeatedly to iterate through the list, or intermixed with calls to previous to go back and forth. (Note that alternating calls to next and previous will return the same element repeatedly.)

Returns:T

the next element in the list

Annotations

@Override

nextIndex back to summary

nextIndex	back to summary
public int nextIndex() Implements java.util.ListIterator.nextIndex. Doc from java.util.ListIterator.nextIndex. Returns the index of the element that would be returned by a subsequent call to `next`. (Returns list size if the list iterator is at the end of the list.) Returns:int the index of the element that would be returned by a subsequent call to `next`, or list size if the list iterator is at the end of the list Annotations @Override

public int nextIndex()

Implements java.util.ListIterator.nextIndex.

Doc from java.util.ListIterator.nextIndex.

Returns the index of the element that would be returned by a subsequent call to next. (Returns list size if the list iterator is at the end of the list.)

Returns:int

the index of the element that would be returned by a subsequent call to next, or list size if the list iterator is at the end of the list

Annotations

@Override

previous back to summary

previous	back to summary
public T previous() Implements java.util.ListIterator.previous. Doc from java.util.ListIterator.previous. Returns the previous element in the list and moves the cursor position backwards. This method may be called repeatedly to iterate through the list backwards, or intermixed with calls to `next` to go back and forth. (Note that alternating calls to `next` and `previous` will return the same element repeatedly.) Returns:T the previous element in the list Annotations @Override

public T previous()

Implements java.util.ListIterator.previous.

Doc from java.util.ListIterator.previous.

Returns the previous element in the list and moves the cursor position backwards. This method may be called repeatedly to iterate through the list backwards, or intermixed with calls to next to go back and forth. (Note that alternating calls to next and previous will return the same element repeatedly.)

Returns:T

the previous element in the list

Annotations

@Override

previousIndex back to summary

previousIndex	back to summary
public int previousIndex() Implements java.util.ListIterator.previousIndex. Doc from java.util.ListIterator.previousIndex. Returns the index of the element that would be returned by a subsequent call to `previous`. (Returns -1 if the list iterator is at the beginning of the list.) Returns:int the index of the element that would be returned by a subsequent call to `previous`, or -1 if the list iterator is at the beginning of the list Annotations @Override

public int previousIndex()

Implements java.util.ListIterator.previousIndex.

Doc from java.util.ListIterator.previousIndex.

Returns the index of the element that would be returned by a subsequent call to previous. (Returns -1 if the list iterator is at the beginning of the list.)

Returns:int

the index of the element that would be returned by a subsequent call to previous, or -1 if the list iterator is at the beginning of the list

Annotations

@Override

remove back to summary

remove	back to summary
public void remove() Implements java.util.ListIterator.remove. Doc from java.util.ListIterator.remove. Removes from the list the last element that was returned by `next` or `previous` (optional operation). This call can only be made once per call to `next` or `previous`. It can be made only if `add` has not been called after the last call to `next` or `previous`. Annotations @Override

public void remove()

Implements java.util.ListIterator.remove.

Doc from java.util.ListIterator.remove.

Removes from the list the last element that was returned by next or previous (optional operation). This call can only be made once per call to next or previous. It can be made only if add has not been called after the last call to next or previous.

Annotations

@Override

set back to summary

set	back to summary
public void set(T t) Implements java.util.ListIterator.set. Doc from java.util.ListIterator.set. Replaces the last element returned by `next` or `previous` with the specified element (optional operation). This call can be made only if neither `remove` nor `add` have been called after the last call to `next` or `previous`. Parameters t:T the element with which to replace the last element returned by `next` or `previous` Annotations @Override

public void set(T t)

Implements java.util.ListIterator.set.

Doc from java.util.ListIterator.set.

Replaces the last element returned by next or previous with the specified element (optional operation). This call can be made only if neither remove nor add have been called after the last call to next or previous.

Parameters

t:T: the element with which to replace the last element returned by next or previous

Annotations

@Override

public final Class _Private_RecyclingStack<T>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private Class _Private_RecyclingStack.$Iterator

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

public Interface _Private_RecyclingStack.ElementFactory<T>

Method Summary

Method Detail

public Interface _Private_RecyclingStack.Recycler<T>

Method Summary

Method Detail