This VI implements a color coded FIFO (First In First Out) Message Queue using array functions. The queue is actually an array of clusters. Each cluster contains a color box indicator and a string containing user defined information.

The queue is populated until it reaches a user specified maximum queue size, and then acts as a FIFO after that (an element is added at the beginning of the array, and deleted from the end).

This example could be used to return specific messages to the user over the course of a test based on specific input conditions.Integration of an event structure to add a message to the queue only upon specific event occurances would also increase the usefulness of this code in certain situations.