construct a list, which automatically flattens
shorthand for (de)interleaving templates
partition a list into equivalence classes of each element's order modulo n
pair each element's position in the list with the element
find the index of the first occurence of an item in a list, or -1
shorthand for (de)interleaving templates
generate a sequence of contiguous natural numbers
from a given list, produce a new list containing only unique items
map each element of a list to its position in the list
repeat an argument a given number of times
reverse the order of a list
sum a list
evaluates true if a list contains a given item
a pack is a list which doesn't automatically flatten
evaluates true if all items in the list satisfy the condition
evaluates true if any items in the list satisfy the condition
map each item in a list to the given member in each item
from a given list, produce a new list containing only items which satisfy a condition
get the first element of a list
split a list into n-lists and interleave their items into a new list
map a template over a list
get all items in a list of zero-parameter templates which successfully compiles
reduce a list to a single item using a binary template
from a given list, produce a list of all partial reductions, sweeping from left to right
get the second element of a list
sort a list by <
sort a list by a custom comparison
swap the two elements in a compile-time list indexed by i and j
unpack a packed list, and pass non-pack parameters through unmodified
from a list of n packs of length m, produce a list of m packs of length n