Important: The SimpleQueue command has been deprecated. Use the superseding command DEQueue instead.

The procedure SimpleQueue is a queue constructor. It returns a Maple expression that implements a queue object, which is of type Queue.

The SimpleQueue(e1, e2, ..., en) calling sequence constructs a queue containing the items e1, e2, ..., en. The item e1 is at the front of the queue.

You can test whether a Maple expression e is a Queue object by using type(e, 'Queue'). An expression is of type Queue if it is an object with the methods empty, front, enqueue, and dequeue. Specific Queue implementations may support additional methods, but all Queues support at least these four methods. Queues built by the constructor SimpleQueue are currently represented by modules, so the message-passing syntax uses the :- operator.

The empty method returns the value true if no items are on the queue, and returns the value false otherwise.

To insert an item e (any Maple expression) at the back of a queue, use the enqueue method. The inserted value is returned.

Items may be removed from the front of the queue by using the dequeue method. An error is raised if the queue is empty. This error may be caught using the exception string "empty queue".

The item at the front of a non-empty queue may be examined, without changing the contents of the queue, by using the method front. If the queue is non-empty, this method returns the item at the front of the queue (the value that will be returned by the next call to the dequeue method), and raises the "empty queue" exception otherwise.

Queues constructed by the SimpleQueue constructor also support the methods length, which returns the number of items on the queue, and clear, which empties the queue.

The standard include file <Queue.mi> defines several inline procedures for invoking the basic Queue operations. The procedures provided are Enqueue, Dequeue, EmptyP, and Front. These procedures are not part of the Maple library, and are provided only as inlined procedures. (Note: The include file <Stack.mi> also provides an EmptyP inlined procedure, but it is compatible with the one in <Queue.mi>, so both include files may be used in the same Maple source file.

For a non-object-oriented queue implementation, see the queue package.

$Q≔\mathrm{SimpleQueue}\left(\right)\&colon;$

$\mathrm{type}\left(Q\&comma;'\mathrm{Queue}'\right)$

$\mathrm{true}$

$Q:-\mathrm{enqueue}\left(1\right)\&semi;$$Q:-\mathrm{enqueue}\left(2\right)\&semi;$$Q:-\mathrm{enqueue}\left(3\right)$

$1$

$2$

$3$

$Q:-\mathrm{length}\left(\right)$

$3$

$Q:-\mathrm{front}\left(\right)$

$1$

$Q:-\mathrm{dequeue}\left(\right)$

$1$

$Q:-\mathrm{front}\left(\right)$

$2$

$$\begin{gathered} \mathbf{while}\mathbf{not}Q:-\mathrm{empty}\left(\right)\mathbf{do} \\ Q:-\mathrm{dequeue}\left(\right) \\ \mathbf{end}\mathbf{do} \end{gathered}$$

$3$

$Q:-\mathrm{length}\left(\right)$

$0$

$Q:-\mathrm{front}\left(\right)$

Error, (in front) empty queue

$\mathrm{MathFolks}≔\mathrm{SimpleQueue}\left(\right)\&colon;$

$\mathrm{MathFolks}:-\mathrm{enqueue}\left(''Alex''\right)\&colon;$$\mathrm{MathFolks}:-\mathrm{enqueue}\left(''Allan''\right)\&colon;$$\mathrm{MathFolks}:-\mathrm{enqueue}\left(''Dave''\right)\&colon;$$\mathrm{MathFolks}:-\mathrm{enqueue}\left(''David''\right)\&colon;$$\mathrm{MathFolks}:-\mathrm{enqueue}\left(''Edgardo''\right)\&colon;$$\mathrm{MathFolks}:-\mathrm{enqueue}\left(''James''\right)\&colon;$$\mathrm{MathFolks}:-\mathrm{enqueue}\left(''Juergen''\right)\&colon;$$\mathrm{MathFolks}:-\mathrm{enqueue}\left(''Laurent''\right)\&colon;$$\mathrm{MathFolks}:-\mathrm{enqueue}\left(''Michael''\right)\&colon;$$\mathrm{MathFolks}:-\mathrm{enqueue}\left(''Paulina''\right)\&colon;$$\mathrm{MathFolks}:-\mathrm{enqueue}\left(''Raqeeb''\right)\&colon;$$\mathrm{MathFolks}:-\mathrm{enqueue}\left(''Stephen''\right)\&colon;$$$\begin{gathered} \mathbf{while}\mathbf{not}\mathrm{MathFolks}:-\mathrm{empty}\left(\right)\mathbf{do} \\ \mathrm{MathFolks}:-\mathrm{dequeue}\left(\right) \\ \mathbf{end}\mathbf{do} \end{gathered}$$

$''Stephen''$