-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmerge_unique.hpp
130 lines (130 loc) · 2.55 KB
/
merge_unique.hpp
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#ifndef MERGE_UNIQUE_HPP
#define MERGE_UNIQUE_HPP
#include <functional>
#include <forward_list>
#if 0
template <typename ...L>
static void merge_unique(std::forward_list<L...> &a, std::forward_list<L...> & b) {
if (b.empty())
return;
if (a.empty()) {
a.swap(b);
return;
}
auto aprev = a.before_begin();
auto acur = a.begin();
auto bprev = b.before_begin();
auto bcur = b.begin();
while(!b.empty()) {
if (*acur < *bcur) {
aprev = acur;
if (++acur == a.end()) {
a.splice_after(aprev, move(b));
return;
}
} else if (*bcur < *acur) {
++bcur;
a.splice_after(aprev, b, bprev);
++aprev;
if (b.empty())
return;
} else {
b.pop_front();
if (b.empty())
return;
bcur = b.begin();
}
}
}
#endif
template <typename ...L, typename Compare = std::less<>>
static void merge_unique(std::forward_list<L...> &a, std::forward_list<L...> & b, Compare comp = std::less<>()) {
if (b.empty())
return;
if (a.empty()) {
a.swap(b);
return;
}
auto aprev = a.before_begin();
auto acur = a.begin();
auto bprev = b.before_begin();
auto bcur = b.begin();
while(!b.empty()) {
if (comp(*acur, *bcur)) {
aprev = acur;
if (++acur == a.end()) {
a.splice_after(aprev, move(b));
return;
}
} else if (comp(*bcur, *acur)) {
++bcur;
a.splice_after(aprev, b, bprev);
++aprev;
if (b.empty())
return;
} else {
b.pop_front();
if (b.empty())
return;
bcur = b.begin();
}
}
}
#include <list>
#if 0
template <typename ...L>
static void merge_unique(std::list<L...> &a, std::list<L...> & b) {
if (b.empty())
return;
if (a.empty()) {
a.swap(b);
return;
}
auto acur = a.begin();
auto bcur = b.begin();
for (;;) {
if (*acur < *bcur) {
if (++acur == a.end()) {
a.splice(acur, move(b));
return;
}
} else {
if (*bcur < *acur)
a.splice(acur, b, bcur);
else
b.pop_front();
if (b.empty())
return;
bcur = b.begin();
}
}
}
#endif
template <typename ...L, typename Compare = std::less<>>
static void merge_unique(std::list<L...> &a, std::list<L...> & b, Compare comp = std::less<>()) {
if (b.empty())
return;
if (a.empty()) {
a.swap(b);
return;
}
auto acur = a.begin();
auto bcur = b.begin();
for (;;) {
if (comp(*acur, *bcur)) {
if (++acur == a.end()) {
a.splice(acur, move(b));
return;
}
} else {
if (comp(*bcur, *acur))
a.splice(acur, b, bcur);
else
b.pop_front();
if (b.empty())
return;
bcur = b.begin();
}
}
}
#endif