Listing below shows at the same time example of using and simple tests cases.ĭebug.Print " Queue is empty - " & qQueue. SizeQ = Me.Count - 1 If sizeQ > -1 Then ReDim result(sizeQ)Įnd If Set tmp = Nothing End Function Using Public Function Clear()ĬountQ = 0 Set head = Nothing Set tail = Nothing End Function ' Copies the Queue elements to a new array.
If head Is tail Then Set head = Nothing Set tail = NothingĬountQ = countQ - 1 End If End If End Function ' Removes all objects from the Queue. IsEmpty = True Then Set head = queueItemĬountQ = countQ + 1 Set queueItem = Nothing End Function ' Removes and returns the object at the beginning of the Queue. ' ' Methods ' ' Adds an object to the end of the Queue. ' Returns the object at the beginning of the Queue without removing it.
' Gets the number of elements contained in the Queue. IsEmpty = ((head Is Nothing) And (tail Is Nothing)) Private Sub Class_Initialize()ĬountQ = 0 End Sub ' ' Destructor ' ' Destruct resources and perform other cleanup operations Private Sub Class_Terminate()ĬountQ = 0 Set head = Nothing Set tail = Nothing End Sub ' ' Properties ' ' Returns a Boolean value indicating whether a Queue has items. ' ' Constructor ' ' Initializes a new instance of the Queue class that is empty. ' Private fields Private head As QueueItem ' Objects stored in a Queue are inserted at one end and removed from the other. ' Queues are useful for storing messages in the order they were received for sequential processing. INCLUDE "D2:ALLOCATE.ACT" from the Action! Tool Kit.' ' Queue Class ' ' Remarks: ' Represents a first-in, first-out collection of objects. The user must type in the monitor the following command after compilation and before running the program! SET EndProg=* * for this file see task include a file in language AArch64 assembly */įollowing solution uses module for dynamic memory allocation. Str x3, // store new end pointerĪdd x2,x0,#queue_stvalue // address of begin values item Ldr x2, // begin pointerĪdd x2,x0,#queue_stvalue // address of values structure * x0 returns 0 if not empty, 1 if empty */ * x0 contains the address of queue structure */ Ldr x1,qAdrsZoneConv // conversion value 2īl strInsertAtCharInc // insert result at third characterīl affichageMess // display message final Ldr x1,qAdrsZoneConv // conversion value 1īl strInsertAtCharInc // insert result at Second character Ldr x0,qAdrQueue1 // queue structure addressīl affichageMess // display message emptyīl affichageMess // display message not emptyīl strInsertAtCharInc // insert result at first character skip value_fin // value item memory place asciz "Ident : value 1 : value 2 : \n" // message result struct queue_stvalue + (value_fin * NBMAXIELEMENTS) Queue_stvalue: // structure of value item * example structure for value of item */ * for this file see task include a file in language AArch64 assembly*/ * ARM assembly AARCH64 Raspberry PI 3B */
10.2 A nonlinear circular queue with an automatically resizing buffer.
0 kommentar(er)
