55 lines
1.4 KiB
C++
55 lines
1.4 KiB
C++
|
/**
|
||
|
|
* @file Ordering.cpp
|
||
|
|
* @brief
|
||
|
|
* @author Richard Roberts
|
||
|
|
* @created Sep 2, 2010
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "Ordering.h"
|
||
|
|
|
||
|
|
#include <string>
|
||
|
|
#include <iostream>
|
||
|
|
#include <boost/foreach.hpp>
|
||
|
|
|
||
|
|
using namespace std;
|
||
|
|
|
||
|
|
namespace gtsam {
|
||
|
|
|
||
|
|
/* ************************************************************************* */
|
||
|
|
void Ordering::permuteWithInverse(const Permutation& inversePermutation) {
|
||
|
|
BOOST_FOREACH(Ordering::value_type& key_order, *this) {
|
||
|
|
key_order.second = inversePermutation[key_order.second];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* ************************************************************************* */
|
||
|
|
void Ordering::print(const string& str) const {
|
||
|
|
cout << str << " ";
|
||
|
|
BOOST_FOREACH(const Ordering::value_type& key_order, *this) {
|
||
|
|
if(key_order != *begin())
|
||
|
|
cout << ", ";
|
||
|
|
cout << (string)key_order.first << ":" << key_order.second;
|
||
|
|
}
|
||
|
|
cout << endl;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* ************************************************************************* */
|
||
|
|
bool Ordering::equals(const Ordering& rhs, double tol) const {
|
||
|
|
return order_ == rhs.order_;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* ************************************************************************* */
|
||
|
|
void Unordered::print(const string& s) const {
|
||
|
|
cout << s << " (" << size() << "):";
|
||
|
|
BOOST_FOREACH(varid_t key, *this)
|
||
|
|
cout << " " << key;
|
||
|
|
cout << endl;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* ************************************************************************* */
|
||
|
|
bool Unordered::equals(const Unordered &other, double tol) const {
|
||
|
|
return *this == other;
|
||
|
|
}
|
||
|
|
|
||
|
|
}
|