* vectorize dot product, copying code from sum.

* make the conj functor vectorizable: it is just identity in real case,
  and complex doesn't use the vectorized path anyway.
* fix bug in Block: a 3x1 block in a 4x4 matrix (all fixed-size)
  should not be vectorizable, since in fixed-size we are assuming
  the size to be a multiple of packet size. (Or would you prefer
  Vector3d to be flagged "packetaccess" even though no packet access
  is possible on vectors of that type?)
* rename:
  isOrtho for vectors ---> isOrthogonal
  isOrtho for matrices ---> isUnitary
* add normalize()
* reimplement normalized with quotient1 functor

1 files changed, 0 insertions, 3 deletions

diff --git a/test/adjoint.cpp b/test/adjoint.cpp
index 9a15c4986..cfcf1f0a5 100644
--- a/test/adjoint.cpp
+++ b/test/adjoint.cpp
@@ -56,9 +56,6 @@ template<typename MatrixType> void adjoint(const MatrixType& m)
   VERIFY_IS_APPROX(m1.adjoint().conjugate().transpose(),    m1);
 
   // check multiplicative behavior
-  std::cout << (m1.adjoint() * m2).adjoint() << std::endl;
-  std::cout << "------------------------------" << std::endl;
-  std::cout << m2.adjoint() * m1 << std::endl;
   VERIFY_IS_APPROX((m1.adjoint() * m2).adjoint(),           m2.adjoint() * m1);
   VERIFY_IS_APPROX((s1 * m1).adjoint(),                     ei_conj(s1) * m1.adjoint());