Doubly-linked list/Traversal: Difference between revisions

PascalABC.NET
(Added XPL0 example.)
(PascalABC.NET)
 
(One intermediate revision by one other user not shown)
Line 1,982:
=={{header|Pascal}}==
See [[Doubly-linked_list/Traversal#Delphi | Delphi]]
 
=={{header|PascalABC.NET}}==
<syntaxhighlight lang="delphi">
begin
var lst := new LinkedList<integer>(1..10);
var current := lst.First;
while current <> nil do
begin
Print(current.Value);
current := current.Next;
end;
end.
</syntaxhighlight>
{{out}}
<pre>
1 2 3 4 5 6 7 8 9 10
</pre>
 
 
=={{header|Phix}}==
Line 2,553 ⟶ 2,571:
{{libheader|Wren-llist}}
{{libheader|Wren-fmt}}
<syntaxhighlight lang="ecmascriptwren">import "./llist" for DLinkedList
import "./fmt" for Fmt
 
// create a new doubly-linked list and add the first 50 positive integers to it
222

edits