fn determine_spaces_between_keys_v(&mut self) -> bool {
        let height = self.v_keys.len();
        let mut progress = false;
        for i in 0..height {
            let len = self.v_keys[i].len();
            let mut prev_lower_bound = self.v_keys[i][0].lower_bound;
            for j in 1..len {
                if self.v_keys[i][j].upper_bound > prev_lower_bound {
                    for n in prev_lower_bound..self.v_keys[i][j].upper_bound {
                        if matches!(self.grid[i][n].cell_state, Status::Unknown) {
                            self.grid[i][n].cell_state = Status::Empty;
                            progress = true;
                        }
                    }
                }
                prev_lower_bound = self.v_keys[i][j].lower_bound;
            }
        }
        progress
    }
//Marks spaces between keys in a key set if their bounds don't intersect
Marks spaces between keys in a key set if their bounds don't intersect
Marks spaces between keys in a key set if their bounds don ' t intersect
fn determine_spaces_between_keys_v(&mut self) -> bool {
        let height = self.v_keys.len();
        let mut progress = false;
        for i in 0..height {
            let len = self.v_keys[i].len();
            let mut prev_lower_bound = self.v_keys[i][0].lower_bound;
            for j in 1..len {
                if self.v_keys[i][j].upper_bound > prev_lower_bound {
                    for n in prev_lower_bound..self.v_keys[i][j].upper_bound {
                        if matches!(self.grid[i][n].cell_state, Status::Unknown) {
                            self.grid[i][n].cell_state = Status::Empty;
                            progress = true;
                        }
                    }
                }
                prev_lower_bound = self.v_keys[i][j].lower_bound;
            }
        }
        progress
    }
fn determine_spaces_between_keys_v ( & mut self ) -> bool { let height = self . v_keys . len ( ) ; let mut progress = false ; for i in 0 .. height { let len = self . v_keys [ i ] . len ( ) ; let mut prev_lower_bound = self . v_keys [ i ] [ 0 ] . lower_bound ; for j in 1 .. len { if self . v_keys [ i ] [ j ] . upper_bound > prev_lower_bound { for n in prev_lower_bound .. self . v_keys [ i ] [ j ] . upper_bound { if matches ! ( self grid [ i ] [ n ] cell_state Status Unknown ) { self . grid [ i ] [ n ] . cell_state = Status :: Empty ; progress = true ; } } } prev_lower_bound = self . v_keys [ i ] [ j ] . lower_bound ; } } progress }
Marks spaces between keys in a key set if their bounds don't intersect
Marks spaces between keys in a key set if their bounds don ' t intersect
&mut self
&mut self