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

Removed unneeded derived class copy constructors and assignment operators

release/4.3a0
Richard Roberts 2013-08-08 21:41:28 +00:00
parent 5b15b11261
commit 731bfe4973
12 changed files with 0 additions and 116 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
gtsam/linear/GaussianBayesTree.cpp
View File

@ -99,17 +99,6 @@ namespace gtsam {
}
}
/* ************************************************************************* */
GaussianBayesTree::GaussianBayesTree(const GaussianBayesTree& other) :
Base(other) {}
/* ************************************************************************* */
GaussianBayesTree& GaussianBayesTree::operator=(const GaussianBayesTree& other)
{
(void) Base::operator=(other);
return *this;
}
/* ************************************************************************* */
bool GaussianBayesTree::equals(const This& other, double tol) const
{

8
gtsam/linear/GaussianBayesTree.h
View File

@ -59,14 +59,6 @@ namespace gtsam {
/** Default constructor, creates an empty Bayes tree */
GaussianBayesTree() {}
/** Makes a deep copy of the tree structure, but only pointers to conditionals are
* copied, the conditionals and their matrices are not cloned. */
GaussianBayesTree(const GaussianBayesTree& other);
/** Makes a deep copy of the tree structure, but only pointers to conditionals are
* copied, the conditionals and their matrices are not cloned. */
GaussianBayesTree& operator=(const GaussianBayesTree& other);
/** Check equality */
bool equals(const This& other, double tol = 1e-9) const;

12
gtsam/linear/GaussianEliminationTree.cpp
View File

@ -35,18 +35,6 @@ namespace gtsam {
const GaussianFactorGraph& factorGraph, const Ordering& order) :
Base(factorGraph, order) {}
/* ************************************************************************* */
GaussianEliminationTree::GaussianEliminationTree(
const This& other) :
Base(other) {}
/* ************************************************************************* */
GaussianEliminationTree& GaussianEliminationTree::operator=(const This& other)
{
(void) Base::operator=(other);
return *this;
}
/* ************************************************************************* */
bool GaussianEliminationTree::equals(const This& other, double tol) const
{

8
gtsam/linear/GaussianEliminationTree.h
View File

@ -51,14 +51,6 @@ namespace gtsam {
GaussianEliminationTree(const GaussianFactorGraph& factorGraph,
const Ordering& order);
/** Copy constructor - makes a deep copy of the tree structure, but only pointers to factors are
* copied, factors are not cloned. */
GaussianEliminationTree(const This& other);
/** Assignment operator - makes a deep copy of the tree structure, but only pointers to factors are
* copied, factors are not cloned. */
This& operator=(const This& other);
/** Test whether the tree is equal to another */
bool equals(const This& other, double tol = 1e-9) const;

11
gtsam/linear/GaussianJunctionTree.cpp
View File

@ -30,15 +30,4 @@ namespace gtsam {
const GaussianEliminationTree& eliminationTree) :
Base(Base::FromEliminationTree(eliminationTree)) {}
/* ************************************************************************* */
GaussianJunctionTree::GaussianJunctionTree(const This& other) :
Base(other) {}
/* ************************************************************************* */
GaussianJunctionTree& GaussianJunctionTree::operator=(const This& other)
{
(void) Base::operator=(other);
return *this;
}
}

8
gtsam/linear/GaussianJunctionTree.h
View File

@ -61,14 +61,6 @@ namespace gtsam {
* @return The elimination tree
*/
GaussianJunctionTree(const GaussianEliminationTree& eliminationTree);
/** Copy constructor - makes a deep copy of the tree structure, but only pointers to factors are
* copied, factors are not cloned. */
GaussianJunctionTree(const This& other);
/** Assignment operator - makes a deep copy of the tree structure, but only pointers to factors are
* copied, factors are not cloned. */
This& operator=(const This& other);
};
}

11
gtsam/symbolic/SymbolicBayesTree.cpp
View File

@ -31,17 +31,6 @@ namespace gtsam {
template class BayesTreeCliqueBase<SymbolicBayesTreeClique, SymbolicFactorGraph>;
template class BayesTree<SymbolicBayesTreeClique>;
/* ************************************************************************* */
SymbolicBayesTree::SymbolicBayesTree(const SymbolicBayesTree& other) :
Base(other) {}
/* ************************************************************************* */
SymbolicBayesTree& SymbolicBayesTree::operator=(const SymbolicBayesTree& other)
{
(void) Base::operator=(other);
return *this;
}
/* ************************************************************************* */\
bool SymbolicBayesTree::equals(const This& other, double tol /* = 1e-9 */) const
{

8
gtsam/symbolic/SymbolicBayesTree.h
View File

@ -58,14 +58,6 @@ namespace gtsam {
/** Default constructor, creates an empty Bayes tree */
SymbolicBayesTree() {}
/** Makes a deep copy of the tree structure, but only pointers to conditionals are
* copied, the conditionals and their matrices are not cloned. */
SymbolicBayesTree(const SymbolicBayesTree& other);
/** Makes a deep copy of the tree structure, but only pointers to conditionals are
* copied, the conditionals and their matrices are not cloned. */
SymbolicBayesTree& operator=(const SymbolicBayesTree& other);
/** check equality */
bool equals(const This& other, double tol = 1e-9) const;
};

12
gtsam/symbolic/SymbolicEliminationTree.cpp
View File

@ -35,18 +35,6 @@ namespace gtsam {
const SymbolicFactorGraph& factorGraph, const Ordering& order) :
Base(factorGraph, order) {}
/* ************************************************************************* */
SymbolicEliminationTree::SymbolicEliminationTree(
const This& other) :
Base(other) {}
/* ************************************************************************* */
SymbolicEliminationTree& SymbolicEliminationTree::operator=(const This& other)
{
(void) Base::operator=(other);
return *this;
}
/* ************************************************************************* */
bool SymbolicEliminationTree::equals(const This& other, double tol) const
{

8
gtsam/symbolic/SymbolicEliminationTree.h
View File

@ -47,14 +47,6 @@ namespace gtsam {
SymbolicEliminationTree(const SymbolicFactorGraph& factorGraph,
const Ordering& order);
/** Copy constructor - makes a deep copy of the tree structure, but only pointers to factors are
* copied, factors are not cloned. */
SymbolicEliminationTree(const This& other);
/** Assignment operator - makes a deep copy of the tree structure, but only pointers to factors are
* copied, factors are not cloned. */
This& operator=(const This& other);
/** Test whether the tree is equal to another */
bool equals(const This& other, double tol = 1e-9) const;

11
gtsam/symbolic/SymbolicJunctionTree.cpp
View File

@ -30,15 +30,4 @@ namespace gtsam {
const SymbolicEliminationTree& eliminationTree) :
Base(Base::FromEliminationTree(eliminationTree)) {}
/* ************************************************************************* */
SymbolicJunctionTree::SymbolicJunctionTree(const This& other) :
Base(other) {}
/* ************************************************************************* */
SymbolicJunctionTree& SymbolicJunctionTree::operator=(const This& other)
{
(void) Base::operator=(other);
return *this;
}
}

8
gtsam/symbolic/SymbolicJunctionTree.h
View File

@ -61,14 +61,6 @@ namespace gtsam {
* @return The elimination tree
*/
SymbolicJunctionTree(const SymbolicEliminationTree& eliminationTree);
/** Copy constructor - makes a deep copy of the tree structure, but only pointers to factors are
* copied, factors are not cloned. */
SymbolicJunctionTree(const This& other);
/** Assignment operator - makes a deep copy of the tree structure, but only pointers to factors are
* copied, factors are not cloned. */
This& operator=(const This& other);
};
}