Go to the documentation of this file.
26 using namespace gtsam;
80 actual.
augment(fg2, newIndices);
107 std::list<Key> unusedVariables{0, 9};
134 std::list<Key> unusedVariables{0, 9};
void push_factor(Key key)
static int runAllTests(TestResult &result)
std::shared_ptr< This > shared_ptr
#define EXPECT(condition)
void augment(const FG &factors, const FactorIndices *newFactorIndices=nullptr)
TEST(VariableIndex, augment)
SymbolicFactorGraph testGraph2()
size_t nEntries() const
The number of nonzero blocks, i.e. the number of variable-factor entries.
SymbolicFactorGraph testGraph1()
void remove(ITERATOR firstFactor, ITERATOR lastFactor, const FG &factors)
Provides additional testing facilities for common data structures.
void removeUnusedVariables(ITERATOR firstKey, ITERATOR lastKey)
Remove unused empty variables (in debug mode verifies they are empty).
size_t nFactors() const
The number of factors in the original factor graph.
IsDerived< DERIVEDFACTOR > push_back(std::shared_ptr< DERIVEDFACTOR > factor)
Add a factor directly using a shared_ptr.
size_t size() const
The number of variable entries. This is equal to the number of unique variable Keys.
bool assert_equal(const Matrix &expected, const Matrix &actual, double tol)
#define LONGS_EQUAL(expected, actual)
FastVector< FactorIndex > FactorIndices
Define collection types:
gtsam
Author(s):
autogenerated on Sun Dec 22 2024 04:17:41