class TreeSearch::Road: public TObject

 Construct empty road

 Construct from pattern

 Copy constructor

 Copy constructor

 Print hit info

 Destructor

 Copy fPoints and fFitCoord. Used by copy c'tor and assignment operator.
 Creates actual copies of Points because they are managed by the Roads.

 Return true if the hits from the given set either cover all planes
 or, if planes are missing, the pattern of missing planes is allowed
 (based on what level of matching the user requests via the database)

 Check if the hits from the given NodeDescriptor pattern are common
 with the common hit set already in this road. If so, add the pattern
 to this road, update the common hits if necessary, and return true.
 If not, do nothing and return false.

 Adding can only be done so long as the road is not yet finished

 Finish building the road

 Check if this road includes 'other'. Either other's hits are a
 subset of this road's hit set or other lies entirely within the
 boundaries of this road.
 If a match is found, adopt the other road (either widen boundaries
 or adopt the other's hits)

 Gather hit positions that lie within the Road area.
 Return true if the plane occupancy pattern of the selected points
 is allowed by Projection::fPlaneCombos, otherwise false.
 Results are in fPoints.

 Collect hit positions within the Road limits and, if enough points
 found, fit them to a straight line. If several points found in one
 or more planes, fit all possible combinations of them.
 Results of the best fit with acceptable chi2 (Projection::fChisqLimits)
 are stored in the member variables

 Find intersection point in x/y coordinates of the best fit of this
 road with the best fit of the other in the given z-plane.
 Both roads must have a good fit and must be from different projections.
 This function commutes, i.e. a->Intersect(b) == b->Intersect(a)

 Print road info