From b54fcb9bf38625885700c8529f37a80c0a3dcd27 Mon Sep 17 00:00:00 2001
From: Mirek Kratochvil <exa.exa@gmail.com>
Date: Tue, 15 May 2012 22:09:19 +0200
Subject: [PATCH] more cleaniness

---
 lib/mce.cpp        |  4 ++--
 lib/polynomial.cpp | 16 ++++++++--------
 src/main.cpp       |  2 +-
 3 files changed, 11 insertions(+), 11 deletions(-)

diff --git a/lib/mce.cpp b/lib/mce.cpp
index e9a23b5..07edf86 100644
--- a/lib/mce.cpp
+++ b/lib/mce.cpp
@@ -72,6 +72,7 @@ int privkey::decrypt (const bvector&in, bvector&out)
 	//prepare for decoding
 	permutation hpermInv;
 	hperm.compute_inversion (hpermInv);
+
 	bvector canonical, syndrome;
 	hpermInv.permute (not_permuted, canonical);
 	h.mult_vec_right (canonical, syndrome);
@@ -80,8 +81,7 @@ int privkey::decrypt (const bvector&in, bvector&out)
 	bvector ev;
 	syndrome_decode (syndrome, fld, g, sqInv, ev);
 
-	std::cout << "ERRORS " << ev;
-	//check the error vector. It should have exactly t == deg(g) errors
+	// check the error vector, it should have exactly t == deg (g) errors
 	if ( (int) ev.hamming_weight() != g.degree() )
 		return 1;
 
diff --git a/lib/polynomial.cpp b/lib/polynomial.cpp
index 5e0f1e4..433bbcf 100644
--- a/lib/polynomial.cpp
+++ b/lib/polynomial.cpp
@@ -230,9 +230,9 @@ void polynomial::compute_goppa_check_matrix (matrix&r, gf2m&fld)
 		col.resize (2);
 		col[0] = i;
 		col[1] = 1;
-		col.inv(*this,fld);
+		col.inv (*this, fld);
 		//i-th row of the check matrix is polynomial 1/(x-i)
-		r[i].from_poly(col,fld);
+		r[i].from_poly (col, fld);
 	}
 }
 
@@ -285,7 +285,7 @@ void polynomial::div (polynomial&p, polynomial&m, gf2m&fld)
 
 	s0.clear();
 
-	s1.swap(*this);
+	s1.swap (*this);
 	s1.mod (m, fld);
 
 	while (r1.degree() >= 0) {
@@ -302,13 +302,13 @@ void polynomial::div (polynomial&p, polynomial&m, gf2m&fld)
 		s1.swap (s2);
 	}
 
-	this->swap(s0);
+	this->swap (s0);
 
 	//scalar divide by r0 head
-	if(r0.degree()<0) return;
-	uint c=r0[r0.degree()];
-	c=fld.inv(c);
-	for(uint i=0;i<size();++i) item(i) = fld.mult(item(i),c);
+	if (r0.degree() < 0) return;
+	uint c = r0[r0.degree() ];
+	c = fld.inv (c);
+	for (uint i = 0; i < size(); ++i) item (i) = fld.mult (item (i), c);
 }
 
 void polynomial::divmod (polynomial&d, polynomial&res, polynomial&rem, gf2m&fld)
diff --git a/src/main.cpp b/src/main.cpp
index 6fc9c3f..42befdc 100644
--- a/src/main.cpp
+++ b/src/main.cpp
@@ -39,7 +39,7 @@ int main()
 	cout << pub.G;
 
 	ccr::bvector plain;
-	plain.resize (pub.plain_size() );
+	plain.resize (pub.plain_size(), 0);
 	plain[0] = 1;
 	plain[1] = 1;
 	plain[2] = 1;