12345qiupeng
/
gtsam
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

added getOrdering unit test

release/4.3a0
Manohar Paluri 2009-12-09 15:25:50 +00:00
parent e43548d03a
commit f764772106
1 changed files with 13 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
cpp/testNonlinearFactorGraph.cpp
View File

@ -10,6 +10,9 @@
#include <iostream>
using namespace std;
#include <boost/assign/std/list.hpp>
using namespace boost::assign;
#include <CppUnitLite/TestHarness.h>
#include "Matrix.h"
@ -22,7 +25,6 @@ using namespace gtsam;
/* ************************************************************************* */
TEST( ExampleNonlinearFactorGraph, equals )
{
ExampleNonlinearFactorGraph fg = createNonlinearFactorGraph();
ExampleNonlinearFactorGraph fg2 = createNonlinearFactorGraph();
CHECK( fg.equals(fg2) );
@ -32,7 +34,6 @@ TEST( ExampleNonlinearFactorGraph, equals )
TEST( ExampleNonlinearFactorGraph, error )
{
ExampleNonlinearFactorGraph fg = createNonlinearFactorGraph();
VectorConfig c1 = createConfig();
double actual1 = fg.error(c1);
DOUBLES_EQUAL( 0.0, actual1, 1e-9 );
@ -42,6 +43,16 @@ TEST( ExampleNonlinearFactorGraph, error )
DOUBLES_EQUAL( 5.625, actual2, 1e-9 );
}
/* ************************************************************************* */
TEST( ExampleNonlinearFactorGraph, GET_ORDERING)
{
Ordering expected;
expected += "l1","x1","x2";
ExampleNonlinearFactorGraph nlfg = createNonlinearFactorGraph();
Ordering actual = nlfg.getOrdering();
CHECK(assert_equal(expected,actual));
}
/* ************************************************************************* */
TEST( ExampleNonlinearFactorGraph, probPrime )
{