Modul speiger.src.collections

Package speiger.src.collections.bytes.queues

Klasse ByteArrayPriorityQueue

java.lang.Object

speiger.src.collections.bytes.queues.AbstractBytePriorityQueue

speiger.src.collections.bytes.queues.ByteArrayPriorityQueue

Alle implementierten Schnittstellen:

Iterable<Byte>, ByteIterable, BytePriorityQueue

public class ByteArrayPriorityQueue
extends AbstractBytePriorityQueue

A Array Priority Queue, this is a very unoptimized implementation of the PriorityQueue for very specific usecases. It allows for duplicated entries and works like List.indexOf(Object) search. It is highly suggested to use HeapPriorityQueue otherwise, unless you know why you need this specific implementation

Konstruktorübersicht

Konstruktoren

Konstruktor	Beschreibung
ByteArrayPriorityQueue()	Default Constructor
ByteArrayPriorityQueue(byte[] array)	Constructor using a initial array
ByteArrayPriorityQueue(byte[] array, int size)	Constructor using a initial array
ByteArrayPriorityQueue(byte[] array, int size, ByteComparator comp)	Constructor using a initial array and a custom sorter
ByteArrayPriorityQueue(byte[] array, ByteComparator comp)	Constructor using a initial array and a custom sorter
ByteArrayPriorityQueue(int size)	Constructor with a Min Capacity
ByteArrayPriorityQueue(int size, ByteComparator comp)	Constructor with a Min Capacity and custom Sorter
ByteArrayPriorityQueue(ByteCollection c)	Constructor using a Collection
ByteArrayPriorityQueue(ByteCollection c, ByteComparator comp)	Constructor using a Collection and a custom sorter
ByteArrayPriorityQueue(ByteComparator 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
ByteComparator	comparator()
boolean	contains(byte e)	Method to find out if a element is part of the queue
ByteArrayPriorityQueue	copy()	A Function that does a shallow clone of the PriorityQueue itself.
int	count(BytePredicate filter)	Helper function to reduce stream usage that allows to count the valid elements.
byte	dequeue()	Method to extract a element from the PriorityQueue
void	enqueue(byte e)	Method to insert a element into the PriorityQueue
byte	findFirst(BytePredicate filter)	Helper function to reduce stream usage that allows to filter for the first match.
byte	first()	Shows the element that is to be returned next
<E> void	forEach(E input, ObjectByteConsumer<E> action)	Helper function to reduce Lambda usage and allow for more method references, since these are faster/cleaner.
void	forEach(ByteConsumer action)	A Type Specific foreach function that reduces (un)boxing
void	forEachIndexed(IntByteConsumer action)	A Indexed forEach implementation that allows you to keep track of how many elements were already iterated over.
ByteIterator	iterator()	Returns an iterator over elements of type T.
boolean	matchesAll(BytePredicate filter)	Helper function to reduce stream usage that allows to filter for all matches.
boolean	matchesAny(BytePredicate filter)	Helper function to reduce stream usage that allows to filter for any matches.
boolean	matchesNone(BytePredicate 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
byte	peek(int index)	Peeking function to see whats inside the queue.
byte	reduce(byte identity, ByteByteUnaryOperator operator)	Performs a reduction on the elements of this Iterable
byte	reduce(ByteByteUnaryOperator operator)	Performs a reduction on the elements of this Iterable
boolean	removeFirst(byte e)	Removes the first found element in the queue
boolean	removeLast(byte e)	Removes the last found element in the queue
int	size()
byte[]	toByteArray(byte[] input)	A method to drop the contents of the Queue without clearing the queue
static ByteArrayPriorityQueue	wrap(byte[] array)	Wrapping method to help serialization
static ByteArrayPriorityQueue	wrap(byte[] array, int size)	Wrapping method to help serialization
static ByteArrayPriorityQueue	wrap(byte[] array, int size, ByteComparator comp)	Wrapping method to help serialization, using a custom sorter
static ByteArrayPriorityQueue	wrap(byte[] array, ByteComparator comp)	Wrapping method to help serialization, using a custom sorter

Von Klasse geerbte Methoden speiger.src.collections.bytes.queues.AbstractBytePriorityQueue

equals, hashCode, toString

Von Klasse geerbte Methoden java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Von Schnittstelle geerbte Methoden speiger.src.collections.bytes.collections.ByteIterable

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

Von Schnittstelle geerbte Methoden speiger.src.collections.bytes.queues.BytePriorityQueue

enqueueAll, enqueueAll, enqueueAll, enqueueAll, isEmpty, synchronizeQueue, synchronizeQueue, toByteArray

Konstruktordetails

ByteArrayPriorityQueue

public ByteArrayPriorityQueue()

Default Constructor

ByteArrayPriorityQueue

public ByteArrayPriorityQueue(ByteComparator comp)

Constructor using custom sorter

Parameter:

comp - Comparator to sort the Array. Can be null

ByteArrayPriorityQueue

public ByteArrayPriorityQueue(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

ByteArrayPriorityQueue

public ByteArrayPriorityQueue(int size,
 ByteComparator 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

ByteArrayPriorityQueue

public ByteArrayPriorityQueue(byte[] array)

Constructor using a initial array

Parameter:

array - the Array that should be used

ByteArrayPriorityQueue

public ByteArrayPriorityQueue(byte[] 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

ByteArrayPriorityQueue

public ByteArrayPriorityQueue(byte[] array,
 ByteComparator 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

ByteArrayPriorityQueue

public ByteArrayPriorityQueue(byte[] array,
 int size,
 ByteComparator 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

ByteArrayPriorityQueue

public ByteArrayPriorityQueue(ByteCollection c)

Constructor using a Collection

Parameter:

c - the Collection that should be used

ByteArrayPriorityQueue

public ByteArrayPriorityQueue(ByteCollection c,
 ByteComparator 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 ByteArrayPriorityQueue wrap(byte[] array)

Wrapping method to help serialization

Parameter:

array - the array that should be used

Gibt zurück:

a ArrayPriorityQueue containing the original input array

wrap

public static ByteArrayPriorityQueue wrap(byte[] 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 ArrayPriorityQueue containing the original input array

wrap

public static ByteArrayPriorityQueue wrap(byte[] array,
 ByteComparator 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 ArrayPriorityQueue containing the original input array

wrap

public static ByteArrayPriorityQueue wrap(byte[] array,
 int size,
 ByteComparator 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 ArrayPriorityQueue containing the original input array

enqueue

public void enqueue(byte e)

Beschreibung aus Schnittstelle kopiert: BytePriorityQueue

Method to insert a element into the PriorityQueue

Parameter:

e - the element that should be inserted

dequeue

public byte dequeue()

Beschreibung aus Schnittstelle kopiert: BytePriorityQueue

Method to extract a element from the PriorityQueue

Gibt zurück:

a element from the Queue

first

public byte first()

Beschreibung aus Schnittstelle kopiert: BytePriorityQueue

Shows the element that is to be returned next

Gibt zurück:

the first element in the Queue

peek

public byte peek(int index)

Beschreibung aus Schnittstelle kopiert: BytePriorityQueue

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(byte e)

Beschreibung aus Schnittstelle kopiert: BytePriorityQueue

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(byte e)

Beschreibung aus Schnittstelle kopiert: BytePriorityQueue

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(byte e)

Beschreibung aus Schnittstelle kopiert: BytePriorityQueue

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

onChanged

public void onChanged()

Beschreibung aus Schnittstelle kopiert: BytePriorityQueue

Allows to notify the Queue to be revalidate its data

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: BytePriorityQueue

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

forEach

public void forEach(ByteConsumer action)

Beschreibung aus Schnittstelle kopiert: ByteIterable

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(IntByteConsumer action)

Beschreibung aus Schnittstelle kopiert: ByteIterable

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,
 ObjectByteConsumer<E> action)

Beschreibung aus Schnittstelle kopiert: ByteIterable

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(BytePredicate filter)

Beschreibung aus Schnittstelle kopiert: ByteIterable

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(BytePredicate filter)

Beschreibung aus Schnittstelle kopiert: ByteIterable

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(BytePredicate filter)

Beschreibung aus Schnittstelle kopiert: ByteIterable

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 byte reduce(byte identity,
 ByteByteUnaryOperator operator)

Beschreibung aus Schnittstelle kopiert: ByteIterable

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 byte reduce(ByteByteUnaryOperator operator)

Beschreibung aus Schnittstelle kopiert: ByteIterable

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 byte findFirst(BytePredicate filter)

Beschreibung aus Schnittstelle kopiert: ByteIterable

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(BytePredicate filter)

Beschreibung aus Schnittstelle kopiert: ByteIterable

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

iterator

public ByteIterator iterator()

Beschreibung aus Schnittstelle kopiert: ByteIterable

Returns an iterator over elements of type T.

Gibt zurück:

an Iterator.

copy

public ByteArrayPriorityQueue copy()

Beschreibung aus Schnittstelle kopiert: BytePriorityQueue

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 ByteComparator comparator()

Gibt zurück:

the sorter of the Queue, can be null

toByteArray

public byte[] toByteArray(byte[] input)

Beschreibung aus Schnittstelle kopiert: BytePriorityQueue

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.