1.1 --- a/TODO	Mon Sep 03 14:38:31 2007 -0400
     1.2 +++ b/TODO	Tue Sep 04 23:51:06 2007 -0400
     1.3 @@ -33,5 +33,19 @@
     1.4    less I/O as we will expect to find the string within the block we
     1.5    look up with the hash function.
     1.6  
     1.7 +- represent all files as a breadth first traversal of the tree of all
     1.8 +  files.  each entry has its name (string pool index), the number of
     1.9 +  immediate children, total number of children, and owning package.
    1.10 +  for files both these numbers are zero.  a file is identified by its
    1.11 +  index in this flattened tree.
    1.12 +
    1.13 +  to get the file name from an index, we search through the list.  by
    1.14 +  summing up the number of children, we know when to skip a directory
    1.15 +  and when to descend into one.  as we go we accumulate the path
    1.16 +  elements.
    1.17 +
    1.18 +  hmm, dropping number of immediate children and using a sentinel drops
    1.19 +  a word from every entry.
    1.20 +
    1.21  - signed pkgs
    1.22  - gzip pkg xml files somehow?