Modul speiger.src.collections

Package speiger.src.collections.ints.queues

Klasse IntArrayFIFOQueue

java.lang.Object

speiger.src.collections.ints.queues.AbstractIntPriorityQueue

speiger.src.collections.ints.queues.IntArrayFIFOQueue

Alle implementierten Schnittstellen:

Iterable<Integer>, IntIterable, IntPriorityDequeue, IntPriorityQueue, ITrimmable

public class IntArrayFIFOQueue
extends AbstractIntPriorityQueue
implements IntPriorityDequeue, ITrimmable

A Simple First In First Out Priority Queue that is a Good Replacement for a linked list (or ArrayDequeue) Its specific implementation uses a backing array that grows and shrinks as it is needed.

Feldübersicht

Felder

Modifizierer und Typ	Feld	Beschreibung
static final int	MIN_CAPACITY	The Minimum Capacity that is allowed

Konstruktorübersicht

Konstruktoren

Konstruktor	Beschreibung
IntArrayFIFOQueue()	Default Construtor
IntArrayFIFOQueue(int capacity)	Constructor with a Min Capacity
IntArrayFIFOQueue(int[] values)	Constructor using a initial array
IntArrayFIFOQueue(int[] values, int size)	Constructor using a initial array
IntArrayFIFOQueue(int[] values, int offset, int size)	Constructor using a initial array

Methodenübersicht

Modifizierer und Typ	Methode	Beschreibung
void	clear()	clears all elements within the PriorityQueue, this does not resize the backing arrays
void	clearAndTrim(int size)	Trims the collection down to the requested size and clears all elements while doing so
IntComparator	comparator()
boolean	contains(int e)	Method to find out if a element is part of the queue
IntArrayFIFOQueue	copy()	A Function that does a shallow clone of the PriorityQueue itself.
int	count(IntPredicate filter)	Helper function to reduce stream usage that allows to count the valid elements.
int	dequeue()	Method to extract a element from the PriorityQueue
int	dequeueLast()	A Method to remove a element from the last place instead of the first
void	enqueue(int e)	Method to insert a element into the PriorityQueue
void	enqueueFirst(int e)	Method to insert a element into the first Index instead of the last.
int	findFirst(IntPredicate filter)	Helper function to reduce stream usage that allows to filter for the first match.
<E> void	forEach(E input, ObjectIntConsumer<E> action)	Helper function to reduce Lambda usage and allow for more method references, since these are faster/cleaner.
void	forEach(IntConsumer action)	A Type Specific foreach function that reduces (un)boxing
void	forEachIndexed(IntIntConsumer action)	A Indexed forEach implementation that allows you to keep track of how many elements were already iterated over.
IntIterator	iterator()	Returns an iterator over elements of type T.
boolean	matchesAll(IntPredicate filter)	Helper function to reduce stream usage that allows to filter for all matches.
boolean	matchesAny(IntPredicate filter)	Helper function to reduce stream usage that allows to filter for any matches.
boolean	matchesNone(IntPredicate filter)	Helper function to reduce stream usage that allows to filter for no matches.
void	onChanged()	Allows to notify the Queue to be revalidate its data
int	peek(int index)	Peeking function to see whats inside the queue.
int	reduce(int identity, IntIntUnaryOperator operator)	Performs a reduction on the elements of this Iterable
int	reduce(IntIntUnaryOperator operator)	Performs a reduction on the elements of this Iterable
boolean	removeFirst(int e)	Removes the first found element in the queue
boolean	removeLast(int e)	Removes the last found element in the queue
int	size()
int[]	toIntArray(int[] input)	A method to drop the contents of the Queue without clearing the queue
boolean	trim(int size)	Trims the original collection down to the size of the current elements or the requested size depending which is bigger

Von Klasse geerbte Methoden speiger.src.collections.ints.queues.AbstractIntPriorityQueue

equals, hashCode, toString

Von Klasse geerbte Methoden java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Von Schnittstelle geerbte Methoden speiger.src.collections.ints.collections.IntIterable

arrayflatMap, asAsync, distinct, filter, flatMap, forEach, limit, map, peek, pour, pourAsList, pourAsSet, repeat, sorted, spliterator

Von Schnittstelle geerbte Methoden speiger.src.collections.ints.queues.IntPriorityDequeue

enqueueAllFirst, enqueueAllFirst, enqueueAllFirst, enqueueAllFirst, last, synchronizeQueue, synchronizeQueue

Von Schnittstelle geerbte Methoden speiger.src.collections.ints.queues.IntPriorityQueue

enqueueAll, enqueueAll, enqueueAll, enqueueAll, first, isEmpty, toIntArray

Von Schnittstelle geerbte Methoden speiger.src.collections.utils.ITrimmable

clearAndTrim, trim

Felddetails

MIN_CAPACITY

public static final int MIN_CAPACITY

The Minimum Capacity that is allowed

