source: branches/HeuristicLab.Problems.DataAnalysis.Trading/HeuristicLab.Problems.DataAnalysis.Trading/3.4/Calculators/OnlineProfitCalculator.cs @ 9176

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2011 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
 *
 * This file is part of HeuristicLab.
 *
 * HeuristicLab is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * HeuristicLab is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
 */
#endregion

using System;
using System.Collections.Generic;
using HeuristicLab.Common;

namespace HeuristicLab.Problems.DataAnalysis {
  public class OnlineProfitCalculator : IOnlineCalculator {

    private int p;
    private double transactionCost;
    private int c;
    private double sum;
    public double Profit {
      get { return sum; }
    }

    public OnlineProfitCalculator(double transactionCost) {
      this.transactionCost = transactionCost;
      Reset();
    }

    #region IOnlineCalculator Members
    public OnlineCalculatorError ErrorState {
      get { return OnlineCalculatorError.None; }
    }
    public double Value {
      get { return Profit; }
    }
    public void Reset() {
      p = 0;
      c = 0;
      sum = 0.0;
    }

    public void Add(double actualReturn, double signal) {
      double iterationReturn = 0.0;
      if (c == 0) {
        p = (int)signal;
        iterationReturn = 0;
        c++;
      } else {
        if (p == 0 && signal.IsAlmost(0)) {
        } else if (p == 0 && signal.IsAlmost(1)) {
          p = 1;
        } else if (p == 0 && signal.IsAlmost(-1)) {
          p = -1;
        } else if (p == 1 && signal.IsAlmost(1)) {
          iterationReturn = actualReturn;
        } else if (p == 1 && signal.IsAlmost(0)) {
          iterationReturn = actualReturn - transactionCost;
          p = 0;
        } else if (p == 1 && signal.IsAlmost(-1)) {
          iterationReturn = actualReturn - transactionCost;
          p = -1;
        } else if (p == -1 && signal.IsAlmost(-1)) {
          iterationReturn = -actualReturn;
        } else if (p == -1 && signal.IsAlmost(0)) {
          iterationReturn = -actualReturn - transactionCost;
          p = 0;
        } else if (p == -1 && signal.IsAlmost(1)) {
          iterationReturn = -actualReturn - transactionCost;
          p = 1;
        }
        c++;
      }
      sum += iterationReturn;
    }
    #endregion

    public static double Calculate(IEnumerable<double> returns, IEnumerable<double> signals, double transactionCost, out OnlineCalculatorError errorState) {
      IEnumerator<double> returnsEnumerator = returns.GetEnumerator();
      IEnumerator<double> signalsEnumerator = signals.GetEnumerator();
      OnlineProfitCalculator calculator = new OnlineProfitCalculator(transactionCost);

      // always move forward both enumerators (do not use short-circuit evaluation!)
      while (returnsEnumerator.MoveNext() & signalsEnumerator.MoveNext()) {
        double signal = signalsEnumerator.Current;
        double @return = returnsEnumerator.Current;
        calculator.Add(@return, signal);
      }

      // check if both enumerators are at the end to make sure both enumerations have the same length
      if (returnsEnumerator.MoveNext() || signalsEnumerator.MoveNext()) {
        throw new ArgumentException("Number of elements in first and second enumeration doesn't match.");
      } else {
        errorState = calculator.ErrorState;
        return calculator.Profit;
      }
    }
  }
}