1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
|
#ifndef MULTITREE_ITERATOR_H
#define MULTITREE_ITERATOR_H
#include <terraces/errors.hpp>
#include "multitree.hpp"
#include "small_bipartition.hpp"
namespace terraces {
struct multitree_iterator_choicepoint {
const multitree_node* alternatives;
const multitree_node* current;
multitree_iterator_choicepoint() : alternatives{nullptr}, current{nullptr} {}
multitree_iterator_choicepoint(const multitree_node* node) {
if (node->type == multitree_node_type::alternative_array) {
const auto aa = node->alternative_array;
alternatives = aa.num_alternatives() > 1 ? node : nullptr;
current = aa.begin;
} else {
alternatives = nullptr;
current = node;
}
}
bool has_choices() const { return alternatives != nullptr; }
bool is_unconstrained() const {
return current->type == multitree_node_type::base_unconstrained;
}
bool is_valid() const {
return has_choices() && current != alternatives->alternative_array.end;
}
bool next() {
assert(is_valid());
++current;
return is_valid();
}
void reset() { current = alternatives->alternative_array.begin; }
};
class multitree_iterator {
private:
terraces::tree m_tree;
std::vector<multitree_iterator_choicepoint> m_choices;
std::vector<small_bipartition> m_unconstrained_choices;
std::stack<index_t> m_init_stack;
bool init_subtree(index_t subtree_root);
void init_subtree(index_t subtree_root, index_t single_leaf);
void init_subtree(index_t subtree_root, multitree_nodes::two_leaves two_leaves);
void init_subtree(index_t subtree_root, multitree_nodes::inner_node inner);
void init_subtree(index_t subtree_root, multitree_nodes::unconstrained unconstrained);
bool init_subtree_unconstrained(index_t subtree_root, multitree_nodes::unconstrained data);
bool next(index_t root);
bool next_unconstrained(index_t root, multitree_nodes::unconstrained unconstrained);
bool reset(index_t root);
bool reset_unconstrained(index_t root, multitree_nodes::unconstrained unconstrained);
public:
multitree_iterator(const multitree_node* root);
bool next();
const terraces::tree& tree() const { return m_tree; }
};
} // namespace terraces
#endif // MULTITREE_ITERATOR_H
|
