path: root/walk.h

#ifndef _WALK_H
#define _WALK_H

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

#include <iostream>
#include <deque>

namespace ledger {

class item_predicate
{
  const node_t *   predicate;

 public:
  item_predicate(const node_t * _predicate) : predicate(_predicate) {}

  bool operator()(const entry_t * entry) const {
    if (predicate) {
      balance_t result;
      predicate->compute(result, details_t(entry));
      return result;
    } else {
      return true;
    }
  }

  bool operator()(const transaction_t * xact) const {
    if (predicate) {
      balance_t result;
      predicate->compute(result, details_t(xact));
      return result;
    } else {
      return true;
    }
  }

  bool operator()(const account_t * account) const {
    if (predicate) {
      balance_t result;
      predicate->compute(result, details_t(account));
      return result;
    } else {
      return true;
    }
  }
};

inline void add_to_balance_pair(balance_pair_t& balance,
				transaction_t * xact,
				const bool      inverted = false)
{
  if (inverted) {
    balance.quantity += - xact->amount;
    balance.cost     += - xact->cost;
  } else {
    balance += *xact;
  }
}

class format_transaction
{
  std::ostream&   output_stream;
  const format_t& first_line_format;
  const format_t& next_lines_format;
  unsigned int	  index;
  entry_t *	  last_entry;

 public:
  format_transaction(std::ostream&   _output_stream,
		     const format_t& _first_line_format,
		     const format_t& _next_lines_format)
    : output_stream(_output_stream),
      first_line_format(_first_line_format),
      next_lines_format(_next_lines_format),
      index(0), last_entry(NULL) {}

  void operator()(transaction_t * xact, const bool inverted);
};

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 bool inverted) {
    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 bool inverted) const {}
};

template <typename Function>
void handle_transaction(transaction_t *  xact,
			Function         functor,
			item_predicate&  pred_functor,
			const bool	 related,
			const bool	 inverted)
{
  // If inverted is true, it implies related.
  if (! inverted && ! (xact->flags & TRANSACTION_HANDLED)) {
    xact->flags |= TRANSACTION_HANDLED;
    if (pred_functor(xact)) {
      xact->flags |= TRANSACTION_DISPLAYED;
      functor(xact, inverted);
    }
  }

  if (related)
    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;
      if (pred_functor(xact)) {
	xact->flags |= TRANSACTION_DISPLAYED;
	functor(*i, inverted);
      }
    }
}

template <typename Function>
void walk_entries(entries_list::iterator begin,
		  entries_list::iterator end,
		  Function		 functor,
		  const node_t *	 predicate,
		  const bool		 related,
		  const bool		 inverted,
		  const node_t *         display_predicate = NULL)
{
  item_predicate pred_functor(predicate);
  item_predicate disp_pred_functor(display_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, disp_pred_functor, related, inverted);
}

template <typename Function>
void walk_transactions(transactions_list::iterator begin,
		       transactions_list::iterator end,
		       Function	      functor,
		       const node_t * predicate,
		       const bool     related,
		       const bool     inverted,
		       const node_t * display_predicate = NULL)
{
  for (transactions_list::iterator i = begin; i != end; i++)
    functor(*i, inverted);
}

template <typename Function>
void walk_transactions(transactions_deque::iterator begin,
		       transactions_deque::iterator end,
		       Function	      functor,
		       const node_t * predicate,
		       const bool     related,
		       const bool     inverted,
		       const node_t * display_predicate = NULL)
{
  for (transactions_deque::iterator i = begin; i != end; i++)
    functor(*i, inverted);
}

class format_account
{
  std::ostream&     output_stream;
  const format_t&   format;
  const account_t * last_account;

 public:
  format_account(std::ostream& _output_stream, const format_t& _format)
    : output_stream(_output_stream), format(_format) {}

  void operator()(const account_t * account, bool report_top = false);
};

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(const account_t * account,
		    Function	      functor,
		    const node_t *    display_predicate)
{
  if (! display_predicate || item_predicate(display_predicate)(account))
    functor(account);

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

template <typename Function>
void walk__accounts_sorted(const account_t * account,
			   Function	     functor,
			   const node_t *    sort_order,
			   const node_t *    display_predicate)
{
  if (! display_predicate || item_predicate(display_predicate)(account))
    functor(account);

  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, sort_order, display_predicate);
}

void calc__accounts(account_t *    account,
		    const node_t * predicate,
		    const bool	   related,
		    const bool	   inverted,
		    const bool     calc_subtotals);

template <typename Function>
void walk_accounts(account_t *	  account,
		   Function	  functor,
		   const node_t * predicate,
		   const bool	  related,
		   const bool	  inverted,
		   const bool	  calc_subtotals,
		   const node_t * display_predicate = NULL,
		   const node_t * sort_order        = NULL)
{
  calc__accounts(account, predicate, related, inverted, calc_subtotals);

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

} // namespace ledger

#endif // _WALK_H