-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathmulti_arc.h
103 lines (86 loc) · 2.62 KB
/
multi_arc.h
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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
#ifndef MULTI_ARC_H
#define MULTI_ARC_H
#include "id_func.h"
#include "id_sort.h"
#include "array_id_func.h"
#include "sort_arc.h"
template<class Tail, class Head>
BitIDFunc identify_non_multi_arcs(const Tail&tail, const Head&head){
const int arc_count = tail.preimage_count();
auto arc_list = sort_arcs_first_by_tail_second_by_head(tail, head);
BitIDFunc is_non_multi_arc(arc_count);
if(arc_count > 0){
is_non_multi_arc.set(arc_list[0], true);
for(int i=1; i<arc_count; ++i)
is_non_multi_arc.set(arc_list[i],
head(arc_list[i]) != head(arc_list[i-1])
|| tail(arc_list[i]) != tail(arc_list[i-1])
);
}
return is_non_multi_arc; // NRVO
}
template<class Tail, class Head>
bool is_symmetric(const Tail&tail, const Head&head){
const int arc_count = tail.preimage_count();
auto forward_arc_list = sort_arcs_first_by_tail_second_by_head(tail, head);
auto backward_arc_list = sort_arcs_first_by_tail_second_by_head(head, tail);
for(int i=0; i<arc_count; ++i){
if(tail(forward_arc_list(i)) != head(backward_arc_list(i)) || head(forward_arc_list(i)) != tail(backward_arc_list(i)))
return false;
}
return true;
}
template<class Tail, class Head>
class SymmetricHead{
public:
SymmetricHead(Tail tail, Head head):
tail(std::move(tail)), head(std::move(head)){}
int preimage_count()const{ return 2*tail.preimage_count(); }
int image_count()const {return tail.image_count(); }
int operator()(int x)const{
if(x < tail.preimage_count())
return head(x);
else
return tail(x - tail.preimage_count());
}
private:
Tail tail;
Head head;
};
template<class Tail, class Head>
SymmetricHead<Tail, Head>make_symmetric_head(Tail tail, Head head){
return {std::move(tail), std::move(head)};
}
template<class Tail, class Head>
class SymmetricTail{
public:
SymmetricTail(Tail tail, Head head):
tail(std::move(tail)), head(std::move(head)){}
int preimage_count()const{ return 2*tail.preimage_count(); }
int image_count()const {return tail.image_count(); }
int operator()(int x)const{
if(x < tail.preimage_count())
return tail(x);
else
return head(x - tail.preimage_count());
}
private:
Tail tail;
Head head;
};
template<class Tail, class Head>
SymmetricTail<Tail, Head>make_symmetric_tail(Tail tail, Head head){
return {std::move(tail), std::move(head)};
}
template<class Tail, class Head>
bool has_multi_arcs(const Tail&tail, const Head&head){
return count_true(identify_non_multi_arcs(tail, head)) != tail.preimage_count();
}
template<class Tail, class Head>
bool is_loop_free(const Tail&tail, const Head&head){
for(int i=0; i<tail.preimage_count(); ++i)
if(tail(i) == head(i))
return false;
return true;
}
#endif