Modifier and Type	Class and Description
public class	SortedIntList.Iterator
public static class	SortedIntList.Node<E>
pack-priv static class	SortedIntList.NodePool<E>

Modifier and Type	Field and Description
pack-priv SortedIntList.Node<E>	first
private transient SortedIntList<E>.Iterator	iterator
private SortedIntList.NodePool<E>	nodePool
pack-priv int	size

Access	Constructor and Description
public	SortedIntList() Creates an ascending list

Method Summary

Modifier and Type	Method and Description
public void	clear() Clears list
public E	Returns: Matching element, null otherwise get(int Index of the element to retrieve index) Retrieves an element at a given index
public E	Returns: Element replaced by newly inserted element, null if nothing was replaced insert(int Index of the element index, E Element to insert value) Inserts an element into the list at the given index
public boolean	isEmpty() Returns true if the list is empty.
public Iterator<SortedIntList.Node<E>>	iterator() Implements java.lang.Iterable.iterator. Returns an iterator to traverse the list.
public boolean	notEmpty() Returns true if the list has one or more items.
public int	size() Returns: size of list equal to elements contained in it

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

first	back to summary
pack-priv SortedIntList.Node<E> first

iterator	back to summary
private transient SortedIntList<E>.Iterator iterator

nodePool	back to summary
private SortedIntList.NodePool<E> nodePool

size	back to summary
pack-priv int size

Constructor Detail

SortedIntList	back to summary
public SortedIntList() Creates an ascending list

Method Detail

clear	back to summary
public void clear() Clears list

get	back to summary
public E get(int index) Retrieves an element at a given index Parameters index:int Index of the element to retrieve Returns:E Matching element, null otherwise

get

back to summary

public E get(int index)

Retrieves an element at a given index

Parameters

index:int: Index of the element to retrieve

Returns:E

Matching element, null otherwise

insert	back to summary
public E insert(int index, E value) Inserts an element into the list at the given index Parameters index:int Index of the element value:E Element to insert Returns:E Element replaced by newly inserted element, null if nothing was replaced Annotations @Null

insert

back to summary

public E insert(int index, E value)

Inserts an element into the list at the given index

Parameters

index:int: Index of the element
value:E: Element to insert

Returns:E

Element replaced by newly inserted element, null if nothing was replaced

Annotations

@Null

isEmpty	back to summary
public boolean isEmpty() Returns true if the list is empty.

iterator back to summary

iterator	back to summary
public Iterator<SortedIntList.Node<E>> iterator() Implements java.lang.Iterable.iterator. Returns an iterator to traverse the list. If `Collections#allocateIterators` is false, the same iterator instance is returned each time this method is called. Use the `Iterator` constructor for nested or multithreaded iteration.

public Iterator<SortedIntList.Node<E>> iterator()

Implements java.lang.Iterable.iterator.

Returns an iterator to traverse the list.

If Collections#allocateIterators is false, the same iterator instance is returned each time this method is called. Use the Iterator constructor for nested or multithreaded iteration.

notEmpty	back to summary
public boolean notEmpty() Returns true if the list has one or more items.

size	back to summary
public int size() Returns:int size of list equal to elements contained in it

com.badlogic.gdx.utils back to summary

public Class SortedIntList.Iterator

Class Inheritance

extends Object
implements Iterator<SortedIntList.Node<E>>

java.lang.Object
com.badlogic.gdx.utils.SortedIntList.Iterator

All Implemented Interfaces

java.util.Iterator

Field Summary

Modifier and Type	Field and Description
private SortedIntList.Node<E>	position
private SortedIntList.Node<E>	previousPosition

Constructor Summary

Access	Constructor and Description
public	Iterator()

Method Summary

Modifier and Type	Method and Description
public boolean	hasNext() Implements java.util.Iterator.hasNext. Returns `true` if the iteration has more elements.
public SortedIntList.Node<E>	next() Implements java.util.Iterator.next. Returns the next element in the iteration.
public void	remove() Overrides default java.util.Iterator.remove. Removes from the underlying collection the last element returned by this iterator (optional operation).
public SortedIntList<E>.Iterator	reset()

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

Field Detail

position	back to summary
private SortedIntList.Node<E> position

previousPosition	back to summary
private SortedIntList.Node<E> previousPosition

Constructor Detail

Iterator	back to summary
public Iterator()

Method Detail

hasNext back to summary

