#include <LagrangeChildUpdator.h>
Public Member Functions | |
LagrangeChildUpdator * | clone () const |
LagrangeChildUpdator () | |
std::vector < RefCountedKinematicTree > | update (std::vector< RefCountedKinematicTree > trees) const |
RefCountedKinematicTree | update (RefCountedKinematicTree tree) const |
~LagrangeChildUpdator () |
This is the space for daughter particle update after the lagrange multipliers refit. Current class is not yet implemented. Return the input unchanged for the moment.
Definition at line 13 of file LagrangeChildUpdator.h.
LagrangeChildUpdator::LagrangeChildUpdator | ( | ) | [inline] |
LagrangeChildUpdator::~LagrangeChildUpdator | ( | ) | [inline] |
Definition at line 18 of file LagrangeChildUpdator.h.
{}
LagrangeChildUpdator* LagrangeChildUpdator::clone | ( | void | ) | const [inline, virtual] |
Implements ChildUpdator.
Definition at line 24 of file LagrangeChildUpdator.h.
References LagrangeChildUpdator().
{return new LagrangeChildUpdator(*this);}
RefCountedKinematicTree LagrangeChildUpdator::update | ( | RefCountedKinematicTree | tree | ) | const [virtual] |
Method updating particles and vertices inside the tree below the constrained particle The tree pointer should be set on particle just updated by ParentParticleFitter Class to be used by KinematicParticleFitter only.
Implements ChildUpdator.
Definition at line 3 of file LagrangeChildUpdator.cc.
References diffTreeTool::tree.
{ //space for down update method //now does nothing, supposed to //update the states of daughter //particles down the kinematic decay chain RefCountedKinematicTree nTree = tree; return nTree; }
std::vector< RefCountedKinematicTree > LagrangeChildUpdator::update | ( | std::vector< RefCountedKinematicTree > | trees | ) | const [virtual] |
Implements ChildUpdator.
Definition at line 13 of file LagrangeChildUpdator.cc.
{ //space for down update method //now does nothing, supposed to //update the states of daughter //particles down the kinematic decay chain std::vector<RefCountedKinematicTree> nTree = trees; return nTree; }