In Listing 12-6, we added code that took a slice of String values and created an instance of the Config struct by indexing into the slice and cloning the values, allowing the Config struct to own those values. In Listing 13-17, we’ve reproduced the implementation of the Config::build function as it was in Listing 12-23:

    Filename: src/lib.rs

    Listing 13-17: Reproduction of the Config::build function from Listing 12-23

    At the time, we said not to worry about the inefficient clone calls because we would remove them in the future. Well, that time is now!

    We needed clone here because we have a slice with String elements in the parameter args, but the build function doesn’t own args. To return ownership of a Config instance, we had to clone the values from the query and filename fields of Config so the Config instance can own its values.

    With our new knowledge about iterators, we can change the build function to take ownership of an iterator as its argument instead of borrowing a slice. We’ll use the iterator functionality instead of the code that checks the length of the slice and indexes into specific locations. This will clarify what the Config::build function is doing because the iterator will access the values.

    Once Config::build takes ownership of the iterator and stops using indexing operations that borrow, we can move the String values from the iterator into Config rather than calling clone and making a new allocation.

    Using the Returned Iterator Directly

    Open your I/O project’s src/main.rs file, which should look like this:

    Filename: src/main.rs

    1. use std::env;
    2. use std::process;
    4. use minigrep::Config;
    6. fn main() {
    7.     let args: Vec<String> = env::args().collect();
    9.     let config = Config::build(&args).unwrap_or_else(|err| {
    10.         eprintln!("Problem parsing arguments: {err}");
    11.         process::exit(1);
    12.     });
    14.     // --snip--
    16.     if let Err(e) = minigrep::run(config) {
    17.         eprintln!("Application error: {e}");
    18.         process::exit(1);
    19.     }
    20. }

    We’ll first change the start of the main function that we had in Listing 12-24 to the code in Listing 13-18, which this time uses an iterator. This won’t compile until we update Config::build as well.

    Listing 13-18: Passing the return value of env::args to Config::build

    The env::args function returns an iterator! Rather than collecting the iterator values into a vector and then passing a slice to Config::build, now we’re passing ownership of the iterator returned from env::args to Config::build directly.

    Next, we need to update the definition of Config::build. In your I/O project’s src/lib.rs file, let’s change the signature of Config::build to look like Listing 13-19. This still won’t compile because we need to update the function body.

    Filename: src/lib.rs

    1. use std::env;
    2. use std::error::Error;
    3. use std::fs;
    5. pub struct Config {
    6.     pub query: String,
    7.     pub file_path: String,
    8.     pub ignore_case: bool,
    9. }
    11. impl Config {
    12.     pub fn build(
    13.         mut args: impl Iterator<Item = String>,
    14.     ) -> Result<Config, &'static str> {
    15.         // --snip--
    16.         if args.len() < 3 {
    17.             return Err("not enough arguments");
    18.         }
    20.         let query = args[1].clone();
    21.         let file_path = args[2].clone();
    23.         let ignore_case = env::var("IGNORE_CASE").is_ok();
    25.         Ok(Config {
    26.             query,
    27.             file_path,
    28.             ignore_case,
    29.         })
    30.     }
    31. }
    34.     let contents = fs::read_to_string(config.file_path)?;
    36.     let results = if config.ignore_case {
    37.     } else {
    38.         search(&config.query, &contents)
    39.     };
    41.     for line in results {
    42.         println!("{line}");
    43.     }
    45.     Ok(())
    46. }
    48. pub fn search<'a>(query: &str, contents: &'a str) -> Vec<&'a str> {
    49.     let mut results = Vec::new();
    51.     for line in contents.lines() {
    52.         if line.contains(query) {
    53.             results.push(line);
    54.         }
    55.     }
    57.     results
    58. }
    60. pub fn search_case_insensitive<'a>(
    61.     query: &str,
    62.     contents: &'a str,
    63. ) -> Vec<&'a str> {
    64.     let query = query.to_lowercase();
    65.     let mut results = Vec::new();
    67.     for line in contents.lines() {
    68.         if line.to_lowercase().contains(&query) {
    69.             results.push(line);
    70.         }
    71.     }
    73.     results
    74. }
    76. #[cfg(test)]
    77. mod tests {
    78.     use super::*;
    80.     #[test]
    81.     fn case_sensitive() {
    82.         let query = "duct";
    83.         let contents = "\
    84. Rust:
    85. safe, fast, productive.
    86. Pick three.
    87. Duct tape.";
    89.         assert_eq!(vec!["safe, fast, productive."], search(query, contents));
    90.     }
    92.     #[test]
    93.     fn case_insensitive() {
    94.         let query = "rUsT";
    95.         let contents = "\
    96. Rust:
    97. safe, fast, productive.
    98. Trust me.";
    100.         assert_eq!(
    101.             vec!["Rust:", "Trust me."],
    102.             search_case_insensitive(query, contents)
    103.         );
    104.     }
    105. }

    Listing 13-19: Updating the signature of Config::build to expect an iterator

    The standard library documentation for the env::args function shows that the type of the iterator it returns is std::env::Args, and that type implements the Iterator trait and returns String values.

    We’ve updated the signature of the Config::build function so the parameter args has a generic type with the trait bounds impl Iterator instead of &[String]. This usage of the impl Trait syntax we discussed in the section of Chapter 10 means that args can be any type that implements the Iterator type and returns String items.

    Because we’re taking ownership of args and we’ll be mutating by iterating over it, we can add the mut keyword into the specification of the args parameter to make it mutable.

    Next, we’ll fix the body of Config::build. Because args implements the Iterator trait, we know we can call the next method on it! Listing 13-20 updates the code from Listing 12-23 to use the next method:

    Filename: src/lib.rs

    Remember that the first value in the return value of env::args is the name of the program. We want to ignore that and get to the next value, so first we call next and do nothing with the return value. Second, we call next to get the value we want to put in the query field of Config. If next returns a Some, we use a match to extract the value. If it returns None, it means not enough arguments were given and we return early with an Err value. We do the same thing for the filename value.

    We can also take advantage of iterators in the search function in our I/O project, which is reproduced here in Listing 13-21 as it was in Listing 12-19:

    Filename: src/lib.rs

    1. use std::error::Error;
    2. use std::fs;
    4. pub struct Config {
    5.     pub query: String,
    6.     pub file_path: String,
    7. }
    9. impl Config {
    10.     pub fn build(args: &[String]) -> Result<Config, &'static str> {
    11.         if args.len() < 3 {
    12.             return Err("not enough arguments");
    13.         }
    15.         let query = args[1].clone();
    16.         let file_path = args[2].clone();
    18.         Ok(Config { query, file_path })
    19.     }
    20. }
    22. pub fn run(config: Config) -> Result<(), Box<dyn Error>> {
    23.     let contents = fs::read_to_string(config.file_path)?;
    25.     Ok(())
    26. }
    28. pub fn search<'a>(query: &str, contents: &'a str) -> Vec<&'a str> {
    29.     let mut results = Vec::new();
    31.     for line in contents.lines() {
    32.         if line.contains(query) {
    33.             results.push(line);
    34.         }
    35.     }
    37.     results
    38. }
    40. #[cfg(test)]
    41. mod tests {
    42.     use super::*;
    44.     #[test]
    45.     fn one_result() {
    46.         let query = "duct";
    47.         let contents = "\
    48. Rust:
    49. safe, fast, productive.
    50. Pick three.";
    52.         assert_eq!(vec!["safe, fast, productive."], search(query, contents));
    53.     }

    Listing 13-21: The implementation of the search function from Listing 12-19

    We can write this code in a more concise way using iterator adaptor methods. Doing so also lets us avoid having a mutable intermediate results vector. The functional programming style prefers to minimize the amount of mutable state to make code clearer. Removing the mutable state might enable a future enhancement to make searching happen in parallel, because we wouldn’t have to manage concurrent access to the results vector. Listing 13-22 shows this change:

    Filename: src/lib.rs

    Listing 13-22: Using iterator adaptor methods in the implementation of the search function

    Recall that the purpose of the search function is to return all lines in contents that contain the query. Similar to the filter example in Listing 13-16, this code uses the filter adaptor to keep only the lines that line.contains(query) returns true for. We then collect the matching lines into another vector with collect. Much simpler! Feel free to make the same change to use iterator methods in the search_case_insensitive function as well.

    The next logical question is which style you should choose in your own code and why: the original implementation in Listing 13-21 or the version using iterators in Listing 13-22. Most Rust programmers prefer to use the iterator style. It’s a bit tougher to get the hang of at first, but once you get a feel for the various iterator adaptors and what they do, iterators can be easier to understand. Instead of fiddling with the various bits of looping and building new vectors, the code focuses on the high-level objective of the loop. This abstracts away some of the commonplace code so it’s easier to see the concepts that are unique to this code, such as the filtering condition each element in the iterator must pass.

    But are the two implementations truly equivalent? The intuitive assumption might be that the more low-level loop will be faster. Let’s talk about performance.