Least-squares vertex fit over a set of lines (the normal equations AX = -B).
More...
#include <ClusterLines.h>
Inherits o2::its::LineFit.
|
| | GPUhdDefault () ClusterLines()=default |
| |
| | ClusterLines (gsl::span< const int > lineIndices, gsl::span< const Line > lines) |
| | Fit over lines[lineIndices[i]]; lineIndices must be sorted and unique.
|
| |
| | GPUhdi () void add(const Line &line) |
| | Accumulate one line into the normal equations and the time estimate.
|
| |
| | GPUhdi () void addResidual(const Line &line) |
| | Running-mean update of the RMS2 and average distance about the stored vertex.
|
| |
| | GPUhdi () void addResidual(const Line &line |
| | Running-mean update about an externally solved vertex.
|
| |
| | Line::getDCAComponents (line, vertex, dca) |
| |
| | for (int i=0;i< 6;++i) |
| |
| bool | operator== (const ClusterLines &rhs) const noexcept |
| |
| | GPUhdi () bool add(const Line &line) |
| | Accumulate one line.
|
| |
| | GPUhdi () bool solve(float vertex[3]) const |
| | Solve the symmetric 3x3 system into vertex (= -A^-1 B); false if it is singular.
|
| |
| | GPUhdi () void computeClusterCentroid() |
| | Solve into the stored vertex, setting the validity flag.
|
| |
| | GPUhdi () bool isValid() const noexcept |
| |
| | GPUhdi () const float *getVertex() const noexcept |
| |
| | GPUhdi () int getSize() const noexcept |
| |
| | GPUhdi () int getNContributors() const noexcept |
| |
| | GPUhdi () const TimeEstBC &getTimeStamp() const noexcept |
| |
| | GPUhdi () float getR2() const noexcept |
| |
| | GPUhdi () float getR() const noexcept |
| |
| | GPUhdi () const float *getRMS2() const noexcept |
| |
| | GPUhdi () float getAvgDistance2() const noexcept |
| |
|
| double | mA [6] = {0., 0., 0., 0., 0., 0.} |
| |
| double | mB [3] = {0., 0., 0.} |
| |
| float | mVertex [3] = {0.f, 0.f, 0.f} |
| |
| float | mRMS2 [6] = {0.f, 0.f, 0.f, 0.f, 0.f, 0.f} |
| |
| float | mAvgDistance2 = 0.f |
| |
| int | mNContributors = 0 |
| |
| bool | mIsValid = false |
| |
| TimeEstBC | mTime |
| |
Least-squares vertex fit over a set of lines (the normal equations AX = -B).
Definition at line 221 of file ClusterLines.h.
◆ ClusterLines()
| o2::its::ClusterLines::ClusterLines |
( |
gsl::span< const int > |
lineIndices, |
|
|
gsl::span< const Line > |
lines |
|
) |
| |
Fit over lines[lineIndices[i]]; lineIndices must be sorted and unique.
Definition at line 81 of file ClusterLines.cxx.
◆ for()
| o2::its::ClusterLines::for |
( |
| ) |
|
|
inline |
◆ GPUhdDefault()
| o2::its::ClusterLines::GPUhdDefault |
( |
| ) |
|
|
default |
◆ GPUhdi() [1/3]
| o2::its::ClusterLines::GPUhdi |
( |
| ) |
const & |
|
inline |
Accumulate one line into the normal equations and the time estimate.
Definition at line 229 of file ClusterLines.h.
◆ GPUhdi() [2/3]
| o2::its::ClusterLines::GPUhdi |
( |
| ) |
const & |
Running-mean update about an externally solved vertex.
◆ GPUhdi() [3/3]
| o2::its::ClusterLines::GPUhdi |
( |
| ) |
const & |
|
inline |
Running-mean update of the RMS2 and average distance about the stored vertex.
Definition at line 243 of file ClusterLines.h.
◆ Line::getDCAComponents()
| o2::its::ClusterLines::Line::getDCAComponents |
( |
line |
, |
|
|
vertex |
, |
|
|
dca |
|
|
) |
| |
◆ operator==()
| bool o2::its::ClusterLines::operator== |
( |
const ClusterLines & |
rhs | ) |
const |
|
noexcept |
◆ d2
◆ inv
| const float o2::its::ClusterLines::inv = 1.f / static_cast<float>(mResidualCount) |
◆ mAvgDistance2
| o2::its::ClusterLines::mAvgDistance2 = (d2 - mAvgDistance2) / static_cast<float>(mResidualCount) |
◆ mResidualCount
| o2::its::ClusterLines::mResidualCount |
◆ vertex
| const float o2::its::ClusterLines::vertex[3] |
The documentation for this class was generated from the following files:
- /home/runner/work/AliceO2/AliceO2/Detectors/ITSMFT/ITS/tracking/include/ITStracking/ClusterLines.h
- /home/runner/work/AliceO2/AliceO2/Detectors/ITSMFT/ITS/tracking/src/ClusterLines.cxx