commit cbdeb79e913d2d2357cba0d17cf2192a8f2f6dd0
author Sameer Agarwal <sameeragarwal@google.com> Mon Apr 22 10:18:18 2013 -0700
committer Sameer Agarwal <sameeragarwal@google.com> Mon Apr 22 10:18:18 2013 -0700
tree ee5b9519cd43d84e4dcaa981192948e1458ff495
parent 36f4cd23b24391106e9f3c15b0f9bbcaafc47b20

Lint cleanup from William Rucklidge

Change-Id: Id8b99a2f557efe3744e95a3947f26cdc0c9c269e

include/ceres/solver.h

diff --git a/include/ceres/solver.h b/include/ceres/solver.h
index 97d082d..8e3fa58 100644
--- a/include/ceres/solver.h
+++ b/include/ceres/solver.h
@@ -372,7 +372,7 @@
     // In some rare cases, it is worth using a more complicated
     // reordering algorithm which has slightly better runtime
     // performance at the expense of an extra copy of the Jacobian
-    // // matrix. Setting use_postordering to true enables this tradeoff.
+    // matrix. Setting use_postordering to true enables this tradeoff.
     bool use_postordering;
 
     // Some non-linear least squares problems have additional