5.3.8. The CircularQueue Class

The CircularQueue class allows for storing objects in a circular queue of a predefined size. Once the end of the queue has been reached, new item objects are inserted from the beginning, replacing earlier entries. Any object can be placed in the queue and the same object can occupy more than one position in the queue.

Table 5.18. ooRexx CircularQueue Class

Object
↓
Queue
+ OrderedCollection
↓
CircularQueue
of
init append insert intersection makeArray push queue	resize section size string supplier union xor

Note

The CircularQueue class also has available class methods that its metaclass, the Class class (Section 5.1.2, “The Class Class”), defines.

The collected objects can be processed in FIFO (first in, first out) or in a stack-like LIFO (last in, first out) order.

5.3.8.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

Methods inherited from the Queue class (Section 5.3.12, “The Queue Class”).

new (Class Method)	hasIndex	pull
of (Class Method)	hasItem	push
allIndexes	index	put
allItems	insert	[]=
append	isEmpty	queue
at	items	remove
[]	last	removeItem
delete	makeArray	section
empty	next	supplier
first	peek
firstItem	previous