![]() ![]() RWGQueue( type)( type* a) Ĭonstruct a queue with one entry a. None Public Constructors RWGQueue( type)() Ĭonstruct an empty queue. In order to simplify the documentation below, an imaginary typedef typedef RWBoolean (* yourTester)(const type*, const void*) The function should return TRUE if a "match" is found between c and d. The argument d is for your convenience and will be passed to yourTesterFunction(). ![]() The argument c is a candidate within the collection to be tested for a match. ![]() This function should have prototype: RWBoolean yourTesterFunction(const type* c, const void* d) In order to find a particular item within the collection, a user-provided global "tester" function is required to test for a "match", definable in any consistent way. Objects of type RW GQueue(type) are declared with macros defined in the standard C++ header file. This class is implemented as a singly-linked list. Hence, the ordering is determined externally by the ordering of the insertions. A RW GQueue(type) is a first in, first out (FIFO) sequential list for which insertions are made at one end (the "tail"), but all removals are made at the other (the "head"). Synopsis #include declare(RWGQueue, type)Ĭlass RW GQueue(type) represents a group of ordered elements, not accessible by an external key. ©Copyright 1996 Rogue Wave Software RWGQueue(type) Click on the banner to return to the Class Reference home page. ![]()
0 Comments
Leave a Reply. |