This is the complete list of members for class svt_data_queue_iter, including all inherited members.
| svt_data_queue_iter | function svt_data_iter | allocate ( ) | Allocate a new instance of the iterator. The client must use copy to create a duplicate iterator working on the same information initialized to the same position. |
| svt_data_queue_iter | enum value | BACK_ADD | |
| svt_data_queue_iter | enum value | BACK_DELETE | |
| svt_data_queue_iter | enum | change_type_enum | This enumeration indicates the type of queue change that has occurred and that must be accounted for. |
| svt_data_queue_iter | typedef | change_type_enum | |
| svt_data_queue_iter | function svt_data_iter | copy ( ) | Copy the iterator, putting the new iterator at the same position. |
| svt_data_queue_iter | protected svt_data | curr_data = null; | Current data instance, used to re-align if there is a change to the queue. |
| svt_data_queue_iter | protected int | curr_ix = -1; | Current iterator position. |
| svt_data_queue_iter | int | EVENT_Q_CHANGED | Event triggered when the Queue is changed. |
| svt_data_iter | function bit | find ( svt_data data, bit find_forward = 1 ) | Move the iterator forward (using 'next') or backward (using 'prev') to find the indicated data object. If it moves to the end without finding the data object then the iterator is left in the invalid state. |
| svt_data_queue_iter | function bit | first ( ) | Move to the first element in the collection. |
| svt_data_queue_iter | enum value | FRONT_ADD | |
| svt_data_queue_iter | enum value | FRONT_DELETE | |
| svt_data_queue_iter | function svt_data | get_data ( ) | Access the svt_data object at the current position. |
| svt_data_queue_iter | function void | initialize ( svt_data_queue iter_q = null, svt_notify notify = null, int curr_ix = -1 ) | Initializes the iterator using the provided information. |
| svt_data_queue_iter | function void | initialize_notify ( svt_notify notify = null ) | Initializes the notify using the provided instance, or creates a new one if possible. |
| svt_data_queue_iter | function bit | is_ok ( ) | Evaluate whether the iterator is positioned on an element. |
| svt_data_queue_iter | svt_data_queue | iter_q | The queue the iterator is scanning. |
| svt_data_queue_iter | function bit | last ( ) | Move to the last element. |
| svt_data_queue_iter | function int | length ( ) | Get the number of elements. |
| svt_data_iter | vmm_log | log | Log used by this class. |
| svt_data_queue_iter | function void | new ( svt_data_queue iter_q = null, svt_notify notify = null, vmm_log log = null ) | CONSTRUCTOR: Creates a new instance of the svt_data_queue_iter class. |
| svt_data_queue_iter | function bit | next ( ) | Move to the next element. |
| svt_data_queue_iter | protected svt_notify | notify | svt_notify instance that can be shared between iterators. |
| svt_data_queue_iter | function int | pos ( ) | Get the current postion within the overall length. |
| svt_data_queue_iter | function bit | prev ( ) | Move to the previous element. |
| svt_data_queue_iter | function void | queue_changed ( svt_data_queue_iter :: change_type_enum change_type = BACK_ADD ) | Called when the queue changes so the iterator can re-align itself and see if any waits can now proceed. |
| svt_data_queue_iter | function void | reset ( ) | Reset the iterator. |
| svt_data_iter | function void | svt_check_and_load_verbosity ( ) | Check and load verbosity |
| svt_data_queue_iter | task | wait_for_next ( ) | Move to the next element, but only if there is a next element. If no next element exists (e.g., because the iterator is already on the last element) then the iterator will wait here until a new element is placed at the end of the list. |
| svt_data_queue_iter | task | wait_for_prev ( ) | Move to the previous element, but only if there is a previous element. If no previous element exists (e.g., because the iterator is already on the first element) then the iterator will wait here until a new element is placed at the front of the list. |