Anonymous user
Queue/Definition: Difference between revisions
→{{header|PureBasic}}: Added PureBasic
(→{{header|PureBasic}}: Added PureBasic) |
|||
Line 1,253:
end empty;
</lang>
=={{header|PureBasic}}==
For FIFO function PureBasic normally uses linked lists.
Usage as described above could look like;
<lang PureBasic>NewList MyStack()
Procedure Push(n)
Shared MyStack()
LastElement(MyStack())
AddElement(MyStack())
MyStack()=n
EndProcedure
Procedure Pop()
Shared MyStack()
Protected n
FirstElement(MyStack())
n=MyStack()
DeleteElement(MyStack(),1)
ProcedureReturn n
EndProcedure
Procedure Empty()
Shared MyStack()
If ListSize(MyStack())=0
ProcedureReturn #True
EndIf
ProcedureReturn #False
EndProcedure
;---- Example of implementation ----
Push(3)
Push(1)
Push(4)
While Not Empty()
Debug Pop()
Wend</lang>
'''Outputs
<tt>
3
1
4
</tt>
=={{header|Python}}==
| |||