CMS 3D CMS Logo

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Pages
List of all members | Public Types | Public Member Functions | Private Attributes
RoadSearchCircleSeed Class Reference

#include <RoadSearchCircleSeed.h>

Public Types

typedef std::pair< double, double > line
 
enum  type { circle, straightLine }
 

Public Member Functions

std::vector< const
TrackingRecHit * >
::const_iterator 
begin_hits () const
 
std::vector< GlobalPoint >
::const_iterator 
begin_points () const
 
double calculateEta (double theta) const
 
double calculateImpactParameter (GlobalPoint &center, double radius)
 
bool calculateInBarrel ()
 
GlobalPoint Center () const
 
bool Compare (const RoadSearchCircleSeed *circle, double centerCut, double radiusCut, unsigned int differentHitsCut) const
 
bool CompareCenter (const RoadSearchCircleSeed *circle, double centerCut) const
 
bool CompareDifferentHits (const RoadSearchCircleSeed *circle, unsigned int differentHitsCut) const
 
bool CompareRadius (const RoadSearchCircleSeed *circle, double radiusCut) const
 
double determinant (double array[][3], unsigned int bins)
 
std::vector< const
TrackingRecHit * >
::const_iterator 
end_hits () const
 
std::vector< GlobalPoint >
::const_iterator 
end_points () const
 
double Eta () const
 
const Roads::RoadSeedgetSeed ()
 
const Roads::RoadSetgetSet ()
 
std::vector< const
TrackingRecHit * > 
Hits () const
 
double ImpactParameter () const
 
bool InBarrel () const
 
double Phi0 () const
 
std::vector< GlobalPointPoints () const
 
std::string print () const
 
double Radius () const
 
 RoadSearchCircleSeed (const TrackingRecHit *hit1, const TrackingRecHit *hit2, const TrackingRecHit *hit3, GlobalPoint &point1, GlobalPoint &point2, GlobalPoint &point3)
 
 RoadSearchCircleSeed (const TrackingRecHit *hit1, const TrackingRecHit *hit2, GlobalPoint &point1, GlobalPoint &point2)
 
void setSeed (const Roads::RoadSeed *input)
 
void setSet (const Roads::RoadSet *input)
 
double Theta () const
 
double Type () const
 
 ~RoadSearchCircleSeed ()
 

Private Attributes

GlobalPoint center_
 
std::vector< const
TrackingRecHit * > 
hits_
 
double impactParameter_
 
bool inBarrel_
 
std::vector< GlobalPointpoints_
 
double radius_
 
const Roads::RoadSeedseed_
 
const Roads::RoadSetset_
 
type type_
 

Detailed Description

Definition at line 29 of file RoadSearchCircleSeed.h.

Member Typedef Documentation

typedef std::pair<double,double> RoadSearchCircleSeed::line

Definition at line 34 of file RoadSearchCircleSeed.h.

Member Enumeration Documentation

Enumerator
circle 
straightLine 

Definition at line 36 of file RoadSearchCircleSeed.h.

Constructor & Destructor Documentation

RoadSearchCircleSeed::RoadSearchCircleSeed ( const TrackingRecHit hit1,
const TrackingRecHit hit2,
const TrackingRecHit hit3,
GlobalPoint point1,
GlobalPoint point2,
GlobalPoint point3 
)

Definition at line 25 of file RoadSearchCircleSeed.cc.

References calculateImpactParameter(), calculateInBarrel(), center_, circle, hits_, impactParameter_, inBarrel_, FastCircle::isValid(), points_, radius_, FastCircle::rho(), straightLine, type_, FastCircle::x0(), and FastCircle::y0().

30  {
31 
32  hits_.reserve(3);
33  hits_.push_back(hit1);
34  hits_.push_back(hit2);
35  hits_.push_back(hit3);
36 
37  points_.reserve(3);
38  points_.push_back(point1);
39  points_.push_back(point2);
40  points_.push_back(point3);
41 
42  FastCircle kreis(point1,
43  point2,
44  point3);
45 
46  if ( !kreis.isValid() ) {
47  // line
49  inBarrel_ = true; // Not used for lines
50  center_ = GlobalPoint(0,0,0);
51  radius_ = 0;
52  impactParameter_ = 0;
53  } else {
54  type_ = circle;
56  radius_ = kreis.rho();
57  center_ = GlobalPoint(kreis.x0(),kreis.y0(),0);
59  }
60 
61 }
Global3DPoint GlobalPoint
Definition: GlobalPoint.h:10
double calculateImpactParameter(GlobalPoint &center, double radius)
std::vector< GlobalPoint > points_
std::vector< const TrackingRecHit * > hits_
RoadSearchCircleSeed::RoadSearchCircleSeed ( const TrackingRecHit hit1,
const TrackingRecHit hit2,
GlobalPoint point1,
GlobalPoint point2 
)

