Modul speiger.src.collections

Package speiger.src.collections.ints.queues

Klasse IntHeapPriorityQueue

java.lang.Object

speiger.src.collections.ints.queues.AbstractIntPriorityQueue

speiger.src.collections.ints.queues.IntHeapPriorityQueue

Alle implementierten Schnittstellen:

Iterable<Integer>, IntIterable, IntPriorityQueue

public class IntHeapPriorityQueue
extends AbstractIntPriorityQueue

A Simple Heap base Priority Queue implementation It is a ArrayBased Alternative to TreeSets that has less object allocations

Konstruktorübersicht

Konstruktoren

Konstruktor	Beschreibung
IntHeapPriorityQueue()	Default Constructor
IntHeapPriorityQueue(int size)	Constructor with a Min Capacity
IntHeapPriorityQueue(int[] array)	Constructor using a initial array
IntHeapPriorityQueue(int[] array, int size)	Constructor using a initial array
IntHeapPriorityQueue(int[] array, int size, IntComparator comp)	Constructor using a initial array and a custom sorter
IntHeapPriorityQueue(int[] array, IntComparator comp)	Constructor using a initial array and a custom sorter
IntHeapPriorityQueue(int size, IntComparator comp)	Constructor with a Min Capacity and custom Sorter
IntHeapPriorityQueue(IntCollection c)	Constructor using a Collection
IntHeapPriorityQueue(IntCollection c, IntComparator comp)	Constructor using a Collection and a custom sorter
IntHeapPriorityQueue(IntComparator comp)	Constructor using custom sorter

Methodenübersicht

Modifizierer und Typ	Methode	Beschreibung
void	clear()	clears all elements within the PriorityQueue, this does not resize the backing arrays
IntComparator	comparator()
boolean	contains(int e)	Method to find out if a element is part of the queue
IntHeapPriorityQueue	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
void	enqueue(int e)	Method to insert a element into the PriorityQueue
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
static IntHeapPriorityQueue	wrap(int[] array)	Wrapping method to help serialization
static IntHeapPriorityQueue	wrap(int[] array, int size)	Wrapping method to help serialization
static IntHeapPriorityQueue	wrap(int[] array, int size, IntComparator comp)	Wrapping method to help serialization, using a custom sorter
static IntHeapPriorityQueue	wrap(int[] array, IntComparator comp)	Wrapping method to help serialization, using a custom sorter

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.IntPriorityQueue

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

Konstruktordetails

IntHeapPriorityQueue

public IntHeapPriorityQueue()

Default Constructor

IntHeapPriorityQueue

public IntHeapPriorityQueue(IntComparator comp)

Constructor using custom sorter

Parameter:

comp - Comparator to sort the Array. Can be null

IntHeapPriorityQueue

public IntHeapPriorityQueue(int size)

Constructor with a Min Capacity

Parameter:

size - the initial capacity of the backing array

Löst aus:

IllegalStateException - if the initial size is smaller 0

IntHeapPriorityQueue

public IntHeapPriorityQueue(int size,
 IntComparator comp)

Constructor with a Min Capacity and custom Sorter

Parameter:

size - the initial capacity of the backing array

comp - Comparator to sort the Array. Can be null

Löst aus:

IllegalStateException - if the initial size is smaller 0

IntHeapPriorityQueue

public IntHeapPriorityQueue(int[] array)

Constructor using a initial array

Parameter:

array - the Array that should be used

IntHeapPriorityQueue

public IntHeapPriorityQueue(int[] array,
 int size)

Constructor using a initial array

Parameter:

array - the Array that should be used

size - the amount of elements found within the array

Löst aus:

NegativeArraySizeException - if size is smaller then 0

IntHeapPriorityQueue

public IntHeapPriorityQueue(int[] array,
 IntComparator comp)

Constructor using a initial array and a custom sorter

Parameter:

array - the Array that should be used

comp - Comparator to sort the Array. Can be null

IntHeapPriorityQueue

public IntHeapPriorityQueue(int[] array,
 int size,
 IntComparator comp)

