88 lines
1.8 KiB
C++
88 lines
1.8 KiB
C++
#include "balance.h"
|
|
#include "util.h"
|
|
|
|
#include <deque>
|
|
#include <algorithm>
|
|
|
|
namespace ledger {
|
|
|
|
amount_t balance_t::amount(const commodity_t& commodity) const
|
|
{
|
|
if (! commodity) {
|
|
if (amounts.size() == 1) {
|
|
amounts_map::const_iterator i = amounts.begin();
|
|
return (*i).second;
|
|
}
|
|
}
|
|
else if (amounts.size() > 0) {
|
|
amounts_map::const_iterator i = amounts.find(&commodity);
|
|
if (i != amounts.end())
|
|
return (*i).second;
|
|
}
|
|
return amount_t();
|
|
}
|
|
|
|
balance_t balance_t::value(const std::time_t moment) const
|
|
{
|
|
balance_t temp;
|
|
|
|
for (amounts_map::const_iterator i = amounts.begin();
|
|
i != amounts.end();
|
|
i++)
|
|
temp += (*i).second.value(moment);
|
|
|
|
return temp;
|
|
}
|
|
|
|
struct compare_amount_commodities {
|
|
bool operator()(const amount_t * left, const amount_t * right) const {
|
|
return left->commodity().symbol < right->commodity().symbol;
|
|
}
|
|
};
|
|
|
|
void balance_t::write(std::ostream& out,
|
|
const int first_width,
|
|
const int latter_width) const
|
|
{
|
|
bool first = true;
|
|
int lwidth = latter_width;
|
|
|
|
if (lwidth == -1)
|
|
lwidth = first_width;
|
|
|
|
typedef std::deque<const amount_t *> amounts_deque;
|
|
amounts_deque sorted;
|
|
|
|
for (amounts_map::const_iterator i = amounts.begin();
|
|
i != amounts.end();
|
|
i++)
|
|
if ((*i).second)
|
|
sorted.push_back(&(*i).second);
|
|
|
|
std::stable_sort(sorted.begin(), sorted.end(), compare_amount_commodities());
|
|
|
|
for (amounts_deque::const_iterator i = sorted.begin();
|
|
i != sorted.end();
|
|
i++) {
|
|
int width;
|
|
if (! first) {
|
|
out << std::endl;
|
|
width = lwidth;
|
|
} else {
|
|
first = false;
|
|
width = first_width;
|
|
}
|
|
|
|
out.width(width);
|
|
out.fill(' ');
|
|
out << std::right << **i;
|
|
}
|
|
|
|
if (first) {
|
|
out.width(first_width);
|
|
out.fill(' ');
|
|
out << std::right << "0";
|
|
}
|
|
}
|
|
|
|
} // namespace ledger
|