Definition at line 63 of file RoadSearchCircleSeed.cc.

References center_, hits_, impactParameter_, inBarrel_, points_, radius_, straightLine, and type_.

66  {
67  //
68  // straight line constructor
69  //
70 
71  hits_.reserve(2);
72  hits_.push_back(hit1);
73  hits_.push_back(hit2);
74 
75  points_.reserve(2);
76  points_.push_back(point1);
77  points_.push_back(point2);
78 
80  inBarrel_ = true; // Not used for lines
81  center_ = GlobalPoint(0,0,0);
82  radius_ = 0;
83  impactParameter_ = 0;
84 
85 }
Global3DPoint GlobalPoint
Definition: GlobalPoint.h:10
std::vector< GlobalPoint > points_
std::vector< const TrackingRecHit * > hits_
RoadSearchCircleSeed::~RoadSearchCircleSeed ( )

Definition at line 87 of file RoadSearchCircleSeed.cc.

87  {
88 }

Member Function Documentation

std::vector<const TrackingRecHit*>::const_iterator RoadSearchCircleSeed::begin_hits ( ) const
inline

Definition at line 59 of file RoadSearchCircleSeed.h.

References hits_.

Referenced by CompareDifferentHits().

59 { return hits_.begin(); }
std::vector< const TrackingRecHit * > hits_
std::vector<GlobalPoint>::const_iterator RoadSearchCircleSeed::begin_points ( ) const
inline

Definition at line 55 of file RoadSearchCircleSeed.h.

References points_.

55 { return points_.begin(); }
std::vector< GlobalPoint > points_
double RoadSearchCircleSeed::calculateEta ( double  theta) const

Definition at line 118 of file RoadSearchCircleSeed.cc.

References create_public_lumi_plots::log, and funct::tan().

Referenced by Eta().

118  {
119  //
120  // calculate eta from theta
121  //
122 
123  return -1.*std::log(std::tan(theta/2.));
124 }
Geom::Theta< T > theta() const
Tan< T >::type tan(const T &t)
Definition: Tan.h:22
double RoadSearchCircleSeed::calculateImpactParameter ( GlobalPoint center,
double  radius 
)

Definition at line 106 of file RoadSearchCircleSeed.cc.

References abs, mathSSE::sqrt(), PV3DBase< T, PVType, FrameType >::x(), and PV3DBase< T, PVType, FrameType >::y().

Referenced by RoadSearchCircleSeed().

107  {
108  //
109  // calculate impact parameter to (0,0,0) from center and radius of circle
110  //
111 
112  double d = std::sqrt( center.x() * center.x() +
113  center.y() * center.y() );
114 
115  return std::abs(d-radius);
116 }
T y() const
Definition: PV3DBase.h:62
#define abs(x)
Definition: mlp_lapack.h:159
T sqrt(T t)
Definition: SSEVec.h:46
T x() const
Definition: PV3DBase.h:61
bool RoadSearchCircleSeed::calculateInBarrel ( )

Definition at line 90 of file RoadSearchCircleSeed.cc.

References hits_, and StripSubdetector::TEC.

Referenced by RoadSearchCircleSeed().

90  {
91  //
92  // returns true if all hits are in the barrel,
93  // otherwise returns false
94  //
95 
96  for (std::vector<const TrackingRecHit*>::const_iterator hit = hits_.begin();
97  hit != hits_.end(); ++hit) {
98  if ((*hit)->geographicalId().subdetId() == StripSubdetector::TEC) {
99  return false;
100  }
101  }
102 
103  return true;
104 }
std::vector< const TrackingRecHit * > hits_
GlobalPoint RoadSearchCircleSeed::Center ( ) const
inline

Definition at line 62 of file RoadSearchCircleSeed.h.

References center_.

