Queue Function
|
Programming considers as basic kinds of data structure stack (reference) and queue (reference).
Robo Pro provides only handy instructions to manage a stack or LIFO = Last In, First Out, as Append, Delete, Exchange described in the help chapter 8.4.5. |
|
|
But there's no instruction for managing a queue or FIFO = First In, First Out.
Why do I need a queue? Let consider a process with multiple conveyor belts. I want to measure the colour of cylinders at the start of a process and know that value later on the process (either during or at the end of), on the right order. Here's my answer. |
Entering the Queue
|
I use the standard Append instruction. The new value is added at the end of the list.
|
|
Exiting the queue
|
This is more complicated.
I take the first value (i=0). The Delete instruction deletes the (n-1) value. So I have to exchange the (0) with the (n-1), delete the (n-1) and then resort the queue. |
|
Graphic Sequence
Here's a graphic sequence:
|
|
|
|
|
|
|
|
Download
|
Download the driver with an example for RoboPro.
This file is under the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License. |
| ||
