ledger/walk.h

#ifndef _WALK_H
#define _WALK_H

#include "ledger.h"
#include "balance.h"
#include "valexpr.h"

#include <iostream>
#include <deque>

namespace ledger {

template <typename T>
struct compare_items {
  const node_t * sort_order;

  compare_items(const node_t * _sort_order)
    : sort_order(_sort_order) {
    assert(sort_order);
  }

  bool operator()(const T * left, const T * right) const {
    assert(left);
    assert(right);
    balance_t left_result;
    sort_order->compute(left_result, details_t(left));
    balance_t right_result;
    sort_order->compute(right_result, details_t(right));
    return left_result < right_result;
  }
};

typedef std::deque<transaction_t *> transactions_deque;

class collect_transactions
{
  transactions_deque& transactions;

 public:
  collect_transactions(transactions_deque& _transactions)
    : transactions(_transactions) {}

  void operator()(transaction_t * xact) const {
    transactions.push_back(xact);
  }
};

inline void sort_transactions(transactions_deque& transactions,
			      const node_t *	  sort_order)
{
  std::stable_sort(transactions.begin(), transactions.end(),
		   compare_items<transaction_t>(sort_order));
}

class ignore_transaction
{
 public:
  void operator()(transaction_t * xact) const {}
};

#define MATCHING_TRANSACTIONS 0x01
#define OTHER_TRANSACTIONS    0x02

template <typename Function>
void handle_transaction(transaction_t * xact,
			const Function&	functor,
			unsigned int	flags)
{
  if ((flags & MATCHING_TRANSACTIONS) &&
      ! (xact->flags & TRANSACTION_HANDLED)) {
    xact->flags |= TRANSACTION_HANDLED;
    functor(xact);
  }

  if (flags & OTHER_TRANSACTIONS)
    for (transactions_list::iterator i = xact->entry->transactions.begin();
	 i != xact->entry->transactions.end();
	 i++) {
      if (*i == xact || ((*i)->flags & (TRANSACTION_AUTO |
					TRANSACTION_HANDLED)))
	continue;

      (*i)->flags |= TRANSACTION_HANDLED;
      functor(*i);
    }
}

template <typename Function>
void walk_entries(entries_list::iterator begin,
		  entries_list::iterator end,
		  const Function& functor,
		  const node_t *  predicate,
		  unsigned int	  flags)
{
  item_predicate<transaction_t> pred_functor(predicate);

  for (entries_list::iterator i = begin; i != end; i++)
    for (transactions_list::iterator j = (*i)->transactions.begin();
	 j != (*i)->transactions.end();
	 j++)
      if (pred_functor(*j))
	handle_transaction(*j, functor, flags);
}

template <typename Function>
void walk_entries(entries_list::iterator begin,
		  entries_list::iterator end, const Function& functor)
{
  for (entries_list::iterator i = begin; i != end; i++)
    for (transactions_list::iterator j = (*i)->transactions.begin();
	 j != (*i)->transactions.end();
	 j++)
      functor(*j);
}

class clear_flags
{
 public:
  void operator()(transaction_t * xact) const {
    xact->flags &= ~TRANSACTION_TRANSIENT;
  }
};

inline void clear_transaction_display_flags(entries_list::iterator begin,
					    entries_list::iterator end)
{
  walk_entries<clear_flags>(begin, end, clear_flags());
}

template <typename Function>
void walk_transactions(transactions_list::iterator begin,
		       transactions_list::iterator end,
		       const Function& functor)
{
  for (transactions_list::iterator i = begin; i != end; i++)
    functor(*i);
}

template <typename Function>
void walk_transactions(transactions_deque::iterator begin,
		       transactions_deque::iterator end,
		       const Function& functor)
{
  for (transactions_deque::iterator i = begin; i != end; i++)
    functor(*i);
}

typedef std::deque<account_t *> accounts_deque;

inline void sort_accounts(account_t *	  account,
			  accounts_deque& accounts,
			  const node_t *  sort_order)
{
  for (accounts_map::iterator i = account->accounts.begin();
       i != account->accounts.end();
       i++)
    accounts.push_back((*i).second);

  std::stable_sort(accounts.begin(), accounts.end(),
		   compare_items<account_t>(sort_order));
}

template <typename Function>
void walk__accounts(account_t *        account,
		    const Function&    functor,
		    const unsigned int max_depth)
{
  functor(account, max_depth);

  for (accounts_map::const_iterator i = account->accounts.begin();
       i != account->accounts.end();
       i++)
    walk__accounts((*i).second, functor, max_depth);
}

template <typename Function>
void walk__accounts_sorted(account_t *        account,
			   const Function&    functor,
			   const unsigned int max_depth,
			   const node_t *     sort_order)
{
  functor(account, max_depth);

  accounts_deque accounts;

  for (accounts_map::const_iterator i = account->accounts.begin();
       i != account->accounts.end();
       i++)
    accounts.push_back((*i).second);

  std::stable_sort(accounts.begin(), accounts.end(),
		   compare_items<account_t>(sort_order));

  for (accounts_deque::const_iterator i = accounts.begin();
       i != accounts.end();
       i++)
    walk__accounts_sorted(*i, functor, max_depth, sort_order);
}

template <typename Function>
void for_each_account(account_t * account, const Function& functor)
{
  functor(account);

  for (accounts_map::iterator i = account->accounts.begin();
       i != account->accounts.end();
       i++)
    walk__accounts((*i).second, functor);
}

void calc__accounts(account_t * account,
		    item_predicate<transaction_t>& pred_functor,
		    unsigned int flags);

inline void sum__accounts(account_t * account)
{
  for (accounts_map::iterator i = account->accounts.begin();
       i != account->accounts.end();
       i++) {
    sum__accounts((*i).second);
    account->total += (*i).second->total;
  }
  account->total += account->value;
}

template <typename Function>
void walk_accounts(account_t *	      account,
		   const Function&    functor,
		   const node_t *     predicate,
		   unsigned int	      flags,
		   const bool	      calc_subtotals,
		   const unsigned int max_depth,
		   const node_t *     sort_order = NULL)
{
  item_predicate<transaction_t> pred_functor(predicate);

  calc__accounts(account, pred_functor, flags);
  if (calc_subtotals)
    sum__accounts(account);

  if (sort_order)
    walk__accounts_sorted<Function>(account, functor, max_depth, sort_order);
  else
    walk__accounts<Function>(account, functor, max_depth);
}

} // namespace ledger

#endif // _WALK_H