commit | a1458f334843d5e193c8f9b017f963e3c9f9b26f | [log] [tgz] |
---|---|---|
author | Sameer Agarwal <sameeragarwal@google.com> | Thu Mar 29 22:01:29 2018 -0700 |
committer | Sameer Agarwal <sameeragarwal@google.com> | Fri Mar 30 12:03:28 2018 -0700 |
tree | 8880a67817048491a8091c5cf7e97f1cf21218ba | |
parent | ffae101c755d283919d6c15f1336cbc8fb724ac3 [diff] |
More C++11ification. 1. Replace HashMap and HashSet with std::unordered_map and std::unordered_set respectively. 2. Extract the pair hasher into a struct pair_hash. 3. Delete collections_port.h 4. Convert explicit iterator based loops to auto based loops where sensible. Change-Id: Ib88bcd13a7463d18435639d3b771abaa52080efb
Ceres Solver is an open source C++ library for modeling and solving large, complicated optimization problems. It is a feature rich, mature and performant library which has been used in production at Google since 2010. Ceres Solver can solve two kinds of problems.
Please see ceres-solver.org for more information.
Ceres development happens on Gerrit, including both repository hosting and code reviews. The GitHub Repository is a continuously updated mirror which is primarily meant for issue tracking. Please see our Contributing to Ceres Guide for more details.
The upstream Gerrit repository is
https://ceres-solver.googlesource.com/ceres-solver