Returns a list of all of the items in lst, where sublists and atoms all count as items. Will contain duplicates if there are duplicates in lst. Recursion in implementation could be improved.

Returns a subtree of tree indexed by point-index in a depth first traversal.

computes the next row using the prev-row current-element and the other seq

If tree contains subtree at any level then this returns the smallest subtree of tree that contains but is not equal to the first instance of subtree. For example, (contining-subtree ‘(b (c (a)) (d (a))) ’(a)) => (c (a)). Returns nil if tree does not contain subtree.

Returns true if tree contains subtree at any level. Inefficient but functional implementation.

Returns the number of paren pairs in tree

Returns the number of points in tree, where each atom and each pair of parentheses counts as a point.

Calculates the Hamming distance between two sequences, including strings

Returns a copy of tree with the subtree formerly indexed by point-index (in a depth-first traversal) replaced by new-subtree.

Returns a version of n that obeys limit parameters.

Levenshtein Distance - http://en.wikipedia.org/wiki/Levenshtein_distance In information theory and computer science, the Levenshtein distance is a metric for measuring the amount of difference between two sequences. This is a functional implementation of the levenshtein edit distance with as little mutability as possible. Still maintains the O(n*m) guarantee.

Returns lst if it is not a list, or a non-lazy version of lst if it is.

Like postwalk, but only for lists

Like postwalk-replace, but only for lists.

Like prewalk but only for seqs and uses zippers.

Prints the provided thing and returns it.

If thing is a literal, return its type – otherwise return false.

Returns a copy of tree with the subtree formerly indexed by point-index (in a depth-first traversal) removed. The old version would not allow removals that result in empty lists, but the current version allows this behavior.

If a number, rounds float f to n decimal places.

Returns a zipper for nested sequences, given a root sequence

Returns the given list but with all instances of that (at any depth)
replaced with this. Read as ‘subst this for that in list’.

Takes a list of domains and creates a set of (random) train inputs and a set of test inputs based on the domains. Returns [train test]. A program should not be considered a solution unless it is perfect on both the train and test cases.

Returns a truncated integer version of n.

Like walk, but only for lists.