2010/1/4 Tim Newsham <news...@lava.net>: > someone mentioned in the thread that it would be nice to be able > to walk directory trees in breadth-first manner: > http://www.thenewsh.com/~newsham/x/9/walk.c
that's potentially useful, thanks. BTW, any robust file tree walker in plan 9 should cope with cycles in the tree. maybe just a linear list of parents with refcounted nodes might work best for this implementation. something like the attached modification to walk.c, perhaps? walk.c should also eliminate duplicate entries from union mounts - either by sorting the directory entries or using a little hash table of names for each directory. or... use a scape tree?
walk.c
Description: Binary data