Constructor using a initial array and a custom sorter

Parameter:

array - the Array that should be used

size - the amount of elements found within the array

comp - Comparator to sort the Array. Can be null

Löst aus:

NegativeArraySizeException - if size is smaller then 0

IntHeapPriorityQueue

public IntHeapPriorityQueue(IntCollection c)

Constructor using a Collection

Parameter:

c - the Collection that should be used

IntHeapPriorityQueue

public IntHeapPriorityQueue(IntCollection c,
 IntComparator comp)

Constructor using a Collection and a custom sorter

Parameter:

c - the Collection that should be used

comp - Comparator to sort the Array. Can be null

Methodendetails

wrap

public static IntHeapPriorityQueue wrap(int[] array)

Wrapping method to help serialization

Parameter:

array - the array that should be used

Gibt zurück:

a HeapPriorityQueue containing the original input array

wrap

public static IntHeapPriorityQueue wrap(int[] array,
 int size)

Wrapping method to help serialization

Parameter:

array - the array that should be used

size - the amount of elements within the array

Gibt zurück:

a HeapPriorityQueue containing the original input array

wrap

public static IntHeapPriorityQueue wrap(int[] array,
 IntComparator comp)

Wrapping method to help serialization, using a custom sorter

Parameter:

array - the array that should be used

comp - Comparator to sort the Array. Can be null

Gibt zurück:

a HeapPriorityQueue containing the original input array

wrap

public static IntHeapPriorityQueue wrap(int[] array,
 int size,
 IntComparator comp)

Wrapping method to help serialization, using a custom sorter

Parameter:

array - the array that should be used

size - the amount of elements within the array

comp - Comparator to sort the Array. Can be null

Gibt zurück:

a HeapPriorityQueue containing the original input array

size

public int size()

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

iterator

public IntIterator iterator()

Beschreibung aus Schnittstelle kopiert: IntIterable

Returns an iterator over elements of type T.

Gibt zurück:

an Iterator.

enqueue

public void enqueue(int e)

Beschreibung aus Schnittstelle kopiert: IntPriorityQueue

Method to insert a element into the PriorityQueue

Parameter:

e - the element that should be inserted

dequeue

public int dequeue()

Beschreibung aus Schnittstelle kopiert: IntPriorityQueue

Method to extract a element from the PriorityQueue

Gibt zurück:

a element from the Queue

peek

public int peek(int index)

Beschreibung aus Schnittstelle kopiert: IntPriorityQueue

Peeking function to see whats inside the queue.

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

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

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

Parameter:

e - the element that should be removed

Gibt zurück:

if a searched element was removed

forEach

public void forEach(IntConsumer action)

Beschreibung aus Schnittstelle kopiert: IntIterable

A Type Specific foreach function that reduces (un)boxing

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.

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.

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.

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.

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.

Parameter:

filter - that should be applied

Gibt zurück:

true if all matches.

reduce

public int reduce(int identity,
 IntIntUnaryOperator operator)

Beschreibung aus Schnittstelle kopiert: IntIterable

Performs a reduction on the elements of this Iterable

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

Parameter:

operator - the operation that should be applied

Gibt zurück:

the reduction result, returns null value if nothing was found

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.

Parameter:

filter - that should be applied

Gibt zurück:

the found value or the null equivalent variant.

count

public int count(IntPredicate filter)

Beschreibung aus Schnittstelle kopiert: IntIterable

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

Parameter:

filter - that should be applied

Gibt zurück:

the amount of Valid Elements

onChanged

public void onChanged()

Beschreibung aus Schnittstelle kopiert: IntPriorityQueue

Allows to notify the Queue to be revalidate its data

copy

public IntHeapPriorityQueue 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

Gibt zurück:

a Shallow Copy of the PriorityQueue

comparator

public IntComparator comparator()

Gibt zurück:

the sorter of the Queue, can be null

toIntArray

public int[] toIntArray(int[] input)

Beschreibung aus Schnittstelle kopiert: IntPriorityQueue

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

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.