Logo

Programming-Idioms

This language bar is your friend. Select your favorite languages!
  • Go

Idiom #224 Add element to the beginning of the list

Insert the element x at the beginning of the list items.

items = append(items, x)
copy(items[1:], items)
items[0] = x

This implementation is verbose, but it will often not allocate, when items has enough capacity.
items = append([]T{x}, items...)

items has type []T.
This implementation always allocates a full new slice.
func prepend[S ~[]T, T any](items *S, x ...T) {
	*items = append(x, *items...)
}

This generic func always allocates a full new slice.
The variadic argument x accepts one or more values to be inserted at the beginning.
func prepend[S ~[]T, T any](items *S, x ...T) {
	*items = append(*items, x...)
	copy((*items)[len(x):], *items)
	copy(*items, x)
}

This generic func does not always allocate (depending on the capacity of items).
The variadic argument x accepts one or more values to insert at the beginning.
(def items2 (conj items x))

conj take a list and an item, in that order, and appends the item to the list at the front.
New implementation...
< > ⌨
programming-idioms.org 
items = append(items, x)
copy(items[1:], items)
items[0] = x
items = append([]T{x}, items...)
func prepend[S ~[]T, T any](items *S, x ...T) {
	*items = append(x, *items...)
}
func prepend[S ~[]T, T any](items *S, x ...T) {
	*items = append(*items, x...)
	copy((*items)[len(x):], *items)
	copy(*items, x)
}
(def items2 (conj items x))
items.emplace_front(x);
items.push_front(x);
items = items.Prepend(x).ToList();
items.Insert(0, x);
items = x ~ items;
items = [x, ...items];
items2 = [x | items]
items = [x, items]
items2 = x : items
f(x:xs)= x:xs
items = [x, ...items];
items.unshift(x);
items.add(0, x);
(push x items)
table.insert(items, 1, x)
array_unshift($items, $x);

items.insert(0,x);
unshift @items, $x
items.insert(0, x)
items = [x] + items
items.prepend(x)
items.unshift(x)
items.push_front(x);
val newList = x :: items
items = items.Prepend(x).ToList()
items.Insert(0, x)