Allow iteration over available file names

Your example program included an unimplemented `entries` method.  I
chose not to implement `entries` because iterating over it would require
decompressing any large files stored in the map.

Instead, I've provided a `file_names` API that provides just the names
of the files in the map, which the caller can look up (and potentially
decompress) if they wish.

I implemented a custom iterator wrapper to hide the implementation
details from the caller.

1 files changed, 21 insertions, 0 deletions

diff --git a/lib/src/lib.rs b/lib/src/lib.rs
index ce1e2ec..57d3610 100644
--- a/lib/src/lib.rs
+++ b/lib/src/lib.rs
@@ -37,6 +37,12 @@ impl Files {
         self.files.contains_key(path)
     }
 
+    /// Returns an iterator over all available file names.  Does not
+    /// decompress any compressed data.
+    pub fn file_names(&self) -> FileNames {
+        FileNames { iter: self.files.keys() }
+    }
+
     pub fn get(&self, path: &str) -> io::Result<Cow<'static, [u8]>> {
         let key = as_key(path);
         match self.files.get(key.borrow() as &str) {
@@ -83,3 +89,18 @@ impl Files {
         }
     }
 }
+
+/// Iterates over the file names available for `Files` object.
+pub struct FileNames<'a> {
+    /// Our internal iterator.  We wrap this in a nice struct so our
+    /// caller doesn't need to know the details.
+    iter: phf::map::Keys<'a, &'static str, (Compression, &'static [u8])>,
+}
+
+impl<'a> Iterator for FileNames<'a> {
+    type Item = &'static str;
+
+    fn next(&mut self) -> Option<Self::Item> {
+        self.iter.next().map(|s| *s)
+    }
+}