commit a9d8ef847f643f9b7cf1270027d7c8744b5db585
author Sameer Agarwal <sameeragarwal@google.com> Mon May 14 02:28:05 2012 -0700
committer Sameer Agarwal <sameeragarwal@google.com> Mon May 14 02:28:05 2012 -0700
tree caac91b1eb070c2b1abe4c68a843c809b96f87c1
parent 921e8abbcd122efad5bbbd15605cc6b086805c53

1. Remove constant_sparsity from LinearSolver::Options. It introduces
unnecessarily complexity in the structure of linear solvers and preconditioners.
This is the first step towards cleaning up the Preconditioner interface.

2. Minor tweaks and cleanups to the various linear solvers.

internal/ceres/visibility_based_preconditioner_test.cc

diff --git a/internal/ceres/visibility_based_preconditioner_test.cc b/internal/ceres/visibility_based_preconditioner_test.cc
index 390f081..244d0b0 100644
--- a/internal/ceres/visibility_based_preconditioner_test.cc
+++ b/internal/ceres/visibility_based_preconditioner_test.cc
@@ -132,7 +132,7 @@
   }
 
   AssertionResult PreconditionerValuesMatch() {
-    preconditioner_->Compute(*A_, D_.get());
+    preconditioner_->Update(*A_, D_.get());
     const HashSet<pair<int, int> >& cluster_pairs = get_cluster_pairs();
     const BlockRandomAccessSparseMatrix* m = get_m();
     Matrix preconditioner_matrix;