Repository navigation
Expand file tree
/
Copy pathdebug.cpp
More file actions
153 lines (132 loc) · 2.74 KB
/
Copy pathdebug.cpp
File metadata and controls
153 lines (132 loc) · 2.74 KB
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
// debug file written by tourist, modified by Aaron He
// https://github.com/AaronHe7/competitive-programming/blob/master/algorithms/debug.cpp
using namespace std;
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
// Helper functions
template <typename A>
string to_csv(vector<A> v);
string wrap_round(string s) {
return "(" + s + ")";
}
string wrap_curly(string s) {
return "{" + s + "}";
}
string wrap_square(string s) {
return "[" + s + "]";
}
string wrap_angle(string s) {
return "<" + s + ">";
}
// Main functions
string to_string(string s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
string to_string(vector<bool> v) {
return wrap_curly(to_csv(v));
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A>
string to_string(vector<vector<A>> v) {
bool first = true;
string res = "\n{";
for (const auto x : v) {
if (!first) {
res += ", ";
res += "\n";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A>
string to_string(queue<A> q) {
vector<A> v;
while (!q.empty()) {
v.push_back(q.front());
q.pop();
}
string res = "<=" + wrap_curly(to_csv(v)) + "<=";
return res;
}
template <typename A>
string to_string(deque<A> dq) {
vector<A> v;
while (!dq.empty()) {
v.push_back(dq.front());
dq.pop_front();
}
string res = "<=>" + wrap_curly(to_csv(v)) + "<=>";
return res;
}
template <typename A>
string to_string(stack<A> s) {
vector<A> v;
while (!s.empty()) {
v.push_back(s.top());
s.pop();
}
string res = "<=>" + wrap_curly(to_csv(v));
return res;
}
template <typename A, typename B, typename C>
string to_string(priority_queue<A, B, C> q) {
vector<A> v;
while (!q.empty()) {
v.push_back(q.top());
q.pop();
}
string res = "<=>>" + wrap_curly(to_csv(v));
return res;
}
template <typename A>
string to_csv(vector<A> v) {
string res;
bool first = true;
for (A x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
return res;
}
void debug_out() { cerr << endl; }
template <typename Head>
void debug_out(Head H) {
cerr << to_string(H) << endl;
}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << to_string(H) << ", ";
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)