| 164 | } |
| 165 | |
| 166 | void RevBWT(size_t n, size_t start, uint8_t const * s, uint8_t * r) |
| 167 | { |
| 168 | if (n == 0) |
| 169 | return; |
| 170 | |
| 171 | FirstColumn first(n, s); |
| 172 | LastColumn last(n, start, s); |
| 173 | |
| 174 | auto curr = start + 1; |
| 175 | for (size_t i = 0; i < n; ++i) |
| 176 | { |
| 177 | ASSERT_LESS(curr, first.Size(), ()); |
| 178 | ASSERT(first[curr] != kEOS, ()); |
| 179 | |
| 180 | r[i] = first[curr]; |
| 181 | curr = last.Select(r[i], first.Rank(curr)); |
| 182 | } |
| 183 | |
| 184 | ASSERT_EQUAL(first[curr], kEOS, ()); |
| 185 | } |
| 186 | |
| 187 | void RevBWT(size_t start, std::string const & s, std::string & r) |
| 188 | { |