commit a427c877f968d951b3cdcb5f5298deaf84647830
author Sameer Agarwal <sameeragarwal@google.com> Mon Jun 24 17:50:56 2013 -0700
committer Sameer Agarwal <sameeragarwal@google.com> Mon Jun 24 18:04:28 2013 -0700
tree 10b7f98bc634044fa70248bc7ca835c15e68791b
parent 6a7c1037d952dd0d98ac73cec9d9c697fc1990e9

Lint cleanup.

Change-Id: Ie489f1ff182d99251ed8c0728cc6ea8e1c262ce0

internal/ceres/incomplete_lq_factorization_test.cc

diff --git a/internal/ceres/incomplete_lq_factorization_test.cc b/internal/ceres/incomplete_lq_factorization_test.cc
index 0a43f02..1ed181f 100644
--- a/internal/ceres/incomplete_lq_factorization_test.cc
+++ b/internal/ceres/incomplete_lq_factorization_test.cc
@@ -110,14 +110,16 @@
   lmatrix->ToDenseMatrix(&actual_l_matrix);
 
   EXPECT_NEAR((expected_l_matrix * expected_l_matrix.transpose() -
-               actual_l_matrix * actual_l_matrix.transpose()).norm(), 0.0, 1e-10)
+               actual_l_matrix * actual_l_matrix.transpose()).norm(),
+              0.0,
+              1e-10)
       << "expected: \n" << expected_l_matrix
       << "\actual: \n" << actual_l_matrix;
 }
 
 TEST(IncompleteLQFactorization, DropEntriesAndAddRow) {
   // Allocate space and then make it a zero sized matrix.
-  CompressedRowSparseMatrix matrix(10,10, 100);
+  CompressedRowSparseMatrix matrix(10, 10, 100);
   matrix.set_num_rows(0);
 
   vector<pair<int, double> > scratch(10);