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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
|
#pragma once
#include "../std/functional.hpp"
#include "../std/iterator.hpp"
#include "../std/map.hpp"
template <class ContainerT> class BackInsertFunctor
{
ContainerT & m_Container;
public:
explicit BackInsertFunctor(ContainerT & container) : m_Container(container)
{
}
void operator() (typename ContainerT::value_type const & t) const
{
m_Container.push_back(t);
}
};
template <class ContainerT>
BackInsertFunctor<ContainerT> MakeBackInsertFunctor(ContainerT & container)
{
return BackInsertFunctor<ContainerT>(container);
}
template <class ContainerT> class InsertFunctor
{
ContainerT & m_Container;
public:
explicit InsertFunctor(ContainerT & container) : m_Container(container)
{
}
void operator() (typename ContainerT::value_type const & t) const
{
m_Container.insert(t);
}
};
template <class ContainerT>
InsertFunctor<ContainerT> MakeInsertFunctor(ContainerT & container)
{
return InsertFunctor<ContainerT>(container);
}
template <class IterT, class CompareT> inline bool IsSorted(IterT beg, IterT end, CompareT comp)
{
if (beg == end)
return true;
IterT prev = beg;
for (++beg; beg != end; ++beg, ++prev)
{
if (comp(*beg, *prev))
return false;
}
return true;
}
template <class IterT, class CompareT>
inline bool IsSortedAndUnique(IterT beg, IterT end, CompareT comp)
{
if (beg == end)
return true;
IterT prev = beg;
for (++beg; beg != end; ++beg, ++prev)
{
if (!comp(*prev, *beg))
return false;
}
return true;
}
template <class IterT, class CompareT>
IterT RemoveIfKeepValid(IterT beg, IterT end, CompareT comp)
{
while (beg != end)
{
if (comp(*beg))
{
while (beg != --end)
{
if (!comp(*end))
{
swap(*beg, *end);
++beg;
break;
}
}
}
else
++beg;
}
return end;
}
template <class IterT> inline bool IsSorted(IterT beg, IterT end)
{
return IsSorted(beg, end, less<typename iterator_traits<IterT>::value_type>());
}
template <class IterT> inline bool IsSortedAndUnique(IterT beg, IterT end)
{
return IsSortedAndUnique(beg, end, less<typename iterator_traits<IterT>::value_type>());
}
struct DeleteFunctor
{
template <typename T> void operator() (T const * p) const
{
delete p;
}
};
namespace impl
{
template <class TContainer, class TDeletor> class DeleteRangeFunctor
{
TContainer & m_cont;
TDeletor m_deletor;
public:
DeleteRangeFunctor(TContainer & cont, TDeletor const & deletor)
: m_cont(cont), m_deletor(deletor)
{
}
void operator() ()
{
for_each(m_cont.begin(), m_cont.end(), m_deletor);
m_cont.clear();
}
};
}
template <class TContainer, class TDeletor>
impl::DeleteRangeFunctor<TContainer, TDeletor>
GetRangeDeletor(TContainer & cont, TDeletor const & deletor)
{
return impl::DeleteRangeFunctor<TContainer, TDeletor>(cont, deletor);
}
struct NoopFunctor
{
template <typename T> void operator () (T const &) const
{
}
};
struct IdFunctor
{
template <typename T> inline T operator () (T const & x) const
{
return x;
}
};
template <typename IterT> IterT NextIterInCycle(IterT it, IterT beg, IterT end)
{
if (++it == end)
return beg;
return it;
}
template <typename IterT> IterT PrevIterInCycle(IterT it, IterT beg, IterT end)
{
if (it == beg)
it = end;
return --it;
}
template <class IterT1, class IterT2, class InsertIterT>
void AccumulateIntervals1With2(IterT1 b1, IterT1 e1, IterT2 b2, IterT2 e2, InsertIterT res)
{
//typedef typename iterator_traits<InsertIterT>::value_type T;
typedef typename iterator_traits<IterT1>::value_type T;
T prev;
bool validPrev = false;
while (b1 != e1 || b2 != e2)
{
// Try to continue previous range.
if (validPrev)
{
// add b1 range to prev if needed
if (b1 != e1 && b1->first < prev.second)
{
// correct only second if needed
if (prev.second < b1->second)
prev.second = b1->second;
++b1;
continue;
}
// add b2 range to prev if needed
if (b2 != e2 && b2->first < prev.second)
{
// check that intervals are overlapped
if (prev.first < b2->second)
{
// correct first and second if needed
if (b2->first < prev.first)
prev.first = b2->first;
if (prev.second < b2->second)
prev.second = b2->second;
}
++b2;
continue;
}
// if nothing to add - push to results
*res++ = prev;
validPrev = false;
}
if (b1 != e1)
{
// start new range
prev = *b1++;
validPrev = true;
}
else
{
// go to exit
break;
}
}
if (validPrev)
*res++ = prev;
}
|
