cleanup
parent
52c8034d41
commit
e0e833c2fc
|
@ -61,8 +61,6 @@ class GTSAM_EXPORT DiscreteLookupTable : public DiscreteConditional {
|
||||||
* @param nFrontals number of frontal variables
|
* @param nFrontals number of frontal variables
|
||||||
* @param keys a sorted list of gtsam::Keys
|
* @param keys a sorted list of gtsam::Keys
|
||||||
* @param potentials Discrete potentials as a TableFactor.
|
* @param potentials Discrete potentials as a TableFactor.
|
||||||
*
|
|
||||||
* //TODO(Varun): Should accept a DiscreteFactor::shared_ptr
|
|
||||||
*/
|
*/
|
||||||
DiscreteLookupTable(size_t nFrontals, const DiscreteKeys& keys,
|
DiscreteLookupTable(size_t nFrontals, const DiscreteKeys& keys,
|
||||||
const TableFactor& potentials)
|
const TableFactor& potentials)
|
||||||
|
|
|
@ -180,10 +180,8 @@ DecisionTreeFactor TableFactor::toDecisionTreeFactor() const {
|
||||||
for (auto i = 0; i < sparse_table_.size(); i++) {
|
for (auto i = 0; i < sparse_table_.size(); i++) {
|
||||||
table.push_back(sparse_table_.coeff(i));
|
table.push_back(sparse_table_.coeff(i));
|
||||||
}
|
}
|
||||||
gttic_(toDecisionTreeFactor_Constructor);
|
|
||||||
// NOTE(Varun): This constructor is really expensive!!
|
// NOTE(Varun): This constructor is really expensive!!
|
||||||
DecisionTreeFactor f(dkeys, table);
|
DecisionTreeFactor f(dkeys, table);
|
||||||
gttoc_(toDecisionTreeFactor_Constructor);
|
|
||||||
return f;
|
return f;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue