11.6 Summary

In this chapter, we covered the following:

• We showed a selection of built-in collection classes, including strings, lists, vectors, tables, and arrays.

• We showed various iteration facilities and control structures, including for, do, map, while, if, case, select, block, &, and |.

• We showed a simple example of recursion.

• We showed some basic collection functions: element, size, and find-key.

• We showed some basic sequence functions: copy-sequence, and reverse.

• We showed additional collection functions: head, tail, pair, list, and vector.

• We explored basic sequence algorithms, and found that, although the various sequence classes are related, algorithms that are efficient for one class of sequence may not be appropriate for a different class of sequence.

• We discussed destructive versus nondestructive functions.

• We demonstrated the curry function, which generates functions.

• We showed several examples of the use of closures as arguments to iterators.