Referenced by CompareCenter(), and operator<<().

62 { return center_;}
bool RoadSearchCircleSeed::Compare ( const RoadSearchCircleSeed circle,
double  centerCut,
double  radiusCut,
unsigned int  differentHitsCut 
) const

Definition at line 316 of file RoadSearchCircleSeed.cc.

References CompareCenter(), CompareDifferentHits(), CompareRadius(), and query::result.

Referenced by RoadSearchSeedFinderAlgorithm::calculateCircleSeedsFromHits().

319  {
320  //
321  // compare this circle with the input circle
322  // compare: percentage of center difference of center average
323  // compare: percentage of radius difference of radius average
324  // compare: number of hits which don't overlap between the two circles
325  //
326 
327  // return value
328  bool result = false;
329 
330  result = CompareRadius(circle,radiusCut);
331  if ( result ) {
332  result = CompareCenter(circle,centerCut);
333  if ( result ) {
334  result = CompareDifferentHits(circle,differentHitsCut);
335  }
336  }
337 
338  return result;
339 
340 }
tuple result
Definition: query.py:137
bool CompareDifferentHits(const RoadSearchCircleSeed *circle, unsigned int differentHitsCut) const
bool CompareRadius(const RoadSearchCircleSeed *circle, double radiusCut) const
bool CompareCenter(const RoadSearchCircleSeed *circle, double centerCut) const
bool RoadSearchCircleSeed::CompareCenter ( const RoadSearchCircleSeed circle,
double  centerCut 
) const

Definition at line 342 of file RoadSearchCircleSeed.cc.

References Center(), center_, query::result, mathSSE::sqrt(), PV3DBase< T, PVType, FrameType >::x(), and PV3DBase< T, PVType, FrameType >::y().

Referenced by Compare().

343  {
344  //
345  // compare this circle with the input circle
346  // compare: percentage of center difference of center average
347  //
348 
349  // return value
350  bool result = false;
351 
352  double averageCenter = std::sqrt(((center_.x()+circle->Center().x())/2) *
353  ((center_.x()+circle->Center().x())/2) +
354  ((center_.y()+circle->Center().y())/2) *
355  ((center_.y()+circle->Center().y())/2));
356  double differenceCenter = std::sqrt((center_.x()-circle->Center().x()) *
357  (center_.x()-circle->Center().x()) +
358  (center_.y()-circle->Center().y()) *
359  (center_.y()-circle->Center().y()));
360 
361  if ( differenceCenter/averageCenter <= centerCut ) {
362  result = true;
363  }
364 
365 // edm::LogVerbatim("OLI") << "center difference: " << differenceCenter
366 // << "center average: " << averageCenter
367 // << "center percentage: " << differenceCenter/averageCenter
368 // << " cut: " << centerCut
369 // << " result: " << result;
370 
371  return result;
372 
373 }
T y() const
Definition: PV3DBase.h:62
GlobalPoint Center() const
T sqrt(T t)
Definition: SSEVec.h:46
tuple result
Definition: query.py:137
T x() const
Definition: PV3DBase.h:61
bool RoadSearchCircleSeed::CompareDifferentHits ( const RoadSearchCircleSeed circle,
unsigned int  differentHitsCut 
) const

Definition at line 402 of file RoadSearchCircleSeed.cc.

References begin_hits(), end_hits(), hits_, and query::result.

Referenced by Compare().

403  {
404  //
405  // compare this circle with the input circle
406  // compare: number of hits which don't overlap between the two circles
407  //
408 
409  // return value
410  bool result = false;
411 
412  // assume circles always have 3 hits
413  unsigned int counter = 0;
414  for ( std::vector<const TrackingRecHit*>::const_iterator hit1 = hits_.begin(),
415  hit1End = hits_.end();
416  hit1 != hit1End;
417  ++hit1 ) {
418  bool included = false;
419  for ( std::vector<const TrackingRecHit*>::const_iterator hit2 = circle->begin_hits(),
420  hit2End = circle->end_hits();
421  hit2 != hit2End;
422  ++hit2 ) {
423  if ( *hit1 == *hit2 ) {
424  included = true;
425  }
426  }
427  if ( !included ) {
428  ++counter;
429  }
430  }
431 
432  if ( counter <= differentHitsCut ) {
433  result = true;
434  }
435 
436 // edm::LogVerbatim("OLI") << "hits: " << counter
437 // << " cut: " << differentHitsCut
438 // << " result: " << result;
439 
440  return result;
441 
442 }
std::vector< const TrackingRecHit * >::const_iterator begin_hits() const
tuple result
Definition: query.py:137
std::vector< const TrackingRecHit * >::const_iterator end_hits() const
std::vector< const TrackingRecHit * > hits_
bool RoadSearchCircleSeed::CompareRadius ( const RoadSearchCircleSeed circle,
double  radiusCut 
) const

