language	variant	family	constructor	access_value	set_next	with_next	absent	present	is_empty	size	delete	insert_head	insert_tail	push	pop	peek	enqueue	dequeue	reserved_conflicts
ada	V1	oo-null	Make(v)	Value(n)	Set_Next(n, x)	-	null	-	Is_Empty(l)	Size(l)	Delete(l, v)	Insert_Head(l, v)	Insert_Tail(l, v)	Push(s, v)	Pop(s)	Peek(s)	Enqueue(q, v)	Dequeue(q)	-
assembly	V1	sys-pointer	node_init	node_get_value	node_set_next	-	0	-	list_is_empty	list_size	list_delete	list_insert_head	list_insert_tail	stack_push	stack_pop	stack_peek	queue_enqueue	queue_dequeue	next;size
ballerina	V1	oo-null	new	self.value	self.next = x	-	()	-	self.isEmpty()	self.size()	self.delete(v)	self.insertHead(v)	self.insertTail(v)	self.push(v)	self.pop()	self.peek()	self.enqueue(v)	self.dequeue()	size
c	V1	sys-pointer	node_new(v)	node->value	node->next = x	-	NULL	-	list_is_empty(l)	list_size(l)	list_delete(l, v)	list_insert_head(l, v)	list_insert_tail(l, v)	stack_push(s, v)	stack_pop(s)	stack_peek(s)	queue_enqueue(q, v)	queue_dequeue(q)	next
clojure	V2	func-option	(make-node v nil)	(:value n)	-	(assoc n :next x)	nil	-	(empty? l)	(count l)	(remove #(= (:value %) v) l)	(conj l (make-node v nil))	(concat l [(make-node v nil)])	(conj s v)	(pop s)	(peek s)	(conj q v)	(pop q)	delete
cobol	V1	sys-pointer	INITIALIZE	NODE-VALUE	MOVE x TO NODE-NEXT	-	NULL	-	IF COUNT = 0	NODE-COUNT	DELETE-NODE	INSERT-HEAD	INSERT-TAIL	PUSH	POP	PEEK	ENQUEUE	DEQUEUE	value;next;size
common-lisp	V1	dyn-null	(make-node :value v)	(node-value n)	(setf (node-next n) x)	-	nil	-	(linked-list-is-empty l)	(linked-list-size l)	(linked-list-delete l v)	(linked-list-insert-head l v)	(linked-list-insert-tail l v)	(stack-push s v)	(stack-pop s)	(stack-peek s)	(queue-enqueue q v)	(queue-dequeue q)	-
cpp	V1	multi	Node(v)	node.value	node.next = x	-	nullptr	-	list.empty()	list.size()	list.delete(v)	list.insert_head(v)	list.insert_tail(v)	stack.push(v)	stack.pop()	stack.peek()	queue.enqueue(v)	queue.dequeue()	next;size;delete
crystal	V1	oo-null	Node.new(v)	node.value	node.next = x	-	nil	-	list.empty?	list.size	list.delete(v)	list.insert_head(v)	list.insert_tail(v)	stack.push(v)	stack.pop	stack.peek	queue.enqueue(v)	queue.dequeue	delete;size
csharp	V1	oo-null	new Node(v)	node.Value	node.Next = x	-	null	-	list.IsEmpty	list.Size	list.Delete(v)	list.InsertHead(v)	list.InsertTail(v)	stack.Push(v)	stack.Pop()	stack.Peek()	queue.Enqueue(v)	queue.Dequeue()	value;Node;Stack;Queue;LinkedList
d	V1	sys-sentinel	Node(v)	node.value	node.next = x	-	null	-	list.isEmpty	list.size	list.remove(v)	list.insertHead(v)	list.insertTail(v)	stack.push(v)	stack.pop	stack.peek	queue.enqueue(v)	queue.dequeue	delete;init
dart	V1	oo-null	Node(v)	node.value	node.next = x	-	null	-	list.isEmpty	list.size	list.delete(v)	list.insertHead(v)	list.insertTail(v)	stack.push(v)	stack.pop	stack.peek	queue.enqueue(v)	queue.dequeue	Queue;Stack;LinkedList
elixir	V2	func-result	Node.new(v)	Node.value(n)	-	Node.with_next(n, x)	nil	-	LinkedList.empty?(l)	LinkedList.size(l)	LinkedList.delete(l, v)	LinkedList.insert_head(l, v)	LinkedList.insert_tail(l, v)	Stack.push(s, v)	Stack.pop(s)	Stack.peek(s)	Queue.enqueue(q, v)	Queue.dequeue(q)	Node
elm	V2	func-option	Node v Nothing	n.value	-	{ n | next = Just x }	Nothing	Just x	LinkedList.isEmpty l	LinkedList.size l	LinkedList.delete v l	LinkedList.insertHead v l	LinkedList.insertTail v l	Stack.push v s	Stack.pop s	Stack.peek s	Queue.enqueue v q	Queue.dequeue q	-
erlang	V2	func-result	node_new(V)	node_value(N)	-	node_with_next(N, X)	undefined	-	list_is_empty(L)	list_size(L)	list_delete(L, V)	list_insert_head(L, V)	list_insert_tail(L, V)	stack_push(S, V)	stack_pop(S)	stack_peek(S)	queue_enqueue(Q, V)	queue_dequeue(Q)	-
forth	V1	sys-pointer	NODE-INIT	NODE-VALUE @	NODE-NEXT !	-	0	-	IS-EMPTY?	SIZE @	DELETE-NODE	INSERT-HEAD	INSERT-TAIL	PUSH	POP	PEEK	ENQUEUE	DEQUEUE	next;size
fsharp	V2	func-option	Node.create v	n.Value	-	Node.withNext n x	None	Some x	LinkedList.isEmpty l	LinkedList.size l	LinkedList.delete v l	LinkedList.insertHead v l	LinkedList.insertTail v l	Stack.push v s	Stack.pop s	Stack.peek s	Queue.enqueue v q	Queue.dequeue q	-
gleam	V2	func-result	node_new(v)	node.value	-	Node(_, Some(x))	None	Some(x)	linked_list_is_empty(l)	linked_list_size(l)	linked_list_delete(l, v)	linked_list_insert_head(l, v)	linked_list_insert_tail(l, v)	stack_push(s, v)	stack_pop(s)	stack_peek(s)	queue_enqueue(q, v)	queue_dequeue(q)	-
go	V1	sys-tuple	NewNode(v)	node.Value	node.Next = x	-	nil	-	list.IsEmpty()	list.Len()	list.Remove(v)	list.InsertHead(v)	list.InsertTail(v)	stack.Push(v)	stack.Pop()	stack.Peek()	queue.Enqueue(v)	queue.Dequeue()	value;delete;size
grain	V2	func-result	nodeInit(v)	node.value	-	{ ...n, next: Some(x) }	None	Some(x)	linkedListIsEmpty(l)	linkedListSize(l)	linkedListDelete(l, v)	linkedListInsertHead(l, v)	linkedListInsertTail(l, v)	stackPush(s, v)	stackPop(s)	stackPeek(s)	queueEnqueue(q, v)	queueDequeue(q)	-
groovy	V1	oo-null	new Node(v)	node.value	node.next = x	-	null	-	list.isEmpty()	list.size	list.delete(v)	list.insertHead(v)	list.insertTail(v)	stack.push(v)	stack.pop()	stack.peek()	queue.enqueue(v)	queue.dequeue()	size
haskell	V2	func-option	newNode v	value n	-	n { next = Just x }	Nothing	Just x	linkedListIsEmpty l	linkedListSize l	linkedListDelete v l	linkedListInsertHead v l	linkedListInsertTail v l	stackPush v s	stackPop s	stackPeek s	queueEnqueue v q	queueDequeue q	size;value;next
haxe	V1	oo-null	new Node(v)	node.value	node.next = x	-	null	-	list.isEmpty	list.size	list.delete(v)	list.insertHead(v)	list.insertTail(v)	stack.push(v)	stack.pop()	stack.peek()	queue.enqueue(v)	queue.dequeue()	size
java	V1	oo-null	new Node(v)	node.getValue()	node.setNext(x)	-	null	-	list.isEmpty()	list.size()	list.remove(v)	list.insertHead(v)	list.insertTail(v)	stack.push(v)	stack.pop()	stack.peek()	queue.enqueue(v)	queue.dequeue()	value;Queue;Stack;LinkedList
javascript	V1	oo-null	new Node(v)	node.value	node.next = x	-	null	-	list.isEmpty	list.size	list.delete(v)	list.insertHead(v)	list.insertTail(v)	stack.push(v)	stack.pop()	stack.peek()	queue.enqueue(v)	queue.dequeue()	delete;value
julia	V1	sys-option	Node(v)	n.value	n.next = x	-	nothing	-	isempty(l)	length(l)	delete!(l, v)	insert_head!(l, v)	insert_tail!(l, v)	push!(s, v)	pop!(s)	peek(s)	enqueue!(q, v)	dequeue!(q)	size;delete
kotlin	V1	oo-null	Node(v)	node.value	node.next = x	-	null	-	list.isEmpty	list.size	list.delete(v)	list.insertHead(v)	list.insertTail(v)	stack.push(v)	stack.pop()	stack.peek()	queue.enqueue(v)	queue.dequeue()	Queue;Stack;LinkedList
lua	V1	dyn-null	Node.new(v)	node.value	node.next = x	-	nil	-	list:is_empty()	list:size()	list:delete(v)	list:insert_head(v)	list:insert_tail(v)	stack:push(v)	stack:pop()	stack:peek()	queue:enqueue(v)	queue:dequeue()	next
nim	V1	sys-option	newNode(v)	node.value	node.next = x	-	nil	-	isEmpty(l)	size(l)	delete(l, v)	insertHead(l, v)	insertTail(l, v)	push(s, v)	pop(s)	peek(s)	enqueue(q, v)	dequeue(q)	delete;size
ocaml	V2	func-option	Node.create v	Node.value n	-	Node.with_next n x	None	Some x	LinkedList.is_empty l	LinkedList.length l	LinkedList.delete l v	LinkedList.insert_head l v	LinkedList.insert_tail l v	Stack.push s v	Stack.pop s	Stack.peek s	Queue.enqueue q v	Queue.dequeue q	size
perl	V1	dyn-null	Node->new($v)	$node->value	$node->set_next($n)	-	undef	-	$list->is_empty	$list->size	$list->delete($v)	$list->insert_head($v)	$list->insert_tail($v)	$stack->push($v)	$stack->pop	$stack->peek	$queue->enqueue($v)	$queue->dequeue	next;delete
php	V1	dyn-null	new Node($v)	$node->value	$node->setNext($n)	-	null	-	$list->isEmpty()	$list->size()	$list->delete($v)	$list->insertHead($v)	$list->insertTail($v)	$stack->push($v)	$stack->pop()	$stack->peek()	$queue->enqueue($v)	$queue->dequeue()	list;size
prolog	V4	logic	node_init(V, N)	node_value(N, V)	-	node_with_next(N, X, N1)	absent	-	is_empty(L)	size(L, N)	delete(L, V, L1)	insert_head(L, V, L1)	insert_tail(L, V, L1)	push(S, V, S1)	pop(S, V, S1)	peek(S, V)	enqueue(Q, V, Q1)	dequeue(Q, V, Q1)	-
purescript	V2	func-option	newNode v	n.value	-	n { next = Just x }	Nothing	Just x	isEmpty l	size l	delete v l	insertHead v l	insertTail v l	push v s	pop s	peek s	enqueue v q	dequeue q	size
python	V1	dyn-null	Node(v)	node.value	node.next = x	-	None	-	list.is_empty()	list.size()	list.delete(v)	list.insert_head(v)	list.insert_tail(v)	stack.push(v)	stack.pop()	stack.peek()	queue.enqueue(v)	queue.dequeue()	Queue;Stack;LinkedList;list;next
r	V1	dyn-null	new_node(v)	n$value	n$next <- x	-	NULL	-	is_empty(l)	size(l)	delete(l, v)	insert_head(l, v)	insert_tail(l, v)	push(s, v)	pop(s)	peek(s)	enqueue(q, v)	dequeue(q)	size;value;next
racket	V2	func-option	(make-node v #f)	(node-value n)	-	(set-node-next n x)	#f	-	(empty? l)	(size l)	(delete! l v)	(insert-head! l v)	(insert-tail! l v)	(push! s v)	(pop! s)	(peek s)	(enqueue! q v)	(dequeue! q)	delete;size
raku	V1	oo-option	Node.new(v)	$node.value	$node.next = $x	-	Nil	-	$list.is-empty	$list.size	$list.delete($v)	$list.insert-head($v)	$list.insert-tail($v)	$stack.push($v)	$stack.pop	$stack.peek	$queue.enqueue($v)	$queue.dequeue	size;delete
rescript	V2	func-option	Node.make(v)	n.value	-	{ ...n, next: Some(x) }	None	Some(x)	isEmpty(l)	size(l)	delete(l, v)	insertHead(l, v)	insertTail(l, v)	push(s, v)	pop(s)	peek(s)	enqueue(q, v)	dequeue(q)	-
rexx	V1	oo-null	.Node~new(v)	node~get_value	node~set_next(n)	-	.Nil	-	list~is_empty	list~size	list~delete(v)	list~insert_head(v)	list~insert_tail(v)	stack~push(v)	stack~pop	stack~peek	queue~enqueue(v)	queue~dequeue	-
ruby	V1	dyn-null	Node.new(v)	node.value	node.next = x	-	nil	-	list.empty?	list.size	list.delete(v)	list.insert_head(v)	list.insert_tail(v)	stack.push(v)	stack.pop	stack.peek	queue.enqueue(v)	queue.dequeue	delete;size;next
rust	V1	multi	Node::new(v)	node.value()	node.set_next(x)	-	None	Some(x)	list.is_empty()	list.len()	list.delete(v)	list.insert_head(v)	list.insert_tail(v)	stack.push(v)	stack.pop()	stack.peek()	queue.enqueue(v)	queue.dequeue()	next;size
scala	V1	oo-option	Node(v)	node.value	node.next = Some(x)	-	None	Some(x)	list.isEmpty	list.size	list.delete(v)	list.insertHead(v)	list.insertTail(v)	stack.push(v)	stack.pop()	stack.peek()	queue.enqueue(v)	queue.dequeue()	size
scheme	V2	func-option	(make-node v '())	(node-value n)	-	(node-with-next n x)	#f	-	(linked-list-empty? l)	(linked-list-size l)	(linked-list-delete l v)	(linked-list-insert-head l v)	(linked-list-insert-tail l v)	(stack-push s v)	(stack-pop s)	(stack-peek s)	(queue-enqueue q v)	(queue-dequeue q)	-
swift	V1	oo-option	Node(v)	node.value	node.next = x	-	nil	-	list.isEmpty	list.size	list.delete(v)	list.insertHead(v)	list.insertTail(v)	stack.push(v)	stack.pop()	stack.peek	queue.enqueue(v)	queue.dequeue()	size
tcl-tk	V1	dyn-null	Node new $v	$node get_value	$node set_next $n	-	{}	-	$list is_empty	$list size	$list delete $v	$list insert_head $v	$list insert_tail $v	$stack push $v	$stack pop	$stack peek	$queue enqueue $v	$queue dequeue	next;delete;size
typescript	V1	oo-null	new Node(v)	node.value	node.next = x	-	null	-	list.isEmpty	list.size	list.delete(v)	list.insertHead(v)	list.insertTail(v)	stack.push(v)	stack.pop()	stack.peek()	queue.enqueue(v)	queue.dequeue()	delete;value
v	V1	sys-option	new_node(v)	node.value()	node.set_next(x)	-	none	-	list.is_empty()	list.size()	list.delete(v)	list.insert_head(v)	list.insert_tail(v)	stack.push(v)	stack.pop()	stack.peek()	queue.enqueue(v)	queue.dequeue()	size
vala	V1	oo-null	new Node(v)	node.value	node.next = x	-	null	-	list.is_empty	list.size	list.delete(v)	list.insert_head(v)	list.insert_tail(v)	stack.push(v)	stack.pop()	stack.peek()	queue.enqueue(v)	queue.dequeue()	-
zig	V1	sys-option	Node.init(v)	node.value	node.next = x	-	null	-	list.isEmpty()	list.len()	list.remove(v)	list.insertHead(v)	list.insertTail(v)	stack.push(v)	stack.pop()	stack.peek()	queue.enqueue(v)	queue.dequeue()	delete;size