Mirror/aicodix___code
1
0
Fork 0
mirror of https://github.com/aicodix/code.git synced 2026-04-27 22:35:44 +00:00
Code Issues Projects Releases Packages Wiki Activity

use value_type

Browse source
This commit is contained in:
Ahmet Inan 2018-09-22 19:56:52 +02:00
commit 42ff499e23
4 changed files with 36 additions and 36 deletions
Download patch file Download diff file Expand all files Collapse all files

34
tests/rs_decoder_test.cc
View file

@ -20,14 +20,14 @@ int main()
typedef CODE::ReedSolomonDecoder<4, 0, GF> RS;
GF instance;
RS decode;
uint8_t target[RS::N] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 3, 3, 12, 12 };
uint8_t code[RS::N];
RS::value_type target[RS::N] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 3, 3, 12, 12 };
RS::value_type code[RS::N];
for (int i = 0; i < RS::N; ++i)
code[i] = target[i];
std::uniform_int_distribution<uint8_t> distribution(0, RS::N-1);
auto noise = std::bind(distribution, generator);
auto pos = std::bind(std::uniform_int_distribution<RS::value_type>(0, RS::N-1), generator);
auto val = std::bind(std::uniform_int_distribution<RS::value_type>(0, RS::N), generator);
for (int i = 0; i < 2; ++i)
code[noise()] = noise();
code[pos()] = val();
decode(code);
for (int i = 0; i < RS::N; ++i)
assert(code[i] == target[i]);
@ -38,19 +38,19 @@ int main()
typedef CODE::ReedSolomonDecoder<16, 0, GF> RS;
GF instance;
RS decode;
uint8_t target[RS::N];
RS::value_type target[RS::N];
for (int i = 0; i < RS::K; ++i)
target[i] = i + 1;
uint8_t parity[RS::NP] = { 1, 126, 147, 48, 155, 224, 3, 157, 29, 226, 40, 114, 61, 30, 244, 75 };
RS::value_type parity[RS::NP] = { 1, 126, 147, 48, 155, 224, 3, 157, 29, 226, 40, 114, 61, 30, 244, 75 };
for (int i = 0; i < RS::NP; ++i)
target[RS::K+i] = parity[i];
uint8_t code[RS::N];
RS::value_type code[RS::N];
for (int i = 0; i < RS::N; ++i)
code[i] = target[i];
std::uniform_int_distribution<uint8_t> distribution(0, RS::N-1);
auto noise = std::bind(distribution, generator);
auto pos = std::bind(std::uniform_int_distribution<RS::value_type>(0, RS::N-1), generator);
auto val = std::bind(std::uniform_int_distribution<RS::value_type>(0, RS::N), generator);
for (int i = 0; i < 8; ++i)
code[noise()] = noise();
code[pos()] = val();
decode(code);
for (int i = 0; i < RS::N; ++i)
assert(code[i] == target[i]);
@ -61,19 +61,19 @@ int main()
typedef CODE::ReedSolomonDecoder<64, 1, GF> RS;
GF *instance = new GF();
RS *decode = new RS();
uint16_t *target = new uint16_t[RS::N];
RS::value_type *target = new RS::value_type[RS::N];
for (int i = 0; i < RS::K; ++i)
target[i] = i + 1;
uint16_t parity[RS::NP] = { 25271, 26303, 22052, 31318, 31233, 6076, 40148, 29468, 47507, 32655, 12404, 13265, 23901, 38403, 50967, 50433, 40818, 226, 62296, 23636, 56393, 12952, 11476, 44416, 518, 50014, 10037, 57582, 33421, 42654, 54025, 7157, 4826, 52148, 17167, 23294, 6427, 40953, 11168, 35305, 18209, 1868, 39971, 54928, 27566, 1424, 4846, 25347, 34710, 42190, 56452, 21859, 49805, 28028, 41657, 25756, 22014, 24479, 28758, 17438, 12976, 61743, 46735, 1557 };
RS::value_type parity[RS::NP] = { 25271, 26303, 22052, 31318, 31233, 6076, 40148, 29468, 47507, 32655, 12404, 13265, 23901, 38403, 50967, 50433, 40818, 226, 62296, 23636, 56393, 12952, 11476, 44416, 518, 50014, 10037, 57582, 33421, 42654, 54025, 7157, 4826, 52148, 17167, 23294, 6427, 40953, 11168, 35305, 18209, 1868, 39971, 54928, 27566, 1424, 4846, 25347, 34710, 42190, 56452, 21859, 49805, 28028, 41657, 25756, 22014, 24479, 28758, 17438, 12976, 61743, 46735, 1557 };
for (int i = 0; i < RS::NP; ++i)
target[RS::K+i] = parity[i];
uint16_t *code = new uint16_t[RS::N];
RS::value_type *code = new RS::value_type[RS::N];
for (int i = 0; i < RS::N; ++i)
code[i] = target[i];
std::uniform_int_distribution<uint16_t> distribution(0, RS::N-1);
auto noise = std::bind(distribution, generator);
auto pos = std::bind(std::uniform_int_distribution<RS::value_type>(0, RS::N-1), generator);
auto val = std::bind(std::uniform_int_distribution<RS::value_type>(0, RS::N), generator);
for (int i = 0; i < 32; ++i)
code[noise()] = noise();
code[pos()] = val();
(*decode)(code);
for (int i = 0; i < RS::N; ++i)
assert(code[i] == target[i]);