Definition at line 375 of file RoadSearchCircleSeed.cc.

References abs, Radius(), radius_, and query::result.

Referenced by Compare().

376  {
377  //
378  // compare: percentage of center difference of center average
379  // compare: percentage of radius difference of radius average
380  //
381 
382  // return value
383  bool result = false;
384 
385  double averageRadius = (radius_ + circle->Radius() ) /2;
386  double differenceRadius = std::abs(radius_ - circle->Radius());
387 
388  if ( differenceRadius/averageRadius <= radiusCut ) {
389  result = true;
390  }
391 
392 // edm::LogVerbatim("OLI") << "radius difference: " << differenceRadius
393 // << " radius average: " << averageRadius
394 // << " radius percentage: " << differenceRadius/averageRadius
395 // << " cut: " << radiusCut
396 // << " result: " << result;
397 
398  return result;
399 
400 }
#define abs(x)
Definition: mlp_lapack.h:159
tuple result
Definition: query.py:137
double RoadSearchCircleSeed::determinant ( double  array[][3],
unsigned int  bins 
)
std::vector<const TrackingRecHit*>::const_iterator RoadSearchCircleSeed::end_hits ( ) const
inline

Definition at line 60 of file RoadSearchCircleSeed.h.

References hits_.

Referenced by CompareDifferentHits().

60 { return hits_.end(); }
std::vector< const TrackingRecHit * > hits_
std::vector<GlobalPoint>::const_iterator RoadSearchCircleSeed::end_points ( ) const
inline

Definition at line 56 of file RoadSearchCircleSeed.h.

References points_.

56 { return points_.end(); }
std::vector< GlobalPoint > points_
double RoadSearchCircleSeed::Eta ( ) const
inline

Definition at line 65 of file RoadSearchCircleSeed.h.

References calculateEta(), and Theta().

65 { return calculateEta(Theta());}
double calculateEta(double theta) const
const Roads::RoadSeed* RoadSearchCircleSeed::getSeed ( )
inline

Definition at line 70 of file RoadSearchCircleSeed.h.

References seed_.

70 { return seed_; }
const Roads::RoadSeed * seed_
const Roads::RoadSet* RoadSearchCircleSeed::getSet ( )
inline

Definition at line 73 of file RoadSearchCircleSeed.h.

References set_.

73 { return set_; }
const Roads::RoadSet * set_
std::vector<const TrackingRecHit*> RoadSearchCircleSeed::Hits ( ) const
inline

Definition at line 58 of file RoadSearchCircleSeed.h.

References hits_.

58 { return hits_; }
std::vector< const TrackingRecHit * > hits_
double RoadSearchCircleSeed::ImpactParameter ( ) const
inline
bool RoadSearchCircleSeed::InBarrel ( ) const
inline
double RoadSearchCircleSeed::Phi0 ( ) const

Definition at line 157 of file RoadSearchCircleSeed.cc.

References PV3DBase< T, PVType, FrameType >::barePhi(), center_, i, ImpactParameter(), groupFilesInBlocks::lines, PV3DBase< T, PVType, FrameType >::perp(), phi, Geom::pi(), points_, Radius(), straightLine, and type_.

