com.amazon.ion.impl

Class _Private_RecyclingQueue<T>

java.lang.Object

com.amazon.ion.impl._Private_RecyclingQueue<T>

Type Parameters:

T - the type of elements stored.

public class _Private_RecyclingQueue<T>
extends java.lang.Object

A queue whose elements are recycled. This queue will be extended and iterated frequently.

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static interface	_Private_RecyclingQueue.ElementFactory<T> Factory for new queue elements.
static interface	_Private_RecyclingQueue.Recycler<T>

Constructor Summary

Constructors

Constructor and Description
_Private_RecyclingQueue(int initialCapacity, _Private_RecyclingQueue.ElementFactory<T> elementFactory)

Method Summary

Modifier and Type	Method and Description
void	clear() Reset the index and make the queue reusable.
T	get(int index)
boolean	isEmpty()
java.util.Iterator<T>	iterate()
int	push(_Private_RecyclingQueue.Recycler<T> recycler) Pushes an element onto the top of the queue, instantiating a new element only if the queue has not previously grown to the new depth.
void	remove() Reclaim the current element.
int	size()
void	truncate(int index)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

_Private_RecyclingQueue

public _Private_RecyclingQueue(int initialCapacity,
                               _Private_RecyclingQueue.ElementFactory<T> elementFactory)

Parameters:

initialCapacity - the initial capacity of the underlying collection.

elementFactory - the factory used to create a new element on #push() when the queue has not previously grown to the new depth.

Method Detail

truncate

public void truncate(int index)

get

public T get(int index)

push

public int push(_Private_RecyclingQueue.Recycler<T> recycler)

Pushes an element onto the top of the queue, instantiating a new element only if the queue has not previously grown to the new depth.

Returns:

the element at the top of the queue after the push. This element must be initialized by the caller.

remove

public void remove()

Reclaim the current element.

iterate

public java.util.Iterator<T> iterate()

isEmpty

public boolean isEmpty()

Returns:

true if the queue is empty; otherwise, false.

clear

public void clear()

Reset the index and make the queue reusable.

size

public int size()

Returns:

the number of elements within the queue.