* Any outstanding write must have finished before the file can be closed.

* The "queue" data structure actually implements a set anyway and will
  be renamed subsequently.

* The "index" is now a member of the "enqueued" struct.
* The search operation uses a predicate passed as function pointer.