Function (FC): Queue - v3.0

This function implements a Queue using an array to store the data. The function supports enqueue, dequeue, and peek operations, following the FIFO (First In, First Out) principle, where the first element added to the queue is the first one to be processed.

Use Cases

• Managing tasks or events in the order they arrive.
• Implementing scheduling or resource management algorithms.
• Any situation where elements need to be processed in the order they were added.

Dependencies

Type	Name	Version
data type	queueInstanceAttributes	v3.0
enumeration	EQueueMethod	v3.0
enumeration	EQueueStatus	v3.0

Parameters

Parameter	Declaration	Type	Description
method	Input	Int	Method to be executed. EQueueMethod
instance	InOut	queueInstanceAttributes	Queue instance
data	InOut	Variant	Array of data of type <E>
buffer	InOut	Variant	Data buffer of type <E>
-	Return	Int	Returns of the status, EQueueStatus.