fifoQueue
Section: OATH Reference Manual (3O)
Updated: 26 August 1991
Index
Return to Main Contents
NAME
fifoQueue (fifoQueueA, fifoQueueG) - a first-in-first-out ordered queue
SYNOPSIS
#include <oath/fifoQueue.h>
DESCRIPTION
The fifoQueue is a seq such that the objs are inserted and removed in
"First In, First-Out" order -- that is, the obj at the front of the queue
is the first obj that was inserted into the queue (that has not yet been
removed), and the obj at the end of the queue was the last obj inserted.
DERIVATION
fifoQueue : seq : queue : bag : obj
fifoQueue is an abstract type.
STATIC OPERATIONS
- fifoQueueA fifoQueueA:: isa (objA)
-
fifoQueueA::isa(O) returns O if it is truly a fifoQueue; otherwise it
returns Nil.
MEMBER OPERATIONS
- fifoQueueA fifoQueueA:: insert (objA)
-
FQ.insert(O) inserts O into fifoQueue FQ at the end. Depending upon the
type of FQ, O may fall through or be transformed.
INTERNAL OPERATIONS
SEE ALSO
OATH(3O), seq(3O)
AUTHOR
Brian M. Kennedy (Computer Science Center, Texas Instruments Incorporated)
BUGS
Index
- NAME
-
- SYNOPSIS
-
- DESCRIPTION
-
- DERIVATION
-
- STATIC OPERATIONS
-
- MEMBER OPERATIONS
-
- INTERNAL OPERATIONS
-
- SEE ALSO
-
- AUTHOR
-
- BUGS
-
This document was created by
man2html,
using the manual pages.
Time: 20:37:51 GMT, July 24, 2024