5.3.12. The Queue Class

A queue is a non-sparse sequenced collection with whole-number indexes. The indexes specify the position of an item relative to the head (first item) of the queue. Adding or removing an item changes the association of an index to its queue item. You can add items at either the tail or the head of the queue.

Table 5.22. ooRexx Queue Class

Object
↓
Queue
+ OrderedCollection
new of
allIndexes allItems append at, [] delete empty first firstItem hasIndex hasItem index insert isEmpty items	last lastItem makeArray next peek previous pull push put queue remove removeItem section supplier

Note

The Queue class also has available class methods that its metaclass, the Class class (Section 5.1.2, “The Class Class”), defines. It also inherits methods from the OrederedCollection (Section 5.3.4, “The OrderedCollection Class”) class.

5.3.12.1. Inherited Methods

Methods inherited from the Object class (Section 5.1.1, “The Object Class”).

new (Class Method)	init	send
= \= == \== <> ><	instanceMethod	sendWith
\|\| '' (abuttal)' ' (blank)	instanceMethods	setMethod
(Operator Methods)	isA	start
class	isInstanceOf	startWith
copy	objectName	string
defaultName	objectName=	unsetMethod
hasMethod	request
identityHash	run

Methods inherited from the Collection class (Section 5.3.2, “The Collection Class”).

[]	equivalent	put
[]=	hasIndex	subset
allIndexes	hasItem	supplier
allItems	index	union
at	intersection	xor
difference	items
disjoint	makeArray

Methods inherited from the OrderedCollection (Section 5.3.4, “The OrderedCollection Class”).

append	intersection	sortWith
appendAll	last	stableSort
delete	lastItem	stableSortWith
difference	next	subset
first	previous	union
firstItem	section	xor
insert	sort