157  {
158  //
159  // calculate the angle in the x-y plane
160  // of the momentum vector at the point of
161  // closest approach to (0,0,0)
162  //
163  // Note: A faster implementation would
164  // calculate in the constructor, save, and
165  // return the member here. This implementation
166  // minimizes the memory footprint.
167  //
168 
169  // Calculate phi as the average phi of all
170  // lines formed by combinations of hits if
171  // this is a straight line
172  if (type_ == straightLine) {
173  std::vector<LineXY> lines;
174  for (std::vector<GlobalPoint>::const_iterator point1 = points_.begin();
175  point1 != points_.end(); ++point1) {
176  for (std::vector<GlobalPoint>::const_iterator point2 = point1+1;
177  point2 != points_.end(); ++point2) {
178  lines.push_back(LineXY(*point1,*point2));
179  }
180  }
181  double netPhi = 0.;
182  for (std::vector<LineXY>::const_iterator line = lines.begin();
183  line != lines.end(); ++line) {
184  netPhi += line->Phi();
185  }
186  return netPhi/(double)lines.size();
187  } // END calculation for linear seeds
188 
189  // This calculation is not valid for seeds which do not exit
190  // the tracking detector (lines always exit)
191  else if (2.*Radius()+ImpactParameter()<110) {
192  return 100000.;
193  }
194 
195  // circular seeds
196  else {
197  double phi = 100000.;
198  double centerPhi = center_.barePhi();
199 
200  // Find the first hit in time, which determines the direction of
201  // the momentum vector (tangent to the circle at the point of
202  // closest approach, clockwise or counter-clockwise).
203  // The first hit in time is always the hit with the smallest
204  // value r as long as the track exits the tracking detector.
205  GlobalPoint firstPoint = points_[0];
206  for (unsigned int i=1; i<points_.size(); ++i) {
207  if (firstPoint.perp() > points_[i].perp()) {
208  firstPoint = points_[i];
209  }
210  }
211 
212  // Get the next hit, firstPoint is at the point of
213  // closest approach and cannot be used to
214  // determine the direction of the initial
215  // momentum vector
216  if (firstPoint.barePhi() == centerPhi) {
217  GlobalPoint nextHit = points_[0];
218  for (unsigned int i=1; i<points_.size(); ++i) {
219  if (nextHit.perp() == firstPoint.perp() ||
220  (firstPoint.perp()!= points_[i].perp() &&
221  nextHit.perp() > points_[i].perp())) {
222  nextHit = points_[i];
223  }
224  }
225  firstPoint = nextHit;
226  }
227 
228  // Find the direction of the momentum vector
229  if (firstPoint.barePhi() > centerPhi) {
230  // The momentum vector is tangent to
231  // the track
232  phi = centerPhi + Geom::pi()/2.;
233  if (phi>Geom::pi()) {
234  phi -= 2.*Geom::pi();
235  }
236  }
237  // Other direction!
238  else if (firstPoint.barePhi() < centerPhi) {
239  // The momentum vector is tangent to
240  // the track
241  phi = centerPhi - Geom::pi()/2.;
242  if (phi<-1.*Geom::pi()) {
243  phi += 2.*Geom::pi();
244  }
245  }
246  return phi;
247  } // END calculation for circular seeds
248 }
int i
Definition: DBlmapReader.cc:9
T perp() const
Definition: PV3DBase.h:71
std::pair< double, double > line
T barePhi() const
Definition: PV3DBase.h:67
double ImpactParameter() const
std::vector< GlobalPoint > points_
double pi()
Definition: Pi.h:31
Definition: DDAxes.h:10
std::vector<GlobalPoint> RoadSearchCircleSeed::Points ( ) const
inline

Definition at line 54 of file RoadSearchCircleSeed.h.

References points_.

Referenced by operator<<().

54 { return points_; }
std::vector< GlobalPoint > points_
std::string RoadSearchCircleSeed::print ( void  ) const

Definition at line 250 of file RoadSearchCircleSeed.cc.

References center_, impactParameter_, inBarrel_, point, points_, radius_, straightLine, type_, PV3DBase< T, PVType, FrameType >::x(), and PV3DBase< T, PVType, FrameType >::y().

