| Geant4 Cross Reference |
1 // Copyright (C) 2010, Guy Barrand. All rights
2 // See the file tools.license for terms.
3
4 //
5 // Helper functions to handle node(s) paths in
6 //
7
8 #ifndef tools_sg_path
9 #define tools_sg_path
10
11 #include "node"
12 #include "noderef"
13 #include "../pointer"
14
15 namespace tools {
16 namespace sg {
17
18 typedef std::vector<node*> path_t;
19
20 inline bool parent_class(const path_t& a_path,
21 if(a_path.size()<2) {a_class.clear();return
22 node* parent = a_path[a_path.size()-2];
23 a_class = parent->s_cls();
24 return true;
25 }
26
27 template <class NODE>
28 inline NODE* rfind(const path_t& a_path) {
29 path_t::const_reverse_iterator it;
30 for(it=a_path.rbegin();it!=a_path.rend();++i
31 if(NODE* par = safe_cast<node,NODE>(*(*it)
32 }
33 return 0;
34 }
35
36 template <class NODE>
37 inline NODE* tail(const path_t& a_path) {
38 if(a_path.empty()) return 0;
39 node* _node = a_path[a_path.size()-1];
40 return safe_cast<node,NODE>(*_node);
41 }
42
43 inline bool remove_tail(path_t& a_path) {
44 if(a_path.empty()) return false;
45 a_path.resize(a_path.size()-1);
46 return true;
47 }
48
49 template <class CONTAINER>
50 inline CONTAINER* container(const path_t& a_pa
51 if(a_path.size()<2) return 0;
52 node* parent = a_path[a_path.size()-2];
53 return safe_cast<node,CONTAINER>(*parent);
54 }
55
56 template <class CONTAINER>
57 inline CONTAINER* container_container(const pa
58 if(a_path.size()<3) return 0;
59 node* parent = a_path[a_path.size()-3];
60 return safe_cast<node,CONTAINER>(*parent);
61 }
62
63 inline void dump(std::ostream& a_out,const pat
64 a_out << "tools::sg::dump : path size " << a
65 std::string _s;
66 path_t::const_iterator it;
67 for(it=a_path.begin();it!=a_path.end();++it)
68 if(!p2s(*it,_s)) {}
69 a_out << " " << _s << " " << (*it)->s_cls(
70 if(noderef* _ref = safe_cast<node,noderef>
71 if(!p2s(&(_ref->node()),_s)) {}
72 a_out << ", " << _s << " " << _ref->node
73 }
74 a_out << std::endl;
75 }
76 }
77
78 //#define TOOLS_RFIND_DEBUG
79
80 template <class WHAT,class CONTAINER>
81 inline bool rfind(const path_t& a_path,const n
82 CONTAINER*& a_container,WHAT
83 int& a_container_index){
84 node* from = (node*)&a_from;
85 path_t::size_type sz = a_path.size();
86 #ifdef TOOLS_RFIND_DEBUG
87 ::printf("debug : rfind : from %s, a_path.si
88 //::printf("debug : rfind : search node of c
89 #endif
90 for(size_t index=1;index<sz;index++) {
91 node* _node = a_path[sz-index-1];
92 #ifdef TOOLS_RFIND_DEBUG
93 ::printf("debug : rfind : index %d, node %
94 #endif
95 a_container = safe_cast<node,CONTAINER>(*_
96 if(a_container) {
97 #ifdef TOOLS_RFIND_DEBUG
98 ::printf("debug : rfind : node is a cont
99 #endif
100 //the below does not compile.
101 //a_what = a_container->rsearch_from<WHA
102 //if(a_what) return true;
103
104 void* p = a_container->rsearch_from(from
105 if(p) {
106 #ifdef TOOLS_RFIND_DEBUG
107 ::printf("debug : rfind : found in con
108 #endif
109 a_what = (WHAT*)p;
110 a_container_index = int(sz-index-1);
111 return true;
112 }
113
114 from = a_container;
115 } else if(noderef* _ref = safe_cast<node,n
116 #ifdef TOOLS_RFIND_DEBUG
117 ::printf("debug : rfind : node is a node
118 #endif
119 from = _ref;
120 } else { // weird case :
121 #ifdef TOOLS_RFIND_DEBUG
122 ::printf("debug : rfind : weird case\n")
123 #endif
124 break;
125 }
126 }
127 #ifdef TOOLS_RFIND_DEBUG
128 ::printf("debug : rfind : failed\n");
129 #endif
130 a_what = 0;
131 a_container = 0;
132 a_container_index = -1;
133 return false;
134 }
135 #ifdef TOOLS_RFIND_DEBUG
136 #undef TOOLS_RFIND_DEBUG
137 #endif
138
139 template <class WHAT,class CONTAINER>
140 inline bool find_top(const path_t& a_path,cons
141 CONTAINER*& a_container,W
142 int& a_container_index){
143 a_what = 0;
144 a_container = 0;
145 a_container_index = -1;
146 path_t _path = a_path;
147 node* from = (node*)&a_from;
148 while(true) {
149 CONTAINER* container;
150 WHAT* what;
151 int idx; //index in path of container.
152 if(!sg::rfind<WHAT,CONTAINER>(_path,*from,
153 break;
154 }
155 a_container = container;
156 a_what = what;
157 a_container_index = idx;
158 _path.resize(idx+1);
159 _path.push_back(what);
160 from = what;
161 }
162 return a_container?true:false;
163 }
164
165 typedef std::vector<path_t> paths_t;
166
167 }}
168
169 #endif