"""Managing infinite sorted sequences of naturals, optionally cacheing them to disk.

Breaks up your infinite list (e.g. the list of primes, see ../../math/prime/)
into chunks and manages a tree whose leaves the client must provide but whose
branches are generic (and supplied with a call-back by which to populate
themselves - needs to distinguish cases 'from file', bounded gap, endless gap).

Modules:
 chunk -- Chunk base-class from which your leaves must inherit
 branch -- Branch handles the hierarchy of chunks
 disk -- diskChunk, diskBranch: cacheing infrastructure
 sequence -- top-level infinite list objects
 slicer -- accessing sub-ranges of the infinite list

$Id$
"""