append an element - this works almost exactly like the concatation operator ('+'), but if the argument is a list, this simply adds the list as a new element, rather than adding each element of the list as a separate element

append the elements of the list 'lst' to the elements of this list, then remove repeated elements in the result; returns a new list with the unique elements of the combination of the two lists

car/cdr - head/tail of list

count the number of elements with the given value

count the number of elements for which the callback returns true

Invoke the callback func(val) on each element, in order from first to last. No return value.

Invoke the callback func(index, val) on each element, in order from first to last. No return value.

get a new list consisting of the unique elements of this list

get the index of the first match for the given value

Find the first element for which the given condition is true, and return the index of the element. Applies the callback function (which encodes the condition to evaluate) to each element in turn, starting with the first. For each element, if the callback returns nil, proceeds to the next element; otherwise, stops and returns the index of the element. If the callback never returns true for any element, we'll return nil.

Insert one or more elements at the given index. If the index is 1, the elements will be inserted before the first existing element. If the index is one higher than the number of elements, the elements will be inserted after all existing elements.

Note that a list value argument will simply be inserted as a single element.

Returns a new list with the value(s) inserted.

intersect with another list

find the last element with the given value, and return its index

Find the last element for which the condition is true, and return the index of the element. Applies the callback to each element in turn, starting with the last element and working backwards. For each element, if the callback returns nil, proceeds to the previous element; otherwise, stops and returns the index of the element. If the callback never returns true for any element, we'll return nil.

Find the last element for which the condition is true, and return the value of the element

get the number of elements in the list

Apply the callback function to each element of this list, and return a new list consisting of the results. Effectively maps the list to a new list using the given function. Suppose the original list is

[x, y, z]

Then the result list is

[func(x), func(y), func(z)]

Prepend an element - this inserts the value before the first existing element.

Delete the element at the given index, reducing the length of the list by one element. Returns a new list with the given element removed.

Delete the range of elements starting at startingIndex and ending at endingIndex. The elements at the ends of the range are included in the deletion. If startingIndex == endingIndex, only one element is removed. Returns a new list with the given element range removed.

Sort the list, returning a new list. If the 'descending' flag is provided and is not nil, we'll sort the list in descending order rather than ascending order.

If the 'comparisonFunction' argument is provided, it must be a callback function; the callback takes two arguments, and returns an integer less than zero if the first argument value is less than the second, zero if they're equal, and an integer greater than zero if the first is greater than the second. If no 'comparisonFunction' argument is provided, or it's provided and its value is nil, we'll simply compare the list elements as ordinary values. The comparison function can be provided for caller-defined orderings, such as ordering a set of objects.

extract a sublist

Select a subset of the list: returns a new list consisting only of the elements for which the callback function 'func' returns true.

Find the first element for which the given condition is true, and return the value of the element. Returns nil if no item satisfies the condition.