pub fn min_depth(mut self, depth: usize) -> Self {
        self.opts.min_depth = depth;
        if self.opts.min_depth > self.opts.max_depth {
            self.opts.min_depth = self.opts.max_depth;
        }
        self
    }
/// Set the minimum depth of entries yielded by the iterator.
///
/// The smallest depth is `0` and always corresponds to the path given
/// to the `new` function on this type. Its direct descendents have depth
/// `1`, and their descendents have depth `2`, and so on.
Set the minimum depth of entries yielded by the iterator.
The smallest depth is `0` and always corresponds to the path given
to the `new` function on this type. Its direct descendents have depth
`1`, and their descendents have depth `2`, and so on.
Set the minimum depth of entries yielded by the iterator . The smallest depth is ` 0 ` and always corresponds to the path given to the ` new ` function on this type . Its direct descendents have depth ` 1 ` and their descendents have depth ` 2 ` and so on .
pub fn min_depth(mut self, depth: usize) -> Self {
        self.opts.min_depth = depth;
        if self.opts.min_depth > self.opts.max_depth {
            self.opts.min_depth = self.opts.max_depth;
        }
        self
    }
pub fn min_depth ( mut self , depth : usize ) -> Self { self . opts . min_depth = depth ; if self . opts . min_depth > self . opts . max_depth { self . opts . min_depth = self . opts . max_depth ; } self }
Set the minimum depth of entries yielded by the iterator.
Set the minimum depth of entries yielded by the iterator .
mut self
depth
usize
mut self
depth
usize