[SCM] Fast arithmetic with dense matrices over F_{2^e} branch, upstream, updated. 9faf6ece9a183a703670566609063ab274b1c544

[Martin Albrecht]

The following commit has been merged in the upstream branch:
commit 78016f7eff73c7a5c4a5011d3133f40729b717d9
Author: Martin Albrecht <martinralbrecht at googlemail.com>
Date:   Thu Aug 9 21:46:36 2012 +0100

    small bugfixes

diff --git a/Makefile.am b/Makefile.am
index a7ff76c..cea7cf3 100644
--- a/Makefile.am
+++ b/Makefile.am
@@ -46,7 +46,7 @@ TESTLIBADD = -lm4ri -lm4rie -lgivaro -lgmpxx -lgmp -lm -lstdc++
 TESTLDADD = ${M4RIE_GIVARO_LDFLAGS}
 TESTLDFLAGS =
 
-check_PROGRAMS = test_trsm test_elimination test_multiplication test_smallops test_ple test_gf2e
+check_PROGRAMS = test_trsm test_elimination test_multiplication test_smallops test_ple
 test_elimination_SOURCES = tests/test_elimination.cc tests/testing.h
 test_elimination_LDADD =  ${TESTLDADD} ${TESTLIBADD}
 test_elimination_LDFLAGS = ${TESTLDFLAGS}
diff --git a/src/newton_john.c b/src/newton_john.c
index 754c7f2..c86545c 100644
--- a/src/newton_john.c
+++ b/src/newton_john.c
@@ -555,7 +555,7 @@ void mzed_trsm_upper_left_newton_john(const mzed_t *U, mzed_t *B) {
 }
 
 void mzd_slice_trsm_lower_left_newton_john(const mzd_slice_t *L, mzd_slice_t *B) {
-  assert(B->x[0]->offset = 0);
+  assert(B->x[0]->offset == 0);
   assert(L->finite_field == B->finite_field);
   assert(L->nrows == L->ncols);
   assert(B->nrows == L->ncols);
@@ -581,7 +581,7 @@ void mzd_slice_trsm_lower_left_newton_john(const mzd_slice_t *L, mzd_slice_t *B)
 }
 
 void mzd_slice_trsm_upper_left_newton_john(const mzd_slice_t *U, mzd_slice_t *B) {
-  assert(B->x[0]->offset = 0);
+  assert(B->x[0]->offset == 0);
   assert(U->finite_field == B->finite_field);
   assert(U->nrows == U->ncols);
   assert(B->nrows == U->ncols);

-- 
Fast arithmetic with dense matrices over F_{2^e}