24 criteria_.push_back(std::make_pair(
false,nonConstFilter));
50 DDScope::scope_type::const_iterator it = dummy.begin();
51 DDScope::scope_type::const_iterator it_end = dummy.end();
54 it = sc.
scope().begin();
56 scoped = bool(sc.
scope().end()-it);
59 bool runonce = scoped ?
false :
true;
61 while (runonce || (it != it_end) ) {
79 criteria_type::iterator it =
criteria_.begin();
80 logops_type::iterator logOpIt =
logOps_.begin();
83 for (; it !=
criteria_.end(); ++it, ++logOpIt) {
bool next()
set current node to the next node in the expanded tree
virtual void addFilter(const DDFilter &, log_op op=AND)
virtual const std::vector< DDExpandedNode > & exec()
std::vector< const DDsvalues_type * > specifics() const
User specific data attached to the current node.
virtual void setScope(const DDScope &)
type of data representation of DDCompactView
std::vector< DDExpandedNode > result_
const DDGeoHistory & geoHistory() const
The list of ancestors up to the root-node of the current node.
std::vector< DDGeoHistory > scope_type
int depth(void) const
return the depth to wich the subtrees are restricted
bool setScope(const DDGeoHistory &hist, int depth=0)
sets the scope of the expanded view
DDQuery(const DDCompactView &)
sets up a query
defines subtrees in the expanded-view
void reset()
true, if a call to firstChild() would succeed (current node has at least one child) ...
A Filter accepts or rejects a DDExpandedNode based on a user-coded decision rule. ...
virtual bool accept(const DDExpandedView &) const =0
true, if the DDExpandedNode fulfills the filter criteria
const scope_type & scope(void) const
returns the scope container