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
|
#pragma once
#include "wyhash.h"
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include <utility>
#define ARRAY_SIZE(x) (sizeof(x) / sizeof(*x))
struct line_view {
const char* line;
size_t length;
line_view(const char* s = nullptr) : line(s) { length = s == nullptr ? 0 : strlen(s); }
line_view(const char* s, size_t l) : line(s), length(l) {}
line_view(const char* p1, const char* p2) : line(p1), length(p2 - p1) {}
friend std::ostream& operator<<(std::ostream& o, const line_view& lv) {
o << "[" << lv.length << ":";
for (size_t i = 0; i < lv.length; i++) {
o << lv.line[i];
}
o << "]";
return o;
}
bool operator<(const line_view& lv) const noexcept {
size_t i = 0;
size_t j = 0;
while (i < length && j < lv.length) {
if (line[i] < lv.line[j]) {
return true;
}
if (line[i] > lv.line[j]) {
return false;
}
i++;
j++;
}
return j < lv.length;
}
bool operator==(const line_view& lv) const noexcept {
const char* p1 = line;
const char* p2 = lv.line;
const char* p3 = p1 + length;
if (length != lv.length) {
return false;
}
while (p1 < p3) {
if (*p1++ != *p2++) {
return false;
}
}
return true;
}
const char* contains(const line_view& lv) const noexcept {
const char* p1 = line;
const char* p2 = line + length;
if (length < lv.length) {
return nullptr;
}
while (p1 + lv.length <= p2) {
if (*p1 == *lv.line) {
line_view x{p1, lv.length};
if (x == lv) {
return p1;
}
}
p1++;
}
return nullptr;
}
bool operator==(const char* l) const noexcept {
size_t i = 0;
while (i < this->length) {
if (l[i] != this->line[i]) {
return false;
}
i++;
}
return l[i] == '\0';
}
const char* contains(const char* s) const noexcept {
size_t len = strlen(s);
const char* p = line;
while (p + len <= line + length) {
if (*p == *s) {
line_view x{p, len};
if (x == s) {
return p;
}
}
p++;
}
return nullptr;
}
};
namespace std {
template <>
struct hash<line_view> {
size_t operator()(const line_view& lv) const noexcept { return wyhash(lv.line, lv.length, 0, _wyp); }
};
} // namespace std
line_view load_file(const char*);
line_view next_line(line_view, size_t*);
template <typename F, typename... Args>
void per_line(line_view file, F&& f, Args&&... args) {
size_t offset = 0;
line_view lv;
do {
lv = next_line(file, &offset);
if (!f(lv, std::forward<Args>(args)...)) {
break;
}
} while (offset < file.length);
}
template <typename F, typename... Args>
void per_char(line_view line, F&& f, Args&&... args) {
for (size_t i = 0; i < line.length; i++) {
if (!f(line.line[i], std::forward<Args>(args)...)) {
break;
}
}
}
struct ascii_count {
int count[256];
ascii_count(line_view lv) : count{0} {
per_char(lv, [this](char c) {
count[static_cast<int>(c)] += 1;
return true;
});
}
int operator[](char c) const noexcept { return count[static_cast<int>(c)]; }
friend std::ostream& operator<<(std::ostream& o, const ascii_count& ac) {
for (size_t i = 0; i < 256; i++) {
if (ac.count[i] > 0) {
o << i << " -> " << ac.count[i] << "\n";
}
}
return o;
}
};
bool is_repeated(const char* p1, const char* p2);
int gcd(int, int);
|