hasNext	back to summary
public boolean hasNext() Implements java.util.Iterator.hasNext. Doc from java.util.Iterator.hasNext. Returns `true` if the iteration has more elements. (In other words, returns `true` if `next` would return an element rather than throwing an exception.) Annotations @Override

public boolean hasNext()

Implements java.util.Iterator.hasNext.

Doc from java.util.Iterator.hasNext.

Returns true if the iteration has more elements. (In other words, returns true if next would return an element rather than throwing an exception.)

Annotations

@Override

next	back to summary
public SortedIntList.Node<E> next() Implements java.util.Iterator.next. Doc from java.util.Iterator.next. Returns the next element in the iteration. Annotations @Override

back to summary

public SortedIntList.Node<E> next()

Implements java.util.Iterator.next.

Doc from java.util.Iterator.next.

Returns the next element in the iteration.

Annotations

@Override

remove back to summary

remove	back to summary
public void remove() Overrides default java.util.Iterator.remove. Doc from java.util.Iterator.remove. Removes from the underlying collection the last element returned by this iterator (optional operation). This method can be called only once per call to `next`. The behavior of an iterator is unspecified if the underlying collection is modified while the iteration is in progress in any way other than by calling this method, unless an overriding class has specified a concurrent modification policy. The behavior of an iterator is unspecified if this method is called after a call to the `forEachRemaining` method. Annotations @Override

public void remove()

Overrides default java.util.Iterator.remove.

Doc from java.util.Iterator.remove.

Removes from the underlying collection the last element returned by this iterator (optional operation). This method can be called only once per call to next.

The behavior of an iterator is unspecified if the underlying collection is modified while the iteration is in progress in any way other than by calling this method, unless an overriding class has specified a concurrent modification policy.

The behavior of an iterator is unspecified if this method is called after a call to the forEachRemaining method.

Annotations

@Override

reset	back to summary
public SortedIntList<E>.Iterator reset()

com.badlogic.gdx.utils back to summary

public Class SortedIntList.Node<E>

Class Inheritance

extends Object

java.lang.Object
com.badlogic.gdx.utils.SortedIntList.Node

Field Summary

Modifier and Type	Field and Description
public int	index Index value in list
protected SortedIntList.Node<E>	n Node next to this
protected SortedIntList.Node<E>	p Node previous to this
public E	value Value held

Constructor Summary

Access	Constructor and Description
public	Node()

Method Summary

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

Field Detail

index	back to summary
public int index Index value in list

n	back to summary
protected SortedIntList.Node<E> n Node next to this

p	back to summary
protected SortedIntList.Node<E> p Node previous to this

value	back to summary
public E value Value held

Constructor Detail

Node	back to summary
public Node()

com.badlogic.gdx.utils back to summary

pack-priv Class SortedIntList.NodePool<E>

Class Inheritance

extends Pool<SortedIntList.Node<E>>

java.lang.Object
com.badlogic.gdx.utils.Pool
com.badlogic.gdx.utils.SortedIntList.NodePool

Field Summary

Inherited from com.badlogic.gdx.utils.Pool:: max peak

Constructor Summary

Access	Constructor and Description
pack-priv	NodePool()

Method Summary

Modifier and Type	Method and Description
protected SortedIntList.Node<E>	newObject() Implements abstract com.badlogic.gdx.utils.Pool.newObject.
public SortedIntList.Node<E>	obtain(SortedIntList.Node<E> p, SortedIntList.Node<E> n, E value, int index)

Inherited from com.badlogic.gdx.utils.Pool:: clear discard fill free freeAll getFree obtain reset

Constructor Detail

NodePool	back to summary
pack-priv NodePool()

Method Detail

newObject	back to summary
protected SortedIntList.Node<E> newObject() Implements abstract com.badlogic.gdx.utils.Pool.newObject. Annotations @Override

newObject

back to summary

protected SortedIntList.Node<E> newObject()

Implements abstract com.badlogic.gdx.utils.Pool.newObject.

Annotations

@Override

obtain	back to summary
public SortedIntList.Node<E> obtain(SortedIntList.Node<E> p, SortedIntList.Node<E> n, E value, int index)

public Class SortedIntList<E>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

public Class SortedIntList.Iterator

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

public Class SortedIntList.Node<E>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

pack-priv Class SortedIntList.NodePool<E>

Field Summary

Constructor Summary

Method Summary

Constructor Detail

Method Detail