Singly-linked list/Element insertion: Difference between revisions

Rename Perl 6 -> Raku, alphabetize, minor clean-up
(add task to ARM64 assembly Raspberry Pi)
(Rename Perl 6 -> Raku, alphabetize, minor clean-up)
Line 101:
C
</pre>
 
=={{header|AArch64 Assembly}}==
{{works with|as|Raspberry Pi 3B version Buster 64 bits}}
Line 229 ⟶ 230:
.include "../includeARM64.inc"
</lang>
 
=={{header|ACL2}}==
<lang Lisp>(defun insert-after (x e xs)
Line 304 ⟶ 306:
Free(C);
end Singly_Linked;</lang>
 
=={{header|ALGOL 68}}==
Linked lists are not built into ALGOL 68 ''per se'', nor any available
Line 350 ⟶ 353:
% insert a new value into the list %
insert( next(head), 4077 );</lang>
 
=={{header|ARM Assembly}}==
{{works with|as|Raspberry Pi}}
Line 611 ⟶ 615:
free (b);
free (c);</lang>
 
=={{header|C sharp|C#}}==
Uses the generic version of the node type located [[Singly-linked_list/Element_definition#C#|here]].
 
Creates nodes and inserts them from the data passed.
<lang csharp>static void InsertAfter<T>(LinkedListNode<T> prev, T value)
prev.Next = new Link() { Value = value, Next = prev.Next };
}</lang>
 
<lang csharp>static void Main()
//Create A(5)->B(7)
var A = new LinkedListNode<int>() { Value = 5 };
InsertAfter(A, 7);
//Insert C between A and B
InsertAfter(A, 15);
}</lang>
 
=={{header|C++}}==
Line 636 ⟶ 658:
a = a->next;
delete tmp;
}</lang>
 
=={{header|C sharp|C#}}==
Uses the generic version of the node type located [[Singly-linked_list/Element_definition#C#|here]].
 
Creates nodes and inserts them from the data passed.
<lang csharp>static void InsertAfter<T>(LinkedListNode<T> prev, T value)
prev.Next = new Link() { Value = value, Next = prev.Next };
}</lang>
 
<lang csharp>static void Main()
//Create A(5)->B(7)
var A = new LinkedListNode<int>() { Value = 5 };
InsertAfter(A, 7);
//Insert C between A and B
InsertAfter(A, 15);
}</lang>
 
Line 838 ⟶ 842:
L → (a c b y)
</lang>
 
=={{header|Elena}}==
<lang elena>singleton linkHelper
Line 1,302 ⟶ 1,307:
| c :: cs -> c :: insert_after a b cs
| [] -> raise Not_found</lang>
 
 
=={{header|Oforth}}==
Line 1,444 ⟶ 1,448:
# append new nodes ('A2a', 'A2b') after the second element (which now is 'A2')
insert_after $list2->{next}, { data => 'A2a' }, { data => 'A2b' };</lang>
=={{header|Perl 6}}==
 
Extending <tt>class Cell</tt> from [[Singly-linked_list/Element_definition#Perl_6]]:
 
<lang perl6> method insert ($value) {
$.next = Cell.new(:$value, :$.next)
}</lang>
 
=={{header|Phix}}==
Line 1,533 ⟶ 1,530:
 
Note that user-defined case differs from built-in case only because of names.
 
=={{header|PureBasic}}==
<lang PureBasic>Procedure insertAfter(Value, *node.MyData = #Null)
Line 1,584 ⟶ 1,582:
l ; -> (mcons 1 (mcons 2 (mcons 2.5 (mcons 3))))
</lang>
 
=={{header|Perl 6Raku}}==
(formerly Perl 6)
 
Extending <tt>class Cell</tt> from [[Singly-linked_list/Element_definition#Perl_6]]:
 
<lang perl6> method insert ($value) {
$.next = Cell.new(:$value, :$.next)
}</lang>
 
=={{header|REXX}}==
10,327

edits