mirror of
https://github.com/biergaizi/codecrypt
synced 2024-06-16 03:48:19 +00:00
66 lines
1.8 KiB
C++
66 lines
1.8 KiB
C++
|
|
/*
|
|
* This file is part of Codecrypt.
|
|
*
|
|
* Copyright (C) 2013-2016 Mirek Kratochvil <exa.exa@gmail.com>
|
|
*
|
|
* Codecrypt is free software: you can redistribute it and/or modify it
|
|
* under the terms of the GNU Lesser General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or (at
|
|
* your option) any later version.
|
|
*
|
|
* Codecrypt is distributed in the hope that it will be useful, but WITHOUT
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
|
|
* License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
* along with Codecrypt. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include "ios.h"
|
|
|
|
std::ostream& operator<< (std::ostream&o, const polynomial& p)
|
|
{
|
|
o << "polynomial degree " << p.degree() << ": ";
|
|
for (int i = 0, e = p.degree(); i <= e; ++i) o << p[i] << ' ';
|
|
o << std::endl;
|
|
return o;
|
|
}
|
|
|
|
std::ostream& operator<< (std::ostream&o, const permutation& p)
|
|
{
|
|
o << "permutation over " << p.size() << " elements: ";
|
|
for (uint i = 0; i < p.size(); ++i) o << p[i] << ' ';
|
|
o << std::endl;
|
|
return o;
|
|
}
|
|
|
|
std::ostream& operator<< (std::ostream&o, const gf2m& f)
|
|
{
|
|
o << "GF(2^" << f.m << ") of " << f.n << " elements, modulus " << f.poly << std::endl;
|
|
return o;
|
|
}
|
|
|
|
std::ostream& operator<< (std::ostream&o, const matrix& m)
|
|
{
|
|
uint i, j, h, w;
|
|
h = m.height();
|
|
w = m.width();
|
|
o << "binary " << h << "x" << w << " matrix:" << std::endl;
|
|
for (i = 0; i < h; ++i) {
|
|
for (j = 0; j < w; ++j) o << m[j][i];
|
|
o << std::endl;
|
|
}
|
|
return o;
|
|
}
|
|
|
|
std::ostream& operator<< (std::ostream&o, const bvector& v)
|
|
{
|
|
o << "vector of " << v.size() << " elements: ";
|
|
for (uint i = 0, e = v.size(); i < e; ++i) o << v[i];
|
|
o << std::endl;
|
|
return o;
|
|
}
|
|
|