#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2013 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.Collections.Generic;
using System.Linq;
using System.Windows.Forms;
using HeuristicLab.DataImporter.Data;
using HeuristicLab.DataImporter.Data.CommandBase;
using HeuristicLab.DataImporter.Data.Model;
using HEAL.Attic;

namespace HeuristicLab.DataImporter.Command {
  [StorableType("FAA97EE8-F435-4DA0-8334-0F9F98C63A55")]
  [ViewableCommandInfoAttribute("Linear Interpolation", 1, ColumnGroupState.DoubleColumnSelected | ColumnGroupState.AnySelectedColumnContainsNull,
    "Handle Missing Values", Position = 2)]
  public class FillMissingValuesWithLinearInterpolation : FillMissingValueCommandBase {
    [StorableConstructor]
    protected FillMissingValuesWithLinearInterpolation(StorableConstructorFlag _) : base(_) { }
    public FillMissingValuesWithLinearInterpolation(DataSet dataSet, string columnGroupName, int[] affectedColumns) :
      base(dataSet, columnGroupName, affectedColumns) {
    }

    public override string Description {
      get { return "Interpolate missing values"; }
    }

    public override void Execute() {
      base.Execute();
      DoubleColumn column;
      int startIndex = -1;
      int endIndex = -1;
      oldSortOrder = ColumnGroup.SortOrdersForColumns.ToList();
      oldSortedColumnIndexes = new List<int>(ColumnGroup.SortedColumnIndexes);
      foreach (int col in AffectedColumns) {
        if (ColumnGroup.GetColumn(col) is DoubleColumn && ColumnGroup.GetColumn(col).ContainsNullValues) {
          column = (DoubleColumn)ColumnGroup.Columns.ElementAt(col);
          if (column.SortOrder != SortOrder.None)
            ColumnGroup.ResetSorting();
          nullValues.Add(col, new List<int>());
          startIndex = FindNextNotNullValueIndex(column, startIndex);
          endIndex = FindNextNotNullValueIndex(column, startIndex);
          while (endIndex != -1) {
            if (endIndex - startIndex != 1) {
              nullValues[col].AddRange(Enumerable.Range(startIndex + 1, endIndex - startIndex - 1));
              InterpolateValues(column, startIndex, endIndex);
            }
            startIndex = endIndex;
            endIndex = FindNextNotNullValueIndex(column, endIndex);
          }
          startIndex = -1;
        }
      }
      ColumnGroup.FireChanged();
      ColumnGroup = null;
    }

    private int FindNextNotNullValueIndex(DoubleColumn column, int startIndex) {
      int endIndex = -1;
      for (int i = startIndex + 1; i < column.TotalValuesCount && endIndex == -1; i++)
        if (column.GetValue(i) != null)
          endIndex = i;
      return endIndex;
    }

    private void InterpolateValues(DoubleColumn column, int startIndex, int endIndex) {
      double startValue = (double)column.GetValue(startIndex);
      double endValue = (double)column.GetValue(endIndex);
      double stepwidth = (endValue - startValue) / (endIndex - startIndex);

      for (int i = startIndex + 1; i < endIndex; i++) {
        if (column.GetValue(i) != null)
          throw new CommandExecutionException("Tried to manipulate non null value!", this);
        column.ChangeValue(i, startValue + stepwidth * (i - startIndex));
      }
    }
  }
}