mirror of https://github.com/bsnes-emu/bsnes.git
57 lines
1.1 KiB
C++
57 lines
1.1 KiB
C++
#pragma once
|
|
|
|
//burrows-wheeler transform
|
|
|
|
#include <nall/suffix-array.hpp>
|
|
|
|
namespace nall { namespace Decode {
|
|
|
|
inline auto BWT(const void* data) -> vector<uint8_t> {
|
|
auto input = (const uint8_t*)data;
|
|
vector<uint8_t> output;
|
|
|
|
uint size = 0;
|
|
for(uint byte : range(8)) size |= *input++ << byte * 8;
|
|
output.resize(size);
|
|
|
|
uint I = 0;
|
|
for(uint byte : range(8)) I |= *input++ << byte * 8;
|
|
|
|
auto suffixes = new int[size];
|
|
suffix_array(suffixes, input, size);
|
|
|
|
auto L = input;
|
|
auto F = new uint8_t[size];
|
|
for(uint byte : range(size)) F[byte] = L[suffixes[byte]];
|
|
|
|
delete[] suffixes;
|
|
|
|
uint64_t K[256] = {};
|
|
auto C = new int[size];
|
|
for(uint i : range(size)) {
|
|
C[i] = K[L[i]];
|
|
K[L[i]]++;
|
|
}
|
|
|
|
int M[256];
|
|
memory::fill<int>(M, 256, -1);
|
|
for(uint i : range(size)) {
|
|
if(M[F[i]] == -1) M[F[i]] = i;
|
|
}
|
|
|
|
uint i = I;
|
|
for(uint j : reverse(range(size))) {
|
|
output[j] = L[i];
|
|
i = C[i] + M[L[i]];
|
|
}
|
|
|
|
return output;
|
|
}
|
|
|
|
template<typename T>
|
|
inline auto BWT(const vector<T>& buffer) -> vector<uint8_t> {
|
|
return move(BWT(buffer.data()));
|
|
}
|
|
|
|
}}
|