#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2014 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 System.Linq;
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Data;
using HeuristicLab.Operators;
using HeuristicLab.Optimization;
using HeuristicLab.Parameters;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;

namespace HeuristicLab.Algorithms.VOffspringSelectionGeneticAlgorithm {
  [Item("ProbabilitiesGenerator", "An operator the generates the probability vector for Multi Crossovers/Mutators")]
  [StorableClass]
  public class ProbabilitiesGenerator : SingleSuccessorOperator {
    public ValueParameter<StringValue> SuccessfulOffspringFlagParameter {
      get { return (ValueParameter<StringValue>)Parameters["SuccessfulOffspringFlag"]; }
    }

    public ValueParameter<StringValue> OperatorNameVariableParameter {
      get { return (ValueParameter<StringValue>)Parameters["OperatorNameVariable"]; }
    }
    public LookupParameter<ResultCollection> SuccessfulOffspringAnalysisParameter {
      get { return (LookupParameter<ResultCollection>)Parameters["SuccessfulOffspringAnalysis"]; }
    }
    public LookupParameter<IOperator> CrossoverParameter {
      get { return (LookupParameter<IOperator>)Parameters["Crossover"]; }
    }
    public ILookupParameter<IntValue> GenerationsParameter {
      get { return (LookupParameter<IntValue>)Parameters["Generations"]; }
    }
    public LookupParameter<DoubleArray> ProbablilitiesParameter {
      get { return (LookupParameter<DoubleArray>)Parameters["Probabilities"]; }

    }
    public ValueParameter<DoubleValue> MinimumOperatorUsageParameter {
      get { return (ValueParameter<DoubleValue>)Parameters["MinimumOperatorUsage"]; }
    }

    public override IDeepCloneable Clone(Cloner cloner) {
      return new ProbabilitiesGenerator(this, cloner);
    }
    [StorableConstructor]
    private ProbabilitiesGenerator(bool deserializing) : base(deserializing) { }
    private ProbabilitiesGenerator(ProbabilitiesGenerator original, Cloner cloner) : base(original, cloner) { }
    public ProbabilitiesGenerator()
      : base() {
      Parameters.Add(new ValueParameter<StringValue>("SuccessfulOffspringFlag", "The name of the flag which indicates if the individual was successful.", new StringValue("SuccessfulOffspring")));
      Parameters.Add(new ValueParameter<StringValue>("OperatorNameVariable", "The properties of the successful offspring that should be collected.", new StringValue("SelectedCrossoverOperator")));
      Parameters.Add(new LookupParameter<IntValue>("Generations", "The current number of generations."));
      Parameters.Add(new LookupParameter<ResultCollection>("SuccessfulOffspringAnalysis", "The successful offspring analysis which is created."));
      Parameters.Add(new LookupParameter<DoubleArray>("Probabilities"));
      Parameters.Add(new LookupParameter<IOperator>("Crossover"));
      Parameters.Add(new ValueParameter<DoubleValue>("MinimumOperatorUsage", "Minimum percentage of operator usage. ", new DoubleValue(0.05)));
    }

    public override IOperation Apply() {
      IScope scope = ExecutionContext.Scope;
      IScope offspring = scope.SubScopes[1];
      string operatorName = OperatorNameVariableParameter.Value.Value;
      string succssFlag = SuccessfulOffspringFlagParameter.Value.Value;
      Dictionary<string, int> operatorCount = new Dictionary<string, int>();
      Dictionary<string, int> successfulOperatorCount = new Dictionary<string, int>();

      var crossover = CrossoverParameter.ActualValue;
      if (crossover.GetType().GetInterfaces().Any(x => x.IsGenericType &&
        x.GetGenericTypeDefinition() == typeof(ICheckedMultiOperator<>))) {

        for (int i = 0; i < offspring.SubScopes.Count; i++) {
          // fetch values from scopes
          IVariable tmpVar;
          if (!offspring.SubScopes[i].Variables.TryGetValue(succssFlag, out tmpVar))
            throw new InvalidOperationException(Name + ": Could not determine if an offspring was successful or not.");
          BoolValue success = (tmpVar.Value as BoolValue);
          if (success == null) throw new InvalidOperationException(Name + ": The variable that indicates whether an offspring is successful or not must contain a BoolValue.");

          if (!offspring.SubScopes[i].Variables.TryGetValue(operatorName, out tmpVar))
            throw new InvalidOperationException(Name + ": Could not determine operator an offspring was created with.");
          StringValue op = (tmpVar.Value as StringValue);
          if (op == null) throw new InvalidOperationException(Name + ": The variable the contains the operator name must be a string.");

          if (!operatorCount.ContainsKey(op.Value)) {
            operatorCount.Add(op.Value, 1);
          } else {
            operatorCount[op.Value]++;
          }

          if (success.Value) {
            if (!successfulOperatorCount.ContainsKey(op.Value)) {
              successfulOperatorCount.Add(op.Value, 1);
            } else {
              successfulOperatorCount[op.Value]++;
            }
          }
        }

        dynamic opCrossover = (dynamic)crossover;
        int crossoverCount = (int)opCrossover.Operators.Count;
        int checkedCrossoverCount = Enumerable.Count(opCrossover.Operators.CheckedItems);
        dynamic[] crossoverNames = new dynamic[checkedCrossoverCount];
        dynamic checkedItemsArray = Enumerable.ToArray(opCrossover.Operators.CheckedItems);

        for (int i = 0; i < checkedCrossoverCount; i++) {
          crossoverNames[i] = checkedItemsArray[i];
        }

        //fill probabilities vector
        for (int i = 0; i < crossoverCount; i++) {
          var cxNames = Enumerable.Where(crossoverNames, x => x.Index == i);

          if (Enumerable.Any(cxNames)) {
            var cxName = (string)Enumerable.Single(cxNames).Value.ItemName;
            if (operatorCount.Any(x => x.Key.Contains(cxName))) {
              int overallCount = operatorCount.Single(x => x.Key.Contains(cxName)).Value;
              int successCount = 0;

              if (successfulOperatorCount.Any(x => x.Key.Contains(cxName))) {
                successCount = successfulOperatorCount.Single(x => x.Key.Contains(cxName)).Value;
              }

              double ratio = successCount / (double)overallCount;
              if (ratio < MinimumOperatorUsageParameter.Value.Value) {
                ratio = MinimumOperatorUsageParameter.Value.Value;
              }
              ProbablilitiesParameter.ActualValue[i] = ratio;
            } else {
              ProbablilitiesParameter.ActualValue[i] = MinimumOperatorUsageParameter.Value.Value;
            }
          } else {
            ProbablilitiesParameter.ActualValue[i] = 0.0;
          }
        }
      }

      return base.Apply();
    }
  }
}