1
0
mirror of https://github.com/biergaizi/codecrypt synced 2024-07-20 09:56:00 +00:00
codecrypt/lib/permutation.cpp

48 lines
927 B
C++
Raw Normal View History

2012-04-01 11:51:59 +00:00
#include "codecrypt.h"
using namespace ccr;
2012-04-05 11:52:42 +00:00
void permutation::compute_inversion (permutation&r) const
2012-04-01 11:51:59 +00:00
{
2012-04-01 18:52:46 +00:00
r.resize (size(), 0);
for (uint i = 0; i < size(); ++i)
r[item (i) ] = i;
2012-04-01 11:51:59 +00:00
}
void permutation::generate_random (uint size, prng&rng)
{
2012-04-01 18:52:46 +00:00
resize (size, 0);
uint i;
for (i = 0; i < size; ++i) item (i) = i;
//knuth shuffle
for (i = size - 1; i > 0; --i) {
uint j = rng.random (i + 1);
if (i != j) {
uint t = item (i);
item (i) = item (j);
item (j) = t;
}
}
2012-04-01 11:51:59 +00:00
}
2012-04-05 11:52:42 +00:00
void permutation::permute (const bvector&a, bvector&r) const
2012-04-01 11:51:59 +00:00
{
2012-04-01 18:52:46 +00:00
r.resize (a.size() );
for (uint i = 0; i < size(); ++i) r[item (i) ] = a[i];
}
2012-04-01 11:51:59 +00:00
2012-04-05 11:52:42 +00:00
void permutation::permute (const matrix&a, matrix&r) const
2012-04-01 18:52:46 +00:00
{
r.resize (a.size() );
for (uint i = 0; i < size(); ++i) r[item (i) ] = a[i];
2012-04-01 11:51:59 +00:00
}
2012-04-05 11:52:42 +00:00
void permutation::permute_rows (const matrix&a, matrix&r) const
2012-04-01 11:51:59 +00:00
{
2012-04-01 18:52:46 +00:00
r.resize (a.size() );
for (uint i = 0; i < a.size(); ++i) permute (a[i], r[i]);
2012-04-01 11:51:59 +00:00
}