saberbud/ceres-solver
1
0
Fork 0
mirror of https://github.com/ceres-solver/ceres-solver.git synced 2026-08-30 00:50:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

More C++ification.

Browse Source 
"> >" -> ">>"
"> > >" -> ">>>"

Change-Id: Id1ddd9dbf030fe21d57207741b4ca8403068e55b
This commit is contained in:
Sameer Agarwal
2018-04-03 10:41:01 -07:00
parent af77d3e676
commit e49507cbea
47 changed files with 110 additions and 108 deletions
Download Patch File Download Diff File Expand all files Collapse all files
include/ceres/ordered_groups.h
+5 -5
View File
@@ -126,9 +126,9 @@ class OrderedGroups {
return;
}
typename std::map<int, std::set<T> >::reverse_iterator it =
typename std::map<int, std::set<T>>::reverse_iterator it =
group_to_elements_.rbegin();
std::map<int, std::set<T> > new_group_to_elements;
std::map<int, std::set<T>> new_group_to_elements;
new_group_to_elements[it->first] = it->second;
int new_group_id = it->first + 1;
@@ -165,7 +165,7 @@ class OrderedGroups {
// This function always succeeds, i.e., implicitly there exists a
// group for every integer.
int GroupSize(const int group) const {
typename std::map<int, std::set<T> >::const_iterator it =
typename std::map<int, std::set<T>>::const_iterator it =
group_to_elements_.find(group);
return (it == group_to_elements_.end()) ? 0 : it->second.size();
}
@@ -187,7 +187,7 @@ class OrderedGroups {
return group_to_elements_.begin()->first;
}
const std::map<int, std::set<T> >& group_to_elements() const {
const std::map<int, std::set<T>>& group_to_elements() const {
return group_to_elements_;
}
@@ -196,7 +196,7 @@ class OrderedGroups {
}
private:
std::map<int, std::set<T> > group_to_elements_;
std::map<int, std::set<T>> group_to_elements_;
std::map<T, int> element_to_group_;
};