67 static constexpr void init(
Pred& p,
Tree const& t)
71 template <
class Tree,
class Node>
72 [[nodiscard]]
static constexpr bool returnable(
Pred const& p,
Tree const& t,
75 if constexpr (Negated) {
76 return t.labels(n.index).empty();
78 return !t.labels(n.index).empty();
82 template <
class Tree,
class Node>
83 [[nodiscard]]
static constexpr bool traversable(
Pred const& p,
Tree const& t,
86 if constexpr (Negated) {
89 switch (t.labelsPropagationCriteria()) {
90 case LabelsPropagationCriteria::ALL: {
91 return !t.labels(n.index).empty();
93 case LabelsPropagationCriteria::SUMMARY: {
94 return !t.labels(n.index).empty();
96 case LabelsPropagationCriteria::MIN: {
97 return !t.labels(n.index).empty();
99 case LabelsPropagationCriteria::MAX: {
100 return !t.labels(n.index).empty();
102 case LabelsPropagationCriteria::NONE: {