#include <HRoute.h>
Definition at line 13 of file HRoute.h.
◆ VolumeContainer
◆ HRoute() [1/2]
◆ HRoute() [2/2]
| HRoute::HRoute |
( |
double | r, |
|
|
double | zmi, |
|
|
double | zma, |
|
|
double | zexit, |
|
|
const std::string & | name ) |
|
inline |
Definition at line 19 of file HRoute.h.
19 :
const std::string & name() const
◆ addVolume()
Implements Route.
Definition at line 36 of file HRoute.h.
VolumeContainer m_volumes
◆ entryVolume()
| ServiceVolume * Route::entryVolume |
( |
double | pos, |
|
|
bool | ascending, |
|
|
MsgStream & | msg ) const |
|
virtualinherited |
Definition at line 10 of file Route.cxx.
11{
12 if (
msg.level() <= MSG::DEBUG) {
13 msg << MSG::DEBUG <<
"entering entryVolume with ascending = " << ascending
15 }
17
18
19
20
21
22 if ( ascending) {
24
25 if (
msg.level() <= MSG::DEBUG) {
26 msg << MSG::DEBUG <<
"Comparing " <<
pos <<
" and " << (**i).position() <<
endmsg;
27 }
28 if (pos < (**i).position()) {
29 if (
msg.level() <= MSG::DEBUG) {
30 msg << MSG::DEBUG <<
"volume at pos " << (**i).radius()
31 <<
", " << (**i).zPos() <<
" contains exit point" <<
endmsg;
32 }
34 }
35 else if (
msg.level() <= MSG::DEBUG) {
36 msg << MSG::DEBUG <<
"volume at pos " << (**i).radius()
37 <<
", " << (**i).zPos() <<
" does not contain exit point" <<
endmsg;
38 }
39 }
41 }
42 else {
43 for (VolumeContainer::const_reverse_iterator i=
volumes().rbegin();
i!=
volumes().rend(); ++
i) {
44 if ((**i).contains(pos))
return *
i;
45 }
47 }
48
49}
static const Attributes_t empty
virtual const VolumeContainer & volumes() const =0
◆ exit()
| virtual double HRoute::exit |
( |
| ) |
const |
|
inlinevirtual |
◆ exitVolume()
| ServiceVolume * Route::exitVolume |
( |
bool | ascending, |
|
|
MsgStream & | msg ) const |
|
virtualinherited |
Definition at line 51 of file Route.cxx.
52{
53 if (
msg.level() <= MSG::DEBUG) {
54 msg << MSG::DEBUG <<
"entering exitVolume with ascending = " << ascending
56 }
58
59
61 if ( ascending) {
63 if ((**i).contains(
exit()))
return *
i;
64 else if (
msg.level() <= MSG::DEBUG) {
65 msg << MSG::DEBUG <<
"volume at pos " << (**i).radius()
66 <<
", " << (**i).zPos() <<
" does not contain exit point" <<
endmsg;
67 }
68 }
70 }
71 else {
72 for (VolumeContainer::const_reverse_iterator i=
volumes().rbegin();
i!=
volumes().rend(); ++
i) {
73 if ((**i).contains(
exit()))
return *
i;
74 }
76 }
77}
ServiceVolume * m_exitVolume
virtual double exit() const =0
◆ name()
| const std::string & Route::name |
( |
| ) |
const |
|
inlineinherited |
◆ nextRoute()
| virtual Route * HRoute::nextRoute |
( |
| ) |
|
|
inlinevirtual |
◆ position()
| virtual double HRoute::position |
( |
| ) |
const |
|
inlinevirtual |
◆ radius()
| double HRoute::radius |
( |
| ) |
const |
|
inline |
◆ setExitVolume()
Definition at line 50 of file Route.h.
50 {
53 }
virtual void addVolume(ServiceVolume *vol)=0
◆ setNextRoute()
| virtual void HRoute::setNextRoute |
( |
Route * | nr | ) |
|
|
inlinevirtual |
◆ volumes()
◆ zExit()
| double HRoute::zExit |
( |
| ) |
const |
|
inline |
◆ zMax()
| double HRoute::zMax |
( |
| ) |
const |
|
inline |
◆ zMin()
| double HRoute::zMin |
( |
| ) |
const |
|
inline |
◆ m_exitVolume
◆ m_name
| std::string Route::m_name |
|
privateinherited |
◆ m_next
◆ m_radius
| double HRoute::m_radius {} |
|
private |
◆ m_volumes
◆ m_zExit
| double HRoute::m_zExit {} |
|
private |
◆ m_zMax
◆ m_zMin
The documentation for this class was generated from the following file: