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
|
#include "item.h"
namespace ledger {
// jww (2004-07-21): If format.show_empty is set, then include all
// subaccounts, empty balanced or no
item_t * walk_accounts(const account_t * account,
const constraints_t& constraints,
const bool compute_subtotals)
{
item_t * item = new item_t;
item->account = account;
item->date = end_date(constraints);
for (constrained_transactions_list_const_iterator
i(account->transactions.begin(),
account->transactions.end(), constraints);
i != account->transactions.end();
i++) {
item->value += *(*i);
if (compute_subtotals)
item->total += *(*i);
}
for (accounts_map::const_iterator i = account->accounts.begin();
i != account->accounts.end();
i++) {
item_t * subitem = walk_accounts((*i).second, constraints,
compute_subtotals);
subitem->parent = item;
if (compute_subtotals)
item->total += subitem->total;
if (compute_subtotals ? subitem->total : subitem->value)
item->subitems.push_back(subitem);
}
return item;
}
static inline void sum_items(const item_t * top,
item_t * item,
const bool compute_subtotals)
{
if (top->account == item->account) {
item->value += top->value;
if (compute_subtotals)
item->total += top->value;
}
for (items_deque::const_iterator i = top->subitems.begin();
i != top->subitems.end();
i++)
sum_items(*i, item, compute_subtotals);
}
item_t * walk_items(const item_t * top,
const account_t * account,
const constraints_t& constraints,
const bool compute_subtotals)
{
item_t * item = new item_t;
item->account = account;
sum_items(top, item, compute_subtotals);
for (accounts_map::const_iterator i = account->accounts.begin();
i != account->accounts.end();
i++) {
item_t * subitem = walk_items(top, (*i).second, constraints,
compute_subtotals);
subitem->parent = item;
if (compute_subtotals)
item->total += subitem->total;
if (compute_subtotals ? subitem->total : subitem->value)
item->subitems.push_back(subitem);
}
return item;
}
item_t * walk_entries(entries_list::const_iterator begin,
entries_list::const_iterator end,
const constraints_t& constraints,
const format_t& format)
{
#if 0
int last_mon = -1;
#endif
unsigned int count = 0;
item_t * result = NULL;
for (constrained_entries_list_const_iterator i(begin, end, constraints);
i != end;
i++) {
item_t * item = NULL;
for (constrained_transactions_list_const_iterator
j((*i)->transactions.begin(), (*i)->transactions.end(),
constraints);
j != (*i)->transactions.end();
j++) {
assert(*i == (*j)->entry);
if (! item) {
item = new item_t;
item->index = count++;
item->date = (*i)->date;
item->payee = (*i)->payee;
}
if (! format.show_inverted) {
item_t * subitem = new item_t;
subitem->parent = item;
subitem->date = item->date;
subitem->account = (*j)->account;
subitem->value = *(*j);
item->subitems.push_back(subitem);
}
if (format.show_related)
for (transactions_list::iterator k = (*i)->transactions.begin();
k != (*i)->transactions.end();
k++)
if (*k != *j && ! ((*k)->flags & TRANSACTION_VIRTUAL)) {
item_t * subitem = new item_t;
subitem->parent = item;
subitem->date = item->date;
subitem->account = (*k)->account;
subitem->value = *(*k);
if (format.show_inverted)
subitem->value.negate();
item->subitems.push_back(subitem);
}
#if 0
// If we are collecting monthly totals, then add them if the
// month of this entry is different from the month of previous
// entries.
if (format.period == PERIOD_MONTHLY) {
int entry_mon = std::gmtime(&(*i)->date)->tm_mon;
if (last_mon != -1 && entry_mon != last_mon &&
line_balances.size() > 0) {
if (last_date == 0)
last_date = (*i)->date;
if (reg) {
char buf[32];
std::strftime(buf, 31, "%B", std::gmtime(&last_date));
reg->lines.push_back(register_line_t(last_date, buf));
reg->lines.back().compute_items(line_balances, total, count);
} else {
count++;
}
line_balances.clear();
}
last_mon = entry_mon;
last_date = (*i)->date;
}
#endif
}
if (item) {
if (! result)
result = new item_t;
item->parent = result;
result->subitems.push_back(item);
}
}
return result;
#if 0
// Wrap up any left over balance list information.
if (line_balances.size() > 0) {
assert(format.period == PERIOD_MONTHLY);
assert(last_date != 0);
if (reg) {
char buf[32];
std::strftime(buf, 31, "%B", std::gmtime(&last_date));
reg->lines.push_back(register_line_t(last_date, buf));
reg->lines.back().compute_items(line_balances, total, count);
} else {
count++;
}
//line_balances.clear();
}
return count;
#endif
}
struct cmp_items {
const node_t * sort_order;
cmp_items(const node_t * _sort_order) : sort_order(_sort_order) {}
bool operator()(const item_t * left, const item_t * right) const {
assert(left);
assert(right);
assert(sort_order);
return sort_order->compute(left) < sort_order->compute(right);
}
};
void item_t::sort(const node_t * sort_order)
{
std::sort(subitems.begin(), subitems.end(), cmp_items(sort_order));
}
} // namespace ledger
|
