fn adjust_row_idx(&self, row_idx: usize, compressed: bool) -> usize {
        if compressed {
            row_idx & 1
        } else {
            row_idx
        }
    }
/// In case we don't need to backtrack the matching indices, we could use only 2 rows for the
/// matrix, this function could be used to rotate accessing these two rows.
In case we don't need to backtrack the matching indices, we could use only 2 rows for the
matrix, this function could be used to rotate accessing these two rows.
In case we don ' t need to backtrack the matching indices we could use only 2 rows for the matrix this function could be used to rotate accessing these two rows .
fn adjust_row_idx(&self, row_idx: usize, compressed: bool) -> usize {
        if compressed {
            row_idx & 1
        } else {
            row_idx
        }
    }
fn adjust_row_idx ( & self , row_idx : usize , compressed : bool ) -> usize { if compressed { row_idx & 1 } else { row_idx } }
In case we don't need to backtrack the matching indices, we could use only 2 rows for the
matrix, this function could be used to rotate accessing these two rows.
In case we don ' t need to backtrack the matching indices we could use only 2 rows for the matrix this function could be used to rotate accessing these two rows .
&self
row_idx
usize
compressed
bool