Siehe auch:

• Konstantenfeldwerte

Konstruktordetails

IntArrayFIFOQueue

public IntArrayFIFOQueue(int[] values)

Constructor using a initial array

Parameter:

values - the Array that should be used

IntArrayFIFOQueue

public IntArrayFIFOQueue(int[] values,
 int size)

Constructor using a initial array

Parameter:

values - the Array that should be used

size - the amount of elements that are in the initial array

Löst aus:

IllegalStateException - if values is smaller then size

IntArrayFIFOQueue

public IntArrayFIFOQueue(int[] values,
 int offset,
 int size)

Constructor using a initial array

Parameter:

values - the Array that should be used

offset - where to begin in the initial array

size - the amount of elements that are in the initial array

Löst aus:

IllegalStateException - if values is smaller then size

IntArrayFIFOQueue

public IntArrayFIFOQueue(int capacity)

Constructor with a Min Capacity

Parameter:

capacity - the initial capacity of the backing array

Löst aus:

IllegalStateException - if the initial size is smaller 0

IntArrayFIFOQueue

public IntArrayFIFOQueue()

Default Construtor

Methodendetails

iterator

public IntIterator iterator()

Beschreibung aus Schnittstelle kopiert: IntIterable

Returns an iterator over elements of type T.

Angegeben von:

iterator in Schnittstelle IntIterable

Angegeben von:

iterator in Schnittstelle Iterable<Integer>

Gibt zurück:

an Iterator.

size

public int size()

Angegeben von:

size in Schnittstelle IntPriorityQueue

Gibt zurück:

the amount of elements that are stored in the PriorityQueue

clear

public void clear()

Beschreibung aus Schnittstelle kopiert: IntPriorityQueue

clears all elements within the PriorityQueue, this does not resize the backing arrays

Angegeben von:

clear in Schnittstelle IntPriorityQueue

enqueue

public void enqueue(int e)

Beschreibung aus Schnittstelle kopiert: IntPriorityQueue

Method to insert a element into the PriorityQueue

Angegeben von:

enqueue in Schnittstelle IntPriorityQueue

Parameter:

e - the element that should be inserted

enqueueFirst

public void enqueueFirst(int e)

Beschreibung aus Schnittstelle kopiert: IntPriorityDequeue

Method to insert a element into the first Index instead of the last.

Angegeben von:

enqueueFirst in Schnittstelle IntPriorityDequeue

Parameter:

e - the element that should be inserted into the first place

dequeue

public int dequeue()

Beschreibung aus Schnittstelle kopiert: IntPriorityQueue

Method to extract a element from the PriorityQueue

Angegeben von:

dequeue in Schnittstelle IntPriorityQueue

Gibt zurück:

a element from the Queue

dequeueLast

public int dequeueLast()

Beschreibung aus Schnittstelle kopiert: IntPriorityDequeue

A Method to remove a element from the last place instead of the first

Angegeben von:

dequeueLast in Schnittstelle IntPriorityDequeue

Gibt zurück:

the last element inserted

peek

public int peek(int index)

Beschreibung aus Schnittstelle kopiert: IntPriorityQueue

Peeking function to see whats inside the queue.

Angegeben von:

peek in Schnittstelle IntPriorityQueue

Parameter:

index - of the element that is requested to be viewed.

Gibt zurück:

the element that is requested

contains

public boolean contains(int e)

Beschreibung aus Schnittstelle kopiert: IntPriorityQueue

Method to find out if a element is part of the queue

Angegeben von:

contains in Schnittstelle IntPriorityQueue

Parameter:

e - the element that is searched for

Gibt zurück:

true if the element is in the queue

removeFirst

public boolean removeFirst(int e)

Beschreibung aus Schnittstelle kopiert: IntPriorityQueue

Removes the first found element in the queue

Angegeben von:

removeFirst in Schnittstelle IntPriorityQueue

Parameter:

e - the element that should be removed

Gibt zurück:

if a searched element was removed

removeLast

public boolean removeLast(int e)

Beschreibung aus Schnittstelle kopiert: IntPriorityQueue

Removes the last found element in the queue

Angegeben von:

removeLast in Schnittstelle IntPriorityQueue

Parameter:

e - the element that should be removed

Gibt zurück:

if a searched element was removed

onChanged

public void onChanged()

Beschreibung aus Schnittstelle kopiert: IntPriorityQueue

Allows to notify the Queue to be revalidate its data

Angegeben von:

onChanged in Schnittstelle IntPriorityQueue

copy

public IntArrayFIFOQueue copy()

Beschreibung aus Schnittstelle kopiert: IntPriorityQueue

A Function that does a shallow clone of the PriorityQueue itself. This function is more optimized then a copy constructor since the PriorityQueue does not have to be unsorted/resorted. It can be compared to Cloneable but with less exception risk

Angegeben von:

