19 namespace rb{
class Cluster;}
34 void EstimateStraightLine(
double& z1,
double&
y1,
35 double& z2,
double&
y2)
const;
41 unsigned int NChunks()
const {
return fNChunks;}
43 int NHitPlanes()
const;
44 const Chunk& FirstChunk()
const;
45 const Chunk& LastChunk()
const;
51 bool IsExtremalChunkComplete(
Direction dir)
const;
52 void MarkExtremalChunkShower(
Direction dir);
53 bool IsAllShower()
const;
54 const Segment& FirstSeg()
const;
61 bool Up()
const {
return fUp;}
65 std::list<Chunk>
AllChunks()
const {
return fChunks;}
80 bool TryAddSegOutOfOrder(
const Segment& seg);
85 int NSegs()
const {
return fSegs.size();}
92 Cand MaybeFlip(
bool& ok)
const;
100 double& mmax,
double& mmin,
101 double&
cmax,
double& cmin)
const;
103 void MinMaxLines(
const SubSeg& segi,
const SubSeg& segj,
104 double& mmax,
double& mmin,
105 double& cmax,
double& cmin)
const;
110 double ClosestToEndCell(
bool left)
const;
112 double MAvg()
const {
return (fAllMMin+fAllMMax)/2;}
113 double CAvg()
const {
return (fAllCMin+fAllCMax)/2;}
Float_t y1[n_points_granero]
enum geo::_plane_proj View_t
Enumerate the possible plane projections.
Sequence of contiguous hits and dead cells all on the same plane.
double MinGradient() const
std::list< Segment > fSegs
const Segment & ExtremalSeg(Direction dir) const
unsigned int ExtremalPlane(Direction dir) const
unsigned int FirstPlane() const
const Chunk & ExtremalChunk(Direction dir) const
A rb::Prong with full reconstructed trajectory.
unsigned int NDeadChunks() const
unsigned int NChunks() const
unsigned int LastPlane() const
Calculation and representation of a straight line passing through several "segment" windows...
bool operator<(StanConfig::Verbosity a, StanConfig::Verbosity b)
Allow for comparing them, since kQuiet is definitely "less" verbose than kVerbose.
bool operator==(FC &A, FC &B)
double EstimateGradient() const
Perform a "2 point" Hough transform on a collection of hits.
Just the upstream or downstream part, just coordinates.
constexpr auto const & left(const_AssnsIter< L, R, D, Dir > const &a, const_AssnsIter< L, R, D, Dir > const &b)
Window the line must pass through from (z,y0)-(z,y1)
double MaxGradient() const
std::list< Chunk > fChunks
art::PtrVector< rb::CellHit > fAllHits
Always access via AllHits.
std::list< Chunk > AllChunks() const
Sorted in plane order.