Append the element x to the list s.
s ~= x;
(conj s x)
#include <list>
s.push_back(x);
s.emplace_back(x);
s.Add(x);
s.add(x);
real, allocatable, dimension(:) :: s s = [s, x]
s = append(s, x)
xs = s ++ [x]
s = [...s, x];
s.push(x);
s[#s + 1] = x
table.insert(s, x)
$s[]=$x;
uses classes;
var L: TList; Item: Pointer; ... L.Add(Item); ...
push @s, $x;
s.append(x)
s << x
(reverse (cons x (reverse s)))
s.Add(x)
No security, no password. Other people might choose the same nickname.