copy in Schnittstelle IntPriorityDequeue

Angegeben von:

copy in Schnittstelle IntPriorityQueue

Gibt zurück:

a Shallow Copy of the PriorityQueue

comparator

public IntComparator comparator()

Angegeben von:

comparator in Schnittstelle IntPriorityQueue

Gibt zurück:

the sorter of the Queue, can be null

forEach

public void forEach(IntConsumer action)

Beschreibung aus Schnittstelle kopiert: IntIterable

A Type Specific foreach function that reduces (un)boxing

Angegeben von:

forEach in Schnittstelle IntIterable

Parameter:

action - The action to be performed for each element

Siehe auch:

• Iterable.forEach(Consumer)

forEachIndexed

public void forEachIndexed(IntIntConsumer action)

Beschreibung aus Schnittstelle kopiert: IntIterable

A Indexed forEach implementation that allows you to keep track of how many elements were already iterated over.

Angegeben von:

forEachIndexed in Schnittstelle IntIterable

Parameter:

action - The action to be performed for each element

forEach

public <E> void forEach(E input,
 ObjectIntConsumer<E> action)

Beschreibung aus Schnittstelle kopiert: IntIterable

Helper function to reduce Lambda usage and allow for more method references, since these are faster/cleaner.

Angegeben von:

forEach in Schnittstelle IntIterable

Typparameter:

E - the generic type of the Object

Parameter:

input - the object that should be included

action - The action to be performed for each element

matchesAny

public boolean matchesAny(IntPredicate filter)

Beschreibung aus Schnittstelle kopiert: IntIterable

Helper function to reduce stream usage that allows to filter for any matches.

Angegeben von:

matchesAny in Schnittstelle IntIterable

Parameter:

filter - that should be applied

Gibt zurück:

true if any matches were found

matchesNone

public boolean matchesNone(IntPredicate filter)

Beschreibung aus Schnittstelle kopiert: IntIterable

Helper function to reduce stream usage that allows to filter for no matches.

Angegeben von:

matchesNone in Schnittstelle IntIterable

Parameter:

filter - that should be applied

Gibt zurück:

true if no matches were found

matchesAll

public boolean matchesAll(IntPredicate filter)

Beschreibung aus Schnittstelle kopiert: IntIterable

Helper function to reduce stream usage that allows to filter for all matches.

Angegeben von:

matchesAll in Schnittstelle IntIterable

Parameter:

filter - that should be applied

Gibt zurück:

true if all matches.

findFirst

public int findFirst(IntPredicate filter)

Beschreibung aus Schnittstelle kopiert: IntIterable

Helper function to reduce stream usage that allows to filter for the first match.

Angegeben von:

findFirst in Schnittstelle IntIterable

Parameter:

filter - that should be applied

Gibt zurück:

the found value or the null equivalent variant.

reduce

public int reduce(int identity,
 IntIntUnaryOperator operator)

Beschreibung aus Schnittstelle kopiert: IntIterable

Performs a reduction on the elements of this Iterable

Angegeben von:

reduce in Schnittstelle IntIterable

Parameter:

identity - the start value

operator - the operation that should be applied

Gibt zurück:

the reduction result, returns identity if nothing was found

reduce

public int reduce(IntIntUnaryOperator operator)

Beschreibung aus Schnittstelle kopiert: IntIterable

Performs a reduction on the elements of this Iterable

Angegeben von:

reduce in Schnittstelle IntIterable

Parameter:

operator - the operation that should be applied

Gibt zurück:

the reduction result, returns null value if nothing was found

count

public int count(IntPredicate filter)

Beschreibung aus Schnittstelle kopiert: IntIterable

Helper function to reduce stream usage that allows to count the valid elements.

Angegeben von:

count in Schnittstelle IntIterable

Parameter:

filter - that should be applied

Gibt zurück:

the amount of Valid Elements

trim

public boolean trim(int size)

Beschreibung aus Schnittstelle kopiert: ITrimmable

Trims the original collection down to the size of the current elements or the requested size depending which is bigger

Angegeben von:

trim in Schnittstelle ITrimmable

Parameter:

size - the requested trim size.

Gibt zurück:

if the internal array has been trimmed.

clearAndTrim

public void clearAndTrim(int size)

Trims the collection down to the requested size and clears all elements while doing so

Angegeben von:

clearAndTrim in Schnittstelle ITrimmable

Parameter:

size - the amount of elements that should be allowed

Note:

this will enforce minimum size of the collection itself

toIntArray

public int[] toIntArray(int[] input)

Beschreibung aus Schnittstelle kopiert: IntPriorityQueue

A method to drop the contents of the Queue without clearing the queue

Angegeben von:

toIntArray in Schnittstelle IntPriorityQueue

Parameter:

input - where the elements should be inserted to. If it does not fit then it creates a new appropiatly created array

Gibt zurück:

the contents of the queue into a seperate array.