Implement the builder pattern

Author: joshchoo

src/lib.rs

@@ -10,12 +10,12 @@ pub struct MissingBlobs {
 }
 
 impl MissingBlobs {
-    /// Creates a new MissingBlobs with the given configuration.
-    pub fn new(recursive: bool) -> Self {
-        Self { recursive }
+    /// Creates a new MissingBlobs builder.
+    pub fn builder() -> MissingBlobsBuilder {
+        MissingBlobsBuilder::default()
     }
 
-    /// Searches for blobs in given paths, and display missing dependencies.
+    /// Searches for blobs in the given paths, and displays missing dependencies.
     pub fn run(&self, paths: &[&str]) {
         let file_paths: Vec<PathBuf> = if self.recursive {
             find_files_recursively(&paths)
@@ -38,6 +38,32 @@ impl MissingBlobs {
     }
 }
 
+/// The MissingBlobs builder.
+pub struct MissingBlobsBuilder {
+    recursive: bool,
+}
+
+impl Default for MissingBlobsBuilder {
+    fn default() -> Self {
+        Self { recursive: false }
+    }
+}
+
+impl MissingBlobsBuilder {
+    /// Builds a MissingBlobs.
+    pub fn build(&self) -> MissingBlobs {
+        MissingBlobs {
+            recursive: self.recursive,
+        }
+    }
+
+    /// Sets whether to search paths recursively.
+    pub fn recursive(mut self, enable: bool) -> Self {
+        self.recursive = enable;
+        self
+    }
+}
+
 fn find_files(paths: &[&str]) -> Vec<PathBuf> {
     let dirs = paths
         .iter()

src/main.rs

@@ -22,5 +22,8 @@ fn main() {
     let paths = matches.values_of("PATHS").unwrap().collect::<Vec<_>>();
     let recursive = matches.is_present("recursive");
 
-    MissingBlobs::new(recursive).run(&paths);
+    MissingBlobs::builder()
+        .recursive(recursive)
+        .build()
+        .run(&paths);
 }