250  {
251  //
252  // print function
253  //
254 
255  std::ostringstream ost;
256 
258  ost << "Straight Line: number of points: " << points_.size() << "\n";
259  unsigned int counter = 0;
260  for ( std::vector<GlobalPoint>::const_iterator point = points_.begin();
261  point != points_.end();
262  ++point ) {
263  ++counter;
264  ost << " Point " << counter << ": " << point->x() << "," << point->y() << "\n";
265  }
266  } else {
267  ost << "Circle: number of points: " << points_.size() << "\n";
268  ost << " Radius : " << radius_ << "\n";
269  ost << " In the barrel : " << inBarrel_ << "\n";
270  ost << " ImpactParameter: " << impactParameter_ << "\n";
271  ost << " Center : " << center_.x() << "," << center_.y() << "\n";
272  unsigned int counter = 0;
273  for ( std::vector<GlobalPoint>::const_iterator point = points_.begin();
274  point != points_.end();
275  ++point ) {
276  ++counter;
277  ost << " Point " << counter << " : " << point->x() << "," << point->y() << "\n";
278  }
279  }
280 
281  return ost.str();
282 }
T y() const
Definition: PV3DBase.h:62
std::vector< GlobalPoint > points_
T x() const
Definition: PV3DBase.h:61
*vegas h *****************************************************used in the default bin number in original ***version of VEGAS is ***a higher bin number might help to derive a more precise ***grade subtle point
Definition: invegas.h:5
double RoadSearchCircleSeed::Radius ( ) const
inline
void RoadSearchCircleSeed::setSeed ( const Roads::RoadSeed input)
inline

Definition at line 69 of file RoadSearchCircleSeed.h.

References LaserDQM_cfg::input, and seed_.

Referenced by RoadSearchSeedFinderAlgorithm::calculateCircleSeedsFromHits().

69 { seed_ = input; }
const Roads::RoadSeed * seed_
void RoadSearchCircleSeed::setSet ( const Roads::RoadSet input)
inline

Definition at line 72 of file RoadSearchCircleSeed.h.

References LaserDQM_cfg::input, and set_.

Referenced by RoadSearchSeedFinderAlgorithm::calculateCircleSeedsFromHits().

72 { set_ = input; }
const Roads::RoadSet * set_
double RoadSearchCircleSeed::Theta ( ) const

Definition at line 126 of file RoadSearchCircleSeed.cc.

References groupFilesInBlocks::lines, and points_.

Referenced by Eta().

126  {
127  //
128  // calculate the theta of the seed
129  // by taking the average theta of all
130  // the lines formed by combinations of
131  // hits in the seed
132  //
133  // Note: A faster implementation would
134  // calculate in the constructor, save, and
135  // return the member here. This implementation
136  // minimizes the memory footprint.
137  //
138 
139  // Form all the possible lines
140  std::vector<LineRZ> lines;
141  for (std::vector<GlobalPoint>::const_iterator point1 = points_.begin();
142  point1 != points_.end(); ++point1) {
143  for (std::vector<GlobalPoint>::const_iterator point2 = point1+1;
144  point2 != points_.end(); ++point2) {
145  lines.push_back(LineRZ(*point1, *point2));
146  }
147  }
148 
149  double netTheta = 0.;
150  for (std::vector<LineRZ>::const_iterator line = lines.begin();
151  line != lines.end(); ++line){
152  netTheta += line->Theta();
153  }
154  return netTheta/(double)lines.size();
155 }
std::pair< double, double > line
std::vector< GlobalPoint > points_
double RoadSearchCircleSeed::Type ( ) const
inline

Member Data Documentation

GlobalPoint RoadSearchCircleSeed::center_
private

Definition at line 107 of file RoadSearchCircleSeed.h.

Referenced by Center(), CompareCenter(), Phi0(), print(), and RoadSearchCircleSeed().

std::vector<const TrackingRecHit*> RoadSearchCircleSeed::hits_
private
double RoadSearchCircleSeed::impactParameter_
private

Definition at line 109 of file RoadSearchCircleSeed.h.

Referenced by ImpactParameter(), print(), and RoadSearchCircleSeed().

bool RoadSearchCircleSeed::inBarrel_
private

Definition at line 106 of file RoadSearchCircleSeed.h.

Referenced by InBarrel(), print(), and RoadSearchCircleSeed().

std::vector<GlobalPoint> RoadSearchCircleSeed::points_
private
double RoadSearchCircleSeed::radius_
private

Definition at line 108 of file RoadSearchCircleSeed.h.

Referenced by CompareRadius(), print(), Radius(), and RoadSearchCircleSeed().

const Roads::RoadSeed* RoadSearchCircleSeed::seed_
private

Definition at line 111 of file RoadSearchCircleSeed.h.

Referenced by getSeed(), and setSeed().

const Roads::RoadSet* RoadSearchCircleSeed::set_
private

Definition at line 112 of file RoadSearchCircleSeed.h.

Referenced by getSet(), and setSet().

type RoadSearchCircleSeed::type_
private