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
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
|
#include "ledger.h"
#include <fstream>
namespace ledger {
bool use_warnings = false;
state main_ledger;
std::list<mask> regexps;
#ifdef HUQUQULLAH
bool compute_huquq;
std::list<mask> huquq_categories;
#endif
void entry::print(std::ostream& out) const
{
char buf[32];
std::strftime(buf, 31, "%Y.%m.%d ", std::localtime(&date));
out << buf;
if (cleared)
out << "* ";
if (! code.empty())
out << '(' << code << ") ";
if (! desc.empty())
out << " " << desc;
out << std::endl;
bool shortcut = xacts.size() == 2;
if (shortcut &&
xacts.front()->cost->comm() != xacts.back()->cost->comm())
shortcut = false;
for (std::list<transaction *>::const_iterator i = xacts.begin();
i != xacts.end();
i++) {
out << " ";
out.width(30);
out << std::left << (*i)->acct->as_str();
if (! shortcut || i == xacts.begin()) {
out << " ";
out.width(10);
out << std::right << (*i)->cost->as_str(true);
}
if (! (*i)->note.empty())
out << " ; " << (*i)->note;
out << std::endl;
}
out << std::endl;
}
bool entry::validate() const
{
totals balance;
for (std::list<transaction *>::const_iterator i = xacts.begin();
i != xacts.end();
i++)
balance.credit((*i)->cost->value());
if (balance) {
std::cerr << "Totals are:" << std::endl;
balance.print(std::cerr, 20);
std::cerr << std::endl;
}
return ! balance; // must balance to 0.0
}
bool entry::matches(const std::list<mask>& regexps) const
{
if (regexps.empty() || (ledger::matches(regexps, code) ||
ledger::matches(regexps, desc))) {
return true;
}
else {
bool match = false;
for (std::list<transaction *>::const_iterator x = xacts.begin();
x != xacts.end();
x++) {
if (ledger::matches(regexps, (*x)->acct->name) ||
ledger::matches(regexps, (*x)->note)) {
match = true;
break;
}
}
return match;
}
}
#ifdef DO_CLEANUP
totals::~totals()
{
for (iterator i = amounts.begin(); i != amounts.end(); i++)
delete (*i).second;
}
#endif // DO_CLEANUP
void totals::credit(const totals& other)
{
for (const_iterator i = other.amounts.begin();
i != other.amounts.end();
i++)
credit((*i).second);
}
totals::operator bool() const
{
for (const_iterator i = amounts.begin(); i != amounts.end(); i++)
if (*((*i).second))
return true;
return false;
}
void totals::print(std::ostream& out, int width) const
{
bool first = true;
for (const_iterator i = amounts.begin(); i != amounts.end(); i++)
if (*((*i).second)) {
if (first)
first = false;
else
out << std::endl;
out.width(width);
out << std::right << *((*i).second);
}
}
amount * totals::value(const std::string& commodity) const
{
// Render all of the amounts into the given commodity. This
// requires known prices for each commodity.
amount * total = create_amount((commodity + " 0.00").c_str());
for (const_iterator i = amounts.begin(); i != amounts.end(); i++)
*total += *((*i).second);
return total;
}
// Print out the entire ledger that was read in, sorted by date.
// This can be used to "wash" ugly ledger files.
void print_ledger(int argc, char *argv[], std::ostream& out)
{
optind = 1;
// Compile the list of specified regular expressions, which can be
// specified on the command line, or using an include/exclude file
for (; optind < argc; optind++)
record_regexp(argv[optind], regexps);
// Sort the list of entries by date, then print them in order.
std::sort(main_ledger.entries.begin(), main_ledger.entries.end(),
cmp_entry_date());
for (entries_iterator i = main_ledger.entries.begin();
i != main_ledger.entries.end();
i++)
if ((*i)->matches(regexps))
(*i)->print(out);
}
void record_regexp(char * pattern, std::list<mask>& regexps)
{
bool exclude = false;
char * pat = pattern;
if (*pat == '-') {
exclude = true;
pat++;
while (std::isspace(*pat))
pat++;
}
else if (*pat == '+') {
pat++;
while (std::isspace(*pat))
pat++;
}
const char *error;
int erroffset;
pcre * re = pcre_compile(pat, PCRE_CASELESS, &error, &erroffset, NULL);
if (! re)
std::cerr << "Warning: Failed to compile regexp: " << pattern
<< std::endl;
else
regexps.push_back(mask(exclude, re));
}
void read_regexps(const char * path, std::list<mask>& regexps)
{
if (access(path, R_OK) != -1) {
std::ifstream file(path);
while (! file.eof()) {
char buf[80];
file.getline(buf, 79);
if (*buf && ! std::isspace(*buf))
record_regexp(buf, regexps);
}
}
}
bool matches(const std::list<mask>& regexps, const std::string& str,
bool * exclude)
{
// If the first pattern is an exclude, we assume all patterns match
// if they don't match the exclude. If the first pattern is an
// include, then only accounts matching the include will match.
bool match = (*regexps.begin()).exclude;
for (std::list<mask>::const_iterator r = regexps.begin();
r != regexps.end();
r++) {
int ovec[3];
if (pcre_exec((*r).regexp, NULL, str.c_str(), str.length(),
0, 0, ovec, 3) >= 0) {
if (exclude)
*exclude = (*r).exclude;
match = ! (*r).exclude;
}
}
return match;
}
#ifdef DO_CLEANUP
state::~state()
{
for (commodities_iterator i = commodities.begin();
i != commodities.end();
i++)
delete (*i).second;
for (accounts_iterator i = accounts.begin();
i != accounts.end();
i++)
delete (*i).second;
for (entries_iterator i = entries.begin();
i != entries.end();
i++)
delete *i;
}
#endif // DO_CLEANUP
void state::record_price(const char * setting)
{
char buf[128];
std::strcpy(buf, setting);
assert(std::strlen(setting) < 128);
char * c = buf;
char * p = std::strchr(buf, '=');
if (! p) {
std::cerr << "Warning: Invalid price setting: " << setting << std::endl;
} else {
*p++ = '\0';
prices.amounts.insert(totals::pair(c, create_amount(p)));
}
}
account * state::find_account(const char * name, bool create)
{
accounts_iterator i = accounts_cache.find(name);
if (i != accounts_cache.end())
return (*i).second;
char * buf = new char[std::strlen(name) + 1];
std::strcpy(buf, name);
account * current = NULL;
for (char * tok = std::strtok(buf, ":");
tok;
tok = std::strtok(NULL, ":")) {
if (! current) {
accounts_iterator i = accounts.find(tok);
if (i == accounts.end()) {
if (! create)
return NULL;
current = new account(tok);
accounts.insert(accounts_entry(tok, current));
} else {
current = (*i).second;
}
} else {
account::iterator i = current->children.find(tok);
if (i == current->children.end()) {
if (! create)
return NULL;
current = new account(tok, current);
current->parent->children.insert(accounts_entry(tok, current));
} else {
current = (*i).second;
}
}
}
delete[] buf;
if (current)
accounts_cache.insert(accounts_entry(name, current));
return current;
}
} // namespace ledger
|