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
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
|
#pragma once
#include <string>
#include <stdexcept>
#include <fstream>
#include <list>
#include <stdint.h>
#include <boost/iterator/iterator_facade.hpp>
#include <boost/iostreams/device/mapped_file.hpp>
namespace succinct { namespace util {
inline void trim_newline_chars(std::string& s)
{
size_t l = s.size();
while (l && (s[l-1] == '\r' ||
s[l-1] == '\n')) {
--l;
}
s.resize(l);
}
// this is considerably faster than std::getline
inline bool fast_getline(std::string& line, FILE* input = stdin, bool trim_newline = false)
{
line.clear();
static const size_t max_buffer = 65536;
char buffer[max_buffer];
bool done = false;
while (!done) {
if (!fgets(buffer, max_buffer, input)) {
if (!line.size()) {
return false;
} else {
done = true;
}
}
line += buffer;
if (*line.rbegin() == '\n') {
done = true;
}
}
if (trim_newline) {
trim_newline_chars(line);
}
return true;
}
class line_iterator
: public boost::iterator_facade<line_iterator
, std::string const
, boost::forward_traversal_tag
>
{
public:
line_iterator()
: m_file(0)
{}
explicit line_iterator(FILE* input, bool trim_newline = false)
: m_file(input)
, m_trim_newline(trim_newline)
{}
private:
friend class boost::iterator_core_access;
void increment() {
assert(m_file);
if (!fast_getline(m_line, m_file, m_trim_newline)) {
m_file = 0;
}
}
bool equal(line_iterator const& other) const
{
return this->m_file == other.m_file;
}
std::string const& dereference() const {
return m_line;
}
std::string m_line;
FILE* m_file;
bool m_trim_newline;
};
typedef std::pair<line_iterator, line_iterator> line_range_t;
inline line_range_t lines(FILE* ifs, bool trim_newline = false) {
return std::make_pair(line_iterator(ifs, trim_newline), line_iterator());
}
struct auto_file {
auto_file(const char* name, const char* mode = "rb")
: m_file(0)
{
m_file = fopen(name, mode);
if(!m_file) {
std::string msg("Unable to open file '");
msg += name;
msg += "'.";
throw std::invalid_argument(msg);
}
}
~auto_file()
{
if(m_file) {
fclose(m_file);
}
}
FILE* get()
{
return m_file;
}
private:
auto_file();
auto_file( const auto_file & );
auto_file & operator=( const auto_file & );
FILE * m_file;
};
typedef std::pair<const uint8_t*, const uint8_t*> char_range;
struct identity_adaptor
{
char_range operator()(char_range s) const
{
return s;
}
};
struct stl_string_adaptor
{
char_range operator()(std::string const& s) const
{
const uint8_t* buf = reinterpret_cast<const uint8_t*>(s.c_str());
const uint8_t* end = buf + s.size() + 1; // add the null terminator
return char_range(buf, end);
}
};
class buffer_line_iterator
: public boost::iterator_facade<buffer_line_iterator
, std::string const
, boost::forward_traversal_tag
>
{
public:
buffer_line_iterator()
: m_buffer(0)
, m_end(0)
, m_cur_pos(0)
{}
buffer_line_iterator(const char* buffer, size_t size)
: m_buffer(buffer)
, m_end(buffer + size)
, m_cur_pos(buffer)
{
increment();
}
private:
friend class boost::iterator_core_access;
void increment() {
assert(m_cur_pos);
if (m_cur_pos >= m_end) {
m_cur_pos = 0;
return;
}
const char* begin = m_cur_pos;
while (m_cur_pos < m_end && *m_cur_pos != '\n') {
++m_cur_pos;
}
const char* end = m_cur_pos;
++m_cur_pos; // skip the newline
if (begin != end && *(end - 1) == '\r') {
--end;
}
m_cur_value = std::string(begin, size_t(end - begin));
}
bool equal(buffer_line_iterator const& other) const
{
return m_cur_pos == other.m_cur_pos; }
std::string const& dereference() const
{
assert(m_cur_pos);
return m_cur_value;
}
const char* m_buffer;
const char* m_end;
const char* m_cur_pos;
std::string m_cur_value;
};
struct mmap_lines
{
typedef buffer_line_iterator iterator;
typedef buffer_line_iterator const_iterator;
mmap_lines(std::string filename)
: m_map(filename)
{}
const_iterator begin() const
{
return const_iterator(m_map.data(), m_map.size());
}
const_iterator end() const
{
return const_iterator();
}
private:
boost::iostreams::mapped_file_source m_map;
};
struct input_error : std::invalid_argument
{
input_error(std::string const& what)
: invalid_argument(what)
{}
};
template <typename T>
inline void dispose(T& t)
{
T().swap(t);
}
inline uint64_t int2nat(int64_t x)
{
if (x < 0) {
return uint64_t(-2 * x - 1);
} else {
return uint64_t(2 * x);
}
}
inline int64_t nat2int(uint64_t n)
{
if (n % 2) {
return -int64_t((n + 1) / 2);
} else {
return int64_t(n / 2);
}
}
template <typename IntType1, typename IntType2>
inline IntType1 ceil_div(IntType1 dividend, IntType2 divisor)
{
// XXX(ot): put some static check that IntType1 >= IntType2
IntType1 d = IntType1(divisor);
return IntType1(dividend + d - 1) / d;
}
}}
|
