Automake the data files.

notes/chapter1.txt

@@ -132,6 +132,10 @@ Run times come in three flavours:
    and pop() operations. Show how, using only a FIFO Queue, q, you can
    reverse the order of all elements in s.
 
+   See src/ch01ex04.cc: you just pop each element from the stack → queue,
+   then pop the elements off the queue. If you wanted to reverse the stack
+   itself, you'd just push the elements back onto the stack.
+
 5. Using a USet, implement a Bag. A Bag is like a USet—it supports the add(x),
    remove(x) and find(x) methods—but it allows duplicate elements to be
    stored. The find(x) operation in a Bag returns some element (if any) that
@@ -148,4 +152,4 @@ Run times come in three flavours:
    remove(i) in your List implementation. Think about how you could improve
    the performance of the find(x) operation in your USet and SSet
    implementations. This exercise is designed to give you a feel for how
-   difficult it can be to obtain efficient implementations of these interfaces
+   difficult it can be to obtain efficient implementations of these interfaces